TY - JOUR
T1 - A new architecture for the fast viterbi algorithm
AU - Lee, Inkyu
AU - Sonntag, Jeff L.
N1 - Funding Information:
Paper approved by R. D. Wesel, the Editor for Coding and Communication Theory of the IEEE Communications Society. Manuscript received October 6, 2000; revised June 18, 2002. This work was supported in part by a Korea University grant, and in part by the Korea Science and Engineering Foundation under Grant R08-2003-000-10761-0.
PY - 2003/10
Y1 - 2003/10
N2 - A novel architecture design to speed up the Viterbi algorithm is proposed. By increasing the number of states in the trellis, the serial operation of a traditional add-compare-select unit is transformed into a parallel operation, thus achieving a substantial speed increase. The proposed architecture would increase the speed by 33% at the expense of a faily modest increase in area, thus becoming an attractive approach in high-speed applications. A simple example is shown to illustrate the proposed algorithm in maximum-likelihood sequence detector. A comparative synthesis is made to compare the proposed architecture with other approaches, and synthesis simulations confirm the projection of the throughput gain. Also, the proposed algorithm is extended to the block-processing architecture, and we show that an additional 50% speedup is achieved.
AB - A novel architecture design to speed up the Viterbi algorithm is proposed. By increasing the number of states in the trellis, the serial operation of a traditional add-compare-select unit is transformed into a parallel operation, thus achieving a substantial speed increase. The proposed architecture would increase the speed by 33% at the expense of a faily modest increase in area, thus becoming an attractive approach in high-speed applications. A simple example is shown to illustrate the proposed algorithm in maximum-likelihood sequence detector. A comparative synthesis is made to compare the proposed architecture with other approaches, and synthesis simulations confirm the projection of the throughput gain. Also, the proposed algorithm is extended to the block-processing architecture, and we show that an additional 50% speedup is achieved.
KW - Detector/decoder
KW - Fast architecture
KW - Viterbi algorithm (VA)
UR - http://www.scopus.com/inward/record.url?scp=0242365691&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0242365691&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2003.818100
DO - 10.1109/TCOMM.2003.818100
M3 - Letter
AN - SCOPUS:0242365691
VL - 51
SP - 1624
EP - 1628
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 0090-6778
IS - 10
ER -