Decoding of codes based on their tailbiting trellises

Author

Shao, Rose Y. ; Lin, Shu ; Fossorier, Marc P C

Author_Institution

Quantum Corp., Shrewsbury, MA, USA

fYear

2000

fDate

2000

Firstpage

342

Abstract

A tailbiting trellis for a code is a trellis with multiple starting and multiple ending states. Each starting state corresponds to a unique ending state and they are the same state. A path in a tailbiting trellis represents a valid codeword if and only if it starts from a state and ends at the same state. Such a path is called a tailbiting path. In this paper, two new iterative algorithms for decoding codes based on their tailbiting trellises are presented, one is unidirectional and the other is bidirectional. Both algorithms are computationally efficient and achieves virtually optimum error performance with a small number of decoding iterations

Keywords

Viterbi decoding; block codes; convolutional codes; iterative decoding; trellis codes; Viterbi decoding; bidirectional algorithm; computationally efficient algorithms; iterative decoding; multiple ending states; multiple starting states; optimum error performance; tailbiting path; tailbiting trellis; unidirectional algorithm; Collaborative work; Iterative algorithms; Iterative decoding; State-space methods; Tail; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2000. Proceedings. IEEE International Symposium on

Conference_Location

Sorrento

Print_ISBN

0-7803-5857-0

Type

conf

DOI

10.1109/ISIT.2000.866640

Filename

866640