By Topic

An approach for adaptively approximating the Viterbi algorithm to reduce power consumption while decoding convolutional codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Henning, R. ; Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ, USA ; Chakrabarti, C.

Significant power reduction can be achieved by exploiting real-time variation in system characteristics. An approach is proposed and studied herein that exploits variation in signal transmission system characteristics to reduce power consumption while decoding convolutional codes. With this approach, Viterbi decoding is adaptively approximated by varying the pruning threshold of the T-algorithm and truncation length while employing trace-back memory management. A heuristic is given for finding and adaptively applying pairs of pruning threshold and truncation length values that significantly reduce power to variations in signal-to-noise ratio (SNR), code rate, and maximum acceptable bit-error rate (BER). The power reduction potential of different levels of adaptation is studied. High-level energy reduction estimates of 80% to 97% compared with Viterbi decoding are shown. Implementation insight and general conclusions about when applications can particularly benefit from this approach are given.

Published in:

Signal Processing, IEEE Transactions on  (Volume:52 ,  Issue: 5 )