Login / Signup
A family of MD FFT algorithms of complexity intermediate between the MD Cooley-Tukey FFT and the MD prime-factor FFT.
Riccardo Bernardini
Guido Maria Cortelazzo
Gian Antonio Mian
Published in:
ISCAS (1993)
Keyphrases
</>
fast fourier transform
fourier transform
frequency domain
spectral analysis
floating point
row column
signal processing
fourier transformation
discrete wavelet transform
discrete cosine transform
fourier domain
data sets
radon transform
spatial domain
high computational complexity
image compression
space complexity
theoretical analysis
computationally efficient
optimization problems
worst case
computational complexity
genetic algorithm