• DocumentCode
    3125777
  • Title

    A new parity structure with multi-weight circulants for QC LDPC codes

  • Author

    Park, Hosung ; Hong, Seokbeom ; No, Jong-Seon ; Shin, Dong-Joon

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., Seoul, South Korea
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    3093
  • Lastpage
    3097
  • Abstract
    The block dual-diagonal (BDD) parity structure is widely adopted in many practical irregular quasi-cyclic (QC) low-density parity-check (LDPC) codes. These QC LDPC codes have good error-correcting performance in waterfall region but usually show relatively high error floors in low error rate region. In this paper, by using multi-weight circulants, a new BDD structure is proposed for the parity part of irregular QC LDPC codes to lower error floors and support efficient encoding. Since the parity part of parity-check matrices has flexible degree distribution with the aid of multi-weight circulants, QC LDPC codes with the proposed BDD structure can have large minimum Hamming distance compared to those with the conventional BDD structure, especially, in the low-rate case. Simulation results show that QC LDPC codes with the proposed BDD structure have lower error floor than those with the conventional BDD structure.
  • Keywords
    Hamming codes; cyclic codes; error correction codes; matrix algebra; parity check codes; BDD parity structure; QC LDPC codes; block dual-diagonal parity structure; encoding; error floors; error-correcting performance; flexible degree distribution; low-rate case; minimum Hamming distance; multiweight circulants; parity-check matrices; quasi-cyclic low-density parity-check codes; waterfall region; Bit error rate; Boolean functions; Data structures; Encoding; Hamming distance; Indexes; Parity check codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6284131
  • Filename
    6284131