Sparse signal analysis using Ramanujan sums

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we perform sparse signal analysis by using the Ramanujan Sums (RS). The RS are orthogonal in nature and therefore offer excellent energy conservation. Our analysis shows that the RS can compress the energy of a periodic impulse chain signal into fewer number of RS coefficients than the Fourier transform (FT). In addition, the RS are faster than the FT in computation time because we can calculate the RS basis functions only once and save them to a file. We can retrieve these RS basis functions for our calculation instead of computing them online. To process a signal of 128 samples, we spend 1.0 millisecond for the RS and 5.82 milliseconds for the FT by using our unoptimized Matlab code. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, G., Krishnan, S., Liu, W., & Xie, W. (2013). Sparse signal analysis using Ramanujan sums. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7996 LNAI, pp. 450–456). https://doi.org/10.1007/978-3-642-39482-9_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free