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.
['Chun-Hao Hsu', 'Achilleas Anastasopoulos']
Design and analysis of joint data detection and frequency/phase estimation algorithms