• DocumentCode
    3532305
  • Title

    The Systematic Form of a Class of Regular Structured LDPC Codes

  • Author

    Xiuni Wang ; Dongqing Xie

  • Author_Institution
    Sch. of Comput. Sci. & Educ. Software, GuangZhou Univ., Guangzhou, China
  • fYear
    2013
  • fDate
    9-11 Sept. 2013
  • Firstpage
    648
  • Lastpage
    651
  • Abstract
    In this paper, we propose a systematic form about a class of regular structured LDPC codes. This class of LDPC codes is quasi-cyclic code with variable node degree dv = 2 on the Tanner graph. The defining parity-check matrices are composed of circulant permutation matrices. By columns permutation, we can locate the information bits and parity check bits easily. Furthermore, the values of associated parity check bits can be calculated directly on the Tanner graph.
  • Keywords
    cyclic codes; graph theory; matrix algebra; parity check codes; Tanner graph; circulant permutation matrix; parity-check matrix; quasicyclic code; regular structured LDPC code; variable node degree; Educational institutions; Encoding; Equations; Generators; Mathematical model; Parity check codes; Systematics; LDPC codes; circulant matrices; efficient encoding; systematic form;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Intelligent Data and Web Technologies (EIDWT), 2013 Fourth International Conference on
  • Conference_Location
    Xi´an
  • Print_ISBN
    978-1-4799-2140-9
  • Type

    conf

  • DOI
    10.1109/EIDWT.2013.116
  • Filename
    6631695
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3532305