An ICI reduction scheme for OFDM system with phase noise over fading channels

Orthogonal Frequency Division Multiplexing has become a key element of todays wireless communication systems. However, its sensitivity to oscillator phase noise is responsible for common phase error (CPE) and inter-carrier interference (ICI) which greatly degrades the overall system performance. In this contribution, we address the problem of reducing the effects of phase noise in an OFDM system operating over a frequency selective fading channel. We propose a method for jointly estimating the channel and CPE in a first step and removing ICI in a second step, using a power series expansion of the phase noise process. The algorithm is simulated on both coded and uncoded systems with phase noise over a fading channel.     

A phase noise mitigation scheme for MIMO WLANs with spatially correlated and imperfectly estimated channels

Applying multiple input multiple output (MIMO) technique to OFDM-based wireless local area networks (WLANs) promises impressive high capacity and spectral efficiency compared with conventional systems. However, similar to SISO-OFDM, MIMO-OFDM suffers significant performance degradation due to the presence of phase noise. Many methods have been developed to mitigate phase noise for a single antenna system with perfect channel estimation, whereas none has been proposed for correlated MIMO-OFDM scenarios. Therefore, in this letter, by using the phase noise correlation function, a new phase noise mitigation scheme is proposed for the general M/sub T//spl times/M/sub R/ MIMO WLANs system with channel estimation errors. Numerical results show that, compared with conventional approaches, the proposed scheme achieves significant performance gain with high spectral efficiency, requiring few pilots, and is robust to spatial correlation and channel estimation errors, which makes it very attractive for practical applications.     

ICI reduction scheme for OFDM system with phase noise over time‐varying channels

For mobile orthogonal frequency division multiplexing (OFDM) systems, time‐varying channels and random phase noise introduced by the oscillator result in severe intercarrier interference (ICI), respectively, and degrade the overall OFDM system performance. However, the existing ICI reduction methods only aim at a single interference source, i.e. either time‐varying channels or phase noise. Therefore, these methods are not suitable for the actual situation. In this paper, we analyze the spectral property of the transfer function composed of time‐varying channels and phase noise, and propose that the transfer function can be approximated by a finite parameter complex exponential basis expansion model (CE‐BEM). Then, a pilot‐aided minimum mean square error estimation is adopted to estimate the CE‐BEM coefficients in order to reconstruct the transfer function and reduce ICI. Finally, our simulation results show how the proposed scheme would improve the system performance in a time‐varying environment with phase noise. Copyright © 2008 John Wiley & Sons, Ltd.     

Signal space detection for recording channels with jitter noise

A delay-constrained sequence detector is considered for recording channels whose major impediments include intersymbol interference (ISI) and magnetic transition jitter noise. The jitter noise is data-dependent, and a given noise sample is correlated with neighboring noise samples. A sequence detector with a finite decision delay can be formulated in a finite dimensional vector space. For a correlated noise channel, the decision boundary is generally quadratic. We present a technique for obtaining a minimal set of hyperplanes approximating a quadratic decision boundary with a negligible performance loss. In this process, a distance measure, which is consistent with the notion of the effective SNR, is defined and used as a design parameter to trade the complexity and performance. As an achievable performance bound, we derive the effective SNR for the maximum-likelihood sequence detector (MLSD) for these channels. The performance of the partial response maximum likelihood (PRML) detector commonly adopted for current data storage channels as well as the Viterbi algorithm (VA) based on the traditional Euclidean metric, which serves as the MLSD for additive white Gaussian noise, are also analyzed and compared with that of the proposed signal space detector     

Worst-case power-constrained noise for binary-input channels

Additive noise channels with binary-valued inputs and real-valued outputs are considered. The maximum error probability and the minimum channel capacity achieved by any power-constrained noise distribution are obtained. A general framework which applies to a variety of performance measures shows that the least-favorable noise distribution is, in general, a mixture of two lattice probability mass functions. The framework holds for m-ary input constellations on finite-dimensional lattices.<>     

On joint estimation and decoding for channels with noise memory

