Shankar, Priti and Kumar, PNA and Sasidharan, K and Rajan, BS (2001) ML Decoding of Block Codes on their Tailbiting Trellises. In: 2001 IEEE International Symposium on Information Theory, 24-29 June, Washington, p. 291.
A maximum likelihood decoding algorithm is presented for tailbiting trellises for block codes. The algorithm works in two phases. The first phase is a Viterbi decoding algorithm on the tailbiting trellis, while the second uses the A* algorithm adapted for application in this context. Results of simulations on tailbiting trellises for some block codes, indicate that this decoding algorithm is quite fast.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering
Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
|Date Deposited:||15 Feb 2006|
|Last Modified:||19 Sep 2010 04:23|
Actions (login required)