7,002 research outputs found

    Channel, Phase Noise, and Frequency Offset in OFDM Systems: Joint Estimation, Data Detection, and Hybrid Cramer-Rao Lower Bound

    Full text link
    Oscillator phase noise (PHN) and carrier frequency offset (CFO) can adversely impact the performance of orthogonal frequency division multiplexing (OFDM) systems, since they can result in inter carrier interference and rotation of the signal constellation. In this paper, we propose an expectation conditional maximization (ECM) based algorithm for joint estimation of channel, PHN, and CFO in OFDM systems. We present the signal model for the estimation problem and derive the hybrid Cramer-Rao lower bound (HCRB) for the joint estimation problem. Next, we propose an iterative receiver based on an extended Kalman filter for joint data detection and PHN tracking. Numerical results show that, compared to existing algorithms, the performance of the proposed ECM-based estimator is closer to the derived HCRB and outperforms the existing estimation algorithms at moderate-to-high signal-to-noise ratio (SNR). In addition, the combined estimation algorithm and iterative receiver are more computationally efficient than existing algorithms and result in improved average uncoded and coded bit error rate (BER) performance

    Receiver Architectures for MIMO-OFDM Based on a Combined VMP-SP Algorithm

    Get PDF
    Iterative information processing, either based on heuristics or analytical frameworks, has been shown to be a very powerful tool for the design of efficient, yet feasible, wireless receiver architectures. Within this context, algorithms performing message-passing on a probabilistic graph, such as the sum-product (SP) and variational message passing (VMP) algorithms, have become increasingly popular. In this contribution, we apply a combined VMP-SP message-passing technique to the design of receivers for MIMO-ODFM systems. The message-passing equations of the combined scheme can be obtained from the equations of the stationary points of a constrained region-based free energy approximation. When applied to a MIMO-OFDM probabilistic model, we obtain a generic receiver architecture performing iterative channel weight and noise precision estimation, equalization and data decoding. We show that this generic scheme can be particularized to a variety of different receiver structures, ranging from high-performance iterative structures to low complexity receivers. This allows for a flexible design of the signal processing specially tailored for the requirements of each specific application. The numerical assessment of our solutions, based on Monte Carlo simulations, corroborates the high performance of the proposed algorithms and their superiority to heuristic approaches

    Soft metrics and their Performance Analysis for Optimal Data Detection in the Presence of Strong Oscillator Phase Noise

    Get PDF
    In this paper, we address the classical problem of maximum-likelihood (ML) detection of data in the presence of random phase noise. We consider a system, where the random phase noise affecting the received signal is first compensated by a tracker/estimator. Then the phase error and its statistics are used for deriving the ML detector. Specifically, we derive an ML detector based on a Gaussian assumption for the phase error probability density function (PDF). Further without making any assumptions on the phase error PDF, we show that the actual ML detector can be reformulated as a weighted sum of central moments of the phase error PDF. We present a simple approximation of this new ML rule assuming that the phase error distribution is unknown. The ML detectors derived are also the aposteriori probabilities of the transmitted symbols, and are referred to as soft metrics. Then, using the detector developed based on Gaussian phase error assumption, we derive the symbol error probability (SEP) performance and error floor analytically for arbitrary constellations. Finally we compare SEP performance of the various detectors/metrics in this work and those from literature for different signal constellations, phase noise scenarios and SNR values

    Doctor of Philosophy

    Get PDF
    dissertationMultiple-input and multiple-output (MIMO) technique has emerged as a key feature for future generations of wireless communication systems. It increases the channel capacity proportionate to the minimum number of transmit and receive antennas. This dissertation addresses the receiver design for high-rate MIMO communications in at fading environments. The emphasis of the thesis is on the cases where channel state information (CSI) is not available and thus, clever channel estimation algorithms have to be developed to bene t from the maximum available channel capacity. The thesis makes four distinct novel contributions. First, we note that the conventional MCMC-MIMO detector presented in the prior work may deteriorate as SNR increases. We suggest and show through computer simulations that this problem to a great extent can be solved by initializing the MCMC detector with regulated states which are found through linear detectors. We also introduce the novel concept of staged-MCMC in a turbo receiver, where we start the detection process at a lower complexity and increase complexity only if the data could not be correctly detected in the present stage of data detection. Second, we note that in high-rate MIMO communications, joint data detection and channel estimation poses new challenges when a turbo loop is used to improve the quality of the estimated channel and the detected data. Erroneous detected data may propagate in the turbo loop and, thus, degrade the performance of the receiver signi cantly. This is referred to as error propagation. We propose a novel receiver that decorrelates channel estimation and the detected data to avoid the detrimental e ect of error propagation. Third, the dissertation studies joint channel estimation and MIMO detection over a continuously time-varying channel and proposes a new dual-layer channel estimator to overcome the complexity of optimal channel estimators. The proposed dual-layer channel estimator reduces the complexity of the MIMO detector with optimal channel estimator by an order of magnitude at a cost of a negligible performance degradation, on the order of 0.1 to 0.2 dB. The fourth contribution of this dissertation is to note that the Wiener ltering techniques that are discussed in this dissertation and elsewhere in the literature assume that channel (time-varying) statistics are available. We propose a new method that estimates such statistics using the coarse channel estimates obtained through pilot symbols. The dissertation also makes an additional contribution revealing di erences between the MCMC-MIMO and LMMSE-MIMO detectors. We nd that under the realistic condition where CSI has to be estimated, hence the available channel estimate will be noisy, the MCMC-MIMO detector outperforms the LMMSE-MIMO detector with a signi cant margin

    Blind deconvolution of sparse pulse sequences under a minimum distance constraint: a partially collapsed Gibbs sampler method

    Get PDF
    For blind deconvolution of an unknown sparse sequence convolved with an unknown pulse, a powerful Bayesian method employs the Gibbs sampler in combination with a Bernoulli–Gaussian prior modeling sparsity. In this paper, we extend this method by introducing a minimum distance constraint for the pulses in the sequence. This is physically relevant in applications including layer detection, medical imaging, seismology, and multipath parameter estimation. We propose a Bayesian method for blind deconvolution that is based on a modified Bernoulli–Gaussian prior including a minimum distance constraint factor. The core of our method is a partially collapsed Gibbs sampler (PCGS) that tolerates and even exploits the strong local dependencies introduced by the minimum distance constraint. Simulation results demonstrate significant performance gains compared to a recently proposed PCGS. The main advantages of the minimum distance constraint are a substantial reduction of computational complexity and of the number of spurious components in the deconvolution result
    • 

    corecore