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

Optimal scheduling for multiple serially concatenated codes

Fredrik Brännström (Institutionen för datorteknik) ; Lars K. Rasmussen ; Alex Grant
International Symposium on Turbo Codes and Related Topics, Brest, France, Sept. 2003 p. 383–-386. (2003)
[Konferensbidrag, refereegranskat]

In this paper an algorithm is proposed that finds the optimal activation schedule for the component decoders for iterative decoding of systems with three or more serially concatenated codes. It is optimal in terms of minimizing the total decoding complexity required to reach the convergence point. It is also demonstrated that the convergence threshold can be found by combining several three-dimensional extrinsic information transfer (EXIT) surfaces into one two-dimensional EXIT chart.

Nyckelord: Iterative decoding, multiple concatenated codes, optimal scheduling, EXIT charts



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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2006-08-25. Senast ändrad 2015-03-06.
CPL Pubid: 12834

 

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)

Ämnesområden

Informations- och kommunikationsteknik
Telekommunikationsteori

Chalmers infrastruktur