﻿

The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an obscure paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in 1984. (The name "split radix" was coined by two of these reinventors, P. Duhamel and H. Hollmann.) In particular, split radix is a variant of the Cooley-Tukey FFT algorithm that uses a blend of radices 2 and 4: it recursively expresses a DFT of length "N" in terms of one smaller DFT of length "N"/2 and two smaller DFTs of length "N"/4.

The split-radix FFT, along with its variations, long had the distinction of achieving the lowest published arithmetic operation count (total exact number of required real additions and multiplications) to compute a DFT of power-of-two sizes "N". The arithmetic count of the original split-radix algorithm was improved upon in 2004 (with the initial gains made in unpublished work by J. Van Buskirk via hand optimization for "N"=64 [http://groups.google.com/group/comp.dsp/msg/9e002292accb8a8b] [http://home.comcast.net/~kmbtib/] ), but it turns out that one can still achieve the new lowest count by a modification of split radix (Johnson and Frigo, 2007). Although the number of arithmetic operations is not the sole factor (or even necessarily the dominant factor) in determining the time required to compute a DFT on a computer, the question of the minimum possible count is of longstanding theoretical interest. (No tight lower bound on the operation count has currently been proven.)

The split-radix algorithm can only be applied when "N" is a multiple of 4, but since it breaks a DFT into smaller DFTs it can be combined with any other FFT algorithm as desired.

Recall that the DFT is defined by the formula::$X_k = sum_\left\{n=0\right\}^\left\{N-1\right\} x_n omega_N^\left\{nk\right\}$where $k$ is an integer ranging from $0$ to $N-1$ and $omega_N$ denotes the primitive root of unity::$omega_N = e^\left\{-frac\left\{2pi i\right\}\left\{N,$and thus $omega_N^N = 1$.

The split-radix algorithm works by expressing this summation in terms of three smaller summations. (Here, we give the "decimation in time" version of the split-radix FFT; the dual decimation in frequency version is essentially just the reverse of these steps.)

First, a summation over the even indices $x_\left\{2n_2\right\}$. Second, a summation over the odd indices broken into two pieces: $x_\left\{4n_4+1\right\}$ and $x_\left\{4n_4+3\right\}$, according to whether the index is 1 or 3 modulo 4. Here, $n_m$ denotes an index that runs from 0 to $N/m-1$. The resulting summations look like:

:$X_k = sum_\left\{n_2=0\right\}^\left\{N/2-1\right\} x_\left\{2n_2\right\} omega_\left\{N/2\right\}^\left\{n_2 k\right\} + omega_N^k sum_\left\{n_4=0\right\}^\left\{N/4-1\right\} x_\left\{4n_4+1\right\} omega_\left\{N/4\right\}^\left\{n_4 k\right\}+ omega_N^\left\{3k\right\} sum_\left\{n_4=0\right\}^\left\{N/4-1\right\} x_\left\{4n_4+3\right\} omega_\left\{N/4\right\}^\left\{n_4 k\right\}$

where we have used the fact that $omega_N^\left\{m n k\right\} = omega_\left\{N/m\right\}^\left\{n k\right\}$. These three sums correspond to "portions" of radix-2 (size "N"/2) and radix-4 (size "N"/4) Cooley-Tukey steps, respectively. (The underlying idea is that the even-index subtransform of radix-2 has no multiplicative factor in front of it, so it should be left as-is, while the odd-index subtransform of radix-2 benefits by combining a second recursive subdivision.)

These smaller summations are now exactly DFTs of length "N"/2 and "N"/4, which can be performed recursively and then recombined.

More specifically, let $U_k$ denote the result of the DFT of length "N"/2 (for $k = 0,ldots,N/2-1$), and let $Z_k$ and $Z\text{'}_k$ denote the results of the DFTs of length "N"/4 (for $k = 0,ldots,N/4-1$). Then the output $X_k$ is simply::$X_k = U_k + omega_N^k Z_k + omega_N^\left\{3k\right\} Z\text{'}_k$.

This, however, performs unnecessary calculations, since $k geq N/4$ turn out to share many calculations with $k < N/4$. In particular, if we add "N"/4 to "k", the size-"N"/4 DFTs are not changed (because they are periodic in "k"), while the size-"N"/2 DFT is unchanged if we add "N"/2 to "k". So, the only things that change are the $omega_N^k$ and $omega_N^\left\{3k\right\}$ terms, known as twiddle factors. Here, we use the identities::$omega_N^\left\{k+N/4\right\} = -i omega_N^k$:$omega_N^\left\{3\left(k+N/4\right)\right\} = i omega_N^\left\{3k\right\}$to finally arrive at::$X_k = U_k + left\left( omega_N^k Z_k + omega_N^\left\{3k\right\} Z\text{'}_k ight\right),$:$X_\left\{k+N/2\right\} = U_k - left\left( omega_N^k Z_k + omega_N^\left\{3k\right\} Z\text{'}_k ight\right),$:$X_\left\{k+N/4\right\} = U_\left\{k+N/4\right\} - i left\left( omega_N^k Z_k - omega_N^\left\{3k\right\} Z\text{'}_k ight\right),$:$X_\left\{k+3N/4\right\} = U_\left\{k+N/4\right\} + i left\left( omega_N^k Z_k - omega_N^\left\{3k\right\} Z\text{'}_k ight\right),$which gives all of the outputs $X_k$ if we let $k$ range from $0$ to $N/4-1$ in the above four expressions.

Notice that these expressions are arranged so that we need to combine the various DFT outputs by pairs of additions and subtractions, which are known as butterflies. In order to obtain the minimal operation count for this algorithm, one needs to take into account special cases for $k = 0$ (where the twiddle factors are unity) and for $k = N/8$ (where the twiddle factors are $\left(pm 1 - i\right)/sqrt\left\{2\right\}$ and can be multiplied more quickly). Multiplications by $pm 1$ and $pm i$ are ordinarily counted as free (all negations can be absorbed by converting additions into subtractions or vice versa).

This decomposition is performed recursively when "N" is a power of two. The base cases of the recursion are "N"=1, where the DFT is just a copy $X_0 = x_0$, and "N"=2, where the DFT is an addition $X_0 = x_0 + x_1$ and a subtraction $X_1 = x_0 - x_1$.

These considerations result in a count: $4 N log_2 N - 6N + 8$ real additions and multiplications, for "N" a power of two greater than 1.

References

* R. Yavne, "An economical method for calculating the discrete Fourier transform," in "Proc. AFIPS Fall Joint Computer Conf." 33, 115–125 (1968).
* P. Duhamel and H. Hollmann, "Split-radix FFT algorithm," "Electron. Lett." 20 (1), 14–16 (1984).
* M. Vetterli and H. J. Nussbaumer, "Simple FFT and DCT algorithms with reduced number of operations," "Signal Processing" 6 (4), 267–278 (1984).
* J. B. Martens, "Recursive cyclotomic factorization—a new algorithm for calculating the discrete Fourier transform," "IEEE Trans. Acoust., Speech, Signal Processing" 32 (4), 750–761 (1984).
* P. Duhamel and M. Vetterli, "Fast Fourier transforms: a tutorial review and a state of the art," "Signal Processing" 19, 259&ndash;299 (1990).
* S. G. Johnson and M. Frigo, " [http://www.fftw.org/newsplit.pdf A modified split-radix FFT with fewer arithmetic operations] ," "IEEE Trans. Signal Processing" 55 (1), 111–119 (2007).
* Douglas L. Jones, " [http://cnx.org/content/m12031/latest/ Split-radix FFT algorithms] ," " [http://cnx.org/ Connexions] " web site (Nov. 2, 2006).

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… …   Wikipedia

• Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… …   Wikipedia

• Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… …   Wikipedia

• Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia

• List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

• List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

• Discrete Hartley transform — A discrete Hartley transform (DHT) is a Fourier related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT… …   Wikipedia

• Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …   Wikipedia

• Butterfly diagram — 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 = r m into r smaller transforms of size …   Wikipedia

• Overlap-add method — The overlap add method (OA, OLA) is an efficient way to evaluate the discrete convolution between a very long signal x [n] with a finite impulse response (FIR) filter h [n] ::egin{align}y [n] = x [n] * h [n] stackrel{mathrm{def{=} sum {m=… …   Wikipedia