Design and analysis of joint data detection and frequency/phase estimation algorithms

The problem of joint data detection and frequency/phase estimation is considered in this paper. The traditional belief regarding exact generalized-likelihood-based joint detection and estimation is that its complexity is exponential in the sequence length N. This belief is justified due to the memory imposed on the transmitted sequence by the lack of knowledge of the auxiliary channel parameters. In this paper, we show that the exact solution can be performed with O(N/sup 4/) worst case complexity regardless of the operating signal-to-noise ratio. The concepts used in the proof of the polynomial complexity result are also utilized to evaluate tight performance bounds on the exact and a family of approximate algorithms.

[1]  Umberto Mengali,et al.  Feedforward frequency estimation for PSK: A tutorial review , 1998, Eur. Trans. Telecommun..

[2]  Xiaoyong Yu,et al.  Innovations-based MLSE for Rayleigh fading channels , 1993, Proceedings of IEEE Pacific Rim Conference on Communications Computers and Signal Processing.

[3]  Stanley J. Simmons,et al.  Breadth-first trellis decoding with adaptive effort , 1990, IEEE Trans. Commun..

[4]  Costas N. Georghiades,et al.  The expectation-maximization algorithm for symbol unsynchronized sequence detection , 1991, IEEE Trans. Commun..

[5]  Achilleas Anastasopoulos,et al.  Polynomial-complexity noncoherent symbol-by-symbol detection with application to adaptive iterative decoding of turbo-like codes , 2003, IEEE Trans. Commun..

[6]  John G. Proakis,et al.  Digital Communications , 1983 .

[7]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  Ronald A. Iltis.  A Bayesian Maximum-Likelihood Sequence Estimation Algorithm for a priori Unknown Channels and Symbol Timing , 1992, IEEE J. Sel. Areas Commun..

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  John H. Lodge,et al.  Maximum likelihood sequence estimation of CPM signals transmitted over Rayleigh flat-fading channels , 1990, IEEE Trans. Commun..

[11]  Wim Sweldens.  Fast block noncoherent decoding , 2001, IEEE Communications Letters.

[12]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[13]  Kenneth M. Mackenthun,et al.  A fast algorithm for multiple-symbol differential detection of MPSK , 1994, IEEE Trans. Commun..

[14]  Monisha Ghosh,et al.  Maximum-likelihood blind equalization , 1991, Optics & Photonics.

[15]  Costas N. Georghiades,et al.  Sequence estimation in the presence of random parameters via the EM algorithm , 1997, IEEE Trans. Commun..

[16]  Achilleas Anastasopoulos,et al.  Pilot-symbol-assisted coded transmission over the block-noncoherent AWGN channel , 2003, IEEE Trans. Commun..

[17]  Marco Luise,et al.  Carrier frequency recovery in all-digital modems for burst-mode transmissions , 1995, IEEE Trans. Commun..

[18]  Umberto Mengali,et al.  Approximate ML decoding of coded PSK with no explicit carrier phase reference , 1994, IEEE Trans. Commun..

[19]  Riccardo Raheli,et al.  Per-Survivor Processing: a general approach to MLSE in uncertain environments , 1995, IEEE Trans. Commun..