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...
Guardado en:
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: | |
Acceso en línea: | https://doaj.org/article/9a3205634f11429697135529c23b2491 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Newtonalized orthogonal matching pursuit for the linear frequency‐modulated pulse frequency agile radar
por: Jiang Zhu, et al.
Publicado: (2021) -
Channel Noise Optimization of Polar Codes Decoding Based on a Convolutional Neural Network
por: Ming Yan, et al.
Publicado: (2021) -
Determining the Image Base of ARM Firmware by Matching Function Addresses
por: Ruijin Zhu, et al.
Publicado: (2021) -
Global repair bandwidth cost optimization of generalized regenerating codes in clustered distributed storage systems
por: Shushi Gu, et al.
Publicado: (2021) -
Block Newtonised orthogonal matching pursuit for off‐grid DOA estimation in the presence of unknown mutual coupling
por: Wen‐Gen Tang, et al.
Publicado: (2021)