CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Convergence analysis and optimal scheduling for multiple concatenated codes

Fredrik Brännström (Institutionen för signaler och system, Kommunikationssystem) ; Lars K. Rasmussen ; Alex J. Grant
IEEE Transactions on Information Theory Vol. 51 (2005), 9, p. 3354–-3364.
[Artikel, refereegranskad vetenskaplig]

An interesting practical consideration for decoding of serial or parallel concatenated codes with more than two components is the determination of the lowest complexity component decoder schedule which results in convergence. This correspondence presents an algorithm that finds such an optimal decoder schedule. A technique is also given for combining and projecting a series of three-dimensional extrinsic information transfer (EXIT) functions onto a single two-dimensional EXIT chart. This is a useful technique for visualizing the convergence threshold for multiple concatenated codes and provides a design tool for concatenated codes with more than two components.

Nyckelord: EXIT chart, iterative decoding, multiple concatenated codes, optimal scheduling.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2006-09-12. Senast ändrad 2015-03-06.
CPL Pubid: 12829

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)