| 卷积码的因子图解码算法研究 |
| |
| 引用本文： | 亓庆云,葛万成.卷积码的因子图解码算法研究[J].信息技术,2006,30(4):37-39. |
| |
| 作者姓名： | 亓庆云 葛万成 |
| |
| 作者单位： | 同济大学中德学院,上海,200092 |
| |
| 基金项目： | 德国罗德与施瓦茨公司资助项目 |
| |
| 摘 要： | 因子图是一种双向图，它描述了一种用本地函数来表达全局函数的算法。因子图连同积和算法是通信中强有力的工具。现提出了一种新的解码算法，即将因予图与积和算法应用在通信系统的解码中，并通过仿真，寻找到了一个更新次数所处于的最佳范围。
|
| 关 键 词： | 因子图 积和算法 解码 |
| 文章编号： | 1009-2552(2006)04-0037-03 |
| 修稿时间： | 2005年9月13日 |
Research on decoding algorithm for convolutional codes based on factor graphs |
| |
| QI Qing-yun,GE Wan-cheng.Research on decoding algorithm for convolutional codes based on factor graphs[J].Information Technology,2006,30(4):37-39. |
| |
| Authors: | QI Qing-yun GE Wan-cheng |
| |
| Abstract: | 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. |
| |
| Keywords: | factor graph sum-product algorithm decoding |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
