• DocumentCode
    2363590
  • Title

    Design of bilayer QC-LDPC codes for decode-and forward based cooperative relaying communication

  • Author

    Kong, Lingjun ; Kim, Kyeong Jin ; Kwak, Kyung Sup

  • Author_Institution
    UWB Wireless Commun. Res. Center, Inha Univ., Incheon, South Korea
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    4717
  • Lastpage
    4721
  • Abstract
    In this paper, we study the problem of devising distributed bilayer quasi-cyclic Low-Density Parity-Check (QC-LDPC) codes for cooperative relaying communications. One theorem in designing the bilayer QC-LDPC code without small stopping sets and small girth is proposed, which significantly simplifies the bilayer QC-LDPC codes design. Based on the proposed theorem and the two-hop decode-and-forward (DF) relaying protocol, in which the relay node is used to assist the source to transmit extra parity bits to the destination, a new design method for a distributed irregular bilayer QC-LDPC is developed. It is demonstrated that the overall performance can be improved by using the proposed approach in DF-based cooperative relaying communications. Finally, it is shown that the proposed construction method also leads bilayer QC-LDPC codes to have a bigger minimum distance.
  • Keywords
    cooperative communication; cyclic codes; decode and forward communication; parity check codes; protocols; relays; DF; cooperative relaying communication; decode-and forward communication; distributed irregular bilayer QC-LDPC code; parity bit transmission; quasicyclic low-density parity-check code; small stopping set; two-hop decode-and-forward relaying protocol; Bit error rate; Encoding; Parity check codes; Protocols; Relays; Simulation; Wireless communication; Decode-and-forward protocol; bilayer quasi-cyclic Low-Density Parity-Check (QC-LDPC) codes; stopping set;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (ICC), 2012 IEEE International Conference on
  • Conference_Location
    Ottawa, ON
  • ISSN
    1550-3607
  • Print_ISBN
    978-1-4577-2052-9
  • Electronic_ISBN
    1550-3607
  • Type

    conf

  • DOI
    10.1109/ICC.2012.6363723
  • Filename
    6363723