Shortened LDPC codes accelerate OSD decoding performance

EURASIP Journal on Wireless Communications and Networking

Toshiya Shinoda¹  Ryusei Kaguchi¹  Kohtaro Watanabe¹ 

[1] Department of Computer Science, National Defense Academy of Japan, Hashirimizu, 2398686, Yokosuka, Japan;

关键词: LDPC codes;    OSD method;    Shortened code;    Code polytope;    Integer programming;   

DOI  :  10.1186/s13638-021-01901-x

来源: Springer

【 摘 要 】

Medium-length LDPC codes are in demand in certain areas such as mobile environment (Wi-Fi and Mobile WiMAX) and in telecommand links from the ground to space because of their lower latency properties. However, because of the length of these codes is rather short, decoding error rates are worse than those of long-length codes. In this paper, we show that the combination of shortened LDPC codes, whose shortened positions are properly selected, and ordered statistic decoding (OSD) significantly improves the decoding error. For the best choice of shortening positions, we used the integer programming approach. In particular, we utilized Feldman–Wainwright–Karger code polytope for this purpose. Some studies have independently reported the efficiency of shortened LDPC codes and OSD methods. This paper emphasizes that their combination results in multiplicative effectiveness.

【 授权许可】

CC BY