Regular non-binary quasi-cyclic LDPC codes for high-rate applications

Murat Arabaci, Ivan B Djordjevic, Ross Saunders, Roberto M. Marcoccia

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

Abstract

The parity-check matrix of a non-binary low-density parity-check (LDPC) code over GF(q) is constructed by assigning non-zero elements from GF(q) to the 1s in that of the corresponding binary LDPC code. In this paper, we provide a theorem that establishes a necessary and sufficient condition that a q-ary matrix constructed by assigning non-zero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic LDPC code must satisfy in order for its null-space to define a non-binary quasicyclic LDPC (NB-QC-LDPC) code over GF(q). We then propose a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes that might serve better for different design goals. We also demonstrate that NBQC-LDPC codes are very suitable for high-rate applications, e.g. applications in magnetic recording and storage systems and optical communication systems.

Original languageEnglish (US)
Title of host publicationProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
Pages764-769
Number of pages6
DOIs
StatePublished - 2009
Event2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 - Leipzig, Germany
Duration: Jun 21 2009Jun 24 2009

Other

Other2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
CountryGermany
CityLeipzig
Period6/21/096/24/09

Fingerprint

Magnetic storage
Magnetic recording
Optical communication
Communication systems

Keywords

  • Low-density parity-check codes
  • Non-binary quasi-cyclic codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Cite this

Arabaci, M., Djordjevic, I. B., Saunders, R., & Marcoccia, R. M. (2009). Regular non-binary quasi-cyclic LDPC codes for high-rate applications. In Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 (pp. 764-769) https://doi.org/10.1145/1582379.1582545

Regular non-binary quasi-cyclic LDPC codes for high-rate applications. / Arabaci, Murat; Djordjevic, Ivan B; Saunders, Ross; Marcoccia, Roberto M.

Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. p. 764-769.

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

Arabaci, M, Djordjevic, IB, Saunders, R & Marcoccia, RM 2009, Regular non-binary quasi-cyclic LDPC codes for high-rate applications. in Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. pp. 764-769, 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009, Leipzig, Germany, 6/21/09. https://doi.org/10.1145/1582379.1582545
Arabaci M, Djordjevic IB, Saunders R, Marcoccia RM. Regular non-binary quasi-cyclic LDPC codes for high-rate applications. In Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. p. 764-769 https://doi.org/10.1145/1582379.1582545
Arabaci, Murat ; Djordjevic, Ivan B ; Saunders, Ross ; Marcoccia, Roberto M. / Regular non-binary quasi-cyclic LDPC codes for high-rate applications. Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. pp. 764-769
@inproceedings{91a1cbd0750f4f70bda7e23a9345d5c2,
title = "Regular non-binary quasi-cyclic LDPC codes for high-rate applications",
abstract = "The parity-check matrix of a non-binary low-density parity-check (LDPC) code over GF(q) is constructed by assigning non-zero elements from GF(q) to the 1s in that of the corresponding binary LDPC code. In this paper, we provide a theorem that establishes a necessary and sufficient condition that a q-ary matrix constructed by assigning non-zero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic LDPC code must satisfy in order for its null-space to define a non-binary quasicyclic LDPC (NB-QC-LDPC) code over GF(q). We then propose a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes that might serve better for different design goals. We also demonstrate that NBQC-LDPC codes are very suitable for high-rate applications, e.g. applications in magnetic recording and storage systems and optical communication systems.",
keywords = "Low-density parity-check codes, Non-binary quasi-cyclic codes",
author = "Murat Arabaci and Djordjevic, {Ivan B} and Ross Saunders and Marcoccia, {Roberto M.}",
year = "2009",
doi = "10.1145/1582379.1582545",
language = "English (US)",
isbn = "9781605585697",
pages = "764--769",
booktitle = "Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009",

}

TY - GEN

T1 - Regular non-binary quasi-cyclic LDPC codes for high-rate applications

AU - Arabaci, Murat

AU - Djordjevic, Ivan B

AU - Saunders, Ross

AU - Marcoccia, Roberto M.

PY - 2009

Y1 - 2009

N2 - The parity-check matrix of a non-binary low-density parity-check (LDPC) code over GF(q) is constructed by assigning non-zero elements from GF(q) to the 1s in that of the corresponding binary LDPC code. In this paper, we provide a theorem that establishes a necessary and sufficient condition that a q-ary matrix constructed by assigning non-zero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic LDPC code must satisfy in order for its null-space to define a non-binary quasicyclic LDPC (NB-QC-LDPC) code over GF(q). We then propose a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes that might serve better for different design goals. We also demonstrate that NBQC-LDPC codes are very suitable for high-rate applications, e.g. applications in magnetic recording and storage systems and optical communication systems.

AB - The parity-check matrix of a non-binary low-density parity-check (LDPC) code over GF(q) is constructed by assigning non-zero elements from GF(q) to the 1s in that of the corresponding binary LDPC code. In this paper, we provide a theorem that establishes a necessary and sufficient condition that a q-ary matrix constructed by assigning non-zero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic LDPC code must satisfy in order for its null-space to define a non-binary quasicyclic LDPC (NB-QC-LDPC) code over GF(q). We then propose a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes that might serve better for different design goals. We also demonstrate that NBQC-LDPC codes are very suitable for high-rate applications, e.g. applications in magnetic recording and storage systems and optical communication systems.

KW - Low-density parity-check codes

KW - Non-binary quasi-cyclic codes

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

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

U2 - 10.1145/1582379.1582545

DO - 10.1145/1582379.1582545

M3 - Conference contribution

SN - 9781605585697

SP - 764

EP - 769

BT - Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

ER -