A novel approach to robust radar detection of range-spread targets

This paper proposes a novel approach to robust radar detection of range-spread targets embedded in Gaussian noise with unknown covariance matrix. The idea is to model the useful target echo in each range cell as the sum of a coherent signal plus a random component that makes the signal-plus-noise hypothesis more plausible in presence of mismatches. Moreover, an unknown power of the random components, to be estimated from the observables, is inserted to optimize the performance when the mismatch is absent. The generalized likelihood ratio test (GLRT) for the problem at hand is considered. In addition, a new parametric detector that encompasses the GLRT as a special case is also introduced and assessed. The performance assessment shows the effectiveness of the idea also in comparison to natural competitors.Comment: 28 pages, 8 figure

Unit Circle Roots Based Sensor Array Signal Processing

As technology continues to rapidly evolve, the presence of sensor arrays and the algorithms processing the data they generate take an ever-increasing role in modern human life. From remote sensing to wireless communications, the importance of sensor signal processing cannot be understated. Capon\u27s pioneering work on minimum variance distortionless response (MVDR) beamforming forms the basis of many modern sensor array signal processing (SASP) algorithms. In 2004, Steinhardt and Guerci proved that the roots of the polynomial corresponding to the optimal MVDR beamformer must lie on the unit circle, but this result was limited to only the MVDR. This dissertation contains a new proof of the unit circle roots property which generalizes to other SASP algorithms. Motivated by this result, a unit circle roots constrained (UCRC) framework for SASP is established and includes MVDR as well as single-input single-output (SISO) and distributed multiple-input multiple-output (MIMO) radar moving target detection. Through extensive simulation examples, it will be shown that the UCRC-based SASP algorithms achieve higher output gains and detection probabilities than their non-UCRC counterparts. Additional robustness to signal contamination and limited secondary data will be shown for the UCRC-based beamforming and target detection applications, respectively

Auto-regressive model based polarimetric adaptive detection scheme part I: Theoretical derivation and performance analysis

This paper deals with the problem of target detection in coherent radar systems exploiting polarimetric diversity. We resort to a parametric approach and we model the disturbance affecting the data as a multi-channel autoregressive (AR) process. Following this model, a new polarimetric adaptive detector is derived, which aims at improving the target detection capability while relaxing the requirements on the training data size and the computational burden with respect to existing solutions. A complete theoretical characterization of the asymptotic performance of the derived detector is provided, using two different target fluctuation models. The effectiveness of the proposed approach is shown against simulated data, in comparison with alternative existing solutions

Theoretical Performance of Low Rank Adaptive Filters in the Large Dimensional Regime

International audienceThis paper proposes a new approximation of the theoretical Signal to Interference plus Noise Ratio (SINR) loss of the Low-Rank (LR) adaptive filter built on the eigenvalue decomposition of the sample covariance matrix. This new result is based on an analysis in the large dimensional regime, i.e. when the size and the number of data tend to infinity at the same rate. Compared to previous works, this new derivation allows to measure the quality of the adaptive filter near the LR contribution. Moreover, we propose a new LR adaptive filter and we also derive its SINR loss approximation in a large dimensional regime. We validate these results on a jamming application and test their robustness in a Multiple Input Multiple Output Space Time Adaptive Processing (MIMO-STAP) application where the data size is larg

Design of Robust Radar Detectors Through Random Perturbation of the Target Signature

The paper addresses the problem of designing radar detectors more robust than Kelly's detector to possible mismatches of the assumed target signature, but with no performance degradation under matched conditions. The idea is to model the received signal under the signal-plus-noise hypothesis by adding a random component, parameterized via a design covariance matrix, that makes the hypothesis more plausible in presence of mismatches. Moreover, an unknown power of such component, to be estimated from the observables, can lead to no performance loss, under matched conditions. Derivation of the (one-step) GLRT is provided for two choices of the design matrix, obtaining detectors with different complexity and behavior. A third parametric detector is also obtained by an ad-hoc generalization of one of such GLRTs. The analysis shows that the proposed approach can cover a range of different robustness levels that is not achievable by state-of-the-art with the same performance of Kelly's detector under matched conditions

Sparse nonlinear optimization for signal processing and communications

This dissertation proposes three classes of new sparse nonlinear optimization algorithms for network echo cancellation (NEC), 3-D synthetic aperture radar (SAR) image reconstruction, and adaptive turbo equalization in multiple-input multiple-output (MIMO) underwater acoustic (UWA) communications, respectively. For NEC, the proposed two proportionate affine projection sign algorithms (APSAs) utilize the sparse nature of the network impulse response (NIR). Benefiting from the characteristics of l₁-norm optimization, affine projection, and proportionate matrix, the new algorithms are more robust to impulsive interferences and colored input than the conventional adaptive algorithms. For 3-D SAR image reconstruction, the proposed two compressed sensing (CS) approaches exploit the sparse nature of the SAR holographic image. Combining CS with the range migration algorithms (RMAs), these approaches can decrease the load of data acquisition while recovering satisfactory 3-D SAR image through l₁-norm optimization. For MIMO UWA communications, a robust iterative channel estimation based minimum mean-square-error (MMSE) turbo equalizer is proposed for large MIMO detection. The MIMO channel estimation is performed jointly with the MMSE equalizer and the maximum a posteriori probability (MAP) decoder. The proposed MIMO detection scheme has been tested by experimental data and proved to be robust against tough MIMO channels. --Abstract, page iv

