BROWSE
Detail
Journal Article
A Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique
Cited 0 time in 
Share 
Share
- Authors
- Chanho YOON, Hoojin LEE, Joonhyuk KANG
- Issue Date
- 2012-04
- Citation
- IEICE Transactions on Communications, v.E95-B, no.4, pp.1402-1405
- ISSN
- 0916-8516
- Publisher
- 일본, 전자정보통신학회 (IEICE)
- Language
- English
- Type
- Journal Article
- Abstract
- 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. © 2012 The Institute of Electronics, Information and Communication Engineers.
- KSP Keywords
- Computational complexity, Encoding method, Information and communication, LDPC encoding, Linear equations, Low Density Parity Check(LDPC), New approach, Parity bit, Physical Layer, Post-Processing, Quasi-Cyclic(QC)