Application of Tensor Decomposition to Reduce the Complexity of Neural Min-Sum Channel Decoding Algorithm
Channel neural decoding is very promising as it outperforms the traditional channel decoding algorithms. Unfortunately, it still faces the disadvantage of high computational complexity and storage complexity compared with the traditional decoding algorithms. In this paper, we propose that low rank d...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-02-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/13/4/2255 |
| Summary: | Channel neural decoding is very promising as it outperforms the traditional channel decoding algorithms. Unfortunately, it still faces the disadvantage of high computational complexity and storage complexity compared with the traditional decoding algorithms. In this paper, we propose that low rank decomposition techniques based on tensor train decomposition and tensor ring decomposition can be utilized in neural offset min-sum (NOMS) and neural scale min-sim (NSMS) decoding algorithms. The experiment results show that the proposed two algorithms achieve near state-of-the-art performance with low complexity. |
|---|---|
| ISSN: | 2076-3417 |