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

Extension of forward‐backward method with a DFT‐based acceleration algorithm for efficient analysis of radiation/scattering from large finite‐printed dipole arrays

Abstract: In this paper, the use of reflecting microstrip arrays as stable target points, called PS as described above, is investigated for SAR interferometry applications. The reflecting surface of a reflectarray can be designed to scatter most of the incident radiation back in the direction of incidence. This goal is achieved by imposing a phase distribution (n) of the kind [5]:where n is the element position, d gives the spacing between elements, is the wavelength, and i the angle of incidence (Fig. 1). The phase co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
1

Year Published

2003
2003
2006
2006

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(16 citation statements)
references
References 14 publications
0
15
1
Order By: Relevance
“…The use of FBM in conjunction with this DFT-based acceleration algorithm shows some significant convergence problems in the analysis of printed dipole phased arrays when either the thickness of the substrate or the relative dielectric constant of the substrate (⑀ r Ͼ 1) (or both) are high [8,9]. However, such problems have not been observed in [10] nor in this study.…”
Section: Introductioncontrasting
confidence: 56%
See 2 more Smart Citations
“…The use of FBM in conjunction with this DFT-based acceleration algorithm shows some significant convergence problems in the analysis of printed dipole phased arrays when either the thickness of the substrate or the relative dielectric constant of the substrate (⑀ r Ͼ 1) (or both) are high [8,9]. However, such problems have not been observed in [10] nor in this study.…”
Section: Introductioncontrasting
confidence: 56%
“…Therefore, in this example Q ϭ 21, although the strong region has still the same size (3 ϫ 3). Nevertheless, this is a case where FBM accelerated with a DFT-based algorithm has convergence problems, which are probably due to the nature of FBM, as claimed in [9].…”
Section: Numerical Resultsmentioning
confidence: 90%
See 1 more Smart Citation
“…The DFT-based acceleration algorithm is actually well-suited for the fast and accurate analysis of rectangular arrays (freestanding and printed) [13][14][15]. Therefore, to implement this algorithm efficiently, the arrays shown in Figure 1 are mathematically extended into a rectangular array with virtual elements as shown in Figure 3.…”
Section: Dft-based Acceleration Algorithmmentioning
confidence: 99%
“…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%