Published November 1995
| public
Book Section - Chapter
Performance Analysis of Turbo Codes
Chicago
Abstract
In this paper we apply transfer function bounding techniques to obtain upper bounds on the bit error rate for maximum likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation results. The bounds are useful in estimating the "error floor" that is difficult to measure by simulation, and they provide insights on how to lower this floor. More refined bounds are needed for accurate performance measures at lower signal-to-noise ratios.
Additional Information
© 1995 IEEE. Nov 1995. 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.Additional details
- Eprint ID
- 29333
- Resolver ID
- CaltechAUTHORS:20120216-101442622
- NASA
- Created
-
2012-02-16Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5255694