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… (More)
Wikipedia

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… (More)
  • figure 2
  • table I
  • table III
  • table II
Is this relevant?
Highly Cited
2016
Highly Cited
2016
Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
FFT has wide use in communication for processing the data being exchanged. Hence it is important to develop high-performance FFT… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2014
2014
A high performance hardware FFT have various application in instrumentation and communication systems. It describes new parallel… (More)
Is this relevant?
2014
2014
Fast Fourier Transform represents a canonical example of DSP algorithm since it is in some form present in virtually every signal… (More)
  • table I
Is this relevant?
2014
2014
In this paper we have designed a Split-radix type FFT unit without using multipliers. All the complex multiplications required… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2011
2011
The Fast Fourier Transform (FFT) finds a variety of applications particularly in the field of communication engineering. The… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Recent results by Van Buskirk have broken the record set by Yavne in 1968 for the lowest exact count of real additions and… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • table III
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a novel split-radix fast Fourier transform (SRFFT) pipeline architecture design. A mapping methodology has… (More)
  • table I
  • figure 2
  • figure 1
  • figure 3
  • table II
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An extended split-radix fast Fourier transform (FFT) algorithm is proposed. The extended split-radix FFT algorithm has the same… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?