Referenced Items are not available for this document.
In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QCLDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.
Published in:
Communications Letters, IEEE
(Volume:13
,
Issue:
5
)
Date of Publication: May 2009
- Page(s):
- 342 - 344
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 10666467
- Digital Object Identifier :
- 10.1109/LCOMM.2009.082115
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 26 May 2009
- Issue Date :
- May 2009
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
