Quasi-cyclic LDPC codes for fast encoding
SCIE
SCOPUS
- Title
- Quasi-cyclic LDPC codes for fast encoding
- Authors
- Myung, S; Yang, K; Kim, J
- Date Issued
- 2005-08
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGI
- Abstract
- In this correspondence we present a special class of quasi-cyclic low-density parity-check (QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient encoding algorithm due to the simple structure of their parity-check matrices. Since the parity-check matrix of a QC-LDPC code consists of circulant permutation matrices or the zero matrix, the required memory for storing it can be significantly reduced, as compared with randomly constructed LDPC codes. We show that the girth of a QC-LDPC code is upper-bounded by a certain number which is determined by the positions of circulant permutation matrices. The B-LDPC codes are constructed as irregular QC-LDPC codes with parity-check matrices of an almost lower triangular form so that they have an efficient encoding algorithm, good noise threshold, and low error floor. Their encoding complexity is linearly scaled regardless of the size of circulant permutation matrices.
- Keywords
- block cycle; circulant permutation matrix; efficient encoding; low-density parity-check (LDPC) codes; quasi-cyclic codes; PARITY-CHECK CODES; MATRICES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/24461
- DOI
- 10.1109/TIT.2005.851753
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 51, no. 8, page. 2894 - 2901, 2005-08
- 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.