Matching Pursuit Algorithm for Decoding of Binary LDPC Codes

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 accumulatio...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Jianzhong Guo, Cong Cao, Dehui Shi, Jing Chen, Shuai Zhang, Xiaohu Huo, Dejin Kong, Jian Li, Yukang Tian, Min Guo
Formato: article
Lenguaje:EN
Publicado: Hindawi-Wiley 2021
Materias:
T
Acceso en línea:https://doaj.org/article/9a3205634f11429697135529c23b2491
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:9a3205634f11429697135529c23b2491
record_format dspace
spelling oai:doaj.org-article:9a3205634f11429697135529c23b24912021-11-08T02:36:00ZMatching Pursuit Algorithm for Decoding of Binary LDPC Codes1530-867710.1155/2021/9980774https://doaj.org/article/9a3205634f11429697135529c23b24912021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/9980774https://doaj.org/toc/1530-8677This 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.Jianzhong GuoCong CaoDehui ShiJing ChenShuai ZhangXiaohu HuoDejin KongJian LiYukang TianMin GuoHindawi-WileyarticleTechnologyTTelecommunicationTK5101-6720ENWireless Communications and Mobile Computing, Vol 2021 (2021)
institution DOAJ
collection DOAJ
language EN
topic Technology
T
Telecommunication
TK5101-6720
spellingShingle Technology
T
Telecommunication
TK5101-6720
Jianzhong Guo
Cong Cao
Dehui Shi
Jing Chen
Shuai Zhang
Xiaohu Huo
Dejin Kong
Jian Li
Yukang Tian
Min Guo
Matching Pursuit Algorithm for Decoding of Binary LDPC Codes
description 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.
format article
author Jianzhong Guo
Cong Cao
Dehui Shi
Jing Chen
Shuai Zhang
Xiaohu Huo
Dejin Kong
Jian Li
Yukang Tian
Min Guo
author_facet Jianzhong Guo
Cong Cao
Dehui Shi
Jing Chen
Shuai Zhang
Xiaohu Huo
Dejin Kong
Jian Li
Yukang Tian
Min Guo
author_sort Jianzhong Guo
title Matching Pursuit Algorithm for Decoding of Binary LDPC Codes
title_short Matching Pursuit Algorithm for Decoding of Binary LDPC Codes
title_full Matching Pursuit Algorithm for Decoding of Binary LDPC Codes
title_fullStr Matching Pursuit Algorithm for Decoding of Binary LDPC Codes
title_full_unstemmed Matching Pursuit Algorithm for Decoding of Binary LDPC Codes
title_sort matching pursuit algorithm for decoding of binary ldpc codes
publisher Hindawi-Wiley
publishDate 2021
url https://doaj.org/article/9a3205634f11429697135529c23b2491
work_keys_str_mv AT jianzhongguo matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT congcao matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT dehuishi matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT jingchen matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT shuaizhang matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT xiaohuhuo matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT dejinkong matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT jianli matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT yukangtian matchingpursuitalgorithmfordecodingofbinaryldpccodes
AT minguo matchingpursuitalgorithmfordecodingofbinaryldpccodes
_version_ 1718443212257886208