• DocumentCode
    2985909
  • Title

    Design of multi-edge type bilayer-expurgated LDPC codes

  • Author

    Azmi, Marwan H. ; Yuan, Jinhong

  • Author_Institution
    Sch. of Electr. Eng. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    1988
  • Lastpage
    1992
  • Abstract
    This paper presents a new bilayer-expurgated LDPC (BE-LDPC) code design for decode-and-forward relay system. The code design is based on the multi-edge type LDPC (MET-LDPC) code structure. The lower and upper graphs´ edges of the BE-LDPC codes are represented via different edge types. We call the codes as multi-edge type bilayer-expurgated LDPC (MET-BE-LDPC) codes. We derive the relationship between the lower and the overall graphs of the MET-BE-LDPC codes using the multi-edge type multinomials. This relationship acts as a constraint in optimizing the MET-BE-LDPC codes under the density evolution. We apply the differential evolution algorithm to search for the best MET-BE-LDPC codes. Applying the proposed methodology, two MET-BE-LDPC codes are designed. The codes perform asymptotically within 0.08474-0.5087 dB from the theoretical limits. Finally, we demonstrate that the proposed methodology can be used to design the BE-LDPC codes at a larger source-to-relay and source-to-destination SNR differences.
  • Keywords
    graph theory; parity check codes; decode-and-forward relay system; differential evolution algorithm; multi-edge type bilayer-expurgated LDPC codes design; source-to-destination; source-to-relay; Australia; Communication systems; Constraint optimization; Data communication; Decoding; Design methodology; Parity check codes; Relays; Robustness; Telecommunication network reliability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5205732
  • Filename
    5205732