Deep Learning Algorithms for BCH Decoding in Satellite Communication
DOI:
https://doi.org/10.54097/hset.v38i.6012Keywords:
Channel coding, BCH code, Satellite communication, Error-correcting Coding, Neural network.Abstract
Deep learning is widely used in various fields due to the advancement of algorithms, the enrichment of high-efficiency databases, and the increase in computing power. Especially in the satellite communication, the learning and parallel computing capabilities of neural networks make them ideal for decoding. Many researchers have recently applied deep learning neural networks to decode high-density parity check (HDPC) codes (such as BCH and RS code), improving the decoder’s performance. This review aims to provide general insights on applying neural network decoders to satellite communications. Due to the neural network’s learning ability, the neural network-based decoder can be trained to change the weights, thereby reducing the influence of non-white noise in satellite communications, such as the influence between the satellite and the terrestrial network and the mutual interference within the satellites. To compensate for non-white noise, shortest circles in Tanner graph and unreliable information, a decoder system model for satellite communication constructed by three neural networks is presented.
Downloads
References
Liang F, Shen C and Wu F 2018 An Iterative BP-CNN Architecture for Channel Decoding IEEE Journal of Selected Topics in Signal Processing 12 144 – 59.
Ortuno I, Ortuno M and Delgado J A 1992 Error correcting neural networks for channels with Gaussian noise [Proceedings 1992] IJCNN International Joint Conference on Neural Networks vol 4 pp 295–300 vol.4.
Gao Y, Ou Q, Zeng Q, Zhang X and Wu J 2013 Analysis of mutual interferences between two components in satellite-terrestrial integrated system 2013 3rd International Conference on Consumer Electronics, Communications and Networks pp 145 – 8.
Shannon C E 1948 A mathematical theory of communication The Bell System Technical Journal 27 379 – 423.
Bose R C and Ray-Chaudhuri D K 1960 On a class of error correcting binary group codes Information and Control 3 68 – 79.
Bose R C and Ray-Chaudhuri D K 1960 Further results on error correcting binary group codes Information and Control 3 279 – 90.
Peterson W 1960 Encoding and error-correction procedures for the Bose-Chaudhuri codes IRE Transactions on Information Theory 6 459 – 70.
Berlekamp E R 1968 Algebraic coding theory (New York: McGraw-Hill).
Tanner R 1981 A recursive approach to low complexity codes IEEE Transactions on Information Theory 27 533 – 47.
Pearl J 2022 Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach Probabilistic and Causal Inference ed H Geffner, R Dechter and J Y Halpern (New York, NY, USA: ACM) pp 129 – 38.
Jiang J and Narayanan K R 2004 Iterative soft decoding of Reed-Solomon codes IEEE Communications Letters 8 244–6.
Halford T R and Chugg K M 2006 Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes 2006 IEEE International Symposium on Information Theory pp 2230 – 4.
Liu B, Xie Y and Yuan J 2020 A Deep Learning Assisted Node-Classified Redundant Decoding Algorithm for BCH Codes IEEE Transactions on Communications 68 5338 – 49.
Halford T R and Chugg K M 2006 An algorithm for counting short cycles in bipartite graphs IEEE Transactions on Information Theory 52 287 – 92.
Nachmani E, Be’ery Y and Burshtein D 2016 Learning to decode linear codes using deep learning 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) pp 341 – 6.
Dimnik I and Be’ery Y 2009 Improved random redundant iterative HDPC decoding IEEE Transactions on Communications 57 1982 – 5.
Liu B, Xie Y, Yang L and Yuan J 2018 An Iterative Soft-Decision Decoding Algorithm with Dynamic Saturation for Short Reed-Solomon Codes 2018 IEEE Information Theory Workshop (ITW) pp 1 – 5.
Tang S, Chen L and Ma X 2012 Progressive List-Enlarged Algebraic Soft Decoding of Reed-Solomon Codes IEEE Communications Letters 16 901 – 4.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







