DocumentCode
2385057
Title
Simplified turbo decoding for binary Markov channels
Author
Garcia-Frias, Javier ; Villasenor, John D.
Author_Institution
Electr. & Comput. Eng., Delaware Univ., Newark, DE, USA
fYear
2000
fDate
2000
Firstpage
67
Abstract
We present a simplified method for combining turbo decoding and binary Markov channels. The resulting performance is slightly worse than that of the best known methods using supertrellis approaches, but it clearly outperforms traditional systems based on channel interleaving. Moreover, the complexity is much lower than in the supertrellis case and the structure of the encoder does not depend on the parameters of the hidden Markov model describing the channel
Keywords
channel coding; computational complexity; decoding; error statistics; hidden Markov models; turbo codes; binary Markov channels; channel interleaving; complexity; hidden Markov model; supertrellis approaches; turbo decoding; Capacity planning; Channel capacity; Convolutional codes; Digital communication; Error probability; Hidden Markov models; Interleaved codes; Iterative decoding; Memoryless systems; Turbo codes;
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.866357
Filename
866357
Link To Document