### Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformNote on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

Access Restriction
Subscribed

 Author Morgenstern, Jacques Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1973 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract A lower bound for the number of additions necessary to compute a family of linear functions by a linear algorithm is given when an upper bound $\textit{c}$ can be assigned to the modulus of the complex numbers involved in the computation. In the case of the fast Fourier transform, the lower bound is $(\textit{n}/2)$ $log2\textit{n}$ when $\textit{c}$ = 1. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1973-04-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 20 Issue Number 2 Page Count 2 Starting Page 305 Ending Page 306

#### Open content in new tab

Source: ACM Digital Library