The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Deep Learning Methods for Improved Decoding of Linear Codes
Open accessAbstract
The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large example space. Similar improvements are obtained for the min-sum algorithm. It is also shown that tying the parameters of the decoders across iterations, so as to form a recurrent neural network architecture, can be implemented with comparable results. The advantage is that significantly less parameters are required. We also introduce a recurrent neural decoder architecture based on the method of successive relaxation. Improvements over standard belief propagation are also observed on sparser Tanner graph representations of the codes. Furthermore, we demonstrate that the neural belief propagation decoder can be used to improve the performance, or alternatively reduce the computational complexity, of a close to optimal decoder of short BCH codes.
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
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
(2014) · Cited by 33,419
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
Abadi, M., Agarwal, A., Barham, P., Brevdo, E., Chen, Z., Citro, C., Corrado, G. S., Davis, A., Dean, J., Devin, M., et al. (2016) · arXiv · doi:10.48550/arxiv.1603.04467 · Cited by 9,408
Speech recognition with deep recurrent neural networks
Graves, A., Mohamed, A.-R., & Hinton, G. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638947 · Cited by 8,893
Effective Approaches to Attention-based Neural Machine Translation
Luong, T., Pham, H., & Manning, C. D. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1166 · Cited by 8,382
XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks
Rastegari, M., Ordonez, V., Redmon, J., & Farhadi, A. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46493-0_32 · Cited by 4,408
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
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
Richardson, T., & Urbanke, R. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511791338 · Cited by 2,271
Srivastava, R. K., Greff, K., & Schmidhuber, J. (2015) · arXiv · doi:10.48550/arxiv.1505.00387 · Cited by 912
Soft-decision decoding of linear block codes based on ordered statistics
Fossorier, M. P. C., & Lin, S. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.412683 · Cited by 690
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
Self-citationOn deep learning-based channel decoding
Gruber, T., Cammerer, S., Hoydis, J., & Brink, S. T. (2017) · 2017 51st Annual Conference on Information Sciences and Systems (CISS) · doi:10.1109/ciss.2017.7926071 · Cited by 545
Samuel, N., Diskin, T., & Wiesel, A. (2017) · 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2017.8227772 · Cited by 429
Scaling Deep Learning-Based Decoding of Polar Codes via Partitioning
Cammerer, S., Gruber, T., Hoydis, J., & ten Brink, S. (2017) · GLOBECOM 2017 - 2017 IEEE Global Communications Conference · doi:10.1109/glocom.2017.8254811 · Cited by 196
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
Jiang, J., & Narayanan, K. R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.878176 · Cited by 179
Neural offset min-sum decoding
Lugosch, L., & Gross, W. J. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006751 · Cited by 167
Self-citationIterative reliability-based decoding of low-density parity check codes
Fossorier, M. P. C. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.924874 · Cited by 166
Detection Algorithms for Communication Systems Using Deep LearningPreprint
Farsad, N., & Goldsmith, A. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.08044 · Cited by 144
Deep Neural Network Probabilistic Decoder for Stabilizer Codes
Krastanov, S., & Jiang, L. (2017) · Scientific Reports · doi:10.1038/s41598-017-11266-1 · Cited by 125
Code Design for Short Blocks: A SurveyPreprint
Liva, G., Gaudio, L., Ninacs, T., & Jerkovits, T. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.00873 · Cited by 103
RNN Decoding of Linear Block Codes
Nachmani, E., Marciano, E., Burshtein, D., & Be'ery, Y. (2017) · arXiv · doi:10.48550/arxiv.1702.07560 · Cited by 93
Self-citationAn Introduction to Machine Learning Communications Systems.Preprint
O’Shea, T. J., & Hoydis, J. (2017) · arXiv (Cornell University) · Cited by 83
Performance comparison of short-length error-correcting codes
Wonterghem, J. V., Alloum, A., Boutros, J. J., & Moeneclaey, M. (2016) · IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT) · doi:10.1109/scvt.2016.7797660 · Cited by 66
On Deep Learning-Based Channel DecodingPreprint
Gruber, T., Cammerer, S., Hoydis, J., & ten Brink, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.07738 · Cited by 60
Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
Zhang, X., & Siegel, P. H. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2204955 · Cited by 59
Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
Zhang, X., Member, S., & Siegel, P. H. (2012) · Cited by 58
Improved random redundant iterative HDPC decoding
Dimnik, I., & Be'ery, Y. (2009) · IEEE Transactions on Communications · doi:10.1109/tcomm.2009.07.070621 · Cited by 53
Self-citationRandom Redundant Soft-In Soft-Out Decoding of Linear Block Codes
Halford, T. R., & Chugg, K. M. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261947 · Cited by 49
Performance Bounds of Concatenated Polar Coding Schemes
Goldin, D., & Burshtein, D. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2935198 · Cited by 20
Self-citationAn Introduction to Deep Learning for the Physical LayerPreprint
O’Shea, T. J., & Hoydis, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.00832 · Cited by 18
Efficient Linear Programming Decoding of HDPC Codes
Yufit, A., Lifshitz, A., & Be'ery, Y. (2010) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.122110.090729 · Cited by 17
Self-citationEfficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless ChannelsPreprint
(2016) · Cited by 16
Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activations
Hubara, I., Courbariaux, M., Soudry, D., El-Yaniv, R., & Bengio, Y. (2016) · arXiv · doi:10.48550/arxiv.1609.07061
Cited by
Deep Joint Source-Channel Coding for Wireless Image Transmission
Bourtsoulatze, E., Burth Kurka, D., & Gunduz, D. (2019) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2019.2919300 · Cited by 1,476
Artificial Neural Networks-Based Machine Learning for Wireless Networks: A Tutorial
Chen, M., Challita, U., Saad, W., Yin, C., & Debbah, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2926625 · Cited by 1,117
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
Samuel, N., Diskin, T., & Wiesel, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2899805 · Cited by 515
DeepJSCC-f: Deep Joint Source-Channel Coding of Images With Feedback
Kurka, D. B., & Gunduz, D. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.2987203 · Cited by 470
Metadata
- Authors
- Nachmani, E., Marciano, E., Lugosch, L., Gross, W. J., Burshtein, D., & Be'ery, Y.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2018-02
- Volume
- 12
- Issue
- 1
- Pages
- 119-131
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W2666368276
- Cited by
- 545
- References
- 38
- FWCI
- 45.28
- 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
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.