On compressive sensing applied to radar

• Published in: Signal processing Vol. 90; no. 5; pp. 1402 - 1414
• Main Author: Ender, Joachim H.G.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.05.2010
• Subjects: Airspace surveillance; Algorithms; Antennas; Arrays; Compressive sensing; Detection; DOA estimation; Enrichment; ISAR; Mathematical models; Pulse compression; Radar; Radar imaging; Sparse arrays; Theorems; DOA estimation; Compressive sensing; Radar; Sparse arrays; Radar imaging; ISAR; Pulse compression; Airspace surveillance
• ISSN: 0165-1684; 1872-7557
• DOI: 10.1016/j.sigpro.2009.11.009

Compressive sensing (CS) techniques offer a framework for the detection and allocation of sparse signals with a reduced number of samples. Today, modern radar systems operate with high bandwidths—demanding high sample rates according to the Shannon–Nyquist theorem—and a huge number of single elements for phased array antennas. Often only a small amount of target parameters is the final output, arising the question, if CS could not be a good mean to reduce data size, complexity, weight, power consumption and costs of radar systems. There is only a small number of publications addressing the application of CS to radar, leaving several open questions. This paper addresses some aspects as a further step to CS-radar by presenting generic system architectures and implementation considerations. It is not the aim of this paper to investigate numerically efficient algorithms but to point to promising applications as well as arising problems. Three possible applications are considered: pulse compression, radar imaging, and air space surveillance with array antennas. Some simulation results are presented and enriched by the evaluation of real data acquired by an experimental radar system of Fraunhofer FHR.