維特比解碼器效能之統一測度

Unifying Performance Metric of Viterbi Decoders

簡用典(Yong-Dian Jian)

指導教授 ： 顧孟愷

共同指導教授 ： 賴飛羆(Feipei Lai)

國立臺灣大學/電機資訊學院/資訊工程學研究所/碩士(2004年)

https://doi.org/10.6342/NTU.2004.00866

摘要

無資料

關鍵字

維特比 ； 測度

並列摘要

Convolutional codes and Viterbi decoders were extensively used in error control systems.
The survivor memory management (SMM) unit of Viterbi decoder is extremely important in determining the throughput, hardware area and coding gain performance of the whole system.
Many SMM architectures were proposed in the past, but we lack an unifying metric to compare the coding gain performance of them.
In this thesis, we define a metric, average traceback depth (ATBD), to unify the diversity of different SMM architectures.
The ATBD metric can be used to equalize different SMM architectures and predict the optimal traceback depth (TBD) of them.
The optimality is in terms of coding gain performance and hardware cost.
We perform extensive computer simulations with three popular convolutional codes (DVB, DCII and UMTS) and many SMM architectures to verify the validity of the ATBD metric.
Simulation results show that the difference between optimal TBD and ATBD is at most 10%.
With this unifying metric, we can estimate the hardware cost of different SMM architectures under fixed coding gain performance.
Besides, system architects can use it to fast evaluate the tradeoff among hardware cost, throughput and coding gain performance because the calculation of ATBD metric is very simple.

並列關鍵字

Viterbi Metric

參考文獻

[3] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Transactions on Information Theory, pp.260–269, April 1967.

[5] ——, “Convolutional code (ii): Maximum likelihood decoding,” Information and Control, vol. 25, pp. 222–266, July 1974.

[6] M. Boo, F. Arguello, J. D. Bruguera, R. Doallo, and E. Zapata, “High-performance VLSI architecture for the Viterbi algorithm,” IEEE Transactions

[7] K. Page and P. Chau, “Improved architectures for the add-compare-select operation in long constraint length viterbi decoding,” IEEE Journal Of Solid-State Circuits, vol. 33, pp. 151–155, January 1998.

[8] I. Lee and J. Sonntag, “A new architecture for fast Viterbi algorithm,” IEEE Transactions On Communications, pp. 1624–1628, October 2003.