loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96)
High-Speed Viterbi Decoder: An Efficient Scheduling Method to Exploit the Pipelining
Chicago, IL
August 19-August 23
ISBN: 0-8186-7542-X
M. Boo, Univ. Santiago de Compostela elmboo@usc.es
F. Arguello, Univ. Santiago de Compostela elmboo@usc.es
J.D. Bruguera, Univ. Santiago de Compostela elmboo@usc.es
E.L. Zapata, Univ. Santiago de Compostela elmboo@usc.es
The main part of the Viterbi Algorithm is a nonlinear feedback loop which presents a bottleneck for high-speed implementations. We present a novel scheduling scheme that allows increasing the available speed of the system. This is done through the utilization of look-ahead techniques to compute non--sequential data and, in this way, break the recursivity of the algorithm. This permits introducing pipelining. As a result, we obtain a speed growth comparable to previous parallel solutions, but with less hardware cost.
Citation:
M. Boo, F. Arguello, J.D. Bruguera, E.L. Zapata, "High-Speed Viterbi Decoder: An Efficient Scheduling Method to Exploit the Pipelining," asap, pp.165, 1996 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.