A new construction of high performance LDPC matrices for mobile networks

Moein Sarvaghad-Moghaddam, Waheed Ullah, Dushantha Nalin K. Jayakody, Sofiéne Affes

Research output: Contribution to journalArticle

Abstract

Secure and reliable information flow is one of the main challenges in social IoT and mobile networks. Information flow and data integrity is still an open research problem. In this paper, we develop new methods of constructing systematic and regular Low-Density Parity-Check Matrices (LDPCM), inspired by the structure of the Sarrus method and geometric designs. Furthermore, these codes have cyclic structure and therefore, are less complex in computation and also require less memory in hardware implementation. Besides, an optimal method of post-processing for deleting girths four is presented. Numerical results show that the codes constructed by these methods perform well over the additive white Gaussian noise (AWGN) channel when decoded with the sum-product LDPC iterative algorithms. The proposed methods can be very efficient in terms of reducing memory consumption and improving the convergence speed of the decoder particularly in IoT and mobile networks.

Original languageEnglish
Article number2300
JournalSensors (Switzerland)
Volume20
Issue number8
DOIs
Publication statusPublished - 2 Apr 2020

Keywords

  • IoT
  • LDPC
  • Mobile networks
  • Quasi-cyclic (QC) LDPC
  • Regular parity check matrix

ASJC Scopus subject areas

  • Analytical Chemistry
  • Biochemistry
  • Atomic and Molecular Physics, and Optics
  • Instrumentation
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A new construction of high performance LDPC matrices for mobile networks'. Together they form a unique fingerprint.

  • Cite this