Grant: Discovery Grants Program - Individual
University of Toronto
$37,000.00
Algorithms and Architectures for Digital Communications
EF 2019-20
Résumé
The central theme of the proposed research is algorithms, parallel VLSI architectures and system-on-chip (SoC) implementations of wireless baseband communication systems and certain types of network-connected head-end cryptographic security hardware. In the domain of emerging wireless technologies few, if any, technologies hold more promise at improving cost and performance than CMOS SoC realizations with significant integrated embedded-memory subsystems that are co-designed at the algorithm and architecture levels to exploit the parallel structure of the matrix-vector algorithms required.*******The goal of this research is to develop low-complexity signal processing algorithms for wireless baseband and homomorphic encryption algorithms that have both provably good performance and an efficient microelectronic realization. A methodology to address this research challenge lies in very promising recent progress in reformulating parallel algorithms for low clock rate, embedded-memory Quasi-Cyclic Low-Density Parity-Check (LDPC) decoders that support multi-Gb/s performance. We plan to further develop the concepts in an 802.11ad compliant Quasi-Cyclic LDPC CMOS prototype, though the concepts are very attractive for other applications. For example, our parallel Quasi-Cyclic LDPC algorithm would enable GPU-based realizations with block sizes of 10^6 for use in Continuous-Variable Quantum Key Distribution (CVQKD) protocols advancing current capabilities significantly. ******With embedded memory now dominating the area and cost of SoC systems in this domain, we further advance our research by developing new insights into the realization of LDPC and FFT engines that exploit the memory-based nature of the implementation but are co-designed at the system, algorithm and architecture levels with improved performance.******Fully Homomorphic Encryption (FHE) is a recently developed mathematical technique that allows mathematical operations (both multiplication and addition) on encrypted numbers. Central to practical future realizations, ciphertext multiplication operations are crucial for almost every envisioned application and especially applications that require searching and matching where dictionaries are large. Therefore, faster polynomial multiplication techniques, using Chinese Remainder Theorem (CRT)-based and embedded memory-based innovations, promising improved execution times will be investigated. Furthermore, architecture and circuit design innovations in the context of area and power-efficient VLSI implementations will be designed, fabricated and tested to demonstrate practical applications.******This work will impact the way future wireless systems for entertainment, education and commerce are designed and implemented improving the cost and performance of wireless systems that transport next generation data, video and secure information services.
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-2015-05376
Name nom
Gulak, Glenn
Department département
Electrical & Computer Engineering
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2019
Competition year année de concours
2015
Award amount
37000
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
514
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Communications equipment
Area of application fr
Matériel de télécommunications
Research subject code
2519
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Microelectronics
Research subject fr
Microélectronique
Installment
inst:5 - 5
Partie
5
Nb partie
5
Application title
Algorithms and Architectures for Digital Communications
Keyword
NSERC
Application summary
The central theme of the proposed research is algorithms, parallel VLSI architectures and system-on-chip (SoC) implementations of wireless baseband communication systems and certain types of network-connected head-end cryptographic security hardware. In the domain of emerging wireless technologies few, if any, technologies hold more promise at improving cost and performance than CMOS SoC realizations with significant integrated embedded-memory subsystems that are co-designed at the algorithm and architecture levels to exploit the parallel structure of the matrix-vector algorithms required.*******The goal of this research is to develop low-complexity signal processing algorithms for wireless baseband and homomorphic encryption algorithms that have both provably good performance and an efficient microelectronic realization. A methodology to address this research challenge lies in very promising recent progress in reformulating parallel algorithms for low clock rate, embedded-memory Quasi-Cyclic Low-Density Parity-Check (LDPC) decoders that support multi-Gb/s performance. We plan to further develop the concepts in an 802.11ad compliant Quasi-Cyclic LDPC CMOS prototype, though the concepts are very attractive for other applications. For example, our parallel Quasi-Cyclic LDPC algorithm would enable GPU-based realizations with block sizes of 10^6 for use in Continuous-Variable Quantum Key Distribution (CVQKD) protocols advancing current capabilities significantly. ******With embedded memory now dominating the area and cost of SoC systems in this domain, we further advance our research by developing new insights into the realization of LDPC and FFT engines that exploit the memory-based nature of the implementation but are co-designed at the system, algorithm and architecture levels with improved performance.******Fully Homomorphic Encryption (FHE) is a recently developed mathematical technique that allows mathematical operations (both multiplication and addition) on encrypted numbers. Central to practical future realizations, ciphertext multiplication operations are crucial for almost every envisioned application and especially applications that require searching and matching where dictionaries are large. Therefore, faster polynomial multiplication techniques, using Chinese Remainder Theorem (CRT)-based and embedded memory-based innovations, promising improved execution times will be investigated. Furthermore, architecture and circuit design innovations in the context of area and power-efficient VLSI implementations will be designed, fabricated and tested to demonstrate practical applications.******This work will impact the way future wireless systems for entertainment, education and commerce are designed and implemented improving the cost and performance of wireless systems that transport next generation data, video and secure information services.