Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
| dc.creator | Krishnan, K. Murali | |
| dc.creator | Shankar, Priti | |
| dc.date | 2006-01-30 | |
| dc.date.accessioned | 2026-07-07T09:19:07Z | |
| dc.date.available | 2026-07-07T09:19:07Z | |
| dc.description | 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 reported | |
| dc.identifier | https://arxiv.org/abs/cs/0601126 | |
| dc.identifier | http://arxiv.org/abs/cs/0601126 | |
| dc.identifier | Proc. ISIT 2006, pp.2245-2249 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154271 | |
| dc.subject | Information Theory | |
| dc.title | Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds | |
| dc.type | text |