Advanced RFI detection, RFI excision, and spectrum sensing : algorithms and performance analyses

Because of intentional and unintentional man-made interference, radio frequency interference (RFI) is causing performance loss in various radio frequency operating systems such as microwave radiometry, radio astronomy, satellite communications, ultra-wideband communications, radar, and cognitive radio. To overcome the impact of RFI, a robust RFI detection coupled with an efficient RFI excision are, thus, needed. Amongst their limitations, the existing techniques tend to be computationally complex and render inefficient RFI excision. On the other hand, the state-of-the-art on cognitive radio (CR) encompasses numerous spectrum sensing techniques. However, most of the existing techniques either rely on the availability of the channel state information (CSI) or the primary signal characteristics. Motivated by the highlighted limitations, this Ph.D. dissertation presents research investigations and results grouped into three themes: advanced RFI detection, advanced RFI excision, and advanced spectrum sensing. Regarding advanced RFI detection, this dissertation presents five RFI detectors: a power detector (PD), an energy detector (ED), an eigenvalue detector (EvD), a matrix-based detector, and a tensor-based detector. First, a computationally simple PD is investigated to detect a brodband RFI. By assuming Nakagami-m fading channels, exact closed-form expressions for the probabilities of RFI detection and of false alarm are derived and validated via simulations. Simulations also demonstrate that PD outperforms kurtosis detector (KD). Second, an ED is investigated for RFI detection in wireless communication systems. Its average probability of RFI detection is studied and approximated, and asymptotic closed-form expressions are derived. Besides, an exact closed-form expression for its average probability of false alarm is derived. Monte-Carlo simulations validate the derived analytical expressions and corroborate that the investigated ED outperforms KD and a generalized likelihood ratio test (GLRT) detector. The performance of ED is also assessed using real-world RFI contaminated data. Third, a blind EvD is proposed for single-input multiple-output (SIMO) systems that may suffer from RFI. To characterize the performance of EvD, performance closed-form expressions valid for infinitely huge samples are derived and validated through simulations. Simulations also corroborate that EvD manifests, even under sample starved settings, a comparable detection performance with a GLRT detector fed with the knowledge of the signal of interest (SOI) channel and a matched subspace detector fed with the SOI and RFI channels. At last, for a robust detection of RFI received through a multi-path fading channel, this dissertation presents matrix-based and tensor-based multi-antenna RFI detectors while introducing a tensor-based hypothesis testing framework. To characterize the performance of these detectors, performance analyses have been pursued. Simulations assess the performance of the proposed detectors and validate the derived asymptotic characterizations. Concerning advanced RFI excision, this dissertation introduces a multi-linear algebra framework to the multi-interferer RFI (MI-RFI) excision research by proposing a multi-linear subspace estimation and projection (MLSEP) algorithm for SIMO systems. Having employed smoothed observation windows, a smoothed MLSEP (s-MLSEP) algorithm is also proposed. MLSEP and s-MLSEP require the knowledge of the number of interferers and their respective channel order. Accordingly, a novel smoothed matrix-based joint number of interferers and channel order enumerator is proposed. Performance analyses corroborate that both MLSEP and s-MLSEP can excise all interferers when the perturbations get infinitesimally small. For such perturbations, the analyses also attest that s-MLSEP exhibits a faster convergence to a zero excision error than MLSEP which, in turn, converges faster than a subspace projection algorithm. Despite its slight complexity, simulations and performance assessment on real-world data demonstrate that MLSEP outperforms projection-based RFI excision algorithms. Simulations also corroborate that s-MLSEP outperforms MLSEP as the smoothing factor gets smaller. With regard to advanced spectrum sensing, having been inspired by an F–test detector with a simple analytical false alarm threshold expression considered an alternative to the existing blind detectors, this dissertation presents and evaluates simple F–test based spectrum sensing techniques that do not require the knowledge of CSI for multi-antenna CRs. Exact and asymptotic analytical performance closed-form expressions are derived for the presented detectors. Simulations assess the performance of the presented detectors and validate the derived expressions. For an additive noise exhibiting the same variance across multiple-antenna frontends, simulations also corroborate that the presented detectors are constant false alarm rate detectors which are also robust against noise uncertainty