Ramanujan Sums in the Context of Signal Processing—Part II: FIR Representations and Applications
Author:
Top Cited Papers
- 18 June 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 62 (16) , 4158-4172
Abstract
The mathematician Ramanujan introduced a summation in 1918, now known as the Ramanujan sum c q (n). In a companion paper (Part I), properties of Ramanujan sums were reviewed, and Ramanujan subspaces S q introduced, of which the Ramanujan sum is a member. In this paper, the problem of representing finite duration (FIR) signals based on Ramanujan sums and spaces is considered. First, it is shown that the traditional way to solve for the expansion coefficients in the Ramanujan-sum expansion does not work in the FIR case. Two solutions are then developed. The first one is based on a linear combination of the first N Ramanujan-sums (with N being the length of the signal). The second solution is based on Ramanujan subspaces. With q 1 , q 2 ,..., q K denoting the divisors of N; it is shown that x(n) can be written as a sum of K signals x qi (n) ∈ S qi . Furthermore, the i th signal x qi (n) has period q i , and any pair of these periodic components is orthogonal. The components x qi (n) can be calculated as orthogonal projections of x(n) onto Ramanujan spaces S qi . Then, the Ramanujan Periodic Transform (RPT) is defined based on this, and is useful to identify hidden periodicities. It is shown that the projection matrices (which compute x qi (n) from x(n)) are integer matrices except for an overall scale factor. The calculation of projections is therefore rendered easy. To estimate internal periods N ∞ <; N of x(n), one only needs to know which projection energies are nonzero.Keywords
Funding Information
- ONR (N00014-11-1-0676)
- Information Science and Technology (IST) initiative of Caltech
This publication has 17 references indexed in Scilit:
- The farey-dictionary for sparse representation of periodic signals2014
- Ramanujan-sum expansions for finite duration (FIR) sequences2014
- Ramanujan sums analysis of long-period sequences and 1/f noiseEurophysics Letters, 2009
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Ramanujan sums for signal processing of low frequency noise2003
- Periodicity transformsIEEE Transactions on Signal Processing, 1999
- MUSIC, maximum likelihood, and Cramer-Rao boundIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Adaptive comb filtering for harmonic signal enhancementIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Multiple emitter location and signal parameter estimationIEEE Transactions on Antennas and Propagation, 1986