ACM Home Page
Please provide us with feedback. Feedback
A low power Viterbi decoder implementation using scarce state transition and path pruning scheme for high throughput wireless applications
Full text PdfPdf (332 KB)
Source International Symposium on Low Power Electronics and Design archive
Proceedings of the 2006 international symposium on Low power electronics and design table of contents
Tegernsee, Bavaria, Germany
SESSION: Low power architectures and systems table of contents
Pages: 406 - 411  
Year of Publication: 2006
ISBN:1-59593-462-6
Authors
Jie Jin  Hong Kong University of Science and Technology, Kowloon, Hong Kong
Chi-Ying Tsui  Hong Kong University of Science and Technology, Kowloon, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 46,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1165573.1165673
What is a DOI?

ABSTRACT

This paper presents a low power Viterbi decoder design based on Scarce State Transition (SST). We propose an approach which seamlessly integrates the path pruning techniques with the SST decoding to reduce the average add-compare-select (ACS) computation. The scheme has very low overhead and is practical for implementation. We also propose an uneven-partitioned memory architecture for the survivor memory unit to reduce the memory access power during the trace back operation. The proposed decoder is implemented in SMIC 0.18?m CMOS process. Simulation results show that significant power consumption reduction can be achieved for high throughput wireless systems such as MB-OFDM Ultra-wide-band applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. J. Viterbi, "Error bounds for convolutional codes and asymptotically optimum decoding algorithm," IEEE Trans. Inf. Theory, vol. IT-13, no.2, pp. 260--269, Apr. 1967.
 
2
R. Henning and C. Chakrabarti, "An Approach for Adaptively Approximating the Viterbi Algorithm to Reduce Power Consumption While Decoding Convolutional Codes," IEEE Trans. Signal processing, vol. 52. May 2004.
 
3
G. Feygin and P. Gulak, "Architectural tradeoffs for survivor sequence memory management in Viterbi decoders," IEEE Trans. Commun., vol. 41, no. 3, pp. 425--429, Mar. 1993.
 
4
J. B. Anderson, "Limited search trellis decoding of convolutional codes," IEEE Trans. Inf. Theory, vol. 35, pp. 944--955, Sep. 1989.
 
5
R. Chan and David Haccoun, "Adaptive Viterbi Decoding of Convolutional Codes over Memoryless Channels," IEEE Trans. Communications, vol. 45, Nov. 1997.
 
6
S. J. Simmons, "Breadth-first trellis decoding with adaptive effort," IEEE Trans. Commun., vol. 38, pp. 3--12, Jan. 1990.
 
7
 
8
Man Guo, M. O. Ahmad, M. N. S. Swamy, and Chunyan Wang, "FPGA design and implementation of a low-power systolic array -based adaptive Viterbi decoder," IEEE Trans. Circuits and Systems I, vol. 52. Feb. 2005.
 
9
S. Kubota, S. Kato and T. Ishitani, "Novel Viterbi Decoder VLSI Implementation and its Performance," IEEE Trans. Communications, vol. 41, Aug. 1993.
 
10
Fei Sun and Tong Zhang, "Parallel High-Throughput Limited Search Trellis Decoder VLSI Design," IEEE Trans. VLSI Systems, vol. 13, Sept. 2005.
 
11
Anuj Batra et al., Texas Instruments et al., Multi-band OFDM Physical Layer Specification, Release 1.0, Apr. 27, 2005.
 
12
J. Foerster, Ed., "Channel modeling sub-committee report final," IEEE802.15-02/490.
 
13
C. C. Lin, Y.H. Shih, H. C. Chang, and C. Y. Lee, "Design of a Power-Reduction Viterbi Decoder for WLAN Applications," IEEE Trans. Circuits and Systems I, vol.52, June, 2005.