원문정보
보안공학연구지원센터(IJSIP)
International Journal of Signal Processing, Image Processing and Pattern Recognition
Vol.9 No.2
2016.02
pp.369-378
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The quantity of digital image is huge. Undoubtedly, it will be a huge project to complete the image processing in a limited time, and it is unrealistic to directly deal with the real-time image signal with the Discrete Fourier Transform (DFT) algorithm. There is no fundamentally change until Cooley and Tukey proposed a Fast Fourier Transform Algorithm (FFT) and it will greatly promote the application of Discrete Fourier Transform in all aspects. The following will show its superiority from the detailed study of the FFT algorithm and accordingly make the further improvement to the algorithm to improve the use efficiency of the FFT algorithm.
목차
Abstract
1. Fast Fourier Transform algorithm
1.1. Basic idea of FFT
1.2. Several Classic Algorithms of FFT
2. Comparison of Several Algorithms
3. Improvement of Algorithms
3.1. The Principle of the Improved Algorithm
3.2 The Remained Provlems in the Algorithm
References
1. Fast Fourier Transform algorithm
1.1. Basic idea of FFT
1.2. Several Classic Algorithms of FFT
2. Comparison of Several Algorithms
3. Improvement of Algorithms
3.1. The Principle of the Improved Algorithm
3.2 The Remained Provlems in the Algorithm
References
저자정보
참고문헌
자료제공 : 네이버학술정보