Butterfly (FFT Algorithm)

In the context of fast Fourier transform algorithms, a butterfly is a portion of the computation that combines the results of smaller discrete Fourier transforms (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.Alan V. Oppenheim, Ronald W. Schafer, and John R. Buck, ''Discrete-Time Signal Processing'', 2nd edition (Upper Saddle River, NJ: Prentice Hall, 1989) The earliest occurrence in print of the term is thought to be in a 1969 MIT technical report. The same structure can also be found in the Viterbi algorithm, used for finding the most likely sequence of hidden states.

Most commonly, the term "butterfly" appears in the context of the Cooley–Tukey FFT algorithm, which recursively breaks down a DFT of composite size ''n'' = ''rm'' into ''r'' smaller transforms of size ''m'' where ''r'' is the "radix" of the transform. These smaller DFTs are then combined via size-''r'' butterflies, which themselves are DFTs of size ''r'' (performed ''m'' times on corresponding outputs of the sub-transforms) pre-multiplied by roots of unity (known as twiddle factors). (This is the "decimation in time" case; one can also perform the steps in reverse, known as "decimation in frequency", where the butterflies come first and are post-multiplied by twiddle factors. See also the Cooley–Tukey FFT article.)

Radix-2 butterfly diagram

In the case of the radix-2 Cooley–Tukey algorithm, the butterfly is simply a DFT of size-2 that takes two inputs (''x''₀, ''x''₁) (corresponding outputs of the two sub-transforms) and gives two outputs (''y''₀, ''y''₁) by the formula (not including twiddle factors):

:$y_0 = x_0 + x_1 \,$
:$y_1 = x_0 - x_1. \,$

If one draws the data-flow diagram for this pair of operations, the (''x''₀, ''x''₁) to (''y''₀, ''y''₁) lines cross and resemble the wings of a butterfly, hence the name (see also the illustration at right).

More specifically, a radix-2 decimation-in-time FFT algorithm on ''n'' = 2 ^''p'' inputs with respect to a primitive ''n''-th root of unity $\omega^k_n = e^$ relies on O(''n'' log₂ ''n'') butterflies of the form:

:$y_0 = x_0 + x_1 \omega^k_n \,$
:$y_1 = x_0 - x_1 \omega^k_n, \,$

where ''k'' is an integer depending on the part of the transform being computed. Whereas the corresponding inverse transform can mathematically be performed by replacing ''ω'' with ''ω''⁻¹ (and possibly multiplying by an overall scale factor, depending on the normalization convention), one may also directly invert the butterflies:

:$x_0 = \frac (y_0 + y_1) \,$
:$x_1 = \frac (y_0 - y_1), \,$

corresponding to a decimation-in-frequency FFT algorithm.

Other uses

The butterfly can also be used to improve the randomness of large arrays of partially random numbers, by bringing every 32 or 64 bit word into causal contact with every other word through a desired hashing algorithm, so that a change in any one bit has the possibility of changing all the bits in the large array.{{Citation , title=Numerical Recipes: The Art of Scientific Computing , last=Press , first=William H. , year=2007 , pages=358 , url=https://www.cambridge.org/ru/universitypress/subjects/mathematics/numerical-recipes/numerical-recipes-art-scientific-computing-3rd-edition , place=New York , publisher=Cambridge University Press , chapter=Section 7.2 Completely Hashing a Large Array , edition=3rd , isbn=978-0-521-88068-8 , last2=Teukolsky , first2=Saul A. , last3=Vetterling , first3=William T. , last4=Flannery , first4=Brian P.

See also

* Mathematical diagram
* Zassenhaus lemma
* Signal-flow graph

References

External links

explanation of the FFT and butterfly diagrams

FFT algorithms
Diagrams