20 research outputs found
Estimation of phase noise in oscillators with colored noise sources
In this letter we study the design of algorithms for estimation of phase
noise (PN) with colored noise sources. A soft-input maximum a posteriori PN
estimator and a modified soft-input extended Kalman smoother are proposed. The
performance of the proposed algorithms are compared against those studied in
the literature, in terms of mean square error of PN estimation, and symbol
error rate of the considered communication system. The comparisons show that
considerable performance gains can be achieved by designing estimators that
employ correct knowledge of the PN statistics
Iterative joint channel and data estimation for rank-deficient MIMO-OFDM
In this paper we propose a turbo-detected multi-antenna-multi-carrier receiver scheme. Following the philosophy of the turbo processing, our turbo MIMO-OFDM receiver comprises a succession of detection modules, namely the channel estimator, the space-time detector and the decoder, which iteratively exchange soft bit-related information and thus facilitate a substantial improvement of the overall system performance. In this paper we analyze the achievable performance of the iterative system proposed with the aim of documenting the various design trade-offs, such as the achievable error-rate performance, the attainable data-rate as well as the associated computational complexity. Specifically, we report a virtually error-free performance for a rate-1/2 turbo-coded 8x8-QPSK-OFDM system, exhibiting an effective throughput of 8*2/2=8 bits/sec/Hz and having a pilot overhead of only 10%, at SNR of 7.5dB and normalized Doppler frequency of 0.003, which corresponds to a mobile terminal speed of about 65 km/h
A Robust Threshold for Iterative Channel Estimation in OFDM Systems
A novel threshold computation method for pilot symbol assisted iterative channel estimation in OFDM systems is considered. As the bits are transmitted in packets, the proposed technique is based on calculating a particular threshold for each data packet in order to select the reliable decoder output symbols to improve the channel estimation performance. Iteratively, additional pilot symbols are established according to the threshold and the channel is re-estimated with the new pilots inserted to the known channel estimation pilot set. The proposed threshold calculation method for selecting additional pilots performs better than non-iterative channel estimation, no threshold and fixed threshold techniques in poor HF channel simulations
Soft-Decision-Driven Channel Estimation for Pipelined Turbo Receivers
We consider channel estimation specific to turbo equalization for
multiple-input multiple-output (MIMO) wireless communication. We develop a
soft-decision-driven sequential algorithm geared to the pipelined turbo
equalizer architecture operating on orthogonal frequency division multiplexing
(OFDM) symbols. One interesting feature of the pipelined turbo equalizer is
that multiple soft-decisions become available at various processing stages. A
tricky issue is that these multiple decisions from different pipeline stages
have varying levels of reliability. This paper establishes an effective
strategy for the channel estimator to track the target channel, while dealing
with observation sets with different qualities. The resulting algorithm is
basically a linear sequential estimation algorithm and, as such, is
Kalman-based in nature. The main difference here, however, is that the proposed
algorithm employs puncturing on observation samples to effectively deal with
the inherent correlation among the multiple demapper/decoder module outputs
that cannot easily be removed by the traditional innovations approach. The
proposed algorithm continuously monitors the quality of the feedback decisions
and incorporates it in the channel estimation process. The proposed channel
estimation scheme shows clear performance advantages relative to existing
channel estimation techniques.Comment: 11 pages; IEEE Transactions on Communications 201
Linear MMSE-Optimal Turbo Equalization Using Context Trees
Formulations of the turbo equalization approach to iterative equalization and
decoding vary greatly when channel knowledge is either partially or completely
unknown. Maximum aposteriori probability (MAP) and minimum mean square error
(MMSE) approaches leverage channel knowledge to make explicit use of soft
information (priors over the transmitted data bits) in a manner that is
distinctly nonlinear, appearing either in a trellis formulation (MAP) or inside
an inverted matrix (MMSE). To date, nearly all adaptive turbo equalization
methods either estimate the channel or use a direct adaptation equalizer in
which estimates of the transmitted data are formed from an expressly linear
function of the received data and soft information, with this latter
formulation being most common. We study a class of direct adaptation turbo
equalizers that are both adaptive and nonlinear functions of the soft
information from the decoder. We introduce piecewise linear models based on
context trees that can adaptively approximate the nonlinear dependence of the
equalizer on the soft information such that it can choose both the partition
regions as well as the locally linear equalizer coefficients in each region
independently, with computational complexity that remains of the order of a
traditional direct adaptive linear equalizer. This approach is guaranteed to
asymptotically achieve the performance of the best piecewise linear equalizer
and we quantify the MSE performance of the resulting algorithm and the
convergence of its MSE to that of the linear minimum MSE estimator as the depth
of the context tree and the data length increase.Comment: Submitted to the IEEE Transactions on Signal Processin
Algorithms for Joint Phase Estimation and Decoding for MIMO Systems in the Presence of Phase Noise and Quasi-Static Fading Channels
In this work, we derive the maximum a posteriori (MAP) symbol detector for a multiple-input multiple-output system in the presence of Wiener phase noise due to noisy local oscillators. As in single-antenna systems, the computation of the optimum receiver is an analytically intractable problem and is unimplementable in practice. In this purview, we propose three suboptimal, low-complexity algorithms for approximately implementing the MAP symbol detector, which involve joint phase noise estimation and data detection. Our first algorithm is obtained by means of the sum-product algorithm, where we use the multivariate Tikhonov canonical distribution approach. In our next algorithm, we derive an approximate MAP symbol detector based on the smoother-detector framework, wherein the detector is properly designed by incorporating the phase noise statistics from the smoother. The third algorithm is derived based on the variational Bayesian framework. By simulations, we evaluate the performance of the proposed algorithms for both uncoded and coded data transmissions, and we observe that the proposed techniques significantly outperform the other important algorithms from prior works, which are considered in this work. Index Terms – Maximum a posteriori (MAP) detection, phase noise, sum-product algorithm (SPA), variational Bayesian (VB) framework, extended Kalman smoother (EKS), MIMO