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 memor...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2005-09, Vol.23 (9), p.1707-1717
Main Authors: Chun-Hao Hsu, Anastasopoulos, A.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Approximation
Channel estimation
Channels
Complexity
Data analysis
Design engineering
Exact solutions
Frequency estimation
Iterative algorithms
Joint data detection and frequency estimation
Mathematical analysis
noncoherent channel
optimal receivers
Phase detection
Phase estimation
Phase frequency detector
polynomial complexity
Polynomials
Signal to noise ratio
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2005.853793