Efficient Low-Complexity Phase Noise Resistant Iterative Joint Phase Estimation and Decoding Algorithm

Andrey Kreimer, Dan Raphaeli

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we present a new low-complexity iterative joint phase estimation and decoding algorithm which can be applied to low-density-parity-check (or turbo) codes for channels affected by strong phase noise. The algorithm exhibits a very good performance and a very low complexity even in strong phase noise, high code rate, and high-order constellations. The proposed algorithm works by first obtaining a preliminary pilots-aided phase estimation. Next, the expressions for the belief propagation messages are approximated around that reference and reduced to a Gaussian canonical form. This results in a simple closed form of a recursive update. Simulations results for phase-shift-keying modulation of size 8 and quadrature-amplitude modulation of size 64 are presented and compared with other algorithms in the literature.

Original languageEnglish
Article number8347017
Pages (from-to)4199-4210
Number of pages12
JournalIEEE Transactions on Communications
Volume66
Issue number9
DOIs
StatePublished - Sep 2018

Keywords

  • Approximation methods
  • iterative methods
  • message passing
  • phase noise

Fingerprint

Dive into the research topics of 'Efficient Low-Complexity Phase Noise Resistant Iterative Joint Phase Estimation and Decoding Algorithm'. Together they form a unique fingerprint.

Cite this