A fast algorithm for wave propagation from a plane or a cylindrical surface

摘要

The newly developed Taylor-Interpolation-FFT (TI-FFT) algorithm dramatically increases the computational speeds for millimeter wave propagation from a planar ( cylindrical) surface onto a "quasi- planar" ("quasi-cylindrical") surface. Two different scenarios are considered in this article: the planar TI-FFT is for the computation of the wave propagation from a plane onto a "quasi- planar" surface and the cylindrical TI-FFT is for the computation of wave propagation from a cylindrical surface onto a "quasi- cylindrical" surface. Due to the use of the FFT, the TI-FFT algorithm has a computational complexity of O( N-2 log(2) N-2) for an N x N computational grid, instead of N-4 for the direct integration method. The TI-FFT algorithm has a low sampling rate according to the Nyquist sampling theorem. The algorithm has accuracy down to -80 dB and it works particularly well for narrowband fields and "quasi- planar" ("quasi- cylindrical") surfaces.