Nadim Ghaddar
About Me
I am currently a postdoctoral research fellow at the University of Toronto, hosted by Prof. Wei Yu. Prior to joining the
University of Toronto, I received my Ph.D. in Electrical Engineering from the University of California San Diego, where I was extremely fortunate to be advised by
Prof. Young-Han Kim and Prof. Laurence B. Milstein. My research interests lie broadly in the
intersections of information theory, wireless communication and signal processing.
Check out my CV for more details.
News
September 2024: Paper “Low-Complexity Coding Techniques for Cloud Radio Access Networks” (joint with Lele) accepted for publication in IEEE Journal on Selected Areas in Information Theory.
August 2024: I am teaching ECE367: Matrix Algebra and Optimization in Fall 2024.
June 2024: Paper “Noisy Sorting Capacity” (joint with Ziao, Banghua and Lele) accepted for publication in IEEE Transactions on Information Theory.
April 2024: Paper “Noisy Computing of the OR and MAX Functions” (joint with Banghua, Ziao, Jiantao and Lele) accepted for publication in IEEE Journal on Selected Areas in Information Theory.
March 2024: New paper on arXiv: “Noisy Computing of the Threshold Function” (joint with Ziao, Banghua and Lele).
November 2023: I joined University of Toronto as a Postdoctoral Research Fellow, hosted by Prof. Wei Yu.
October 2023: Paper “A Lego-Brick Approach to Coding for Network Communication” (joint with Shouvik, Lele and Young-Han) accepted for publication in IEEE Transactions on Information Theory.
September 2023: New paper on arXiv: “Noisy Computing of the OR and MAX Functions” (joint with Banghua, Ziao, Jiantao and Lele).
April 2023: Two papers accepted at the 2023 IEEE International Symposium on Information Theory (ISIT’23): “Variable-Length Insertion-Based Noisy Sorting
” (joint with Ziao, Banghua and Lele), and “On the Optimal Bounds for Noisy Computing” (joint with Banghua, Ziao, Jiantao and Lele).
November 2022: I defended my PhD Thesis. [Thesis] [Defense Slides]
|