Low density parity check codes: Construction based on finite geometries

被引：0
|
作者：
Kou, Y [1 ]
Lin, S [1 ]
Fossorier, MPC [1 ]
机构：
[1] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
来源：
GLOBECOM '00: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1- 3 | 2000年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Low density parity check (LDPC) codes with iterative decoding based on belief propagation (IDBP) achieve astonishing error performance close to the Shannon limit. Until now there is no known method for constructing these Shannon limit approaching codes systematically Good LDPC codes are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This paper presents the first algebraic method for constructing LDPC codes systematically based on finite analytic geometries. Four classes of finite geometry LDPC codes with relatively good minimum distances are constructed. Theses codes are either cyclic or quasi-cyclic and therefore their encoding can be implemented with simple linear feedback shift registers. Long finite geometry LDPC codes have been constructed and they achieve an error performance only a few tenths of a dB away from the Shannon limit. Finite geometry LDPC codes are strong competitors to turbo codes for error control in commucation and digital data storage systems.
引用
收藏
页码：825 / 829
页数：5
相关论文
共 50 条
  • [1] Low density parity check codes based on finite geometries: A rediscovery
    Kou, Y
    Lin, S
    Fossorier, MPC
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 200 - 200
  • [2] Low-density parity-check codes based on finite geometries: A rediscovery and new results
    Kou, Y
    Lin, S
    Fossorier, MPC
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 2711 - 2736
  • [3] Low-density parity-check codes based on finite geometries: A rediscovery and new results
    Kou, Y. (ykou@att.net), 2001, Institute of Electrical and Electronics Engineers Inc. (47)
  • [4] Hybrid iterative decoding for low-density parity-check codes based on finite geometries
    Li, Jian
    Zhang, Xian-Da
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (01) : 29 - 31
  • [5] Some low-density parity-check codes derived from finite geometries
    Peter Vandendriessche
    Designs, Codes and Cryptography, 2010, 54 : 287 - 297
  • [6] Minimum distances of three families of low-density parity-check codes based on finite geometries
    Feng, Yanan
    Deng, Shuo
    Wang, Lu
    Ma, Changli
    FRONTIERS OF MATHEMATICS IN CHINA, 2016, 11 (02) : 279 - 289
  • [7] Some low-density parity-check codes derived from finite geometries
    Vandendriessche, Peter
    DESIGNS CODES AND CRYPTOGRAPHY, 2010, 54 (03) : 287 - 297
  • [8] Generalized quasi-cyclic low-density parity-check codes based on finite geometries
    Vo Tam Van
    Matsui, Hajime
    Mita, Seiichi
    2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 158 - 162
  • [9] Minimum distances of three families of low-density parity-check codes based on finite geometries
    Yanan Feng
    Shuo Deng
    Lu Wang
    Changli Ma
    Frontiers of Mathematics in China, 2016, 11 : 279 - 289
  • [10] A construction for irregular low density parity check convolutional codes
    Sridharan, A
    Sridhara, D
    Costello, DJ
    Fuja, TE
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 4 - 4
12345