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

Andrey Kreimer; Dan Raphaeli

doi:10.1109/TCOMM.2018.2829865

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

Andrey Kreimer, Dan Raphaeli

School of Electrical Engineering

Tel Aviv University

Research output: Contribution to journal › Article › peer-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 language	English
Article number	8347017
Pages (from-to)	4199-4210
Number of pages	12
Journal	IEEE Transactions on Communications
Volume	66
Issue number	9
DOIs	https://doi.org/10.1109/TCOMM.2018.2829865
State	Published - Sep 2018

Keywords

Approximation methods
iterative methods
message passing
phase noise

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/TCOMM.2018.2829865

Cite this

@article{aa7c9af433d04a839e63ee5ce3d6c375,

title = "Efficient Low-Complexity Phase Noise Resistant Iterative Joint Phase Estimation and Decoding Algorithm",

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.",

keywords = "Approximation methods, iterative methods, message passing, phase noise",

author = "Andrey Kreimer and Dan Raphaeli",

note = "Publisher Copyright: {\textcopyright} 1972-2012 IEEE.",

year = "2018",

month = sep,

doi = "10.1109/TCOMM.2018.2829865",

language = "الإنجليزيّة",

volume = "66",

pages = "4199--4210",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

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

AU - Kreimer, Andrey

AU - Raphaeli, Dan

PY - 2018/9

Y1 - 2018/9

N2 - 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.

AB - 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.

KW - Approximation methods

KW - iterative methods

KW - message passing

KW - phase noise

UR - http://www.scopus.com/inward/record.url?scp=85046003000&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2018.2829865

DO - 10.1109/TCOMM.2018.2829865

M3 - مقالة

SN - 0090-6778

VL - 66

SP - 4199

EP - 4210

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 9

M1 - 8347017

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this