Optimal Puncturing Ratios and Energy Allocation for Multiple Parallel Concatenated Codes
Journal article, 2009

We propose a systematic design framework for optimal, low-complexity punctured multiple parallel concatenated codes (MPCCs), based on minimizing the convergence threshold using extrinsic information transfer (EXIT) charts. As the convergence threshold is related to the area between the two EXIT curves, the corresponding optimization problem is equivalent to a curve-fitting problem. The EXIT curves are determined by the respective EXIT functions of the constituents, which can be conveniently shaped through the use of random puncturing and unequal energy allocations across parallel coding streams. The design task is therefore to find the optimal combination of constituents, puncturing ratios, and energy allocation for matching the EXIT curves. A search over all rate-one convolutional codes of memory length four or less is performed, identifying 98 classes of codes with unique EXIT functions out of a total of 310 codes. Low-complexity MPCCs with up to four constituents are found, where the convergence thresholds are observed to be within 0.1 dB or less of the fundamental minimum signal-to-noise ratio (SNR) corresponding to the binary phase-shift keying (BPSK) capacity for code rates 1/3 <= R <= 7/8. Further allowing for unequal energy allocation, the convergence thresholds for lower code rates are similarly improved.

parity-check codes

Code search

extrinsic information transfer (EXIT)

iterative decoding

parallel concatenated codes

energy allocation

chart

puncturing

design

turbo-codes

Author

Fredrik Brännström

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

Lars K. Rasmussen

Royal Institute of Technology (KTH)

University of South Australia

Alex J. Grant

University of South Australia

IEEE Transactions on Information Theory

0018-9448 (ISSN) 1557-9654 (eISSN)

Vol. 55 5 2062-2077

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

DOI

10.1109/TIT.2009.2015997

More information

Latest update

2/26/2018