Open Access Journal

ISSN : 2394 - 6849 (Online)

International Journal of Engineering Research in Electronics and Communication Engineering(IJERECE)

Monthly Journal for Electronics and Communication Engineering

Open Access Journal

International Journal of Engineering Research in Electronics and Communication Engineering(IJERECE)

Monthly Journal for Electronics and Communication Engineering

ISSN : 2394-6849 (Online)

VHDL Simulation of Compressive Sensing Reconstruction

Author : Nimisha P K 1 Saritha E 2

Date of Publication :7th August 2016

Abstract: Compressive Sensing (CS) signal reconstruction can be implemented using convex relaxation, non-convex, or local optimization algorithms. Though the re- construction using convex optimization, such as the Iterative Hard Thresholding algorithm is more accurate than matching pursuit algorithms, most researchers focus on matching pursuit algorithms because they are less computationally complex. Orthogonal Matching Pursuit (OMP) is a greedy algorithm, which solves the problem by choosing the most significant variable to reduce the least square error. Simultaneous OMP is an extension of OMP algorithm which contain multiple measurement vector (MMV). In this paper, we present an architecture by using VHDL for the reconstruction of compressively sensed signal using the orthogonal matching pursuit (OMP) and simultaneous OMP.

Reference :

  1. [1] Hassan Rabah, Abbes Amira, Basant Kumar Mohanty, Somaya Almaadeed and Pramod Kumar Meher, “FPGA Implementation of Orthogonal Matching Pursuit for Compressive Sensing Reconstruction,” IEEE Trans. VLSI systems, Sept.2014.

    [2]Emmanuel J. Cands and Michael B. Wakin, “An Introduction To Compressive Sampling ”, IEEE SIGNAL PROCESSING MAGAZINE , March 2008.

    [3] Jean Franois Determe, Jrme Louveaux, Laurent Jacques and Franois Horlin, “On The Exact Recovery Condition of Simultaneous Orthogonal Matching Pursuit ”, IEEE SIGNAL PROCESSING LETTERS, Jan 2016.

    [4] Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss, “Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit”, Elsevier Computer Science, Aug.2005.

    [5] S.G. Mallat and Z. Zhang, “Matching pursuits with time frequency dictionaries,” IEEE Trans. Signal Process, vol. 41, pp. 3397–3415, Dec 1993

    [6] J. A. Tropp and A. C . Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit, IEEE Trans. Inf. Theory, vol. 53, pp. 4655 - 4666, Dec 2007.

    [7] P. Maechler et al., “VLSI design of approximate message passing for signal restoration and compressive sensing,” IEEE J. Emerg. Sel.Topics Circuits Syst, vol. 2, no. 3, pp. 579 - 590, Sep. 2012

    [8] A. Septimus and R. Steinberg, “Compressive sampling hardware reconstruction,” Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), pp.3316-3319 May/June 2010.

    [9] T. R . Braun, “An evaluation of GPU acceleration for sparse reconstruction ,” Proc. SPIE, Signal Process., Sensor Fusion, Target Recognit. XIX, vol. 53, pp. 105–115, Apr 2010.

    [10] A. Happonen, A. Burian, and E. Hemming, “A recongurable processing element implementation for matrix inversion using Cholesky decomposition, World Acad. Sci., Eng., Technol., vol. 3, no. 28, pp. 114-117, Mar. 200


Recent Article