A Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique

Chanho YOON  Hoojin LEE  Joonhyuk KANG  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.4   pp.1402-1405
Publication Date: 2012/04/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.1402
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
quasi-cyclic low-density parity-check (QC-LDPC) codes,  LDPC encoder,  dual-diagonal parity-check codes,  

Full Text: PDF(106KB)>>
Buy this Article

A new approach for encoding one class of quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. The proposed encoding method is applicable to parity-check matrices having dual-diagonal parity structure with single column of weight three in the parity generation region. Instead of finding the parity bits directly, the proposed method finds parity bits through vector correction. While the proposed LDPC encoding scheme is readily applicable to matrices defined in the IEEE physical layer standards, the computational complexity of the post processing operation for extraction of correction vector requires less effort than solving the linear equations involved with finding the parity bit as proposed by Myung et al.