DocumentCode
390241
Title
VLSI design and implementation of high-speed Viterbi decoder
Author
Yu-xin, You ; Jin-xiang, Wang ; Feng-chang, Lai ; Yi-zheng, Ye
Author_Institution
Microelectron. Center, Harbin Inst. of Technol., China
Volume
1
fYear
2002
fDate
29 June-1 July 2002
Firstpage
64
Abstract
This paper presents a new architecture for high-speed Viterbi decoder with low power dissipation based on the modified T-algorithm and modified trace-back methods. The former algorithm is used to reduce the unnecessary operations in path metric computation, while the latter is adopted to reuse the already generated trace-back routes to reduce the times of trace-back operations, so the power consumption can be saved. High throughput and short decoding latency are achieved by parallel computation in the add-compare-select unit and pipeline structure in the survivor-memory-unit. The complexity of the (2,1,7) Viterbi decoder is about 50,000 gates with a decoding latency of 32 clock cycles, and an area of 3.88 mm2 including IO pad with a throughput of 200 Mb/s using 0.25 μm technology.
Keywords
CMOS integrated circuits; VLSI; Viterbi decoding; decoding; delays; integrated circuit design; parallel architectures; pipeline processing; 0.25 micron; 200 Mbit/s; CMOS process; IO pad; VLSI design; VLSI implementation; add-compare-select unit; decoding latency; high throughput; high-speed Viterbi decoder; low power dissipation; modified T-algorithm; modified trace-back methods; parallel computation; path metric computation; pipeline structure; power consumption reduction; survivor-memory-unit; trace-back routes; Computer architecture; Concurrent computing; Decoding; Delay; Energy consumption; Power dissipation; Power generation; Throughput; Very large scale integration; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on
Print_ISBN
0-7803-7547-5
Type
conf
DOI
10.1109/ICCCAS.2002.1180573
Filename
1180573
Link To Document