1 citations · 1 across the 4 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2024
Many-User Multiple Access with Random User Activity: Achievability Bounds and Efficient Schemes
Xiaoqi Liu, Pablo Pascual Cobo, Ramji Venkataramanan
We study the Gaussian multiple access channel with random user activity, in the regime where the number of users is proportional to the code length. The receiver may know some stat…
cs.IT2024
Coded Many-User Multiple Access via Approximate Message Passing
Xiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan
We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on spa…
cs.IT2022
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing
Xiaoqi Liu, Ramji Venkataramanan
We consider the problem of recovering an low-rank matrix with -sparse singular vectors from a small number of linear measurements (sketch). We propose a sketchi…