The Super-Trellis Structure of Turbo Codes
Breiling, M. and Hanzo, L. (2000) The Super-Trellis Structure of Turbo Codes. IEEE Transactions on Information Theory, 46, (6), 2212-2241.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (1281Kb) |
Description/Abstract
In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we can optimally decode simple turbo codes and compare the associated bit-error rate results to those of iterative algorithms. Index Terms—Code trellis, iterative decoding, MLSE decoding, turbo codes.
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control |
| Item ID: | 254459 |
| Date Deposited: | 12 Jan 2004 |
| Last Modified: | 14 Aug 2012 01:37 |
| Contributors: | Breiling, M. (Author) Hanzo, L. (Author) |
| Date: | September 2000 |
| Status: | Published |
| Further Information: | Google Scholar |
| ISI Citation Count: | 5 |
| URI: | http://eprints.soton.ac.uk/id/eprint/254459 |
Actions (login required)
 |
View Item |
