DocumentCode :
2271389
Title :
Approximate MAP decoding on tail-biting trellises
Author :
Madhu, A.S. ; Shankar, Priti
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
1325
Lastpage :
1328
Abstract :
We propose two approximate algorithms for MAP decoding on tail-biting trellises. The algorithms work on a subset of nodes of the tail-biting trellis, judiciously selected. We report the results of simulations on an AWGN channel using the approximate algorithms on tail-biting trellises for the (24,12) extended Golay code and a rate 1/2 convolutional code with memory 6
Keywords :
AWGN channels; Golay codes; convolutional codes; maximum likelihood decoding; trellis codes; AWGN channel; approximate MAP decoding; approximate algorithms; convolutional code; extended Golay code; tail-biting trellises; AWGN channels; Automation; Block codes; Computational modeling; Computer science; Convolutional codes; Decoding; Signal to noise ratio; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523557
Filename :
1523557
Link To Document :
بازگشت