Abstract
Obtaining a nontrivial (superlinear) lower bound for computation of the Fourier transform in the linear circuit model has been a long-standing open problem for more than 40 years. An early result by Morgenstern from 1973, provides an Ω(nlog n) lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. That result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, it is not scale insensitive. More recently, Ailon [2013] showed that if only unitary 2-by-2 gates are used, and additionally no extra memory is allowed, then the normalized Fourier transform requires Ω(nlog n) steps. This rather limited result is also sensitive to scaling, but highlights the complexity inherent in the Fourier transform arising from introducing entropy, unlike, say, the identity matrix (which is as complex as the Fourier transform using Morgenstern’s arguments, under proper scaling). This work improves on Ailon [2013] in two ways: First, we eliminate the scaling restriction and provide a lower bound for computing any scaling of the Fourier transform. Second, we allow the computational model to use extra memory. Our restriction is that the composition of all gates up to any point must be a well- conditioned linear transformation. The lower bound is Ω(R−1nlog n), where R is the uniform condition number. Well-conditioned is a natural requirement for algorithms accurately computing linear transformations on machine architectures of bounded word size. Hence, this result can be seen as a tradeoff between speed and accuracy. The main technical contribution is an extension of matrix entropy used in Ailon [2013] for unitary matrices to a potential function computable for any invertible matrix, using “quasi-entropy” of “quasi-probabilities.”
- Nir Ailon. 2013. A lower bound for fourier transform computation in a linear model over 2x2 unitary gates using matrix entropy. Chicago J. of Theo. Comp. Sci. (2013).Google Scholar
- Nir Ailon. 2015. Tighter fourier transform complexity tradeoffs. arxiv (2015).Google Scholar
- Isaac L. Chuang and Michael A. Nielsen. 2010. Quantum Computation and Quantum Information. Cambridge University Press.Google Scholar
- J. W. Cooley and J. W Tukey. 1964. An algorithm for the machine computation of complex Fourier series. J. of American Math. Soc. (1964), 297--301.Google Scholar
- Gene H. Golub and Charles F. van Loan. 1989. Matrix Computations (2 ed.). Johns Hopkins University Press.Google Scholar
- Jacques Morgenstern. 1973. Note on a lower bound on the linear complexity of the fast fourier transform. J. ACM 20, 2 (April 1973), 305--306. Google Scholar
Digital Library
- Christos H. Papadimitriou. 1979. Optimality of the fast fourier transform. J. ACM 26, 1 (Jan. 1979), 95--102. Google Scholar
Digital Library
- Ran Raz and Amir Yehudayoff. 2011. Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. 77, 1 (2011), 167--190. Google Scholar
Digital Library
- S. Winograd. 1976. On computing the discrete fourier transform. Proc. Nat. Assoc. Sci. 73, 4 (1976), 1005--1006.Google Scholar
Cross Ref
Index Terms
An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model
Recommendations
A Low-Complexity Approach to Computation of the Discrete Fractional Fourier Transform
This paper proposes an effective approach to the computation of the discrete fractional Fourier transform for an input vector of any length N. This approach uses specific structural properties of the discrete fractional Fourier transformation matrix. ...
Representation of the Fourier Transform by Fourier Series
The analysis of the mathematical structure of the integral Fourier transform shows that the transform can be split and represented by certain sets of frequencies as coefficients of Fourier series of periodic functions in the interval $$[0,2\pi)$$ . In this paper we ...
Trim-to-Coherence Fourier Transform
We introduce a discrete Fourier transform technique which extracts more spectral information from a given time series data set than conventional discrete Fourier transform (DFT). Valid information is obtained between the spectral bins of conventional ...






Comments