In this letter we consider coded transmission over interference channels where the interference occurs in bursts and hence is considered to be impulsive. The bursty nature of the interference leads to memory in the overall noise process which is modeled as a 2-state Markov chain. Recent work on coded transmission for such channels has proposed decoding techniques assuming that perfect knowledge of the interference statistics are available at the receiver. In this work, we aim at completing the picture by proposing a novel algorithm that decodes without the knowledge of the interference statistics and highlighting the differences between the two cases.     

Optimal linear detectors for additive noise channels

In an attempt to gain insight into the design of linear detectors for additive white noise channels (discrete-time case), we describe several procedures, both optimal and suboptimal. Using the Wiener representation for nonlinear systems, we derive an ad hoc suboptimal design procedure. Exact designs are found when the noise amplitude's probability distribution is stable and when the noise is Laplacian. Considering all the linear detectors thus derived, no general form for the optimal linear detector's unit-sample response becomes apparent. Performance analyses and simulations indicate substantial performance losses occur when linear detectors are used instead of optimal (likelihood ratio) ones     

The effects of phase noise on trellis coded modulation overGaussian and fading channels

In this paper, error performance bounds are derived for 8-PSK trellis coded modulation (TCM) over Gaussian and fading channels in the presence of phase noise. Coherent demodulation combined with both phase-locked loop (PLL) and transparent tone in band technique (TTIB) for phase recovery is assumed. The analysis is then applied to a number of Ungerboeck 8-PSK trellis codes and the results for the bit error rate (BER) performance, obtained both analytically and by Monte Carlo simulation, are presented. The derived bounds can be directly extended to any M-PSK trellis code     

Improved sequence estimator for MPSK with carrier phase noise

An improved version of the sequence estimator for MPSK previously developed is presented. It is shown to have better bit error probability performance in the presence of carrier phase noise. This improvement comes from incorporating more channel memory into the trellis on which the estimator operates     

Mutual information in stationary channels with additive noise

A continuous time stationary channel with additive noise presented byY(t) = X(t) + Z(t)is considered, where{X(t)}and{Z(t)}are mutually independent stationary processes representing the channel input and the noise, respectively, and{Y(t)}represents the channel output. It is shown that, under some general assumptions, the mutual information between the input{ X(t); 0 leq t leq T }and the output{ Y(t); 0 leq t leq T }can be expressed in the formAT + B(T)with a constantAand a functionB(T)given in terms of the conditional mutual informations between the "past" and the "future" given the "present" of the output and the noise. It is also shown that the remainder termB(T)converges to a constant asTtends to infinity.     

Low-frequency noise and phase noise in MESFETS with LTG-GaAs passivation

We report measurements of the low-frequency noise and phase noise of conventional unpassivated GaAs metal semiconductor field-effect transistors (MESFETs) and of MESFETs fabricated using an overlapping-gate structure and the low-temperature grown (LTG) GaAs as a passivation layer. The noise of the LTG-GaAs passivated MESFET was found to behave quite differently from that of a conventional MESFET and to be significantly reduced at low offset frequencies. These observations are explained in terms of the surface passivating effect of the LTG-GaAs. Low-frequency noise measurements seem to support the idea that the LTG-GaAs passivation reduces the number of active traps, in particular traps with large activation emergies. These results indicate that LTG-GaAs passivation can substantially reduce the near-carrier phase noise of MESFET-based oscillators.     

Recursive algorithms for identification of impulse noise channels

The Class A Middleton model is a widely accepted statistical-physical parameteric model for impulsive interference superimposed on a Gaussian background. In the present work, a recursive decision-directed estimator for online identification of the parameters of the Class A model is proposed. This estimator is based on an adaptive Bayesian classification of each of a sequence of Class A envelope samples as an impulsive sample or as a background sample. As each sample is so classified, recursive updates of the estimates of the second moment of the background component of the interference envelope density, the second moment of the impulsive component of the interference envelope density, and the probability with which the impulsive component occurs, are readily obtained. From these estimates, estimates of the parameters of the Class A model follow straightforwardly, since closed-form expressions for the parameters exist in terms of these quantities. The performance characteristics of this algorithm are investigated and an appropriately modified version is found to yield a recursive algorithm with excellent global performance     

Nearest neighbor decoding for additive non-Gaussian noise channels

We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original channel. The results are presented for single-user channels as well as multiple-access channels, and are extended to fading channels with side information at the receiver     

