Arithmetic complexity of the split-radix FFT algorithms.
Saad BouguezelM. Omair AhmadM. N. Shanmukha SwamyPublished in: ICASSP (5) (2005)
Keyphrases
- space complexity
- worst case
- computational cost
- computational complexity
- floating point
- learning algorithm
- orders of magnitude
- computationally efficient
- recently developed
- lower complexity
- significant improvement
- theoretical analysis
- benchmark datasets
- fourier transform
- reduced complexity
- memory requirements
- computational efficiency
- high computational complexity
- clustering algorithm
- feature selection