160 research outputs found

    Range recursive space-time adaptive processing (STAP) for MIMO airborne RADAR

    No full text
    International audienceThis paper presents a range recursive algorithm for the space time adaptive processing (STAP) of multi input multi output (MIMO) airborne radar signals involved in clutter rejection for the detection of slowly moving ground targets. The MIMO aspect comes from the fact that the transmitter consists of an array of spaced elements sending non coher-ent waveforms and that the receiver is a conventional array used for spatial clutter rejection. The transposition of the STAP algorithms from the single input multi output (SIMO) systems to the MIMO ones has been claimed to theoretically improve performance in clutter resolution and rejection. However, even if this transposition is conceptually easy, in practice, the convergence and the complexity of the MIMO-STAP algorithms are higher than for SIMO models. After reconsidering the advantages and drawbacks of the ex-tended MIMO-STAP, namely the the sample matrix inversion (SMI) and eigencanceller (EC), algorithms, we propose the fast approximated power iteration (FAPI) range recursive algorithm as an alternative to resolve the convergence and complexity problem

    Low-rank filter and detector for multidimensional data based on an alternative unfolding HOSVD: application to polarimetric STAP

    Get PDF
    International audienceThis paper proposes an extension of the classical Higher Order Singular Value Decomposition (HOSVD), namely the Alternative Unfolding HOSVD (AU-HOSVD), in order to exploit the correlated information in multidimensional data. We show that the properties of the AU-HOSVD are proven to be the same as those for HOSVD: the orthogonality and the low-rank (LR) decomposition. We next derive LR-filters and LR-detectors based on AU-HOSVD for multidimensional data composed of one LR structure contribution. Finally, we apply our new LR-filters and LR-detectors in Polarimetric Space Time Adaptive Processing (STAP). In STAP, it is well known that the response of the background is correlated in time and space and has a LR structure in space-time. Therefore, our approach based on AU-HOSVD seems to be appropriate when a dimension (like polarimetry in this paper) is added. Simulations based on Signal to Interference plus Noise Ratio (SINR) losses, Probability of Detection (Pd) and Probability of False Alarm (Pfa) show the interest of our approach: LR-filters and LR-detectors which can be obtained only from AU-HOSVD outperform the vectorial approach and those obtained from a single HOSVD

    Space-time reduced rank methods and CFAR signal detection algorithms with applications to HPRF radar

    Get PDF
    In radar applications, the statistical properties (covariance matrix) of the interference are typically unknown a priori and are estimated from a dataset with limited sample support. Often, the limited sample support leads to numerically ill-conditioned radar detectors. Under such circumstances, classical interference cancellation methods such as sample matrix inversion (SMI) do not perform satisfactorily. In these cases, innovative reduced-rank space-time adaptive processing (STAP) techniques outperform full-rank techniques. The high pulse repetition frequency (HPRF) radar problem is analyzed and it is shown that it is in the class of adaptive radar with limited sample support. Reduced-rank methods are studied for the HPRF radar problem. In particular, the method known as diagonally loaded covariance matrix SMI (L-SMI) is closely investigated. Diagonal loading improves the numerical conditioning of the estimated covariance matrix, and hence, is well suited to be applied in a limited sample support environment. The performance of L-SMI is obtained through a theoretical distribution of the output conditioned signal-to-noise ratio of the space-time array. Reduced-rank techniques are extended to constant false alarm rate (CFAR) detectors based on the generalized likelihood ratio test (GLRT). Two new modified CFAR GLRT detectors are considered and analyzed. The first is a subspace-based GLRT detector where subspace-based transformations are applied to the data prior to detection. A subspace transformation adds statistical stability which tends to improve performance at the expense of an additional SNR loss. The second detector is a modified GLRT detector that incorporates a diagonally loaded covariance matrix. Both detectors show improved performance over the traditional GLRT

    Space/time/frequency methods in adaptive radar

    Get PDF
    Radar systems may be processed with various space, time and frequency techniques. Advanced radar systems are required to detect targets in the presence of jamming and clutter. This work studies the application of two types of radar systems. It is well known that targets moving along-track within a Synthetic Aperture Radar field of view are imaged as defocused objects. The SAR stripmap mode is tuned to stationary ground targets and the mismatch between the SAR processing parameters and the target motion parameters causes the energy to spill over to adjacent image pixels, thus hindering target feature extraction and reducing the probability of detection. The problem can be remedied by generating the image using a filter matched to the actual target motion parameters, effectively focusing the SAR image on the target. For a fixed rate of motion the target velocity can be estimated from the slope of the Doppler frequency characteristic. The problem is similar to the classical problem of estimating the instantaneous frequency of a linear FM signal (chirp). The Wigner-Ville distribution, the Gabor expansion, the Short-Time Fourier transform and the Continuous Wavelet Transform are compared with respect to their performance in noisy SAR data to estimate the instantaneous Doppler frequency of range compressed SAR data. It is shown that these methods exhibit sharp signal-to-noise threshold effects. The space-time radar problem is well suited to the application of techniques that take advantage of the low-rank property of the space-time covariance matrix. It is shown that reduced-rank methods outperform full-rank space-time adaptive processing when the space-time covariance matrix is estimated from a dataset with limited support. The utility of reduced-rank methods is demonstrated by theoretical analysis, simulations and analysis of real data. It is shown that reduced-rank processing has two effects on the performance: increased statistical stability which tends to improve performance, and introduction of a bias which lowers the signal-to-noise ratio. A method for evaluating the theoretical conditioned SNR for fixed reduced-rank transforms is also presented

    A Modified Fast Approximated Power Iteration Subspace Tracking Method for Space-Time Adaptive Processing

    Get PDF
    We propose a subspace-tracking-based space-time adaptive processing technique for airborne radar applications. By applying a modified approximated power iteration subspace tracing algorithm, the principal subspace in which the clutter-plus-interference reside is estimated. Therefore, the moving targets are detected by projecting the data on the minor subspace which is orthogonal to the principal subspace. The proposed approach overcomes the shortcomings of the existing methods and has satisfactory performance. Simulation results confirm that the performance improvement is achieved at very small secondary sample support, a feature that is particularly attractive for applications in heterogeneous environments
    • …
    corecore