Applications of Space-Time Adaptive Processing Edited by Richard Klemm
The Institution of Electrical Engineers
Published by: The Institution of Electrical Engineers, London, United Kingdom © 2004: The Institution of Electrical Engineers This publication is copyright under the Berne Convention and the Universal Copyright Convention. All rights reserved. Apart from any fair dealing for the purposes of research or private study, or criticism or review, as permitted under the Copyright, Designs and Patents Act, 1988, this publication may be reproduced, stored or transmitted, in any forms or by any means, only with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms of licences issued by the Copyright Licensing Agency. Inquiries concerning reproduction outside those terms should be sent to the publishers at the undermentioned address: The Institution of Electrical Engineers, Michael Faraday House, Six Hills Way, Stevenage, Herts., SGl 2AY, United Kingdom While the authors and the publishers believe that the information and guidance given in this work are correct, all parties must rely upon their own skill and judgment when making use of them. Neither the authors nor the publishers assume any liability to anyone for any loss or damage caused by any error or omission in the work, whether such error or omission is the result of negligence or any other cause. Any and all such liability is disclaimed. The moral right of the authors to be identified as authors of this work have been asserted by them in accordance with the Copyright, Designs and Patents Act 1988.
British Library Cataloguing in Publication Data Klemm, Richard Applications of space-time adaptive processing 1. Adaptive signal processing 2. Adaptive antennas 3. Radar 4. Sonar I. Title II. Institution of Electrical Engineers 621.3'848 ISBN 0 85296 924 4
Typeset in India by Newgen Imaging Systems (P) Ltd., Chennai, India Printed in the UK by MPG Books Limited, Bodmin, Cornwall
Preface
I have been asked frequently which is the more difficult task, to write a book on your own or to edit a multiauthor book such as the one at hand. I have tried both and found that each of the two kinds of project has its own charming facets. It is a pity that the work is done now - 1 enjoyed so much working on these books. My first book 'Space-time adaptive processing - principles and applications' (IEE, 1998) contains mainly a summary of my own work in this fascinating area, specialising in the most popular application: clutter suppression for airborne radar. The book has been so well received that a second extended edition 'Principles of space-time adaptive processing' appeared in 2002. While working on the second edition it came to my mind that this book contains only a subset of the broad field of space-time adaptive processing (STAP) and, moreover, reflects only my personal view of the subject. In particular, aspects of STAP operation on real clutter data are missing. Therefore, I proposed to the IEE to edit another book on STAP comprising a large variety of contributions by different distinguished authors so as to cover the entire area of space-time processing as much as possible. In contrast to my first book, applications of STAP are emphasised in this volume. The publisher kindly agreed to this ambitious plan, and I approached a large number of scientists well known in the STAP field and asked them for cooperation. I am amazed that almost all individuals I contacted immediately agreed to contribute. The total number of contributors amounts to 45! Waves are by nature functions of space and time. Whoever deals with the interpretation of waves has to apply space-time processing techniques. The fundamental paper by Brennan and Reed 'Theory of adaptive radar' (IEEE Trans. AES, 9, (2), March, 1973, pp. 237-252) has been formulated already in space-time notation, thus addressing the effects of broadband array antennas. In this paper by 'time' the fast (range equivalent) time was meant. Three years later the same authors extended their ideas to the use of array antennas in the space-slow time domain (pulse-to-pulse) for clutter rejection in moving radar systems. This was the first publication on what most people in the radar community understand by STAR The book is subdivided into two main sections: A 'Suppression of clutter in moving radar' and B 'Other space-time processing applications'. Each main section is divided in different parts dedicated to specific aspects of space-time processing.
Section A consists of four parts which deal with various aspects of the traditional STAP in GMTI (ground moving target indication) applications for moving radar platforms such as an aircraft or a satellite. Here the reader may find detailed information on topics such as STAP and SAR, space-based MTI, specific antenna configurations, STAP performance in real, heterogeneous clutter, specific (e.g. non-linear) algorithms and processor architectures, robust signal detection techniques, non-adaptive space-time clutter filters, effect of range ambiguous clutter etc. Section B includes specific applications of space-time techniques in various disciplines such as fast time STAP for broadband radar (jammer cancellation, superresolution), tracking of ground targets with STAP radar, interference reduction in over-the-horizon radar (with reference to terrain scattered jamming). Another part is dedicated to applications in seismics and acoustics. The last part deals with spacetime techniques as proposed for communication systems, including mitigation of mutual interference in cellular phones, reduction of multipath effects in underwater communications, interference suppression for GPS and space-time coding. At the end of each chapter a brief summary is given in which the major insights are highlighted. Moreover, each chapter concludes with a list of references which helps the interested reader to find in-depth background literature. The total number of references amounts to about 900. I hope that the reader will enjoy reading this unique book and will appreciate the effort made by 45 leading experts in the space-time processing field in order to bring their individual expertise to the reader's attention. In particular, by having a look 'over the fence' in other fields I expect some cross-fertilisation between different but somehow related disciplines. It is intended that scientists working in different disciplines may learn from each other, and that new ideas based on the fruit harvested already in a neighbour's garden are stimulated. If this expectation comes true the team of authors has reached its goal. I want to express my gratitude to all the authors who did a tremendous work in contributing to this unique book and encouraging the editor in his ambitious undertaking. It was a real pleasure to work with all of them. I am grateful to K. Kriicker and J. Ender of FGAN for supporting this work. I want to thank the IEE personally and on behalf of all the authors for the excellent job done. Specifically I would like to thank the anonymous reviewers for their revision of the manuscript, the commissioning editor Sarah Kramer and the editorial assistant, Wendy Hiles, for the excellent cooperation and the high quality of the final product. Richard Klemm
Glossary
a a ABF ACP ACE ADC AEP AEW AIC ALQ AMF AoA Ar ARMA ASB ASEP ASFF ATI AWACS AWGN
auxiliary channel vector noise-to-clutter ratio adaptive beamforming auxiliary channel processor adaptive coherence estimator analogue-to-digital conversion auxiliary eigenvector processor airborne early warning akaike information criterion adaptive linear quadratic adaptive matched filter angle of arrival received signal amplitude autoregressive moving average adaptive sidelobe blanker auxiliary sensor/echo processor auxiliary sensor FIR filter processor along-track interferometry Airborne Warning and Control System additive white Gaussian noise
b B B BASS-ALE Bc #D /3 BER BF BICM BK
beamformer vector bandwidth number of beamformer elements broadband signal subspace spatial-spectral estimation clutter bandwidth Doppler bandwidth look angle relative to array axis bit error rate beamforming bit interleaved coded modulation backward method
bk BLAST BLE BS Bs BW
beamformer weights Bell Labs layered space-time transceiver block linear equaliser basestation system bandwidth beamwidth
c C c cF Cr CALC CCD CCI CDMA CE CFAR CGM CIG CMP CMT CNR Coho COMET CPI CRB CRP CRS CSM CSST CW
light velocity number of space-time channels vector of clutter echoes vector of clutter spectral components transformed vector of clutter echoes constrained averaged likelihood ratio concealment, camouflage and deception cochannel interference code division multiple access capacity efficient constant false alarm rate conjugate gradient method common image gathers common midpoint covariance matrix taper clutter-to-noise power ratio coherent oscillator covariance matching estimation techniques coherent processing interval Cramer-Rao bound common reflection point common reflection surface cross spectral metric coherent signal subspace transformation continuous wave
d dimSS D(O) D{(p) ds DSW DUM dx dy dz D3LS AR
sensor spacing dimension of signal subspace vertical sensor directivity pattern horizontal sensor directivity pattern subarray displacement direct subarray weighting direct uniform manifold model sensor spacing in ^-direction sensor spacing in y-direction sensor spacing in z-direction direct data domain least-squares width of range bin
DF DFB DFT DL DMO DoA DoF DPCA DS
decision feedback Doppler filter bank discrete Fourier transform downlink dip moveout direction of arrival degrees of freedom displaced phase centre antenna direct sequence
e/ E{} ESPRIT
unit vector (7-th column of unit matrix) expectation estimation of signal parameters by rotational invariance techniques envelope of transmitted waveform
E(t) f F F (p FAP FB cpc /c /D FD FDFF FDSP FFT FIR O^ FL <^L F-LAS /Ny /PR /r FREQUENCY /s F-SAS FT O* FW
vector of D F T or D F B output signals D F T matrix, Doppler filter bank normalised target Doppler frequency azimuth (optimum) fully adaptive processor forward-backward method clutter angle of arrival carrier frequency Doppler frequency frequency domain frequency domain FIR filter frequency dependent spatial processing fast Fourier transform finite impulse response spatial phase term forward looking look angle fading-large angle spread Nyquist frequency pulse repetition frequency, PRF relative clutter Doppler frequency, normalised by maximum clutter Doppler frequency frequency associated with TIME (fast radar time) spatial frequency fading-small angle spread Fourier transform temporal phase term forward method
G(.) GAA GER GIP GLRT GSLC GMTI
transmit directivity pattern Gaussian angle of arrival generalised eigenrelation generalised inner product generalised likelihood ratio test generalised sidelobe canceller ground moving target indication
H HRR
platform altitude above ground high range resolution
I ICI ICM IF IF IID HR IMM int{} ISAR ISI
identity matrix intercell interference internal clutter motion improvement factor intermediate frequency independent and identically distributed infinite impulse response interacting multiple models next integer number inverse synthetic aperture radar intersymbol interference
j J J JD JDL JDL-GLR ji jik JNR Joint-STARS
jammer vector number of jammers Fisher information matrix joint detection joint domain localised joint-domain localised generalised likelihood ratio /-th jammer signal component /fc-th element of the Fisher information matrix jammer-to-noise ratio joint strategic target attack radar system
K KASSPER
reduced number of antenna channels knowledge aided sensor signal processing and expert reasoning
L
number of FIR filter taps, temporal dimension of space-time FIR filter reflectivity function local area network wavelength linear dispersion
L(.) LAN A LD
LMI LMS LO LoS
lean matrix inversion least mean square low observable line of sight
M MAC MAI MCARM MDL MDV MEM MF MFR MGLRT MIMO MISO ML MLSE MMSE MRC MS MSAR MTD MTDI MTI /x MUSIC MVE
number of echo pulses or temporal samples media access layer multiple access interference multichannel airborne radar measurement minimum description length minimum discernable velocity maximum entropy method matched filter matched filter response modified generalised likelihood ratio test multiple input, multiple output multiple input, single output maximum likelihood maximum likelihood sequence estimator minimum mean square error maximum ratio combining mobile station multichannel SAR moving target detector moving target detection and imaging moving target indicator factor determining the number of Doppler channels multiple signal classification minimum variance estimator
N n N TVe np NIC NIP NIR NMO iix Nt
noise covariance matrix noise vector number of antenna elements number of eigenvalues noise spectrum vector network interface card normal incidence point noise-to-interference ratio normal moveout transformed noise vector number of transmit elements
O OAP
zero matrix optimum adaptive processor
OC OFDM coc coj) OPP OUS
optimum combining orthogonal frequency division multiplexing carrier frequency angular Doppler frequency orthogonal projection processor overlapping uniform subarray configuration
PAM Pc PCI PD PDA PDF PDOF PDR PEP PHY Pj Pn Pr PRF PRI PRT Ps PSD PSF x/s PSK PST Pt
pulse amplitude modulation clutter power principal components inverse pulse Doppler probabilistic data association probability distribution function product of the spatial and temporal degrees of freedom pulse Doppler radar pairwise error probability physical layer jammer power noise power received signal power pulse repetition frequency pulse repetition interval pulse repetition time signal power power spectral density point spreading function crab angle phase shift keying power-selective training transmitted power
q Q Q QAM Qc, Q (c) QF Qi Qj Qn QoS QoT QPSK Qs QT
interference vector number of data vectors, number of normal modes interference + noise covariance matrix quadrature amplitude modulation clutter covariance matrix interference + noise power spectral matrix interference covariance matrix jammer covariance matrix noise covariance matrix quality of service quality of transmission quaternary phase shift keying signal covariance matrix transformed interference + noise covariance matrix
R R R /?2 w r9o RCS RF Rg p RL-STAP RMS Rs R(t) Rx
number of range increments range covariance matrix of signal + interference + noise two-way slant range quarter wave sampling interval radar cross section radiofrequency ground range autocorrelation Rome Laboratory space-time adaptive processing root-mean-square slant range range receive
s signal vector S signal + clutter covariance matrix s(-) steering vector SAR synthetic aperture radar SAS symmetric auxiliary sensor configuration SC single carrier SCNR signal-to-clutter + noise ratio SCR signal-to-clutter power ratio SD/TD/CDMA space division/time division/code division multiple access SDM spectral density matrix SDMA space division multiple access SER symbol error rate Sp signal spectrum vector E DPCA shift operator SIMO single input, multiple output sine (X) sin(x)/x SINR signal-to-interference-plus-noise ratio SIRP spherically invariant random process SISO single input, single output SL sidelooking SM spatial multiplexing SM signal match SMI sample matrix inverse SNIR signal-to-noise + interference ratio SNR signal-to-noise power ratio SoI signal of interest s r (t) received signal ST space-time ST transformed signal vector STAP space-time adaptive processing
STBC STFT STTC SVD
space-time block code short-time Fourier transform space-time trellis code singular value decomposition
t T T r xt TCM TDD TDMA 0 TIME time tr truAM Ts TSI Tx
time pulse repetition interval space-time transform matrix echo delay round trip delay trellis coded modulation time division duplex time division multiple access depression angle echo delay time, range time (fast time) pulse-to-pulse time (slow time) trace of a square matrix true array manifold spatial transform matrix terrain scattered interference transmit
UAV UESA UL ULA UMTS
unmanned air vehicle U H F electronically scanned array uplink uniform linear array universal mobile telecommunications system
vc Vp f ra d VSAR vt i>tan
radial clutter velocity platform velocity (x-direction) radial target velocity velocity SAR target velocity tangential target velocity
WAVES WNSF WSF WVD
weighted average of signal subspaces weighted noise subspace fitting weighted subspace fitting Wigner-Ville distribution
x xp Xt Xx
vector of received echoes spectral vector of received echoes jc-coordinate of /-th sensor transformed vector of received echoes
y yc yi
output signal correction pattern y-coordinate of i-th sensor
ZF H ZO *
zero forcing z-coordinate of/-th sensor zero offset conjugate complex or conjugate complex transpose
* 0 O
convolution Kronecker product zero vector
List of Contributors
Yuri I. Abramovich CSSIP, SPRI Building, Technology Park Adelaide, Mawson Lakes, South Australia 5095
Russell D. Brown Department of Electrical and Computer Engineering, Syracuse University, Syracuse, New York 13244-1240, USA
Stuart J. Anderson CSSIP, SPRI Building, Technology Park Adelaide, Mawson Lakes, South Australia 5095
Jeffrey T. Carlo AFRL/SNRD, 26 Electronic Parkway, Rome, New York 13441-4514, USA. e-mail:
[email protected]
Stephan Benen ATLAS ELEKTRONIK GmbH, Sebaldsbriicker Heerstr. 235, D-28305 Bremen, Germany Steffen Bergler Geophysical Institute, University of Karlsruhe, Hertzstr. 16, 76187 Karlsruhe, Germany R. S. Blum ECE Department, Lehigh University, 19 Memorial Drive West, Bethlehem, PA 18015-3084, USA. Tel: (610) 758-3459; Fax: (610) 758-6279; e-mail:
[email protected]. Johann F. Bohme Ruhr-Universitat Bochum, Fakultat Fiir Elektrotechnik, 44780 Bochum
Pei-Jung Chung Ruhr-Universitat Bochum, Fakultat Fiir Elektrotechnik, 44780 Bochum Fabiola Colone Dept. INFOCOM, University of Rome 'La Sapienza', Via Eudossiana 18, 00184 Rome, Italy. Tel: +39-06-44585472; Fax: +39-06-4873300 Eric Duveneck Geophysical Institute, University of Karlsruhe, Hertzstr. 16, 76187 Karlsruhe, Germany Alfonso Farina AMS (Alenia Marconi Systems) Chief Technical Office Scientific Director, Via Tiburtina km. 12.400, 00131 Rome, Italy. Tel: +39-6-41502279;
Fax: +39-6-4150-2665; e-mail:
[email protected] Christoph H. Gierull Defence R&D Canada, Ottawa (DRDC-O), 3701 Carling Ave., Ottawa, ON, Canada, KlA 0Z4. e-mail:
[email protected] Dhananjay Gore Qualcomm Inc., 9940 Barnes Canyon Road, San Diego, CA 92121, USA. e-mail:
[email protected] Alexei Y. Gorokhov CSSIP, SPRI Building, Technology Park Adelaide, Mawson Lakes, South Australia 5095 Peter Hubral Geophysical Institute, University of Karlsruhe, Hertzstr. 16, 76187 Karlsruhe, Germany
Yung P. Lee Science Applications International Corporation, 1710 SAIC Drive, McLean, VA 22102, USA. Tel: 703-676-6512; Fax: 703-893-8753; e-mail:
[email protected] Chuck Livingstone Defence R&D Canada, Ottawa (DRDC-O), 3701 Carling Ave., Ottawa, ON, Canada, KlA 0Z4 Pierfrancesco Lombardo Dept. INFOCOM, University of Rome 4 La Sapienza', Via Eudossiana 18, 00184 Rome, Italy. Tel: +39-06-44585472; Fax: +39-06-4873300; e-mail:
[email protected] .it,
[email protected] .it Dirk Maiwald ATLAS ELEKTRONIK GmbH, Sebaldsbrucker Heerstr. 235, D-28305 Bremen, Germany
Richard Klemm FGAN-FHR, Neuenahrer Str. 20, D 53343 Wachtberg, Germany. Tel: ++49 228 9435 377; Fax:++49 228 348 618; e-mail:
[email protected]
Jiirgen Mann Geophysical Institute, University of Karlsruhe, Hertzstr. 16, 76187 Karlsruhe, Germany
Wolfgang Koch FGAN-FKIE, Neuenahrer Strasse 20, D 53343 Wachtberg, Germany. Tel: +49-(0)228/9435-529; Fax: -685; e-mail:
[email protected]
K. F. McDonald MITRE Corporation, 202 Burlington Road, Bedford, MA 01730-1420, USA. Tel: (781) 271-7739; Fax:(781)271-7045; e-mail:
[email protected]
Stephen M. Kogon MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420-9108, USA
William L. Melvin Georgia Institute of Technology, Georgia Tech Research Institute (GTRI), Atlanta, GA, USA
Wilbur L. Myrick SAIC, 4501 Daly Drive, Chantilly, VA 20151,USA. e-mail:
[email protected] Rohit Nabar ETF El 19, Sternwartstrasse 7, Zurich CH8092, Switzerland, e-mail:
[email protected]
Tapan K. Sarkar Department of Electrical Engineering and Computer Science, Syracuse University, 123 Link Hall, Syracuse, New York 13244-1240, USA. e-mail:
[email protected]; http ://web. syr.edu/~tksarkar
Ulrich Nickel FGAN-FHR, Neuenahrer Str. 20, 53343 Wachtberg, Germany
Helmut Schmidt-Schierhorn ATLAS ELEKTRONIK GmbH, Sebaldsbriicker Heerstr. 235, D-28305 Bremen, Germany
Tim J. Nohara Sicom Systems Ltd., 67 Canboro Rd., 2nd Floor, RO. Box 366, Fonthill, Ontorio, LOS IEO
Richard A. Schneible Department of Electrical and Computer Engineering, Syracuse University, Syracuse, New York 13244-1240, USA
Arogyaswami Paulraj Smart Antennas Research Group, Packard 272, Stanford University, Stanford, CA 94305, USA. e-mail:
[email protected]
Nicholas K. Spencer CSSIP, SPRI Building, Technology Park Adelaide, Mawson Lakes, South Australia 5095
Peter G. Richardson QinetiQ Malvern, Malvern Technology Centre, St. Andrews Road, Malvern, Worcs., UK, WR14 3PS. Tel/Fax: 01684 894316/01684 894185; e-mail:
[email protected] Magdalena Salazar-Palma Dpto. Senales, Sistemas y Radiocomunicaciones, ETSI Telecommunicacion, Universidad Politecnica de Madrid, Ciudada Universitaria, s/n 28040, Madrid, Spain, e-mail:
[email protected] Sumeet Sandhu Intel Corporation, M/S RNB 6-49, 2200 Mission College Blvd, Santa Clara, CA 95052, USA. e-mail:
[email protected]
L. Timmoneri Technical Directorate, Radar & Technology Division, Alenia Marconi Systems, Via Tiburtina km. 12.400, 00131 Rome, Italy. Tel: +39-6-41502279; Fax: +39-6-41502665; e-mail:
[email protected] Christoph M. Walke COHAUSZ & FLORACK, Patent- und Rechtsanwalke, Kanzlerstrasse 8a, 40472 Dusseldorf H. Wang Department of Electrical and Computer Engineering, Syracuse University, Syracuse, New York 13244-1240, USA
R Weber Sicom Systems Ltd., 67 Canboro Rd., 2nd Floor, P.O. Box 366, Fonthill, Ontario, LOS IEO
Rolf Weber Ruhr-Universitat Bochum, Fakultat Fiir Elektrotechnik, 44780 Bochum
Michael C. Wicks AFRL/SN, 26 Electronic Parkway, Rome, New York 13441-4514, USA. e-mail:
[email protected]
Michael Zatman MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420-9108, USA Y. Zhang Department of Electrical and Computer Engineering, Syracuse University, Syracuse, New York 13244-1240, USA Michael D. Zoltowski School of Electrical Engineering, Purdue University, West Lafayette, IN 47907-1285, USA. e-mail:
[email protected]
Contents
Preface ...............................................................................
xix
Glossary .............................................................................
xxi
List of Contributors ............................................................. xxxi Section A. Suppression of Clutter in Moving Radar Part I. 1.
Space-slow Time Processing for Airborne MTI Radar
Space-time Adaptive Processing for Manoeuvring Airborne Radar ..................................................................................
5
1.1
Introduction .............................................................
5
1.2
STAP Fundamentals ...............................................
6
1.3
Clutter Angle-Doppler Relationships ....................... 1.3.1 Straight and Level Flight ............................ 1.3.2 Effect of Variations in Platform Orientation .................................................
9 9 11
1.4
Clutter Suppression in Forward-looking Radar ....... 1.4.1 Mainlobe Clutter Suppression ................... 1.4.2 Sidelobe Clutter Suppression ....................
12 12 18
1.5
Slow Moving Target Detection under Conditions of Manoeuvre .............................................................. 1.5.1 Effects of Platform Manoeuvre .................. 1.5.2 Motion Compensation ...............................
23 23 24
Jammer Rejection under Conditions of Manoeuvre .............................................................. 1.6.1 Mainlobe Clutter Filtering Requirements ...
27 27
1.6
This page has been reformatted by Knovel to provide easier navigation.
v
vi
Contents 1.6.2
Advantages of Using STAP .......................
27
Summary ................................................................
33
Non-linear and Adaptive Two-dimensional FIR Filters for STAP: Theory and Experimental Results ...........................
37
2.1
Introduction .............................................................
37
2.2
Adaptive Linear Filters ............................................
38
2.3
AR-based FIR Filters ..............................................
45
2.4
Non-linear Combination of Non-adaptive Filters ..... 2.4.1 Filter Bank Design ..................................... 2.4.2 Detection Threshold and Performance ...... 2.4.3 AR-based Non-linear Detector ..................
51 52 55 56
2.5
Non-linear Combination of Adaptive AR-based Two-dimensional FIR Filters ...................................
61
2.6
Conclusions ............................................................
66
2.7
Acknowledgments ...................................................
69
2.8
Appendix: ML Estimation of Two-dimensional AR parameters ..............................................................
69
Space-time Techniques for SAR ........................................
73
3.1
Summary ................................................................
73
3.2
Description of the Problem and State of the Art .....
73
3.3
Model of MSAR Echoes .......................................... 3.3.1 Aberrations Due to Target Motion ............. 3.3.2 Space-time-frequency Representation ......
76 76 77
3.4
Processing Schemes .............................................. 3.4.1 Taxonomy of Processing Schemes for MSAR ........................................................ 3.4.2 MTI + PD ................................................... 3.4.3 DPCA ........................................................ 3.4.4 Along-track Interferometry (ATI)-SAR ....... 3.4.5 Processor in the Space-time-frequency Domain ...................................................... 3.4.6 Optimum Processing for MSAR .................
82
1.7 2.
3.
This page has been reformatted by Knovel to provide easier navigation.
82 87 94 95 98 107
Contents
4.
3.5
Conclusions ............................................................
119
3.6
Acknowledgments ...................................................
120
Σ∆-STAP: an Efficient, Affordable Approach for Clutter Suppression .......................................................................
123
4.1
Definition of the Difference (∆) Beams ....................
123
4.2
Σ∆-STAP Algorithms ...............................................
125
4.3
Analytical Performance Formulas of Σ∆-STAP ....... 4.3.1 SINR Potential ........................................... 4.3.2 Probabilities of Detection and False Alarm .........................................................
129 129
4.4
A Real-data Demonstration of Σ∆-STAP ................
131
4.5
Desired ∆-beam Characteristics ............................. 4.5.1 Mathematical Equivalence of Subarray and Σ∆-STAP .............................................
135
Summary ................................................................ 4.6.1 Advantages of the Σ∆-STAP Approach ..... 4.6.2 Limitations of Σ∆-STAP ............................. 4.6.3 Potential Applications of Σ∆-STAP ............
143 143 145 146
STAP with Omnidirectional Antenna Arrays .......................
149
5.1
Introduction ............................................................. 5.1.1 Preliminaries on STAP Antennas .............. 5.1.2 The Circular Ring Array Concept ...............
149 149 151
5.2
Array Configurations for 360° Coverage ................. 5.2.1 Four Linear Arrays ..................................... 5.2.2 Displaced Circular Rings ........................... 5.2.3 Circular Planar Array with Randomly Distributed Elements ................................. 5.2.4 Octagonal Planar Array .............................
152 153 156
5.3
Discussion .............................................................. 5.3.1 Directivity Patterns .................................... 5.3.2 Range-ambiguous Clutter .........................
164 164 165
5.4
Effect of Array Tilt ...................................................
167
4.6
5.
vii
This page has been reformatted by Knovel to provide easier navigation.
130
142
157 160
viii
Contents 5.4.1
Side-looking Linear and Rectangular Arrays ........................................................ Omnidirectional Arrays ..............................
167 168
5.5
Conclusions ............................................................
169
Part II.
Space-slow Time Processing for Space-based MTI Radar
5.4.2
6.
7.
SAR-GMTI Concept for RADARSAT-2 ...............................
177
6.1
177 177
Introduction ............................................................. 6.1.1 Background ............................................... 6.1.2 Addition of MTI Modes to Spaceborne SAR ........................................................... 6.1.3 RADARSAT-2 Moving Object Detection Experiment ................................................
179
6.2
Analysis of SAR-GMTI Modes for RADARSAT-2 ... 6.2.1 Background ............................................... 6.2.2 Statistical Models of Measured Signals ..... 6.2.3 SCNR Optimum Processing ...................... 6.2.4 SAR Displaced Phase Centre Antenna ..... 6.2.5 SAR Along-track Interferometry .................
180 181 184 188 193 194
6.3
SAR-STAP Scheme for RADARSAT-2 ................... 6.3.1 Detection ................................................... 6.3.2 Parameter Estimation ................................
196 196 201
6.4
Conclusions ............................................................
202
6.5
List of Symbols .......................................................
203
STAP Simulation and Processing for Spaceborne Radar ..................................................................................
207
7.1
Introduction .............................................................
207
7.2
Spaceborne Radar Applications and Design .......... 7.2.1 Spaceborne MTI Radar Applications ......... 7.2.2 Spaceborne MTI Radar Design .................
208 208 209
7.3
STAP Processing for SBR ......................................
212
This page has been reformatted by Knovel to provide easier navigation.
178
Contents 7.3.1 7.3.2 7.3.3
8.
ix
Typical GMTI Signal Processing ............... Extension to Other Modes ......................... Other Issues ..............................................
212 215 216
7.4
Simulation and Processing for SBR ........................ 7.4.1 User Interface ............................................ 7.4.2 Model the Radar ........................................ 7.4.3 Model the Environment ............................. 7.4.4 Generate the Signals ................................. 7.4.5 Model the Processing ................................ 7.4.6 Evaluate the Results .................................
217 218 224 225 227 228 229
7.5
Discussion and Conclusions ...................................
231
Techniques for Range-ambiguous Clutter Mitigation in Space-based Radar Systems .............................................
235
8.1
Introduction .............................................................
235
8.2
Moving Target Detection with SBR ......................... 8.2.1 STAP for SBR Systems .............................
236 238
8.3
Clutter Characteristics of Pulse-Doppler Waveforms in SBR ..................................................................... 8.3.1 Clutter Doppler Ambiguities ....................... 8.3.2 Clutter Range Ambiguities .........................
240 241 242
Impact of Range-ambiguous Clutter on STAP Performance ...........................................................
244
Range-ambiguous Clutter Mitigation Techniques with Pulse-Doppler Waveforms .............................. 8.5.1 PRF Diversity ............................................ 8.5.2 Aperture Trade Offs ...................................
247 247 249
8.4 8.5
8.6
8.7
Long Single Pulse Phase-encoded Waveforms ..... 8.6.1 Properties of Long Single Pulse Phaseencoded Waveform (LSPW) ...................... 8.6.2 Integrated Sidelobe Clutter Levels ............ 8.6.3 STAP Simulations .....................................
250
Summary ................................................................
260
This page has been reformatted by Knovel to provide easier navigation.
252 254 257
x
Contents
Part III. 9.
Processing Architectures
Parallel Processing Architectures for STAP .......................
265
9.1
Summary and Introduction ......................................
265
9.2
Baseline Systolic Algorithm ....................................
265
9.3
Lattice and Vectorial Lattice Algorithms ..................
269
9.4
Inverse QRD-based Algorithms ..............................
271
9.5
Experiments with General Purpose Parallel Processors ..............................................................
272
9.6
Experiments with VLSI-based CORDIC Board .......
273
9.7
Modern Signal Processing Technology Overview and Its Impact on Real-time STAP .........................
275
9.8
Processing of Recorded Live Data ......................... 9.8.1 Systolic Algorithm for Live Data Processing ................................................. 9.8.2 Data Files Used in the Data Reduction Experiments .............................................. 9.8.3 Performance Evaluation ............................ 9.8.4 Detection of Vehicular Traffic ....................
278 280 284
9.9
Concluding Remarks ..............................................
285
9.10
Appendix A: Givens Rotations and Systolic Implementation of Sidelobe Canceller ....................
286
9.11
Appendix B: Lattice Working Principle ....................
288
9.12
Appendix C: the CORDIC Algorithm .......................
289
9.13
Appendix D: the SLC Implementation via CORDIC Algorithm .................................................................
292
Appendix E: an Example of Existing Processors for STAP .................................................................
293
9.14
Part IV.
277
Clutter Inhomogeneities
10. STAP in Heterogeneous Clutter Environments .................. 10.1
277
Introduction ............................................................. 10.1.1 Adaptivity with Finite Sample Support .......
This page has been reformatted by Knovel to provide easier navigation.
305 305 307
Contents
xi
10.1.2 STAP Performance Metrics ....................... 10.1.3 Covariance Matrix Errors ...........................
308 311
10.2
Classes of Space-time Clutter Heterogeneity ......... 10.2.1 General Simulation Characteristics ...........
312 315
10.3
Amplitude Heterogeneity ........................................ 10.3.1 Clutter Discretes ........................................ 10.3.2 Range-angle Varying Clutter RCS ............ 10.3.3 Clutter Edges .............................................
315 315 320 322
10.4
Spectral Heterogeneity ...........................................
325
10.5
CNR-induced Spectral Mismatch ............................
327
10.6
Targets in the Secondary Data ...............................
330
10.7
Joint Angle-Doppler Mismatch and Clutter Heterogeneity .........................................................
337
10.8
10.9
Site-specific Examples of Clutter Heterogeneity ..... 10.8.1 Measured Multichannel Airborne Radar Data ........................................................... 10.8.2 Site-specific Simulation .............................
339 339 342
STAP Techniques in Heterogeneous Environments .......................................................... 10.9.1 Data-dependent Training Techniques ....... 10.9.2 Minimal Sample Support STAP ................. 10.9.3 Clutter Discretes ........................................ 10.9.4 Targets in Training Data ............................ 10.9.5 Covariance Matrix Tapers ......................... 10.9.6 Knowledge-aided Space-time Processing .
344 344 348 350 350 351 352
10.10 Summary ................................................................
353
10.11 Acknowledgments ...................................................
353
11. Adaptive Weight Training for Post-Doppler STAP Algorithms in Non-homogeneous Clutter ............................
359
11.1
Introduction .............................................................
359
11.2
Training of STAP Algorithms ..................................
361
11.3
Post-Doppler STAP Algorithms ..............................
364
This page has been reformatted by Knovel to provide easier navigation.
xii
Contents 11.4
Phase and Power-selected Training for STAP .......
365
11.5
Experimental Results .............................................. 11.5.1 Example of Phase/Power Selection .......... 11.5.2 STAP Results ............................................ 11.5.3 Experimental Versus Theoretical STAP Performance ..............................................
367 368 369
Summary ................................................................
372
12. Application of Deterministic Techniques to STAP ..............
375
11.6 12.1 12.2 12.3 12.4
Introduction .............................................................
372
375
3
Direct Data Domain Least-squares (D LS) Approach, One Dimension ...................................... 3
D LS Approach with Main Beam Constraints .........
379 385
3
A D LS Approach with Main Beam Constraints for Space-time Adaptive Processing ............................ 12.4.1 Space-time D3LS Eigenvalue Processor .................................................. 12.4.2 Space-time D3LS Forward Processor ........ 12.4.3 Space-time D3LS Backward Processor ..... 12.4.4 Space-time D3LS Forward-backward Processor ..................................................
387 389 390 392 393
12.5
Determining the Degrees of Freedom ....................
394
12.6
An Airborne Radar Example ................................... 12.6.1 Simulation Setup ....................................... 12.6.2 Case I: Single Constraint Space-time Example ..................................................... 12.6.3 Case II: Multiple Constraint Space-time Example .....................................................
396 396
12.7
Conclusions ............................................................
408
12.8
List of Variables ......................................................
408
13. Robust Techniques in Space-time Adaptive Processing .... 13.1 Introduction ............................................................. 13.1.1 Initial Development of Space-time Adaptive Processing (STAP) Algorithms ..................
413 413
This page has been reformatted by Knovel to provide easier navigation.
398 403
414
Contents
xiii
13.1.2 Hypothesis Testing Problem ......................
417
13.2
Real-world Detection Environments .......................
418
13.3
Non-homogeneity – Causes and Impact on Performance ........................................................... 13.3.1 Signal Contamination ................................ 13.3.2 Non-homogeneity Detection ...................... 13.3.3 Knowledge-based Signal Processing ........ 13.3.4 Analysis of Degraded Performance Due to Non-homogeneity ..................................
420 423 425 428 428
13.4
Antenna Array Errors ..............................................
430
13.5
Deviation from Gaussian Assumption .....................
431
13.6
Jamming and Terrain Scattered Interference ......... 13.6.1 Constraining Detection Schemes .............. 13.6.2 Two-stage Processors ............................... 13.6.3 Three-dimensional STAP ..........................
433 434 434 436
13.7
Reduction in Computational Complexity ................. 13.7.1 Reduced-rank Methods and Covariance Matrix Tapers ............................................ 13.7.2 Techniques Implementing Limited Reference Cells ......................................... 13.7.3 Low Complexity Approaches to STAP .......
437
Conclusions ............................................................
443
13.8
437 439 441
Color Plates: Applications of Space-time Adaptive Processing .............................................................. 463a
Section B. Miscellaneous Space-time Processing Applications Part V.
Ground Target Tracking with STAP Radar
14. Ground Target Tracking with STAP Radar: the Sensor .....
467
14.1
Introduction .............................................................
467
14.2
Properties of the STAP Radar Sensor .................... 14.2.1 Processing Techniques .............................
467 468
This page has been reformatted by Knovel to provide easier navigation.
xiv
Contents 14.2.2 Array Properties ......................................... 14.2.3 Summary of the Data Output Provided by the STAP Radar ........................................
473
14.3
The Scenario .......................................................... 14.3.1 SNIR and Pd of a Moving Target ............... 14.3.2 System Aspects .........................................
474 474 480
14.4
Degrading Effects ................................................... 14.4.1 Bandwidth Effects ...................................... 14.4.2 Doppler Ambiguities .................................. 14.4.3 Range Ambiguities .................................... 14.4.4 STAP Radar under Jamming Conditions ...
486 486 488 489 492
14.5
Issues in Convoy Tracking ...................................... 14.5.1 Convoy Detection by Range-only Information ................................................. 14.5.2 Convoy Detection by Azimuth Variance Analysis .....................................................
494
Summary ................................................................
499
15. Ground Target Tracking with STAP Radar: Selected Tracking Spects ..................................................................
501
14.6
472
495 496
15.1
Introduction ............................................................. 15.1.1 Discussion of an Idealised Scenario .......... 15.1.2 Summary of Observations .........................
501 502 505
15.2
Tracking Preliminaries ............................................ 15.2.1 Coordinate Systems .................................. 15.2.2 Target Dynamics Model ............................
507 507 509
15.3
GMTI Sensor Model ................................................ 15.3.1 GMTI Characteristics ................................. 15.3.2 Convoy Resolution .................................... 15.3.3 Doppler Ambiguities .................................. 15.3.4 Measurements ...........................................
510 510 512 513 513
15.4
GMTI Data Processing ........................................... 15.4.1 Prediction .................................................. 15.4.2 Data Processing ........................................
514 514 515
This page has been reformatted by Knovel to provide easier navigation.
Contents
xv
Filtering Process ........................................ Realisation Aspects ................................... Discussion ................................................. Retrodiction ............................................... Effect of Doppler Ambiguities ....................
517 518 519 522 524
15.5
Road Map Information ............................................ 15.5.1 Modelling of Roads .................................... 15.5.2 Densities on Roads ...................................
528 529 530
15.6
Quantitative Discussion .......................................... 15.6.1 Simulation Parameters .............................. 15.6.2 Numerical Results .....................................
533 533 534
15.7
List of Variables ......................................................
537
15.4.3 15.4.4 15.4.5 15.4.6 15.4.7
Part VI.
Space-fast Time Techniques
16. Superresolution and Jammer Suppression with Broadband Arrays for Multifunction Radar ......................... 16.1
Introduction .............................................................
16.2
Broadband Array Signal Model and Beamforming .......................................................... 16.2.1 Received Signal and Notation ................... 16.2.2 Digital Beamforming with Subarray Outputs ...................................................... 16.2.3 Influence of Channel Imperfections ...........
16.3
16.4
543 543 544 545 548 553
Superresolution with Broadband Arrays ................. 16.3.1 Spatial-only Processing of Broadband Data ........................................................... 16.3.2 Space and Time Processing Methods ....... 16.3.3 Conclusions on Broadband Superresolution .........................................
559
Jammer Suppression with Broadband Arrays ........ 16.4.1 General Principles of Adaptive Interference Suppression .......................... 16.4.2 Spatial-only Adaptation .............................
582
This page has been reformatted by Knovel to provide easier navigation.
561 566 581
583 589
xvi
Contents 16.5
Part VII.
16.4.3 Space and Time Adaptation ......................
590
Final Remarks .........................................................
595
Over-the-horizon Radar Applications
17. Stochastically Constrained Spatial and Spatio-temporal Adaptive Processing for Non-stationary Hot Clutter Cancellation ........................................................................ 17.1
Overview .................................................................
17.2
SC STAP Fundamentals and Supervised Training Applications .............................................. 17.2.1 SC STAP Algorithm: Analytic Solution ...... 17.2.2 SC STAP Algorithm: Operational Routines .................................................... 17.2.3 SC STAP Algorithm: Efficiency Analysis by Simulation Results ................................ 17.2.4 SC STAP Algorithm: Efficiency Analysis by Real Data Processing ........................... 17.2.5 Summary ...................................................
17.3
17.4
603 603 604 611 624 626 638 642
SC STAP Unsupervised Training Applications ....... 17.3.1 Operational Routine for Unsupervised Training ..................................................... 17.3.2 Operational SC STAP Algorithm: Simulation and Real Data Processing Results ...................................................... 17.3.3 Summary ...................................................
647
SC STAP Convergence Analysis ............................ 17.4.1 Introduction ................................................ 17.4.2 Conditional Loss Factor η1 Analysis: LSMI Versus SMI for SC SAP ................... 17.4.3 Conditional Loss Factor η1 Analysis: LSMI for SC STAP .................................... 17.4.4 Conditional Loss Factor η2 Analysis: Exact PDF for a Single Stochastic Constraint .....
665 665
This page has been reformatted by Knovel to provide easier navigation.
649
656 664
667 678 681
17.5
Part VIII.
Contents
xvii
17.4.5 Conditional Loss Factor η2 Analysis: Approximate PDF for Multiple Stochastic Constraints ................................................
685
List of Variables ......................................................
690
Applications in Acoustics and Seismics
18. Space-time Adaptive Matched Field Processing (STAMP) .............................................................................
701
18.1
Introduction .............................................................
701
18.2
Adaptive Matched Field Processing (MFP) ............
703
18.3
Wideband-narrowband Feedback Loop Whitenoise-constrained Method (FLWNC) ......................
705
18.4
MFP Examples .......................................................
707
18.5
Space-time Adaptive Matched Field Processing (STAMP) .................................................................
709
Forward Sector Processing Simulation Geometry ................................................................
711
Summary ................................................................
713
19. Space-time Signal Processing for Surface Ship Towed Active Sonar .......................................................................
715
18.6 18.7
19.1
Introduction .............................................................
715
19.2
Narrowband Multiple Ping Processing .................... 19.2.1 Data Model ................................................ 19.2.2 Fully Adaptive CW Processing .................. 19.2.3 Partially Adaptive Processing Techniques ................................................
720 720 721
19.3
FM Processing ........................................................ 19.3.1 Image Processing Background .................. 19.3.2 Echogram Image Enhancement ................ 19.3.3 Automatic Echogram Detection .................
724 726 726 726
19.4
Experimental Results .............................................. 19.4.1 Sonar System Description .........................
727 727
This page has been reformatted by Knovel to provide easier navigation.
723
xviii
Contents 19.4.2 19.4.3 19.4.4 19.4.5
CW Pulse Sea Data Analysis .................... Echogram Sea Data Analysis (ACTAS) .... Echogram Enhancement ........................... Automatic Echogram Detection .................
728 729 730 730
20. EM and SAGE Algorithms for Towed Array Data ...............
733
20.1
Introduction .............................................................
733
20.2
Signal Model ...........................................................
734
20.3
EM and SAGE Algorithms ...................................... 20.3.1 EM Algorithm ............................................. 20.3.2 SAGE Algorithm ........................................
736 736 739
20.4
Fast EM and SAGE Algorithms ..............................
741
20.5
Recursive EM and SAGE Algorithms ..................... 20.5.1 Recursive EM Algorithm ............................ 20.5.2 Recursive SAGE Algorithm .......................
742 743 745
20.6
Experimental Results .............................................. 20.6.1 EM and SAGE Algorithms ......................... 20.6.2 Recursive EM and SAGE Algorithms ........
746 747 749
20.7
Conclusions ............................................................
751
21. The Common Reflection Surface (CRS) Stack – a Datadriven Space-time Adaptive Seismic Reflection Imaging Procedure ...........................................................................
755
21.1
Introduction .............................................................
755
21.2
Seismic Reflection Imaging .................................... 21.2.1 The Seismic Wavefield .............................. 21.2.2 Acquisition of Reflection Seismic Data ...... 21.2.3 Seismic Reflection Processing ..................
756 756 758 762
21.3
Common Reflection Surface Stack ......................... 21.3.1 Classic Data-driven Approaches ............... 21.3.2 Second-order Traveltime Approximations .. 21.3.3 Physical Interpretation of the Coefficients ... 21.3.4 Implementation .......................................... 21.3.5 Practical Aspects .......................................
766 767 768 769 771 772
This page has been reformatted by Knovel to provide easier navigation.
Contents
xix
21.3.6 A Synthetic Data Example .........................
773
21.4
CRS Attributes and Velocity Model Estimation .......
775
21.5
Conclusions ............................................................
777
21.6
Glossary .................................................................. 21.6.1 List of Variables ......................................... 21.6.2 Specific Terminology .................................
778 778 779
Part IX.
Space-time Techniques in Communications
22. STAP for Space/Code/Time Division Multiple Access Systems ..............................................................................
785
22.1
Introduction .............................................................
785
22.2
System Model .........................................................
789
22.3
Time Domain Linear Joint Detection ....................... 22.3.1 Zero Forcing Block Linear Equalisation ..... 22.3.2 Minimum Mean Square Error Block Linear Equalisation ....................................
791 792
22.4
Frequency-domain Linear Joint Detection .............. 22.4.1 Block-diagonal FD System Model ............. 22.4.2 FD ZF-BLE and MMSE-BLE ......................
793 793 796
22.5
Performance of FD Joint Detection ......................... 22.5.1 Exploitation of Spatial and Frequency Diversity ..................................................... 22.5.2 Intracell Interference Cancellation ............. 22.5.3 Intra- and Intercell Interference Cancellation ...............................................
797 798 804
22.6
Conclusions ............................................................
821
22.7
List of Variables ...................................................... 22.7.1 Variables with Roman/Calligraphic Letters ....................................................... 22.7.2 Variables with Calligraphic Letters ............ 22.7.3 Variables with Greek Letters .....................
822
This page has been reformatted by Knovel to provide easier navigation.
793
813
822 823 823
xx
Contents
23. Underwater Communication with Vertical Receiver Arrays .................................................................................
827
23.1
Introduction .............................................................
827
23.2
The Underwater Acoustic Channel ......................... 23.2.1 Transmission Loss and Ambient Noise ..... 23.2.2 Sound Speed Variability ............................ 23.2.3 Multipath Propagation ............................... 23.2.4 Doppler Effect ............................................ 23.2.5 Summary ................................................... Underwater Acoustic Communications – a Brief Overview ................................................................. 23.3.1 Incoherent Digital Receivers ...................... 23.3.2 Coherent Digital Receivers ........................
828 828 829 830 831 832
23.4
Spatial-temporal Receiver Architecture .................. 23.4.1 Communication Over Channels with ISI .... 23.4.2 Multichannel Digital Receiver .................... 23.4.3 Signal Model .............................................. 23.4.4 Multichannel Equalisation ..........................
834 834 835 837 839
23.5
Multichannel Constant Modulus Algorithm ............. 23.5.1 Blind Stochastic Gradient Descent Algorithms .................................................. 23.5.2 The Constant Modulus Algorithm .............. 23.5.3 Experimental Results ................................
841 841 842 844
23.6
Super-exponential Blind Equalisation ..................... 23.6.1 Iterative Shalvi-Weinstein Algorithm .......... 23.6.2 Recursive Shalvi-Weinstein Algorithm ....... 23.6.3 Adaptive Implementation ........................... 23.6.4 Experimental Results ................................
847 847 849 850 853
23.7
Concluding Remarks ..............................................
853
23.3
24. Reduced-rank Interference Suppression and Equalisation for GPS and Downlink CDMA ............................................. 24.1 Reduced-rank Interference Suppression and Equalisation ............................................................ This page has been reformatted by Knovel to provide easier navigation.
832 832 833
857 857
Contents 24.1.1 Motivation for Reduced-rank MMSE Processing ................................................. 24.1.2 Understanding the Multistage Wiener Filter .......................................................... 24.1.3 Lattice Structure of the MSWF .................. 24.1.4 MSWF Related to Wiener-Hopf Filter Weights .....................................................
xxi 857 858 861 862
24.2
Application of MSWF to CDMA Downlink ............... 24.2.1 Introduction ................................................ 24.2.2 Data and Channel Model ........................... 24.2.3 Edge of Cell/Soft Hand-off ......................... 24.2.4 Chip-level MMSE Estimator ....................... 24.2.5 Performance Examples .............................
24.3
Application of MSWF to GPS Jammer Suppression ............................................................ 24.3.1 Introduction ................................................ 24.3.2 Power Minimisation and Joint Spacetime Preprocessing .................................... 24.3.3 Space-time Filter Characteristics ............... 24.3.4 Data and Channel Model ........................... 24.3.5 Dimensionality Reduction Techniques ...... 24.3.6 Performance Examples .............................
871 872 873 875 876
Summary of Concepts Involving Reduced-rank Filtering ...................................................................
879
25. Introduction to Space-time Coding .....................................
883
24.4
864 864 865 866 866 868 871 871
25.1
Introduction .............................................................
883
25.2
Multiple Antenna Channel Model ............................
885
25.3
Benefits of Smart Antenna Technology .................. 25.3.1 Array Gain ................................................. 25.3.2 Diversity Gain ............................................ 25.3.3 Multiplexing Gain ....................................... 25.3.4 Interference Reduction ..............................
887 887 888 891 893
This page has been reformatted by Knovel to provide easier navigation.
xxii
Contents 25.4
Background on Space-time Codes ......................... 25.4.1 Space-time Trellis Codes .......................... 25.4.2 Linear Space-time Block Codes ................
894 895 897
25.5
New Design Criteria ................................................ 25.5.1 Error Performance ..................................... 25.5.2 Capacity Performance ............................... 25.5.3 Unified Design ...........................................
898 899 900 901
25.6
Receiver Design ..................................................... 25.6.1 Modulation and Coding for MIMO .............
905 905
25.7
Concluding Remarks ..............................................
906
Index .................................................................................. 909
This page has been reformatted by Knovel to provide easier navigation.
Section A
Suppression of clutter in moving radar
Parti
Space-slow time processing for airborne MTI radar
Chapter 1
Space-time adaptive processing for manoeuvring airborne radar Peter G. Richardson
1.1
Introduction
Since the early 1970s, STAP (space-time adaptive processing) methods have been actively considered for look down airborne radar where target signals have to compete with strong ground clutter returns. Most previous STAP research has been devoted to SLAR (sideways looking airborne radar) applications where the plane of the receiving antenna is coaligned with the direction of travel. For this type of antenna configuration, a linear relationship between the angular location and Doppler frequency of the clutter can be exploited to allow clutter rejection and enhanced signal detectability via twodimensional filtering in the spatial and temporal frequency domains. Appropriate filters can be realised via the sampling of a coherent pulse train with a phased array antenna. Non-adaptive filter weight solutions which theoretically achieve full clutter suppression in SLAR correspond to the well known DPCA (displaced phase centre antenna) technique, e.g. see References 1 and 16. STAP offers the advantage over DPCA that the filter weights are calculated adaptively. This leads to robustness in the presence of errors, e.g. amplitude and phase mismatch errors between channels, or drift in the platform velocity. STAP also offers the capability to simultaneously suppress jamming and clutter. Over the last ten years there has been growing interest in applying STAP techniques for clutter suppression in antenna orientations other than sideways looking. These include forward-looking array geometries where the plane of the array is transverse to the direction of travel [2-^], inclined looking array applications [5,6] and circular arrays [7]. In these cases, the plane of the receiving antenna is not coaligned with the direction of travel, and hence there is no longer a linear dependence between the clutter Doppler and spatial frequencies. The implication of this is that STAP cannot provide the full clutter cancellation that is theoretically possible in SLAR. However,
a major advantage of STAP over conventional MTI (moving target indication) and Doppler filtering approaches is that it offers the capability for detecting slow moving targets, i.e. targets lying within the Doppler bandwidth of mainlobe clutter. Analysis and simulations performed in Reference 2 demonstrated that a sideways looking geometry is not a prerequisite to achieving this. Further improvements in detection of targets, that are masked by either mainlobe or sidelobe clutter, can be achieved by adapting in a range-dependent, or Doppler-dependent manner. Examples of rangedependent STAP can be found in References 4 and 7. Examples of Doppler dependent, or post-Doppler, STAP can be found in Reference 7 and Chapter 9 of Reference 8. SLAR related STAP research is often directed at applications where the airborne radar platform is very large and stable, and the effects of platform manoeuvre can be assumed to be small. Typical examples are AEW (airborne early warning) radar [9-11 ] and SAR (synthetic aperture radar) [12]. In contrast, in forward-looking applications the array antenna is likely to be located in the nose of a relatively small and highly manoeuvrable airborne platform, e.g. as in AI (airborne intercept) radar. In these cases, the radar may be required to function while the platform is performing a steep dive or rolling at a significant rate, and any assumption that platform manoeuvre effects are negligible is less easy to justify. In this chapter we will assess the benefits of using STAP for simultaneously suppressing clutter and jamming in forward-looking phased array geometries. We will initially analyse the clutter suppression problem and show how significant rejection of both mainlobe and sidelobe clutter is achievable using appropriate STAP approaches. This will include a brief consideration of the effects of variations in the platform orientation (rather than the array orientation) on clutter suppression and slow moving target detection. The effects of manoeuvre (e.g. platform yaw, pitch or roll) on clutter and jammer suppression will then be examined and the relative merits of various approaches for compensating for platform manoeuvre will be assessed.
1.2
STAP fundamentals
Throughout this chapter we will consider a pulse-Doppler airborne radar where a coherent burst of M pulses are transmitted at a pulse repetition interval r. We will assume a phased array receive antenna consisting of N elements. The data received by the array at a time t can then be represented by the space-time snapshot vector: x(t) = [x\ (t), x2(t), X 3 (O,-.., xM(t)]T = [xi(t),xi(t
- r),xi(t - 2 r ) , . . . 9xx(t - (M - l ) r ) f e CMNxl
(1.1)
where xm(t) e CNxl is used to denote the spatial snapshot of data corresponding to the (M — m + l)th pulse repetition interval (PRI). In large phased array applications, the cost and complexity associated with digital adaptive processing at element level leads to the need to reduce the number of spatial channels. This reduction is commonly achieved by analogue beamforming of subarrays of elements prior to digitisation, e.g. see References 2, 4 and 8, Chapter 6.
For a system with K subarrays, the spatial channel reduction can be described mathematically by the NM by KM transformation matrix T:
(1.2)
where IM is the M by M identity matrix, Ts is the N by K spatial transformation matrix (K < N) and (g) represents the Kronecker matrix product. The transformed (KM by 1) space-time snapshot vector is then: xT(t) = THx(t)
(1.3)
where the superscript H denotes the Hermitian transpose operator. It is well known that the subarray level STAP filter weights that maximise the output signal-to-noise-plus-interference ratio (SNIR) are given by: w = kQ^sT(0,(/>,fD) = k[THQT]-lTHs(6,(f>,fD)
(1.4)
KMxKM
where k is an arbitrary scalar, QT e c is the covariance matrix of the transformed (subarray level) interference plus noise data, Q e cNMxNM is the corresponding covariance matrix for element level data, sj(#, 0, /b) is the subarray level steering vector for the target signal Doppler frequency / D and direction of arrival (0,0), and s(0,0, / b ) is the corresponding element level steering vector for the target signal. The covariance matrix QT must be estimated from the incoming data and this is usually achieved by forming the maximum likelihood estimate: (1.5) where S is the number of weight training data samples employed. It is usual to collect training data from range samples (sometimes referred to as fast time samples) that neighbour the range (or ranges) at which the adaptive weights are applied. Assuming data that are jointly Gaussian, independent and identically distributed, the value of S must exceed 2KM — 3 ~ 2KM to ensure that the expectation of the ratio of the adaptive SNIR to optimum SNIR is greater than 0.5 (i.e. the loss due to covariance matrix estimation is less than 3 dB) [13]. To determine the optimal subarray weights in equation (1.4), we clearly need to collect data from all M pulses. However, for large values of M it is unlikely that there will be sufficient weight training data available to support the adaptive weight calculation. In addition, the estimation and inversion of a KM by KM covariance matrix may not be possible in real time. It is therefore almost always necessary to reduce the number of temporal channels within the STAP architecture. This can be achieved using pre-Doppler STAP, where a space-time adaptive filter with a small number of tap delays is used as a prefilter to conventional Doppler processing, or by using post-Doppler STAP, where STAP with a small number of temporal or Doppler channels is employed after Doppler processing. Further details of these approaches
can be found in References 8 and 14 and will not be repeated here. It should be noted that in Reference 8 the pre-Doppler STAP approach is referred to as 'space-time FIR filtering'. Although pre-Doppler STAP is usually the more computationally efficient of the two methods, the post-Doppler STAP approach is often found to provide the more effective clutter suppression. In this chapter, most consideration will be given to pre-Doppler STAP implemented at subarray level in a large circular planar array in a forward facing geometry. With this architecture, clutter and jamming suppression can be achieved simultaneously by adaptively combining the outputs of the K spatially separated subarrays and L (with L <$C M) temporally separated pulse returns. However, a further stage of conventional range-Doppler processing over M-L +1 pulses is necessary to recover the coherent processing gain for the desired signal. In pre-Doppler STAP, the adaptive weight solution is given by equation (1.4) with QT now being the KL by KL covariance matrix of the data and Sj(O9 0, / D ) now being the corresponding KL by 1 signal steering vector. The anticipated signal direction is known to within a transmit beamwidth accuracy, but in many practical cases information on the target Doppler frequency is unavailable. In these cases, the STAP calculation must either be repeated for a large number of trial signal Doppler frequencies or the calculation must be modified to exploit the a priori knowledge of the signal direction alone. The latter can be achieved using a linearly constrained power minimisation weight calculation where linear constraints that utilise the available information on the signal direction of arrival are specified. If the constraint equations are given in matrix form by: CHw=f
(1.6)
where C is the constraint matrix a n d / is the vector composed of the right-hand side values of the equations, then the optimal solution for w becomes: (1.7) Note that if we have a single constraint matched to the signal Doppler frequency and angular location, then equation (1.7) is identical to the maximum SNIR solution given in equation (1.4) with
In the absence of signal Doppler information, it is appropriate to use a constraint that exploits knowledge of the transmit beam look direction. This can be achieved using the approach described in Reference 15 whereby the spatial beamforming weights at one tap of the space-time filter are constrained using a constraint vector of the form: (1.8) where ep is the L by 1 constraint vector with unity value at the /7th element and zeroes elsewhere and S5(O9 (J)) is the A' by 1 spatial steering vector. This type of clamped tap constraint tends to bias the solution towards one which provides a uniform response
in Doppler at the beam look direction. However, it cannot prevent signal suppression in cases where the desired signal power is significantly above the background noise level. If the weights at the first tap are constrained, the approach is mathematically equivalent (apart from an arbitrary scaling factor) to the least-squares space-time FIR (finite impulse response) filtering approach described in Chapter 7 of Reference 8.
1.3
Clutter angle-Doppler relationships
1.3.1 Straight and level flight The shape and extent of the clutter domain within the multi-dimensional sampling space associated with space-time filtering provides a useful insight into the magnitude of the clutter rejection problem. For space-time filtering implemented in a planar array, the clutter spectrum is confined to a three-dimensional sampling space defined by the temporal (Doppler) frequency component, / D , the azimuthal spatial frequency component, / u and the elevation spatial frequency component / v . Consider a regular planar array of elements in the airborne geometry shown in Figure 1.1. The radar platform is travelling parallel to the ground at constant velocity v with the velocity vector at an azimuth angle \j/ relative to the x-axis. The receiving array is located in the y-z plane with the antenna normal parallel to the x-axis. The angular location of the clutter scatterer S is defined by the azimuth angle 0 and elevation angle (declination in this case) 0. Assuming the receiving array is regular with horizontal interelement spacing du and vertical spacing dy, we can then define normalised Doppler and spatial frequencies for S:
(1.9)
Figure 1.1 Airborne radar geometry - straight and level flight
where normalisation has been carried out with respect to the sampling frequencies. Using equation (1.9), it is easily shown that the relationship between the Doppler frequency / b and spatial frequencies / u , / v is given by: (1.10) where /3U = 2vr/du and /3y = 2vr/dv. Equation (1.10), which defines an ellipsoid, holds for all clutter scatterers, regardless of the scatterer location S. It therefore follows that clutter collected from all ranges and all angles is confined to the surface of an ellipsoidal bowl with the major axis, in general, cutting diagonally through the three-dimensional sampling space. Maximum eccentricity arises as the geometry tends towards the sideways looking case (i.e. ^r -> 90°), with the bowl degenerating to a plane in the limit (\fr = 90°). In this case, the simple linear relationship between / u and / D can be exploited to achieve full clutter suppression. Minimum eccentricity arises in the case of a forward-looking array (i.e. \j/ = 0°). The clutter surface that results for a forward facing array geometry with clutter unambiguous in Doppler is shown in Figure 1.2. Note that there is an implicit narrowband assumption here (i.e. k can be assumed to be constant). For finite bandwidths the clutter bowl has finite thickness. In Figure 1.2 far range returns (shallow elevation angle) correspond to the rim of the clutter bowl, whereas short range returns correspond to the bottom of the bowl. It has been assumed that the antenna has a negligible backlobe response, and hence only that part of the bowl corresponding to returns emanating from forward of the array is shown. The bowl corresponds to all clutter returns (both mainlobe
Figure 1.2
Clutter bowl -forward-looking geometry, straight and level flight
and sidelobe) received by the array. For cases where a narrow beam is scanned away from array broadside at a shallow grazing angle to ground, the mainlobe clutter corresponds to a small patch on the bowl surface as shown in Figure 1.2. Slow moving targets are likely to lie within the spatial and Doppler bandwidth of mainlobe clutter, but will usually be distinct from the bowl surface as also shown in Figure 1.2. Two-dimensional filtering is therefore appropriate for separating the targets from the clutter.
1.3.2 Effect of variations in platform orientation The effect of changing the orientation of the radar platform, relative to the ground, is merely to cause a rotational transformation of the coordinate system shown in Figure 1.2. Providing that the velocity vector remains in the same fixed position relative to the array face, the shape and total extent of the clutter is unaffected by the transformation, i.e. the clutter is still confined to the surface of an ellipsoidal bowl. This is of significance for a manoeuvring platform as it implies that any change in the platform orientation that takes place between adaptive processing intervals will not significantly change the clutter suppression problem. However, it should be noted that stationarity is assumed within the adaptive processing and any changes in the clutter angle-Doppler characteristics within this interval will have a detrimental effect. In addition, the distribution of sidelobe clutter power does change with platform orientation, e.g. clutter returns that previously corresponded to the backlobes of the antenna could be moved into the beam sidelobe region. An example is shown in Figure 1.3 for the extreme case where the radar platform is diving directly at the ground (i.e. a 90° dive). All of the ground is now visible to the receiving antenna, and hence the clutter covers the full surface of the bowl.
Figure 1.3 Clutter bowl - diving platform
1.4
Clutter suppression in forward-looking radar
1.4.1 Mainlobe clutter suppression Ideally, to achieve full clutter suppression, we require a single STAP weight solution which places a null response over the entire surface of the clutter bowl and maintains a reasonable gain at the target location in angle and Doppler. Although a STAP solution of this type does not exist, adequate control of sidelobe clutter can often be achieved by maintaining low sidelobe levels on both transmit and receive. The problem that then remains is detection of slow moving targets possessing a low radial velocity (i.e. targets which have only a small component of velocity in the direction of the receiving radar) as these are often indistinguishable in Doppler from the mainlobe ground clutter returns. Scenario geometries involving crossing targets, e.g. as shown in Figure 1.4, are particular cases where the slow moving target detection problem occurs. In many practical applications, mainlobe clutter corresponds to only a small patch on the bowl surface as depicted in Figure 1.2. In these circumstances it is usually possible to produce a null response over the mainlobe clutter patch, while maintaining a high response to slow moving targets, using STAP with small numbers of spatial and temporal degrees of freedom. This is extremely important as slow moving targets that lie within the Doppler and spatial extent of mainlobe clutter cannot be detected using conventional Doppler processing approaches or by maintaining low beampattern sidelobe levels. Details of a mechanism by which the mainlobe clutter cancellation can be achieved using a space-time filter implemented in a forward-looking linear array of sensors are given in Reference 2. For a linear array geometry, the clutter rejection problem becomes two-dimensional and it is appropriate to consider the projection of the clutter bowl onto the / u , / D plane. At shallow grazing angles, the mainlobe clutter becomes confined to an arc close to the perimeter of the resulting elliptical clutter domain within the two-dimensional sampling space. An approximate linear relationship between
platform velocity v
tncget velod^
Figure 1.4 Forward-looking radar - slow moving target geometry
/ u and / D can then be exploited (see Reference 2) to produce a null along the mainlobe clutter arc while maintaining an adequate response to slow moving targets possessing the same Doppler frequency as the clutter. In the analysis in Reference 2, it is assumed that the sensors have virtually identical responses (to within a scaling factor) for clutter scatterers within the main beam footprint. Using the additional assumption that the transmit beam is at a shallow grazing angle to the ground, it is then shown that the space-time filter response can be rendered virtually independent of the mainlobe clutter scatterer location if the sensor spacing d satisfies: d = 2vrtan(f)o
(1.11)
where 0o is the beam scan direction in azimuth. It then follows that a null response to mainlobe clutter can be achieved using a very simple space-time filter comprising two sensors with two taps per spatial channel by subtracting the return from one sensor from the return received one PRI earlier at the other sensor. In Reference 2 the sensor spacing condition given by equation (1.11) is referrred to as a 'localised DPCA condition' as it is analogous to the condition d = 2vx required for range-ambiguous DPCA clutter cancellation in SLAR and downwards looking radar [16]. An important difference is that, in the forward-looking airborne radar case, the condition is dependent on azimuth scan angle implying that, for a fixed antenna, the PRI must be changed with the beam steer direction. However, in STAP the two phase centre locations required to satisfy equation (1.11) can be synthesised adaptively and hence the PRI restriction no longer exists. It should be noted that for broadside steer (i.e. 0 = 0°) equation (1.11) leads to a required sensor spacing of zero, thus implying that conventional MTI (moving target indication) filtering is virtually optimal. It is in scenarios where the beam is at large scan angles that STAP offers the most significant advantages over conventional MTI clutter rejection, as it is in these cases that the mainlobe clutter encompasses a large Doppler spread and is most likely to mask targets of interest. The potential benefits of using STAP for slow moving target detection in forwardlooking airborne radar are illustrated in Figures 1.5 and 1.6. The surface plots show the range-Doppler detection maps that resulted from simulations of a radar operating at an altitude of 5 km in a medium PRF (pulse repetition frequency) mode where data are both range and Doppler ambiguous. The receiving antenna was a circular planar array consisting of 2029 elements. The radar beam was steered at a declination of 5° and scanned off at an angle of 60° from broadside to the array. A slow moving target, lying within the Doppler bandwidth of mainlobe clutter, was located at the beam steer direction. The range-Doppler map that resulted from applying conventional beamforming and Doppler processing to a burst of 16 pulses is shown in Figure 1.5. The slow moving target is masked by mainlobe clutter which is evident as a ridge centred at zero Doppler. The result obtained using pre-Doppler STAP with M = 16 (pulses), L = 2 (taps) and K = 16 (subarrays), with the clutter covariance matrix estimated from all range samples available within coherent processing interval, is shown in Figure 1.6. In this case, the mainlobe clutter has been suppressed leaving the slow moving target clearly evident. For the STAP result, the vertical stave subarray scheme shown in Figure 1.7 was employed. The result therefore confirms that elevation degrees of
range Doppler
Figure 1.5
Range-Doppler map - conventional output, shallow grazing angle scenario (from [17J)
target
range Doppler
Figure 1.6
Range-Doppler map - 2 tap STAP, 16 vertical stave subarrays, shallow grazing angle scenario (from [17J)
freedom are unnecessary to achieve slow moving target detection in scenarios where the beam is at a shallow grazing angle to the ground. In radar geometries where the beam is at a steep grazing angle to the ground, the mainlobe clutter patch is close to the bottom of the bowl and the Doppler
Figure 1.7
Circular planar array partitioned into 16 vertical stave subarrays
frequency, / D , becomes dependent on both azimuth and elevation spatial frequencies /u> / v Consequently, to achieve slow moving target detection, a planar array offering azimuth and elevation degrees of freedom is required [17]. Elevation degrees of freedom are also important for rejection of range-ambiguous clutter [3]. The advantage to be gained through having elevation degrees of freedom in forward-looking airborne radar is illustrated in Figures 1.8 and 1.9. The results are again for a medium PRF scenario, but now with the radar beam steered at a declination of 30° and azimuth of 54°. The simulated data was processed using pre-Doppler STAP with three taps per subarray channel. Figure 1.8 shows the range-Doppler map obtained using the vertical stave scheme shown in Figure 1.7. The lack of vertical degrees of freedom has, in this case, led to poor mainlobe clutter rejection and residual clutter is evident in the range-Doppler map. Figure 1.9 shows the corresponding result for the array partitioned into 16 subarrays in the chequerboard type configuration shown in Figure 1.10. In this case the combination of both elevation and azimuthal degrees of freedom has led to the clutter being successfully rejected leaving the slow moving target clearly visible. Simulation results illustrating that STAP slow moving target detection performance is not sensitive to variations in the platform orientation are shown in Figures 1.11 and 1.12. These results correspond to the case of a radar platform diving directly at the ground (i.e. a 90° dive). The radar beam was again scanned to a direction of 60° away from broadside, thus causing the mainlobe clutter to be extended in Doppler. The range-Doppler map that resulted from conventional beamforming and Doppler processing is given in Figure 1.11. In comparison with the previous
range Doppler
Figure 1.8
Range-Doppler map - 3 tap STAP, 16 vertical stave sub arrays, steep grazing angle scenario (from [17J)
target
range Doppler
Figure 1.9
Range-Doppler map - 3 tap STAP, 16 chequerboard subarrays, steep grazing angle scenario (from [17J)
Figure 1.10
Circular planar array partitioned into 16 chequerboard subarrays
range Doppler
Figure 1.11 Range-Doppler map - conventional output, steep dive scenario (from [17])
target
range Doppler
Figure 1.12
Range-Doppler map - 3 tap STAP output, steep dive scenario (from [17])
results, the mainlobe clutter is foreshortened in range due to the extremely steep grazing angle of the beam. However, the slow moving target is obscured because it is range-ambiguous with the mainlobe clutter and lies within the mainlobe clutter bandwidth Doppler. Figure 1.12 shows the result of applying pre-Doppler STAP using the chequerboard subarray configuration shown in Figure 1.10 with three taps per subarray channel. The mainlobe clutter has again been rejected to reveal the slow moving target.
1.4.2 Sidelobe clutter suppression In low altitude scenarios, the interference suppression afforded by the transmit and receive beam sidelobes may be insufficient to allow detection of targets that compete in both range and Doppler with sidelobe clutter. Short range clutter, emanating from the nadir region, can be particularly dominant and may mask targets of interest in range-ambiguous modes of operation. There is therefore considerable interest in STAP techniques that can provide suppression of both mainlobe and sidelobe clutter. To achieve full clutter suppression using space-time filtering in forward-looking airborne radar requires a weight solution that can place a null over the full surface of the clutter bowl. Although this is not generally possible, significant levels of rejection of both mainlobe and sidelobe clutter can be achieved with planar arrays offering very high levels of digitisation. In these cases, STAP solutions providing a low response over large regions of the clutter bowl are realisable. Simulation results that demonstrate this for a small 61 element hexagonal array are shown in
range
Doppler
Range-Doppler image - conventional output, 61 element planar array
range
Figure 1.13
Doppler
Figure 1.14
Range-Doppler image - 4 subarray, 3 tap STAP output, 61 element planar array
Figures 1.13, 1.14 and 1.15. The results are for a medium PRF scenario with the radar platform at a height of 300 m and the beam scanned to an angle 45° away from broadside. Two adaptive array architectures were considered in the simulations. In the first, the array was partitioned into four quadrant subarrays and the processing was carried out at subarray level. In the second architecture, the adaptive processing was performed at element level. Figure 1.13 shows the range-Doppler image obtained from conventional beamforming and coherent integration of 64 pulses. A slow moving target is masked by a band of mainlobe clutter that covers all ranges. There are also significant levels of
range
Doppler
Figure 1.15
Range-Doppler image - 61 spatial channel, 3 tap STAP output, 61 element planar array
sidelobe clutter evident in the range-Doppler image and this has masked a target with a higher relative velocity. Figure 1.14 shows the result of using three tap pre-Doppler STAP applied at subarray level with the adaptive weights calculated using a clamped tap constraint (as described in Section 1.2) and data collected over the full ambiguous range interval. In this case STAP has just rendered the slow moving target visible, but the fast target is still masked by residual sidelobe clutter. It is also apparent that adapting to reject the mainlobe clutter has caused a raising of the thermal noise level. The slow moving target SNIR value estimated directly from the range-Doppler detection map using a simple cell averaged CFAR (constant false alarm rate) scheme was 17.3 dB. The result illustrates that slow moving target detection is possible using STAP with very small numbers of spatial channels. Figure 1.15 shows the result of applying three tap pre-Doppler STAP at element level (i.e. using all 61 spatial channels). In this case, significant rejection of both mainlobe and sidelobe clutter has been achieved and both targets are now clearly visible. Target SNIR values estimated directly from the range-Doppler detection map were 17.8 dB for the slow moving target and 19.5 dB for the fast target. It should be noted that this level of performance has been achieved without resorting to range or Doppler-dependent STAP approaches. The clutter suppression performance of computationally efficient STAP techniques for large element digitised phased arrays is compared in Reference 18. Sidelobe clutter can be widely spread in angle and Doppler, and is difficult to suppress using subarrayed adaptive processing. Although it is not possible to form extended regions of low response in the angle-Doppler domain, the clutter rejection can be improved by sequentially adapting over different regions of the clutter bowl. This can be achieved by adapting in either a range dependent or Doppler dependent manner. The disadvantage is that fewer training data samples are available for
Figure 1.16
Clutter bowl partitioned into range intervals
covariance matrix estimation, i.e. S is reduced in equation (1.5). It is also possible to use a combination of range and Doppler-dependent adaptation, but this further limits the amount of available training data. The principles of the range and Dopplerdependent approaches are briefly described below. Figure 1.16 shows the clutter bowl partitioned into regions associated with different range intervals. It is apparent that adapting to data corresponding to each interval in turn leads to a reduction in the angle-Doppler region over which clutter rejection is required. For example, at long ranges the clutter from a particular range interval corresponds to a very narrow annular ring that is elliptical in the / u , / D domain. The clutter can then be adaptively rejected using spatial filtering alone, e.g. see Reference 19, or by using STAP to form an elliptical null in the corresponding / u , / D plane, e.g. see References 3 and 4. It should be noted that the former approach relies on a planar array with elevation degrees of freedom, which allow spatial nulls to be formed at particular elevation angles, and is not appropriate for detecting targets masked by mainlobe clutter. The potential benefits of using range-dependent STAP can be deduced from examining the way that the ground clutter returns are sampled. Figure 1.17 shows a linear array of sensors, with interelement spacing, d, in a forward-looking geometry. The radar platform is moving at velocity v parallel to the x-axis. The returns from the ground are sampled using a space-time filter with M taps per spatial channel with the tap delay equal to the radar PRI r. If we now consider the sampled ground returns (i.e. ground clutter) alone, then the space-time filter is equivalent to a virtual planar array with y-dimension spacing d and x-dimension spacing 2ur as shown in Figure 1.17. Returns from clutter at a single range lie at a constant cone angle from the array centre. Range-dependent clutter suppression therefore requires nulls to be formed at a fixed cone angle, y, from the equivalent planar array. It is well known that nulls of this type can be synthesised using circular array geometries. Hence rangedependent clutter suppression is possible using space-time filter weights that lead to
rangs iing
clutter
Figure 1.17
Equivalent spatial planar array, STAP in forward-looking airborne radar
the equivalent planar array being circular. The configuration of the two-dimensional array will, in general, be different for moving targets and hence desired signals will not be attenuated to the same degree as clutter. Only azimuthal and temporal degrees of freedom are employed in the space-time filtering approach shown in Figure 1.17. However, in practice, the nulls required for clutter suppression will have a finite width due to the limited range resolution associated with the transmitted pulse width. In low-altitude scenarios, the ground region associated with the shortest range returns can have a particularly large extent in elevation, and clutter suppression is therefore rendered difficult with a twodimensional filter operating in the / u and / D domain. Additional complications arise where the clutter is range ambiguous, as a circular null is then required for each ambiguous range ring. Some of the far range returns will be ambiguous with short range clutter covering significant areas of the angle-Doppler domain. Although it is possible to form concentric nulls in cases where there are large numbers of azimuthal and temporal degrees of freedom, the extended region over which rejection is required is likely to also lead to target suppression. Better performance is therefore achievable with range-dependent STAP implemented in a planar array offering elevation degrees of freedom. It is also interesting to note that for STAP implemented in a planar array, the equivalent spatial array shown in Figure 1.17 becomes a volume array. The implication of this is that nulls covering extended range regions are realisable, and hence the number of range intervals requiring independent adaptation can be greatly reduced. Figure 1.18 shows the clutter bowl partitioned into regions associated with different Doppler intervals. In this case the clutter for each Doppler interval corresponds to an annular ring that is elliptical in the / u , / v plane. Isolation of clutter into distinct Doppler bins can be achieved by carrying out full Doppler filtering prior to, rather than after, STAR Doppler-dependent STAP is usually referred to as post-Doppler STAP as it entails carrying out STAP after Doppler filtering.
Figure 1.18
Clutter bowl partitioned into Doppler intervals
If we assume idealised Doppler filtering with no sidelobe leakage of clutter into adjacent Doppler bins, then the clutter in each Doppler bin can be rejected using a spatial filter operating in the / u , / v domain. Clutter at a single Doppler frequency will be at a fixed cone angle from broadside to the array, and it follows that for clutter suppression, we require an elliptical null (semi-elliptical for straight and level flight) in the / u , / v domain. However, in practice, the Doppler filter sidelobe responses must be controlled using carefully chosen Doppler windowing functions. This leads to poorer Doppler resolution, which may necessitate the use of space-time filtering solutions in each Doppler bin. In addition, Doppler ambiguous clutter leads to a requirement for concentric spatial nulls. This can be mitigated using additional temporal (or Doppler) degrees of freedom in an analogous manner to the way elevation degrees of freedom can be used to counter the effects of range ambiguities in range-dependent STAR The simplest post-Doppler STAP approach of spatial adaptive beamforming after Doppler processing is often referred to as factored STAR It should be noted that for linear arrays in forward-looking geometries, clutter corresponding to a small Doppler interval can cover a significant extent in the spatial frequency (/ u ) dimension, and hence the benefits of using the post-Doppler STAP approach are unclear. In the following sections we will concentrate mainly on the effects of platform motion on slow moving target detection and jammer rejection. Range-dependent and Doppler-dependent STAP techniques, designed to enhance the rejection of strong sidelobe clutter, will therefore not be considered further.
1.5
Slow moving target detection under conditions of manoeuvre
1.5.1 Effects of platform manoeuvre In forward-looking radar applications, it is often necessary to detect and track targets while the radar platform is undergoing high rates of manoeuvre. The platform
ep 'ssoi >IINS 2 tap STAP 3 tap STAP
roll rate, degs/PRI
Figure 1.19
Loss in SNlR as a function of roll rate, slow moving target scenario (from [17])
motion may typically take the form of rapid yaw, pitch or roll. If there is no motion compensation, the mainlobe clutter extent within the three-dimensional STAP sampling space is increased. The spreading is due to both the movement of the receiving array and the transmit beam. Simulation results showing the effects of platform roll on STAP slow moving target detection have previously been presented in Reference 17. The results, showing the loss in the output SNIR for a forward-looking airborne radar operating at an altitude of 5 km, are summarised in Figure 1.19. The curves shown are forpre-Doppler STAP architectures with two and three taps per subarray channel implemented in the chequerboard subarray scheme shown in Figure 1.10. The scenario geometry and radar waveform parameters were identical to those used to produce Figure 1.6. The adaptation was carried out using all available range samples with the STAP weights updated every PRI in an attempt to compensate for the effects of motion. The SNIR values were estimated directly from the range-Doppler maps using a simple cell averaged CFAR scheme. The curves in Figure 1.19 show the loss in SNIR (relative to the optimal value) as a function of roll rate. The results indicate that roll rates as small as 0.005° per PRI have significantly reduced slow target detection performance in this case, despite the fact that the adaptive weights were updated at the PRI rate. However, it should be noted that the effects of motion have been accentuated here by the simplified quantised transmit beampattern employed within the clutter model.
1.5.2 Motion compensation The effects of the platform motion on mainlobe clutter rejection can be reduced by motion compensating the beam steering to ensure that the same region of ground is illuminated by the radar main beam throughout the coherent processing interval. This ensures that both the transmit and receive beams are motion stabilised. The technique can be applied effectively in both pre-Doppler and post-Doppler STAP approaches.
target
range Doppler
Figure 1.20
Range-Doppler map - 3 tap STAP output, 0.01° /PRI platform yaw, PRI weight updates
Simulation results showing the effectiveness of the approach for a radar platform yawing at a rate of 0.010° per PRI are shown in Figures 1.20 and 1.21. For adaptive suppression of the clutter, a pre-Doppler STAP algorithm with three taps per subarray channel was implemented in the chequerboard subarray scheme shown in Figure 1.10. Figure 1.20 shows the range-Doppler map produced when the adaptive weights were updated every PRI. The effect of adapting to clutter and the platform rotation has significantly reduced the SNIR from the optimal level of 32 dB for this scenario. The output SNIR estimated from the range-Doppler map in this case was 15.4dB. The result obtained using motion-compensated beam steering with the beam resteered at the PRI rate is shown in Figure 1.21, and it is clear that more effective clutter suppression has been achieved. The SNIR estimated from the range-Doppler map shown in Figure 1.21 was 28.9 dB, an improvement of 13.5 dB. It should also be noted that this result was achieved using a single adaptive weight vector, calculated from data collected over the full coherent processing interval, rather than by updating the adaptive weights at the PRI rate. Motion-compensated beam steering is only effective for compensating for the effects of motion on signals within the mainlobe of the radar beam. The motioninduced angle-Doppler spreading of sidelobe clutter is therefore not mitigated with this approach. Another drawback of the method is that very fine control of the beam steer direction may be required. In conventional phased array beamforming, beam steering accuracy to very small fractions of a beamwidth is not usually necessary, and the scanning is typically achieved using analogue phase shifters employing small numbers of bits. The phase settings for the array elements are therefore heavily
target
range Doppler
Figure 1.21 Range-Doppler map - 3 tap STAP output, 0.01°/PRI platform yaw, motion-compensated beam steering quantised. In the simulation results above, the ability to steer the beam to an accuracy of greater that 1/200th of a beamwidth was assumed. For the array size considered, this leads to a requirement of more than 8 bits resolution for the element level phase settings. Time-dependent adaptive weighting methods have previously been suggested for countering motion effects in adaptive arrays [21]. In this approach, motion compensation is achieved by assuming that the optimal adaptive weight vector is a function of time, and expanding the weight vector as a Taylor series. Assuming that (k •+- l)th order terms and above can be neglected, the adaptive weight vector then becomes: w(t) = w(0) + tw(l) + • • • + tkw{k) + <9O ( * +1) )
(1.12)
where t is the sample time of the data to which the weights are applied. Typically, a first-order expansion is used, and hence the adaptive weights are a linear function of time. This leads to a requirement for weight solutions for w^ and w^\ and a doubling of the dimensions of the covariance matrix to be inverted in equation (1.4). For a fixed number of subarrays and taps, this implies a factor of eight increase in the computational load associated with the adaptive weight calculation. Fast time, i.e. range sample, dependent adaptive weighting has previously been suggested as a technique for compensating for the effects of range dependency of clutter in nonsidelooking [7] and bistatic radar applications [22]. For motion compensation in STAP, it is the platform movement that takes place from pulse-to-pulse that is of greatest relevance and a single fast time-dependent model is unlikely to be valid for modelling both the platform motion and range dependency of the clutter. To model
for platform motion effects alone, a slow time (PRI rate) model is therefore most appropriate. The weights are then given by: w(m) = w{0) + mw(l) + • • • + mkw{k) + O(wiM))
(1.13)
where m is the PRI of the data to which the weights are applied. It should be noted that in the simulation examples considered within this section, there are enough training data samples available to allow the adaptive weights to be recalculated every PRI. The main advantage of using the time-dependent weighting approach rather than rapid updating of the adaptive weights (e.g. recalculation of the adaptive weights every PRI) in these cases is therefore computational efficiency. For example, if we assume 32 pulses in a burst, then for matrix inversion we can expect of the order of 327V3M3 floating point operations to be required. In contrast, if a first-order time-dependent weighting model is adequate, the inversion requires 8 A/"3 M 3 operations, a reduction by a factor of four. Time-dependent weighting will therefore produce similar results to those shown in Figure 1.20, but with reduced computation. The main deficiency of time-dependent weighting of the receive beam is that it cannot fully compensate for the fact that the region of ground illuminated by the transmit beam is changing with time. If uncorrected, this causes a spreading of mainlobe clutter within the range-Doppler detection map.
1.6 1.6.1
Jammer rejection under conditions of manoeuvre Mainlobe clutter filtering requirements
It is well known that spatial adaptive beamforming methods can be used to reject sidelobe jamming or jamming in the skirts of the mainlobe of the receive beam. In look down airborne radar, it is important to remove mainlobe clutter returns from the sensor data before attempting jammer rejection [2]. Failure to do this leads to the adaptive beamformer attempting to reject the mainlobe clutter, which in turn leads to a significant loss of main beam gain and high adaptive sidelobe levels. The mainlobe clutter Doppler frequency is usually known to a high enough accuracy to allow the clutter to be removed using conventional MTI filtering prior to adaptive beamforming. We will refer to the approach of cascading conventional MTI clutter filtering with spatial adaptive beamforming as MTI/ABF. The obvious disadvantage of using MTI/ABF, rather than STAP, is that it cannot provide detection of targets lying within the mainlobe clutter Doppler bandwidth [2]. Within this section we will analyse the potential advantages of the pre-Doppler STAP approach under conditions of manoeuvre. 1.6.2
Advantages of using STAP
Pre-Doppler STAP techniques can provide simultaneous suppression of clutter and jamming. The PRI tap delay spacing employed in STAP architectures designed for clutter rejection is usually large in comparison to the inverse of the instantaneous (or processed) bandwidth of the received signals. Wideband noise jamming signals
are therefore uncorrelated from tap to tap in the processor and, because of this, STAP usually offers little advantage over spatial adaptive beamforming in terms of jammer rejection performance. The jammer rejection performance of pre-Doppler STAP and MTI/ABF approaches has previously been compared in Reference 20 where analysis and simulation results demonstrated that the STAP approach is relatively robust under conditions of manoeuvre. The advantage of using STAP rather than MTI/ABF can be deduced from examination of the structure and rank of the jamming covariance matrix in both cases. Any motion-induced increase in the rank of the matrix is likely to lead to a larger number of adaptive degrees of freedom being required for jammer rejection, higher adaptive sidelobe levels and a decrease in SNIR. Consider a pre-Doppler STAP configuration comprising K spatial channels with L taps per channel. If we assume that the jamming, clutter and thermal noise are mutually uncorrelated, the covariance matrix can be expressed as: Q = Qj + Qc + Qn
(1-14)
where Qj, Qc and Qn are covariance matrices of the jamming, clutter and background noise, respectively. With the additional assumption of wideband noise jamming that is uncorrelated from tap to tap in the STAP architecture, the jamming covariance matrix can be expressed as: 'Qx
Qj=
0
...
&
° 0
0
0"
; QL
(U5)
where Qm denotes the K by K spatial covariance matrix of the jamming data at the mth tap of the processor. It therefore follows that the rank of Qj is given by: L
PiQj)=YsP(Qm)
(1.16)
m=\
where p(A) denotes the rank of matrix A. Under the assumption of wide sense stationarity, where there is no relative motion of the jammers, we have g j = Q2 = - • • = QL. Assuming that the propagation time across the receiving array is negligible compared with the reciprocal of the receiver bandwidth, it then follows that p(Qj) = Lp(Q1) = LJ where J is the number of jammers. Under conditions of manoeuvre, we have Qx ^ Q2 / • • • ^ QL in equation (1.15). If we now assume that the platform is manoeuvring at a constant rate we have p(Qx) = P(Q2) = • • • = P(Qi) and it follows that we again have: P(Qj) = Lp(Qx)
(1.17)
It should be noted that, in theory, the relative jammer motion now leads to the rank of the spatial jamming covariance matrix, Qx, being K, and hence it also follows that the rank of Qj is KL. However, in practice, the relative motion during covariance matrix estimation will be small and many of the eigenvalues of Qx will be below background
noise level. It then follows that the apparent rank of Q1, i.e. the number of dominant eigenvalues, will be closer to J than to K. Equation (1.17) is therefore significant as it predicts that both with and without platform motion, the apparent rank of the space-time jamming covariance is L times the apparent rank of the spatial jamming covariance matrix. From the structure of Qj in equation (1.15) it is also apparent that complete jammer rejection can be achieved by applying spatial jammer rejection weights at each column of taps within the pre-Doppler STAP architecture. In the presence of platform motion, differing jammer rejection weights can be applied at each tap, therefore compensating for the effect of the apparent jammer motion between PRIs. For the MTI/ABF processor, the jammer covariance matrix Qj becomes a K by K matrix. The effect of including the clutter rejection filters is to cause the multichannel sensor data to contain components spread over a time period corresponding to the impulse response length of the filters. For example, if we assume that the clutter rejection is achieved using FIR filters with L taps, each filter output sample will contain contributions spread over a duration of L — 1 PRIs. It therefore follows that, if the covariance matrix estimation in equation (1.5) is carried out using samples collected over a duration T, the clutter filtering causes the matrix to contain jamming data components spread over a time interval (L — l)r + T, where r is the PRI, rather than T. Under conditions of wide sense stationarity, the rank of the covariance matrix Qj will clearly be unaffected, but if there is relative jammer motion the clutter filtering will increase the apparent rank of Qj, with the increase depending on the ratio of the PRI, r, to the covariance matrix estimation interval T. The jammer rejection performance of MTI/ABF is therefore more sensitive to platform motion effects than is pre-Doppler STAR It should be noted that, in contrast to pre-Doppler STAP, post-Doppler STAP is likely to offer poorer jammer rejection than MTI/ABF under conditions of manoeuvre. This is because MTI clutter rejection is achieved by combining small numbers of pulses, whereas post-Doppler STAP architectures involve coherent integration of a full burst of pulses prior to the adaptive processing. Hence, in post-Doppler STAP, the prefiltering causes jammer data components spread over a time interval (M — 1)T rather than (L- l)r with M ^> L. The effects can be reduced by applying time-dependent weighting [21], but this is at the cost of a significant increase in computation. Confirmation of the validity of the theoretical analysis can be obtained from examination of the eigenvalues of the covariance matrix, Q, used in the adaptive weight calculation. The number of eigenvalues significantly above the thermal noise level gives an indication of the number of adaptive degrees of freedom required to achieve jammer and clutter suppression. If the number of dominant eigenvalues approaches the total number of adaptive channels, then poor SNIR is likely to result. In Figure 1.22, pre-Doppler STAP covariance matrix eigenspectra are plotted for varying numbers of taps for a simulation scenario with the radar platform rolling at a rate of 0.36° per PRI. The receive antenna used in the simulation was the 2029 circular planar array partitioned into 16 subarrays shown in Figure 1.10. The radar was operating in the presence of three strong (60 dB above noise at the element level) sidelobe jammers.
1 tap 2 taps 3 taps 4 taps
eigenvalue no.
Figure 1.22
Pre-Doppler STAP jamming plus thermal noise covariance matrix eigenspectra, roll rate 0.36°/PRI, sidelobe jamming scenario
The eigenspectra in Figure 1.22 were obtained from the covariance matrices of the jamming plus thermal noise (i.e. with clutter excluded). The important point to note is that, as the number of taps is increased, the proportion of the total spectrum affected by jamming remains the same, as predicted by equation (1.17). This implies that the SNIR output should remain relatively unaffected as the number of taps in the processor is increased. In contrast, the eigenspectra shown in Figure 1.23 reveal that for the MTI/ABF covariance matrix the proportion of dominant eigenvalues increases with the number of taps. Simulation results showing the loss in SNIR as a function of the number of clutter rejection filter taps for the sidelobe jamming scenario are summarised in Figure 1.24. The results show the effect of adapting to jamming and thermal noise data alone, and hence spatial adaptive beamforming can potentially provide optimal performance. Exclusion of clutter allows the impact of the MTI filtering on the sidelobe jamming rejection to be examined in isolation. The adaptive weights were calculated from data collected over a PRI and the SNIR values were calculated from the average of ten simulation runs. The loss in SNIR is given as the output SNIR relative to the optimal level. It is evident from Figure 1.24 that there is only a slight loss in SNIR as the number of taps is increased in the STAP approach. This loss is mainly due to the increase in number of adaptive channels relative to the amount of data used in the adaptive weight calculation. In contrast, the MTI/ABF result shows higher losses in SNIR as the number of taps in increased. However, the difference in performance between STAP and MTI/ABF is always small (i.e. always less than 1 dB). This is due to the fact that the total number of spatial degrees of freedom (1.16) is far in excess of the number of jammers (1.3), and hence, when using the MTI/ABF approach, wide nulls can be formed to counter the apparent spatial spread of the jammers. The penalty
ABF 2 tap MTI/ABF 3 tap MTI/ABF 4 tap MTI/ABF
eigenvalue no.
SNIR loss, dB
Figure 1.23 MTI/ABF jamming plus thermal noise covariance matrix eigenspectra - roll rate 0.36° /PRI, sidelobe jamming scenario
STAP MTI/ABF
no. of taps
Figure 1.24
SNIR loss as a function of number of taps - sidelobe jamming scenario, no clutter, roll rate 0.36°/PRI (from [20])
for doing this is an increase in mean sidelobe levels, as shown in the results plotted in Figure 1.25. The sidelobe levels were calculated from the spatial beampattern evaluated at the target Doppler frequency. Manoeuvring adaptive arrays are extremely sensitive to mainlobe interference, e.g. see Reference 23. This is because extended nulls within the mainlobe of the beam are required to account for the relative jammer motion and this can lead to significant loss in gain in the desired signal direction. The relative performance of
mean sidelobe level, dB
STAP MTI/ABF
no. of taps
Mean sidelobe level as function of number of taps - sidelobe jamming scenario, no clutter, roll rate 0.36°/PRI
SNIR loss, dB
Figure 1.25
STAP MTI/ABF
no. of taps
Figure 1.26
SNIR loss as afunction ofnumber of taps - mainlobejamming scenario, roll rate 0.036°/PRI (from [20])
STAP and MTI/ABF architectures in a mainlobe jamming scenario is therefore of particular interest. Figure 1.26 shows the SNIR loss (relative to the optimal value) as a function of the number of clutter rejection filter taps for a mainlobe jamming simulation scenario where the radar platform was rolling at a rate of 0.036° per PRI. The receive array was again the chequerboard subarrayed configuration shown in Figure 1.10. The jammer was initially located at the —3 dB point of a beam steered off at an angle of 60° from broadside to the array. Clutter was not included in the
simulation. Figure 1.26 shows that there is a significant loss in SNIR as the number of taps is increased in the MTI/ABF architecture. In comparison, STAP is relatively robust to the manoeuvre effects, and for four taps the output SNIR is more than 10 dB higher than that achieved with MTI/ABF. The losses when using MTI/ABF are significantly above those obtained in the sidelobe jamming scenario despite the fact that the platform rotation rate is a factor often less. In Section 1.5.2, it was shown that motion compensation of the beam steer direction helps to reduce the effects of platform motion on mainlobe clutter rejection when using STAR In mainlobe jamming scenarios, motion-compensated beam steering also helps to correct for the relative jammer motion, and hence it is clearly of benefit to apply this technique in scenarios containing mainlobe clutter and jamming. The motion-compensated beam steering approach is appropriate to both MTI/ABF and STAP architectures, but does rely on the phase quantisation being fine enough to allow accurate resteering of the beam. It should also be noted that there are cases where the approach will offer little or no benefit in terms of interference rejection. The case where the beam is at broadside to the array and the platform is rolling is an obvious example. Fortunately, the effects of the relative jammer motion are likely to be insignificant in this geometry, as the mainlobe jammer angular displacement from the roll axis is small. In contrast to the mainlobe jamming case, motion-compensated beam steering tends to accentuate the relative motion of sidelobe jammers. In situations where the number of spatial degrees of freedom far exceeds the number of sources of interference, the effects on adapted sidelobe levels and jammer rejection are likely to be small.
1.7
Summary
STAP techniques can provide simultaneous rejection of jamming and clutter in airborne radar. Although, in the past, STAP has been considered mainly for SLAR applications, there has been growing interest in applying the technique to non-side-looking radar geometries. In this chapter we have considered STAP for forward-looking airborne radar where the array of sensors is orientated transversally to the direction of travel. In forward-looking applications (e.g. AI radar), the effects of platform manoeuvre can be of greater significance than in typical SLAR applications (e.g. AEW and SAR). For example, detection and tracking of targets may be required in situations where the radar platform is performing a steep dive or rolling at a rapid rate. One of the greatest advantages of STAP over conventional signal processing methods is the potential it provides for detecting targets which possess the same Doppler as mainlobe clutter returns (i.e. slow moving targets). In this chapter, we have paid particular attention to the effect of variations in platform orientation and manoeuvre on slow target detection performance. In the scenarios involving constant platform velocities, it has been demonstrated that the slow target detection capability is not sensitive to the platform orientation. In particular, it has been shown that slow target detection can be achieved when the radar platform is performing a steep dive.
The effects of platform manoeuvre on STAP slow target detection performance have also been examined. Simulation results indicate that performance can be sensitive to the effects of roll and yaw. The most effective way of countering the effect of the platform motion is to motion compensate the beam steering to ensure that the target and the same region of ground are illuminated by the radar main beam throughout the coherent processing interval. Techniques involving application of time dependent weighting, or rapid updating of the adaptive weights are only partially effective as they cannot fully compensate for the effects of the transmit beam motion. It has been demonstrated that, under conditions of manoeuvre, pre-Doppler STAP techniques can provide better jammer rejection performance than architectures which cascade conventional clutter filtering and spatial adaptive beamforming. In cases where there is no compensation of the beam steer direction, differences in performance are most apparent in the presence of mainlobe jamming. The effects of platform motion on mainlobe clutter and jammer rejection can be reduced by motion compensation of the beam steering direction, but this approach is likely to accentuate the relative motion of sidelobe jammers.
References 1 RICHARDSON, R G.: 'Relationships between DPCA and adaptive space time processing techniques for clutter suppression'. Proceedings of the international conference on Radar, Paris 1994, pp. 295-300 2 RICHARDSON, R G. and HAYWARD, S. D.: 'Adaptive space-time processing for forward looking radar'. Proceedings of IEEE international Radar conference, Alexandria, VA, USA, May 1995, pp. 629-634 3 KLEMM, R.: 'Adaptive airborne MTI: comparison of sideways and forward looking radar'. Proceedings of IEEE international Radar conference, Alexandria, VA, USA, May 1995, pp. 614-618 4 KLEMM, R.: 'Adaptive airborne MTI with tapered antenna arrays', IEE Proc, Radar Sonar Navig, 1998,145, (1), pp. 3-8 5 WANG, Y.-L., PENG, Y-N., and BAO, Z.: 'Space-time adaptive processing for airborne radar with various array orientations', IEE Proc. Radar Sonar Navig., 1997,141, (6), pp. 330-341 6 BOSARI, G. K.: 'Mitigating effects on STAP processing caused by an inclined array'. Proceedings of IEEE national Radar conference, Dallas, TX, 1998, pp. 135-140 7 ZATMAN5M.: 'Circulararray STAP',IEEETrans. Aerosp. Electron. Syst, 2000, 36, (2), pp. 510-517 8 KLEMM, R.: 'Principles of space-time adaptive processing' (The Institution of Electrical Engineers, London, UK, 2002) 9 WANG, H., ZHANG, Y, and ZHANG, Q.: 'A view of the current status of space-time processing algorithm research'. Proceedings of IEEE international Radar conference, Alexandria, VA, USA, May 1995, pp. 635-640
10 BROWN, R. D., WICKS, M. C , ZHANG, Y., ZHANG, Q., and WANG, H.: 'A space-time adaptive processing approach for improved performance and affordability'. Proceedings of IEEE national Radar conference, Ann Arbor, Michigan, 13-16 May 1996, pp. 321-326 11 FARINA, A., SAVERIONE, A., and TIMMONERI, L.: 'MVDR vectorial lattice applied to space-time processing for AEW radar with large instantaneous bandwidth', IEE Proc, Radar Sonar Navig., 1996, 143, (1), pp. 41-46 12 ENDER, J. H. G.: 'Space-time processing for multichannel synthetic aperture radar', Electron. Commun. Eng. J., 1999, February, pp. 29-38 13 REED, I. S., MALLETT, J. D., andBRENNAN, L. E.: 'Rapid convergence rate in adaptive arrays', IEEE Trans. Aerosp. Electron. Syst, 1974,10, (6), pp. 853-863 14 WARD, J.: ' Space-time adaptive processing for airborne radar'. Technical report no. 1015, MIT Lincoln Laboratory, December 1994 15 HERBERT, G. M. and RICHARDSON, P. G.: 'A constrained adaptive pattern synthesis technique for space-time filtering architectures'. Proceedings of the DGON international Radar symposium, 1998, Munich, Germany, pp. 857-866 16 TAM, K. and FAUBERT, D.: 'Displaced phase centre antenna clutter suppression in space-based radar applications'. Proceedings of Radar '87^ IEE Conf. Publ. 281, pp. 385-389 17 RICHARDSON, P. G.: 'Space-time adaptive processing for manoeuvring airborne radar', Electron. Commun. Eng. J., 1999, February, 77, (7), pp. 57-63 18 PAINE, A. S.: 'Comparison of partially adaptive STAP techniques for airborne element digitised phased array radar'. Proceedings of the IEE international Radar conference 2002, Edinburgh, UK, October 2002, IEE Conf. Publ. 490, pp. 181-185 19 REES, H. D. and SKIDMORE, I. D.: 'Adaptive attenuation of clutter and jamming for array radar', IEE Proc, Radar Sonar Navig, 1998, 145, (4), pp. 193-199 20 RICHARDSON, P. G.: 'Effects of manoeuvre on space-time adaptive processing performance'. Proceedings of the Radar '97 conference, Edinburgh, October 1997, IEE Conf. Publ. 449, pp. 285-290 21 HAYWARD, S. D.:' Adaptive beamforming for rapidly moving arrays'. Proceedings of the CIE international conference on Radar (IEEE Press), Beijing, China, October 1996, pp. 480^83 22 MELVIN, W. L., CALLAHAN, M. J., and WICKS, M. C : 'Adaptive clutter cancellation in bistatic radar'. Record of 34th Asilomar conference on Systems, signals and computers, IEEE 2000, pp. 1125-1130 23 BALLANCE, W. P. and MILLER, T. W.: 'Impact of mainlobe interference angular extent on adaptive beamforming'. Conference record of 25th Asilomar conference on Signals, systems and computers, CA, November 1991, pp. 989-993
Chapter 2
Non-linear and adaptive two-dimensional FIR filters for STAP: theory and experimental results Pierfrancesco Lombardo and Fabiola Colone
2.1
Introduction
A significant challenge for the effectiveness of STAP techniques against real data is presented by the operation against severe and non-homogeneous interference environments. In particular, an airborne early warning (AEW) surveillance radar platform, whose mission is to detect low radar cross section targets, must contend with high levels of undesired clutter returns from both land and sea surfaces. This must operate with a large number of degrees of freedom (DoF) to be able to cancel strong clutter echoes accurately. However, it is impossible to use such a large number of degrees of freedom adaptively, since this would yield unacceptable adaptivity losses [I]. Moreover, the real-time implementation requirements demand the use of filters with a low computational cost. The clutter environment also includes returns from clutter of various sea states, terrain types (i.e. desert, hills, mountains) and large discretes and becomes particularly severe in regions encompassing varying ground surfaces such as regions connecting land and sea. This clutter non-homogeneity limits the amount of homogeneous secondary data available for the adaptive algorithms. Moreover, the presence of interfering targets as well as intense, high-power coherent jamming also affects radar system performance, by contaminating the estimations of the clutter characteristics. Thus the techniques to be applied in practice should be robust to their presence. Many reduced DoF techniques have been proposed to achieve at the same time a reduced computational cost and the requirement for a limited set of homogeneous secondary data without suffering very large adaptivity losses. However, when operating in a highly non-homogeneous environment or in the presence of interfering targets, the robustness of most linear approaches can be gained only at the expense of
a large increase in the computational load. In this chapter, we describe three possible solutions for robust and effective STAP of radar data: (i) adaptive two-dimensional FIR filters with small support (ii) non-linear non-adaptive schemes (iii) non-linear combination of adaptive two-dimensional FIR filters. The performances are evaluated and compared both by a theoretical analysis and by application to a set of recorded radar data. In summary, the non-linear adaptive detector promises remarkable detection performance in a non-stationary clutter background containing interfering targets.
2.2
Adaptive linear filters
We consider a radar system with K spatial channels. Each of these receives M echoes from a transmitted train of M coherent pulses with a pulse repetition interval (PRI) of T seconds. Let xmj be the radar echo at the /th spatial channel (/ = 1 , . . . , K) in response to the rath pulse (ra = 1 , . . . , M). The KM echoes can be arranged into the ATM-dimensional column vector x = [x* . . . x^]*, xm being the column vector of the K echoes received at the rath pulse. The corresponding vector for the echoes from a target with Doppler frequency F (normalised to PRF = 1 /PRI), direction of arrival (DoA) (p and complex amplitude A is defined as: sf(F,(p) = As = A[s*(F,
] j
% X]
(2.1)
s*Q~ s being Q = \/Q YlH=X ^ ^l anc^ ^ t n e detection threshold. This detector can also be interpreted as the comparison of the output power of the SMI (sample matrix inverse)
filter, normalised to the peak of the signal, Z(x), to the MSMI adaptive detection threshold, AMSMI: S+Q-1X
Z(I) = — 7 -1— ^ S^Q- S
rj
AMSMI
= — r — 1— (s*Q~ s)
(2.2)
Slightly better performance is usually provided by Kelly's GLRT (generalised likelihood ratio test), obtained from the maximisation of the likelihood function of the joint set of the Q + 1 data vectors (primary and secondary data) over the parameters A and Q, independently under the hypotheses Ho and H\. Taking the ratio of the maximised likelihood functions obtained under the two hypotheses yields the same detection statistic T(±) in equation (2.1) divided by (1 + x * Q - 1 x ) [2]. This compares Z(x) to a modified adaptive threshold AGLRT = ^GLRT(X) = ^MSMI • P -h X + Q -1 X],
which is data dependent. Unfortunately, to have good performance both tests require a number Q of secondary data at least equal to twice the number of DoF, namely 2KM9 while the probability of detection (P^) degrades very fast below such a number [3]. Therefore, as the number of DoF increases, the improved clutter cancellation capability goes together with the need for larger areas of homogeneous clutter and a high computational load for weight calculation and filtering. When these are not available, reduced DoF techniques should be used. A careful review of the many different reduced DoF algorithms can be found in Reference 1. Among them, we consider the joint domain localised (JDL) technique as our reference adaptive linear detector [4]. The technique basically consists in taking the bidimensional fast Fourier transform (FFT) of the received data vector and discarding all the transformed data but KpMp of them, localised around the position of the Doppler angle plane, which is tested for detection. Either the MSMI or Kelly's GLRT is then applied to the selected KpMp data. Notice that only the KpMp DoF that are localised on a small region of the two-dimensional joint spectral domain around the target position are used adaptively. The remaining DoF, instead of being discarded, are used non-adaptively (i.e. by the non-adaptive transformation). The computational cost of the adaptive portion is largely reduced; however, the weight calculation must be repeated for any Doppler channel of interest, where a new reduced DoF covariance matrix must be estimated. Even with very few adaptive DoF, as for Kp = 3, Mp = 3, the JDL keeps good performance. This yields a drastic reduction in the size of the required homogeneous clutter area; however, at least 2 = 18 range cells must still be homogeneous and free from interfering targets. We refer to the case of Q = 32 to have negligible losses. The performance degradation due to the presence of an interfering target in the secondary cells is easily verified from Figure 2. Ia, which shows the P& as a function of the interference to noise ratio (INR) for the JDL (dashed lines). We consider, as a reference for the analysis in this chapter, the case of a side-looking array of K — 3 spatial channels, M — 64 temporal pulses and Q = 32 secondary data, operating against a clutter with Gaussian shaped temporal decorrelation [5] and clutter-to-noise ratio, CNR = 16 dB at the input of the individual channel. The target is assumed to have a signal-to-noise ratio, SNR = —2 dB, DoA cp = 45°, and normalised Doppler
JDL MSMI Q=32 JDL GLRT Q=32 JDL MSMI Q= 16 JDL GLRT Q=16 AR Q=32 ARQ-8 ARQ=4
INR, dB
JDL MSMI Q=32 JDL GLRT Q=32 JDL MSMI Q=16 JDL GLRT Q=I6 AR Q=32 ARQ=8 ARQ=4
b
Figure 2.1
SNR, dB
Performance of linear schemes (JDL with Kp = Mp = 3 and AR with L = 3) for K = 3, M = 64, and a target at
frequency F = —0.156, which is close to the clutter main beam for the spectral folding due to the low PRP value used in this analysis. Moreover, the threshold is set so as to yield a probability of false alarm Pfa = 10~3 in the absence of interfering targets. As a worst case, the interfering target is assumed to share the same DoA and Doppler frequency as that of the desired target. Its presence in the secondary data affects the estimate of the covariance matrix; therefore, the resulting adaptive detection scheme tends to equalise the space-time spectrum, thus putting a notch in the DoA and Doppler frequency of the target. As the INR increases, the notch becomes deeper and the desired target is quickly nulled. Obviously, using less secondary data reduces the probability that the secondary data are affected by interfering targets, therefore we consider both the cases of Q = 32 and Q = 16 secondary data. Notice that, when an interfering target is present in the 16 cells closest to the CUT, the JDL plots with Q = 16 start decreasing by about 5 dB before the corresponding plots with Q = 32 secondary data. This is because the undesired contribution in the sample covariance matrix is averaged with a smaller number of uncontaminated data. It must also be noticed that the JDL plots with Q = 16 secondary data show a lower probability of detection than the corresponding plots with Q = 32 secondary data even for very low INR values. This can be verified from Figure 2.1b, representing the P& as a function of the SNR under the same conditions in the absence of interfering targets. As apparent, the JDL with Q = 16 secondary cells yields about 3 dB of loss with respect to the case of Q = 32. Moreover further reductions of Q would show a drastic fall in the detection performance. Therefore, with the JDL, there is an intrinsic limit in the possibility of reducing the probability of interfering targets by reducing the size of secondary data, unless accepting the presence of significant detection losses even in the absence of interferences. Finally, it is interesting to observe from Figures 2.1a and 2. Ib that, with both 2 = 1 6 and Q = 32 secondary cells, the plots of MSMI and GLRT are very close to one another. Thus, in the following, only the JDL MSMI is considered. The detection performance against a non-homogeneous environment is demonstrated in this chapter with reference to a data set provided by the Naval Research Laboratory (USA), which consists of land, sea and land-sea interface scenarios of various terrain types and sea states. The data have already been processed by using systolic-based adaptive algorithms [6] and various STAP filters [7,8]. These data were recorded by a modified AN/APS-125 radar at UHF on a P-3A aircraft and include flight tests taken in 1979 and 1980 over the Appalachian mountain regions, Maryland, Virginia and midwestern areas of the United States. The receiving system consists of eight identical channels giving / and Q signals at 10 bits within a baseband of 5 MHz. For the purpose of our analysis, a non-adaptive digital beamforming is applied to the spatial channels, which combines, with appropriate phases, K = 3 overlapped uniform subarrays (OUS) of four adjacent channels. The processed file (DL075) refers to littoral clutter; the transition between ground and sea echoes is well apparent in Figure 2.2a, which shows the power received at the first channel and first PRI versus range. The data refer to 18 PRIs, each one containing 896 range cells for each channel. The first 450 samples refer to sea clutter and have a power level of about 1OdB;
power, dB output power, dB
range bin
test statistic, 101ogl0 (T)
range bin
c
Figure 2.2
range bin
Results of JDL against recorded data by AAFTE a Power level versus range for first antenna element and first pulse b JDL MSMI output power versus range for 1 target injected and Q = 32 c JDL MSMI test statistic versus range for 1 target injected and Q = 32
from sample 550 to 896 ground clutter echoes are received, which have a level of about 30 dB; samples in between are characterised by a high non-homogeneity, since they are reflected from the sea coast region which is primarily sandy beaches with small hills and cliffs near the water. To show the clutter cancellation performance of the JDL, a fictitious point-like target is injected at range cell 480 at
of the signal at the output of the normalised filter, Z(x), of the JDL detector (see equation (2.2)), with Mp = Kp = 3 and Q = 32, is portrayed in Figure 2.2b. It is noted that about 25 dB of clutter cancellation has been obtained on the sea area and about 35 dB on the land area and the target appears well above the clutter level. The behaviour in terms of detection is easily verified from the test statistics, T(x) (see equation (2.1)), in Figure 2.2c, which shows that using the JDL an appropriate threshold can easily be selected to detect the target without having false alarms. To show the performance of the JDL in the presence of interfering targets, we proceed as follows. Nine sets of two or three fictitious point-like targets have been added to the data set at the same target DoA 90° and Doppler —213 Hz, at range cells and power levels described in Table 2.1. Sets (A, C, E, F, I) named Group I, have two targets with the same power level; sets (B, D, G, H), named Group II, have targets with different power levels. The proposed STAP schemes have been applied to these data to assess their comparative performance. Notice that almost all targets are well below the clutter level (compare Figures 2.3a and 2.2a). Figures 2.3b,c show the CFAR statistic T(\) of the JDL MSMI versus range, with Q = 32 and Q = 20 secondary data, respectively. A few considerations apply: (i)
The JDL with Q = 32 correctly detects the targets in Group I (italic labels) but looses the smallest targets in Group II (bold labels). When the smallest target of a configuration from Group II is in the CUT, one or two stronger targets affect the estimation of the covariance matrix and the threshold setting. Following the above discussion - and recalling that all targets have been considered at the same DoA and Doppler frequency - this implies that a notch is set in the target space-time location so that the small target is not detected. For targets of the same power level, the same notch operates on the target in the CUT. However, due to its original power level, this still exceeds the threshold despite the notch in its space-time location. (ii) Strong false alarms appear at range cells 507, 577, 603; namely, when setting a threshold to detect most of the targets, a detection is declared also in these range cells, however no targets were injected there. This is independent of the presence of interfering targets. The high values of the test statistic, which are not Table 2.1 Synthetic targets test configuration Set Group Range bin Power (dB) Set Group Range bin Power (dB)
A I 90,93 35,35 F I 540,543 15, 15
B II 180,183,186 0,15,15 G II 630,633,636 15,0,25
C D E I II I 270,273 360,363 450,453 0,0 0,15 15,15 H / II I 720,723 810,813 25,0 0,0
input power, dB test statistic, 101og10 (T)
range bin
I i
test statistic, 10 log 10 (T)
range bin
c
range bin
Figure 2.3
Results of JDL against recorded data by AAFTE for the target test configuration of Table 2.1 a Synthetic targets test configuration b JDL MSMI test statistic versus range for Q = 32 c JDL MSMI test statistic versus range for Q = 20
related to injected targets, come from the non-homogeneous area of transition between sea and land. Such values were also present in Figure 2.2c; however, in the case of sequences of closely spaced targets (with various power levels and partial cancellation of each one due to the presence of the neighbours in the sample estimate of the covariance matrix) they directly yield false alarms. In fact, to detect all targets, we need to set a lower threshold than that in Figure 2.2c which is also exceeded by all these values.
(iii) The JDL with Q = 20 shows similar behaviour to the JDL with Q = 32, but there are significantly more false alarms. This shows that reducing the number of secondary data increases the fluctuation of the test output. The undesired effect from adjacent targets is removed only if the target distance is larger than Q/2 = 1 0 cells; however, it is not removed in the case of sequences of targets more closely spaced (as considered in our test configuration). A possible approach to reduce the effect of the interfering targets in the secondary data consists in devising adaptive filtering techniques that intrinsically need a very limited amount of secondary data, Q, so that the probability of incurring in the performance degradation due to interfering targets is largely reduced. In particular, only targets with distance less or equal to Q/2 show an interfering effect. Obviously, the JDL scheme with Mp = 3, Kp = 3 does not allow us to work with a number of secondary data Q lower than 18, unless accepting large adaptivity losses. Therefore, alternative approaches must be considered to reduce Q further. A two-dimensional FIR filtering scheme is presented in the next section that is able to operate with a very small number of secondary data, without significant adaptivity losses.
2.3
AR-based FIR filters
To derive the AR-based FIR (finite impulse response) filter, the space-time disturbance echoes (clutter-plus-noise) are represented with a two-dimensional autoregressive model: AR(L — 1, A, R) of order L — 1 and matrix parameters A and R: (2.3) d (p) being the ( ^ x I ) echoes vector at the /7th PRI, w(/?) is a sample from a white vectorial complex Gaussian process with zero mean value and (K x K) covariance matrix R, and A = [A^ - 1 , A £ _ 2 , . . . , A*]* the (K(L — 1) x K) matrix of the two-dimensional AR parameters. By assuming that the AR poles are not close to the unit circle, and extending to the two-dimensional domain the approximation in Reference 9, the joint PDF of the data vector in the CUT can be approximated under the hypothesis of target absence (HQ):
(2.4)
To simplify the notation of equation (2.4), we define the (K x KL) matrix H = [—A* 1^], where I^ is a ^-dimensional identity matrix. By rearranging the data into the (KL x (M - L + I)) matrix X:
(2.5) which implicitly defines the vectors x ^ , ra = l , . . . , M — L + l,it yields: (2.6) Similarly, the approximate PDF, /?i(x), under hypothesis H\ (namely assuming also the presence of a target with complex amplitude A and space-time steering vector s), is obtained by replacing in equation (2.6), X with (X — AS), where S = [S^1JL S ^ • • • s^jT L + 1 ) ] is the target matrix obtained by applying the same reordering operation as for X. By assuming known disturbance characteristics, namely known A and R matrices, the generalised likelihood ratio test is easily obtained by maximising the ratio p\(x)/po(x) with respect to the target complex amplitude, A. The maximisation yields the maximum likelihood (ML) value for the target complex amplitude A = fr{X*H*R-1HS}/^r{S*H*R-1HS}, and finally the logarithmic GLRT: (2.7) where XAR is the detection threshold. The denominator of equation (2.7), Tr{S*H*R~1HS} = E{jl}, is the expected value of the average clutter power jx at the output of the filter, estimated over the Q secondary data, thus the filter is intrinsically CFAR. As apparent, the denominator is a constant independent of the data matrix X in the CUT, so that the numerator defines the filter shape. By exploding the trace into the sum of its components, and using the identity s ^ = e^2nF^n~V)sA)F it is rewritten as:
(2.8)
where the adaptive weight vector w = H*R 1 Hs^] 7 is implicitly defined. Equation (2.8) shows that the GLR test is given by the application of the twodimensional adaptive filter w to the data with L ^-dimensional support, followed by a bank of Doppler filters (each one centred on a different target speed). It is important to observe that only a very limited number of coefficients (L taps for each of the K spatial channels) is required to implement this filter. Further - unlike the JDL - only the target steering vector depends on the Doppler frequency, therefore the adaptive portion (H*R~ 1 H) of the filter weight vector is independent of the considered Doppler channel and can be evaluated and applied to the data only once. This is a interesting advantage of the AR-based FIR filter, that can be classified as a pre-Doppler technique, where the optimisation is independent of the subsequent Doppler filter bank. These characteristics yield a low computational cost. Moreover, the space-time FIR filter is especially appealing since it was shown to be coincident with the optimum adaptive processor (OAP) in References 10 and 11, under specific assumptions on the clutter characteristics. In the more general case under analysis, the improvement factor (IF) obtained with this AR-based two-dimensional FIR filter is compared in Figure 2.4 with both the OAP and the JDL detector, for the case of a radar operating with K = 3 spatial channels, M = 64 PRIs, a Gaussian-shaped temporal clutter correlation, CNR = 16 dB and beam pointing at
Figure 2.4
Comparison of IF curves for K = 3, M = 64,
for AR filters with L = 3 and L = 6 taps while the JDL operates with Kp — 3 and Mp = 3. As apparent, the considered clutter model does not follow exactly the two-dimensional AR model; however, the two-dimensional FIR filter shows only a limited performance loss close to the notch with respect to both OAP and JDL, despite the large reduction of the computational load. Moreover, as the number of taps, L, increases from L = 3 to L = 6, the performance of the AR-based FIR filter close to the clutter notch also gets closer to the JDL, which shows a trade off between computational cost and performance. Further increases of the number of taps L would not yield better performance close to the clutter notch. A different behaviour is present far from the clutter notch, where filters with more taps show larger losses. This performance loss far away from the clutter notch is due to the fact that a FIR filter with L taps uses a shortened coherent CPI of (M — L + 1) samples, because the filter does not slide over the edges of the data record. It is to be noticed that the use of FIR filters deriving from a two-dimensional AR model of the clutter returns was first introduced by Klemm and Ender in References 12 and 13. In contrast to our GLRT approach, based on the approximate PDF in equations (2.4)-(2.6), they applied the minimum mean square error criterion at the filter output, obtaining slightly different expressions for the filter parameters. The performance of the two filters is largely comparable, thus similar considerations as above apply. For the practical application of the AR detection scheme, the clutter parameters A and R cannot be considered known, and must be estimated from the data themselves. To this purpose, we use the independent echo vectors received from Q adjacent range cells that are considered homogeneous and target free. As for the primary data, the KM echo vector y^ in each secondary range cell is rearranged into the matrix Y^, for k = 1 , . . . , <2; then these matrices are collected into the global (KL x (M — L + 1) Q) matrix of the secondary data Y = [Yi Y2 • • • Yg]-As shown in the Appendix (Section 2.8), the ML estimates of the matrix parameters A and R are obtained from the sample covariance matrix My = YY*. For convenience, we decompose the My in blocks of size K(L — 1) and L, respectively: (2.9) Therefore, we have the ML estimates:
(2.10)
where [M F 1]L,L is the last KxK block in the main diagonal of the inverse of My. These values are used inside the practical detection scheme to replace the known values. Further consideration is in order for the practical application of the AR-based two-dimensional FIR filter. The denominator in equation (2.7) is coincident with the normalising CFAR term only if the data follow exactly the two-dimensional AR model. For the general case, where real or simulated data with unknown spectral
shape are fed into the detector, the denominator must be replaced by the estimated clutter power /i(Y):
(2.11) The performance of the AR-based FIR filter with L = 3 taps is compared with the JDL with Kp — 3 and Mp = 3 in Figure 2.1b (solid lines). A few comments are in order: (i) the FIR filter with Q = 32 cells has the best performance (ii) the FIR filter with 2 = 8 cells shows a loss of 2 dB with respect to the FIR filter with Q = 32 and less than 1 dB with respect to the JDL with Q = 32, but it largely outperforms the JDL with 2 = 16 (iii) the FIR filter with Q = A cells is comparable to the JDL with 2 = 16. Comparatively, the JDL scheme suffers high adaptivity losses that largely compensate the little advantage shown in the IF. The case of L = 6 could achieve better performance, but it also requires slightly more secondary data (larger Q) corresponding to the larger number of filter parameters to estimate. An important point to be noticed is that the AR-based FIR filters take great advantage from a much more accurate estimate of the clutter covariance matrix. This is obtained by using the sample matrix My, which contains the average made inside the CPI (other than on the range cells), and follows from the exploitation of the AR properties. The possibility of operating with 2 = 8, instead of Q = 32, secondary data largely reduces the probability of having interfering targets in the secondary data. Moreover, clutter edges have very little influence on the detector performance. On the other hand, when interference is present, its effect is more devastating than with Q = 32, since it is not largely averaged with uncontaminated data. This is apparent from Figure 2.1a, where we consider the unfavourable case of an interfering target present in the secondary data of the AR with Q = 32, 2 — 8 a n d 2 = 4. As expected, the reduction of Q implies a faster decrease in the detection capability. This is the price to be paid to reduce the probability of having interfering targets in the secondary data. Figure 2.5 shows the application of the adaptive FIR filters to the AAFTE data under the same condition as Figure 2.2. Figure 2.5a shows the output power versus range, when operating with L = 3, 2 = 8 for the same case as for Figure 2.2b; a comparable (slightly better) clutter cancellation is obtained with the AR-based FIR filter. Figure 2.5b depicts the corresponding test statistic that clearly shows the effective detection of the target. Figures 2.6a-c show the detection statistic for the target test configuration of Table 2.1, respectively with Q = 8, Q = 20 and Q = 32 secondary data.
output power, dB test statistic, 10 log , 0 (T)
range bin
b
Figure 2.5
range bin
Results of the AR-based two-dimensional FIR filter against recorded data by AAFTE for 1 target injected and Q = 8 a Output power versus range b Test statistic versus range
The following considerations are in order: (i)
The AR-based FIR filter with Q = 8 is slightly worse than the JDL with Q = 20 (Figure 2.3c). (ii) The AR-based FIR filter with Q = 20 detects all targets of Group I except for set A, while it fails to detect the smaller targets in Group II, but has less false alarms than does the JDL with Q = 20. (iii) The AR-based FIR filter with Q =32 is comparable to the JDL with Q =32. Notice that it also loses set A, which has higher power than the clutter and could be detected before cancellation. However, the number of false alarms is largely reduced with respect to the JDL (namely, setting a threshold to detect the same targets, it yields a lower number of false alarms). Therefore, the use of two-dimensional FIR filters with short temporal support and limited adaptivity losses does not solve all of the problems. A number of techniques have been investigated in the literature to cope with the problems deriving from the presence of interfering targets, by properly selecting or discarding the range cells of secondary data (see for example References 14 and 15). However, these techniques appear to have a very high computational cost. Alternative techniques are investigated below, based on a non-linear combination of filters.
test statistic, 101og10(T) test statistic, 101og10 (T)
range bin
test statistic, 101og10 (T)
range bin
c
range bin
Figure 2.6
2.4
Test statistic versus range for the AR-based two-dimensional FIR filter against recorded data by AAFTE for the targets test configuration of Table 2 J a Q=S b Q = 20 c Q = 32
Non-linear combination of non-adaptive filters
When considering the expected characteristics of the space-time cancellation filter, the following considerations are in order. Whichever the radar and clutter characteristics are, the clutter spectrum mainly appears as a ridge with known shape in the Doppler frequency-angle plane that is modulated by the transmitting antenna
pattern. The slope of the F-coscp clutter trajectory (namely the footprint in the F-cos
a bank of P fixed filters is designed, with notches of different widths, and normalised so as to give the same output when fed with the expected target (ii) the average power at the filters' output is evaluated on Q range cells (iii) the filter with minimum output power is selected; notice that, due to the normalisation, at point (i), the filter with the widest notch does not necessarily yield the minimum output power (iv) the output of the selected filter corresponding to the CUT is scaled by the corresponding normalising CFAR term and compared with the detection threshold to test for the target presence. The scheme of this filter is depicted in Figure 2.7 for a bank of P = 3 filters: filter A, filter B and filter C. This non-linear combination of non-adaptive filters has apparently a very limited level of flexibility, consisting in the automatic selection of the filter with minimum output power for each range cell [17]. However, if the filters are carefully designed, this detection scheme can yield very convincing results. Its computational cost is P times higher than for a fixed weights linear filter, but much less than for the OAP filter, which requires the real-time inversion of the KM x KM estimated clutter covariance matrix.
2.4.1 Filter bank design To design the filter bank, it is useful to recall that the clutter covariance matrix Q is a Toeplitz block matrix with blocks related to the spatial channels. We assume a spatially homogeneous scene and consider a ratio a = d/(2vT) between spatial and temporal sampling intervals, being d the antenna spacing and v the platform velocity [1,18]; a is also referred to as the space-time slope. In general, for side-looking configurations, Q is obtained from the usual space-time correlation coefficient expression [19]: (2.12)
where pt(At) is the temporal correlation coefficient, which depends on the ICM and is a function of the temporal displacement At = mT of the two clutter echoes. ps[At + As/(2v)] is the spatial correlation coefficient, which is independent of the ICM and encodes the decorrelation due to the combined effect of the radar platform motion (and thus of the different view angle over the scene) and the antenna pattern. Since this term depends on the spatial position of the receiver, it is a function of both the temporal displacement At (which implies a different position of the platform) and the spatial displacement of the antennas in the array As. Let us assume that: (i) the nominal clutter returns describe a diagonal of the Doppler-angle plane with slope a, (ii) the target DoA is cp, and (iii) the expected normalised target Doppler frequency is F; then a suitable two-dimensional filter has the main beam at (
clutter filter null COS(T)
Figure 2.7
Sketch of the non-linear space-time processor a Filter A b Filter B c Filter C d Detector scheme
being 8(x) the Kronecker delta function, and appropriate pt(At) correlation function. In particular, a Gaussian filter bank is obtained by considering a Gaussian shaped Pt(At) with one-lag correlation coefficient pt. To this purpose, we select P = 3 values: pt\ = 0.9, ptB = 0.99 and ptQ = 0.999, and we build, respectively, the covariance matrix QA, of filter A, QB of filter B and Qc of filter C, corresponding to clutter echoes with different intensity of internal motion. The optimum processor is obtained by a linear combination of the KM echoes with weights w = Q - 1 S. Therefore, a Gaussian filter bank is easily obtained by considering P = 3 optimum filters corresponding to the three covariance matrices above. To properly select the best filter in the bank, each filter is normalised so that it produces unity output when fed with the target steering vector, s. As mentioned above, this normalisation guarantees that the non-linear scheme does not always select the filter with the widest notch, thus yielding a performance degradation of the very slow targets. The instantaneous power for the CUT at the output of filter A is:
(2.13) The CA-CFAR normalising term for this filter, evaluated over Q adjacent range bins, is an estimate of the clutter power at its output and is given by: (2.14) where the explicit dependence on x refers to the selection of the samples y&, adjacent to the CUT with echo vector x. Similar expressions are valid for filters B and C. The non-linear detector selects the filter with the minimum estimated clutter output power on the Q adjacent range cells:
(2.15) Finally, the non-linear scheme compares it to the CA-CFAR detection threshold corresponding to the selected filter. In analogy to the case of the GLRT, it can be written in terms of test statistic:
(2.16)
which is to be compared to the threshold G, to test for detection. The set of three twodimensional filters is repeated for the different values of the expected target Doppler frequency.
2.4.2 Detection threshold and performance A closed-form expression of the false alarm probability (as well as of the P& for Swerling I targets) has been obtained for P = 2 filters [7]. Define the clutter power at the output of the two filters as o\ = E{Z2A},G^ = £{Z|}, the output cross correlation coefficient, p = \E{ZAZ^}\/(GA<JB), and the target power, erf. When selecting the filter based on the Q adjacent range cells, Pd = PA + PB, where: (2.17) with GA 0
=
GB
V W B + 1 + (1 -
=
G, aA 2
P )MA1
2
= 2
G2JaI - [1 + (1 - P 2 )MAL £A
=
2
- 4 p a i / ^ , and /xA = G A /(1 + crf/a A). PB is
obtained from PA by exchanging suffix A with B. The Pfa is easily obtained by setting at = 0. Even in the presence of P > 2 filters, assuming that the clutter background is approximately homogeneous, the non-linear filter has to choose essentially between the two filters which are closest to the ideal optimum, while the others give a negligible contribution to the detection performance. When evaluating the performance, the theoretical values of the filters are known, so that we are able to choose the two correct filters and apply the theoretical formula. Also, the detection threshold can be easily set using equation (2.17). Figure 2.8a shows the power at the output of the non-linear scheme, Z(x) (see equations (2.13) and (2.15)), when operating with Q = 20 against the AAFTE data file with an injected target as in Figure 2.2b. It is now apparent that the output power has a low fluctuation level and performs at least as well as the JDL with Q = 32, even if it only operates selecting the most appropriate filter out of a set of three. Moreover, the target is now clearly visible. Obviously better cancellations could be achieved by using full adaptivity and larger regions of secondary data, at the expense of higher computational cost. However, when dealing with small regions of data we show that the behaviour of the non-linear non-adaptive detection scheme is comparable to the best results obtained by the reduced DoF techniques. The behaviour in terms of detection is easily verified from the test statistics, 7\x) (see equation (2.16)), in Figure 2.8b, which shows that the non-linear processor properly detects the target. The filter selection made by the non-linear non-adaptive detector is portrayed in Figure 2.8c. The narrowest filter (C) is selected only for a fraction of returns along range and mainly inside the land area. In contrast, in the sea area, there are large regions where the widest filters (A) and (B) are selected (bins 50 to 180 and 290 to 390). Moreover, in the highly non-homogeneous areas, the selection largely oscillates among all three filters; this certainly applies to the sea to ground transition (bins about 450 to 480) and to the land region in cells 810 to 890, containing probably a river bank.
output power, dB test statistic, 101og10(T)
range bin
filter selection
range bin
c
Figure 2.8
range bin
Results of the non-linear non-adaptive Gaussian-based filter versus range against recorded data by AAFTE for 1 target injected and Q = 20 a Output power b Test statistic c Non-linear filter selection
2.4.3 AR-based non-linear detector Although the use of filters based on Gaussian-shaped autocorrelation functions is a simple and effective way to obtain a set of similar filters with notches of different width, two considerations are in order: (i) the Gaussian filters are generally not an optimal choice, since the Gaussian model is arbitrary, and (ii) the filters have the
full implementation cost of MK complex products, since they have MK non-zero coefficients. A significant reduction of the implementation cost can be achieved by replacing them with FIR filters with a small temporal support. A non-adaptive version of the two-dimensional AR-based FIR filters presented in Section 2.4 can be used to this purpose. To derive the filter coefficients for this case, we proceed as follows. From the theory of the stationary two-dimensional-AR processes, it is known that the relationship between AR parameters, A and R, and the covariance matrix Q can be written as H • QAF = [0K • • • 0K R], where QAF = £ { x ^ x ^ T } for any value of m and is coincident with the generic rath (KL x KL) block on the main diagonal of Q. Therefore, H + R" 1 = Q ^ [ O * • • • O^ I*]* so that H* R" 1 is the last (KL x K) block column of Q ^ , and R" 1 is the last (K x K) block in the main diagonal of Q^f. An AR-based FIR filter bank can be obtained by using the relationships above to approximate the two-dimensional Gaussian filters with twodimensional AR-based FIR filters with L taps. Figures 2.9a,b show, respectively, the output power and the test statistic for the same case as Figure 2.8a,b. As apparent, with L = 3 taps the clutter cancellation is very similar to the case of the Gaussian filters and the target is easily extracted by the filter. The corresponding filter selection is reported in Figure 2.9c. In this case, the selection shows fewer fluctuations than in the case of the Gaussian filters and the wider filter A is selected most of the time. The filter selection is still largely fluctuating in most non-stationary clutter areas. The performance of the non-linear non-adaptive detection scheme based on the bank of AR FIR filters against the target test configuration of Table 2.1 is portrayed in Figure 2.10, to investigate the robustness of this detection scheme to the presence of interfering targets in the secondary data. Notice that the secondary data are only used here to select the best filter in the bank and to provide the CFAR normalisation. Figure 2.10a shows the test statistic as a function of the range cell. As apparent, the targets of Group I are properly detected, but the smallest targets of Group II are not detected by the filter. Notice also that set I is not clearly extracted; this is probably due to its closeness to a highly homogeneous area of ground clutter (probably containing the river banks). The filter selection is expected not to be affected by the presence of the interfering targets in the secondary data, since all filters in the bank are normalised so as to yield unity gain for the desired target. Therefore, the degraded performance of the technique must be mainly attributed to the interfering targets affecting the CA-CFAR normalisation. To counteract this effect the following scheme is proposed: (i) (ii) (iii)
(iv)
select the best filter as before (the filter yielding the minimum output power, as estimated on all the secondary data) split the secondary data into P blocks of Q cells evaluate the P normalised filter outputs, obtained by dividing the filter output from the CUT by the mean filter output on each block of Q range cells (this is the CA-CFAR output obtained by considering only the secondary cells of the individual block) take the median of the P normalised filter outputs.
t a
I o
range bin
P O
i O
range bin
I 1 c
Figure 2.9
range bin
Results of the non-linear non-adaptive AR-based filter versus range against recorded data by AAFTE for 1 target injected and Q = 20 a Output power b Test statistic c Non-linear filter selection
The median operator is selected in order to reject the anomalous outputs that are corrupted by the presence of the interfering target. This is obviously based on the assumption that only a small number of blocks is expected to be affected by the interfering targets. The resulting test statistic is shown in Figure 2.10b for P = 5 blocks with Q = 4 cells, for a total of 20 secondary data. As apparent, almost all targets are clearly extracted and a threshold could be selected to detect all of them without causing false alarms. This is not quite true for target set I, due to the above mentioned
test statistic, 101og10(T) test statistic, 10 log 10 (T)
range bm
block selection
range bin
c
Figure 2.10
range bin
Results of the non-linear non-adaptive AR-based filter versus range against recorded data by AAFTE for the targets test configuration of Table 2.1 and Q = 20 a Test statistic b Test statistic with block selection c Block selection around target set D
non-homogeneity. Notice also that the strong effect of the target in the CFAR scaling factor, yielding very low returns around the target positions in Figure 2.10a, is not present in Figure 2.10b. To demonstrate the effectiveness of this median selection for the CFAR, Figure 2.10c shows the selected CFAR block versus range cells, around the targets of set D. The small circles represent the blocks affected by interfering targets,
and the solid line represents the block selected by the median operator. As apparent, the blocks affected by interfering targets are never selected. As a final step in the non-adaptive non-linear detector, we notice that the selection of the best filter of the bank can be done without using the secondary data. The non-linear selection strategy can operate directly by choosing the filter yielding the minimum output power on the CUT, after normalisation as in equation (2.13), namely: Z(x) = min{ZA(x), Z B (x), Z c (x)}
(2.18)
Test statistic, 10 log.0 (T)
The same CA-CFAR scheme above is then applied, consisting of the normalisation by the median of the average output powers on the P blocks of Q range cells. The resulting test statistic is reported in Figure 2.11a, which is largely comparable with Figure 2.10b. Similarly Figure 2.11b, shows the correct selection of a block of secondary data not affected by interfering targets. As apparent, this filter yields a further reduction in computational cost, since only one of the three filters must be applied to all range cells. Moreover, it yields a very effective detection scheme that is robust to the presence of interfering targets. However, target set I is still not detected which is due to the clutter non-homogeneity.
block selection
range bin
b
range bin
Figure 2.11 Results of the non-linear non-adaptive AR-basedfilter with block selection and test on the CUT versus range against recorded data by AAFTE for the targets test configuration of Table 2.1 and Q — 20 a Test statistic b Block selection around target set D
2.5
Non-linear combination of adaptive AR-based two-dimensional FIR filters
From the analysis of the previous sections, we observe that both AR-based adaptive FIR filters and non-linear combinations of non-adaptive filters are able to work with a limited amount of secondary data, moreover: (i) The non-linear bank of non-adaptive filters performs very well against the nonhomogeneous background and in the presence of interfering targets, but it largely depends on the appropriate selection of the shape of the filters in the bank. The filters should be changed in accordance to the platform flight conditions (pitch, bank, roll, crab, wind speed, ground speed), and the radar parameters (antenna pointing, PRF). Moreover, it might happen that none of the used filters is really appropriate to clutter cancellation, with the consequent performance degradation. (ii) The AR-based adaptive FIR filters are able to adapt to any kind of mismatch, such as the variations in platform flight conditions and radar parameters. However, their performance is largely degraded by the presence of interfering targets in the secondary data. To obtain a robust detection scheme that at the same time copes with the changing radar and platform conditions and is not largely affected by the presence of interfering targets in the adjacent range cells, non-linear adaptive schemes (in contrast to the nonlinear non-adaptive schemes of Section 2.4) are presented. In these adaptive schemes, a set of P AR-based FIR filters is obtained by estimating the covariance matrix on P different blocks of Q range cells around the CUT and estimating the corresponding matrices A and R to be used inside equation (2.8). Two non-linear adaptive schemes are obtained by applying a non-linear selection among the outputs of P linear adaptive filters, according to two possible criteria [20]: Minimum residual power (MRP) Each filter is normalised so as to give the same output to the received target, as for the non-linear combination of non-adaptive filter of Section 2.4. Thus, for filter A:
(2.19) where HA and RA are estimated from the first block of Q secondary range cells; similarly ZB(X), ZC(X), . . . are obtained from the second, third, . . . block of Q secondary data. Then, each of the P filters is applied to the CUT and the non-linear scheme selects the filter that yields the minimum output power. Finally, the selected
filter is normalised by the CFAR scaling factor computed on the range cells of the corresponding block; namely, for filter A:
(2.20)
before comparing to the detection threshold. In the presence of interfering targets in one or more blocks of secondary data, the filters obtained from the estimates on the contaminated blocks yield a worse clutter cancellation than the filters based on the non-contaminated blocks. Therefore, the latter filters are selected, which makes the non-linear adaptive detector robust to the presence of interfering targets. Median test output (MTO) The output of the CFAR test statistic 7} = Z///x r , i = A, B, . . . is evaluated for each of the P filters (see Figure 2.12 for P = 5 blocks yielding filters A to E). The median value of the P outputs on the CUT is selected and compared to the detection threshold. Assuming that interferences don't affect more than (P — l)/2 blocks of secondary data, namely (P — l)/2 filter outputs, the median output should correspond to a non-contaminated AR filter. The performance of these non-linear adaptive detectors that use the AR-based FIR filter are reported in Figures 2.13a and 2.13b, respectively, for Q = 4 and Q = 8 cells in each of the P blocks. In both Figures the P& of the linear AR-based FIR filter with global number of cells 2 = 4, 8,32 is reported for comparison. We notice that the MRP detector operating with blocks of Q cells always provides a P$
median
CUT
Figure 2.12
Scheme of the MTO detector with P = 5 blocks of Q secondary cells
ARQ = 32 ARQ = 8 ARQ = 4 MRPP = 2Q = 4 MRPP = 4Q = 4 MTOP = 3Q = 4 MT0P = 5O = 4
SNR, dB ARQ = 32 ARQ = 8 ARQ = 4 MRPP = 2Q = 8 MRPP = 4Q = 8 MTOP = 3Q = 8 MTOP = 5Q = 8
b
Figure 2.13
SNR, dB
Comparison of non-linear adaptive schemes to the linear AR-based filter with Q = 32,8,4. Pd versus SNR for K = 3, M = 64, target at (p = 45° and F = -0.156 a MRP and MTO with blocks of Q = 4 b MRP and MTO with blocks of Q = 8
comparable with the linear FIR filter with the same total number of cells Q; this is almost independent of the value of P. In contrast, the MTO detector operating with P blocks of Q cells, is approximately comparable with the linear AR-based FIR filter operating with P • Q cells. Figures 2.14a and 2.14b show, respectively, Pfa and P& for the case of one interfering target in the secondary data, as a function of the INR, using blocks with Q = 4
JDL MSMI Q = 32 ARQ = 32 ARQ = 4 MRPP=2Q=4 MRPP=4Q=4 MTOP = 3 Q = 4 MTOP = 5 Q = 4
MRPP=2Q=4 MRPP = 4 Q = 4 MTOP=3Q = 4 MTOP = 5 Q = 4
INR, dB
INR, dB
MRP P=2 Q=4 MRP P=4 Q=4 MTO P=3 Q=4 MTO P=5 Q=4
MRP P=2 Q=4 MRP P=4 Q=4 MTO P=3 Q=4 MTO P=5 Q=4
probability of correct selection
probability of correct selection
JDL MSMI Q=3; AR Q=32 ARQ=4 MRP P=2 Q=4 MRP P=4 Q=4 MTO P=3 Q=4 MTO P=5 Q=4
MRP P=2 Q=4 MRP P=4 Q=4 MTO P=3 Q=4 MTO P=5 Q=4
INR, dB
Figure 2.14
Comparative performance of linear and non-linear adaptive schemes using AR-based FIR in the presence of interfering targets a Pfa versus JNR for one interference b Pd versus JNR for one interference c Probability of correct filter selection for one interference d Pfa versus JNR for two interferences e Fd versus JNR for two interferences / Probability of correct filter selection for two interferences
data. Notice that the Pfa of the standard JDL, as well as of the linear AR-based FIR filter, shows a fast decrease, which also implies a corresponding loss of the detection performance (as observed from Figure 2.1a). As apparent, all non-linear adaptive techniques show a Pfa fairly constant and independent of the interference power.
The Pd of the MTO detector both with P = 3 and P = 5 clearly outperforms the MRP detector with both P = 2 and P = 4. Moreover, the MTO detector is almost unaffected by the presence of the interference; MRP shows performance degradation when the INR is not large enough to allow a clear identification of the corrupted block of secondary data. As expected, a larger P yields better performance for both schemes, which is paid in terms of an increase of computational cost. Figure 2.14c shows the probability of correct filter selection, namely the probability of selecting a filter with coefficients computed from a block not affected by the interfering target. As apparent, the MTO non-linear adaptive detector always selects uncorrupted blocks, whereas the MRP detector is unable to perform a correct selection before the ESFR is high enough; this causes its performance degradation. Figures 14d-f show similar plots for the case of two interfering targets, displaced so as to affect two different blocks of secondary data. As apparent, only the filters with P > 4 are able to maintain a false alarm rate approximately constant (Figure 2.14d); moreover, only the MTO detector with P = 5 yields a high detection performance (Figure 2.14e). This is also confirmed by the probability of correct filter selection in Figure 2.14f. Notice that with this new non-linear adaptive filter, globally P • Q secondary data are used, so that the probability of including interfering targets is P times larger than when using a single block of Q secondary data. However, in the presence of closely spaced target sequences these interferences cannot be avoided and the presented non-linear adaptive filters are effective despite their presence. This can be easily verified from Figures 2.15 and 2.16 which show the results of the nonlinear adaptive AR schemes against the real data set, with the test configuration of Table 2.1. The non-linear adaptive MRP detector with P = 2 blocks of Q = 16 cells and the non-linear adaptive MRP detector with P-A blocks of Q = 8 are shown in Figures 2.15a and 2.15b, respectively. They yield a very similar detection capability except for set G, where all targets are extracted when operating with P = 4, and the central target is lost when operating with P = 2. In fact, in the latter case both adjacent blocks of secondary data are affected by the strong interfering targets, while the central target of set G is small. Figure 2.16a shows the test statistic of the MTO detector with P = 3 and Q = 10. As apparent, all targets are extracted; when setting a threshold to detect all of them, only a single false detection cannot be avoided. Figure 2.16b shows the result obtained using the MTO detector with P = 5 blocks of Q = 4 cells. As apparent, the targets are extracted better from the clutter and they can be very easily detected by setting a threshold, without suffering any false alarm. Finally, Figure 2.16c shows that increasing the size of the individual blocks does not yield any further performance improvement. Figures 2.17a and 17b show the filter selection around target set D, corresponding to the results of Figures 2.15b and 2.16b, respectively. Notice that in this case there are some errors in the filter selection; however, these errors never appear in a cell containing a real target to be detected (cells 360 and 363). Moreover, the test statistic always has a low value in correspondence of such errors, implying that the filter operates correctly and no targets are detected in those range cells. This justifies the good performance of the non-linear adaptive detectors. It is also interesting to observe that both non-linear adaptive MRP and MTO detectors are
test statistic, 10 log 10 (T) test statistic, 101Og10 (T)
range bin
range bin
Figure 2.15
MRP test statistic versus range against recorded data by AAFTE for the targets test configuration of Table 2.1 a P = 2 and Q = 16 b P = 4 and 0 = 8
also able to correctly extract target set I, which was lost by the non-linear non-adaptive schemes. This can easily be explained recalling that this target set is close to a largely non-homogeneous area, containing a river and its banks. Under such conditions, the bank of adaptive filters (MTO with P = 5 blocks of Q = 4 cells) clearly outperforms the bank of non-adaptive filters (AR-based non-linear with median CFAR on P = 5 blocks of Q = 4 cells).
2.6
Conclusions
In the practical application of adaptive STAP filters against real data, one of the main problems is represented by non-homogeneity of the clutter background and the possible presence of interfering targets among the secondary data used to derive the filter parameters. The latter problem was recognised to be critical for the possibility of properly extracting sequences of closely spaced target echoes. Since the probability that interfering targets affect the secondary data is directly proportional to the number of secondary range cells, a first way to mitigate the problem can be to use STAP techniques that are effective even when operating with a very limited amount of secondary data. A two-dimensional FIR filtering scheme, based on the AR model for the disturbance, was considered to this purpose. The filter was shown to perform
test statistic, 101og10(T) test statistic, 101og10(T)
range bin
test statistic, 10 log 10 (T)
range bin
c
Figure 2.16
range bin
MTO test statistic versus range against recorded data by AAFTE for the targets test configuration of Table 2.1 a P = 3 and Q = 10 b P = 5 and Q = 4 c P = 5 and Q = 6
effectively against the real environment. Specifically for our case even with Q = S secondary data such a filter was shown to yield a detection performance very close to the JDL with Q = 32 secondary data. Moreover, the AR-based FIR filter is a pre-Doppler technique, where the optimisation is independent of the subsequent Doppler filter bank. This also requires a largely reduced computational cost, which is especially important for real-time applications. Unfortunately, when using only few secondary data, the possible presence of an interfering target among them produces a much more devastating effect. This is because the undesired contribution in the sample covariance matrix is averaged with
filter selection filter selection
range bin
b
Figure 2.17
range bin
Filter selection versus range against recorded data by AAFTE for targets test configuration of Table 2.1 (zoom around target set D) a MRPP = 4 a n d £ = 8 b MTO for P = 5 and Q = 4
a smaller number of uncontaminated data. Therefore, the use of two-dimensional FIR filters with short temporal support and limited adaptivity losses does not solve all of the problems, and alternative techniques were considered. In particular, a nonlinear non-adaptive scheme was considered, which is based on the selection of the most appropriate non-adaptive filter out of a bank of filters with different cancellation characteristics. The scheme was shown to yield a good clutter cancellation against the real data and to select the most appropriate filter even in the presence of interfering targets in the secondary data. However, the subsequent CA-CFAR normalisation is still largely affected by the presence of the interference. To solve the problem, a new non-linear non-adaptive filter was introduced that first selects the most appropriate non-adaptive two-dimensional cancellation filter and then selects a block of secondary data that is likely to be uncontaminated. This is obtained by splitting the secondary data in P blocks of range cells and applying the median operator to their mean power, based on the assumption that only a few range cells are expected to be contaminated by other targets. Moreover, to reduce the computational cost of the non-linear filter, the Gaussian filters are replaced with AR-based non-adaptive FIR filters and the filter selection is performed using only the output power corresponding to the CUT. This scheme is shown to be effective against the real data even when a few sets of closely spaced targets are injected. The only weakness of this filter consists in the limited capability of such a scheme to adapt to different and changing clutter conditions as well as to mismatches between assumed and real platform motion parameters and to potential calibration errors in the antenna array.
Finally, two new non-linear adaptive STAP schemes have been presented for the target detection against a non-homogeneous environment. These filters are obtained by selecting the most appropriate filter among a set of two-dimensional AR-based adaptive FIR filters, obtained by estimating the AR parameters on P different blocks of secondary data. Their effectiveness against the presence of interfering targets has been shown both by means of simulated analysis and by application to a real data set. The adaptive nature of the individual filters ensures that the non-linear adaptive scheme is able to cope with any mismatch in system and environment conditions. Moreover, the low computational cost of the proposed schemes, together with their robustness to non-homogeneity and interference, makes them appealing for the practical real-time application. 2.7
Acknowledgments
The authors gratefully thank Dr Alfonso Farina (AMS) for many fruitful discussions on these topics and for his encouragement in this work. They also acknowledge the possibility to use the AAFTE data set collected during the work of Dr Fred Staudaher and Dr Fred Lee and their group at the Radar Division of NLR. Finally, they acknowledge the collaboration with FIAR Spa that originated some of the theoretical and simulated results presented in Sections 2.3 and 2.5. 2.8
Appendix: ML estimation of two-dimensional AR parameters
Using the matrix Y, the joint PDF of the secondary data is simply written as:
(2.21) By defining the matrix L so that R it yields:
x
= LL* and M^y (2.22)
where B =
(2.23)
For convenience, we decompose the matrix MLY in blocks of size K(L — 1) and K, respectively:
(2.24)
Using equation (2.24), the value of B that maximises the exponent of equation (2.22), under the constraint of having the last ^-dimensional block equal to the identity matrix, is:
(2.25)
Therefore, we have the ML estimate A = M^00MyOi • Using this value, we have for the trace: tr{K*KMLY} = ?r{-M* y o l M-^ 0 0 M L y 0 i + M L n i } = f r f - L L ^ M ^ 1 ] ^ } (2.26) where [My ]^,L is the last KxK block in the main diagonal of the inverse of My. Therefore, the maximum of the PDF with respect to A can be rewritten as: max{/?0(Y)} =
(TT-K\R\)^M-L+1)
exp[-;r{R~ 1 PV^ 1JZ i l l
A
By maximising equation (2.27) with respect to R, 1/(2(M-L +I))[M"1]^.
(2.27)
'
it yields R
=
References 1 KLEMM, R.: 'Principles of space-time adaptive processing-principles and applications' (IEE, London, 2002, 2nd edn.) 2 KELLY, E. J.: 'An adaptive detection algorithm', IEEE Trans. Aerosp. Electron. Syst., 1986, AES-22, (1), pp. 115-127 3 BRENNAN, L. E., MALLET, J. D., and REED, I. S.: 'Adaptive arrays in airborne MTI radar' IEEE Trans. Antennas and Propagation, 1976, AP-24, (5), pp. 607-615 4 WANG, H. and CAI, L.: 'On adaptive spatial-temporal processing for airborne surveillance radar systems', IEEE Trans. Aerosp. Electron. Syst., 1994, AES-30, (3), pp. 660-670 5 LOMBARDO, P., GRECO, M. V., GINI, R, FARINA, A., and BILLINGSLEY, J. B.: 'Impact clutter spectra on radar performance prediction', IEEE Trans. Aerosp. Electron. Syst., 2001, AES-37, (3), pp. 1022-1038 6 FARINA, A., GRAZIANO, R., LEE, F., and TIMMONERI, L.: 'Adaptive space-time processing with systolic algorithm: experimental results using recorded live data'. Proceedings of international conference on Radar, Radar 95, Washington D.C., 8-11 May 1995, pp. 595-602 7 FARINA, A., LOMBARDO, R, and PIRRI, M.: 'Non-linear space-time processing for airborne early warning radar', IEEProc, Radar Sonar Navig., 1998,145, (1), pp. 9-18 8 FARINA, A., LOMBARDO, P., and PIRRI, M.: 'Non-linear STAP processing', Electron. Commun. Eng. J., 1999, 11, (1), pp. 41-48
9 KAY, S. M. and NAGESHA, V.: 'Maximum likelihood estimation of signals in autoregressive noise', IEEE Trans. Signal Process., 1994, SP-42, (1), pp. 88-101 10 LOMBARDO, P.: 4DPCA processing for SAR moving target detection in the presence of internal clutter motion and velocity mismatch'. Microwave sensing and synthetic aperture radar, EUROPTO, 2958, September 1996, Taormina, Italy, pp. 50-61 11 LOMBARDO, P.: 'Optimum multichannel SAR detection of slowly moving targets in the presence of internal clutter motion'. CIE-ICR'96, international Radar conference, Beijing, China, 8-11 October 1996, pp. 321-325 12 KLEMM, R. and ENDER, J.: 'Multidimensional digital filters for moving sensor arrays'. Proceedings IASTED on Signal processing and digital filtering, June 1990, Lugano, Switzerland, pp. 9-12 13 KLEMM, R. and ENDER, J.: 'Two-dimensional filters for radar and sonar applications'. Signal Processing V EUSIPCO, September 1990, Barcelona, Elsevier Science Publisher, B.V., pp. 2023-2026 14 WICKS, M. C , MELVIN, W. L., and CHEN, P.: 'An efficient architecture for nonhomogeneity detection in space-time adaptive processing airborne early warning radar'. IEE international Radar conference, Radar'97, October 1997, Edinburgh, UK, pp. 295-299 15 ADVE, R. S., HALE, T. B., and WICKS, M. C : 'Practical joint domain localised adaptive processing in homogeneous and nonhomogeneous environments. Part 2: Nonhomogeneous environments', IEEProc, Radar SonarNavig., 2000,147, (2), pp. 66-74 16 FARINA, A.: 'Linear and non-linear filters for clutter cancellation in radar system', Signal Process., 1997, (59), pp.101-112 17 FARINA, A., LOMBARDO, P., and CARAMANICA, F.: 'Non-linear nonadaptive clutter cancellation for airborne early warning radar'. IEE international Radar conference, Radar'97, Edinburgh, October 1997, pp. 420^24 18 KLEMM, R.: 'Adaptive clutter suppression for airborne phased array radar', IEE Proc. F and H, 1983,130, (1), pp. 125-132 19 LOMBARDO, P.: 'Echoes covariance modelling for SAR along-track interferometry'. IEEE international symposium IGARSS '96, Lincoln, Nebraska, USA, May 1996, pp. 347-349 20 LOMBARDO, P. and COLONE, F.: 'Non-linear STAP filters based on adaptive 2D-FIR filters'. IEEE Radar conference, Alabama, USA, May 2003, pp. 51-58
Chapter 3
Space-time techniques for SAR Alfonso Farina and Pierfrancesco Lombardo
3.1
Summary
This contribution describes the application of STAP (space time adaptive processing) to synthetic aperture radar (SAR) systems. SAR is a microwave sensor that allows us to have a high resolution mapping of electromagnetic (EM) backscatter from an observed scene. A two-dimensional image is provided in the radar polar coordinates, i.e. slant range and azimuth. High resolution in slant range is obtained by transmitting a coded waveform, with a large value of the time-bandwidth product, and coherently processing the echoes in a filter matched to the waveform. High resolution along the transversal direction is achieved by forming a synthetic aperture. This requires us to: (i) put the radar on board of a moving platform, e.g. an aircraft or a satellite (ii) record the EM signals from each scatterer which is illuminated by the moving antenna beam in successive instants of time (iii) coherently combine the signals - via a suitable azimuthal matched filter - thus focusing the sliding antenna pattern in a narrower synthetic beam [I]. The advantage of combining SAR and STAP is evident: the detected moving target is shown on top of the SAR image of the sensed scene. This Chapter describes in detail the multichannel SAR (MSAR). 3.2
Description of the problem and state of the art
In many applications (e.g. surveillance) of SAR, it is desirable to detect and possibly produce focused images of moving objects. A moving low RCS object is not easily detectable against strong echoes scattered from an extended fixed scene. When detected, its resulting image is smeared and ill positioned with respect to the stationary background. These shortcomings are a direct consequence of the SAR image
formation process. The cross-range high resolution in an SAR is obtained by taking advantage of the relative motion, supposed known, between the sensor and the scene. If, however, there is an object moving in an unpredictable manner, the image formation process does not function properly. Basically, the main degradations due to the target motion are: (i)
(ii)
The range migration through adjacent resolution cells (due to the radial velocity of target with respect to radar) causes a reduction of the signal-to-clutter power ratio, which can seriously impair the detection capabilities. Furthermore, range migration causes a decrease in the integration time and a consequent loss of resolution. Even in the absence of range migration, or after its correction, the phase shift induced by the motion causes: an ill-positioning (along track) of the target image with respect to ground, mainly owing to the range component of the relative radar-target velocity; a smearing of the image due to the uncompensated cross-range velocity and/or range acceleration.
An initial possibility that has been studied for discriminating the moving target signals from the fixed scene returns is on the basis of their different Doppler frequency spectra; see, for instance, Reference 2 and Reference 37. In fact, the target spectrum has a Doppler centroid approximately linearly proportional to the along-range velocity of target and a spectrum width depending on the azimuthal velocity and the radial acceleration components of target. Assuming that the radar pulse repetition frequency (PRF) is high enough to make available a region in the Doppler frequency domain not occupied by the stationary scene, the method works as follows (see Section 3.4.2 for details). First, transform a sequence of radar target returns to the frequency domain. Second, locate spectral bands, outside the narrowband frequency around the origin corresponding to stationary scene, and determine the centre frequencies of such bands. Third, translate each outlying spectral band to the origin, convert the resulting signal back to the time domain and correlate with the reference function of the conventional SAR. The correlator output will show the peaks in the correct locations of the targets. A refinement of this basic technique aims at the image formation of each target: it is obtained by also matching the width, not only the mean value, of the spectral band outside the stationary scene Doppler spectrum. The method suffers, however, from three shortcomings: (i)
It requires the use of a high PRF which causes a corresponding reduction of the SAR swath width and an increase of the data throughput. (ii) It does not correctly focus the image of a target having a quite arbitrary path. The spectrum of the target echoes alone is not sufficient; we need to know the instantaneous phase law to form the synthetic aperture with respect to the moving target. (iii) It does not succeed with a target whose motion has a small range velocity component, so that its spectrum is superimposed on the clutter (i.e. on the stationary scene) spectrum.
A distinct advantage of this system relates to the possibility of using it with conventional, non-multichannel phased array radar antennas. More powerful methods have been conceived to overcome these drawbacks; they are based on the use of more than one antenna, on board the moving platform, to cancel the clutter and detect the slowly moving targets. The radar system uses an array of antennas, mounted on the platform along the flight direction, and corresponding receiving channels. This makes available a certain number of space samples (echoes received from different antenna elements) and time samples (echoes collected at different time instants). These echoes are coherently combined, with proper weights, in a space-time processor to cancel the echo backscattered from the ground and enhance the target echo. Space-time effectively reduces the lower bound on the minimum detectable target velocity that would be established by using only frequency filtering. It measures the relative phase between two or more coherent signals, received from different antennas, rather than the Doppler frequency shift within a single receiving channel. Instead of using mono-dimensional filtering, clutter cancellation is the result of a powerful two-dimensional (in the temporal frequency, i.e. Doppler, and in the spatial frequency, i.e. azimuth angle) filtering. Furthermore, this method does not require necessarily to work with high PRF values. This is the STAP approach: see References 3, 4 and 5 for details. However, the conventional STAP techniques have to be extended to be made compatible with the MSAR case, which is intrinsically characterised by a long integration time, during which both target and clutter Doppler and direction of arrival (DoA) change. These characteristics are reviewed in Section 3.3, and Section 3.4.1 presents a taxonomy of a number of MSAR processing techniques proposed in the literature to jointly exploit the effectiveness of SAR and STAP techniques. The way to fully-fledged STAP wasn't immediate: after leaving the single-channel approach (Section 3.4.2) it passed through ATI applied to SAR (described in Section 3.4.4) and DPCA (see Section 3.4.3); both techniques being essentially based on the use of the echoes captured by two antennas. A refinement of ATI-SAR was the VSAR (velocity SAR) method [6]. In a way similar to the progression from a two-pulse canceller to a bank of Doppler filters to reject clutter and detect moving targets in a conventional search radar, the technique can be generalised to a linear array of identical antennas. For each channel a complex SAR image is focused. A Fourier transform along the physical aperture (i.e. the channel number) is applied to each pixel, and this corresponds to a multiple beam former. For each Fourier cell the related image shows the scene for a certain range of radial velocities (velocity SAR image [6]). This method wasn't, however, originally designed to suppress clutter, since no attempt is made to subtract signals. The requirement to cancel the echoes from stationary scatterers leads directly to adaptive space-time filtering. Two classes of advanced STAP techniques are considered in particular for the MSAR case: (i) time-domain reduced DoF (degrees of freedom) adaptive two-dimensional finite impulse response (FIR) filters (Sections 3.4.5.2, [7-11] and Section 3.4.6) (ii) frequency-domain reduced DoF adaptive processing [12].
Finally, Section 3.4.6 considers the optimum MSAR approach in a special case for the clutter characteristics, to gain insight into the properties of the optimum filter and its effectiveness. This can be used for comparison of the different filters and yields the upper bound for achievable performance. Once the presence of a moving target has been detected, we have to estimate its phase modulation law to be able to form a high resolution image of it. A method for providing the estimate is by means of time-frequency analysis of the received signal (Section 3.4.5.1). This, combined with STAP, brings us to the joint spacetime-frequency processing presented in detail in Section 3.4.5.2. The time-frequency representation is obtained by evaluating the Wigner-Ville distribution (WVD) of the signal. This distribution is a signal representation consisting in the mapping of the signal onto a plane whose coordinates are time and frequency. The WVD, in particular, produces a mapping such that the signal energy is concentrated along the curve of the instantaneous frequency. This frequency is obtained as the centre of gravity of the WVD; the instantaneous phase is derived by integration of the instantaneous frequency. The clutter echoes are cancelled by the adaptive space-time processor, where the space-time covariance matrix of clutter is estimated online and used to evaluate the optimal weights of the two-dimensional filter. The time-frequency analysis provides an estimation of the instantaneous frequency of the possibly present moving target, and - by integration - the original instantaneous phase. The phase is used to compensate for the shift due to the relative target-radar motion.
33
Model of MSAR echoes
3.3.1 Aberrations due to target motion There are some interesting effects that occur with moving targets. A moving target with a radial component of velocity vr results in a Doppler shift on each echo of: /o = ^
(3.1) C
where /o is the radar carrier frequency and c is the velocity of propagation. Thus the Doppler history of the sequence of echoes is shifted in frequency (solid line of Figure 3.1), and is matched filtered with a reference chirp (dashed line of Figure 3.1). This produces a shift in the azimuth position, which is given by the product of the target Doppler shift and the slope of the Doppler history
yb-£ = ^
0.2)
where v is the platform speed, r is the platform-target range and d is the along-track dimension of the antenna (the real aperture). It is well known that an image from an aircraftborne SAR of a moving train having a component of velocity in the range direction appears shifted, so it appears to be travelling not along the railway track, but displaced to the side! As another example, a ship in a satellite SAR image with a radial velocity of 10 m/s at a range of 1200 km would experience an azimuth shift of
5 CN
Il ^S
JO
I I ex
a O
1 synthetic aperture length = rl/d
Figure 3.1 A target with a radial velocity (solid line) is matched filtered with the SAR azimuthal reference chirp (dashed line) 1.7 km. On the other hand, the ship wake (which is stationary) appears in the correct position. Thus the ship appears not at the tip of the wake, but displaced in azimuth. This effect is visible in a number of spaceborne SAR images. From knowledge of the geometry, and of the azimuth shift, it is possible to estimate the target velocity.
3.3.2 Space-time-frequency representation The MSAR allows Doppler and angular information to be decoupled by means of the along-track interferometric processing. The derivation of optimum clutter cancellation schemes for moving target detection requires the definition of a model for the covariance of the MSAR space-time clutter echoes to take full advantage of this potentiality. Moreover, a proper representation space for the resulting MSAR space-time model is required to adequately interpret the results. Both models and representations are available separately for single-channel SAR, where the long observation time and the consequent non-linear phase history of the echoes are the main issues, and for multichannel systems [4, Chapters 2 and 3], which assume, on the contrary, a short integration time and focus on the angular characteristics. In this section, a simplified closed-form model for the MSAR echoes is described, which takes into account both non-linear phase modulation and angular position at the same time and defines a proper representation space for it. Even though simple to handle, the model encodes all the main characteristics of the scattering from the observed scene [13]. 3.3.2.1 Echoes from homogeneous correlated clutter A simplified condition is assumed in the following, for which the radiation patterns of transmitting and receiving antennas have the same width. This allows us to reduce again the analytical complexity of the analysis, while considering the effect of parameters. The simplified model is used in the present section to include the effect
TX/RX array antenna
Figure 3.2
The multichannel SAR observation geometry (PRT:pulse repetition time)
of the terrain reflectivity correlation. With reference to the slant plane geometry in Figure 3.2, assume that the radar transmitting antenna moves, with constant velocity v, along a straight trajectory at a fixed distance Ro from the g-axis (crossing the r-axis at time t = 0) and has a fixed pointing, orthogonal to the flight path. The sequence of echoes relative to the TV pulses, transmitted with pulse repetition time PRT, is received by a uniform linear array of K antennas, parallel to the radar trajectory. The K receiving antennas have separate receiving channels and phase centres at distance Sk = (k — (K — l)/2) A, k = 0 , . . . , K — 1 from the transmitter. A pointlike scatterer T is assumed to be for t = 0 on the g-axis at the position xq and to move with velocity components vq and vr along the two axes q and r, named along-track and cross-track. It is further assumed that: (i) the range cell migration is negligible or has been corrected for (ii) the two-way antenna pattern, for the channel k, has the Gaussian shape gk [y] = \/{y/nXq) exp[— (y — sk/2)2/X^\, Xqy being the along-track position of the scatterer relative to the phase centre of the transmitter (iii) quadratic terms in the receiving antennas displacements can be neglected and the Fresnel approximation is valid for the distance of the scatterer from the transmitter (narrow antenna pattern). Thus the echo received by the &th receiving antenna at time tn = (n — (N — l)/2) PRT, n = 0 , . . . , Af — 1 can be modelled as:
(3.3)
where Ao and O are constant amplitude and phase terms and fy = 2vr/X, the Doppler frequency due to the cross-track velocity for the wavelength X. Equation (3.3) takes into account the central Doppler frequency and DoA of the scatterer, which are the usual model for space-time processing techniques based on a short integration time. Moreover, the quadratic term encodes the time varying Doppler and DoA, observed in the long SAR integration time. The clutter echo Ck (t), received at time t and receiving element Jc, is obtained by integrating the echoes from the infinitesimal clutter patches of dimension dxq, modelled as equation (3.3) with instantaneous reflectivity Ao = IJi(xq, t)dxq. The correlation of the clutter echoes received at times tn x = t,tn2 = t+r and receivers in Sk1, Sk2 = Sk1 + 2rj is:
(3.4) the symbol (•) standing for the statistical expectation. The model for homogeneous correlated clutter is obtained in the hypothesis of factorisation of the spatial and temporal correlations, px(x) and pt(t), of the clutter reflectivity: (3.5) Using a Gaussian spatial correlation, with variance o2,px(x) = (\f2nGc)~x 2 exp[—x /(2 a*)], the double integration in equation (3.4) becomes a Gaussian function of the space-time displacement, z = (v — vq)r + rj9 of the two-way phase centre and is thus stationary in both space and time:
(3.6) where E 2 = 1/[1/X2 + (2nXq/(XRo))2] is the square of the maximum SAR resolution. By taking the bidimensional Fourier transform of equation (3.6) with respect to time: t —> f, and space: r\ —> sin(0)/X ^ 6/X, we obtain the clutter power spectral density (PSD) as a function of frequency / and angle 0: (3.7) where Ft [/], is the Fourier transform of pt(r). In the absence of temporal decorrelation (pt (r) = 1), P(f, 0) reduces to a sheet for / = fd + (v — vq)0/X, whose Gaussian shaped amplitude is controlled by the variance £ 2 + o2. This reduces to the square of the SAR resolution for uncorrelated reflectivity and grows with the spatial correlation a2 otherwise. This can be especially important for the new generation of VHF SAR systems, to which the reflectivity of a natural scene can appear more correlated than
to microwave sensors. It applies also in a number of remote sensing applications over smooth surfaces, such as sea or ice covered regions and in some planet exploration missions, where the correlation of the surface scattering is not negligible and also a coherent contribution can be present in the echo. This is evident from the behaviour of the PSD that for a\ —> oo behaves as a Dirac delta for 0 = 0. As expected, the mean cross-track velocity of the observed surface (as, for instance, the sea surface) produces a constant frequency shift, whereas a mean along-track velocity changes the slope of the clutter ridge. The presence of temporal decorrelation spreads the PSD around the straight line above, according to the function FVf/], and Xq controls its amplitude, affecting the angle over which the transmitted power is spread.
3.3.2.2 Representation of MSAR echoes Adequate representation strategies are available separately for single-channel SAR, where the long coherent integration interval (CPI) and the consequent non-linear phase history of the echoes are the main issues, and for multichannel MTI systems, which assume, on the contrary, a short CPI and focus on the angular characteristics. In the present section it is shown that the representation planes used for the systems above are inadequate to fully represent the MSAR echoes. The need for a proper representation space for the MSAR echoes is thus illustrated, which takes into account both non-linear phase modulation and angular position at the same time. The angle-frequency plane (O9 f) in Figure 3.3 is the preferred representation space for the clutter covariance in multichannel systems [4, Chapters 2 and 3]. A short observation time is assumed, so that Doppler frequency and DoA of the single scatterer are constant and the array of receivers is used to exploit the scatterers' angle. The PSD in equation (3.7) is directly mapped into this plane, which seems thus appropriate for homogeneous clutter. However, when the observation time is long, both DoA and Doppler frequency of the clutter echo from the single surface scatterer depend on time (equation (3.3)). This can't be represented in the (O, f) plane, where the contribution from each patch of an homogeneous clutter moves in time along a line with constant slope (see arrows in Figure 3.3). Since the scatterers that quit the antenna beam are replaced by new ones entering, on average, the same PSD is observed. Moreover, since the time-varying characteristic of the echo's DoA and Doppler spreads its power over a line in the (O9 / ) plane, the gain of the SAR coherent integration over the noise can't be related directly to Doppler or angular filtering in this plane. This applies also for the detection of targets, with a motion different from that of the clutter patches. The time-frequency plane (t, / ) in Figure 3.4 is the preferred representation space for single channel SAR, where a long observation time is considered. It allows the correct representation of the time-varying characteristic of the Doppler frequency but doesn't contain angular information. Thus the Doppler frequency / of the generic scatterer, shown in this plane, relates to a combination of cross-track velocity and angular position: this ambiguity cannot be resolved. This is shown in Figure 3.4, where solid and dashed lines represent the echo from the same homogeneous clutter
Figure 3.3 Frequency angle plane: typical of STAP (PRT: pulse repetition time)
Figure 3.4
Frequency-time plane: typical of SAR (PRT: pulse repetition time)
patch, received by different channels. The clutter edge is localised in time in the (t9 / ) plane and the SAR coherent integration gain is now clear. From the analysis above it can be seen that, to interpret the MSAR echoes properly, a higher dimensional space is required, which allows both Doppler frequency
Figure 3.5
Space-frequency-time volume: typical of MSAR (PRT: pulse repetition time)
and DoA to be represented as functions of time [13]. The space-time-frequency space (0, t, / ) , in Figure 3.5, is thus introduced. Its integration over the temporal axis collapses it back into the (O, f) plane, and integration over the angular axis collapses it into the (t, / ) plane. In this space the motion of the scatterer echoes in the Doppler angle limits of the antenna beam are correctly represented for both homogeneous and non-homogeneous scene: ( ). Moreover, the generic target echo: (_._), with velocity components different from the clutter background can be effectively represented in the volume of Figure 3.5 and discriminated from the clutter echoes. This representation can be used to get inside the characteristics of the different processing schemes for the processing of MSAR data and fully understand the effect of their application.
3.4
Processing schemes
In the following several processing schemes for the detection and imaging of moving targets are described.
3.4.1
Taxonomy of processing schemes for MSAR
A wide range of processing architectures has been derived in the last few years to detect and focus moving targets using SAR systems with K antennas, based on the digitised echoes received during the long sequence of N PRI from the Q range cells under analysis. The above mentioned architectures are characterised by different approaches to deal with the three main parameters of the received echo signals: alongtrack velocity (Doppler rate), cross-track velocity (Doppler), and DoA. A brief review of the different processing architectures is reported below.
3.4.1.1
1st processing architecture: optimum filter with very long integration time (due to the extended synthetic aperture required to achieve high spatial resolution) With respect to the conventional optimum STAP filter [4, Chapter 4], this optimum filter (see Figure 3.6) is characterised by a target steering vector with Doppler frequency and DoA that cannot be taken constant during CPI. As apparent from Section 3.3.2, with MSAR these quantities might change considerably during long CPI. This filter has the obvious advantage of yielding an optimum approach, however, it has the full computational complexity due to the three-dimensional filter bank (Doppler rate, Doppler, DoA). Only in special cases can this optimal solution be easily derived and interpreted [10, H]. Moreover, the adaptivity of the filters (ideally the filter weight vector is w = s^R" 1 where H stands for complex conjugate transpose) requires very many taps for each filter of the bank and a very large training area with homogeneous clutter, to estimate the clutter covariance matrix R.
3.4.1.2
2nd processing architecture: STAP filtering + coherent integration for SAR processing [9] This suboptimum scheme (see Figure 3.7) is obtained by using a STAP cancellation filter which performs the clutter cancellation and collapses the K channels into a single ideally clutter-free channel. A two-dimensional filter bank (Doppler rate, Doppler) follows to detect the target. This is based on the consideration that cross-track and speed both contribute to modify the linear phase term (Section 3.3.1). Moreover, the filter effect of STAP is related independently to cross-track speed and DoA. The effect of the STAP filter on the second stage is also analysed in Reference 14. This architecture is less computationally demanding and yields a reasonable suboptimum processing scheme.
K channels
Figure 3.6
target detection & imaging
Optimum processing scheme of MSAR
K channels
Figure 3.7
STAP: 3D filter bank: •DoA •Doppler •Doppler rate
STAP Cancellation filter
1 channel
2D filter bank: •Doppler •Doppler rate via Wigner-Ville
Space-time-frequency processing
target detection & imaging
3.4.1.3
3rd processing architecture: formation of SAR image & detection of moving targets This processing scheme requires the application of a conventional MTI clutter canceller on each channel separately. Then the formation of K SAR images is performed (see Figure 3.8), with the corresponding phase compensation (as it happens for Interfermetic SAR (InSAR)). This is followed by a one-dimensional (Doppler) filter bank for the final target detection. The reduced computational cost of this processing architecture yields largely degraded performance. It is especially difficult to compensate for the along-track speed of the target different from the clutter. This technique does not exploit the spatial processing dimension of the multichannel antenna for clutter cancellation. It is therefore (except for the signal to noise power ratio (SNR)) equivalent to a single-channel MTI SAR. 3.4.1.4
4th processing architecture: joint domain localised (JDL) for MSAR [15] The scheme is depicted in Figure 3.9. First a time-varying transformation is applied to the space-time data to compensate for the time-varying Doppler frequency of the clutter echoes. Therefore, a large reduction of degrees of freedom is performed in the Doppler-DoA plane, after two-dimensional FFT. This is followed by an adaptive optimum generalised likelihood ratio test applied in the reduced domain [16]. This
MTI
SAR
MTI
SAR
MTI
SAR
ID filter bank: •Doppler
K channels
Figure 3.8
Channelised MTI&SAR processing time-varying transformation
NK samples
Figure 3.9
2DFFT
discard data
Yes target GLRT
No target
to compensate for cluster of 2D beams adaptivity on generalised Doppler frequency in Doppler & spatial a reduced number likelihood and DoA variation frequencies domain OfDoF ratio test during CPI
Joint domain localised (JDL) on MSAR
RX-K
SAR processor 1
SAR processor 2
TX
SAR processor K
velocity processor
Figure 3.10
Velocity SAR
scheme has low computational complexity, close to optimum detection performance, and reduced size of required homogeneous clutter area. However, it requires a proper time-varying transformation and is less intuitive for targets with non-negligible alongtrack velocity component. 3.4.1.5 5th processing architecture: velocity SAR (VSAR) [6] As sketched in Figure 3.10, the set of complex video signals is processed by SAR processors to produce complex images: Yk(x, y), k = 0 , . . . , K — 1 with x, y azimuth, range coordinates. Phase of formed images is preserved. The post-processing of complex images brings out the velocity dimension. This step involves processing of each pixel for all images. Consider the whole set of images as a single threedimensional image: Yk(x9 y, k); the velocity processing applies along the rc-axis and provides the resulting three-dimensional image: Z(;t, y, v) in azimuth, range and velocity of the observed scene. Velocity processing in its simple form involves Fourier transformation of K points along the A>axis. Finally, each velocity plane is shifted by an amount proportional to its velocity to correct the motion-induced azimuth displacement. All the planes are summed to produce the final undistorted VSAR. The method is not designed to suppress clutter, since no attempt is made to subtract signals. The requirement to cancel the echoes from stationary scatterers leads directly to adaptive space-time filtering. 3.4.1.6 6th processing architecture: processing in the frequency domain This method finds its mathematical foundation in the stochastic stationary characteristic of the clutter processes that have natural description in the Fourier domain via the spectral density matrix. The Fourier transforms (FT) of the process for fixed
FFT
FFT
FFT receiving channels
spatial null for each frequency bin target match in space
target match in frequency Threshold
Figure 3.11 Frequency domain processing for MSAR [12] frequencies are asymptotically independent when the time base tends to infinity. Thus cross-correlations between frequency channels are negligible. Therefore, frequency processing is valid asymptotically, since the spectral representation provides a time signal extending from — to + infinity. For SAR we have in the limit an infinite sequence of equispaced samples along the pulse-to-pulse time (slow time). This is in contrast to the finite pulse train of airborne early warning (AEW) search radar. For azimuth and range compressions the FT is performed in any case. Moderate time base (= synthetic aperture length) is sufficient to make negligible the cross-terms between the frequency channels. In Doppler domain processing, the clutter energy is collected in one-dimensional subspace. This is the key to using projection methods (see Figure 3.11) with the advantage that the clutter is cancelled perfectly without sensitivity to its amplitude variations. A good estimate of the covariance matrix is achievable since there is a large number of range bins. Even though clutter to noise power ratio (CNR) varies with range, the structure of underlying clutter subspace remains unchanged. The computational load is affordable if only a few spatial channels (three is the minimum) are used for long sample sequences. SMI (sample matrix inverse) and eigendecomposition of 3 by 3 matrices are performed very fast. For details see Reference 12. 3.4.1.7
7th processing architecture: displaced phase centre antenna (DPCA) for SAR The concept of DPCA requires an antenna divided in two subarrays and the transmission of two pulses. Due to the aircraft movement, the transmitting and receiving
antennas form two bistatic configurations for the two pulses. If the subarrays' displacement, the platform speed and the radar PRF are properly selected, the global two-way phase centres of the bistatic antenna configurations are coincident. The stationary clutter is seen at two different time instants from the same radar location and it can be cancelled by subtracting the corresponding echoes. The DPCA corresponds to a kind of spatial MTI: returns from stationary objects cancel, while moving target echoes are maintained. The extreme simplicity of this approach is paid for by very strong constraints on the antenna, PRF and platform speed, which are often unacceptable. Moreover, the technique has no ability to compensate for any mismatch from this idealised condition by means of adaptivity. 3.4.1.8
8th processing architecture: along-track interferometty SAR (ATI-SAR) This operates similarly to DPCA using two displaced antennas connected to two receiving channels. An SAR image is generated for each channel; thereafter, the time delay between the azimuth signals is compensated for using two different azimuth reference signals. By multiplying the first image by the complex conjugate of the second, the remaining phase is zero for stationary objects and non-zero otherwise. Basically this technique is closely related to DPCA and STAR It may suffer from constraints imposed on the processing according to SAR requirements (SAR requires low PRF values to have a wide along-range swath width, and STAP needs large PRF to detect also fast moving targets).
3.4.1.9 9th processing architecture: pulse Doppler and MTI [2] This technique is derived from the well known moving target detector (MTD) processing widely used in conventional ground-based radar. After range compression, an azimuth processor is developed to detect the presence of a moving point-like target in each range cell and to measure its velocity components. The method is straightforward and simple to implement under the conditions that the target velocity is bounded within a minimum detectable value and the unambiguous value, and that range migration is negligible. In the following we will describe in some detail the following processing schemes: MTI + PD (Section 3.4.2), DPCA (Section 3.4.3), ATI-SAR(Section 3.4.4), joint space-time-frequency (Section 3.4.5), optimum filter for a special case (Section 3.4.6). We prefer to follow the historical derivation rather than the optimum approach from which all the suboptimum schemes can be derived.
3.4.2 MTI+ PD The material of this section is derived from Reference 2 which describes the work done by colleagues of the authors. The processing technique, referred to as moving target detection and imaging (MTDI), has been derived by the well known MTD processing widely used in conventional ground-based radars. A range-Doppler SAR processing is adopted; the raw data are first processed along the range direction and then along the azimuth. An azimuth processor is developed to detect the presence of
beam footprint
Figure 3.12
Geometry of SAR and moving target
a moving point-like target in each range cell and to measure its velocity components. The method is valid under the following hypotheses, namely: • •
the target velocity is bounded within minimum detectable and maximum unambiguous values (i.e. PRF/2) the SAR system and the moving target cause a negligible range migration.
It should be noted that with a one-channel antenna no detection of endoclutter targets (i.e. targets with Doppler frequency within the clutter spectrum) is possible. Increasing the PRF may not be desirable because of an increase in range ambiguities, and likewise for SAR applications. The mathematical model of the echo received by the radar antenna during the synthetic aperture time interval is reported in this section. Figure 3.12 sketches the geometry of an SAR system and a moving object of interest. The antenna, on board an aircraft, moves along the azimuth direction x. The antenna beampattern is directed orthogonal to the flight path; 0 (the off-nadir angle) is the angle formed by the normal to the ground and the line from the radar to the central point of the scene; Vx and vy are the velocity components of the target along the reference coordinates. Along the azimuth, the radar transmits pulse trains with repetition frequency PRF, each pulse having a linear frequency modulation (chirp). To account for some unpredictable changes in the environment wherein the transmitter operates, an unknown initial phase 0o» modelled as a random variate uniformly distributed in (0,2n), is assumed in the transmitted signal. At the nth azimuth position of the antenna, the transmitted pulse is expressed as: Tn(t) = A cos(2jtf0t + at2 + 0O),
~
X
-
(3.8)
where A and r are the pulse amplitude and the pulse width, respectively, /o is the carrier frequency, a = 2JTB/T is the chirp rate, and B is the chirp bandwidth. Consider now a point-like scatterer on a completely absorbing background; the echo received by the antenna at the nth azimuth position, after down frequency conversion, can be modelled as: Sn(t) = AlGOg0(O,
v sin 0 Fdc = - 1 Y -
F =
( 3 - 10 >
2(V - vx)2
* —5i*T~
(3 11}
-
where V is the platform speed, Vx and vy are the target velocity components respectively along the x- and y-axes, and Ro is the range between the platform and the scene centre. The above approximation leads to a useful expression for the bandwidth of the azimuth chirp, i.e.: Bd =
2{V Vx)
~
= FjrTi
(3.12)
LJ
with L being the along-track antenna length and 7} the integration time, i.e. the time during which the target is illuminated by the antenna main lobe. The signal Sn (t), sampled at the proper frequency Fc, is stored as a column in the holographic matrix S. The dimensions, Nsr and Nsa, of the matrix S represent the number of range and the azimuth samples, respectively. The entry Smn of S can be reparameterised to elicit the dependence on the Doppler centroid Fdc and the Doppler rate F^ r , namely: Smn = Alcrogo($,
(3.13)
where tm = m/Fc is the range time (fast time) and tn is the azimuth time (slow time). A conventional SAR processor, designed to provide the image of a stationary scene, works separately along the range and the azimuth directions. Specifically, at the first stage each column of the holographic matrix is convolved with the impulse response function (IRF) hr of the range filter yielding the range-compressed data. At the second
stage, each row of the resulting matrix is convolved with the IRF ha of the azimuth filter, thus providing the final image. Useful expressions for hr and ha, derived from equation (3.13), are: M*m) = expOa£),
m = 1,2,...,JV,
(3.14)
ha(tn)
n = l,2,...,Na
(3.15)
= exp(j27tFdr0tl),
where Fjro is the Doppler rate (equation (3.11)) for Vx = 0. The conventional processing fails when the convolutions are implemented by means of equations (3.14) and (3.15) on the signals coming from moving objects for which F& ^ F^rO a n d F^c 7^ 0. In MTD technique the Doppler frequency shift is used as a means of detecting moving targets embedded in a strong ground backscatter (clutter). A delay-time canceller behaves as a filter to reject the low Doppler components associated with the clutter and to preserve the high Doppler components of the moving targets. The canceller is cascaded with a bank of narrowband filters (channels), uniformly spread in the PRF interval. When matched filtering is performed, only that Doppler channel containing the target echo will supply a significantly non-zero output. These concepts are amenable to extension to SAR application: in fact, for sensing and imaging purposes, the stationary scene resembles clutter and the point-like moving object represents the target. It appears convenient to refer to this approach as MTDI, since it is the natural extension of MTD to SAR. However, some novel problems, arise when we deal with SAR. First, the representation of the signal returned by a scatterer results in an intrinsically two-dimensional problem. In some airborne cases, however, the dwell time is usually short and the range cell migration is avoided. Whenever the SAR system parameters do not induce range migration by themselves, a moving target could still be displaced over more range lines if its radial velocity is high enough to encompass more range lines during the integration time, i.e. if: (3.16) where Afrcm is the number of range migration cells and 8r is the range resolution of the SAR system. Assuming an airborne SAR with 7} = 0.2 s, 6 = 45°, 8r = 4 m, and substituting the numerical values in equation (3.16), a maximum target speed of 30m/s along the range direction is allowed to avoid range migration (Nrcm < 1). Under these assumptions the pattern is not truly bidimensional and the processing can be performed by a separate filtering of the rows and the columns of the holographic matrix. Another problem which arises when dealing with moving targets is the aliasing effect due to the broadening and shifting of the signal spectrum. Assume, in fact, that PRF = Bd'. in this case a radial velocity component of the target causes a Doppler shift according to equation (3.10) and a significant aliasing cannot be avoided. Furthermore, if the target velocity Vx is opposite to that of the platform, an increase of the nominal bandwidth occurs according to equation (3.12). As a consequence of these concurrent phenomena, the azimuth compression cannot be perfectly achieved and the target is not correctly imaged. If instead the
sampling frequency PRF is ^> Bd, then the discrete and the analogue representations can be considered equivalent. More precisely, PRF must be constrained by the inequality: (3.17) where F j c m a x and F^ r m a x are available from equations (3.10) and (3.11) on substituting the quantities Vx and vy with their maximum values. The basic considerations leading to the MTDI algorithm as a means of detecting moving targets are discussed below. When the system PRF complies with equation (3.17), the ground echo and the echoes of the moving targets are spectrally separated: the former is concentrated in [-Bd/2, BdIT) and the latter are allocated in (-PRF/2, -Bd/2) U (Bd/2, PRF/2). The scheme of the MTDI processor is shown in Figure 3.13. The raw data are stored in the holographic matrix and fed into the range processor. Then, the spectrum of the azimuth line is computed via a fast Fourier transform (FFT) and split throughout the Ndc channels, each one encompassing a bandwidth as large as Bd. The rejection of the ground echo is performed leaving out the channel centred on the zero Doppler frequency, after phase compensation of the platform speed V. The processing that follows performs azimuth compression on each stream of data. The procedure consists in evaluating the product between the data coming from a single channel and a suitable reference function, making an inverse Fourier transform and comparing the maximum value attained by the signal with a threshold. Finally, if a moving point is detected, a fine estimate of the chirp parameters - as discussed in
reference chirp FFT M/N pt.
to Doppler estimator channel 1 holographic matrix
range processing
reference chirp
range-compressed transformed data
IFFT
threshold
IFFT
threshold
Fin Fie, estimation image formation estimation
channel 2 Mpt. FFT
channel N IFFT
Figure 3.13 Processing scheme of MTDI [2]
threshold
Fdr,
F^
estimation
Reference 2 - is provided to improve the performance of the image-forming algorithm. The range of detectable velocities is limited between a minimum detectable and a maximum unambiguous values. The minimum and maximum velocities correspond to a Doppler displacement equal to the first and the last available Doppler channel centre frequencies, respectively. Conservative values (with respect to the off-nadir angle) are: (3.18) (3.19) For airborne SARs operating at millimetric wavelengths, values of 1 m/s for vm[n and 20 m/s for vmax are found using a PRF of 10 kHz. In Reference 2 the problem of probing the presence of a chirp signal embedded in a disturbance environment (backscattering by fixed scene and thermal noise) is modelled as a binary decision test; also the detection performance is found. Details are in the quoted Reference. A high quality image of moving targets calls for suitable procedures for estimating the chirp parameters. Here we introduce two algorithms for Doppler centroid and Doppler rate estimation. The algorithms are suited for airborne SARs and pointlike targets. The chirp parameters are related to the moving point velocities through equations (3.10) and (3.11), the knowledge of the former allows one to recover the latter. 3.4.2.1 Doppler centroid estimate The target radial velocity causes a Doppler frequency shift given by equation (3.10). The algorithm discussed here involves a correlation between the power spectrum of the azimuth signal and that of a reference signal, namely a chirp signal with no Doppler shift and nominal Doppler rate. The correlation peak is centred on the searched Doppler shift. More formally, the algorithm consists of the following steps: (a)
Discrete Fourier transformation (DFT) of the azimuth signal: (3.20)
where Nt,a is the azimuth FFT block length, and computation of the power spectrum: Sx(m) = \X(m)\2 (b)
(3.21)
Extraction of a subset of samples S(m) from Sx(m) according to the following rule: once the channel where detection occurs is selected, pick up all samples encompassing a bandwidth as large as 2 Bj centred around the channel reference frequency. So we are ensured that only a small amount of the signal energy is left.
(c)
Evaluation of the cross-correlation Rs(m) between Sim) and reference spectrum Sr(m)\ Rs{m) = S(m) ® Sr(-m)
(d)
(3.22)
where
where Q\ indicates the set of samples belonging to the lower frequencies (m = 1, . . . 5 ni, say) and ^2 indicates the corresponding set belonging to the upper frequencies {m = n\ + 1 , . . . , np, say) (np is the total number of points of Rs(m)). We select n\ so that the difference \e\ —£21 is minimum. The knowledge of n\ can be used for the evaluation of the Doppler centroid. 3.4.2.2 Airborne SAR auto foe us The Doppler rate is the other parameter required to perform a sharp focusing of the target echo. A widely used algorithm for Doppler rate estimation is based on the multilook technique; unfortunately, this technique does not work well if applied to airborne SARs. Consider, in fact, the Doppler rate resolution achievable by this algorithm [2]: (3.24)
where: Ni is the number of looks, A / is the centre-looks distance. Table 3.1 reports the values assumed by the above-specified parameters, together with the Doppler resolution, for typical spaceborne and airborne SAR systems. It is easy to observe that the resolution is good for Seasat SAR but poor for the airborne SAR. In Reference 2 a new algorithm is introduced which performs an accurate estimation of the Doppler rate for both spaceborne and airborne SARs provided that the Doppler centroid has been previously corrected. Consider the modulus of the mutual energy € between the received signal x(t) and the reference signal xr(t): (3.25) where /S is the Doppler rate to be estimated. The received chirp x(t, fi), after Doppler centroid correction, can be simply expressed as: X(t,Fdr)=exp{jFdrt2}
(3.26)
Table 3.1
fdr0 A/ Bd NL 8fdr
Some typical parameters for spaceborne and airborne SARs SEASAT SAR
Airborne SAR
520Hz/s 967Hz 1389Hz 4 0.8Hz/s
3112Hz/s 300Hz 400Hz 4 292Hz/s
If we choose: xr(t,l3) = exp{jl3t2}
(3.27)
and collect all inessential terms in a complex constant K, we obtain: (3.28) which can be approximated as: (3.29) Expression (3.29) can be regarded as the integration of Na pulses having the same modulus, but time-varying phase. The integration process leads to the maximisation of the cross-energy modulus if and only if (Fdr — /3) is equal to zero or, in other words, if the estimated Doppler rate is equal to the true one. Thus, the estimation rule amounts to evaluating the maximum of expression (3.29), with respect to j6, namely: (3.30)
where Qp is a suited domain for /3. After the estimation of Fdc and Fdr, the azimuth signal can be correctly compressed by means of a classical SAR azimuth processing to obtain the position and the reflectivity of targets. Moreover, vx and vy can be evaluated by applying equations (3.10) and (3.11). The algorithms above have been simulated to check their ability to generate correctly focused images of moving and stationary point-like targets over a fixed background; the successful results are reported in Reference 2.
3.4.3
DPCA
The concept of DPCA, displaced phase centre antenna, was conceived by F. R. Dickey, F. M. Staudaher and M. Labitt; in 1991 they received the IEEE-AESS Pioneer award for this invention [17]. One major application of DPCA is in the Joint-STARS (joint
two-element DPCA array position when the 1st pulse is transmitted subarray used for receiving echoes of 1st Tx pulse subarray used for receiving echoes of 2nd Tx pulse
'platform y ' platform
array position when the 2nd pulse is transmitted position of Tx/Rx phase centres for the two pulses
Figure 3.14
Working principle of DPCA
strategic target attack radar system) [18]. Figure 3.14 shows the working principle of the system; it depicts the radar antenna moving along track when two pulses are transmitted and corresponding echoes received. The antenna is divided into two subarrays; the whole antenna transmits two successive pulses, the corresponding echo of the first pulse is received by the fore subarray, the echo of the second pulse is received by the aft subarray. Due to the aircraft movement, the transmitting and receiving antennas form two bistatic configurations for the two pulses. However, if the antenna dimension, the platform speed and the radar PRF are properly selected, the phase centre of the bistatic antenna configuration for the first transmitted-received pulse coincides with the phase centre of the second transmitted-received pulse. Thus, the clutter is seen at two different time instants from the same radar location: the platform motion has been compensated, consequently the Doppler spectrum of clutter is not spread due to platform motion. The clutter is cancelled by subtracting the echoes of the first pulse received by the fore subarray from the echo of the second pulse received by the aft subarray; DPCA corresponds to a kind of spatial MTI. Stationary targets should cancel, but echoes from moving targets will give a non-zero result from the subtraction, so they should remain. Coe and White [19] have carried out a theoretical and practical evaluation of this technique. They have found that cancellation of the order of 25 dB is possible. The major DPCA sources of limitations are: loss of receiving aperture, PRF-velocity constraint, performance limited by subarray mismatch of radiation patterns, two degrees of freedom (DoFs) only, the system is not adaptive. STAP is the natural generalisation of DPCA, in fact it has the following features: • • • • •
generalisation of adaptive array of antennas for jammer nulling generalisation of DPCA for clutter cancellation freedom in shaping the null fewer constraints on the spacing of the antenna elements compensation of platform motion along (as DPCA) and orthogonal to the array thus avoiding clutter spectral spreading.
3.4.4 Along-track interferometry (ATI)-SAR In a similar manner to DPCA (see Section 3.4.3), along-track interferometry (ATI) uses two displaced antennas connected to two receiving channels. For each channel
an SAR image can be generated. The time delay between the azimuth signals can be compensated for during the azimuth compression using two different reference signals, incorporating the azimuth chirps generated in the two channels by a common point scatterer. If the first image is multiplied by the complex conjugate of the second, the remaining phase is zero for stationary objects and non-zero otherwise. If the two receivers are spatially separated by the distance J, the interferometric phase is approximated by tp = —(27t/X)d(vr/va), where vr is the radial velocity of the target. An example of parameters for ATI-SAR is: d = 1 m, va = lOOm/s, A = 3 cm, vr = 1 m/s, cp = 120°. ATI-SAR was originally developed to measure the speed of ocean surfaces; in Reference 12 the capability of SAR to detect slowly moving targets is shown on live data. In Reference 20 an in-depth analysis of the capabilities of ATI-SAR to detect moving targets is presented. In this section some analytical and simulation results concerning detection of a moving target are presented. ATI-SAR has the following limitation: to have a high phase sensitivity, the two antennas have to be widely separated, but this leads to a comb of blind velocities Vbhnd = kvah/d, where k is an integer: this limits the useful target velocity interval; moreover, the above mentioned distortions in the SAR image of moving target (Section 3.3.1) remain. The probability density function (PDF) of the interferogram phase (p for just stationary clutter and thermal noise has been found to be [21]: (3.31) where
Clutter and noise are independent random processes with zero mean and Gaussian PDF. Radar echoes i\, /2 received by the two antennas at the same time have a correlation coefficient y which depends on the endogenous correlation coefficient of clutter Yc and the clutter-to-noise power ratio CNR = Pc/Pn: thus the presence of noise reduces the clutter coherence. In practice, the interferometric phase is estimated by averaging L looks as follows: (3.32)
The corresponding PDF becomes:
(3.33)
where 2^i( # ) denotes the Gaussian hypergeometric function. For L = I equation (3.33) reduces to equation (3.31). Recently, a mathematical expression of the PDF has been presented in Reference 20 also for the case of target presence. In the following we illustrate some simulation results concerning the PDF of an interferogram in the presence of target, clutter and noise. The mathematical expression (3.33) plays an important role in finding the detection threshold for a prescribed value of false alarm probability (P/ fl ). By numerical integration the following numerical values for the threshold Th have been found: y = 0.9 -* Th = 1.0505; y = 0.98 -> Th = 0.3802; y = 0.99 -> Th = 0.2301; the prescribed false alarm probability, the clutter-to-noise power value and the number of averaged looks are: P/a = 10~4, CNR = 2OdB, L = 4. The variation of the detection threshold with the number of averaged looks for CNR = 2OdB, y = 0.98 and pfa = 10- 4 is as follows: L = 1 -> Th = 2.8414; L = 2 -> Th = 0.9505; L = 4^ Th = 0.3802;« = L -> Th = 0.3002; L = 10 -> Th = 0.2201. The target has been modelled as Swerling I. Figure 3.15 depicts the histogram of a phase interferogram for the following parameters: two antennas, L = 4, clutter Doppler phase = 0, CNR = 2OdB, y = 0.98, target Doppler phase: target = 1.3 rad. It is noted that when the signal-to-clutter power ratio (SCR) is very small in dB, the histogram coincides with the one predicted by equation (3.33); with the increase of the SCR the peak of the interferogram migrates on the target Doppler phase. Figure 3.16
Figure 3.15
Histogram of phase interferogram
SCR, dB
Next Page
cp, rad
Figure 3.16
Contour curves with constant Pd versus target Doppler phase and signal to clutter power ratio
illustrates the contour curves with constant detection probability versus target Doppler phase and SCR. The relevant parameters are: two antennas, CNR = 20 dB, number of averaged looks L = 4, correlation coefficient: y = 0.98, Pfa = 10~4 (detection threshold = 0.3802 rad). The following comments are in order: the contour curves are aliased in the interval cp = [—Tt9 Jt]; detection is practically zero for low values of the target Doppler phase because of the numerical value of the detection threshold; the detection increases with the increase of the SCR value. The next areas of research are in the field of removal of aliasing by using different values of carrier frequency [22]. In References 23 and 24 the possibility to do ATISAR with a one-bit coded SAR signal is demonstrated for moving target detection: this is another lively area of research; it has a bonus in terms of simplicity of processing implementation.
3.4.5 Processor in the space-time-frequency domain In this section a method for detecting and imaging objects moving on the ground and observed by an SAR is described. The method is based on the combination of two processing steps: space-time processing which exploits the motion of an antenna array for cancelling the echo from background, and time-frequency processing which exploits the difference in time allocation of the instantaneous spectrum corresponding to echoes from the ground or from moving objects, for an adaptive time-varying filtering and for the estimation of target echo instantaneous frequency, necessary for producing a focused image of it. The design and performance of the space-time
SCR, dB
Previous Page
cp, rad
Figure 3.16
Contour curves with constant Pd versus target Doppler phase and signal to clutter power ratio
illustrates the contour curves with constant detection probability versus target Doppler phase and SCR. The relevant parameters are: two antennas, CNR = 20 dB, number of averaged looks L = 4, correlation coefficient: y = 0.98, Pfa = 10~4 (detection threshold = 0.3802 rad). The following comments are in order: the contour curves are aliased in the interval cp = [—Tt9 Jt]; detection is practically zero for low values of the target Doppler phase because of the numerical value of the detection threshold; the detection increases with the increase of the SCR value. The next areas of research are in the field of removal of aliasing by using different values of carrier frequency [22]. In References 23 and 24 the possibility to do ATISAR with a one-bit coded SAR signal is demonstrated for moving target detection: this is another lively area of research; it has a bonus in terms of simplicity of processing implementation.
3.4.5 Processor in the space-time-frequency domain In this section a method for detecting and imaging objects moving on the ground and observed by an SAR is described. The method is based on the combination of two processing steps: space-time processing which exploits the motion of an antenna array for cancelling the echo from background, and time-frequency processing which exploits the difference in time allocation of the instantaneous spectrum corresponding to echoes from the ground or from moving objects, for an adaptive time-varying filtering and for the estimation of target echo instantaneous frequency, necessary for producing a focused image of it. The design and performance of the space-time
filter is described in References 25-27 and 9. Some of the theoretical aspects of STAP of interest for this chapter are discussed also in a number of publications; Reference 11 discusses the optimum processing scheme for a special case and an approximation of it realised with a two-dimensional FIR (finite impulse response) filter. Other relevant References are 28-30. Here we concentrate on the time-frequency step (Section 3.4.5.1) and on the joint space-time-frequency (Section 3.4.5.2). 3.4.5.1 Joint time-frequency analysis by Wigner-Ville distribution (WVD) The aim of this section is to show how time-frequency representation by WVD of the echoes received by an SAR provides a useful tool for detection of moving objects and estimation of instantaneous phase shift induced by relative radar-object motion [27]. The phase history is then used to compensate for the received signal and to form a synthetic aperture with respect to the moving object, necessary to produce a high resolution image. A method for extracting the instantaneous phase is based on the time-frequency (TF) distribution of the received signal. The WVD has been chosen here because it presents some important features concerning detection and estimation issues. There are simple methods for analysing signals in the TF domain, such as the short-time Fourier transform (STFT), but they do not exhibit the same resolution capabilities in the TF domain as does the WVD. In particular, since the STFT is based on an FT applied to a time-windowed version of the signal, with the window central instant varying with time, the frequency resolution is inversely proportional to the window duration. The narrower the window, the better is the time resolution, but the worse is the frequency resolution and vice versa. Conversely, the WVD does not suffer from this shortcoming. The WVD provides a higher concentration of signal energy in the TF plane, around the curve of signal instantaneous frequency (IF). This allows a better estimation of IF in the presence of noise and this information is exploited for the synthesis of the long aperture with respect to a moving object. On the other hand, the WVD poses other problems since it is not a linear transformation. This causes the appearance of undesired cross-products when more than one signal is present. Mapping of the received signal in the TF plane provides a tool for the synthesis of the optimal receiver filter without a priori knowledge of the useful signal, provided that the signal-to-noise ratio is sufficiently large. The TF representation provides a unique tool for exploiting one of the most relevant differences between useful signals and disturbances in the imaging of small moving objects, namely the instantaneous frequency and the bandwidth. In fact, it can be shown that, although the bandwidth occupied by a target echo during the observation interval necessary to form the synthetic aperture mainly depends on radar-object motion, the instantaneous bandwidth is proportional to object size. Therefore, the echo corresponding to a small target can occupy a large band during the overall observation time, but its instantaneous bandwidth is considerably narrower (i.e. the echo backscattered by a point-like target has zero instantaneous bandwidth but it may exhibit a large overall bandwidth). Conversely, the echo from the background and the receiver noise have a large instantaneous bandwidth. Therefore, even if the useful signal and the disturbance may have a large total band, the possibility of tracking the instantaneous bandwidth,
made available by the TF representation, allows a discrimination of the useful signal from the disturbance not possible by conventional processing. Another important and unique advantage related to use of the WVD is that it allows the recovery of the echo phase history even in the case of undersampling, as shown in Reference 31. This is particularly important in SAR applications since it allows us to work with a PRF lower than the limits imposed by the signal bandwidth occupied during the observation interval. Owing to the target motion, this bandwidth may be considerably larger than the bandwidth occupied by the background echo. According to conventional processing, we should then use a correspondingly higher PRF. Conversely, if the useful signal has a large total bandwidth, but a narrow instantaneous bandwidth, the TF representation prevents superposition of spectrum replicas created by undersampling because, even if the replicas occupy the same bandwidth, they occur at different times. This property allows us to recover the desired information even from undersampled signals. Since the PRF value imposes a limit on the size of the monitored area, due to time - and then range - ambiguities, the possibility of using a low PRF prevents the reduction of the region to be imaged, as well as an increase of the data rate. The WVD of a signal is defined as: (3.34)
where s(t) represents the analytic signal. The estimation of the instantaneous frequency of the signal is done as follows. Express the signal in terms of its envelope and phase: s(t)=a(t)exp{j
(3.35)
It can be shown that the local or mean conditional frequency of the WVD distribution, defined as: (3.36) is equal to the signal IF: (3.37) The estimate of the mean conditional frequency of the WVD then provides the information about the signal IF. This is exactly the information we need for rephasing the received signal in order to produce a focused image. We will explain now the rationale for using the WVD to detect a moving target and estimate its parameters with SAR data. The received signal is the sum of echo from the moving object, whose phase modulation is unknown, plus clutter (the echo from fixed background), plus noise. The echoes from the fixed scene represent, in our case, a disturbance. The aim is to detect the presence of moving objects and to estimate their motion parameters. The detection and parameter estimation performance depend on the signal-to-clutter power ratio (SCR). If this ratio is small, we have to first process the received signal in order to improve it as much as possible.
This operation can be carried out by matched filtering. However, the matched filter can be defined only if the shape of the useful signal is known, and this is not the case. It turns out that the two operations, detection and parameter estimation, cannot be separated: estimation of the useful signal parameters can be carried out only after having detected the presence of a useful signal; a reliable detection, on the other hand, requires the knowledge of the signal parameters, in order to carry out a proper matched filtering, before the detection itself. It is then necessary to carry on these two kinds of operation contemporaneously. The time-frequency analysis of the received signal, in particular the WVD, provides a powerful tool for achieving the aforementioned requirements and extracting the desired information, namely the energy and the phase history. These two pieces of information are what we need for our purposes: the detection of the presence of a moving target is made by comparing the energy with a suitable threshold; the instantaneous phase is used to phase-compensate the received signal for a correct coherent integration, necessary to imaging purposes. As regards the effect of disturbances in the received signal, it is useful to recall that matched filtering can always be performed by cascading: a clutter cancellation followed by a coherent integration. The first operation does not require knowledge of the useful signal shape, whereas the second operation does. In particular, a correct coherent integration requires knowledge of the signal phase history. The time-frequency analysis aims to facilitate extraction of the signal phase history. Therefore, the sequence of operations to be performed on the received signals is the following: a clutter cancellation is performed first and the output of the cancellation filter is analysed in the TF domain. If the clutter has been reduced to a power level sufficiently smaller than the useful signal, the parameters estimated by the WVD are correct, within an error depending on the achieved SCR. These parameters provide the information necessary to set up a correct coherent integration. This rather intuitive reasoning for using the WVD in detection and estimation problems is formalised into the framework of the matched filter theory in Reference 27; here we give a summary of the main results concerning the application to SAR problems. The signal received by an SAR is given by the sum of the echoes from the ground, the echoes from a possible moving object and receiver thermal noise. The echo from the ground can be modelled as a correlated random process, whose power spectral density is proportional to the antenna power radiation pattern. The echo from a moving object is characterised by an unknown modulation, induced by the relative motion between the radar and the object. In SAR imaging, we are interested in the phase modulation induced by the relative radar-target motion. If the transmitted signal is: p(t)=a(t)Qxp(j27tf0t)
(3.38)
where a(t) is the analytic signal and /o is the carrier frequency, the echo received by a point-like scatterer at a distance r(t) from the radar is proportional to: (3.39) During the observation interval, the amplitude of each backscattering coefficient can be assumed constant since the aspect angle does not vary by an amount such as
to justify a change in the reflectivity characteristics (this assumption underlies all SAR signal processing). The only modulation of interest then is phase modulation. In the formation of the synthetic aperture, we are interested in the last term of the equation (3.39). The conventional techniques for autofocusing extended scenes compensate only linear and quadratic phase shifts. This means that only slow fluctuations (with respect to the integration time) are compensated. Conversely, the TF approach allows estimation and compensation of any kind of phase history. The distance r(t) can be modelled as the sum of slow and rapid fluctuations, with respect to the observation interval. Slow variations can be expressed as a low-order polynomial, whereas fast variations follow a sinusoidal behaviour, whose period is shorter than the time observation interval. The change in the distance causes a phase modulation, which must be compensated for to obtain a correct image. The variation of distance can cause migration of the received echo over different range cells, depending on the ratio between the amount of variation and the range resolution. The range migration problem can be faced according to the double resolution strategy outlined in the Section 3.4.5.2. According to the strategy, all the phase estimations are carried out on data whose range resolution is such as to consider the migration negligible. According to the formulation of matched filtering in terms of the WVD, the processing scheme for detecting and estimating the parameters of the echoes from moving objects is sketched in Figure 3.17. The received signal is first range compressed. Then it is processed by an MTI filter to reduce the clutter contribution; in Section 3.4.5.2 we explain how to use STAR The analysis of the signal in the TF domain allows estimation of
MTI
estimate instantaneous frequency
WVD
range compressed data
integration
generate reference signal
FFT
modulator
display
detection threshold
Figure 3.17
Processing scheme which uses the Wigner—Ville distribution
the signal instantaneous frequency. Some smoothing can be applied on the WVD to improve the estimation accuracy. The instantaneous frequency is then integrated to obtain the phase modulation to be used for phase compensation of the received signal. At this point an FFT is sufficient to provide the high cross-range resolution image. A threshold is then applied to the envelope signal to check for detection. An example of an image relative to a moving point-like target superimposed on a fixed extended scene is reported in Reference 27; the simulation results convey a positive feeling on the performance of the processing scheme of Figure 3.17. 3.4.5.2 Joint space-time-frequency analysis Space-time and time-frequency processing can be combined to form a processor which allows both the cancellation of the clutter echoes and the compensation of the target motion, necessary for the formation of a high cross-range resolution image. The overall space-time-frequency processing is shown in Figure 3.18. The echo from the ground is cancelled by means of space-time processing. Having cancelled the background echo, we proceed to the estimation of the target instantaneous frequency which is done by resorting to the WVD. Before proceeding to the estimation, however, some care must be devoted to the range migration problem. In fact, the relative radartarget motion causes not only a phase shift, but also a range migration which cannot be neglected if it overcomes the range resolution. The radar echoes are sampled and arranged in a matrix, whose columns are relative to successive transmitted pulses and the entries of each column contain the echoes coming from different distances. Given a certain point, if its distance (during the time on target) from the radar does not vary by an amount bigger than the size of a range resolution cell, the echoes from that point are all stored on one column. If all the points composing the observed scene satisfy this condition, no range migration occurs and the samples can be first processed in range,
adaptive space-time processor on range compressed data
corner turning
compute Wigner-Ville distribution estimate instantaneous frequency
FFT
generate reference signal
integration
Figure 3.18
Processing scheme of joint space-time-frequency
display
column by column, and then in cross range, row by row. If, however, the echoes from some point occupy more than one row, cross-range processing cannot be performed directly on the collected data, row by row. Some algorithm for compensating for range migration must be applied in order to realign the data, before cross-range processing. Range migration compensation techniques have already been examined in the literature in the imaging of stationary scenes. The problem is harder in the imaging of moving targets, however, since the radar-target distance is not known. Two main problems arise when dealing with moving targets, in presence of range migration: the migration causes a spreading of the target energy through many range cells, therefore the signal-to-noise ratio, for each range cell, decreases and this causes a loss of detectability, and due to the lack of knowledge of the target range migration law, it is not known a priori which samples of the matrix of the collected data are to be taken for carrying out the estimation of the phase history. Here we follow a two-step approach for compensating for the migration problem: a coarse range resolution, and a fine range resolution analysis (see Figure 3.19). The rationale of the approach is based on the fact that the migration problem can be neglected if the amount of migration does not exceed the range resolution. Therefore, we can initially work in a low-resolution mode, where the range resolution has been degraded by an amount such as to make the migration negligible. A first detection is performed on these data: if a detection occurs, the processing chain for the estimation of the target echo phase history is enabled. The estimation is carried out in the time-frequency domain, according to the criterion described previously. Having once estimated the phase 0(0, we can evaluate the law of variation of the distance by exploiting the relationship between phase shift and distance:
(3.40)
high-resolution channel
fine range alignment
compute distance
low-resolution range compression
full resolution compression
generate compensation signal
estimate instantaneous phase
Low-resolution channel
Figure 3.19
Two-step approach to account for range migration problem
By using d(t), we can compensate for the range migration by properly rearranging the data in the matrix containing the received samples. These data can now be phase shifted to compensate for the phase shift induced by the target motion. The data then undergo a full range and cross-range compression for obtaining a high-resolution image. The price paid by adopting the two-step resolution approach is the SNR loss inevitably related to the degradation of the range resolution in the coarse resolution mode. It is important to point out that, even if the cause of both phase shift and migration problems is the same, namely the variation of the radar-target distance, the phase shift is much more sensitive to range variation than to range migration. In fact, for example, in an X-band radar (X = 3 cm), having a range resolution of 1 m, an error on the distance of 7.5 mm causes a phase shift of n radians, while the corresponding range migration is absolutely irrelevant. This means that, having once estimated the phase history by the described procedure, the resulting value for the distance variation d(t) is estimated with a good accuracy. The performance of the space-time-frequency processing scheme has been evaluated by a simulation program which generates the echoes from an extended surface and from a point-like target and then applies the proposed algorithm [9]. The target has been supposed moving on the terrain (shadowing effects have been neglected) at a constant velocity, in a direction oblique with respect to the radar motion. The velocity parameters have been chosen to make evident the presence of range migration and of cross-range smearing of the target image. The ground reflectivity has been assumed equal to the target reflectivity (this is a quite pessimistic assumption, because in many cases of practical interest the target reflectivity is higher). The thermal noise, 4OdB below the target return, has also been assumed for the received signal. The ground echo is first cancelled, by using a STAP with a two-element antenna and two time samples. The two antennas are spaced by d = vT. An SAR image is then formed by conventional techniques. The result is shown in Figure 3.20 (from Figure 14 of
* * * *
range
Figure 3.20
Image of moving target, after clutter cancellation (reproduced with permission from Figure 14 of Reference 9)
range
Figure 3.21 Image of moving target, after range migration andphase compensation (reproduced with permission from Figure 15 of Reference 9) Reference 9). The smearing of the moving point-like target is evident. Given the motion parameters, the target has migrated over six range cells. This is the result of the broadening of the target image even in range, as well as in cross range. Anyway, the target echo causes a detection and initialises the motion estimation channel. The high resolution data are smoothed in range to decrease the range resolution. Then the processor looks for the range cell with the maximum energy content and computes the WVD of that cell only. The frequency history, and then the phase history, are evaluated, according to the procedure outlined previously. The phase history is then used for compensating for the range migration and the phase shift on the high-resolution range data. The final image is shown in Figure 3.21 (from Figure 15 of Reference 9). The sharpening of the target image is quite evident. The method above corrects only the (translation) motion of a point-like target. If a focused image of a three-dimensional object is required, for recognition purposes, the motion parameters must be estimated to compensate correctly for the relative signals [32, 33]. Since the motion of any rigid body can be decomposed as the sum of the translation of a point plus the rotation of the other points around that point, in some cases, depending on the target dimension and kind of motion, compensation for only the translation motion is not sufficient and we still have to compensate for the rotational motion. This second compensation can be efficiently performed in the frequency domain, by applying, for example, the method proposed in Reference 32. Algorithms have been conceived to produce fine resolution images of moving targets having any translation or rotation motions. They require the presence of multiple prominent points in the target image. The echo from a first point is initially analysed. Its phase is computed and subtracted pulse-to-pulse from the phase of the incoming signal. This operation removes the effect of the target translation motion and makes this first point effectively the new centre of the scene. At this point, if the rotational motion is negligible, conventional SAR processing yields the focused image. If,
conversely, the rotation cannot be neglected, two other prominent points are required to estimate the rotation parameters. These parameters are used to compensate for the rotational motion in the frequency domain and to help in applying the SAR processing correctly. The algorithm requires that the prominent points be separable and that their phases be estimated without interfering with each other. In some cases, however, this assumption might not be met: at high resolution, separability is more likely to occur, but the range migration could complicate the phase estimation problem; at low resolution, the range migration could be negligible, but it is more likely that some prominent points might occupy the same range resolution cell. Further analyses are necessary in the imaging of extended targets when more dominant scatterers occupy the same resolution cell. In this case, in fact, the bilinearity of the WVD creates undesired cross-product terms which can seriously impair the estimation of the instantaneous frequency. A reduction of these undesired terms could be achieved by resorting to other time-frequency representations, such as the Choi-Williams distribution [34]. Another approach to reduce the appearance of undesired crossproduct terms is described in Reference 35. It is shown that it is still possible to estimate the signal parameters, even for multicomponent chirp signals embedded in noise, by combining WVD with the Hough transform.
3.4.6
Optimum processing for MSAR
This section focuses on the optimum MSAR detection of slowly moving targets (SMT), whose Doppler frequency is well inside the clutter spectrum, by means of space-time processing [4, Chapters 4 and H]. Clutter cancellation is easily performed by space-time processing assuming the idealised condition of DPCA condition (PRF matched to the ratio between antenna displacement and platform speed) and absence of the intrinsic temporal decorrelation of the clutter echoes, known as internal clutter motion (ICM). However, it is well known that the cancellation can be highly affected by the presence of ICM which has the strongest impact on the detection of the SMT, where the MSAR provides a large performance improvement over conventional multichannel systems. Moreover, the exact matching of DPCA condition is difficult to achieve in practice. Therefore, to obtain a significant analysis of its effectiveness we consider separately two cases of mismatch from the idealised conditions: (i) the presence of ICM and (ii) the velocity mismatch. A complete analysis is derived for a special case [10,13]. A space-time exponential model is considered for the clutter covariance matrix, related to a Cauchy antenna pattern (i.e. antenna gain G(O) = Go • (O2 + 0J))"1, 0 being the azimuth angle, #o a parameter that controls the beamwidth and Go a suitable coefficient to encode the antenna gain) which yields a double exponential Doppler spectrum for the fixed clutter and a single pole description of the internal motion process. The simplified model allows closed form expressions to be identified, both for optimum detector and detection performance. In the following, we first consider the different possibilities for ordering the long sequence of MSAR echoes, then we discuss the special structure of the clutter covariance matrix in the two above mentioned mismatch conditions. The special structure
allows us to obtain a formal expression for the space-time cancellation filter and its properties, and finally to discuss its performance. 3.4.6.1 Echoes ordering strategy Initially, we assume, as in Reference 36, that the DPCA condition is verified. With reference to the slant plane geometry in Figure 3.22, and assuming that: (i) the effect of the antenna pattern modulation on the target echoes in the observation time is negligible, and (ii) the far field approximation can be used for the antenna element displacements and the Fresnel approximation for the distance of the target from the transmitter, the target echo received by the A:th (k = 0 , . . . , K — I5) element at Xn = (n-(N - l)/2) PRT, n = 0 , . . . , N - 1 can be rewritten as:
(3.41) where Ao is the amplitude of the echo, O is a constant phase term and A the carrier wavelength. xq = xq/(vPRT) is the normalised target along-track position, fy = 2vrPRT/X is the normalised Doppler frequency due to the cross-track velocity component and sq = vq/v is the relative along-track velocity. Also, d — A/(vPRT) is the ratio between spatial and temporal sampling, being A the antenna element separation, and /x = 2(vPRT)2/(XRo) is the rate of the linear frequency sweep for
time
along-track spatial axis
Figure 3.22
Bidimensional space-time data collection plane (K = 4, N = 10)
a fixed target. The terms in the first line of equation (3.41) take into account the central target Doppler frequency and DoA. They are the usual model for space-time processing techniques based on a short integration time. The terms in the second and third lines are characteristic of the SAR and encode the time-varying Doppler and DoA observed in the long SAR integration time. Assuming that the clutter echoes can be modelled as a zero mean Gaussian random process, derived from a spatially independent Gaussian distributed scene reflectivity (see Section 3.3.2.1) with temporal correlation (ICM) pt(At), the correlation of the echoes received at times ^i, t2 by elements ^ i , Ski is: (3.42)
where Pc is the total clutter power. Since the NxK echoes arise from the space-time sampling, they are by their nature bidimensional, and have not any natural unidimensional order. This is illustrated in Figure 3.22, where the space-time location of the phase centres relative to the combination of transmitting and receiving antenna for each echo is sketched. As in Reference 36, the DPCA condition is assumed, namely PRT and platform speed are matched so that d = 2. It is useful to arrange these echoes in a vector, which is an ordered sequence of blocks s = [sj, sj9... ]T. Three strategies can be devised to build the blocks [11], keeping fixed a parameter, which correspond to the three directions in which the points in Figure 3.22 can be aligned: (A)
fixed-time blocks (Figure 3.23a):
(B)
fixed element blocks (Figure 3.23b):
(C) fixed spatial position blocks (Figure 3.23c):
The rotation matrices T ^ , Tca and Tcb are defined, to convert different ordering strategies: SB = T ^ S A , SC = TCflSA, Sc = T ^ S B - It is worth recalling that all the elements of the matrices above are zero except for one element equal to one in each row and column and have the properties T ^ T ^ = T ^ T ^ = I, T ^ T ^ = T^T Cfl = I, TcfcT^ = TlbTcb = I and Tcb = TcaTla, being I the NK x NK identity matrix (see also Reference 30).
Figure 3.23
Strategies for collecting and processing the SAR echoes
3.4.6.2 Covariance matrix properties: a special case for ICM An interesting condition, which allows us to study the detection performance and the interpretation of the optimum detection structure, is obtained under the hypothesis that the transmitting antenna pattern has a Cauchy shape [H]. Antenna sidelobes are not taken into account but this is not essential here, since targets competing with the mainlobe clutter are considered. Thus an exponential spatial correlation is obtained: ps(i) = p[l\ where ps is the correlation coefficient at a spatial distance equal to half the inter-element spacing. The worst case arises when the temporal correlation, which encodes the ICM, also has an exponential shape, pt(i) = p\ , being pt the one-lag correlation coefficient, since it corresponds to the maximum entropy spectrum. With reference to ordering strategy (A), the normalised covariance matrix is symmetric, due to the broadside antenna pointing and has a Toeplitz-block-Toeplitz structure:
(3.43)
where the K x K block P ; is given by:
(3.44)
For the interpretation of the optimum detector, this case is especially appealing, since the covariance matrix in equation (3.44) has the properties below. We define the KxK matrices H and H / :
(3.45)
which are related via a rotation around their centre, and are apparently not full rank. Under the hypotheses above, the blocks P1- can be written as the product of the ith power of one of the matrices times the first block Po as P; = FTPo = Po(H7*) . Thus RA = TA diagyyjPo,..., Po), where:
(3.46)
and diag^fPo,..., Po) is a block diagonal matrix, with TV blocks Po- It can be shown that FA can be factored as
(3.47)
where the blocks Q; are square matrices of order /, with exponentially decaying elements with one-lag correlation coefficient pt and U is a N x N upper triangular matrix, obtained from an exponential square matrix, with one-lag correlation coefficient ps, pt, nulling its lower diagonal part. From equations (3.46) and (3.47) and from the symmetry of RA we have R^ 1 = diag^fP^ 1 ,..., P^ 1 }T~^1
(3.48)
Moreover, using HH'H = H and H H H ; = H', it can be shown that the inverse matrix F^ 1 is block tridiagonal. Thus, R^ 1 is block tridiagonal and symmetric:
(3.49)
Moreover each of its blocks is itself a tridiagonal band matrix: Y = (1 — P^)P 0 1 + P^P-'CHH' + H'H); Z = P Q 1 H ; Y 0 = P^ 1 + p^1HH; % = Y~x + p , 2 P ^ H H ' . Moreover, the decomposition R^ = LeLg applies, where:
(3.50) and blocks
(3.51)
Interpretations of the optimum detector Assume that the data vector x (NK x 1) is ordered according to strategy (A). As well known, the optimum detector for the target vector s, known aside for amplitude and initial phase, against a Gaussian clutter with covariance matrix RA, is obtained comparing the modulus of s ^ R ^ x to a threshold. Since we focus on the detection of SMT, whose power spectrum competes with the main clutter return, thermal noise is neglected, assuming the ICM to be the dominant disturbance. Using the decomposition of the matrix RA, the following interpretations of the optimum filter s^R^ x
data in space only filter a rotation unidim. space-time filter b rotation time only filter c rotation match to signal
Figure 3.24
Decomposition of the optimum detector in a sequence of three uni-dimensional filters
yield [H]: (i)
The bidimensional space-time cancellation filter in the optimum detector, corresponding to R^ l , can be thought of as the cascade of three mono-dimensional filters along the three data ordering directions. This follows from the decomposition in equation (3.48) for R^ 1 , which can be implemented as depicted in Figure 3.24: first the matrix diag^fP^" 1 ,... ,P^"1} is applied to the data, ordered with strategy (A). It operates separately on its blocks, performing a spatial filtering only. The data are then rearranged by T ^ into ordering (B), where the filter diag^{U~ lr , I , . . . , I, U" 1 } along the diagonal of the space-time plane is performed. Thereafter, the filtered data are rotated to ordering (C), where the pure temporal filtering B d i a g A ^ + ^ _ i ( Q ^ 5 Q - 1 , . . . , Q " 1 , . . . , Q " 1 , . . . ,Q^ 1 ,Q^ 1 J is applied. Finally, the filtered data are rotated back to the initial ordering; this can be avoided by storing s with strategy (C). Thus, the three ordering strategies combine in the detector. It is instructive to observe that the filtering along the diagonal of the space-time plane affects only the data in the first and last antenna elements, corresponding to a border effect only. It is required to compensate for the absence of the adjacent element samples. This is interesting, since the selected model is a separable random Markov field, for which in theory it should be possible to split the filter into the cascade of two monodimensional filters. Unfortunately, the data are collected on an area of this plane, which is not aligned with the main correlation axes. Thus the physical sampling process induces in the optimum filter a coupling of the two directions even in this ideal case of decoupled exponential correlations, (ii) The filtering operated in R^ x is a shift invariant space-time FIR filter with nine taps, which uses the nine echoes collected at the nine most adjacent space and time positions, except for the border effects. This is a consequence of the block-tridiagonal structure of the R^ 1 , with blocks being three-element band matrices, as outlined in equation (3.49). Thus the inverse covariance matrix operates combining the data received at a given
time and element with only the data received one element and one PRT apart, as illustrated in Figure 3.23d (a). It is to be noted that the shift invariance is not available for the first and last blocks, where border effects must be compensated for. Moreover, the filtering is non-causal, since both preceding and following samples are used even though this is not an issue for the FIR characteristic, (iii) S77R^1X is obtained filtering the data with a shift invariant causal space-time filter with four taps, which uses only the data already received at the closest space-time sampling positions, matching them to an equally filtered reference signal. This is a similar interpretation to (ii), and derives from the structure of the decomposition in equations (3.50) and (3.51): s ^ R ^ x = (LgS)77LgX. This is illustrated in Figure 3.23d (fi). This one-lag space-time memory is obviously a consequence of the double exponential model, which can be regarded as being a worst case analysis. In fact, the exponential autocorrelation is the one characterised by the maximum entropy, once the one-lag decorrelation is constrained. Specifically, using only adjacent space-time samples prevents the whole length of the receiving array from being used to obtain a narrow null along the clutter ridge. The width of the null is instead controlled by the interelement spacing. The three interpretations are of high interest for the long sequence of SAR echoes, since the batch processing is replaced with a space-time FIR filter, with a major reduction in the computations. In the general correlation case the smallest rectangular region around each space-time sample is not a sufficient support for the optimum filter. 3.4.6.3 Covariance matrix properties: a special case for velocity mismatch Using the exponential spatial autocorrelation function, another case of departure from the ideal conditions can also be analysed in closed form: the presence of a mismatch between the radar platform velocity and the PRF, so that the DPCA condition is not any more exactly matched. We assume, for the sake of simplicity, the absence of internal clutter motion and a small mismatch. Under these conditions, the ordering strategies above can still be used with obvious extensions from the case of perfect DPCA. Assuming that the velocity mismatch is a fraction y of the theoretical velocity, we have for the actual one-lag correlation coefficient pse = ps • pe, where pe = pYs. Under the hypothesis that \K • y\ < 1, namely that the mismatch is smaller than the antenna spacing, using ordering strategy (C), the covariance matrix Rc takes the form:
(3.52)
time
along-track spatial axis
Figure 3.25
Bidimensional space-time data collection plane (K = 4, N = 10). SAR echoes selection strategy in the presence of velocity mismatch, v ^> 0
where the KxK
block M / is given by:
(3.53)
for y > 0 (see Figure 3.25) and by its transpose for y < 0 (see Figure 3.26). It is worth observing that the matrix M/ is not just obtained from the matrix Qh by replacing pt with pe. In particular, the elements of M/ can have modules larger than one, since the velocity error causes either reduction or increase to the ideal spatial correlation, depending on the positions of the elements. This was not the case in the presence of internal clutter motion, which was always decreasing the correlation between samples. The structure of the matrices in equations (3.52) and (3.53) is evident from the sketch of observation geometry and correlations in Figures 3.25 and 3.26. In the following we proceed with reference to the case of y > 0, which can be extended to the case y < 0. To get a decomposition of the covariance matrix similar to the one obtained for the internal clutter motion [10], we define the K x K
along-track spatial axis
D
Figure 3.26
Bidimensional space-time data collection plane (K = 4, N = 1O)SAR echoes selection strategy in the presence of velocity mismatch, y < 0
matrices He and Hfe:
(3.54)
which are related via a rotation around their centre; namely it yields the property H'e — &KHe&K, where $ „ is the (« x n)-dimensional rotation matrix:
(3.55)
Thus the ith block can be rewritten as M1- = pleHeVe = p^VeH^ = pe(UfeVe)T, being Ve a K x K exponential matrix with one-lag correlation coefficient pe. Thus the covariance matrix can be decomposed as Rc = Fc • diag^{P^,..., Ve}, and:
(3.56)
The special structure of the matrix Fc yields a closed-form inverse as a block tridiagonal matrix. By setting be = pse/{\ — p2sepj ), the inverse covariance matrix R^ 1 is also block tridiagonal:
(3.57)
where Ye0 = V;1+bepsep-K+l?JlUe*K;Y'eo = Vjl+bepsepJK+lVjl Ufe
K = 1 l K+l 1 1 *KYeo*K; Ze = PJ H*; \ e = V~ + bePsepJ (VJ H6 + VJ H.'e)*K are themselves tridiagonal matrices. Moreover, a triangular block decomposition applies, similar to equations (3.50) and (3.51). These properties of the covariance matrix Rc with ordering strategy (C) - obtained in the case of DPC A velocity mismatch, but in the absence of ICM - yield an optimum detector with very similar interpretations to the case of covariance matrix RA with ordering strategy (A) - obtained in the case of matched DPCA speed and presence of ICM: (i)
The bidimensional space-time cancellation filter in the optimum detector, corresponding to R^ 1 , can be thought of as the cascade of three mono-dimensional filters along the three data ordering directions. (ii) The filtering operated in R^ x is a shift invariant space-time FIR filter with nine taps, which uses the nine echoes collected at the nine most adjacent space and time positions, except for the border effects. (iii) s^R^ x is obtained filtering the data with a shift invariant causal space-time filter with four taps, which uses only the data already received at the closest space-time sampling positions, and matching them to an equally filtered reference signal. Unfortunately, it is to be noticed also that the structure of the clutter covariance matrix does not maintain a similar pattern when both internal clutter motion and velocity mismatch are present. In particular, its inverse is no longer a block-tridiagonal matrix. Therefore these exact closed-form interpretations do not strictly apply. However, a
suboptimum detection scheme can be obtained by extending such a support region, so as to maintain the FIR characteristic, while achieving detection performance close to the optimum. It is interesting to compare the scheme above with those derived in References 7 and 8, which have been the first to the author's best knowledge to introduce FIR filters for SAR detection. Those filters are similar to the one in (iii). The main difference is that in References 7 and 8 the filter LB is derived by using the criterion of the minimum mean square error for clutter cancellation, whereas here it is derived, for a special case, from a maximisation of the detection probability. This study of a special case allows the interpretation of the optimum detector in closed form. This shows that the scheme of References 7 and 8 has the same structure as that of the optimum filter. It is also important to recall that for long integration times (large covariance matrix), the DFT matrix gets very close to the matrix of the eigenvectors, of the clutter covariance matrix, so that the clutter sample at the different frequencies tends to have a low correlation. In this case, the Doppler processing is also very close to the optimum filter, so that both classes of STAP techniques for the MSAR case: (i) time domain reduced DoF (degrees of freedom) adaptive two-dimensional FIR filters (ii) frequency domain reduced DoF adaptive processing, can be interpreted as low-cost approximations of the optimum STAP filter for MSAR. 3.4.6.4 Performance analysis Thanks to the simple form of the inverse covariance matrix the signal-to-clutter ratio of the optimum filter SCR = S^R -1 S can be evaluated in closed form. The analysis is shown with reference to the case of the presence of ICM [H]. For simplicity, only the condition with xq = sq = O (see Figure 3.2) is considered, this is a broadside target with no along-track velocity component:
(3.58) where /3= sin(n\iN)/(N sin(nfi)) and it has been considered that sm(nfjiK)/ (K sin(niJi)) & 1, assuming N ^$> K. The SCR is shown as a function of the normalised Doppler frequency fy in Figure 3.27 for different integration times corresponding to N = 128, 256 and 512 samples, K = A and setting AQ/PC = 1. Three temporal correlation coefficients pt = 0.9,0.99 and 0.999 and a fixed ps = 0.5 are considered. The figure shows that pt has a strong influence on the SCR, which grows with it at almost all Doppler frequencies. However, assuming equal total clutter power, an opposite behaviour appears for the stationary targets, since some clutter power spreads away from the diagonal of the space-time plane and a fixed target
SCR, dB
Figure 3.27
Optimum SCR as a function of fN: (*)p, = 0.999, (+)p r = 0.99, (o) pt = 0.9, ( )N = 512, ( - - -)N = 256, {....)N = 128
very close to this diagonal competes with a reduced clutter power. It also appears, from both equation (3.58) and Figure 3.27, that the SCR grows with the integration time N. In fact, only one adjacent temporal and spatial sample is necessary to whiten the clutter spectrum, as required by the optimum detector. The whitening implies also a partial target cancellation, which strongly affects the performance especially in the SMT region (see the sinusoidal term of equation (3.58)). The longer sample sequence of the SAR allows the coherent integration to gain in SCR over the whitened clutter. This extra gain can be essential in the region of the SMT, where the SCR is low, to permit detection. As a final consideration, it is interesting to observe that both the scheme of References 7 and 8 and the scheme of Reference 12 share the same structure for the optimum filter in this special case, and have in general also very similar detection performance and are therefore attractive for the practical implementation.
3.5
Conclusions
In this chapter processing techniques have been described to combine the SAR and STAP functions; the goal is to obtain a well focused target image in the right place on the image of the stationary scene. A taxonomy of different processing schemes has been presented, with different characteristics in terms of computational cost,
detection performance and operational limitations. Among the presented techniques, some are recognised to be better suited to providing a proof of concept (DPCA, ATI-SAR), while others can be only exploited for interpretation purposes (optimum filter). However, some approaches are recognised as being appropriate for practical use. Two classes belong to this group of techniques: (i) the cascade of a space-time FIR filter and a two-dimensional filter bank detector (space-time-frequency approach and approximation of optimum filter), and (ii) the processing in a confined Doppler plane (Doppler processing and MSAR JDL). As considered in detail in Section 3.4.6, these two schemes share the same structure as the optimum filter in special cases, and have in general also very similar detection performance, resulting therefore in being attractive for the practical implementation. When imaging is a main issue the use of time-frequency analysis combined with the STAP techniques appears to be applicable to the case of a very general target motion trajectory and to give good detection and imaging performance.
3.6
Acknowledgments
Moving target detection and imaging with SAR has been the subject of R&D work for a number of years in Selenia/Alenia (now AMS). The authors acknowledge with thanks the cooperation of a number of colleagues, notably Professor S. Barbarossa (today with the University of Rome 'La Sapienza') and Dr. E. D'Addio. More recently Dr. A. Gabrielli (AMS) has cooperated in the development of ATI-SAR work.
References 1 AUSHERMAN, D., KOZMA, A., WALKER, J., JONES, H., and POGGIO, E.: 'Developments in radar imaging', IEEE Trans. Aerosp. Electron. Syst., July 1984, AES-20, pp. 363-400 2 D'ADDIO, E., Di BISCEGLIE, M., and BOTTALICO, S.: 'Detection of moving objects with airborne SAR', Signal Process., 1994, 36, pp. 149-162 3 WARD, J.: 'Space-time adaptive processing for airborne radar'. MIT Lincoln Laboratory, technical report TR-1015, December 13, 1994 4 KLEMM, R.: 'Principles of space-time adaptive processing' (IEE Publishers, London, 2002, 2nd edn.) 5 KLEMM, R.: 'Introduction to space-time adaptive processing', Electron. Commun. Eng. J., February 1999,11, (1), pp. 5-13 6 FRIEDLANDER, B. and PORAT, B.: 'VSAR - a high resolution radar system for detection of moving targets', IEE Proc, Radar Sonar Navig., August 1997, 144, (4), pp. 205-218 7 KLEMM, R. and ENDER, J.: 'Multidimensional digital filters for moving sensor arrays'. Proc. IASTED on signal processing and original filtering, June 1990, Lugano, Switzerland, pp. 9-12
8 KLEMM, R. and ENDER, J.: 'Two-dimensional filters for radar and sonar applications'. Signal Processing V EUSIPCO, September 1990, Barcelona, Elsevier Science Publisher, pp. 2023-2026 9 BARBAROSSA, S. and FARINA, A.: 'Space-time-frequency processing of synthetic aperture radar signals', IEEE Trans. Aerosp. Electron. Syst, April 1994, AES-30, (2), pp. 341-358 10 LOMBARDO, P.: 'DPCA processing for SAR moving target detection in the presence of internal clutter motion and velocity mismatch'. Microwave sensing and synthetic aperture radar, EUROPTO series, 2958, September 1996, Taormina, Italy, pp. 50-61 11 LOMBARDO, P.: 'Optimum multichannel SAR detection of slowly moving targets in the presence of internal clutter motion'. CIE-ICR '96, international Radar conference, Beijing, China, 8-11 October, 1996, pp. 321-325 12 ENDER, J. H. G.: 'Space-time processing for multichannel synthetic aperture radar', Electron. Commun. Eng. J. (Special issue on STAP), February 1999 11, (1), pp. 29-40 13 LOMBARDO, P.: 'Echoes covariance modelling for SAR along-track interferometry', IEEE international symposium IGARSS '96, Lincoln, Nebraska, USA, May 1996, pp. 347-349 14 LOMBARDO, P.: 'Estimation of target motion parameters from dual-channel SAR echoes via Time-Frequency analysis'. IEEE national Radar conference, NatRad'97, Syracuse, NY, May 1997, pp. 13-18 15 LOMBARDO, P.: 'A joint domain localized processor for SAR target detection' . Presented at European conference on Synthetic aperture radar, EUSAR'98, Friedrichshafen, Germany, 25-27 May 1998, pp. 263-266 16 WANG, H. and CAI, L.: 'On adaptive spatial-temporal processing for airborne surveillance radar systems', IEEE Trans. Aerosp. Electron. Syst, July 1994, 30, (3), pp. 660-670 17 'IEEE AESS 1991 award to F. R. DICKEY, F. M. STAUDAHER, and M. LABITT', IEEE Aerosp. Electron. Syst. Mag., 32, May 1991, p. 32 18 SHNITKIN, H.: 'Joint STARS phased-array radar antenna', IEEE Aerosp. Electron. Syst. Mag., October 1994, pp. 3 4 ^ 1 19 COE, D. J. and WHITE, R. G.: 'Experimental moving target detection results from a three-beam airborne SAR'. Eusar 96, Konigswinter, Germany, 1996, pp. 419-422 20 GIERULL, C : 'Moving target detection with along-track SAR interferometry'. DREO Technical Report 2002-000, 09 January 2002 21 LEE, J. S., HOPPEL, K. W., MANGO, S. A., and MILLER, A. R.: 'Intensity and phase statistics of multilook polarimatric and interferometric SAR imagery', IEEE Trans. Geosci. Remote Sens., 1994, 5, pp. 1017-1028 22 PASCAZIO, V. and SCHIRINZI, G.: 'Estimation of terrain elevation by multifrequency interferometric wide band SAR data', IEEE Signal Process. Lett., 2001, 8, pp. 7-9 23 PASCAZIO, V., SCHIRINZI, G., and FARINA, A.: 'Along track interferometry by one bit coded SAR signals', in POSA, F. and GVERRIERS, L. (eds): SAR Image Analysis, Modeling and Techniques III, SPIE, 2000, 4173, pp. 259-266
24 PASCAZIO, V., SCHIRINZI, G., and FARINA, A.: 'Moving target detection by along track interferometry'. Proceedings of IGARSS 2001, 1 Sidney, Australia, July 2001, pp. 3024-3026 25 BARBAROSSA, S. and FARINA, A.: 'A novel procedure for detection and focusing moving objects with SAR based on the Wigner-Ville distribution'. Proceedings IEEE international Radar conference, Arlington, VA, May 7-10, 1990, pp. 44-50 26 BARBAROSSA, S. and FARINA, A.: 'Detection and imaging of moving objects with SAR by a joint space-time-frequency processing'. Proceedings of the Chinese international conference on Radar, Beijing, China, October 22-24,1991, pp. 307-311 27 BARBAROSSA, S. and FARINA, A.: 'Detection and imaging of moving objects with synthetic aperture radar. Part 2: Joint time-frequency analysis by Wigner-Ville distribution', IEE Proc. F, Radar Signal Process., 1992, 139, (1), pp. 89-97 28 FARINA, A. and TIMMONERI, L. 'Space-time processing for AEW radar'. Proceedings of IEE international conference on Radar 92, Brighton, UK, 12-13 October 1992, pp. 312-315 29 LOMBARDO, P. and FARINA, A.: 'Dual antenna baseline optimisation for SAR detection of moving targets'. ICSP - international conference on Signal processing, Beijing, China, 14-18 October 1996, pp. 431^34 30 LOMBARDO, P.: 'Data selection strategies for radar space time adaptive processing'. Presented at IEEE Radar conference, Radar'98, Dallas, Texas, USA, May 12-13, 1998, pp. 201-206 31 BARBAROSSA, S.: 'Parameter estimation of undersampled signals by WignerVille analysis'. IEEE international conference on Acoustics, speech and signal Processing, ICASSP '91, Toronto, May, 1991, pp. 3253-3256 32 WERNESS, S., CARRARA, W., JOYCE, L., and FRANCZAK, D.: 'Moving target imaging algorithm for SAR data', IEEE Trans. Aerosp. Electron. SySt., 1990, AES-26, (1), pp. 57-67 33 FIENUP, J. R.: 'Detection of moving targets in SAR imagery by focusing', IEEE Trans. Aerosp. Electron. SySt9 July 2001 AES-37, (3), pp. 794-809 34 COHEN, L.: 'Time-frequency distributions - a review', Proc. IEEE, 1989 77, (7), pp. 941-981 35 BARBAROSSA, S. and ZANALDA, A.: 'A combined Wigner-Ville and Hough transform for cross terms suppression and optimal detection and parameter estimation'. Proceedings of the IEEE international conference on Acoustics, speech and signal processing, ICASSP '92, March 1992, San Francisco, pp. 173-176 36 BARILE, E. C , FANTE, R. L., and TORRES, J. A.: 'Some limitations on the effectiveness of airborne adaptive radar', IEEE Trans. Aerosp. Electron. Syst, October 1992, AES-28, (4), pp. 1025-1032
Chapter 4
EA-STAP: an efficient, affordable approach for clutter suppression Hong Wang, Richard A. Schneible, Russell D. Brown and Yuhong Zhang
We now focus on adaptive clutter suppression with sum (E) beam and difference (A) beams. It is assumed for this chapter that spatial adaptive presuppression of jammers has been applied as necessary prior to STAR The most well known applications of A-beams are monopulse tracking [1] and platform motion compensation [2], with the latter being also called the EAimplementation of displaced phase centre antennas (DPCA). Griffiths [3] uses E A-beams for wideband adaptive beamforming of non-pulsed systems. Brown et al. [4, 5] propose STAP with E A-beams for clutter suppression of airborne surveillance systems, which is called EA-STAP. The most important feature of E A-STAP stems from the fact that antenna engineers have excelled in the design of low-sidelobe E A-beams, whether it is for a phased array or reflector-feed antenna. In fact, analogue beamforming techniques for E A-beams are so well developed that the more expensive digital beamforming method for E A-beams does not seem necessary. In other words, STAP with E A-beams may well be an affordable approach to high-performance airborne surveillance radars.
4.1
Definition of the difference (A) beams
Consider a planar aperture of either a phased array or a reflector-feed antenna which has, in addition to the sum-beam channel, at least one more receiver channel. Let G(0a, 0e) be the response pattern of the E-beam with 0a and 0e being the azimuth and elevation angles, respectively. Let F(0a, 0e) be the response pattern of the second channel. For every given steering angle (Oao,Oeo) of the E-beam, we assume: G(OaO9Oe0) = maxG(0a,0e)
(4.1)
If correspondingly we have for any 6e: F(9a0,ee) = 0
(4.2)
the second channel is said to produce an azimuth difference beam to be denoted as Aa. Similarly, an elevation difference beam, Ae, is defined by: F(O09OeO) = O
(4.3)
and an azimuth-elevation difference beam, Aae, by: F(OaO9Se) = O and
F(O09Oe0) = 0
(4.4)
The above definition is much idealised and simplified only to preserve the most basic aspect of the A-beams for signal processing oriented readers. More general descriptions can be found in antenna books such as Reference 6. Figure 4.1 shows an example of Aa-9 Ae- and Afle-beams along with the E-beam, where the steering (E-beam pointing) angle is assumed at (Oao9 6eo) = (O90). Usually, all three A-beams can be obtained simultaneously from a single aperture, resulting in a system with four receiver channels.
beam norm, gain, dB
norm, gain, dB
beam
I Figure 4.1
A ae -beam norm, gain, dB
Ae-beam PQ
An example of E- and A-beams of a planar array with tapering: H-azimuth 35 dB Taylor, Y-elevation of 25 dB Taylor, A-azimuth of 30 dB Bayliss, and A-elevation of 25 dB Bayliss
Z-beam A-beam Taylor(35)/Bayliss(30) normalised antenna pattern, dB
Nc=l6
sin 6
Figure 4.2
An example of null-peak aligned H A-beams with tapering: 35 dB Taylor for E and 3OdB Baylissfor A
Figures 4.2 and 4.3 are two examples of different A^-beams with their respective E-beams, where the idealised planar array is assumed to have fixed column combiners and thus does not have Ae- or Aae-beams. The purpose of these two Figures is to show the null alignment of the E- and A-beams of different tapering without any array error, which affects the performance of EA-STAP.
4.2
XA-STAP algorithms
Figure 4.4 illustrates the block diagram of general EA-STAP where the dimension of the processor's spatial DoF, Nps, is determined by the number of A-beams. Under the assumption of no redundant A-beams, Nps is equal to the number of A-beams. Much of this block diagram follows the general STAP configuration. Let Xs, Nt x 1, be the E-channel data of a range cell before temporal DoF reduction, where Nt is the number of the pulses in the CPI. Let XA, NpsNt x 1, be the stacked A-channel data of the same range cell before temporal DoF reduction. We can express the data after DoF reduction as: (4.5) (4.6)
normalised antenna pattern, dB
Z-beam A-beam Hanning/full-cycle sine Nc=16
Figure 4.3 An example of null-aligned T^A-beams with tapering: Hanningfor E and full-cycle sine for A where T, Nt x (Npt +1), is the temporal DoF reduction matrix, and Npt represents the processor's temporal DoF whose specification is determined by the clutter suppression need and the available sample support, and I(^W is the Nps by Nps identity matrix. The estimated correlation matrix can be written as: (4.7) where (4.8)
(4.9)
(4.10)
(4.11) with y-£,k, yAk, k = 1,2,3,..
.,K being the selected/conditioned samples.
From phased array beamformer or reflector antenna with X-A feed system Z (sum) channel
A (difference) channel(s)
receiver and A/D
receiver and A/D
temporal DoF reduction
temporal DoF reduction
joint space-time domain adaptive processing with Nps=no. of A-channels and Npt = the required and supportable temporal DoF
clutter suppressed outputs at all Doppler bins and all range cells for further processing
Figure 4.4
Block diagram of general E A-STAP where Nps (Npt) is the processor s spatial (temporal) DoF
Let S/, Nt x 1, be the temporal steering vector of a chosen Doppler bin, and denote: (4.12) (4.13) and (4.14) For EA-STAP, the test statistic is computed using modified sample matrix inversion (MSMI) or generalised likelihood ratio (GLR). The MSMI and GLR tests are, respectively: (4.15)
and (4.16) where the filtering weight vector, (Nps + l)(Npt + 1) x 1, is given by: (4.17) We note that equations (4.15) and (4.16) differ from the general MSMI and GLR expressions only because of the deep central nulls of the A-beams. As an example we now consider a typical S A-STAP algorithm of Figure 4.5 where a single A-beam is employed and the temporal DoF reduction is the Doppler-domain localised processing approach (DDL). Under the assumption of no zero padding and a uniform pulse train, the matrix T in equations (4.5) and (4.6) is just the standard DFT From phased array beamformer or reflector antenna with Ir-A feed system E (sum) channel
A (difference) channel
receiver and A/D
receiver and A/D
1-D DFT of min. Nt points
1-D DFT of min. Nt points
modified SMI or GLR algorithm of 6th order (as shown) for theyth Doppler bin with Nps = 1 and Npt = 2
clutter suppressed outputs at they'th Doppler bin and all range cells for further processing
Figure 4.5
Block diagram of a typical HA-STAP with a single A-channel and DDL(2)
matrix for Npt + 1 frequency bins, and st of equation (4.12) becomes a vector of Npt zeros centred around the only non-zero entry of 1.0. Obviously, further computation reduction can be achieved with such st in equation (4.15) or (4.16). This algorithm with Npt = 2 has been applied to measured airborne radar data [4] and the results are presented in section 4.4.
4.3 4 J.I
Analytical performance formulas of EA-STAP SINR potential
The SES[R potential is defined as the output SINR of the filtering portion of the STAP when the correlation matrix is exactly known. The filtering weight vector for the known correlation matrix Q is:
(4.18)
(4.19)
(4.20)
(4.21) (4-22) (4.23) (4.24)
(4.25)
with (4.26) (4.27) (4.28) (4.29) The SINR potential can be found by: (4.30) (4.31) where Ps is the power of the input signal.
4.3.2 Probabilities of detection andfalse alarm 4.3.2.1 MSMI The test of equation (4.15) leads to the probability of false alarm [7]: (4.32) where (4.33) (4.34) (4.35) The probability of detection is given by: (4.36) where, for the case of non-fluctuation target:
(4.37) with (4.38) being the output SINR potential, and a is the amplitude of the input signal.
For the case of the Swerling I target fluctuation model where the target amplitude is assumed to be Gaussian with zero mean and variance o^: (4.39) with (4.40) 4.3.2.2
GLR
The probability of false alarm [7] is: (4.41) The probability of detection is: (4.42) where fp is defined in equation (4.33), and for the case of non-fluctuation target:
(4.43)
with fi of equation (4.38). For the case of the Swerling I target, we have: (4.44) where /3 is given in equation (4.40).
4.4
A real-data demonstration of DA-STAP
To illustrate its simplicity and yet good performance, we will use airborne radar data for a performance demonstration of I] A-STAP against a popular STAP approach, and the conventional non-adaptive approach involving the E-channel only. The airborne radar referenced here was developed by the Air Force Research Laboratory, Rome NY site, and was called the MCARM (multichannel airborne radar measurement) system. The L-band MCARM system has sixteen half-wavelength spaced columns each with a receiver channel, i.e. Nc — Ns = 16. Separately, an analogue beamformer delivers a E-beam of an over —50 dB sidelobe level (Figure 4.6) and a A^-beam with a
—25 dB central null (Figure 4.7). One should note that the above analogue beamforming performance with such a small array is rarely achieved by digital beamforming with current hardware. The data set is part of the Flight 2 data collected over a rural area in the eastern shore region south of Baltimore, MD in early 1995