Check out my first novel, midnight's simulacra!
Rader-Brenner Algorithm: Difference between revisions
From dankwiki
(Created page with "An FFT implementation similar to the Cooley-Tukey Algorithm, but using purely imaginary twiddle factors. It saves multiplications at the cost of more additions and less nu...") |
No edit summary |
||
| Line 1: | Line 1: | ||
An FFT implementation similar to the [[Cooley-Tukey Algorithm]], but using purely imaginary twiddle factors. It saves multiplications at the cost of more additions and less numerical stability. | An FFT implementation similar to the [[Cooley-Tukey Algorithm]], but using purely imaginary twiddle factors. It saves multiplications at the cost of more additions and less numerical stability. | ||
[[CATEGORY: Computer Science Eponyms]] | |||
Latest revision as of 13:11, 13 March 2013
An FFT implementation similar to the Cooley-Tukey Algorithm, but using purely imaginary twiddle factors. It saves multiplications at the cost of more additions and less numerical stability.
