Low Complexity Multiple Concatenated Turbo Codes

Author

Bhise, Archana ; Vyavahare, P.D.

fYear

2006

fDate

20-23 Dec. 2006

Firstpage

580

Lastpage

584

Abstract

Original turbo codes are series or parallel combination of component codes (C. Berrou and A. Glavieure, 1996) (W. Graham, 2004). We present a new multiple concatenated turbo code construction comprising both series and parallel concatenations. Proper partitioning of message bits and the use of double binary rate 2/3 convolutional code reduces the complexity of decoder further. Simulation results demonstrate that the proposed code achieves good performance. The proposed code is easily adaptable to a large range of data block sizes.

Keywords

binary codes; computational complexity; concatenated codes; decoding; turbo codes; code construction; decoder complexity; double binary rate convolutional code; low complexity codes; multiple concatenated turbo codes; parallel concatenations; series concatenations; Concatenated codes; Convolutional codes; Costs; Decoding; Information technology; Linear feedback shift registers; Parity check codes; Turbo codes; Vectors; Iterative decoding; Log Likelihood Ratio(LLR); double binary convolutional code; recursive systematic convolutional code (RSC); turbo code(TC);

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Computing and Communications, 2006. ADCOM 2006. International Conference on

Conference_Location

Surathkal

Print_ISBN

1-4244-0716-8

Electronic_ISBN

1-4244-0716-8

Type

conf

DOI

10.1109/ADCOM.2006.4289958

Filename

4289958