We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero Fourier coefficients, and * An O(k log n log(n/k))-time randomized algorithm for general input signals. Both algorithms achieve o(n log n) time, and thus improve ov

Virginia Tech has been a world leader in electronic theses and dissertation initiatives for more than 20 years. On January 1, 1997, Virginia Tech was the first university to require electronic submission of theses and dissertations (ETDs). Ever since then, Virginia Tech graduate students have been able to prepare, submit, review, and publish their theses and dissertations online and to append digi