K=9卷积码的Viterbi译码算法及其FPGA实现  

ViterbiDecodingAlgorithmandItsFPGA Implementation for K=9 Convolutional Codes

作　　者：胡爱群[1] 庞康[1] 苏杰[1] 

机构地区：[1]东南大学

出　　处：《应用科学学报》1998年第2期149-156,共8页Journal of Applied Sciences

基　　金：国家863计划

摘　　要：探讨了ＣＤＭＡ数字移动通信中的差错控制问题，研究用约束度Ｋ＝９的卷积编码和最大似然Ｖｉｔｅｒｂｉ译码的差错控制方案．在Ｖｉｔｅｒｂｉ译码算法中，提出了原位运算度量、保存路径转移过程和循环存取幸存路径等方法，能有效地减少存储量、降低功耗，使得Ｋ＝９的Ｖｉｔｅｒｂｉ译码算法可在以单片ＸＣ４０１０ＦＰＧＡ为主的器件上实现，其性能指标符合ＣＤ－ＭＡ数字移动通信ＩＳ９５标准要求．文中给出了实测的算法性能，讨论了ＦＰＧＡ具体实现问题．This paper deals with the error control problem in digital mobile communications. The scheme which employs the maximum likelihood Viterbi algorithm for decoding the K=9 convolutional data is studied. In this scheme, some efficient methods such as the in place modification operation for path metrics, the saving of path transition and the circle access for path surving are presented. By using these methods, the RAM size needed for saving metrics and paths and the power consumption are decreased. It is shown that the Viterbi algorithm of K=9 whose performance specifications satify the IS 95 standard can be implemented with a single chip FPGA XC4010. The performance is tested, and the implementation consideration is discussed.

关 键 词：数字移动通信 Viterbi译译 FPGA实现 卷积码 

分 类 号：TN929.5[电子电信—通信与信息系统]