西安电子科技大学学报（自然科学版）2011，Vol.38Issue(2)：8-12,196,6.DOI:10.3969/j.issn.1001-2400.2011.02.002
一种简化的GF(q)-LDPC码译码算法
Simplified decoding algorithm for LDPC over GF(q)
摘要
Abstract
A simple, yet effective decoding algorithm for LDPC ( low-density parity-check) codes over GF(q) is presented.By taking advantages of the first-term Taylor's series expansion to approximate the correction term of the Jacobian logarithm used in LLR-SPA( log-likelihood ratio sum-product algorithm), we propose an algorithm which significantly simplifies the check node update computation of the optimal LLR-SPA.Compared to the offset min-sum algorithm, the proposed algorithm achieves a gain of about 0.2 dB at the BER of 10-4.Moreover, unlike the offset min-sum algorithm, parameters of this algorithm are independent of the order of the Galois Filed.关键词
多元LDPC码/和积译码算法/最小和算法/迭代译码分类
信息技术与安全科学引用本文复制引用
胡树楷,王新梅..一种简化的GF(q)-LDPC码译码算法[J].西安电子科技大学学报（自然科学版）,2011,38(2):8-12,196,6.基金项目
国家自然科学基金资助项目(U0635003) （U0635003）
国家973项目基金资助项目(2010CB328300) （2010CB328300）
