In this paper, we introduce a low-complexity carrier phase estimation algorithm to be integrated into the data decoder of a turbo-coded modem employing a linear modulation. The estimator is based on a pseudo-maximum-likelihood approach and makes iterative use of soft decisions provided by the soft-in/soft-out decoders within the overall turbo-decoding scheme. In doing so, iterative decoding and carrier phase recovery go together iteration after iteration in a "soft decision-directed" mode. This allows performing reliable blind phase estimation and almost ideal coherent detection for values of the signal-to-noise ratio down to a few decibels only, and without the need to resort to narrowband phase-locked loops with large acquisition time. Performance in terms of mean estimated value, root mean-squared estimation error, and overall decoder bit-error rate as derived by simulation are also reported.
Embedding Carrier Phase Recovery into Iterative Decoding of Turbo-Coded Linear Modulations
LOTTICI, VINCENZO
Co-primo
Writing – Review & Editing
;LUISE, MARCOCo-primo
Writing – Review & Editing
2004-01-01
Abstract
In this paper, we introduce a low-complexity carrier phase estimation algorithm to be integrated into the data decoder of a turbo-coded modem employing a linear modulation. The estimator is based on a pseudo-maximum-likelihood approach and makes iterative use of soft decisions provided by the soft-in/soft-out decoders within the overall turbo-decoding scheme. In doing so, iterative decoding and carrier phase recovery go together iteration after iteration in a "soft decision-directed" mode. This allows performing reliable blind phase estimation and almost ideal coherent detection for values of the signal-to-noise ratio down to a few decibels only, and without the need to resort to narrowband phase-locked loops with large acquisition time. Performance in terms of mean estimated value, root mean-squared estimation error, and overall decoder bit-error rate as derived by simulation are also reported.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.