DocumentCode
2391488
Title
Low latency and power efficient VD using register exchanged state-mapping algorithm
Author
Seo, Sang-Ho ; Park, Sin-Chong
Author_Institution
Inf. & Commun. Univ., Taejon, South Korea
fYear
2005
fDate
20-24 July 2005
Firstpage
380
Lastpage
384
Abstract
In this paper, a new implementation of the Viterbi decoder is proposed. RE state-mapping algorithm combines TB algorithm with the RE algorithm. By updating the starting point of the state for each memory bank, the trace back operation can be eliminated. This result reduces the latency of the TB algorithm and the resource usage of RE algorithm. When the memory unit is 3, the resource usage is 6306 bits and the latency is 72 clocks. The resource usage is 74% smaller than the RE algorithm, and the latency is 34% smaller than the k-pointer even TB algorithm. The power consumption of each algorithm are also analyzed and compared. Because the resource usage is directly related to the power, the power consumption of this scheme is also reduced as stated in D. Liu and C. Svensson (1994). Actually, the estimated power consumption is about 12% smaller than the RE algorithm.
Keywords
Viterbi decoding; maximum likelihood decoding; resource allocation; Viterbi decoder; latency reduction; memory bank; power consumption; register exchanged state-mapping algorithm; resource usage; trace back operation; Algorithm design and analysis; Convergence; Cost function; Delay; Energy consumption; Equations; Maximum likelihood decoding; Read-write memory; Viterbi algorithm; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
System-on-Chip for Real-Time Applications, 2005. Proceedings. Fifth International Workshop on
Print_ISBN
0-7695-2403-6
Type
conf
DOI
10.1109/IWSOC.2005.81
Filename
1530976
Link To Document