Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Tej, V S S Prabhu"'
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:
http://arxiv.org/abs/2102.12514
