一种软判决下的本原BCH码盲识别方法

发布时间：2018-02-25 22:01

本文关键词： BCH码盲识别软判决 Kullback-Leibler散度假设检验　出处：《西安交通大学学报》2017年06期 　论文类型：期刊论文

【摘要】：为解决现有BCH码识别方法容错性较差的问题,提出了一种软判决下的本原BCH码盲识别(SDBR)方法。首先,将截获数据进行解调软判决得到比特序列和对应可靠性信息,然后对比特序列进行码字划分,再由软判决可靠性信息建立码根可靠性系数,以此计算不同码根出现的概率,并引入Kullback-Leibler散度来确定码长;其次,定义公共码根可靠性统计量并建立二元假设检验,在不同本原多项式下对公共码根进行判定;最后,利用公共码根连续分布特点识别本原多项式,进而由所有公共码根计算生成多项式。仿真结果表明:SDBR方法在信噪比大于7dB时能有效对常用本原BCH码进行识别;与基于码根信息差熵的方法相比,容错性提升了1.8dB。
[Abstract]:In order to solve the problem of poor fault tolerance of existing BCH code recognition methods, a native BCH code blind recognition method based on soft decision is proposed. Firstly, the intercepted data is demodulated to obtain bit sequence and corresponding reliability information. Then the bit sequence is divided into code words, and then the reliability coefficient of code root is established by soft decision reliability information to calculate the probability of different code roots, and the Kullback-Leibler divergence is introduced to determine the code length. The common root reliability statistic is defined and the binary hypothesis test is established to judge the common code root under different primitive polynomials. Finally, the common root continuous distribution is used to identify the primitive polynomial. The simulation results show that the original BCH codes can be effectively identified when the signal-to-noise ratio is greater than 7 dB, and the fault tolerance is improved by 1.8 dB compared with the method based on the entropy of root information difference.
【作者单位】：海军航空工程学院信息融合研究所;
【基金】：国家自然科学基金重大研究计划资助项目(91538201) 泰山学者工程专项经费资助项目(st201511020)
【分类号】：TN911.22

【相似文献】