Coded Pilot Random Access for Massive MIMO Systems

Research output: Contribution to journalJournal articleResearchpeer-review

31 Downloads (Pure)

Abstract

We present a novel access protocol for crowd scenarios in massive multiple-input multiple-output (MIMO) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereas orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely, asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contaminated pilot signals as a graph code on which iterative belief propagation can be performed. This makes it possible to decontaminate pilot signals and increase the throughput of the system. Numerical evaluations show that the proposed access protocol increases the throughput by 36%, when there are 400 antennas at the base station, compared to the conventional method of slotted Additive Links On-line Hawaii Area. With 1024 antennas, the throughput is increased by 85%.

Original languageEnglish
JournalI E E E Transactions on Wireless Communications
Volume17
Issue number12
Pages (from-to)8035-8046
Number of pages12
ISSN1536-1276
DOIs
Publication statusPublished - Dec 2018

Fingerprint

Multiple-input multiple-output (MIMO) Systems
Random Access
Throughput
Scenarios
Antennas
Antenna
Invariance
Base stations
Telecommunication links
Belief Propagation
Signal processing
Orthogonality
Scheduling
Signal Processing
Evaluation
Graph in graph theory

Cite this

@article{39acb901b1db47f5a70e04cb8b264d5f,
title = "Coded Pilot Random Access for Massive MIMO Systems",
abstract = "We present a novel access protocol for crowd scenarios in massive multiple-input multiple-output (MIMO) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereas orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely, asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contaminated pilot signals as a graph code on which iterative belief propagation can be performed. This makes it possible to decontaminate pilot signals and increase the throughput of the system. Numerical evaluations show that the proposed access protocol increases the throughput by 36{\%}, when there are 400 antennas at the base station, compared to the conventional method of slotted Additive Links On-line Hawaii Area. With 1024 antennas, the throughput is increased by 85{\%}.",
author = "S{\o}rensen, {Jesper Hemming} and Carvalho, {Elisabeth De} and Cedomir Stefanovic and Petar Popovski",
year = "2018",
month = "12",
doi = "10.1109/TWC.2018.2873400",
language = "English",
volume = "17",
pages = "8035--8046",
journal = "I E E E Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "IEEE",
number = "12",

}

Coded Pilot Random Access for Massive MIMO Systems. / Sørensen, Jesper Hemming; Carvalho, Elisabeth De; Stefanovic, Cedomir; Popovski, Petar.

In: I E E E Transactions on Wireless Communications, Vol. 17, No. 12, 12.2018, p. 8035-8046.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Coded Pilot Random Access for Massive MIMO Systems

AU - Sørensen, Jesper Hemming

AU - Carvalho, Elisabeth De

AU - Stefanovic, Cedomir

AU - Popovski, Petar

PY - 2018/12

Y1 - 2018/12

N2 - We present a novel access protocol for crowd scenarios in massive multiple-input multiple-output (MIMO) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereas orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely, asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contaminated pilot signals as a graph code on which iterative belief propagation can be performed. This makes it possible to decontaminate pilot signals and increase the throughput of the system. Numerical evaluations show that the proposed access protocol increases the throughput by 36%, when there are 400 antennas at the base station, compared to the conventional method of slotted Additive Links On-line Hawaii Area. With 1024 antennas, the throughput is increased by 85%.

AB - We present a novel access protocol for crowd scenarios in massive multiple-input multiple-output (MIMO) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereas orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely, asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contaminated pilot signals as a graph code on which iterative belief propagation can be performed. This makes it possible to decontaminate pilot signals and increase the throughput of the system. Numerical evaluations show that the proposed access protocol increases the throughput by 36%, when there are 400 antennas at the base station, compared to the conventional method of slotted Additive Links On-line Hawaii Area. With 1024 antennas, the throughput is increased by 85%.

U2 - 10.1109/TWC.2018.2873400

DO - 10.1109/TWC.2018.2873400

M3 - Journal article

VL - 17

SP - 8035

EP - 8046

JO - I E E E Transactions on Wireless Communications

JF - I E E E Transactions on Wireless Communications

SN - 1536-1276

IS - 12

ER -