Welcome to Journal of Beijing Institute of Technology
Advance Search
Volume 18Issue 3
.
Turn off MathJax
Article Contents
Article Navigation> JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY> 2009> 18(3): 361-364
HAN Dong, SUN Hua-fei, YAN Da-yuan. Information Geometry and Low Density Parity Check Codes[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2009, 18(3): 361-364.
Citation: HAN Dong, SUN Hua-fei, YAN Da-yuan. Information Geometry and Low Density Parity Check Codes[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2009, 18(3): 361-364.
shu

Information Geometry and Low Density Parity Check Codes

  • 1.

    School of Science, Beijing Institute of Technology, Beijing 100081, China

  • 2.

    School of Optoelectronics, Beijing Institute of Technology, Beijing 100081, China

  • Received Date:2008-07-11
    Abstract
  • The application of information geometry in the low density parity check (LDPC) codes based on the work of Ikeda and Amari is considered. The method is to turn the decoding process into the change of the parameter. When the LDPC decoding procedure converges, both the convergent probability distribution and the true probability distribution belong to the same submanifold, but this does not mean they are equimarginal, that points out the origin of the decoding error.
    • FullText(HTML)
  • loading
    • References (9)
  • [1]
    Amari S. Dierential-geometrical methods in statistics[M]. New York: Springer-Verlag, 1985.
    [2]
    Amari S, Nagaoka H. Methods of information geometry[M]. Oxford: Oxford University Press, 2000.
    [3]
    Berrou C, Glavieux A. Near optimum error correcting coding and decoding: Turbo-codes[J]. IEEE Trans Commun, 1996, 44: 1261-1271.
    [4]
    Ikeda S, Tanaka T, Amari S. Information geometrical of turbo codes and low-density parity-check codes[J]. IEEE Trans Inform Theory, 2004, 50: 1097-1114.
    [5]
    Ikeda S, Tanaka T, Amari S. Stochastic reasoning, free energy and information geometry[J]. Neural Computation, 2004, 16: 1779-1810.
    [6]
    Amari S. Information geometry of the EM and em algorithm for neural networks[J]. Neural Networks, 1995, 8: 1379-1408.
    [7]
    Amari S, Kurata K, Nagaoka H. Information geometry of Boltzmann machines[J]. IEEE Trans Neural Networks, 1992, 3: 260-271.
    [8]
    Ikeda S, Tanaka T, Amari S. Information-geometrical significance of sparsity in Gallager code[J]. Adv Neur Inf Pro Sys, 2002, 14(1): 407-414.
    [9]
    Gallager R G. Low-density parity-check code[J]. IRE Trans IT, 1962, 8(1): 21-28. (Edited by
    • Relative Articles
  • Supplements (0)
  • Cited By
  • 加载中

Catalog

    通讯作者:陈斌, bchen63@163.com
    • 1.

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (254) PDF downloads(46) Cited by()
    Proportional views
    Related

    Address:5 Zhongguancun South Street, Haidian District, Beijing

    Tel:86-10-68914374

    Email:blgywb@bit.edu.cn

    Copy Right © Journal of Beijing Institute of Technology

    Supported by:Beijing Renhe Information Technology Co. Ltd

    /

      Return
      Return
        Baidu
        map