An O(N-3) Algorithm for the Calculation of Far Field Radiation Patterns

作者：Garrett Travis^*

来源：IEEE Transactions on Antennas and Propagation, 2015, 63(1): 322-327.

DOI：10.1109/TAP.2014.2368577

• Algorithms
• far fields
• finite difference methods

We present a new method for computing the near-to-far-field (NTFF) transformation in finite-difference time-domain simulations which has an overall scaling of O(N-3) instead of the standard O(N-4). By mapping the far field with a cartesian coordinate system, the 2-D surface integral can be split into two successive 1-D integrals. For a near field spanned by N-X x N-Y discrete sample points, and a far field spanned by N-theta x N-phi points, the NTFF calculation can then be performed in O(N theta NXNy) + O(N theta N phi NY) operations instead of O(N theta N phi NXNY).

• 出版日期2015-1