Share Email Print

Proceedings Paper

High-resolution radar ranging for multiple targets
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The similarity between the multiple-target radar ranging problem and the multi-user detection problem in CDMA is drawn: in CDMA, users' bits modulate distinct but correlated signature signals; while, in radar, the bits are range-bin occupancies and the signatures correspond to the known transmitted signal translated to be centered on the appropriate range bin. The analogy is useful: there has been a great deal of recent experience in CDMA, and one of the best and fastest algorithms uses a variant of probabilistic data association (PDA, the target-tracking philosophy). PDA can be augmented by group decision feedback (GDF) -- another idea from CDMA -- to refine the target delay estimates; and finally minimum description length (MDL) is applied to estimate the number of targets. Simulation examples are given to illustrate the resolution of closely spaced targets within what would normally be thought the same range bin. Its performance is also compared with the Cramer-Rao lower bound (CRLB) and the alternating projection (AP) algorithm.

Paper Details

Date Published: 7 August 2002
PDF: 12 pages
Proc. SPIE 4728, Signal and Data Processing of Small Targets 2002, (7 August 2002); doi: 10.1117/12.478497
Show Author Affiliations
Zhen Wang, Univ. of Connecticut (United States)
Peter K. Willett, Univ. of Connecticut (United States)
Yaakov Bar-Shalom, Univ. of Connecticut (United States)
W. Dale Blair, Georgia Tech Research Institute (United States)

Published in SPIE Proceedings Vol. 4728:
Signal and Data Processing of Small Targets 2002
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top