基于最大似然译码的快速信道编码盲识别算法

Fast Blind Recognition Scheme of Channel Codes Based on Maximum Likelihood Decoding

  • 摘要: 本文针对信道编码盲识别的盲译码过程延时高的问题,提出一种基于最大似然译码的信道编码盲识别算法。该识别算法通过以最大似然译码的欧氏距离值作为识别特征量的方式,将信道译码和信道编码识别相结合。这种算法可以在信道译码过程中提前识别并终止无效译码以达到加速目的。本文利用NP准则推导出满足系统可靠性需求的最佳检测阈值。该识别算法原理简单,实现容易。仿真结果证明了理论推导的正确性,表明所提出算法在信道编码识别中具有良好的识别性能。

     

    Abstract: To handle the high delay problem of blind decoding process for blind recognition of Channel Codes, a fast blind recognition algorithm of channel codes based on maximum likelihood decoding is proposed. This algorithm combines channel decoding with channel recognizing by using Euclidean distance of maximum likelihood decoding as the recognition feature, It can recognize and terminate invalid decoding in advance during channel decoding to accelerate the decode process. The optimum detection threshold satisfying system reliability requirements is deduced by Neymar-Pearson (NP) criterion. The algorithm is uncomplex and easy to implement. Simulation results prove the validity of deduction and show that the proposed algorithm has good performance in blind channel coding recognition.

     

/

返回文章
返回