Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Carleton University

$38,000.00

Codes and Latices: Construction and Decoding Algorithms

EF 2023-24

Résumé
The overall area of my research is coding theory and cryptographic techniques for reliable and secure communications. Coding theory developments have revolutionized the way coding is applied to practical systems, affecting also the design of high speed modems. These developments are related to turbo, polar and all low density parity-check (LDPC) codes and lattices codes. Lattice coding has several applications in communications: quantization and signal constellation. Lattices can be divided into two categories including  classical (low dimensional) ones with optimal decoders, and modern (high dimensions) lattices with suboptimal decoders. The modern lattice coding era starts with the construction of LDPC lattices in my PhD thesis. Algebraic lattices have underlying codes. Some of these codes have a rather high-density parity-check (HDPC) matrix. Applying iterative algorithms to decode the most well-known algebraic codes would result in poor performance when compared to maximum likelihood decoder. To resolve this problem, deep neural network decoders were proposed. In recent years, deep learning methods have shown amazing performances in a variety of subjects. It has been shown that deep learning methods improve the min-sum and sum-product algorithms for HDPC codes. The main benefit of neural network decoder is that the weight of every edge of its underlying graph relies on its influence in the transmitting messages. By setting weights properly, we can compensate for small cycles, which are the main cause of high error floor regions and deterioration of the decoding process. So, about construction and performance analysis of modern lattices my goals are: 1) To provide neural network lattice decoding algorithms to decode algebraic lattices with a rather HDPC matrix. 2) To construct multi-level Quasi-cyclic LDPC (QC-LDPC) lattices and to present a multi-stage decoder for these lattices. Among all LDPC codes, QC-LDPC codes and Spatially coupled LDPC (SC-LDPC) codes are two essential categories that are preferred to other types of LDPC codes because of their practical and simple implementations. Regarding the construction of these codes my goals are: 1) To propose a new approach to construct SC-LDPC codes and establish a close connection between QC-LDPC codes and SC-LDPC codes. 2) To improve analytical lower bounds on the constraint length of SC-LDPC codes and some techniques to reduce the search space. 3) To provide a neural decoder version of the Sliding Window method to decode SC-LDPC codes. Regarding to graphical structures such as trapping sets and absorbing sets in LDPC codes my goals are: 1) Using graph theory and combinatorics to characterize elementary trapping sets in Tanner graph of QC-LDPC codes with different girths. 2) Construction of QC-LDPC codes whose Tanner graphs are free of some trapping sets with small size. 3) Characterization of absorbing sets in the Tanner graph of SC-LDPC convolutional codes.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2019-06180
Name nom
Rafsanjani Sadeghi, Mohammad Reza
Department département
Mthematics and Statistics
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2019
Award amount
38000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
9999
Research subject group en
Not available
Research subject group fr
Not available
Research subject en
Non disponible
Research subject fr
Non disponible
Application title
Codes and Latices: Construction and Decoding Algorithms
Keyword
Algorithms; Coding theory; Cryptography; Graph theory; Lattice codes
Application summary
The overall area of my research is coding theory and cryptographic techniques for reliable and secure communications. Coding theory developments have revolutionized the way coding is applied to practical systems, affecting also the design of high speed modems. These developments are related to turbo, polar and all low density parity-check (LDPC) codes and lattices codes. Lattice coding has several applications in communications: quantization and signal constellation. Lattices can be divided into two categories including  classical (low dimensional) ones with optimal decoders, and modern (high dimensions) lattices with suboptimal decoders. The modern lattice coding era starts with the construction of LDPC lattices in my PhD thesis. Algebraic lattices have underlying codes. Some of these codes have a rather high-density parity-check (HDPC) matrix. Applying iterative algorithms to decode the most well-known algebraic codes would result in poor performance when compared to maximum likelihood decoder. To resolve this problem, deep neural network decoders were proposed. In recent years, deep learning methods have shown amazing performances in a variety of subjects. It has been shown that deep learning methods improve the min-sum and sum-product algorithms for HDPC codes. The main benefit of neural network decoder is that the weight of every edge of its underlying graph relies on its influence in the transmitting messages. By setting weights properly, we can compensate for small cycles, which are the main cause of high error floor regions and deterioration of the decoding process. So, about construction and performance analysis of modern lattices my goals are: 1) To provide neural network lattice decoding algorithms to decode algebraic lattices with a rather HDPC matrix. 2) To construct multi-level Quasi-cyclic LDPC (QC-LDPC) lattices and to present a multi-stage decoder for these lattices. Among all LDPC codes, QC-LDPC codes and Spatially coupled LDPC (SC-LDPC) codes are two essential categories that are preferred to other types of LDPC codes because of their practical and simple implementations. Regarding the construction of these codes my goals are: 1) To propose a new approach to construct SC-LDPC codes and establish a close connection between QC-LDPC codes and SC-LDPC codes. 2) To improve analytical lower bounds on the constraint length of SC-LDPC codes and some techniques to reduce the search space. 3) To provide a neural decoder version of the Sliding Window method to decode SC-LDPC codes. Regarding to graphical structures such as trapping sets and absorbing sets in LDPC codes my goals are: 1) Using graph theory and combinatorics to characterize elementary trapping sets in Tanner graph of QC-LDPC codes with different girths. 2) Construction of QC-LDPC codes whose Tanner graphs are free of some trapping sets with small size. 3) Characterization of absorbing sets in the Tanner graph of SC-LDPC convolutional codes.