| 降低线性分组码网格复杂度的研究 |
| |
| 引用本文： | 王喜凤,王广正,谢振飞,周建钦. 降低线性分组码网格复杂度的研究[J]. 计算机工程与应用, 2010, 46(1): 95-98. DOI: 10.3778/j.issn.1002-8331.2010.01.030 |
| |
| 作者姓名： | 王喜凤 王广正 谢振飞 周建钦 |
| |
| 作者单位： | 安徽工业大学计算机学院,安徽,马鞍山,243002;滁州学院计算机科学与技术系,安徽,滁州,239012;安徽工业大学计算机学院,安徽,马鞍山,243002;杭州电子科技大学通信工程学院,杭州,310018 |
| |
| 基金项目： | 国家自然科学基金No.60473142;;安徽省教育厅自然科学研究项目No.2006KJ238B~~ |
| |
| 摘 要： | 首先介绍线性分组码的传统网格和BCJR传统网格,然后给出一种新的降低线性分组码网格复杂度方法——校验矩阵置换法。该方法是通过置换校验矩阵列向量的适当位置,从而使网格图的状态复杂度降低。最后给出方法证明、算法思想、具体的算法描述和实验结论等。
|
| 关 键 词： | 线性分组码 最小网格 网格复杂度 校验矩阵置换 |
| 收稿时间： | 2008-07-14 |
| 修稿时间： | 2008-11-20 |
Study of reducing state-complexity of trellises for linear block codes |
| |
| WANG Xi-feng,WANG Guang-zheng,XIE Zhen-fei,ZHOU Jian-qin. Study of reducing state-complexity of trellises for linear block codes[J]. Computer Engineering and Applications, 2010, 46(1): 95-98. DOI: 10.3778/j.issn.1002-8331.2010.01.030 |
| |
| Authors: | WANG Xi-feng WANG Guang-zheng XIE Zhen-fei ZHOU Jian-qin |
| |
| Affiliation: | 1.School of Computer Science,Anhui University of Technology,Ma’anshan,Anhui 243002,China 2.Department of Computer Science and Technology,Chuzhou University,Chuzhou,Anhui 239012,China 3.Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China |
| |
| Abstract: | This paper first presents conventional trellis for linear block codes and BCJR construction for conventional trellises. And a new way of constructing more minimal trellises for linear block codes is presented.It is proved that more minimal trellis can be constructed by the process of permuting the columns of parity check matrix from the well-known Bahl-Cocke-Jelinek-Raviv(BCJR)constructed conventional trellises.Furthermore,this paper gives main idea of parity check matrix permutation,algorithm's description... |
| |
| Keywords: | linear block codes minimal trellises trellis complexity parity check matrix permutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
|
