Search

This article deals with the synthesis and analysis of quasi-orthogonal nonlinear frequency modulation (NLFM) waveforms to mitigate the impairments of ambiguous returns in quadrature-polarimetric (quad-pol) synthetic aperture radars (SARs). To this end, focusing on signals with a continuous piecewise linear instantaneous frequency, the design of a waveform pair exhibiting both a low cross correlation energy (CCE) and low peak to sidelobe ratios (PSLRs), is considered. To handle the resulting nondeterministic polynomial (NP) hard problem, a coordinate descent (CD) method is employed, where, at each step, the marginal minimization is tackled via a MATLAB optimization toolbox. Hence, transmission/reception schemes jointly capitalizing quasi-orthogonal NLFM waveforms and azimuth phase coding (APC) techniques are proposed to suppress ambiguity interference. Moreover, a systematic framework for the evaluation of the resulting azimuth ambiguity-to-signal ratio (AASR) and range ambiguity-to-signal ratio (RASR) is provided. Finally, detailed simulation experiments based on the LuTan (LT-1) parameters are carried out to verify the practicability and effectiveness of the newly proposed transceiver schemes.

This article outlines the archetype of a novel SpaceBorne Radar (SBR) in the Ka-band for space situational awareness (SSA) based on a code-division multiplexing (CDM) multiple-input-multiple-output (MIMO) payload transceiver. Considering small-size hypervelocity debris, the functional architecture of the fully polarimetric SBR is described, including key comparisons with previous works based on single-input-multiple-output (SIMO) configurations. SBR operations are clarified via timing hierarchies in surveillance mode, the complex data hypercube structure, and the low pulse repetition frequency (L-PRF) range and range rate search (RRRS) entailing a track while simultaneous search (TWSS) contacts collection strategy. Ancillary details on the SBR functional architecture provide paramount insights to ponder critical MIMO aspects and pave the way for key research and development efforts. Finally, numerical results provide a proof of concept for the signal processor upstream the constant false alarm rate-like (CFAR-like) detection block.

A new algorithm for passive bistatic radar (PBR) localization is proposed via joint exploitation of multiple illuminators of opportunity and measurements gathered by a colocated active radar. Ad-hoc constraints within the localization process are bestowed accounting for both a priori information on the PBR receive antenna main-beam size and the uncertainty characterizing active radar data, i.e., the root mean square error (RMSE) of range/bearing measurements. Hence, the estimation task is cast as an elliptic positioning problem, according to the constrained least squares framework. The resulting non-convex optimization problem is globally solved providing a closed-form estimate in Cartesian coordinates. The performance of the proposed estimator, in terms of RMSE, exhibits sensible improvement with respect to counterparts. The proposed technique is also applied to the case of a dynamic scenario for a bi-sensor surveillance system, where the active rotating platform acquires measurements at each scanning period. The results show the localization performance improvement achieved when the system is complemented with a PBR staring in a specific search sector of interest.

This paper deals with the use of Reconfigurable Intelligent Surfaces (RISs) for radar surveillance in Non-Line Of Sight (N-LOS) scenarios. First of all, the geometry of the scene and the new system concept is described with emphasis on the required operative modes and the role played by the RIS. Then, the specific radar equation (including the RIS effect) is developed to manage the coverage requirements in the challenging region where the LOS is not present. Both noise and clutter interference cases (pulse length-limited and beamwidth-limited surface clutter as well as volume clutter) are considered. Hence, a digression on the use of the radar timeline for the new operative mode is presented together with the data acquisition procedure and the resolution issues for the range, azimuth, and Doppler domains. Finally, the interplay among the system parameters and, in particular, those involving the RIS is discussed and analyzed via numerical simulations., Comment: typo corrected in the first equation on page 6

This paper is focused on the detection and resolution of Unmanned Aerial Vehicles (UAVs) via a multi-channel phased-array radar with emphasis on the challenging situation where multiple targets are unresolved in the range-Doppler domain and closely spaced in angle. An adaptive processor is devised which, after triggering a detection in a given range-Doppler cell, implements a binary decision about the presence of a single or multiple targets. In the former situation, the plain monopulse algorithm is used to estimate the target azimuth whereas, in the latter case, a super-resolution technique is activated to get the angular parameters of the UAVs. The performance of the signal processor is assessed both on simulated and on measured data (endowed by ground-truth) collected by a 12-channel phased-array radar operating in the C-band. The results highlight the capabilities of the architecture to detect the presence of targets, to discriminate the single from the multiple targets scenario, and to resolve the UAVs in angle domain when they are unresolved in range and Doppler.