相位噪声补偿新技术

文章介绍了两种补偿相位噪声的新技术,分别是补偿激光器相位噪声的数字前馈载波恢复算法和补偿非线性相位噪声的数字反向传播算法.其中数字前馈载波恢复算法能有效地提高能够容忍的激光器线宽;数字反向传播算法减少了非线性噪声,并能够大幅提高发射功率,以提高信噪比.     

A coding scheme for additive noise channels with feedback--II: Band-limited signals

In Part I of this paper, we presented a scheme for effectively exploiting a noiseless feedback link associated with an additive white Gaussian noise channel with {em no} signal bandwidth constraints. We now extend the scheme for this channel, which we shall call the wideband (WB) scheme, to a band-limited (BL) channel with signal bandwidth restricted to(- W, W). Our feedback scheme achieves the well-known channel capacity,C = W ln (1 +P_{u,v}/N_{0} W), for this system and, in fact, is apparently the first deterministic procedure for doing this. We evaluate the fairly simple exact error probability for our scheme and find that it provides considerable improvements over the best-known results (which are lower bounds on the performance of sphere-packed codes) for the one-way channel. We also study the degradation in performance of our scheme when there is noise in the feedback link.     

On diversity reception over fading channels with impulsive noise

In this paper, we analyze the performance of different diversity combining techniques over fading channels with impulsive noise. We use Middleton's Class A model for the noise distribution and adopt two noise models, which assume dependent and independent noise components on each branch. We systematically analyze the performance of maximum ratio combing (MRC), equal gain combining (EGC), selection combining (SC), and post-detection combining (PDC) under these impulsive noise models, and derive insightful lower and upper bounds. We show that even under impulsive noise, the diversity order is retained for each combining scheme. However, we also show that under both models, there is a fundamental tradeoff between diversity gain and coding gain. Under the independent noise model, PDC is shown to combat impulsive noise more effectively than MRC, EGC, and SC. Our simulation results also corroborate our analysis.     

Error probabilities on fading channels with intersymbolinterference and noise

Sums of infinite sequences of weighted binary random variables arise in communications problems involving signal-dependent interferences. In many cases of practical importance, the distribution functions of these sums are singular and often of Cantor type; they are continuous but do not have a density function. For this reason, special methods of calculating expectations are needed. Results of this type are derived. The method is used to compute error probabilities for differential detection of minimum shift keying, and for noncoherent detection of frequency shift keying. In each case the model assumed is a Rician fading channel     

Optimal ISI-free DMT transceivers for distorted channels withcolored noise

The design of optimal DMT transceivers for distorted channel with colored noise has been of great interest. Of particular interest is the class of block based DMT, where the transmitter and the receiver consist of constant matrices. Two types of block- based DMT transceivers are considered: the DMT system with zero padding (ZP-DMT) and the DMT system with general prefix (GP-DMT). We derive the bit allocation formula. For a given channel and channel noise spectrum, we design the ISI-free optimal transceiver that minimizes the transmission power for a given transmission rate and probability of error. For both ZP-DMT and GP-DMT systems, the optimal ISI-free transceiver can be given in closed from. We will see that for both classes, the optimal transceiver has an orthogonal transmitter. Simulation shows that the optimal DMT system can achieve the same transmission rate and the same probability of error with a much lower transmission power compared with other existing DMT systems     

Quantifying information rate increase by constrained codes for recording channels with media noise

The achievable information rates for magnetic recording channels with media noise, when constrained codes are employed, are computed. It is shown that higher information rates can be achieved by using specific constrained codes compared to the unconstrained system with independent identically distributed (i.i.d.) equiprobable binary inputs. The results are compared with the optimised information rates of such channels over general Markov inputs.     

Joint iterative decoding of LDPC codes for channels with memory and erasure noise

This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve, under joint iterative decoding, the symmetric information rate of a class of channels with memory and erasure noise. This gives proof, for the first time, that joint iterative decoding can be information rate lossless with respect to maximum-likelihood decoding. These results build on previous capacity-achieving code constructions for the binary erasure channel. A two state intersymbol-interference channel with erasure noise, known as the dicode erasure channel, is used as a concrete example throughout the paper.