Peeling decoding of LDPC codes with applications in compressed sensing

DOI10.1155/2016/6340430MaRDI QIDQ1793437zbMATH OpenOpenAlexWikidataFDO

Authors Weijun Zeng, Huali Wang

Publication date 12 October 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/6340430

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20) Decoding (94B35)

Review text

Summary: We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the context of Low-Density Parity-Check (LDPC) codes and compressed sensing. The iterative recovery algorithm is particularly interesting for its low measurement cost and low computational complexity. The asymptotic analysis can track the evolution of the fraction of unrecovered signal elements in each iteration, which is similar to the well-known density evolution analysis in the context of LDPC decoding algorithm. Our analysis shows that there exists a threshold on the density factor; if under this threshold, the recovery algorithm is successful; otherwise it will fail. Simulation results are also provided for verifying the agreement between the proposed asymptotic analysis and recovery algorithm. Compared with existing works of peeling decoding algorithm, focusing on the failure probability of the recovery algorithm, our proposed approach gives accurate evolution of performance with different parameters of measurement matrices and is easy to implement. We also show that the peeling decoding algorithm performs better than other schemes based on LDPC codes.

Recommendations

• Analysis of the iterative decoding of ldpc and product codes using the gaussian approximation
• LDPC decoding algorithm based on compressive sensing reconstruction for denoise
• The density evolution for layered decoding algorithms of low-density parity-check codes
• Iterative decoding of LDPC codes: some bounds and properties
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel

Cites work

• A survey of results for deletion channels and related synchronization channels
• Bayesian Compressive Sensing Via Belief Propagation
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
• Efficient erasure correcting codes
• LDPC Codes for Compressed Sensing
• R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Stable signal recovery from incomplete and inaccurate measurements
• Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

This page was built for publication: Peeling decoding of LDPC codes with applications in compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793437)