Approximate MAP Decoding on Tail-Biting Trellises

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.Comment: 5 pages, 2 figures, ISIT 200

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(mlogm) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is reduced and simulation results on an AWGN channel using tail-biting rrellises for two rate 1/2 convoluational codes with memory 4 and 6 respectively are reporte

Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes

An efficient coset based symbol-by-symbol soft-in/soft-out a posteriori probability (APP) decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is analyzed.published_or_final_versio

Analog MAP decoder for (8, 4) hamming code in subthreshold CMOS

Journal ArticleAn all-MOS analog implementation of a MAP decoder is presented for the (8, 4) extended Hamming code. This paper describes the design and analysis of a tail-biting trellis decoder implementation using subthreshold CMOS devices. A VLSI test chip has recently returned from fabrication, and preliminary test results indicate accurate decoding up to 20 MBit/s