MAP symbol decoding in channels with error bursts

Author

Turin, William

Author_Institution

Shannon Lab., AT&T Labs.-Res., Florham Park, NJ, USA

Volume

47

Issue

5

fYear

2001

fDate

7/1/2001 12:00:00 AM

Firstpage

1832

Lastpage

1838

Abstract

We analyze the forward-backward algorithm for the maximum a posteriori (MAP) decoding of information transmitted over channels with memory and propose a suboptimal forward-only algorithm. We assume that both the information source and channel are described using hidden Markov models (HMMs). The algorithm lends itself to parallel implementation and pipelining. We apply the algorithm to MAP decoding of symbols which were trellis-code modulated and transmitted over channels with error bursts

Keywords

block codes; decoding; delays; hidden Markov models; optimisation; telecommunication channels; trellis coded modulation; trellis codes; MAP symbol decoding; TCM systems; approximate fixed-lag algorithm; block codes; decoding delay; error burst channels; forward-backward algorithm; forward-only algorithm; hidden Markov models; information source; input-output HMM; maximum a posteriori decoding; memory requirement; nonterminated trellis codes; parallel implementation; pipelining; suboptimal forward-only algorithm; suboptimal unidirectional algorithm; trellis-code modulated; trellis-code modulation systems; turbo codes; Algorithm design and analysis; Convolutional codes; Decoding; Delay; Fading; Hidden Markov models; Information analysis; Intersymbol interference; Pipeline processing; Turbo codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.930921

Filename

930921