The radio frequency (RF) electromagnetic spectrum is a limited natural resource necessary for an ever-growing number of services and systems. It is used in several applications, such as mobile communications, radio and television broadcasting, as well as remote sensing. Together with oil and water, the RF spectrum now represents one of the most important, significant, crucial, and critical commodities due to the huge impact of radio services on society. Both high-quality/high-rate wireless services (4G and 5G) as well as accurate and reliable remote-sensing capabilities (air traffic control (ATC), Earth geophysical monitoring, defense and security applications) call for increased amounts of bandwidth [1], [2]. Besides, basic electromagnetic considerations, such as good foliage penetration [3], low path loss attenuation, and reduced sizes of the devices push some systems to coexist in the same frequency band [4] (for instance VHF and UHF). As a result, the RF spectrum congestion problem has been attracting the interest of many scientists and engineers during the last few years and is currently becoming one of the hot topics in both regulation and research fields [5], [6].

In this paper, we deal with the problem of estimating the disturbance covariance matrix for radar signal processing applications, when a limited number of training data is present. We determine the maximum likelihood (ML) estimator of the covariance matrix starting from a set of secondary data, assuming a special covariance structure (i.e., the sum of a positive semi-definite matrix plus a term proportional to the identity), and a condition number upper-bound constraint. We show that the formulated constrained optimization problem falls within the class of MAXDET problems and develop an efficient procedure for its solution in closed form. Remarkably, the computational complexity of the algorithm is of the same order as the eigenvalue decomposition of the sample covariance matrix. At the analysis stage, we assess the performance of the proposed algorithm in terms of achievable signal-to-interference-plus-noise ratio (SINR) both for a spatial and a Doppler processing. The results show that interesting SINR improvements, with respect to some existing covariance matrix estimation techniques, can be achieved.

A new class of disturbance covariance matrix estimators for radar signal processing applications is introduced following a geometric paradigm. Each estimator is associated with a given unitary invariant norm and performs the sample covariance matrix projection into a specific set of structured covariance matrices. Regardless of the considered norm, an efficient solution technique to handle the resulting constrained optimization problem is developed. Specifically, it is shown that the new family of distribution-free estimators shares a shrinkage-type form; besides, the eigenvalues estimate just requires the solution of a one-dimensional convex problem whose objective function depends on the considered unitary norm. For the two most common norm instances, i.e., Frobenius and spectral, very efficient algorithms are developed to solve the aforementioned one-dimensional optimization leading to almost closed form covariance estimates. At the analysis stage, the performance of the new estimators is assessed in terms of achievable Signal to Interference plus Noise Ratio (SINR) both for a spatial and a Doppler processing assuming different data statistical characterizations. The results show that interesting SINR improvements with respect to some counterparts available in the open literature can be achieved especially in training starved regimes.

The challenge of automatic target recognition of military targets within a synthetic aperture radar scene is addressed in this paper. The proposed approach exploits the discrete-defined Krawtchouk moments, which are able to represent a detected extended target with few features, allowing its characterization. The proposed algorithm provides robust performance for target recognition, identification, and characterization, with high reliability in the presence of noise and reduced sensitivity to discretization errors. The effectiveness of the proposed approach is demonstrated using the MSTAR dataset.

This study deals with the problem of covariance matrix estimation for radar signal processing applications. The authors propose and analyse a class of estimators that do not require any knowledge about the probability distribution of the sample support and exploit the characteristics of the positive‐definite matrix space. Any estimator of the class is associated with a suitable distance in the considered space and is defined as the geometric barycenter of some basic covariance matrix estimates obtained from the available secondary data set. Then, the authors introduce an adaptive detection structure, exploiting the new covariance matrix estimators, based on two stages. The former consists of a data selector screening among the training data, whereas the latter is a conventional adaptive matched filter taking the final decision about the target presence. At the analysis stage, the authors assess the performance of the proposed two‐stage scheme in terms of probability of correct outliers excision, constant false alarm rate behaviour and detection probability. The analysis is conducted both on simulated data and on the challenging KASSPER datacube.

Phase modulation induced by target micromotions introduces sidebands in the radar spectral signature returns. Time-frequency distributions facilitate the representation of such modulations in a micro-Doppler signature that is useful in the characterization and classification of targets. Reliable micro-Doppler signature classification requires the use of robust features that are capable of uniquely describing the micromotion. Moreover, future applications of micro-Doppler classification will require meaningful representation of the observed target by using a limited set of values. In this paper, the application of the pseudo-Zernike moments for micro-Doppler classification is introduced. Specifically, the proposed algorithm consists of the extraction of the pseudo-Zernike moments from the cadence velocity diagram (CVD). The use of pseudo-Zernike moments allows invariant features to be obtained that are able to discriminate the content of two-dimensional matrices with a small number of coefficients. The analysis has been conducted both on simulated and on real radar data, demonstrating the effectiveness of the proposed approach for classification purposes.