By Topic

Monte Carlo simulations of wave scattering from lossy dielectric random rough surfaces using the physics-based two-grid method and the canonical-grid method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qin Li ; Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA ; Chi Hou Chan ; Leung Tsang

In using the method of moments to solve scattering by lossy dielectric surfaces, usually a single dense grid (SDG) with 30 points per wavelength is required for accurate results. A single coarse grid (SCG) of ten points per wavelength does not give accurate results. However, the central processing unit (CPU) and memory requirements of SDG are much larger than that of SCG. In a physics-based two-grid method (PBTG) two grids are used: a dense grid and a coarse grid. The method is based on the two observations: (1) Green's function of the lossy dielectric is attenuative and (2) the free-space Green's function is slowly varying on the dense grid. In this paper, the PBTG method is combined with the banded-matrix iterative approach/canonical grid method to solve rough surface scattering problem for both TE and TM cases and also for near grazing incidence. We studied cases of dielectric permittivities as high as (25+i)ε0 and incidence angle up to 85°. Salient features of the numerical results are: (1) an SCG has poorer accuracy for TM case than TE case; (2) PBTG-banded-matrix iterative approach/canonical grid BMIA/CAG method speeds up CPU and preserves the accuracy; it has an accuracy comparable to single dense grid and yet has CPU comparable to single coarse grid; (3) PBTG-BMIA/CAG gives accurate results for emissivity calculations and also for low grazing backscattering problems (LGBA); and (4) the computational complexity and the memory requirements of the present algorithm are O(N log(N)) and O(N), respectively, where N is the number of surface unknowns on the coarse grid

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:47 ,  Issue: 4 )