DocumentCode :
2756767
Title :
An efficient metric normalization architecture for high-speed low-power viterbi decoder
Author :
Yi-Tse Lai, Kelvin
Author_Institution :
Department of Electrical Engineering, National Yunlin University of Science and Technology Douliou, Yunlin 64002, China
fYear :
2007
fDate :
Oct. 30 2007-Nov. 2 2007
Firstpage :
1
Lastpage :
4
Abstract :
In this paper, a new efficient metric normalization architecture called high bit clear is proposed for a high throughput and low power Viterbi decoder (VD). The proposed high bit clear normalization circuit not only normalizes all of the survivor path metrics, but also operates as close as the add-compare-select (ACS) iteration bound possibly with a small area overhead. After we verified the function and made the platform by FPGA, we also used United Microelectronics Corporation (UMC) 0.18 mum 1.8 V 1P6M standard cell library to implement it. With implementation by using UMC 0.18 mum 1.8-V standard cell library, the proposed VD can improve the data rate up to 834 Mbps for decoding a (3,1,2) convolutional code. To compare with the traditional VD without normalization, the proposed VD is improved by 60% in decoding speed and reduced by 50% in power consumption. Furthermore, the chip area of the new VD is reduced by 55% as compared to the traditional one. The operational speed of the proposed VD is up to 278MHz. Under 278MHz operation, the proposed VD consumes 2.48mW in power and the chip area utilized is about 110 mum*110 mum.
Keywords :
Viterbi decoding; convolutional codes; field programmable gate arrays; low-power electronics; 1P6M standard cell library; FPGA; add-compare-select iteration; bit rate 834 Mbit/s; efficient metric normalization architecture; high bit clear normalization circuit; high-speed low-power Viterbi decoder; size 0.18 mum; size 110 mum; survivor path metrics; voltage 1.8 V; Circuits; Code standards; Convolutional codes; Energy consumption; Field programmable gate arrays; Iterative decoding; Libraries; Microelectronics; Throughput; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 2007 - 2007 IEEE Region 10 Conference
Conference_Location :
Taipei
Print_ISBN :
978-1-4244-1272-3
Electronic_ISBN :
978-1-4244-1272-3
Type :
conf
DOI :
10.1109/TENCON.2007.4429152
Filename :
4429152
Link To Document :
بازگشت