Interleaver pruning for construction of variable-length turbo codes

• Published in: IEEE transactions on information theory Vol. 50; no. 3; pp. 455 - 467
• Main Authors: Daneshgaran, F., Mulassano, P.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2004; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: 3G mobile communication; Block codes; Codes; Concatenated codes; Convolution; Convolutional codes; Delay; Hardware; Information systems; Joining processes; Quality of service; Turbo codes
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2004.824914

In this paper, we address the issue of pruning (i.e., shortening) a given interleaver in a parallel concatenated convolutional code (PCCC). The principle goal of pruning is that of construction of variable-length and hence delay interleavers with application to PCCC, using the same structure (possibly in hardware) of the interleaver and deinterleaver units. As a side benefit, it is sometimes possible to reduce the interleaver length and hence delay for nearly the same and sometimes even better asymptotic performance. In particular, we present a systematic technique for interleaver pruning and demonstrate the average optimality of the strategy. Sample simulation results are presented confirming the average optimality of the proposed scheme.