Publication

Abstract : Compressed sensing (CS) is an emerging field which enables the undersampling of sparse signals rather than at the Nyquist rate. But the main computational challenge involved is in the reconstruction process as it is nonlinear in nature and the solution is obtained by solving a set of under determined linear equations. Greedy algorithms offer the solution to these kinds of problems with less computational complexity than the convex relaxations or linear programming methods. The approximate message passing algorithm offers accurate reconstruction of even the approximately sparse signals with reasonable computational intensity. In this paper, we have implemented a modified version of AMP algorithm and obtained a 50 % reduction in mean squared error and an improvement in signal-to-noise ratio