Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
For every fixed constant α > 0, we design an algorithm for computing the k-sparse Walsh-Hadamard transform (i.e., Discrete Fourier Transform over the Boolean cube) of an N-dimensional vector x ∈ R[superscript N] in time k[superscript 1 + α](log N)[superscript O(1)]. Specifically, the algorithm is...
Main Authors: | Cheraghchi, Mahdi (Author), Indyk, Piotr (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2018-02-26T21:44:54Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Walsh - Hadamard Transformation of a Convolution
by: M. Zajac, et al.
Published: (2002-09-01) -
Nearly optimal sparse fourier transform
by: Hassanieh, Haitham, et al.
Published: (2012) -
(Nearly) sample-optimal sparse fourier transform
by: Indyk, Piotr, et al.
Published: (2018) -
A Novel Autofocus Measure Based on Weighted Walsh-Hadamard Transform
by: Liqiang Guo, et al.
Published: (2019-01-01) -
Design and Implementation of Sequency-Ordered Fast Walsh-Hadamard Transform (FWHT) in WCDMA
by: Safaa M. Z. Al-Ubaidi
Published: (2014-05-01)