Girth-Eight Reed-Solomon Based QC-LDPC Codes

Xin Xiao, Bane V Vasic, Shu Lin, Khaled Abdel-Ghaffar, William E. Ryan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This 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.

Original languageEnglish (US)
Title of host publication2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
PublisherIEEE Computer Society
ISBN (Electronic)9781538670484
DOIs
StatePublished - Jan 23 2019
Event10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 - Hong Kong, China
Duration: Dec 3 2018Dec 7 2018

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
Volume2018-December
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

Conference10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
CountryChina
CityHong Kong
Period12/3/1812/7/18

Fingerprint

Quasi-cyclic Codes
Reed-Solomon codes
LDPC Codes
Girth
Parity
Reed-Solomon Codes
Masking
Minimum Distance
Graph in graph theory
Error Rate
Cycle
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

Xiao, X., Vasic, B. V., Lin, S., Abdel-Ghaffar, K., & Ryan, W. E. (2019). Girth-Eight Reed-Solomon Based QC-LDPC Codes. In 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 [8625328] (International Symposium on Turbo Codes and Iterative Information Processing, ISTC; Vol. 2018-December). IEEE Computer Society. https://doi.org/10.1109/ISTC.2018.8625328

Girth-Eight Reed-Solomon Based QC-LDPC Codes. / Xiao, Xin; Vasic, Bane V; Lin, Shu; Abdel-Ghaffar, Khaled; Ryan, William E.

2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018. IEEE Computer Society, 2019. 8625328 (International Symposium on Turbo Codes and Iterative Information Processing, ISTC; Vol. 2018-December).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xiao, X, Vasic, BV, Lin, S, Abdel-Ghaffar, K & Ryan, WE 2019, Girth-Eight Reed-Solomon Based QC-LDPC Codes. in 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018., 8625328, International Symposium on Turbo Codes and Iterative Information Processing, ISTC, vol. 2018-December, IEEE Computer Society, 10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018, Hong Kong, China, 12/3/18. https://doi.org/10.1109/ISTC.2018.8625328
Xiao X, Vasic BV, Lin S, Abdel-Ghaffar K, Ryan WE. Girth-Eight Reed-Solomon Based QC-LDPC Codes. In 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018. IEEE Computer Society. 2019. 8625328. (International Symposium on Turbo Codes and Iterative Information Processing, ISTC). https://doi.org/10.1109/ISTC.2018.8625328
Xiao, Xin ; Vasic, Bane V ; Lin, Shu ; Abdel-Ghaffar, Khaled ; Ryan, William E. / Girth-Eight Reed-Solomon Based QC-LDPC Codes. 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018. IEEE Computer Society, 2019. (International Symposium on Turbo Codes and Iterative Information Processing, ISTC).
@inproceedings{36c717f95763464f836480b0b46fa023,
title = "Girth-Eight Reed-Solomon Based QC-LDPC Codes",
abstract = "This 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.",
author = "Xin Xiao and Vasic, {Bane V} and Shu Lin and Khaled Abdel-Ghaffar and Ryan, {William E.}",
year = "2019",
month = "1",
day = "23",
doi = "10.1109/ISTC.2018.8625328",
language = "English (US)",
series = "International Symposium on Turbo Codes and Iterative Information Processing, ISTC",
publisher = "IEEE Computer Society",
booktitle = "2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018",

}

TY - GEN

T1 - Girth-Eight Reed-Solomon Based QC-LDPC Codes

AU - Xiao, Xin

AU - Vasic, Bane V

AU - Lin, Shu

AU - Abdel-Ghaffar, Khaled

AU - Ryan, William E.

PY - 2019/1/23

Y1 - 2019/1/23

N2 - This 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.

AB - This 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.

UR - http://www.scopus.com/inward/record.url?scp=85062393657&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062393657&partnerID=8YFLogxK

U2 - 10.1109/ISTC.2018.8625328

DO - 10.1109/ISTC.2018.8625328

M3 - Conference contribution

AN - SCOPUS:85062393657

T3 - International Symposium on Turbo Codes and Iterative Information Processing, ISTC

BT - 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018

PB - IEEE Computer Society

ER -