By Topic

A design of nonprime block irregular LDPC codes via CRT

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
$33 $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

4 Author(s)
Chalit Chusin ; College of Data Storage Technology and Applications, King Mongkut's Institute of Technology Ladkrabang, BKK 10520, Thailand ; Chutima Prasartkaew ; Sekson Timakul ; Somsak Choomchuay

This paper presents a new design of irregular LDPC codes that supports arbitrary block length. We propose the efficient construction method when nonprime size sub-matrices are used. The problem where GCD (L1,L2) ≠ 1 that left unsolved has been tackled. We also consider the case GCD (L1,L2) = 1 but L1 or L2 is a nonprime number. The results show that our designed codes have superior performance compared to MAC. The resulted codes still hold the attractive properties of LDPC codes. The performances of interleaved codes are higher than noninterleaved codes and it goes higher as SNR is increased.

Published in:

Communications and Information Technologies (ISCIT), 2010 International Symposium on

Date of Conference:

26-29 Oct. 2010