An O(N3) Algorithm for the Calculation of Far Field Radiation Patterns

被引：1
|
作者：
Garrett, Travis [1 ]
机构：
[1] Stellar Sci, Albuquerque, NM 87110 USA
来源：
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION | 2015年 / 63卷 / 01期
关键词：
Algorithms; far fields; finite difference methods; DIFFERENCE TIME-DOMAIN; LIGHT-SCATTERING; FDTD; TRANSFORMATION; OBJECTS; PARTICLES; MEDIA; CELLS;
D O I：
10.1109/TAP.2014.2368577
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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).
引用
收藏
页码：322 / 327
页数：6
相关论文
共 50 条
  • [1] O(n3) recognition algorithm for bithreshold graphs
    De, Agostino, S.
    Petreschi, R.
    Sterbini, A.
    Algorithmica (New York), 1997, 17 (04):
  • [2] An O(n3/2 √log(n)) algorithm for sorting by reciprocal translocations
    Ozery-Flato, Michal
    Shamir, Ron
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 258 - 269
  • [3] O(n3/14)-coloring algorithm for 3-colorable graphs
    Carnegie Mellon Univ, Pittsburgh, United States
    Inf Process Lett, 1 (49-53):
  • [4] Bypassing KLS: Gaussian Cooling and an O*(n3) Volume Algorithm
    Cousins, Ben
    Vempala, Santosh
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 539 - 548
  • [5] O(N3 log N) backprojection algorithm for the 3-D radon transform
    Basu, S
    Bresler, Y
    IEEE TRANSACTIONS ON MEDICAL IMAGING, 2002, 21 (02) : 76 - 88
  • [6] Modified SIMPSON O(n3) algorithm for the full sibship reconstruction problem
    Konovalov, DA
    Bajema, N
    Litow, B
    BIOINFORMATICS, 2005, 21 (20) : 3912 - 3917
  • [7] Reducing Isotropy and Volume to KLS: An O*(n3ψ2) Volume Algorithm
    Jia, He
    Laddha, Aditi
    Lee, Yin Tat
    Vempala, Santosh
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 961 - 974
  • [8] An O(n3)-Time recognition algorithm for hhds-free graphs
    Eschen, Elaine M.
    Hoang, Chinh T.
    Sritharan, R.
    GRAPHS AND COMBINATORICS, 2007, 23 (Suppl 1) : 209 - 231
  • [9] AN O(N3) ALGORITHM FOR FINDING THE MINIMAL OPAQUE FOREST OF A CONVEX POLYGON
    DUBLISH, P
    INFORMATION PROCESSING LETTERS, 1988, 29 (05) : 275 - 276
  • [10] An O(n3)-Time Recognition Algorithm for hhds-free Graphs
    Elaine M. Eschen
    Chính T. Hoàng
    R. Sritharan
    Graphs and Combinatorics, 2007, 23 : 209 - 231
12345