<?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="Mathematical diagram - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Mathematical_diagram&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Mathematical_diagram&amp;p=6">3.Next</a>
</p>
<p>algorithms, a <a href="page.php?w=Butterfly_diagram">butterfly</a> is a portion of the computation that combines the results of smaller <a href="page.php?w=discrete_Fourier_transform">discrete Fourier transform</a>s (DFTs) into a larger DFT, or vice versa (breaking a larger DFT up into subtransforms). The name "butterfly" comes from the shape of the data-flow diagram in the radix-2 case, as described below. The same structure can also be found in the <a href="page.php?w=Viterbi_algorithm">Viterbi algorithm</a>, used for finding the most likely</p><p>
<a accesskey="1" href="page.php?w=Mathematical_diagram&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Mathematical_diagram&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
