FFT Algorithm and Nonharmonic Fourier Series = FFT 방법과 비조합 퓨리에 급수

다국어 초록 (Multilingual Abstract)

In the spectral analysis, Fourier coefficients is very important to give an information for the original signal f on the finite domain, since it recovers f (see [12]). Also Fourier analysis has extension to wavelet analysis for the whole space R (See [1], [2], [3], [4], [5], [7], [11]). Various kinds of reconstruction theorems are main subject to analyze signal functions in L^2(R) (See [6],[9], [10], [13], [14], [15], [16]). By recovering f properly, there are many applicationsin Digital Signal Processing and Image Processing. We have already demonsruction theorem in L^1(R^n) using the Fourier coefficient which is called a Modified Fourier Series expansion(nonharmonic Fourier series expansion) in the Rhee＇s previous paper(see[18]).
In this paper, we present computationally efficient procedures as an application of FFT algorithm for practical importance in calculating the nonharmonic Fourier coefficients. Also we introduce new synthesis and analysis equations like the discrete Fourier transform(DFT) pair.

목차 (Table of Contents)

• Ⅰ. Introduction
• Ⅱ. Main Theorem
• Ⅲ. Application
• Ⅳ. References
• <Abstract>