Following governmental strategies to acquire “…capability to watch for objects and natural phenomena that could harm satellites in orbit,” a number of ground-based radars (GBRs) have been deployed for space situational awareness (SSA). In particular, networks of GBRs support the characterization of possible collision trajectories for different types of debris against orbital assets. On the other side, despite increasing demands for augmenting space-based monitoring capabilities for near-earth SSA, there is no evidence of operative SpaceBorne Radars (SBRs) for debris detection and tracking. In the absence of experimental data, one may ponder the design of a novel SBR payload transceiver with specific benefits for SSA, especially if compared to GBRs inference capabilities. In line with this reasoning, this article provides, for the first time, a holistic and harmonizing ontological framework for possible environmental scenarios that an SBR may have to cope with. The objective of such an ontology is related to the conceptual modeling of both channel and target phenomenology as well as target motion models. This, in turn, paves the way for reasonable mathematical formulations and architectural paradigms for framing SBR-based detection and tracking techniques, mostly with respect to small-size hypervelocity targets.

We study the performance -- and specifically the rate at which the error probability converges to zero -- of Machine Learning (ML) classification techniques. Leveraging the theory of large deviations, we provide the mathematical conditions for a ML classifier to exhibit error probabilities that vanish exponentially, say $\sim \exp\left(-n\,I + o(n) \right)$, where $n$ is the number of informative observations available for testing (or another relevant parameter, such as the size of the target in an image) and $I$ is the error rate. Such conditions depend on the Fenchel-Legendre transform of the cumulant-generating function of the Data-Driven Decision Function (D3F, i.e., what is thresholded before the final binary decision is made) learned in the training phase. As such, the D3F and, consequently, the related error rate $I$, depend on the given training set, which is assumed of finite size. Interestingly, these conditions can be verified and tested numerically exploiting the available dataset, or a synthetic dataset, generated according to the available information on the underlying statistical model. In other words, the classification error probability convergence to zero and its rate can be computed on a portion of the dataset available for training. Coherently with the large deviations theory, we can also establish the convergence, for $n$ large enough, of the normalized D3F statistic to a Gaussian distribution. This property is exploited to set a desired asymptotic false alarm probability, which empirically turns out to be accurate even for quite realistic values of $n$. Furthermore, approximate error probability curves $\sim \zeta_n \exp\left(-n\,I \right)$ are provided, thanks to the refined asymptotic derivation (often referred to as exact asymptotics), where $\zeta_n$ represents the most representative sub-exponential terms of the error probabilities.

Due to increasing demands for spectral resources in both communication and radar systems, the radio frequency electromagnetic spectrum is becoming more and more crowded with interfering nuisances. In order to tackle the scarcity of available spectral intervals, in recent years a multitude of sensing algorithms have been developed for improving spectrum sharing. Among these, two-dimensional (2-D) spectrum sensing can be used to obtain space-frequency electromagnetic spectrum awareness. Specifically, this approach makes it possible to optimize the spectrum usage of certain spectrum portions whose occupancy varies both temporally and spatially. In this article, we evaluate the effectiveness of certain space-frequency map recovery algorithms relying on the use of commercially available hardware. To this end, we employ an inexpensive four-channel coherent receiver, using software-defined radio components, for emitter localization. Hence, after proper calibration of the receiving system, the acquired samples are used to evaluate the performance of different signal processing strategies which exploits the inherent block-sparsity of the overall profile. At the analysis stage, results reveal the effectiveness of such algorithms.

This article considers target separation detection (TSD) in the presence of homogeneous Gaussian interference. The problem is formulated as a hypothesis test for two typical situations: 1) the use of a low range-resolution radar or fast-track update rate; 2) the use of a high-resolution radar or low-track update rate. At the design stage, TSD tests are devised according to the generalized likelihood ratio test criterion. The computation of each decision statistic requires the solution of a semidefinite programming problem obtained leveraging the relationship among linear matrix inequalities and nonnegative trigonometric polynomials. All the obtained decision rules ensure the bounded constant false alarm rate property. At the analysis stage, the performance of some benchmark detectors is given in terms of detection and false alarm probabilities. Finally, numerical examples are provided to show the performance of the proposed tests as compared with the benchmarks as well as the gain achievable over some counterparts devised to monitor a separation event.

