Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Engage Grants Program

Carleton University

$25,000.00

Error floor analysis of left-regular LDPC codes

EF 2013-14

Résumé
Error correcting codes (ECC) are an essential part of any communication system to ensure the reliability of communication at the presence of noise and interference. Iterative coding schemes including low-density parity-check (LDPC) codes are prime candidates for future generations of ECC. One of the main challenges for the application of LDPC codes in optical communications is the very low error rate requirement in such systems (in the oder of $10^{-15}$ to $10^{-17}$). Currently, in the absence of analytical results, evaluating a given code and reliably estimating its error floor at such low error rates would require months of Monte Carlo simulations even on the fastest computers. Hardware emulations would also take weeks to reach such error rates. There exist a variety of estimation techniques, mostly based on the theory of Importance Sampling, that can speed up the process of error floor estimation, but those techniques all rely on having reliable information about certain problematic structures in the code, referred to as trapping sets. Not surprisingly, attaining such information is in general a very hard problem. Threfore, even if one uses such techniques to estimate the error floor faster, there is no guarantee that the estimate is accurate. As a result, the common practice in the literature is to verify the accuracy of the estimates by Monte Carlo simulations. This defeats the whole purpose of devising estimation techniques that are faster than Monte Carlo simulations. In this project, the goal is to devise a fast technique that can reliably estimate the error floor of regular LDPC codes. Regular codes are of particular interest in optical communications as they are known to have lower error floors compared to their irregular counterparts. The proposed technique will allow our industrial partner, Infinera, to efficiently evaluate different LDPC code candidates currently considered for possible adoption in future optical systems. This will save Infinera a tremendous amount of time and computational resources. It also provides the company with an analytical tool for rigorous evaluation of LDPC codes in the error floor region, something that is currently missing in the industry.
Programme
Engage Grants Program
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
451340-2013
Name nom
Banihashemi, Amir
Department département
Systems and Computer Engineering
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2013
Award amount
25000
Program id
EGP
Program name en
Engage Grants Program
Program name fr
Programme de subventions d'engagement partenariat
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
1553
Committee name en
Ontario Internal Decision Committee
Committee name fr
Comité de décision interne pour l'Ontario
Area of application code
805
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Communications technologies (satellites, radar, etc.)
Area of application fr
Technologie des télécommunications (satellites, radar,etc.)
Research subject code
2500
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Electrical and electronic engineering
Research subject fr
Génie électrique et électronique
Partie
1
Nb partie
1
Application title
Error floor analysis of left-regular LDPC codes
Keyword
NSERC
Application summary
Error correcting codes (ECC) are an essential part of any communication system to ensure the reliability of communication at the presence of noise and interference. Iterative coding schemes including low-density parity-check (LDPC) codes are prime candidates for future generations of ECC. One of the main challenges for the application of LDPC codes in optical communications is the very low error rate requirement in such systems (in the oder of $10^{-15}$ to $10^{-17}$). Currently, in the absence of analytical results, evaluating a given code and reliably estimating its error floor at such low error rates would require months of Monte Carlo simulations even on the fastest computers. Hardware emulations would also take weeks to reach such error rates. There exist a variety of estimation techniques, mostly based on the theory of Importance Sampling, that can speed up the process of error floor estimation, but those techniques all rely on having reliable information about certain problematic structures in the code, referred to as trapping sets. Not surprisingly, attaining such information is in general a very hard problem. Threfore, even if one uses such techniques to estimate the error floor faster, there is no guarantee that the estimate is accurate. As a result, the common practice in the literature is to verify the accuracy of the estimates by Monte Carlo simulations. This defeats the whole purpose of devising estimation techniques that are faster than Monte Carlo simulations. In this project, the goal is to devise a fast technique that can reliably estimate the error floor of regular LDPC codes. Regular codes are of particular interest in optical communications as they are known to have lower error floors compared to their irregular counterparts. The proposed technique will allow our industrial partner, Infinera, to efficiently evaluate different LDPC code candidates currently considered for possible adoption in future optical systems. This will save Infinera a tremendous amount of time and computational resources. It also provides the company with an analytical tool for rigorous evaluation of LDPC codes in the error floor region, something that is currently missing in the industry.