Product codes and parallel concatenated product codes

Tina D H Huang*, Chi Yuan Chang, Yan Xiu Zheng, Yu-Ted Su

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We study the decoding of product codes and a class of parallel concatenated product codes (PCPC). PCPC improves the minimum distance while retaining the merit of low decoding complexity of turbo product codes (TPC). We prove that using the Fibonacci interleaver does help increasing the minimum distance. The regularity of the interleaver also reduces the implementation complexity and makes parallel interleaving feasible. We show that Pyndiah's algorithm for decoding product codes produce an annealing effect similar to that of the so-called annealed belief propagation (ABP) algorithms which adjusts the "temperature" of an augmented cost surface. Decoding methods based on modified Pyndiah and annealed BCJR algorithms for both PC and PCPC are proposed and their performance is compared.

Original languageEnglish
Title of host publication2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
Pages94-99
Number of pages6
DOIs
StatePublished - 27 Nov 2007
Event2007 IEEE Wireless Communications and Networking Conference, WCNC 2007 - Kowloon, China
Duration: 11 Mar 200715 Mar 2007

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

Conference2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
CountryChina
CityKowloon
Period11/03/0715/03/07

Fingerprint Dive into the research topics of 'Product codes and parallel concatenated product codes'. Together they form a unique fingerprint.

Cite this