Radar operation in a spectrally dense environment is nowadays a very challenging problem due to the increasing demand of spectral resources for defence/surveillance applications, remote sensing capabilities, and civilian wireless services. This article explores the technical feasibility of radar waveforms capable of ensuring spectral coexistence with overlaid emitters via a modern digital arbitrary waveform generator. To this end, a specific hardware-in-the-loop test bed is designed to mimic the perception-action cycle necessary for the agile management of the radio spectrum. Then, a spectrum analyzer (SA) and a digital oscilloscope (DO) are used to demonstrate the compliance of the synthesized waveforms with the theoretical counterparts. In particular, the SA is used to establish if the synthesized waveforms fulfil the spectral requirements forced at the design stage. The DO, instead, is used to assess the adherence of synthesized signals ambiguity function (AF) with the theoretical one. For the considered case studies, results highlight that the synthesized waveforms enable spectral compatibility between radar and communication systems and exhibit desirable AF properties.

This paper studies adaptive radar detection of range distributed targets in the presence of Gaussian interference and possible diffuse multipath returns modeled as independent zero-mean complex circular Gaussian random vectors with unknown covariance matrices. For this problem, an adaptive constrained generalized likelihood ratio (ACGLR) test is devised, where in each range cell of the primary data the covariance matrix (due to both multipath and disturbance echoes) is forced to belong to a neighborhood of the secondary data sample covariance. The size of the uncertainty set is determined adaptively employing jointly a union-intersection test and an expectation likelihood (EL)-based estimate. Besides, an adaptive detector based on the complex parameter Rao test criterion is derived. Remarkably, both the two new architectures possess the desired constant false alarm rate (CFAR) property with respect to the disturbance covariance. Finally, their detection performance is assessed and validated via numerical examples.

This letter deals with similarity parameter selection for knowledge-aided covariance matrix estimation in adaptive radar signal processing. Starting from the observation that the maximum likelihood estimate of the interference covariance matrix under a similarity constraint admits a closed-form expression, which depends on the similarity parameter, an adaptive procedure is devised to get a parameter free estimator. The technique is based on the expected likelihood principle and requires the solution of an implicit equation, which can be efficiently pursued via the bisection method due a monotonicity property. The analysis of the estimator, conducted also in comparison with the counterpart based on the cross-validation method confirms its effectiveness in terms of both performance and computational complexity.

Maximum likelihood (ML) estimation of the loading factor under affine constraints on the covariance eigenvalues is addressed. Several situations of practical interest for radar are considered, and the corresponding ML solutions to the loading factor estimation problem are derived in closed form. Furthermore, it is shown that the constrained ML problem, the constrained geometric approach, and the constrained problem of mean square error minimization (with respect to the loading factor) all lead to the same solution. At the analysis stage, the effectiveness of the resulting covariance estimators is evaluated in terms of both the signal-to-interference-plus-noise ratio and the receiving beampattern shape and compared with that of other covariance estimation methods available in the literature. Finally, a receiving architecture based on the adaptive matched filter that exploits the new loaded covariance estimators is also considered to assess the benefits of the new strategies in terms of detection probability.

Two-dimensional (2-D) spectrum sensing is addressed in the context of a cognitive radar to gather real-time space-frequency electromagnetic awareness. Assuming a sensor equipped with multiple receive antennas, a discrete-time sensing signal model formally accounting for multiple snapshots of observations is introduced. Hence, a new signal processing strategy exploiting the inherent block-sparsity of the overall profile is developed to glean a reliable 2-D occupancy awareness. Specifically, the proposed approach resorts to the regularized maximum likelihood estimation paradigm including a term promoting the block-sparsity of the 2-D profile so as to automatically foster this peculiarity in the profile evaluation. Some illustrative examples (both on simulated and measured data) are provided to compare the novel strategy with a relevant counterpart available in the open literature and highlight the effectiveness of the developed approach.

