Zobrazeno 1 - 2
of 2
pro vyhledávání: '"V S S Prabhu Tej"'
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4da13ed884dbc52967f6f7e9df4c9da0
https://doi.org/10.1109/ncc52529.2021.9530137
https://doi.org/10.1109/ncc52529.2021.9530137
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
