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

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

Deep Unfolding for Communications Systems: A Survey and Some New Directions

Open access
Balatsoukas-Stimming, Alexios, Studer, Christoph·2019·2019 IEEE International Workshop on Signal Processing Systems (SiPS)

Abstract

Deep unfolding is a method of growing popularity that fuses iterative optimization algorithms with tools from neural networks to efficiently solve a range of tasks in machine learning, signal and image processing, and communication systems. This survey summarizes the principle of deep unfolding and discusses its recent use for communication systems with focus on detection and precoding in multi-antenna (MIMO) wireless systems and belief propagation decoding of error-correcting codes. To showcase the efficacy and generality of deep unfolding, we describe a range of other tasks relevant to communication systems that can be solved using this emerging paradigm. We conclude the survey by outlining a list of open research problems and future research directions.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/sips47522.2019.9020494

Cites

49 of 49 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

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 49 references

Cited by

See all 266

Metadata

Authors
Balatsoukas-Stimming, A., & Studer, C.
Venue
2019 IEEE International Workshop on Signal Processing Systems (SiPS)
Publisher
IEEE
Published
2019-10
Pages
266-271
OpenAlex
W2950850286
Cited by
266
References
49
FWCI
54.78
Type
conference paper
Language
en
Open access
green

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: Deep Unfolding for Communications Systems: A Survey and Some New Directions. https://app.cochat.ai/papers/10.1109/sips47522.2019.9020494
The paper
Balatsoukas-Stimming, A., & Studer, C. (2019). Deep Unfolding for Communications Systems: A Survey and Some New Directions. 2019 IEEE International Workshop on Signal Processing Systems (SiPS). https://doi.org/10.1109/sips47522.2019.9020494

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.