Accurate Numerical Fourier Transform in d-Dimensions
- 394 Downloads
The classical method of numerically computing Fourier transforms of digitized functions in one or in d-dimensions is the so-called Discrete Fourier Transform (DFT) efficiently implemented as Fast Fourier Transform (FFT) algorithms. In many cases, the DFT is not an adequate approximation of the continuous Fourier transform. Because the DFT is periodical, spectrum aliasing may occur. The method presented in this contribution provides accurate approximations of the continuous Fourier transform with similar time complexity. The assumption of signal periodicity is no longer posed and allows to compute numerical Fourier transforms in a broader domain of frequency than the usual half-period of the DFT. The aliasing introduced by periodicity can be reduced to a negligible level even with a relatively low number of sampled data points. In addition, this method yields accurate numerical derivatives of any order and polynomial splines of any odd order with their optimum boundary conditions. The numerical error on results is easily estimated. The method is developed in one and in d-dimensions and numerical examples are presented.
KeywordsFourier Transform Fast Fourier Transform Time Complexity Discrete Fourier Transform Digitize Function
Unable to display preview. Download preview PDF.
- 1.Brigham, E. O. (1974): The Fast Fourier Transform. Prentice-HallGoogle Scholar
- 2.Morrison, N. (1994): Introduction to Fourier Analysis. Wiley-InterscienceGoogle Scholar
- 3.Marchildon, L. (2000): Mécanique Quantique. De Boeck UniversitéGoogle Scholar
- 4.Kittel, C. (1983): Physique de l’ État Solide. Dunod UniversitéGoogle Scholar
- 5.Shapiro, L. G., Stockman G. C. (2001): Computer Vision. Prentice HallGoogle Scholar
- 10.Gaskill, J. D. (1974): Linear Systems, Fourier Transform, and Optics. Prentice-HallGoogle Scholar
- 11.Beaudoin, N. (1999): PhD. Thesis. Université du Québec à Trois-Rivières. CanadaGoogle Scholar
- 12.Butkov, E. (1968): Mathematical Physics. Addison-Wesley ReadingGoogle Scholar
- 13.Kreyszig, E. (1983): Advanced Engineering Mathematics. WileyGoogle Scholar
- 15.Gerald C. F., Wheatley P. O. (1989): Applied Numerical Analysis. Addison-Wesley ReadingGoogle Scholar
- 16.Ventsel H. (1973): Théorie des Probabilités. Editions MirGoogle Scholar