Title :
Performance-complexity tradeoffs for turbo and turbo-like codes
Author :
Dolinar, Sam ; Divsalar, Dariush ; Kiely, Aaron ; Pollara, Fabrizio
Author_Institution :
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
Abstract :
We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes. For a set of turbo and turbo-like codes, we study this tradeoff, measuring the degree to which the coder/decoder fails to attain the sphere packing bound
Keywords :
AWGN channels; channel coding; computational complexity; turbo codes; coder/decoder; performance-complexity tradeoffs; sphere packing bound; turbo codes; turbo-like codes; AWGN; Costs; Iterative algorithms; Iterative decoding; Laboratories; Performance analysis; Propulsion; Size measurement; Space technology; Turbo codes;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935964
