2002
DOI: 10.1002/mop.10417
|View full text |Cite
|
Sign up to set email alerts
|

Applications of hybrid discrete Fourier transform moment method to the fast analysis of large rectangular dipole arrays printed on a thin grounded dielectric substrate

Abstract: Recently a discrete Fourier transform–method of moments (DFT‐MoM) scheme was developed for fast analysis of electrically large rectangular planar dipole arrays, which has been shown to be very efficient in terms of number reduction of unknown variables and computational complexity. The applications of this DFT‐MoM to treat dipole arrays printed on a grounded dielectric substrate are examined in this Letter. Numerical results are presented to validate its efficiency and accuracy. © 2002 Wiley Periodicals, Inc. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
8
0

Year Published

2003
2003
2008
2008

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…In recent years, several efficient approaches have been proposed to accelerate MoM solutions and to reduce the memory storage requirements. Some of the MoM-based works are the infinite array solution [2], the element-by-element solution with infinite array assumption and window function to include the effects of array truncation [3,4], the hybrid uniform theory of diffraction (UTD)-MoM approach that reduces the number of unknowns significantly [5,6], the MoM solution based on DFT representation of currents to reduce the number of unknowns [7,8], and the forward-backward (FB) approach to reduce iterations [9]. The FB method is an iterative algorithm, which accelerates the MoM computation by decomposing the current vector and the impedance matrix into forward and backward field contributions.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In recent years, several efficient approaches have been proposed to accelerate MoM solutions and to reduce the memory storage requirements. Some of the MoM-based works are the infinite array solution [2], the element-by-element solution with infinite array assumption and window function to include the effects of array truncation [3,4], the hybrid uniform theory of diffraction (UTD)-MoM approach that reduces the number of unknowns significantly [5,6], the MoM solution based on DFT representation of currents to reduce the number of unknowns [7,8], and the forward-backward (FB) approach to reduce iterations [9]. The FB method is an iterative algorithm, which accelerates the MoM computation by decomposing the current vector and the impedance matrix into forward and backward field contributions.…”
Section: Introductionmentioning
confidence: 99%
“…It is observed that the DFT spectrum of practical array currents are very compact, that is, most of the DFT expansion coefficients are either zero or close to zero. Hence, instead of taking currents as unknowns in MoM formulation, DFT coefficients of currents are taken as unknowns [7,8]. It has been shown that few DFT terms are sufficient to obtain accurate results.…”
mentioning
confidence: 99%
“…1(a) and [11,13,15]), whereas it is piecewise sinusoidal (PWS) for the printed dipole arrays (see Fig. 1(b) and [12,14,15]). It should be mentioned at this point that using more than one basis function per dipole does not change the formulation but improves the accuracy.…”
mentioning
confidence: 96%
“…In recent years, several MoM-based methods have been proposed to improve the operational count and memory-storage requirements of the conventional MoM [2][3][4][5][6][7][8][9][10][11][12][13][14][15]. Making use of stationary or nonstationary iterative schemes in the MoM solution reduces the operational count from O(N tot 3 ) (of order N tot 3 ) to O(N tot 2 ), where N tot is the total number of unknowns.…”
Section: Introductionmentioning
confidence: 99%
“…The fast multipole method (FMM) [4] with an operational count O(N tot 1.5 ) and its subsequent extensions such as multilevel FMM (MLFMM) [5] (O(N tot log N tot )), as well as conjugate gradient-fast Fourier transform (CG-FFT) with O(N tot log N tot ) [6] are some successful efforts. Besides, infinite array approximation [7], and hybrid approaches to reduce the total number of unknowns such as a hybrid combination of MoM with either uniform geometrical theory of diffraction (UTD) [8 -10] or discrete Fourier transform (DFT) [11,12] are useful techniques that are available in the literature.…”
Section: Introductionmentioning
confidence: 99%