AffiliationUniv Arizona, Sch Elect & Comp Engn
MetadataShow full item record
CitationX. Xiao, B. Vasić, S. Lin, K. Abdel-Ghaffar and W. E. Ryan, "Girth-Eight Reed-Solomon Based QC-LDPC Codes," 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), Hong Kong, Hong Kong, 2018, pp. 1-5. doi: 10.1109/ISTC.2018.8625328
JournalPROCEEDINGS OF 2018 IEEE 10TH INTERNATIONAL SYMPOSIUM ON TURBO CODES & ITERATIVE INFORMATION PROCESSING (ISTC)
Rights© 2018 IEEE.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractThis paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs and results in codes which perform well over the AWGN channel in both waterfall and low error-rate regions.
VersionFinal accepted manuscript
SponsorsNSF [ECCS-1500170, SaTC-1813401]; AppoTech