TETRA中Reed-Muller码的大数逻辑译码方法  

Majority-Logic Decoding for the Reed-Muller Code in TETRA

作　　者：张鹏[1] 吴嗣亮[1] 谈振辉[2] 

机构地区：[1]北京理工大学电子工程系,北京100081 [2]北京交通大学电子工程系,北京100044

出　　处：《电子学报》2007年第9期1665-1669,共5页Acta Electronica Sinica

基　　金：国家自然科学基金重点资助项目(No.60332020)

摘　　要：TETRA数字集群移动通信系统的物理层协议中采用了缩短Reed-Muller(RM)码,它与经典RM码的差异极大,无法采用Reed大数逻辑译码算法.根据正交校验矩阵的特点,提出了一种一般线性分组码的正交校验矩阵的穷举搜索算法.使用该算法搜索了缩短RM码的正交校验矩阵,对搜索速度进行了分析.证明了该码是两步完全可正交码,给出了它的Massey大数逻辑译码方法.仿真结果表明,无论是硬判决还是软判决,该译码方法的纠错性能都优于伴随式译码方法.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 two-step 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.

关 键 词：大数逻辑译码算法 正交校验矩阵 穷举搜索算法 TETRA REED-MULLER码 

分 类 号：TN911.22[电子电信—通信与信息系统]