Naman Gupta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Naman Gupta has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Rohit Budhiraja
Indian Institute of Technology Kanpur
1 shared publication - Yash Mishra
Department of Electrical Engineering, IIT Kanpur, Kanpur, India
1 shared publication
Latest Publications
- 20 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 2619-2623
Stochastic Variational Inference-Based Receiver Design for 1-bit Massive MIMO Systems
Massive multiple-input multiple-output (mMIMO) systems with 1-bit analog-to-digital converters reduce power consumption. Nonlinearity of 1-bit quantization, however, complicates the channel estimation (CE) and data detection (DD). We propose a stochastic variational inference (SVI) based receiver design for uplink 1-bit mMIMO systems which approximates the posterior distribution over data symbols and channel coefficients. The proposed SVI algorithm maximizes the evidence lower bound associated with 1-bit likelihood, and employs Monte Carlo–based gradient estimates to obtain low-complexity parameter updates. We numerically show that the SVI algorithm outperforms existing algorithms, and that too with a lower runtime.
- 20 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 2619-2623
Stochastic Variational Inference-Based Receiver Design for 1-bit Massive MIMO Systems
Massive multiple-input multiple-output (mMIMO) systems with 1-bit analog-to-digital converters reduce power consumption. Nonlinearity of 1-bit quantization, however, complicates the channel estimation (CE) and data detection (DD). We propose a stochastic variational inference (SVI) based receiver design for uplink 1-bit mMIMO systems which approximates the posterior distribution over data symbols and channel coefficients. The proposed SVI algorithm maximizes the evidence lower bound associated with 1-bit likelihood, and employs Monte Carlo–based gradient estimates to obtain low-complexity parameter updates. We numerically show that the SVI algorithm outperforms existing algorithms, and that too with a lower runtime.