• DocumentCode
    496552
  • Title

    LDPC codes based on circulant permutation matrices for fast encoding

  • Author

    Ma, Yizhou ; Lee, Moonho ; Xiao, Yang

  • Author_Institution
    Institute of Info. & Comm., Chonbuk National Univ., Jeonju, 561-756, South Korea
  • fYear
    2006
  • fDate
    6-9 Nov. 2006
  • Firstpage
    1
  • Lastpage
    3
  • Abstract
    In this paper we present a class of algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes which have lower encoding complexity than randomly constructed LDPC codes for the specific structure of their parity-check matrices. Since the parity-check matrices are comprised of blocks of circulant permutation matrices, the storage efficiency can be improved significantly. We also show QC properties and the performance of these codes.
  • Keywords
    circulant permutation matrices; fast encoding; low-density parity-check (LDPC) block codes; quasi-cyclic (QC) codes;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Wireless, Mobile and Multimedia Networks, 2006 IET International Conference on
  • Conference_Location
    hangzhou, China
  • ISSN
    0537-9989
  • Print_ISBN
    0-86341-644-6
  • Type

    conf

  • Filename
    5195502
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=496552