卷积码基于逃逸机制的次优译码

摘要

With the help of some modules such as descending sort ,variable selector and vector register ,the paper presents a matrices scheme of M-algorithm ,and designs a single structure decoder with the parallel processing ability .M-algorithm is easy to get into the suboptimum local research area ,by combining the box-plus-operation of LDPC and the nearest neighbor idea of Chase algorithm ,a quick-look-in convolutional code which has the specialty of fast detection is used to establish a low-cost escape mecha-nism ,and it can free decoder from local optima faster .The simulation results demonstrate that the improved escape mechanism based algorithm can obtain an additional gain of 0 .8 dB ,it fully proves the feasibility and validity of algorithm .%本文借助降排序、动态选择器和矢量寄存器等模块，提出了一种卷积码 M 算法的矩阵实现方案，设计了一种具有并行处理能力的单一结构译码器．M 算法容易陷入次优的局部搜索区域，本文利用快检卷积码的快检特性，结合低密度校验码的核加运算和蔡氏算法的最近邻域扩展思想，建立了一种低开销的逃逸机制，帮助译码器快速摆脱局部最优解．仿真实验表明，基于逃逸机制的改进算法可获得约0．8db 的额外增益，充分证明了算法的可行性和有效性．