A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem
SCIE
SCOPUS
- Title
- A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem
- Authors
- Myung, S; Yang, KC
- Date Issued
- 2005-09
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGI
- Abstract
- In this paper we propose a method of constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of large length by combining QC-LDPC codes of small length as their component codes, via the Chinese Remainder Theorem. The girth of the QC-LDPC codes obtained by the proposed method is always larger than or equal to that of each component code. By applying the method to array codes, we present a family of high-rate regular QC-LDPC codes with no 4-cycles. Simulation results show that they have almost the same performance as random regular LDPC codes.
- Keywords
- Chinese Remainder Theorem; circulant permutation matrix; low-density parity-check (LDPC) codes; quasi-cyclic; PARITY-CHECK CODES; MATRICES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/24396
- DOI
- 10.1109/LCOMM.2005.1506715
- ISSN
- 1089-7798
- Article Type
- Article
- Citation
- IEEE COMMUNICATIONS LETTERS, vol. 9, no. 9, page. 823 - 825, 2005-09
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.