Transferring and processing huge amounts of data in the cloud can violate the low latency requirements of modern IoT applications, considering underlying network infrastructure limitations. Edge data analytics is a promising solution. However, edge resources have usually less computational capabilities than cloud nodes, resulting in a higher failure rate of IoT systems. Consequently, near-real-time decisions are often based on limited and incomplete data. State-of-the-art solutions, such as operational/workload flows, data reduction, reconstruction, focus mostly on resource and network optimization, while approaches for incomplete data recovery employ a single specific method, despite diverse data characteristics. Data quality impact on accuracy of the decision-making processes is often neglected. We propose EDMFrame, a framework featuring a generic mechanism for recovery of multiple gaps in incomplete datasets, using single-technique recovery (STR) and multiple-technique recovery (MTR) involving projection recovery maps (PRMs). We further devise an adaptive storage management mechanism for reducing data stored at the edge, keeping only the data necessary for predictive analytics. We conduct experiments using time series from smart buildings, (i) automatically recovering various multiple gaps and reducing errors up to 65.48 percent with MTR compared to STR; (ii) reducing amounts of data stored to 39.9 percent on average, keeping prediction accuracy around 98.83 percent.

Performing covert biometric recognition in surveillance environments has been regarded as a grand challenge, considering the adversity of the conditions where recognition should be carried out (e.g., poor resolution, bad lighting, off-pose and partially occluded data). This special issue compiles a group of approaches to this problem.

This paper deals with the synthesis of constant modulus waveforms that optimize radar performance while satisfying multiple spectral compatibility constraints. For each shared band, a precise control is imposed on the injected interference energy. Furthermore, the compliance with amplifiers operating in saturation is ensured at the design stage where phase-only waveforms are considered. To tackle the resulting NP-hard optimization problem, an iterative procedure based on the coordinate descent method is introduced. The overall computational burden of the algorithm is linear with respect to the code length as well as the number of iterations and less then cubic with reference to the number of spectral constraints. Hence, some case studies are reported to highlight the effectiveness of the technique.

Following a geometric paradigm, the estimation of a Toeplitz structured covariance matrix is considered. The estimator minimizes the distance from the Sample Covariance Matrix (SCM) while complying with some specific constraints modeling the covariance structure. The resulting constrained optimization problem is solved globally resorting to the Dykstra’ projection framework. Each step of the procedure involves the solution of two convex sub-problems, whose minimizers are available in closed form. Simulation results related to typical radar environments highlight the effectiveness of the devised method.

In the last decade Digital Forensics has experienced several issues when dealing with network evidence. Collecting network evidence is difficult due to its volatility. In fact, such information may change over time, may be stored on a server out jurisdiction or geographically far from the crime scene. On the other hand, the explosion of the Cloud Computing as the implementation of the Software as a Service (SaaS) paradigm is pushing users toward remote data repositories such as Dropbox, Amazon Cloud Drive, Apple iCloud, Google Drive, Microsoft OneDrive. In this paper is proposed a novel methodology for the collection of network evidence. In particular, it is focused on the collection of information from online services, such as web pages, chats, documents, photos and videos. The methodology is suitable for both expert and non-expert analysts as it “drives” the user through the whole acquisition process. During the acquisition, the information received from the remote source is automatically collected. It includes not only network packets, but also any information produced by the client upon its interpretation (such as video and audio output). A trusted-third-party, acting as a digital notary , is introduced in order to certify both the acquired evidence (i.e., the information obtained from the remote service) and the acquisition process (i.e., all the activities performed by the analysts to retrieve it). A proof-of-concept prototype, called LINEA , has been implemented to perform an experimental evaluation of the methodology.

This paper deals with adaptive radar detection of targets in the presence of Gaussian disturbance sharing a block-diagonal covariance structure. The problem is formulated according to a very general signal model, which contains the point-like, range-spread, and subspace target (or targets) as special instances. Hence, a unified study on the resulting adaptive detection problem is handled with the use of the invariance theory. The obtained results, including an appropriate transformation group, a maximal invariant and an induced maximal invariant, are proven consistent with those existing in the literature for some simple scenarios. Meanwhile, since the widely-used generalized likelihood ratio detector does not admit a closed form expression, new invariant detectors and their CFAR versions are proposed in this general scenario. Finally, their detection performance is assessed and validated via numerical examples.