ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Approximate linear time ML decoding on tail-biting trellises in two rounds

Krishnan, Murali K and Shankar, Priti (2006) Approximate linear time ML decoding on tail-biting trellises in two rounds. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA, pp. 2245-2249.

[img] PDF
04036369.pdf - Published Version
Restricted to Registered users only

Download (171Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/search/searchresult.jsp...

Abstract

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, 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(m log m) 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 deduced and simulation results on an AWGN channel using tail-biting trellises for two rate 1/2 convolutional codes with memory 4 and 6 respectively, are reported.

Item Type: Conference Paper
Additional Information: Copyright 2006 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 > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 30 Aug 2010 04:59
Last Modified: 19 Sep 2010 06:12
URI: http://eprints.iisc.ernet.in/id/eprint/30492

Actions (login required)

View Item View Item