A table-based reduced complexity sequential decoding algorithm

Author

Koorapaty, Havish ; Bitzer, Donald L. ; Dholakia, Ajay ; Vouk, Mladen A.

Author_Institution

Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA

fYear

1995

fDate

17-22 Sep 1995

Firstpage

227

Abstract

The table-based soft-decision convolutional decoding method presented here performs a reduced tree search as compared to the M-algorithm. The degree of tree-searching is adapted to the state of the channel by using a syndrome sequence and pre-computed information stored in a memory table. This results in a significant reduction in computational complexity while maintaining bit error rate performance comparable to the M-algorithm on a Rayleigh flat-fading channel

Keywords

Rayleigh channels; channel capacity; computational complexity; convolutional codes; error statistics; sequential decoding; tree searching; M-algorithm; Rayleigh flat-fading channel; computational complexity; convolutional decoding method; information bit error rate performance; memory table; reduced complexity algorithm; sequential decoding algorithm; syndrome sequence; table-based soft-decision decoding; tree-searching; Bit error rate; Computational complexity; Computer science; Convolutional codes; Decoding; Detectors; Interleaved codes; Parity check codes; Tail; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Conference_Location

Whistler, BC

Print_ISBN

0-7803-2453-6

Type

conf

DOI

10.1109/ISIT.1995.535742

Filename

535742