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.

Note on the FFT Based Computational Code and Its Application

Abstract: The discrete convolution based Fast Fourier Transform algorithm (DC-FFT) has been successfully applied in numerical simulation of contact problems. The algorithm is revisited from a mathematical point of view, equivalent to a Toeplitz matrix multiplied by a vector. The nature of the convolution property permits one to implement the algorithm with fewer constraints in choosing the computational domains. This advantageous feature is explored in the present work, and is expected to be beneficial to many tribological studies.Copyright © 2008 by ASME

On uniform one-chip VLSI design considerations for some discrete orthogonal transforms

Abstract: One-chip VLSI design consideration for AT/sup 2/ optimal fast Fourier transform (FFT) shuffle-exchange architecture is considered, and a systolic-network architecture for the computation of the FFT is presented. This architecture has the same asymptotically optimal theoretical O(N/sup 2/log/sup 2/N) AT/sup 2/ complexity as the FFT shuffle-exchange architecture, but is more suitable for one-chip VLSI design. Architectures which are feasible for a one-chip FFT design, as well as for shuffle-exchange-type fast discrete orthogonal transforms such as the generalized transform, cosine transform, and slant transform are also discussed. >

New formulation of discrete Wigner-Ville distribution

Abstract: A new formulation of the discrete Wigner-Ville distribution is presented which can be implemented directly using standard fast Fourier transform techniques. For a non-negative frequency resolution of N points, only an N point FFT is needed.

Recursive Discrete Fourier Transform based SMT receivers for cognitive radio applications

Abstract: This paper presents a modified Staggered MultiTone (SMT) receiver structure tailored to cognitive radio applications. SMT schemes employing Fast Fourier Transform (FFT) in the receiver for demodulation are discussed in the first part. The second part deals with Recursive Discrete Fourier Transform (R-DFT) originating from measurement systems. The recursive structure is suggested as an alternative to FFT for demodulation and spectral sensing. The paper concludes with a discussion of the advantages of the proposed receiver architecture especially in cognitive radio applications, and the investigation of the required signal processing complexity.

Reducing power consumption in FFT architectures by using heuristic-based algorithms for the ordering of the twiddle factors

Abstract: This paper addresses the exploration of different heuristic-based algorithms for a better manipulation of coefficients in Fast Fourier Transform (FFT). Due to the characteristics of the FFT algorithms, which involve multiplications of input data with appropriate coefficients, the best ordering of these operations can contribute for the reduction of the switching activity, what leads to the minimization of power consumption in the FFTs. The heuristic-based algorithm named Bellmore and Nemhauser and a new proposed one named Anedma are used to get as near as possible to the optimal solution for the ordering of coefficients in FFTs with larger number of points. As will be shown, the appropriate ordering of coefficients, based on the guidance given by the Anedma heuristic algorithm, can contribute for the reduction of power consumption of the FFT architectures.