A parallel iterative decoding algorithm for zero-tail and tail-biting convolutional codes

Author

Matsushima, Toshiyasu ; Matsushima, Tomoko K. ; Hirasawa, Shigeichi

Author_Institution

Waseda Univ., Tokyo, Japan

fYear

2003

fDate

29 June-4 July 2003

Firstpage

175

Abstract

This paper discusses the parallel propagation algorithm applied to the decoding of convolutional codes. The parallel algorithm surpasses the BCJR algorithm in parallel computational complexity and performance when it is applied to tail-biting codes. The complexity of iterative decoding algorithms depends on the calculation of posterior probability and bit error probability by using clique and number of iterations. The computational complexity of the parallel algorithm for tail-biting codes is almost the same as that for zero-tail convolutional codes.

Keywords

computational complexity; convolutional codes; error statistics; iterative decoding; BCJR algorithm; bit error probability; clique; computational complexity; parallel iterative decoding algorithm; parallel propagation algorithm; posterior probability; tail-biting convolutional code; zero-tail convolutional code; Algorithm design and analysis; Analytical models; Concurrent computing; Convolutional codes; Error probability; Iterative algorithms; Iterative decoding; Parallel algorithms; Performance analysis; Random variables;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2003. Proceedings. IEEE International Symposium on

Print_ISBN

0-7803-7728-1

Type

conf

DOI

10.1109/ISIT.2003.1228189

Filename

1228189