An Algorithm for Computing 4^M-Point DFT Based on 4-Point DFT Block.
Haijun LiHongbo ZouPeirong JiXuejun ZhouPublished in: ICYCS (2008)
Keyphrases
- preprocessing
- discrete fourier transform
- high accuracy
- experimental evaluation
- clustering method
- computationally efficient
- times faster
- improved algorithm
- fixed size
- tree structure
- worst case
- dynamic programming
- k means
- computational complexity
- optimal solution
- fourier transform
- linear programming
- image processing
- frequency domain
- sample points
- learning algorithm
- matching algorithm
- extreme points
- theoretical analysis
- input data
- simulated annealing
- probabilistic model
- cost function
- significant improvement
- objective function
- feature extraction