Code-aided ML ambiguity resolution
(2008) 2007 IEEE International Conference on Communications — Location: Glasgow, UK (24.June.2007)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- This paper deals with code-aided (CA) maximum-likelihood (ML) phase and timing ambiguity resolution. We propose a methodology based on the sum-product algorithm (SPA) to exactly solve this problem with a tractable complexity. In particular, we emphasize that the proposed ML ambiguity-resolution algorithm has a complexity which is at most equal to the complexity of recently-proposed powerful ML-like ambiguity-resolution methods. Finally, we compare through simulation results the ability of CA and conventional data-aided methods to resolve phase ambiguities.
- Affiliations
Citations
Herzet, C., & Vandendorpe, L. (2008). Code-aided ML ambiguity resolution. 2007 IEEE International Conference on Communications, 2900-2905. https://hdl.handle.net/2078.5/230364