Skip to search formSkip to main contentSkip to account menu

Split-radix FFT algorithm

Known as: Split-radix, Split radix, Split radix FFT 
The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
: In this study, an FPGA implementation of a programmable length Fast Fourier Transform (FFT) is presented. The proposed… 
2016
2016
Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less… 
2014
2014
This paper presents a generalized odd factor modified split-radix-2/4 Fast Fourier transform (FFT) algorithm for computing the… 
2012
2012
In this paper a comparative study on DWTOFDM and FFT-OFDM systems is presented. The DWTOFDM has to satisfy the orthonormal basis… 
2011
2011
A discrete-time (DT) fast Fourier transform (FFT) processor is presented as an architectural approach to Fourier transform… 
2009
2009
Solanum villosum is an important leafy vegetable in Kenya whose production faces low yields. Two potentially high leaf-yielding… 
2002
2002
A general framework to develop efficient single instruction multiple data (SIMD) compliant algorithms was previously proposed. In… 
1992
1992
A fast discrete Fourier transform (DFT) computing algorithm used in situations where part of the data is zero and only the first… 
1989
1989
The complete equations are presented for the first stage of the two-dimensional vector split-radix decimation-in-frequency fast… 
1974
1974
Grass tetany, a Mg deficiency in ruminants, is responsible for large economic losses throughout temperate regions. Significant…