A logarithmic upper bound on the minimum distance of turbo codes

Authors:
M. Breiling
Affiliations:
Lehrstuhl fur Nachrichtentechnik, Univ. Erlangen-Nurnberg, Erlangen, Germany
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Some Results Concerning the Design and Decoding of Turbo-Codes

Problems of Information Transmission
The minimum distance of turbo-like codes

IEEE Transactions on Information Theory
Optimal puncturing ratios and energy allocation for multiple parallel concatenated codes

IEEE Transactions on Information Theory
Capacity-approaching irregular turbo codes for the binary erasure channel

IEEE Transactions on Communications
Distance spectrum analysis of third generation turbo codes

ELECTROSCIENCE'05 Proceedings of the 5th WSEAS international conference on Applied electromagnetics, wireless and optical communications

Quantified Score

Hi-index	754.96

Visualization

Abstract

We derive new upper bounds on the minimum distance, which turbo codes can maximally attain with the optimum interleaver of a given length. The new bounds grow approximately logarithmically with the interleaver length, and they are tighter than all previously derived bounds for medium-length and long interleavers. An extensive discussion highlights the impacts of the new bounds in the context of interleaver design and provides some new design guidelines.