8 citations found. Retrieving documents...
Ye Liu, Shu Lin, and M.P.C. Fossorier, "MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams," IEEE Trans. on Communications, vol. 48, pp. 577--586, April 2000.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Evaluation of Binary Linear Block Codes - Abedi, Khandani (2003)   (Correct)

....in a given bit position of interest. Reference [2] provides an efficient method (known as BCJR) to compute the bit probabilities of a given code using its trellis diagram. There are some special methods for bit decoding based on coset decomposition principle [3] sectionalized trellis diagrams [4], and using the dual code [5] 6] Maximum Likelihood decoding algorithms have been the subject of numerous research activities, while bit decoding algorithms have received much less attention in the past. More recently, bit decoding algorithms have received increasing attention, mainly due to ....

Y. Liu, S. Lin, M. P. C. Fossorier, "MAP Algorithms for Decoding Linear Block Codes Based on Sectionalized Trellis Diagrams," IEEE Transactions on Communications, vol. 48, no. 4, pp. 577-586, April 2000.


Some Properties of Bit Decoding Algorithms for Binary Linear.. - Abedi, Khandani (2004)   (Correct)

....main simplification of BCJR has been the SOVA (Soft Output Viterbi Algorithm) 3] which is a sub optimum solution. A reduced search BCJR algorithm is also proposed in [4] There are some special methods for bit decoding based on coset decomposition principle [5] sectionalised trellis diagrams [6], and using the dual code [7] 8] Maximum Likelihood decoding algorithms have been the subject of numerous research activities, while bit decoding algorithms have received much less attention in the past. More recently, bit decoding algorithms have received increasing attention, mainly due to ....

Y. Liu, S. Lin, M. P. C. Fossorier, "MAP Algorithms for Decoding Linear Block Codes Based on Sectionalised Trellis Diagrams," IEEE Transactions on Communications, vol. 48, no. 4, pp. 577-586, April 2000.


On Some Properties of the Bit Decoding Algorithms - Abedi, Chaudhari, Khandani (2001)   (3 citations)  (Correct)

....to compute the bit probabili ties of a given code using its trellis diagram. An efficient exact APP decoding algorithm based on coset decoding principle proposed in [18] There are also some special optimum methods for bit decoding of linear block codes based on sectionalized trellis diagrams [19] and based on using the code words of the dual code [20] The main simplification of BCJR has been the SOVA (soft output Viterbi Algorithm) of Hoeher and Hagenauer [21] which is a sub optimum solution. A reduced search BCJR al gorithm is also proposed in [22] Other researches have been done on ....

e Liu, Shu Lin, M.P.C. Fossorier ,"MAP Algorithms for Decoding Linear Block Codes Based on Sectionalized Trellis Diagrams," IEEE Transactions on Communications, Vol.48, No.4, pp. 577-586, April 2000.


Some Properties of Bit Decoding Algorithms Over A Generalized .. - Abedi, Khandani (2002)   (Correct)

....as BCJR) o compute he bi probabilities of a given code using is rellis diagram. An efficien exac APP decod ing algorithm based on cose decoding principle proposed in [17] There are also some special optimum methods for bi decoding of linear block codes based on secionalized rellis diagrams [18] and based on using he code words of he dual code [19] The main simplification of BCJR has been he SOVA (sof oupu Vierbi Algorithm) of Hoeher and Hagenauer [20] which is a sub optimum solution. A reduced search BCJR algorithm is also proposed in [21] Oher researches have been done on reducing ....

Ye Liu, Shu Lin, M.P.C. Fossorier ,"MAP Algorithms for Decoding Linear Block Codes Based on Sectionalized Trellis Diagrams," IEEE Transactions on Communications, Vol.48, No.4, pp. 577-586, April 2000.


Asymptotic Effect of Interleaver Structure on the.. - Baligh, Khandani (2004)   (Correct)

No context found.

Ye Liu, Shu Lin, and M.P.C. Fossorier, "MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams," IEEE Trans. on Communications, vol. 48, pp. 577--586, April 2000.


An Analytical Method for Approximate Performance Evaluation.. - Abedi, Khandani (2004)   (Correct)

No context found.

Y. Liu, S. Lin, and M. P. C. Fossorier, "MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams," IEEE Trans. Commun., vol. 48, pp. 577--586, Apr. 2000.


Invariance Properties and Performance Evaluation of Bit Decoding.. - Abedi (2004)   (Correct)

No context found.

Y. Liu, S. Lin, M. P. C. Fossorier ,"MAP Algorithms for Decoding Linear Block Codes Based on Sectionalized Trellis Diagrams," IEEE Transactions on Communications, vol.48, no.4, pp. 577-586, April 2000.


An Analytical Method for Approximate Performance Evaluation.. - Ali Abedi Student (2004)   (Correct)

No context found.

Y. Liu, S. Lin, and M. P. C. Fossorier, "MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams," IEEE Trans. Commun., vol. 48, pp. 577--586, Apr. 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC