A modified Bahl algorithm for recursive systematic convolutional codes on Rayleigh fading channels

Author

Turner, I. Leon

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

Volume

1

fYear

1999

fDate

36342

Firstpage

75

Abstract

The Bahl algorithm (1974) is a maximum a posteriori (MAP) decoding method for linear codes which minimizes the bit error probability by estimating the a posteriori probabilities (APP) of the states and transitions of a Markov source observed through a discrete memoryless channel. A modified version of the Bahl algorithm was presented by Berrou, Glavieux and Thitimajshima (1993) for iteratively decoding turbo codes for the additive white Gaussian noise channel. In this paper we consider MAP decoding of turbo codes using the Bahl algorithm for a memoryless Rayleigh fading channel

Keywords

Rayleigh channels; binary codes; convolutional codes; error statistics; maximum likelihood decoding; memoryless systems; turbo codes; MAP decoding method; Markov source; a posteriori probabilities; binary codes; bit error probability; channel model; discrete memoryless channel; maximum a posteriori decoding; memoryless Rayleigh fading channel; modified Bahl algorithm; recursive systematic convolutional codes; turbo codes; Additive white noise; Convolutional codes; Error probability; Fading; Iterative algorithms; Iterative decoding; Linear code; Memoryless systems; State estimation; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 1999 IEEE 49th

Conference_Location

Houston, TX

ISSN

1090-3038

Print_ISBN

0-7803-5565-2

Type

conf

DOI

10.1109/VETEC.1999.778021

Filename

778021