Reducing the Computational Complexity of Reconstruction in Compressed Sensing Nonuniform Sampling

Ruben Grigoryan, Tobias Lindstrøm Jensen, Thomas Arildsen, Torben Larsen

Research output: Contribution to journalConference article in JournalResearchpeer-review

5 Citations (Scopus)
345 Downloads (Pure)


This paper proposes a method that reduces the computational complexity of signal reconstruction in single-channel nonuniform sampling while acquiring frequency sparse multi-band signals. Generally, this compressed sensing based signal acquisition allows a decrease in the sampling rate of frequency sparse signals, but requires computationally expensive reconstruction algorithms. This can be an obstacle for real-time applications. The reduction of complexity is achieved by applying a multi-coset sampling procedure. This proposed method reduces the size of the dictionary matrix, the size of the measurement matrix and the number of iterations of the reconstruction algorithm in comparison to the direct single-channel approach. We consider an orthogonal matching pursuit reconstruction algorithm for single-channel sampling and its modification for multi-coset sampling. Theoretical as well as numerical analyses demonstrate order of magnitude reduction in execution time for typical problem sizes without degradation of the signal reconstruction quality.
Original languageEnglish
JournalEuropean Signal Processing Conference (EUSIPCO)
Number of pages5
Publication statusPublished - 2013
EventEuropean Signal Processing Conference EUSIPCO 2013 - Marrakech, Moroco
Duration: 9 Sept 201313 Sept 2013


ConferenceEuropean Signal Processing Conference EUSIPCO 2013
CityMarrakech, Moroco


  • compressed sensing
  • multi-coset
  • sampling
  • nonuniform sampling
  • reconstruction algorithm


Dive into the research topics of 'Reducing the Computational Complexity of Reconstruction in Compressed Sensing Nonuniform Sampling'. Together they form a unique fingerprint.

Cite this