https://nick-black.com/dankwiki/index.php?title=Rader-Brenner_Algorithm&feed=atom&action=historyRader-Brenner Algorithm - revision history2024-03-29T12:03:07ZRevision history for this page on the wikiMediaWiki 1.41.0https://nick-black.com/dankwiki/index.php?title=Rader-Brenner_Algorithm&diff=5247&oldid=prevDank at 13:11, 13 March 20132013-03-13T13:11:26Z<p></p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 13:11, 13 March 2013</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>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.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>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.</div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[CATEGORY: Computer Science Eponyms]]</ins></div></td></tr>
</table>Dankhttps://nick-black.com/dankwiki/index.php?title=Rader-Brenner_Algorithm&diff=5243&oldid=prevDank: 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..."2013-03-13T13:02:13Z<p>Created page with "An FFT implementation similar to the <a href="/dankwiki/index.php/Cooley-Tukey_Algorithm" title="Cooley-Tukey Algorithm">Cooley-Tukey Algorithm</a>, but using purely imaginary twiddle factors. It saves multiplications at the cost of more additions and less nu..."</p>
<p><b>New page</b></p><div>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.</div>Dank