Order-Optimal Multiple-Access Channel for Massive MIMO via Group Testing Decoding

George Vershinin, Asaf Cohen, Omer Gurewitz

Research output: Contribution to journalArticlepeer-review

Abstract

The number of wireless devices continues to grow, and more antennas per device are added, increasing the challenge of efficient resource allocation, especially for uplink streams. To address this, we propose a novel massive multiple-user multiple-input-multiple-output (MU-MIMO) scheme based on Group Testing (GT) with non-cooperative self-scheduling users, reducing the required overhead and complexity. Specifically, we show that out of a population of N devices with M messages each, it is possible for the base station (BS) to jointly identify and decode up to K devices, unknown in advance, simultaneously without the BS applying any scheduling algorithm or collecting channel state information. The BS efficiently decodes the transmissions with vanishing error probability using only O(K log N M) antennas, which implies order-optimal number of antennas.

Original languageEnglish
Pages (from-to)3890-3904
Number of pages15
JournalIEEE Transactions on Communications
Volume72
Issue number7
DOIs
StatePublished - 1 Jan 2024

Keywords

  • Massive MIMO
  • group testing
  • multiple-access channel

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Order-Optimal Multiple-Access Channel for Massive MIMO via Group Testing Decoding'. Together they form a unique fingerprint.

Cite this