Abstract

A new hybrid analytical‐numerical iterative algorithm, which combines the Kirchhoff approximation (KA) and the Method of Moment (MoM), is developed for computing the electromagnetic scattering from a three‐dimensional (3‐D) perfect electric conducting (PEC) target above a 2‐D infinite randomly rough dielectric surface. The equations of difference scattering due to the target presence above the rough surface are derived. The induced difference fields on the rough surface due to the interactions between the target and the rough surface are calculated by using the KA method. The excitation term on the right‐hand‐side (RHS) of target's surface integral equation (SIE), which contains the difference scattering of the rough surface, is then updated for calculating new target currents with the Conjugate Gradient (CG) procedure. Then the target currents are used to compute the difference field induced on the rough surface with the KA method. Multiple iterations take account of the multiorder interactions between the target and the underlying rough surface. Numerical quadrature upon the rough surface is performed only once to compute the coupling scattering field from the rough surface to the target, and it takes N steps (N is the discretized mesh number of rough surface). By using this hybrid KA‐MoM algorithm, the requirements of memory and CPU time can be reduced significantly. Moreover, the validity conditions and the convergence performance of this hybrid algorithm are also discussed. With Monte‐Carlo generations of randomly rough surfaces, bistatic scattering from different‐shaped targets above a Gaussian rough surface is numerically simulated. Finally, dependence of bistatic scattering pattern on the surface dielectric property and the target geometry is discussed.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.