Википедија

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

Интерактиван преглед историје
← Старија изменаНовија измена →
Садржај обрисан Садржај додат
ВизуелноВикитекст
Спашавам 2 извора и означавам 0 мртвим. #IABot (v2.0beta8)
Autobot (разговор | доприноси)
1.572.075 измена
м Разне исправке
Ред 63:
{{refbegin|2}}
* {{cite journal
|author1last=Brenner|first=N. Brenner |author2=C. Rader |year=1976
|title= A New Principle for Fast Fourier Transformation
|journal=IEEE Acoustics, Speech & Signal Processing
Ред 71:
}}
* {{cite journal
|author1author=Cooley James W. |author2=John W. Tukey |year=1965
|title=An algorithm for the machine calculation of complex Fourier series
|journal=Math. Comput.
Ред 78:
|issue=90 |pages=297-301
}}
* -{Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, 2001. ''Introduction to Algorithms'', 2nd. ed. MIT Press and McGraw-Hill. ISBN {{page|year=|isbn=978-0-262-03293-3|pages=}}. Especially chapter 30, "Polynomials and the FFT."}-
* {{cite journal
|author=Pierre Duhamel
Ред 99:
* -{Steve Haynal and Heidi Haynal, "[https://web.archive.org/web/20120426031804/http://jsat.ewi.tudelft.nl/content/volume7/JSAT7_13_Haynal.pdf Generating and Searching Families of FFT Algorithms]", ''Journal on Satisfiability, Boolean Modeling and Computation'' vol. 7, pp. 145–187 (2011).}-
* {{cite journal
|author1author=Heideman M. T. |author2last2=Johnson|first=D. H. Johnson |author3=C. S. Burrus |doi=10.1109/MASSP.1984.1162257
|title=Gauss and the history of the fast Fourier transform
|journal=IEEE ASSP Magazine
Ред 107:
}}
* {{cite journal
|author1author=Michael T. Heideman |author2=C. Sidney Burrus |year=1986
|doi=10.1109/TASSP.1986.1164785
|title=On the number of multiplications necessary to compute a length-<math>2^n</math> DFT
Ред 116:
* -{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.}-
* -{T. Lundy and J. Van Buskirk, 2007. "A new matrix approach to real FFTs and convolutions of length 2<sup>k</sup>," ''Computing'' '''80''' (1): 23-45.
* Kent, Ray D. and Read, Charles (2002). ''Acoustic Analysis of Speech''. ISBN {{page|year=|isbn=978-0-7693-0112-9|pages=}}. Cites Strang, G. (1994)/May–June). Wavelets. ''American Scientist, 82,'' 250-255.}-
* {{cite journal
|author=Jacques Morgenstern
Ред 136:
|pages = 159-184
|url = http://www.math.ohiou.edu/~mjm/research/MOHLEN1999P.pdf
|access-dateaccessdate = 25. 03. 2012
|archive-url = https://web.archive.org/web/20070206134937/http://www.math.ohiou.edu/~mjm/research/MOHLEN1999P.pdf
|archive-date = 06. 02. 2007
Ред 154:
* -{Christos H. Papadimitriou, 1979, {{doi-inline|10.1145/322108.322118|Optimality of the fast Fourier transform}}, ''J. ACM'' '''26''': 95-102.}-
* -{D. Potts, G. Steidl, and M. Tasche, 2001. "[http://www.tu-chemnitz.de/~potts/paper/ndft.pdf Fast Fourier transforms for nonequispaced data: A tutorial]", in: J.J. Benedetto and P. Ferreira (Eds.), ''Modern Sampling Theory: Mathematics and Applications'' (Birkhauser).}-
* {{Cite book |ref= harv|vauthors=Press WH, Teukolsky SA, Vetterling WT, Flannery BP | year=2007 | title=Numerical Recipes: The Art of Scientific Computing | edition=3rd | publisher=Cambridge University Press | publication-place=New York | isbn=978-0-521-88068-8 | chapter=Chapter 12. Fast Fourier Transform | chapter-url=http://apps.nrbook.com/empanel/index.html#pg=600}}
* {{cite journal
|author1author=Vladimir Rokhlin |author2=Mark Tygert |year=2006
|title=Fast algorithms for spherical harmonic expansions
|journal=SIAM J. Sci. Computing
Ред 165:
* -{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.}-
* {{cite journal
|author1last=Shentov|first=O. V. Shentov |author2=S. K. Mitra |author3last3=Heute|first=U. Heute |author4last4=Hossen|first=A. N. Hossen |year=1995
|doi=10.1016/0165-1684(94)00103-7
|title=Subband DFT. I. Definition, interpretations and extensions
Ред 173:
}}
* {{cite journal
|author1last=Sorensen|first=H. V. Sorensen |author2=D. L. Jones |author3last3=Heideman|first=M. T. Heideman |author4=C. S. Burrus |year=1987
|doi=10.1109/TASSP.1987.1165220
|title=Real-valued fast Fourier transform algorithms
Ред 190:
}}
* {{cite journal
|last=Winograd|first=S.|year=1978
|author=S. Winograd
|year=1978
|doi=10.1090/S0025-5718-1978-0468306-4
|title=On computing the discrete Fourier transform
Преузето из „https://sr.wikipedia.org/wiki/Брза_Фуријеова_трансформација”