Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods
✍ Scribed by Crozier, Stewart ;Guinand, Paul ;Hunt, Andrew
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 185 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1124-318X
- DOI
- 10.1002/ett.1185
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compares a number of recent distance estimation techniques and introduces a new approach, based on using specific event impulse patterns and iterative processing, that is specifically tailored to handle long interleavers with high spread. The new method is as reliable as two previous iterative multiple‐impulse methods, but with much lower complexity. A minimum distance of 60 has been estimated for a rate 1/3, 8‐state, turbo code with a dithered relative prime (DRP) interleaver of length K = 65 536. Copyright © 2007 John Wiley & Sons, Ltd.