On nested convolutional codes and their application to woven codes

Nested convolutional codes are a set of convolutional codes that is derived from a given generator matrix. The structural properties of nested convolutional codes and nested generator matrices are studied. A method to construct the set of all minimal (rational) generator matrices of a given convolutional code is presented. As an example, two different sets of nested convolutional codes are derived from two equivalent minimal generator matrices. The significant difference in their free-distance profiles emphasizes the importance of being careful when selecting the generator matrices that determine the nested convolutional codes. As an application of nested convolutional codes, woven codes with outer warp, and inner nested convolutional codes are considered. The free-distance profile of the inner generator matrix is shown to be an important design tool.

[1]  Rolf Johannesson,et al.  Woven convolutional codes I: Encoder properties , 2002, IEEE Trans. Inf. Theory.

[2]  T. Aaron Gulliver,et al.  A Link Between Quasi-Cyclic Codes and Convolutional Codes , 1998, IEEE Trans. Inf. Theory.

[3]  Martin Bossert,et al.  Generalized concatenation of convolutional codes , 1996, Eur. Trans. Telecommun..

[4]  Martin Bossert,et al.  Partitioning of convolutional codes using a convolutional scrambler , 1996 .

[5]  Ralph Jordan,et al.  Maximum slope convolutional codes , 2000, IEEE Transactions on Information Theory.

[6]  Daniel J. Costello,et al.  A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels , 1999, IEEE Trans. Inf. Theory.

[7]  Dwijendra K. Ray-Chaudhuri,et al.  A transform approach to permutation groups of cyclic codes over Galois rings , 2000, IEEE Trans. Inf. Theory.

[8]  A. Robert Calderbank,et al.  Minimal tail-biting trellises: The Golay code and more , 1999, IEEE Trans. Inf. Theory.

[9]  Ralph Jordan,et al.  Woven convolutional codes. II: decoding aspects , 2004, IEEE Transactions on Information Theory.

[10]  Yasuo Hirata,et al.  High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding , 1984, IEEE Trans. Commun..

[11]  B. Sundar Rajan,et al.  Abelian codes over Galois rings closed under certain permutations , 2003, IEEE Trans. Inf. Theory.

[12]  John L. Ramsey.  Realization of optimum interleavers , 1970, IEEE Trans. Inf. Theory.

[13]  Hideki Imai,et al.  A new multilevel coding method using error-correcting codes , 1977, IEEE Trans. Inf. Theory.

[14]  Rolf Johannesson,et al.  Active Distances for Convolutional Codes , 1999, IEEE Trans. Inf. Theory.

[15]  Bixio Rimoldi,et al.  A decomposition approach to CPM , 1988, IEEE Trans. Inf. Theory.

[16]  J. Bibb Cain,et al.  Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[17]  D. Graupe,et al.  Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding , 1979 .