10,319 research outputs found

    Adaptive detection of a signal known only to lie on a line in a known subspace, when primary and secondary data are partially homogeneous

    Get PDF
    This paper deals with the problem of detecting a signal, known only to lie on a line in a subspace, in the presence of unknown noise, using multiple snapshots in the primary data. To account for uncertainties about a signal's signature, we assume that the steering vector belongs to a known linear subspace. Furthermore, we consider the partially homogeneous case, for which the covariance matrix of the primary and the secondary data have the same structure but possibly different levels. This provides an extension to the framework considered by Bose and Steinhardt. The natural invariances of the detection problem are studied, which leads to the derivation of the maximal invariant. Then, a detector is proposed that proceeds in two steps. First, assuming that the noise covariance matrix is known, the generalized-likelihood ratio test (GLRT) is formulated. Then, the noise covariance matrix is replaced by its sample estimate based on the secondary data to yield the final detector. The latter is compared with a similar detector that assumes the steering vector to be known

    Knowledge-Aided STAP Using Low Rank and Geometry Properties

    Full text link
    This paper presents knowledge-aided space-time adaptive processing (KA-STAP) algorithms that exploit the low-rank dominant clutter and the array geometry properties (LRGP) for airborne radar applications. The core idea is to exploit the fact that the clutter subspace is only determined by the space-time steering vectors, {red}{where the Gram-Schmidt orthogonalization approach is employed to compute the clutter subspace. Specifically, for a side-looking uniformly spaced linear array, the} algorithm firstly selects a group of linearly independent space-time steering vectors using LRGP that can represent the clutter subspace. By performing the Gram-Schmidt orthogonalization procedure, the orthogonal bases of the clutter subspace are obtained, followed by two approaches to compute the STAP filter weights. To overcome the performance degradation caused by the non-ideal effects, a KA-STAP algorithm that combines the covariance matrix taper (CMT) is proposed. For practical applications, a reduced-dimension version of the proposed KA-STAP algorithm is also developed. The simulation results illustrate the effectiveness of our proposed algorithms, and show that the proposed algorithms converge rapidly and provide a SINR improvement over existing methods when using a very small number of snapshots.Comment: 16 figures, 12 pages. IEEE Transactions on Aerospace and Electronic Systems, 201

    MIMO radar space–time adaptive processing using prolate spheroidal wave functions

    Get PDF
    In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multiple-output (MIMO) radar system, the transmitter sends noncoherent (possibly orthogonal) broad (possibly omnidirectional) waveforms. These waveforms can be extracted at the receiver by a matched filterbank. The extracted signals can be used to obtain more diversity or to improve the spatial resolution for clutter. This paper focuses on space–time adaptive processing (STAP) for MIMO radar systems which improves the spatial resolution for clutter. With a slight modification, STAP methods developed originally for the single-input multiple-output (SIMO) radar (conventional radar) can also be used in MIMO radar. However, in the MIMO radar, the rank of the jammer-and-clutter subspace becomes very large, especially the jammer subspace. It affects both the complexity and the convergence of the STAP algorithm. In this paper, the clutter space and its rank in the MIMO radar are explored. By using the geometry of the problem rather than data, the clutter subspace can be represented using prolate spheroidal wave functions (PSWF). A new STAP algorithm is also proposed. It computes the clutter space using the PSWF and utilizes the block-diagonal property of the jammer covariance matrix. Because of fully utilizing the geometry and the structure of the covariance matrix, the method has very good SINR performance and low computational complexity

    Multi-Step Knowledge-Aided Iterative ESPRIT for Direction Finding

    Full text link
    In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with comparisons between computational complexities of the proposed and existing algorithms. Simulations focusing on closely-spaced sources, where they are uncorrelated and correlated, illustrate the improvements achieved.Comment: 7 figures. arXiv admin note: text overlap with arXiv:1703.1052
    corecore