Turbo decoding with tail-biting trellises

Author

Weiss, C. ; Bettstetter, C. ; Riedel, S. ; Costello, D.J., Jr

Author_Institution

Inst. for Commun. Eng., Tech. Univ. Munchen, Germany

fYear

1998

fDate

2-2 Oct. 1998

Firstpage

343

Lastpage

348

Abstract

Tail-biting codes are considered as component codes for parallel concatenated block codes. Based on the two-dimensional weight distribution of tail-biting codes, we calculate the minimum distance of the parallel concatenated code and give guidelines on how to choose good tail-biting component codes. We show how to encode tail-biting codes using systematic feedback encoders, which is an important design criterion. The performance of codes with different rate, length, and complexity using iterative (turbo) decoding is evaluated by simulation.

Keywords

block codes; computational complexity; concatenated codes; feedback; iterative decoding; trellis codes; turbo codes; code complexity; code length; code rate; component codes; design criterion; iterative decoding; minimum distance; parallel concatenated block codes; performance; simulation; systematic feedback encoders; tail-biting codes; tail-biting trellises; two-dimensional weight distribution; Block codes; Carbon capture and storage; Concatenated codes; Convolution; Convolutional codes; Degradation; Feedback; Guidelines; Iterative decoding; Protection;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems, and Electronics, 1998. ISSSE 98. 1998 URSI International Symposium on

Conference_Location

Pisa, Italy

Print_ISBN

0-7803-4900-8

Type

conf

DOI

10.1109/ISSSE.1998.738095

Filename

738095