Punctured recursive convolutional encoders and their applications in turbo codes

Author

Shen, Ba-Zhong ; Patapoutian, Ara ; McEwen, Peter A.

Author_Institution

Quantum Corp., Shrewsbury, MA, USA

Volume

47

Issue

6

fYear

2001

fDate

9/1/2001 12:00:00 AM

Firstpage

2300

Lastpage

2320

Abstract

Puncturing is the predominant strategy to construct high code rate convolutional encoders, and infinite impulse response (IIR) convolutional encoders are an essential building block in turbo codes. In this paper, various properties of convolutional encoders with these characteristics are developed. In particular the closed-form representation of a punctured convolutional encoder and its generator matrix is constructed, necessary and sufficient conditions are given such that the punctured encoders retain the IIR property, and various lower bounds on distance properties, such as effective free distance, are developed. Finally, necessary and sufficient conditions are given on the inverse puncturing problem: representing a known convolutional encoder as a punctured encoder

Keywords

bandlimited communication; binary codes; channel coding; convolutional codes; inverse problems; polynomial matrices; turbo codes; IIR convolutional encoders; bandlimited channel coding; closed-form representation; distance properties; effective free distance; generator matrix; high code rate convolutional encoders; infinite impulse response convolutional encoders; inverse puncturing problem; lower bounds; necessary and sufficient conditions; punctured convolutional encoder; punctured recursive convolutional encoders; turbo codes; Convolutional codes; Feedback; Finite impulse response filter; Information theory; Iterative decoding; Matrix decomposition; Polynomials; Sufficient conditions; Turbo codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.945249

Filename

945249