Five-step FFT algorithm with reduced computational complexity.
Rami A. AL-Na'mnehW. David PanPublished in: Inf. Process. Lett. (2007)
Keyphrases
- computational complexity
- learning algorithm
- computational cost
- np hard
- objective function
- optimization algorithm
- experimental evaluation
- worst case
- computational load
- optimal solution
- computationally efficient
- fast fourier transform
- times faster
- computational efficiency
- matching algorithm
- detection algorithm
- theoretical analysis
- neural network
- preprocessing
- significant improvement
- high computational complexity
- np complete
- search algorithm
- segmentation algorithm
- cost function
- tree structure
- multi step
- feature extraction
- improved algorithm
- special case
- search space
- scheduling problem
- dynamic programming
- k means
- signal processing
- high accuracy