高斯近似法下LDPC码tanh法则优化近似新方法

郑贺; 胡捍英; 周华莹

高斯近似法下LDPC码tanh法则优化近似新方法

计量
- 文章访问数: 2510
- HTML全文浏览量: 89
- PDF下载量: 1115
- 被引次数: 0
出版历程
- 收稿日期: 2005-01-17
- 修回日期: 2006-01-27
- 刊出日期: 2006-10-19

New Approach to Optimal Approximation of Tanh Rule for LDPC Codes under the Gaussian Approximation

摘要

摘要: 该文利用高斯近似法，提出一种基于最小均方误差(MMSE)准则的tanh法则优化近似新方法。提出反对称分布与同构广义对称分布新概念，推导出同构广义对称分布条件下若干重要结论，并给出tanh法则最优近似式的计算实现方法。加性高斯白噪声(AWGN)信道下，对一系列(3,6)规则低密度校验(LDPC)码的实验仿真显示，与传统Hagenauer近似法相比，该最优近似方法在不明显增加译码复杂度前提下，对LDPC码译码性能够带来一定改善。
- LDPC码; Tanh法则; 和积算法; 高斯近似法; MMSE准则
Abstract: In this paper, a new approach is presented for optimizing the approximation of tanh rule based on Minimum Mean Square Error (MMSE) criterion under the Gaussian approximation. New concepts of anti-symmetric distribution and isomorphic generalized symmetric distribution are introduced. Under the isomorphic generalized symmetric distribution, several useful conclusions are drawn, by which a practical method for computing the optimal approximation is also presented. In comparison with the conventional approximation presented by Hagenauer, simulation results for several (3,6) regular Low-Density Parity-Check (LDPC) codes on the Additive White Gaussian Noise (AWGN) channel show that the approach can improve the decoding performance with a little increase in decoding complexity.

HTML全文

参考文献(1)

Callager R C. Low-Density Parity-Check Codes. Cambridge,MA: MIT Press, 1963, Chapter 1.[2]Tanner R M. A recursive approach to low complexity codes.IEEE Trcms. on I匆orm. Theory, 1981, IT-27(5): 533-547.[3]Richardson T J, Shokrollahi M A, Urbanke R L. Design ofcapacity-approaching irregular low-density parity-check codes[J].IEEETrans. onlnform. Theory.2001, 47(2):619-637[4]Luby M C, Mitzenmacher M, Shokrollahi M A, Spielman D A.Efficient erasure correcting codes[J].IEEE Trans. on Inform. Theory.2001, 47(2):569-584[5]Hagenauer J, Offer E,block and convolutionalPapkecodes.L. Iterative decoding of binaryZF.F.F.7YCL12,Son InformTheory,1996, 42(2): 429-445.[6]Ha J, Kim J, McLaughlin S W Rate-compatible puncturing of low-density parity-check codes. IEEE Trans[J].on Inform. Theory.2004, 50(11):2824-2836[7]Chung S Y, Richardson T J, Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Caussian approximation[J].IEEE Trans. on Iorm. Theory.2001, 47(2):657-670[8]Hagenauer J. Source-controlled channel decoding[J].IEEE Trans. on6}mmun.1995, 43(9):2449-2457[9]MacKay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans. on I匆orm. Theory.1999, 45(2):399-431[10]Chen J, Fossorier M. Near optimum universal belief propagation based decoding of low-density parity check codes[J].IEEE Trans. on6}mmun.2002, 50(3):406-414[11]Chen J, Fossorier M. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE Commun. Levers.2002, 6(5):208-210[12]Wei L. Several properties of short LDPC codes[J].IEEE Trans. on Commun.2004, 52(5):721-727

施引文献

资源附件(0)

访问统计