A Dynamic Range Ambiguity Resolution Algorithm for Radar Seeker Based on Vote Accumulation
Most of current PD radar seekers adopt multiple PRF technique and one-dimension set algorithm (OSA) to address range ambiguity. The OSA can solve the range ambiguity effectively with high robustness. However, it needs to sort all the possible ranges which are time-cost, especially for higher ambigui...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | ZH |
| Publicado: |
Editorial Office of Aero Weaponry
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/2fc1b172eb414658a9c28603101b1294 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Most of current PD radar seekers adopt multiple PRF technique and one-dimension set algorithm (OSA) to address range ambiguity. The OSA can solve the range ambiguity effectively with high robustness. However, it needs to sort all the possible ranges which are time-cost, especially for higher ambiguity and higher number of pulse repetition frequency. In the present work, a dynamic range ambiguity resolution algorithm based on vote accumulation (DRAVA) is proposed, which avoids the process of sorting and solves the range ambiguity only at the positions where local-peaks are located. The experiments show that the proposed method can improve the range ambiguity quickly and efficiently, which is especially suit for engineering application. |
|---|