Open Access

Construction and Iterative Decoding of LDPC Codes Over Rings for Phase-Noisy Channels

EURASIP Journal on Wireless Communications and Networking20082008:385421

DOI: 10.1155/2008/385421

Received: 1 November 2007

Accepted: 27 March 2008

Published: 3 April 2008

Abstract

This paper presents the construction and iterative decoding of low-density parity-check (LDPC) codes for channels affected by phase noise. The LDPC code is based on integer rings and designed to converge under phase-noisy channels. We assume that phase variations are small over short blocks of adjacent symbols. A part of the constructed code is inherently built with this knowledge and hence able to withstand a phase rotation of radians, where is the number of phase symmetries in the signal set, that occur at different observation intervals. Another part of the code estimates the phase ambiguity present in every observation interval. The code makes use of simple blind or turbo phase estimators to provide phase estimates over every observation interval. We propose an iterative decoding schedule to apply the sum-product algorithm (SPA) on the factor graph of the code for its convergence. To illustrate the new method, we present the performance results of an LDPC code constructed over with quadrature phase shift keying (QPSK) modulated signals transmitted over a static channel, but affected by phase noise, which is modeled by the Wiener (random-walk) process. The results show that the code can withstand phase noise of standard deviation per symbol with small loss.

Publisher note

To access the full article, please see PDF

Authors’ Affiliations

(1)
Institute for Telecommunications Research, University of South Australia

Copyright

© S. Karuppasami andW. G. Cowley. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.