By Topic

Optimal time-domain detection of a deterministic target buried under a randomly rough interface

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)
Dogaru, T. ; Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA ; Collins, L. ; Carin, L.

We consider pulsed plane-wave scattering from targets buried under a rough air-ground interface. The properties of the interface are parametrized as a random process with known statistics, and therefore the fields scattered from a particular surface constitute one realization of an ensemble, characterized by corresponding statistics. Moreover, since the fields incident upon a buried target must first penetrate the rough interface, they and the subsequent scattered fields are random processes as well. Based on this understanding, an optimal detector is formulated, accounting for the clutter and target-signature statistics (the former due to scattering at the rough surface, and the latter due to transmission); the statistics of these two processes are in general different. The detector performance is compared to that of a matched filter, which assumes the target signature is known exactly (i.e., nonrandom). The results presented here, as a function of angle and polarization, demonstrate that there is often a significant gain in detector performance if the target signature is properly treated as a random process

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:49 ,  Issue: 3 )