DocumentCode
3015944
Title
On the ensemble performance of turbo codes
Author
Telatar, Emre ; Urbanke, Rüdiger
Author_Institution
Bell Labs., Murray Hill, NJ, USA
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
105
Abstract
We derive the ensemble weight enumeration function of turbo-codes, where the ensemble is generated by a uniform choice over the interleaver and a uniform choice over the component codes from the set of time-varying recursive convolutional codes. This reduces the study of the performance of turbo-codes to a two parameter family, namely the interleaving length N (which determines the delay and the memory requirements) and the memory length m (which determines the complexity)
Keywords
concatenated codes; convolutional codes; interleaved codes; component codes; ensemble performance; ensemble weight enumeration function; interleaver; interleaving length; memory length; parallel concatenated convolutional codes; time-varying recursive convolutional codes; turbo codes; AWGN channels; Aging; Convolutional codes; Delay; Error probability; Interleaved codes; Random variables; Shift registers; Turbo codes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613020
Filename
613020
Link To Document