| | |
| | |
Stat |
Members: 3645 Articles: 2'501'711 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
Low-Complexity LSTM-Assisted Bit-Flipping Algorithm for Successive Cancellation List Polar Decoder | Chun-Hsiang Chen
; Chieh-Fang Teng
; An-Yeu Wu
; | Date: |
11 Dec 2019 | 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
(bit-flipping) problem is still imperfect and hard to design. In this work, we
leverage the expert knowledge in communication systems and adopt deep learning
(DL) technique to obtain the better solution. A low-complexity long short-term
memory network (LSTM)-assisted CA-SCLF 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. | Source: | arXiv, 1912.5158 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |