Topic
Split-radix FFT algorithm
About: Split-radix FFT algorithm is a research topic. Over the lifetime, 1845 publications have been published within this topic receiving 41398 citations.
Papers published on a yearly basis
Papers
More filters
Dissertation•
01 Jan 2012
10 citations
TL;DR: A fast algorithm is presented which computes the two-dimensional Hartley transform using the decimation in frequency decomposition and, due to its in-place property, it does not require midmemory devices or matrix transposition.
Abstract: A fast algorithm is presented which computes the two-dimensional Hartley transform. This algorithm is referred to as the split vector radix algorithm. It uses the decimation in frequency decomposition and, due to its in-place property, it does not require midmemory devices or matrix transposition. Its computational structure is simpler than that of the algorithm of L.Z. Chen (1983), and it is easy to program. Compared with the vector radix algorithm of R. Kumaresan and P.K. Gupta (1986), the proposed algorithm saves about 35% of the multiplication and 10% of the additions for the discrete Fourier transform (DFT) of a 4096*4096 real valued input sequence. >
10 citations
TL;DR: An approach to the solution of a system of Toeplitz normal equations is presented, based on using iterative techniques, the circulant matrices and the fast Fourier transform algorithm, compared with the Trench's algorithm.
Abstract: This note presents an approach to the solution of a system of Toeplitz normal equations, based on using iterative techniques, the circulant matrices and the fast Fourier transform algorithm. The number of computations required and the roundoff errors associated with this method are discussed. The merits and demerits of this approach are compared with the Trench's algorithm.
10 citations
21 Aug 1989
TL;DR: This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method, using notations and techniques of Sheeran and Bird and Meertens and claiming that these techniques are applicable to digital signal processing circuits.
Abstract: This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran [1] and Bird and Meertens [2, 3]. We have claimed that these techniques are applicable to digital signal processing circuits, and have previously applied them to regular array circuits [4, 5, 6].
10 citations
TL;DR: Analysis of the numbers of complex additions and multiplications required indicate that implementations of the radix-4 row-column FFT and 4 × 4 vector radix FFT on the same minicomputer would run slower than the multiple vector implementation.
Abstract: A new version of the radix-2 row-column method for computing two-dimensional fast Fourier transforms is proposed. It uses a ``multiple vector'' FFT algorithm to compute the transforms of all the columns in an array simultaneously while avoiding all trivial multiplications. The minicomputer implementation of the algorithm runs faster than the 2 × 2 vector radix FFT algorithm. Analysis of the numbers of complex additions and multiplications required indicate that implementations of the radix-4 row-column FFT and 4 × 4 vector radix FFT on the same minicomputer would run slower than the multiple vector implementation.
10 citations