• DocumentCode
    2781876
  • Title

    An Efficient Method of Constructing Quasi-Cyclic Low-Density Parity-Check Codes

  • Author

    Wu, Zhanji ; Cheng, Jiao

  • Author_Institution
    Sch. of Inf. & Telecommun., Beijing Univ. of Posts & Telecommun. Beijing, Beijing, China
  • fYear
    2012
  • fDate
    3-6 Sept. 2012
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    An efficient method of constructing irregular quasi-cyclic (QC) low-density parity-check (LDPC) codes is proposed. In order to find the degree distribution with low convergence threshold, the extrinsic information transfer (EXIT) chart is utilized to optimize the degree distribution of LDPC codes. Then, a modified progressive edge growth (PEG) algorithm is used to get the mask matrix with the optimal degree distribution. Finally, the parity-check matrix of QC LDPC code is constructed based on the mask matrix, and the shift values are optimized to eliminate short cycles. Simulation results show that the constructed irregular QC LDPC codes with optimized degree distribution significantly outperform the regular QC LDPC codes in the additive white Gaussion noise (AWGN) channel.
  • Keywords
    AWGN channels; convergence; cyclic codes; matrix algebra; parity check codes; AWGN channel; EXIT chart; additive white Gaussion noise channel; convergence threshold; degree distribution; extrinsic information transfer chart; irregular QC LDPC codes; irregular quasicyclic low-density parity-check codes; mask matrix; modified PEG algorithm; modified progressive edge growth algorithm; optimal degree distribution; regular QC LDPC codes; shift values; short cycles elimination; Algorithm design and analysis; Convergence; Decoding; Iterative decoding; Optimization; Signal to noise ratio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Vehicular Technology Conference (VTC Fall), 2012 IEEE
  • Conference_Location
    Quebec City, QC
  • ISSN
    1090-3038
  • Print_ISBN
    978-1-4673-1880-8
  • Electronic_ISBN
    1090-3038
  • Type

    conf

  • DOI
    10.1109/VTCFall.2012.6398992
  • Filename
    6398992