该文在现有译码算法的基础上提出一种高效的非二进制低密度奇偶校验码(NB-LDPC)译码方法,充分利用了分层译码算法与 Min-max 算法的优点,不但译码复杂度低、需要的存储空间小,而且可将译码速度提高一倍。应用该算法,对一种定义在GF(25)上的(620,509)码进行了仿真。该码的仿真结果表明:在相同误码率下,该文译码算法所需最大迭代次数仅为Zhang的算法(2011)的45%。%Based on decoding algorithms available nowadays, a high efficiency decoding algorithm for nonbinary low-density parity-check codes is proposed. The algorithm takes advantage of both the layered decoding algorithm and the Min-max algorithm, which not only achieves the low complexity and the low memory requirement, but also speeds up the decoding by two times. Simulations for a (620,509) code over GF(25) show that with the same bit error rate, the maximum iteration times of the proposed algorithm required is just 45%of Zhang’s algorithm presented in 2011.
展开▼