Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Aditya Siripuram"'
Publikováno v:
IEEE Journal of Selected Topics in Signal Processing. :1-11
Publikováno v:
Signal Processing. 211:109120
Publikováno v:
2021 National Conference on Communications (NCC).
We consider the problem of computing the Discrete Fourier transform (DFT) of an N- length signal which has only k non-zero DFT coefficients at known locations. We say that a set of indices is spectral if there exists a DFT submatrix (square) with tho
Publikováno v:
IEEE Transactions on Information Theory. 65:8119-8130
We study the problem of finding unitary submatrices of the $N \times N$ discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of questions
Publikováno v:
ICASSP
The localization of acoustic sources is a parameter estimation problem where the parameters of interest are the direction of arrivals (DOAs). The DOA estimation problem can be formulated as a sparse parameter estimation problem and solved using compr
Publikováno v:
ISIT
We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$ algorithm to co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe51d2537f18dde54a34f9d1338c1bed
http://arxiv.org/abs/2102.12514
http://arxiv.org/abs/2102.12514
Publikováno v:
ICASSP
Graph inference plays an essential role in machine learning, pattern recognition, and classification. Signal processing based approaches in literature generally assume some variational property of the observed data on the graph. We make a case for in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d759b3d34a468939aa1800adcf9bf1c6
http://arxiv.org/abs/2008.09522
http://arxiv.org/abs/2008.09522
Publikováno v:
ISIT
We consider the problem of recovering N length vectors h that vanish on a given set of indices and satisfy h * h = h. We give some results on the structure of such h when N is a product of two primes, and investigate some bounds and their connections
Autor:
Brad Osgood, Aditya Siripuram
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 conjecture, and orthogonal interpolation of bandlimited signals.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1336206ee815e1e93da413bbdac6ed6
http://arxiv.org/abs/2001.00739
http://arxiv.org/abs/2001.00739
Publikováno v:
2019 1st International Conference on Industrial Artificial Intelligence (IAI).
Recent advances in technology have led to easy data acquisition mechanisms in many fields, leading to massive datasets. It is often of interest to understand the inherent structure and learn the best representation of the given dataset. Graphs are a