TY - GEN
T1 - VLSI architecture of extended in-place path metric update for Viterbi decoders
AU - Wu, Chien Ming
AU - Shieh, Ming Der
AU - Wu, Chien Hsing
AU - Sheu, Ming Hwa
PY - 2001/12/1
Y1 - 2001/12/1
N2 - Efficient memory management is always the key technique for successfully designing the Viterbi decoders. In this paper, a novel and efficient in-place scheduling approach of path metric update and its hardware implementation are developed to increase the equivalent memory bandwidth with limited hardware overhead. The resulting architecture has the following characteristics: (I) The whole memory call be systematically partitioned into several sets of banks and each set can be treated as a local memory of a specific add compare select (ACS) unit. (II) The interconnects between the memory banks and ACS units as well as those between adjacent ACS units an regular and simple such that it is very suitable for VLSI array implementation. Our approach can not only provide a methodology for designing high-performance Viterbi decoders, but also give the trade-off between hardware requirement and computation time for updating path metrics, especially for the convolutional code with larger memory order.
AB - Efficient memory management is always the key technique for successfully designing the Viterbi decoders. In this paper, a novel and efficient in-place scheduling approach of path metric update and its hardware implementation are developed to increase the equivalent memory bandwidth with limited hardware overhead. The resulting architecture has the following characteristics: (I) The whole memory call be systematically partitioned into several sets of banks and each set can be treated as a local memory of a specific add compare select (ACS) unit. (II) The interconnects between the memory banks and ACS units as well as those between adjacent ACS units an regular and simple such that it is very suitable for VLSI array implementation. Our approach can not only provide a methodology for designing high-performance Viterbi decoders, but also give the trade-off between hardware requirement and computation time for updating path metrics, especially for the convolutional code with larger memory order.
UR - http://www.scopus.com/inward/record.url?scp=20144383792&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=20144383792&partnerID=8YFLogxK
U2 - 10.1109/ISCAS.2001.922208
DO - 10.1109/ISCAS.2001.922208
M3 - Conference contribution
AN - SCOPUS:20144383792
SN - 0780366859
SN - 9780780366855
T3 - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
SP - 206
EP - 209
BT - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
T2 - 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001
Y2 - 6 May 2001 through 9 May 2001
ER -