A design of nonprime block irregular LDPC codes via CRT

Simple item page
dc.contributor.authorChusin, Chalit
dc.contributor.authorPrasartkaew, Chutima
dc.contributor.authorTimakul, Sekson
dc.contributor.authorChoomchuay, Somsak
dc.date.accessioned2026-08-06T10:01:27Z
dc.date.available2026-08-06T10:01:27Z
dc.date.issued2010-12-01
dc.description.abstractThis 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(L<inf>1</inf>,L <inf>2</inf>) that left unsolved has been tackled. We also consider the case GCD(L<inf>1</inf>,L<inf>2</inf>)=1 but L<inf>1</inf> or L<inf>2</inf> 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. ©2010 IEEE.
dc.identifier.citationIscit 2010 2010 10th International Symposium on Communications and Information Technologies, 1050-1055, 2010
dc.identifier.doi10.1109/ISCIT.2010.5665144
dc.identifier.other2-s2.0-78651252758
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/3398
dc.sourceIscit 2010 2010 10th International Symposium on Communications and Information Technologies
dc.subjectCRT
dc.subjectInterleave
dc.subjectIrregular
dc.subjectLDPC codes
dc.subjectNonprime
dc.titleA design of nonprime block irregular LDPC codes via CRT
dc.typeConference Paper

Files

Collections

Research