<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Fast Fourier transform - Page 18 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Fast_Fourier_transform&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Fast_Fourier_transform&amp;p=19">3.Next</a>
</p>
<p>around 1805 (and subsequently rediscovered several times in limited forms).</p>

<p>The best known use of the Cooley-Tukey algorithm is to divide the transform into two pieces of size  at each step, and is therefore limited to power-of-two sizes, but any factorization can be used in general (as was known to both Gauss and Cooley/Tukey). These are called the radix-2 and mixed-radix cases, respectively (and other variants such as the <a href="page.php?w=split-radix_FFT">split-radix FFT</a> have their own names as well).  Although the basic idea</p><p>
<a accesskey="1" href="page.php?w=Fast_Fourier_transform&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Fast_Fourier_transform&amp;p=19">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
