Matching Pursuit Algorithm for Decoding of Binary LDPC Codes | Zendy

Jianzhong Guo | Zendy; Cong Cao | Zendy; Dehui Shi | Zendy; Jing Chen | Zendy; Shuai Zhang | Zendy; Xiaohu Huo | Zendy; Dejin Kong | Zendy; Jian Li | Zendy; Yukang Tian | Zendy; Min Guo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Matching Pursuit Algorithm for Decoding of Binary LDPC Codes

Author(s) -

Jianzhong Guo,

Cong Cao,

Dehui Shi,

Jing Chen,

Shuai Zhang,

Xiaohu Huo,

Dejin Kong,

Jian Li,

Yukang Tian,

Min Guo

Publication year - 2021

Publication title -

wireless communications and mobile computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.42

H-Index - 64

eISSN - 1530-8677

pISSN - 1530-8669

DOI - 10.1155/2021/9980774

Subject(s) - computer science , low density parity check code , decoding methods , berlekamp–welch algorithm , algorithm , binary number , list decoding , sequential decoding , error floor , concatenated error correction code , block code , arithmetic , mathematics

This paper presents a novel hard decision decoding algorithm for low-density parity-check (LDPC) codes, in which the stand matching pursuit (MP) is adapted for error pattern recovery from syndrome over GF(2). In this algorithm, the operation of inner product can be converted into XOR and accumulation, which makes the matching pursuit work with a high efficiency. In addition, the maximum iteration is theoretically explored in relation to sparsity and error probability according to the sparse theory. To evaluate the proposed algorithm, two MP-based decoding algorithms are simulated and compared over an AWGN channel, i.e., generic MP (GMP) and syndrome MP (SMP). Simulation results show that the GMP algorithm outperforms the SMP by 0.8 dB at BER = 10 − 5 .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research