• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Space-Time Adaptive Processing with Multi-Staged Wiener Filter and Principal Component Signal Dependent Algorithms

Zhou, Zheng N 01 April 2010 (has links) (PDF)
Space-time Adaptive Processing (STAP) is a two-dimensional filtering technique for antenna array with multiple spatial channels. The name "space-time" describes the coupling of these spatial channels with pulse-Doppler waveforms. Applications for STAP includes ground moving target indicator (GMTI) for airborne radar systems. Today, there are strong interests to develop STAP algorithms for operations in “sample starved” environments, where intense environmental interference can reduce STAP capacity to detect and track ground targets. Careful applications of STAP can effectively overcome these conditions by suppressing these interferences and maximize the signal to interference plus noise ratio (SINR). The Multi-stage Wiener filter (MWF) and principal component signal dependent (PC-SD) algorithm are two such methods that can suppress these interference through truncation of the signal subspace. This thesis makes contribution in several ways. First it details the importance of rank compression and sample compression for effective STAP operations in “sample starved” environments. Second, it shows how MWF and PC-SD could operate in this type of environment. Third it details how a “soft stop” technique like diagonal loading (DL) could improve STAP performance in target detection for MWF and PC-SD. Fourth, this thesis contrasts the performance of several existing “hard stop” techniques in rank compression and introduces a new one using a-priori knowledge.

Page generated in 0.0126 seconds