Iterative code-aided ML phase estimation and phase ambiguity resolution

20Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As many coded systems operate at very low signal-to-noise ratios, synchronization becomes a very difficult task. In many cases, conventional algorithms will either require long training sequences or result in large BER degradations. By exploiting code properties, these problems can be avoided. In this contribution, we present several iterative maximum-likelihood (ML) algorithms for joint carrier phase estimation and ambiguity resolution. These algorithms operate on coded signals by accepting soft information from the MAP decoder. Issues of convergence and initialization are addressed in detail. Simulation results are presented for turbo codes, and are compared to performance results of conventional algorithms. Performance comparisons are carried out in terms of BER performance and mean square estimation error (MSEE). We show that the proposed algorithm reduces the MSEE and, more importantly, the BER degradation. Additionally, phase ambiguity resolution can be performed without resorting to a pilot sequence, thus improving the spectral efficiency. © 2005 Hindawi Publishing Corporation.

Cite

CITATION STYLE

APA

Wymeersch, H., & Moeneclaey, M. (2005). Iterative code-aided ML phase estimation and phase ambiguity resolution. Eurasip Journal on Applied Signal Processing, 2005(6), 981–988. https://doi.org/10.1155/ASP.2005.981

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free