为了降低多元LDPC(Low Density Parity Check Code)码网格最小最大(Trellis Min-Max,T-MM)译码算法复杂度,减少译码过程中所需存储空间,提出一种基于额外列的T-MM译码算法(Extra-Column-based Trellis Min-Max,EC-T-MM).选取网格中可靠度最高的信息构造出优化的配置集,生成一列用于更新校验节点的q维额外列信息,再根据网格路径中偏移量信息,从最小值、次小值和额外列信息中得到校验节点的外在输出信息,通过网格的路径优化降低校验节点的更新复杂度.在译码过程中,用偏移量信息代替所有变量节点输入信息,减少存储空间.仿真结果表明:该算法在几乎不损失性能的前提下,降低了计算复杂度及所需的存储空间.%In this paper,an Extra-Column-based Trellis Min-Max(EC-T-MM)algorithm for non-binary LDPC decoding is proposed to reduce the computational complexity and storage space of the Trellis Min-max decoding algorithm.Firstly,optimized configuration sets are constructed by selecting the most reliable information in the trellis.And then,these configuration sets are used to generate extra column information for updating the check node.Secondly,the external output information for generating the check node is selected from the minimum value,the second value and the extra column information according to the differential messages in the trellis.The update complexity of the check node is reduced by the path optimization of the trellis.In the decoding process,we only retain differential messages instead of keeping information from all nodes.The simulation results show that the pro-posed algorithm can reduce the complexity of the decoding algorithm and the require storage space under the premise of almost no loss of performance.
展开▼
