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

|issue=3

|doi=10.1109/TASSP.1976.1162805

}}

* {{cite journal

|doi=10.1090/S0025-5718-1965-0178586-1

|issue=90

}}

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

|volume=38

|issue=9

}}

* -{P. Duhamel and M. Vetterli, 1990, {{doi-inline|10.1016/0165-1684(90)90158-U|Fast Fourier transforms: a tutorial review and a state of the art}}, ''Signal Processing'' '''19''': 259–299.}-

|volume=1

|issue=4

|year=1984

}}

|volume=34

|issue=1

}}

* -{S. G. Johnson and M. Frigo, 2007. "[http://www.fftw.org/newsplit.pdf A modified split-radix FFT with fewer arithmetic operations]," ''IEEE Trans. Signal Processing'' '''55''' (1): 111–119.}-

|volume=20

|issue=2

}}

* {{ cite journal

|volume=5

|issue=2-3

|url=http://www.math.ohiou.edu/~mjm/research/MOHLEN1999P.pdf

}}

|volume=13

|issue=13

}}

* -{V. Pan, 1986, {{doi-inline|10.1016/0020-0190(86)90035-9|The trade-off between the additive complexity and the asyncronicity of linear and bilinear algorithms}}, ''Information Proc. Lett.'' '''22''': 11-14.}-

|issue=6

|doi=10.1137/050623073

}}

* -{James C. Schatzman, 1996, [http://portal.acm.org/citation.cfm?id=240432 Accuracy of the discrete Fourier transform and the fast Fourier transform], ''SIAM J. Sci. Comput.'' '''17''': 1150–1166.}-

|volume=41

|issue= 3

}}

* {{cite journal

|volume=35

|issue=35

}}

* {{cite journal

|volume=17

|issue=2

}}

* {{cite journal

|volume=32

|issue=141

|jstor = 2006266

}}