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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 487
  • Download : 40
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.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2012-04
Language
English
Article Type
Article
Keywords

CHECK CODES; MATRICES

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E95B, no.4, pp.1402 - 1405

ISSN
0916-8516
DOI
10.1587/transcom.E95.B.1402
URI
http://hdl.handle.net/10203/101524
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0