On the Free Distance of Convolutional Turbo Codes
A. Huebner, Kamil Sh. Zigangirov, Leesa Costello
Abstract
A. Huebner, Kamil Sh. Zigangirov, Leesa Costello
Abstract
The free distance of convolutional codes is the most important parameter determining their performance under good channel conditions. In this paper, we investigate the free distance properties of turbo-like codes generated by non-terminated convolutional encoders and convolutional permutors. In particular, we prove the existence of such codes whose free distance exhibits the same asymptotic growth rate in the permuter memory as block turbo codes in the permuter size
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The free distance of convolutional codes is the most important parameter determining their performance under good channel conditions. In this paper, we investigate the free distance properties of turbo-like codes generated by non-terminated convolutional encoders and convolutional permutors. In particular, we prove the existence of such codes whose free distance exhibits the same asymptotic growth rate in the permuter memory as block turbo codes in the permuter size
Key concepts: Turbo code, Convolutional code, Serial concatenated convolutional codes, Block code, Linear code, Concatenated error correction code, Computer science, Algorithm