ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 A Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
윤찬호, 이후진, 강준혁
발행일
201204
출처
IEICE Transactions on Communications, v.E95-B no.4, pp.1402-1405
ISSN
0916-8516
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transcom.E95.B.1402
협약과제
12PI2700, 모바일 실시간 인접 서비스를 위한 분산형 단말간 통신 기술 개발, 권동승
초록
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.
키워드
Dual-diagonal parity-check codes, LDPC encoder, Quasi-cyclic low-density parity-check (QC-LDPC) codes
KSP 제안 키워드
Computational complexity, Encoding method, Information and communication, LDPC Encoder, LDPC encoding, Linear equations, Low Density Parity Check(LDPC), New approach, Parity bit, Parity check codes, Physical Layer