Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.

Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things

Open access
Liu, Liang, Larsson, Erik G., Yu, Wei, Popovski, Petar, Stefanovic, Cedomir, de Carvalho, Elisabeth · 2018 · IEEE Signal Processing Magazine

Abstract

The next wave of wireless technologies will proliferate in connecting sensors, machines, and robots for myriad new applications, thereby creating the fabric for the Internet of Things (IoT). A generic scenario for IoT connectivity involves a massive number of machine-type connections, but in a typical application, only a small (unknown) subset of devices are active at any given instant; therefore, one of the key challenges of providing massive IoT connectivity is to detect the active devices first and then decode their data with low latency. This article advocates the usage of grant-free, rather than grantbased random access schemes to overcome the challenge of massive IoT access. Several key signal processing techniques that promote the performance of the grant-free strategies are outlined, with a primary focus on advanced compressed sensing techniques and their applications for the efficient detection of active devices. We argue that massive multiple-input, multiple-output (MIMO) is especially well suited for massive IoT connectivity because the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station (BS) goes to infinity by using the multiplemeasurement vector (MMV) compressed sensing techniques. This article also provides a perspective on several related important techniques for massive access, such as embedding short messages onto the device-activity detection process and the coded random access.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/msp.2018.2844952

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 33 references

Cited by

See all 510

Metadata

Authors
Liu, L., Larsson, E. G., Yu, W., Popovski, P., Stefanovic, C., & de Carvalho, E.
Affiliations
  • University of Toronto (CA)
  • Uppsala University (SE)
  • Stanford University (US)
  • Ss. Cyril and Methodius University in Skopje (MK)
  • Aalborg University (DK)
Venue
IEEE Signal Processing Magazine
Published
2018-09
Volume
35
Issue
5
Pages
88-99
ISSN
  • 1053-5888 (ISSN-L)
  • 1558-0792
OpenAlex
W2890736047
Cited by
510
References
33
Citations by year
2026: 25 · 2025: 56 · 2024: 70 · 2023: 63 · 2022: 84 · 2021: 84 · 2020: 91 · 2019: 35 · 2018: 2
FWCI
20.29
Type
journal article
Language
en
Open access
Locations
  • IEEE Signal Processing Magazine (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • VBN Forskningsportal (Aalborg Universitet) (submittedVersion)
  • KTH Publication Database DiVA (KTH Royal Institute of Technology) (submittedVersion, other-oa)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › IoT Networks and Protocols
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
Keywords
grant-free access, massive connectivity, Internet of Things, sparse signal processing, compressed sensing, device detection, massive MIMO, coded random access

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things. https://app.cochat.ai/papers/10.1109/msp.2018.2844952
The paper
Liu, L., Larsson, E. G., Yu, W., Popovski, P., Stefanovic, C., & de Carvalho, E. (2018). Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2018.2844952

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.