DocumentCode :
327309
Title :
Turbo code performance as a function of code block size
Author :
Dolinar, Sam ; Divsalar, Dariush ; Pollara, Fabrizio
Author_Institution :
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
fYear :
1998
fDate :
16-21 Aug 1998
Firstpage :
32
Abstract :
We show that a single family of turbo codes is “nearly perfect” with respect to Shannon´s (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the “imperfectness” of various non-turbo codes for comparison,
Keywords :
turbo codes; Shannon´s sphere-packing bound; code block size; code rates; convolutional code; imperfectness; nonturbo codes; performance; turbo codes; AWGN; Additive noise; Channel capacity; Concatenated codes; Convolutional codes; Interleaved codes; Laboratories; Maximum likelihood decoding; Propulsion; Turbo codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
Type :
conf
DOI :
10.1109/ISIT.1998.708612
Filename :
708612
Link To Document :
بازگشت