13 citations · 22 across the 5 of their papers we have counts for
6 papers
Numerical Stability of DFT Computation for Signals with Structured Support
Charantej Reddy Pochimireddy, Aditya Siripuram, Brad Osgood
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of - length signals with known frequency support of size . A…
Fast DFT Computation for Signals with Structured Support
Charantej Reddy P, Aditya Siripuram, Brad Osgood
Suppose an length signal has known frequency support of size . Given sample access to this signal, how fast can we compute the DFT? The answer to this question depends on th…
Convolution Idempotents with a given Zero-set
Aditya Siripuram, Brad Osgood
We investigate the structure of N-length discrete signals h satisfying h*h=h that vanish on a given set of indices. We motivate this problem from examples in sampling, Fuglede's co…
Investigating the relationship between graph eigenvector ordering and the signal processing dual
Subbareddy Batreddy, S Sai Ashish, Aditya Siripuram
Graph signal processing uses the graph eigenvector basis to analyze signals. However, these graph eigenvectors are typically linearly ordered (by total variation), which may not be…
Discrete Sampling: A graph theoretic approach to Orthogonal Interpolation
Aditya Siripuram, William Wu, Brad Osgood
We study the problem of finding unitary submatrices of the discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an or…
Discrete Sampling and Interpolation: Universal Sampling Sets for Discrete Bandlimited Spaces
Brad Osgood, Aditya Siripuram, William Wu
We study the problem of interpolating all values of a discrete signal f of length N when d<N values are known, especially in the case when the Fourier transform of the signal is ze…