By Topic

Performance of bilayer-lengthened LDPC codes under joint decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Azmi, M.H. ; Sch. of Electr. Eng. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia ; Jinhong Yuan

This paper presents an LDPC code design for decode-and-forward (DF) relay systems. Our design is based on the graphical family of the bilayer-lengthened LDPC codes (BL-LDPC) when joint decoding is performed over the overall expanded graph. To design the BL-LDPC codes under joint decoding, we use the framework of the multi-edge type LDPC (MET-LDPC) codes to represent and optimize the codes. The optimum overall expanded graph of the BL-LDPC codes is found using differential evolution. We demonstrate that a properly designed expanded BL-LDPC code performs asymptotically within 0.1222 dB and 0.10775 dB from the theoretical limits.

Published in:

Information Theory Workshop, 2009. ITW 2009. IEEE

Date of Conference:

11-16 Oct. 2009