Low-Complexity LSTM-Assisted Bit-Flipping Algorithm for Successive Cancellation List Polar Decoder
Journal
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Journal Volume
2020-May
Pages
1708-1712
ISBN
9.78151E+12
Date Issued
2020
Author(s)
DOI
IPROD
Abstract
Polar codes have attracted much attention in the past decade due to their capacity-achieving performance. The higher decoding capacity is required for 5G and beyond 5G (B5G). Although the cyclic redundancy check (CRC)-assisted successive cancellation list bit-flipping (CA-SCLF) decoders have been developed to obtain a better performance, the solution to error bit correction (bitflipping) problem is still imperfect and hard to design. In this work, we leverage expert knowledge in communication systems and adopt deep learning (DL) techniques to obtain a better solution. A low-complexity long short-term memory network (LSTM)-assisted CASCLF decoder is proposed to further improve the performance of conventional CA-SCLF and avoid complexity and memory overhead. Our test results show that we can effectively improve the BLER performance by 0.11dB compared to prior work and reduce the complexity and memory overhead by over 30% of the network. © 2020 IEEE.
Subjects
bit flipping; long short-term memory network; Polar codes; successive cancellation list
Other Subjects
5G mobile communication systems; Audio signal processing; Complex networks; Decoding; Deep learning; Knowledge management; Speech communication; Bit flipping; Bit flipping algorithms; Cyclic redundancy check; Expert knowledge; Memory overheads; Polar codes; Short term memory; Successive cancellation; Long short-term memory
Type
conference paper