卷积码的因子图解码算法研究

Research on decoding algorithm for convolutional codes based on factor graphs

因子图是一种双向图,它描述了一种用本地函数来表达全局函数的算法。因子图连同积和算法是通信中强有力的工具。现提出了一种新的解码算法,即将因子图与积和算法应用在通信系统的解码中,并通过仿真,寻找到了一个更新次数所处于的最佳范围。

A factor graph is a bipartite graph which expresses that how a ＂global＂ function of several variables is divided into a product of ＂local＂ functions. Taking together factor graphs with the sum- product algorithm represents a powerful tool for many communication engineers. This paper proposes a new decoding algorithm, which applies factor graphs and the sum- product algorithm to the decoding of communication systems. With help of simulation, the optimal number of the updates can be determined.