Revision as of 23:54, 23 August 2023 edit Dimawik (talk \| contribs) Extended confirmed users 2,446 edits restoring cite per pdf file Tag: Undo ← Previous edit		Revision as of 15:40, 18 October 2023 edit undo Chongkian (talk \| contribs) Autopatrolled, Event coordinators, Extended confirmed users 395,171 edits stub template should be placed at the very end of article after external link, navbox & category tags per WP:STUBSPACING Next edit →
Line 29: * {{cite journal \| last1 = Al Na'mneh \| first1 = Rami \| last2 = Pan \| first2 = W. David \| title = Five-step FFT algorithm with reduced computational complexity \| journal = Information Processing Letters \| date = March 2007 \| volume = 101 \| issue = 6 \| pages = 262–267 \| issn = 0020-0190 \| doi = 10.1016/j.ipl.2006.10.009 \| pmid = \| url = }} * {{cite book \| first1 = Jörg \| last1 = Arndt \| date = 1 October 2010 \| title = Matters Computational: Ideas, Algorithms, Source Code \| publisher = Springer Science & Business Media \| pages = 438–439 \| isbn = 978-3-642-14764-7 \| oclc = 1005788763 \| chapter-url = https://books.google.com/books?id=HsRHS6u7e80C&pg=PA438 \| chapter = The Matrix Fourier Algorithm (MFA)}} {{math-stub}}▼ [[Category:FFT algorithms]] ▲{{math-stub}}

Bailey's FFT algorithm: Difference between revisions