Download:
by Alberto Perotti, Sergio Benedetto
http://commgroup.polito.it/personal/perotti/pubs/dmin-ub.pdf
Add To MetaCart
Abstract:
IEEE Abstract — In this paper, a new upper bound on the minimum distance of turbo codes is derived. The new bound is obtained by construction of an undirected graph which reflects the characteristics of the constituent codes and the interleaver. The resulting expression shows that the minimum distance of a turbo code grows approximately with the base-3 logarithm of the information word length. The new bound is easy to compute, applies to rate k0/n0 constituent encoders, and often improves over existing results. Index Terms — Minimum distance, performance bounds, permutation graphs, turbo codes.
Citations
|
788
|
Near Shannon limit error-correcting coding and decoding: turbo codes
– Berrou, Glavieux, et al.
- 1993
|
|
162
|
Unveiling turbo codes: Some results on parallel concatenated coding schemes
– Benedetto, Montorsi
- 1996
|
|
161
|
Serial Concatenation of Interleaved Codes: Performance Analysis
– Benedetto, Divsalar, et al.
- 1996
|
|
70
|
Weight Distribution for Turbo Codes Using Random and Nonrandom Permutations
– Dolinar, Divsalar
- 1995
|
|
25
|
On the minimum distance of parallel and serial concatenated codes
– Kahale, Urbanke
- 1998
|
|
22
|
Permutation graphs and transitive graphs
– Even, Pnueli, et al.
- 1972
|
|
21
|
Constructions for cubic graphs with large girth
– Biggs
- 1998
|
|
20
|
Turbo Encoder Design for Symbol Interleaved Parallel Concatenated Trellis Coded Modulation
– Fragouli, Wesel
|
|
18
|
A logarithmic upper bound on the minimum distance of turbo codes
– Breiling
- 2001
|
|
17
|
Tilborg, “A connection between block and convolutional codes
– Solomon, van
- 1979
|
|
15
|
Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications
– Garello, Pierleoni, et al.
- 2001
|
|
13
|
The minimum distance of turbo-like codes
– Bazzi, Mahdian, et al.
- 2001
|
|
7
|
Some results concerning design and decoding of turbo-codes
– Truhachev, Lentmaier, et al.
- 2001
|
|
6
|
The advantages of non-binary turbo codes
– Berrou, Jézéquel, et al.
- 2001
|
|
4
|
On the construction of turbo code interleavers based on graphs with large girth
– Vontobel
- 2002
|
|
4
|
analysis of the minimum distance of turbo codes
– “Combinatorial
- 2001
|
