Novel Bounds for Semi-Blind Multiple-Access in Massive MIMO

George Vershinin, Asaf Cohen, Omer Gurewitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the standard Multi-User Multiple-Input-Multiple-Output (MU-MIMO) system, where only K active users, unknown in advance, out of N, wish to convey their messages to a single receiver. We derive two necessary lower bounds on the number of antennas (degrees of freedom) on both the receiver and transmitter sides, where the first holds for any MU-MIMO system and the second holds for any energy detection-based MU-MIMO. Then, we revisit techniques with identical scaling laws, such as compressive sensing and group testing, and discuss when the optimal antenna scaling laws for the MU-MIMO problem can be obtained. We also numerically evaluate the presented bounds and compare them against recent achievability results from the last ISIT.

Original languageEnglish
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers
Pages2157-2162
Number of pages6
ISBN (Electronic)9798350382846
DOIs
StatePublished - 1 Jan 2024
Event2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2024 IEEE International Symposium on Information Theory, ISIT 2024
Country/TerritoryGreece
CityAthens
Period7/07/2412/07/24

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Novel Bounds for Semi-Blind Multiple-Access in Massive MIMO'. Together they form a unique fingerprint.

Cite this