\bib{1986/heideman}
\yr 1986
\mr 87e:94007
\by Michael T. Heideman
\by C. Sidney Burrus
\paper On the number of multiplications necessary to compute a length-$2^n$ FFT
\jour IEEE Transactions on Acoustics, Speech, and Signal Processing
\issn 0096--3518
\vol 34
\pages 91--95
\url http://cr.yp.to/\allowbreak bib/\allowbreak entries.html#\allowbreak 1986/\allowbreak heideman
\endref