Low-power approach for decoding convolutional codes with adaptive viterbi algorithm approximations

R. Henning; Chaitali Chakrabarti

Low-power approach for decoding convolutional codes with adaptive viterbi algorithm approximations

R. Henning, Chaitali Chakrabarti

Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

14 Scopus citations

Abstract

Significant power reduction can be achieved by exploiting real-time variation in system characteristics while decoding convolutional codes. The approach proposed herein adaptively approximates Viterbi decoding by varying truncation length and pruning threshold of the T-algorithm while employing trace-back memory management. Adaptation is performed according to variations in signal-to-noise ratio, code rate, and maximum acceptable bit error rate. Potential energy reduction of 70 to 97.5% compared to Viterbi decoding is demonstrated. Superiority of adaptive T-algorithm decoding compared to fixed T-algorithm decoding is studied. General conclusions about when applications can particularly benefit from this approach are given.

Original language	English (US)
Title of host publication	Proceedings of the International Symposium on Low Power Electronics and Design, Digest of Technical Papers
Pages	68-71
Number of pages	4
State	Published - 2002
Event	Proceedings of the 2002 International Symposium on Low Power Electronics and Design - Monterey, CA, United States Duration: Aug 12 2002 → Aug 14 2002

Other

Other	Proceedings of the 2002 International Symposium on Low Power Electronics and Design
Country/Territory	United States
City	Monterey, CA
Period	8/12/02 → 8/14/02

Keywords

Adaptive T-algorithm decoding
Convolutional codes
Low power
Viterbi algorithm

ASJC Scopus subject areas

Engineering(all)

Cite this

Henning, R & Chakrabarti, C 2002, Low-power approach for decoding convolutional codes with adaptive viterbi algorithm approximations. in Proceedings of the International Symposium on Low Power Electronics and Design, Digest of Technical Papers. pp. 68-71, Proceedings of the 2002 International Symposium on Low Power Electronics and Design, Monterey, CA, United States, 8/12/02.

@inproceedings{65ec68bdb529495ab3999d83eb555161,

title = "Low-power approach for decoding convolutional codes with adaptive viterbi algorithm approximations",

abstract = "Significant power reduction can be achieved by exploiting real-time variation in system characteristics while decoding convolutional codes. The approach proposed herein adaptively approximates Viterbi decoding by varying truncation length and pruning threshold of the T-algorithm while employing trace-back memory management. Adaptation is performed according to variations in signal-to-noise ratio, code rate, and maximum acceptable bit error rate. Potential energy reduction of 70 to 97.5% compared to Viterbi decoding is demonstrated. Superiority of adaptive T-algorithm decoding compared to fixed T-algorithm decoding is studied. General conclusions about when applications can particularly benefit from this approach are given.",

keywords = "Adaptive T-algorithm decoding, Convolutional codes, Low power, Viterbi algorithm",

author = "R. Henning and Chaitali Chakrabarti",

year = "2002",

language = "English (US)",

pages = "68--71",

booktitle = "Proceedings of the International Symposium on Low Power Electronics and Design, Digest of Technical Papers",

note = "Proceedings of the 2002 International Symposium on Low Power Electronics and Design ; Conference date: 12-08-2002 Through 14-08-2002",

}

TY - GEN

T1 - Low-power approach for decoding convolutional codes with adaptive viterbi algorithm approximations

AU - Henning, R.

AU - Chakrabarti, Chaitali

PY - 2002

Y1 - 2002

N2 - Significant power reduction can be achieved by exploiting real-time variation in system characteristics while decoding convolutional codes. The approach proposed herein adaptively approximates Viterbi decoding by varying truncation length and pruning threshold of the T-algorithm while employing trace-back memory management. Adaptation is performed according to variations in signal-to-noise ratio, code rate, and maximum acceptable bit error rate. Potential energy reduction of 70 to 97.5% compared to Viterbi decoding is demonstrated. Superiority of adaptive T-algorithm decoding compared to fixed T-algorithm decoding is studied. General conclusions about when applications can particularly benefit from this approach are given.

AB - Significant power reduction can be achieved by exploiting real-time variation in system characteristics while decoding convolutional codes. The approach proposed herein adaptively approximates Viterbi decoding by varying truncation length and pruning threshold of the T-algorithm while employing trace-back memory management. Adaptation is performed according to variations in signal-to-noise ratio, code rate, and maximum acceptable bit error rate. Potential energy reduction of 70 to 97.5% compared to Viterbi decoding is demonstrated. Superiority of adaptive T-algorithm decoding compared to fixed T-algorithm decoding is studied. General conclusions about when applications can particularly benefit from this approach are given.

KW - Adaptive T-algorithm decoding

KW - Convolutional codes

KW - Low power

KW - Viterbi algorithm

UR - http://www.scopus.com/inward/record.url?scp=0036948940&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036948940&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036948940

SP - 68

EP - 71

BT - Proceedings of the International Symposium on Low Power Electronics and Design, Digest of Technical Papers

T2 - Proceedings of the 2002 International Symposium on Low Power Electronics and Design

Y2 - 12 August 2002 through 14 August 2002

ER -

Low-power approach for decoding convolutional codes with adaptive viterbi algorithm approximations

Abstract

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this