Shankar, P. ; Kumar, P. N. A. ; Sasidharan, K. ; Rajan, B. S. (2001) ML decoding of block codes on their tailbiting trellises In: Proceedings of 2001 IEEE International Symposium on Information Theory, 2001, 29-29 June 2001, Washington, DC, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/936154/
Related URL: http://dx.doi.org/10.1109/ISIT.2001.936154
Abstract
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 or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111253 |
| Deposited On: | 08 Dec 2017 10:36 |
| Last Modified: | 08 Dec 2017 10:36 |
Repository Staff Only: item control page
