Name
Abstract | ||
|---|---|---|
In this paper, we propose a generalized minimum-sum decoding algorithm using a linear approximation (LAMS) for protograph-based low-density parity-check (PB-LDPC) codes with quasi-cyclic (QC) structures. The linear approximation introduces some factors in each decoding iteration, which linearly adjust the check node updating and channel output. These factors are optimized iteratively using machine learning, where the optimization can be efficiently solved by a small and shallow neural network with training data produced by the LAMS decoder. The neural network is built according to the parity check matrix of a PB-LDPC code with a QC structure which can greatly reduce the size of the neural network. Since, we optimize the factors once per decoding iteration, the optimization is not limited by the number of the iterations. Then, we give the optimized results of the factors in the LAMS decoder and perform decoding simulations for PB-LDPC codes in fifth generation mobile networks (5G). In the simulations, the LAMS algorithm shows noticeable improvement over the normalized and the offset minimum-sum algorithms and even better performance than the belief propagation algorithm in some high signal-to-noise ratio regions. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ACCESS.2018.2869374 | IEEE ACCESS |
Keywords | Field | DocType |
Iterative decoding,parity check codes,neural networks,optimization,machine learning | Linear approximation,Approximation algorithm,Parity-check matrix,Low-density parity-check code,Computer science,Artificial intelligence,Decoding methods,Artificial neural network,Offset (computer science),Machine learning,Belief propagation | Journal |
Volume | ISSN | Citations |
6 | 2169-3536 | 2 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoning Wu | 1 | 6 | 1.11 |
| Ming Jiang | 2 | 198 | 31.08 |
| Chunming Zhao | 3 | 671 | 64.30 |