Deep Unfolding for Communications Systems: A Survey and Some New Directions
Open accessThe DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
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.
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.
Integrity signals
Registry
Cites
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.
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
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
An Introduction to Deep Learning for the Physical Layer
O'Shea, T., & Hoydis, J. (2017) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2017.2758370 · Cited by 2,980 · cited 1×
“In recent years, neural networks (NNs) have been proposed to replace a range of signal processing tasks in communications systems [2]–[6].”
BackgroundLearning Fast Approximations of Sparse Coding
Gregor, K., & LeCun, Y. (2010) · International Conference on Machine Learning · Cited by 2,400
Deep Learning for Intelligent Wireless Networks: A Comprehensive Survey
Mao, Q., Hu, F., & Hao, Q. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2846401 · Cited by 789
Deep Learning in Physical Layer Communications
Qin, Z., Ye, H., Li, G. Y., & Juang, B.-H. F. (2019) · IEEE Wireless Communications · doi:10.1109/mwc.2019.1800601 · Cited by 692
Deep Learning in Physical Layer Communications
Qin, Z., Ye, H., Li, G. Y., & Juang, B.-H. F. (2018) · arXiv · doi:10.48550/arxiv.1807.11713 · Cited by 692
Convex Optimization Algorithms
Bertsekas, D. P. (2015) · Cited by 689
Deep learning for wireless physical layer: Opportunities and challenges
Wang, T., Wen, C.-K., Wang, H., Gao, F., Jiang, T., & Jin, S. (2017) · China Communications · doi:10.1109/cc.2017.8233654 · Cited by 606
Learning to decode linear codes using deep learning
Nachmani, E., Be'ery, Y., & Burshtein, D. (2016) · 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2016.7852251 · Cited by 561 · cited 3×
“The methods in [20], [21] improve upon [19] by using a recurrent neural network (RNN) structure so that the weights w t and w c′ t do not change over the iterations.”
MethodDeep Learning Methods for Improved Decoding of Linear Codes
Nachmani, E., Marciano, E., Lugosch, L., Gross, W. J., Burshtein, D., & Be'ery, Y. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2788405 · Cited by 545
Cited by
Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing
Monga, V., Li, Y., & Eldar, Y. C. (2021) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3016905 · Cited by 1,414
She, C., Sun, C., Gu, Z., Li, Y., Yang, C., Poor, H. V., & Vucetic, B. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3053601 · Cited by 405
Shlezinger, N., Whang, J., Eldar, Y. C., & Dimakis, A. G. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2023.3247480 · Cited by 368
Hu, Q., Cai, Y., Shi, Q., Xu, K., Yu, G., & Ding, Z. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3033334 · Cited by 253
“This method is referred to as deep unfolding [23] and has a wide range of applications in communications, such as detection and coding [24]–[27], resource allocation and channel estimation [28]–[30].”
MethodUnfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation
Chowdhury, A., Verma, G., Rao, C., Swami, A., & Segarra, S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3071480 · Cited by 162
Hu, Q., Liu, Y., Cai, Y., Yu, G., & Ding, Z. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3087233 · Cited by 64
“To address these issues, so-called deep-unfolding NNs have been developed in [22]–[26], where the iterative optimization algorithms have been unfolded into a layer-wise structure that is similar to the NN.”
Learning to Continuously Optimize Wireless Resource in Episodically Dynamic Environment
Sun, H., Pu, W., Zhu, M., Fu, X., Chang, T.-H., & Hong, M. (2021) · ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp39728.2021.9413503 · Cited by 21
“Recently, the idea of unfolding has been used in communication task such as MIMO detection [41–43], channel coding [44], resource allocation [45], channel estimation [46], and beamforming problems [47]; see a recent survey paper [37].”
MethodFedCau: A Proactive Stop Policy for Communication and Computation Efficient Federated Learning
Mahmoudi, A., Ghadikolaei, H. S., Barros Da Silva, J. M., & Fischione, C. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3378351 · Cited by 16
“Remark 2: We have formulated optimization problem (5) according to the “unfolding method” of iterative algorithms [31], where it is ideally assumed that the optimizer knows beforehand (before iterations (2) and (3) occur) what the cost of each communication iteration in (2) would be and when they…”
Method
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
- 50
- 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
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.