By Topic

Product Codes and Parallel Concatenated Product Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Huang, T.D.-H. ; Dept. of Commun. Eng., National Chiao Tung Univ., Hsinchu ; Chi-Yuan Chang ; Yan-Xiu Zheng ; Su, Yu.T.

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.

Published in:

Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE

Date of Conference:

11-15 March 2007