Çelik, SafaBaşaran, MehmetErküçük, SerhatÇırpan, Hakan Ali2019-06-272019-06-27201659781509016792https://hdl.handle.net/20.500.12469/517https://doi.org/10.1109/SIU.2016.7496021Compressed sensing theory shows that any signal which is defined as sparse in a given domain can be reconstructed using fewer linear projections instead of using all Nyquist-rate samples. In this paper we investigate basis pursuit matching pursuit orthogonal matching pursuit and compressive sampling matching pursuit algorithms which are basic compressed sensing based algorithms and present performance curves in terms of mean squared error for various parameters including signal-tonoise ratio sparsity and number of measurements with regard to mean squared error. In addition accuracy of estimation performances has been supported with theoretical lower bounds (Cramer-Rao lower bound and deterministic lower mean squared error). Considering estimation performances compressive sampling matching pursuit yields the best results unless the signal has a non-sparse structure.trinfo:eu-repo/semantics/openAccessCompressed SensingGreedy MethodsCramer-Rao Lower BoundConference Object14411444WOS:00039125090033710.1109/SIU.2016.74960212-s2.0-84982796354N/AN/A