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 ² log₂  N ²) for an N × N computational grid, instead of N ⁴ 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 narrow-band fields and “quasi-planar” (“quasi-cylindrical”) surfaces.