Analysis of Frequency Agile Radar via Compressed Sensing

TL;DR

This paper provides a theoretical analysis of frequency agile radar using compressed sensing, focusing on the sensing matrix properties, recoverability bounds, and validating results through simulations and experiments.

Contribution

It offers a detailed theoretical analysis of FAR with CS, including sensing matrix properties and recoverability bounds, which was previously less explored.

Findings

Structured random sensing matrix analyzed

Bounds on recoverable targets derived

Simulations and experiments validate theoretical results

Abstract

Frequency agile radar (FAR) is known to have excellent electronic counter-countermeasures (ECCM) performance and the potential to realize spectrum sharing in dense electromagnetic environments. Many compressed sensing (CS) based algorithms have been developed for joint range and Doppler estimation in FAR. This paper considers theoretical analysis of FAR via CS algorithms. In particular, we analyze the properties of the sensing matrix, which is a highly structured random matrix. We then derive bounds on the number of recoverable targets. Numerical simulations and field experiments validate the theoretical findings and demonstrate the effectiveness of CS approaches to FAR.