Code-Aided ML Ambiguity Resolution

Abstract— This paper deals with code-aided (CA) maximumlikelihood (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 ambiguityresolution algorithm has a complexity which is at most equal to the complexity of recently-proposed powerful ML-like ambiguityresolution methods. Finally, we compare through simulation results the ability of CA and conventional data-aided methods to resolve phase ambiguities.

• Type: Conference
• Year: 2007
• Where: ICC
• Authors: Cédric Herzet, Luc Vandendorpe
• Keywords: Communications, ICC 2007, ML Ambiguityresolution Algorithm, Timing Ambiguity Resolution, Tractable Complexity