DocumentCode :
393923
Title :
A comparison of low complexity turbo-like codes
Author :
Costello, Daniel J., Jr. ; Banerjee, Adrish ; He, Ching ; Massey, Peter C.
Author_Institution :
Dept. of Electr. Eng., Notre Dame Univ., IN, USA
Volume :
1
fYear :
2002
fDate :
3-6 Nov. 2002
Firstpage :
16
Abstract :
In the past few years, several approaches to low complexity turbo-like code designs have appeared. All of these code designs are based on very simple graph structures or 2-state trellises that result in low decoder complexity. One such approach is based on multiple turbo codes. The low complexity multiple turbo code designs are compared to 8-state turbo codes used in third generation mobile systems on the basis of error performance and computational complexity.
Keywords :
3G mobile communication; computational complexity; error statistics; graph theory; maximum likelihood decoding; trellis codes; turbo codes; 2-state trellises; 3GPP codes; 8-state turbo codes; MAP decoder; computational complexity; error performance; low complexity turbo-like codes; maximum a posteriori probability; multiple turbo codes; third generation mobile systems; Bit error rate; Computational complexity; Concatenated codes; Error correction; Error correction codes; Helium; Iterative decoding; Land mobile radio; Mobile computing; Turbo codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on
Conference_Location :
Pacific Grove, CA, USA
ISSN :
1058-6393
Print_ISBN :
0-7803-7576-9
Type :
conf
DOI :
10.1109/ACSSC.2002.1197142
Filename :
1197142
Link To Document :
بازگشت