Properties of Finite Response Input Sequences of Recursive Convolutional Codes

A recursive convolutional encoder can be regarded as an infinite impulse response system over the Galois Field of order 2. First, in this paper, we introduce finite response input sequences for recursive convolutional codes that give finite weight output sequences. In practice, we often need to describe the finite response sequence with a certain Hamming weight. Then, different properties of finite response input sequences are presented. It is shown that all finite response input sequences with a certain Hamming weight can be obtained in closed-form expressions from the so-called basic sequences. These basic sequences are presented for important recursive convolutional encoders and some possible applications are given.

[1]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[2]  Alain Glavieux,et al.  Pseudo-random recursive convolutional coding for near-capacity performance , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[3]  C. Berrou,et al.  Hamming distance spectra of turbo-codes , 1995 .

[4]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[5]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

[6]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.