The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
ViterbiNet: A Deep Learning Based Viterbi Algorithm for Symbol Detection
Open accessAbstract
Symbol detection plays an important role in the implementation of digital receivers. In this work, we propose ViterbiNet, which is a data-driven symbol detector that does not require channel state information (CSI). ViterbiNet is obtained by integrating deep neural networks (DNNs) into the Viterbi algorithm. We identify the specific parts of the Viterbi algorithm that depend on the channel model, and design a DNN to implement only those computations, leaving the rest of the algorithm structure intact. We then propose a meta-learning based approach to train ViterbiNet online based on recent decisions, allowing the receiver to track dynamic channel conditions without requiring new training samples for every coherence block. Our numerical evaluations demonstrate that the performance of ViterbiNet, which is ignorant of the CSI, approaches that of the CSI-based Viterbi algorithm, and is capable of tracking time-varying channels without needing instantaneous CSI or additional training data. Moreover, unlike conventional Viterbi detection, ViterbiNet is robust to CSI uncertainty, and it can be reliably implemented in complex channel models with constrained computational burden. More broadly, our results demonstrate the conceptual benefit of designing communication systems that integrate DNNs into established algorithms.
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
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
WaveNet: a generative model for raw audio
Oord, A. V. D., Dieleman, S., Zen, H., Simonyan, K., Vinyals, O., Graves, A., Kalchbrenner, N., Senior, A., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1609.03499 · Cited by 4,911
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
A Very Brief Introduction to Machine Learning With Applications to Communication Systems
Simeone, O. (2018) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2018.2881442 · Cited by 516
Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures
Hershey, J. R., Roux, J. L., & Weninger, F. (2014) · arXiv · doi:10.48550/arxiv.1409.2574 · Cited by 412 · cited 1×
“Our design is inspired by deep unfolding, which is a common method for obtaining ML architectures from modelbased iterative algorithms [5], [20], [21].”
MethodMetalearning: A survey of trends and technologies
Lemke, C., Budka, M., & Gabrys, B. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9406-y · Cited by 365
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
Self-citationKalmanNet: Neural Network Aided Kalman Filtering for Partially Known Dynamics
Revach, G., Shlezinger, N., Ni, X., Escoriza, A. L., van Sloun, R. J. G., & Eldar, Y. C. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3158588 · Cited by 599
Self-citationA Vision and Framework for the High Altitude Platform Station (HAPS) Networks of the Future
Karabulut Kurt, G., Khoshkholgh, M. G., Alfattani, S., Ibrahim, A., Darwish, T. S. J., Alam, M. S., Yanikomeroglu, H., & Yongacoglu, A. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3066905 · Cited by 538
Shlezinger, N., Whang, J., Eldar, Y. C., & Dimakis, A. G. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2023.3247480 · Cited by 368
Self-citationDeep Unfolding for Communications Systems: A Survey and Some New Directions
Balatsoukas-Stimming, A., & Studer, C. (2019) · 2019 IEEE International Workshop on Signal Processing Systems (SiPS) · doi:10.1109/sips47522.2019.9020494 · Cited by 266
Metadata
- Authors
- Shlezinger, N., Farsad, N., Eldar, Y. C., & Goldsmith, A. J.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2020-05
- Volume
- 19
- Issue
- 5
- Pages
- 3319-3331
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W2946612591
- Cited by
- 172
- References
- 9
- FWCI
- 9.20
- Type
- journal article
- 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: ViterbiNet: A Deep Learning Based Viterbi Algorithm for Symbol Detection. https://app.cochat.ai/papers/10.1109/twc.2020.2972352
- The paper
- Shlezinger, N., Farsad, N., Eldar, Y. C., & Goldsmith, A. J. (2020). ViterbiNet: A Deep Learning Based Viterbi Algorithm for Symbol Detection. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2020.2972352
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.