Envelope-Tracking Adaptive Integral Method for Band-Pass Transient Scattering Analysis

An envelope-tracking (ET) algorithm is presented for efficiently solving integral equations pertinent to the analysis of transient scattering from perfect electrically conducting surfaces. The algorithm solves space-time samples of the complex envelope of the surface current density by implicit time...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on antennas and propagation Jg. 63; H. 5; S. 2215 - 2227
Hauptverfasser: Kaur, Guneet, Yilmaz, Ali E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.05.2015
Schlagworte:
Computational efficiency
envelope simulation
Equations
Impedance
Integral equations
range profile
Time-domain analysis
Time-frequency analysis
transient analysis
integral equations
transient analysis
range profile
Envelope simulation
ISSN:0018-926X, 1558-2221
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An envelope-tracking (ET) algorithm is presented for efficiently solving integral equations pertinent to the analysis of transient scattering from perfect electrically conducting surfaces. The algorithm solves space-time samples of the complex envelope of the surface current density by implicit time marching; thus, the time-step size is inversely proportional to the bandwidth- not the maximum frequency content-of the fields of interest. At each time step, anterpolation, propagation, interpolation, and near-zone correction stages are performed to compute the right-hand side of a matrix equation, which involves 4-D space-time FFTs, and to accelerate its iterative solution, which involves 3-D space FFTs. These FFTs dominate the computational costs of the method: they require O(N C [log 2 N g + N̅ I log N C ]) operations per time step; here, NC is the number of nodes on an auxiliary regular grid, N g is determined by the number of time steps that fields take to travel the maximum distance between two points on the scattering surface, and N̅ I is the average number of iterations needed for the iterative solution to converge at each time step. Moreover, the algorithm is systematically compared to its time- and frequency-domain counterparts. To this end, radar profiles of benchmark targets are computed, a time-domain dB-error norm is proposed, the algorithms' parameters are optimized subject to at most 2% error in the radar profile according to this norm, and the computational costs are measured, as target size, shape, and excitation pulse are varied. The results show that the algorithm outperforms its time-domain counterpart and is competitive with its frequency-domain counterpart.
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2015.2407905