一种基于最小汉明距离的卷积码译码算法研究  

A Study of Minimum Hamming Distance Algorithm for Decoding Convolutional Codes

作　　者：刘颖[1] 喻文芳[1] 周辉[1] 

机构地区：[1]装备指挥技术学院电子工程系,北京101416

出　　处：《装备指挥技术学院学报》2002年第4期59-63,共5页Journal of the Academy of Equipment Command & Technology

摘　　要：在讨论费诺算法的基础上，提出了一种基于汉明距离的译码算法，该算法省去了门限增量T0，而实质上，基于汉明距离的译码算法和费诺算法是一致的。最后运用EDA（电子设计自动化）开发软件进行模拟，结果表明该算法在性能上比费诺算法优越得多。This paper studies Fano algorithm decoding procedures, and then introdues a minimum Hamming distance algorithm, in which the threshold increment T 0 is eliminated. It is shown that the minimum Hamming distance algorithm is essentially equivalent to Fano algorithm. At the end of the paper we provide simulation results by using the software of EDA(Electronic Design Automation), which proves that in some applications this algorithm can get batter performance than Fano algorithm.

关 键 词：汉明距离 码树图 费诺算法 卷积码 译码算法 概率译码 

分 类 号：O157.4[理学—数学]