Divsalar, D. and McEliece, R. J. (1996) Effective free distance of turbo codes. Electronics Letters, 32 (5). pp. 445-446. ISSN 0013-5194 http://resolver.caltech.edu/CaltechAUTHORS:20120131-132952348
Full text not available from this repository.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120131-132952348
The authors define and study the effective free distance of a turbo code. If a turbo code is constructed from a number of component codes, they argue that the effective free distance can be maximised by choosing the component codes to be IIR convolutional code fragments with maximal input weight-2 free distance. They then present some theoretical bounds for, and some numerical tables of; IIR code fragments with maximal input weight-2 free distance.
|Additional Information:||© 1996 The Institution of Engineering and Technology. The authors thank S.W. Golomb for his help in the derivation of Theorem 2. The research described in this paper was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under contract with the National Aeronautics and Space Administration. McEliece’s contribution was also partially supported by NSF grant no. NCR-9505975 and a grant from Pacific Bell.|
|Subject Keywords:||effective free distance, turbo codes, IIR convolutional code, maximal input weight-2|
|Official Citation:||Effective free distance of turbo codes D. Divsalar and R.J. McEliece, Electron. Lett. 32, 445 (1996), DOI:10.1049/el:19960321|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||24 Feb 2012 23:18|
|Last Modified:||24 Feb 2012 23:18|
Repository Staff Only: item control page