摘要
Recently we have reported a new method of rational approximation of the sinc function obtained by sampling and the Fourier transforms. However, this method requires a trigonometric multiplier that originates from the shifting property of the Fourier transform. In this work, we show how to represent the Fourier transform of a function <em>f</em>(<em>t</em>) in form of a ratio of two polynomials without any trigonometric multiplier. A MATLAB code showing algorithmic implementation of the proposed method for rational approximation of the Fourier transform is presented.
Recently we have reported a new method of rational approximation of the sinc function obtained by sampling and the Fourier transforms. However, this method requires a trigonometric multiplier that originates from the shifting property of the Fourier transform. In this work, we show how to represent the Fourier transform of a function <em>f</em>(<em>t</em>) in form of a ratio of two polynomials without any trigonometric multiplier. A MATLAB code showing algorithmic implementation of the proposed method for rational approximation of the Fourier transform is presented.
作者
Sanjar M. Abrarov
Rehan Siddiqui
Rajinder K. Jagpal
Brendan M. Quine
Sanjar M. Abrarov;Rehan Siddiqui;Rajinder K. Jagpal;Brendan M. Quine(Thoth Technology Inc., Algonquin Radio Observatory, Pembroke, ON, Canada;Department of Earth and Space Science and Engineering, York University, Toronto, Canada;Epic College of Technology, Mississauga, Canada;Department of Physics and Astronomy, York University, Toronto, Canada)
