| TETRA中Reed-Muller码的大数逻辑译码方法 |
| |
| 引用本文： | 张鹏,吴嗣亮,谈振辉. TETRA中Reed-Muller码的大数逻辑译码方法[J]. 电子学报, 2007, 35(9): 1665-1669 |
| |
| 作者姓名： | 张鹏 吴嗣亮 谈振辉 |
| |
| 作者单位： | 1. 北京理工大学电子工程系,北京,100081
2. 北京交通大学电子工程系,北京,100044 |
| |
| 摘 要： | TETRA数字集群移动通信系统的物理层协议中采用了缩短Reed-Muller(RM)码,它与经典RM码的差异极大,无法采用Reed大数逻辑译码算法.根据正交校验矩阵的特点,提出了一种一般线性分组码的正交校验矩阵的穷举搜索算法.使用该算法搜索了缩短RM码的正交校验矩阵,对搜索速度进行了分析.证明了该码是两步完全可正交码,给出了它的Massey大数逻辑译码方法.仿真结果表明,无论是硬判决还是软判决,该译码方法的纠错性能都优于伴随式译码方法.
|
| 关 键 词： | 大数逻辑译码算法 正交校验矩阵 穷举搜索算法 Reed-Muller码 |
| 文章编号： | 0372-2112（2007）09-1665-05 |
| 修稿时间： | 2006-04-25 |
Majority-Logic Decoding for the Reed-Muller Code in TETRA |
| |
| ZHANG Peng,WU Si-liang,TAN Zhen-hui. Majority-Logic Decoding for the Reed-Muller Code in TETRA[J]. Acta Electronica Sinica, 2007, 35(9): 1665-1669 |
| |
| Authors: | ZHANG Peng WU Si-liang TAN Zhen-hui |
| |
| Affiliation: | 1. Department of Electronic Engineering, Beijing Institute of Technology, Beijing 100081, China; 2. Department of Electronic Engineering, Beijing Jiaotong University,Beijing 100044, China |
| |
| Abstract: | For the shortened RM code in TETRA,it is quite different from the classic RM codes,and Reed's majority-logic decoding algorithm is no longer applicable to it.According to the characteristics of orthogonal parity-check matrixes,an exhaustive algorithm was proposed to search for the orthogonal parity-check matrixes of general block codes.The exhaustive search algorithm was applied to the shortened RM code,and the searching speed was analyzed.This code was proved to be twostep completely orthogonalizable,and Massey's majority-logic decoding scheme for it was given.Simulation results show that the decoding scheme is superior to the syndrome decoding scheme with respect to the error-correcting performance,whether hard-or soft-decision is employed. |
| |
| Keywords: | TETRA |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
