Abstract
An optimal search strategy by dividing the whole surveillance area into regions is presented, so that the optimal search can be adaptively implemented in phased array radar. Firstly, the inherent relationship among average discovering time, radar resources consumption, search frame period and target distribution density is studied. Secondly, parameters for the region search are optimized to achieve the optimal search performance inside regions. Then, the optimal search frame period for each region is derived to minimize the average discovering time of targets, where the constraint of radar time resource and the importance of each region are taken into account. Finally, the adaptability of this search strategy is discussed. Only if the optimal parameters for each region are utilized and the beams are scheduled according to the optimal frame period under the radar time constraint, the optimal distribution and the optimal scanning sequence of beams can be implemented adaptively. Thus, optimal search is adaptively implemented in the whole surveillance area.
| Original language | English |
|---|---|
| Pages (from-to) | 69-73 |
| Number of pages | 5 |
| Journal | Tien Tzu Hsueh Pao/Acta Electronica Sinica |
| Volume | 28 |
| Issue number | 12 |
| State | Published - Dec 2000 |
Keywords
- Adaptive
- Optimal frame period
- Optimal parameter
- Region search
Fingerprint
Dive into the research topics of 'Optimal region search strategy in phased array radar'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver