A new construction of high performance LDPC matrices for mobile networks

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

Результат исследований: Материалы для журналаСтатья

Аннотация

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.

Язык оригиналаАнглийский
Номер статьи2300
ЖурналSensors (Switzerland)
Том20
Номер выпуска8
DOI
СостояниеОпубликовано - 2 апр 2020

ASJC Scopus subject areas

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

Fingerprint Подробные сведения о темах исследования «A new construction of high performance LDPC matrices for mobile networks». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать