Please use this identifier to cite or link to this item:
|Title:||Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization||Authors:||Han, Guojun
Guan, Yong Liang
|Keywords:||Approximate cycle EMD (ACE)
|Issue Date:||2014||Source:||Han, G., Guan, Y. L., & Kong, L. (2014). Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization. IEEE Communications Letters, 18(2), 348-351.||Series/Report no.:||IEEE Communications Letters||Abstract:||Quasi-cyclic low-density parity-check (QC-LDPC) codes constructed by using algebraic approaches, such as finite geometry and finite field, generally have good structural properties and very low error-floors, and facilitate hardware implementation. Irregular QC-LDPC codes constructed from such QC-LDPC codes by using the masking technique, when decoded with the sum-product algorithm (SPA), have low decoding complexity, but often show early error-floors. In this paper, the relationship of cycle, girth and approximate cycle EMD (ACE) between the masking matrix and masked matrix is investigated, and the ACE algorithm is modified and used to construct the masking matrix for irregular QC-LDPC codes. Simulations demonstrate that the codes constructed by masking with ACE optimization exhibit much improved waterfall performance and lower error floors.||URI:||https://hdl.handle.net/10356/81626
|ISSN:||1089-7798||DOI:||10.1109/LCOMM.2014.010214.132463||Rights:||© 2014 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.