Брза Фуријеова трансформација — разлика између измена

}}

* -{Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, 2001. ''Introduction to Algorithms'', 2nd. ed. MIT Press and McGraw-Hill. {{page|year=|isbn=978-0-262-03293-3|pages=}}. Especially chapter 30, "Polynomials and the FFT."}-

|doi=10.1109/29.60070

|title=Algorithms meeting the lower bounds on the multiplicative complexity of length-<math>2^n</math> DFTs and their connection with practical algorithms

* -{T. Lundy and J. Van Buskirk, 2007. "A new matrix approach to real FFTs and convolutions of length 2^k," ''Computing'' '''80''' (1): 23-45.

* Kent, Ray D. and Read, Charles. ''Acoustic Analysis of Speech''. {{page|year=2002|isbn=978-0-7693-0112-9|pages=}}. Cites Strang, G. (1994)/May–June). Wavelets. ''American Scientist, 82,'' 250-255.}-

|doi=10.1145/321752.321761

|title=Note on a lower bound of the linear complexity of the fast Fourier transform

|journal = J. Fourier Anal. Appl.

|volume = 5

|archive-url = https://web.archive.org/web/20070206134937/http://www.math.ohiou.edu/~mjm/research/MOHLEN1999P.pdf

|archive-date = 06. 02. 2007