Grant: Discovery Grants Program - Individual
École de technologie supérieure
$33,000.00
Self-optimizing decoders for modern error-correcting codes that promote energy efficiency on the basis sufficient quality
FY 2022-23
Summary
Channel coding is an essential ingredient of all modern communication systems. Decoders of such codes are often one of the most computationally intensive and power hungry task in modern wireless receivers. One of the latest innovations in channel coding are polar codes, a type of codes that can provably achieve the capacity of all practically relevant channels. The widely-recognized disruptive impact of these codes is illustrated by the recent, rapid adoption of this class of codes as part of 3GPP's next-generation mobile-communication standard (5G). Despite the recent progress in the design of advanced decoding algorithms and corresponding decoders, compared to the achievements of 20+ research years in efficient decoder design for the competing low-density parity-check (LDPC) and turbo codes, polar decoders are still in their infancy, lagging behind in terms of area and energy efficiency.An important and fundamental reason for the limited (area and energy) efficiency of todays polar decoders is deeply rooted in the nature of close-to-optimal decoding strategies. These advanced algorithms explore multiple hypotheses to maximize the chance for success (i.e., finding the correct codeword). Unfortunately, in order to always meet expectations on sampling rate, throughput, and latency, all of these hypotheses must typically be considered in parallel whereas the competing codes use iterative schemes. In practice, this leads to severe overhead, notably in terms of area and power consumption, which is unnecessary under the most frequent average operating conditions. Most of the resources are wasted on calculations for results that are, in the end, discarded.The proposed research program focuses on the creation of novel algorithms and decoder implementations (software or hardware) for polar codes that are energy efficient while catering sufficient quality for the application. The broader objective is to demonstrate that not only we can live with the uncertainty of a variable runtime but that by doing so the energy efficiency is improved.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2018-04284
Name nom
Giard, Pascal
Department département
Génie électrique - Génie électrique
Organization id
53
Institution établissement
École de technologie supérieure
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2022
Competition year année de concours
2018
Award amount
33000
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
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
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
Installment
inst:5
Partie
1
Nb partie
6
Application title
Self-optimizing decoders for modern error-correcting codes that promote energy efficiency on the basis sufficient quality
Application summary
Channel coding is an essential ingredient of all modern communication systems. Decoders of such codes are often one of the most computationally intensive and power hungry task in modern wireless receivers. One of the latest innovations in channel coding are polar codes, a type of codes that can provably achieve the capacity of all practically relevant channels. The widely-recognized disruptive impact of these codes is illustrated by the recent, rapid adoption of this class of codes as part of 3GPP's next-generation mobile-communication standard (5G). Despite the recent progress in the design of advanced decoding algorithms and corresponding decoders, compared to the achievements of 20+ research years in efficient decoder design for the competing low-density parity-check (LDPC) and turbo codes, polar decoders are still in their infancy, lagging behind in terms of area and energy efficiency.An important and fundamental reason for the limited (area and energy) efficiency of todays polar decoders is deeply rooted in the nature of close-to-optimal decoding strategies. These advanced algorithms explore multiple hypotheses to maximize the chance for success (i.e., finding the correct codeword). Unfortunately, in order to always meet expectations on sampling rate, throughput, and latency, all of these hypotheses must typically be considered in parallel whereas the competing codes use iterative schemes. In practice, this leads to severe overhead, notably in terms of area and power consumption, which is unnecessary under the most frequent average operating conditions. Most of the resources are wasted on calculations for results that are, in the end, discarded.The proposed research program focuses on the creation of novel algorithms and decoder implementations (software or hardware) for polar codes that are energy efficient while catering sufficient quality for the application. The broader objective is to demonstrate that not only we can live with the uncertainty of a variable runtime but that by doing so the energy efficiency is improved.