2 citations · 5 across the 7 of their papers we have counts for
20 papers
FASURA: A Scheme for Quasi-Static Massive MIMO Unsourced Random Access Channels
Michail Gkagkos, Krishna R. Narayanan, Jean-Francois Chamberland +1
This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel u…
LDPC Codes with Soft Interference Cancellation for Uncoordinated Unsourced Multiple Access
Asit Kumar Pradhan, Vamsi K. Amalladinne, Krishna R. Narayanan +1
This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding sc…
Approximate Support Recovery using Codes for Unsourced Multiple Access
Michail Gkagkos, Asit Kumar Pradhan, Vamsi Amalladinne +3
We consider the approximate support recovery (ASR) task of inferring the support of a -sparse vector from noisy measurements. We examine the case…
Coded Compressed Sensing with Successive Cancellation List Decoding for Unsourced Random Access with Massive MIMO
Vamsi K. Amalladinne, Jean-Francois Chamberland, Krishna R. Narayanan
Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical…
Stochastic Binning and Coded Demixing for Unsourced Random Access
Jamison R. Ebert, Vamsi K. Amalladinne, Stefano Rini +2
Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this mod…
Multi-Class Unsourced Random Access via Coded Demixing
Vamsi K. Amalladinne, Allen Hao, Stefano Rini +1
Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share…