A logarithmic upper bound on the minimum distance of turbo codes
- 26 July 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (8) , 1692-1710
- https://doi.org/10.1109/tit.2004.831763
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.Keywords
This publication has 16 references indexed in Scilit:
- Coding theorems for turbo code ensemblesIEEE Transactions on Information Theory, 2002
- Combinatorial analysis of the minimum distance of turbo codesIEEE Transactions on Information Theory, 2001
- Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applicationsIEEE Journal on Selected Areas in Communications, 2001
- Upper bound on the minimum distance of turbo codesIEEE Transactions on Communications, 2001
- Rate one-half code for approaching the Shannonlimitby 0.1 dBElectronics Letters, 2000
- Rapid carrier acquisition from baud-rate samplesIEEE Transactions on Communications, 1999
- Unveiling turbo codes: some results on parallel concatenated coding schemesIEEE Transactions on Information Theory, 1996
- A distance spectrum interpretation of turbo codesIEEE Transactions on Information Theory, 1996
- Terminating the trellis of turbo-codesElectronics Letters, 1994
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977