Computationally-efficient range-dependence compensation method for bistatic radar STAP

Fabian D. Lapierre; Jacques G. Verly

doi:10.1109/RADAR.2005.1435919

Computationally-efficient range-dependence compensation method for bistatic radar STAP

Fabian D. Lapierre, Jacques G. Verly

Communication, Information, Systems and Sensors

Université de Liège

Research output: Contribution to journal › Conference article › peer-review

Abstract

We address the problem of detecting slow-moving targets using space-time adaptive processing (STAP). The construction of the optimum weights at each range implies the estimation of the interference-plus-noise covariance matrix. This is typically done by straight averaging of snapshots at neighboring ranges. However, in most bistatic configurations, snapshot statistics are range dependent. Straight averaging results thus in poor performance. In an earlier paper, we proposed a range-dependence compensation method that provides optimum performance. However, this implies a large computational cost. In this paper, we adapt the method to provide optimum performance at low computational cost.

Original language	English
Article number	1435919
Pages (from-to)	714-719
Number of pages	6
Journal	IEEE National Radar Conference - Proceedings
Volume	2005-January
Issue number	January
DOIs	https://doi.org/10.1109/RADAR.2005.1435919
Publication status	Published - 2005
Event	2005 IEEE International Radar Conference Record, RADAR 2005 - Arlington, United States Duration: 9 May 2005 → 12 May 2005

Keywords

Radar
bistatic
space-time adaptive processing

Access to Document

10.1109/RADAR.2005.1435919

Cite this

@article{039e9f6e3b86452d8a913446554639c5,

title = "Computationally-efficient range-dependence compensation method for bistatic radar STAP",

abstract = "We address the problem of detecting slow-moving targets using space-time adaptive processing (STAP). The construction of the optimum weights at each range implies the estimation of the interference-plus-noise covariance matrix. This is typically done by straight averaging of snapshots at neighboring ranges. However, in most bistatic configurations, snapshot statistics are range dependent. Straight averaging results thus in poor performance. In an earlier paper, we proposed a range-dependence compensation method that provides optimum performance. However, this implies a large computational cost. In this paper, we adapt the method to provide optimum performance at low computational cost.",

keywords = "Radar, bistatic, space-time adaptive processing",

author = "Lapierre, {Fabian D.} and Verly, {Jacques G.}",

note = "Publisher Copyright: {\textcopyright} 2005 IEEE.; 2005 IEEE International Radar Conference Record, RADAR 2005 ; Conference date: 09-05-2005 Through 12-05-2005",

year = "2005",

doi = "10.1109/RADAR.2005.1435919",

language = "English",

volume = "2005-January",

pages = "714--719",

journal = "IEEE National Radar Conference - Proceedings",

issn = "1097-5659",

number = "January",

}

TY - JOUR

T1 - Computationally-efficient range-dependence compensation method for bistatic radar STAP

AU - Lapierre, Fabian D.

AU - Verly, Jacques G.

PY - 2005

Y1 - 2005

N2 - We address the problem of detecting slow-moving targets using space-time adaptive processing (STAP). The construction of the optimum weights at each range implies the estimation of the interference-plus-noise covariance matrix. This is typically done by straight averaging of snapshots at neighboring ranges. However, in most bistatic configurations, snapshot statistics are range dependent. Straight averaging results thus in poor performance. In an earlier paper, we proposed a range-dependence compensation method that provides optimum performance. However, this implies a large computational cost. In this paper, we adapt the method to provide optimum performance at low computational cost.

AB - We address the problem of detecting slow-moving targets using space-time adaptive processing (STAP). The construction of the optimum weights at each range implies the estimation of the interference-plus-noise covariance matrix. This is typically done by straight averaging of snapshots at neighboring ranges. However, in most bistatic configurations, snapshot statistics are range dependent. Straight averaging results thus in poor performance. In an earlier paper, we proposed a range-dependence compensation method that provides optimum performance. However, this implies a large computational cost. In this paper, we adapt the method to provide optimum performance at low computational cost.

KW - Radar

KW - bistatic

KW - space-time adaptive processing

UR - http://www.scopus.com/inward/record.url?scp=84937038554&partnerID=8YFLogxK

U2 - 10.1109/RADAR.2005.1435919

DO - 10.1109/RADAR.2005.1435919

M3 - Conference article

AN - SCOPUS:84937038554

SN - 1097-5659

VL - 2005-January

SP - 714

EP - 719

JO - IEEE National Radar Conference - Proceedings

JF - IEEE National Radar Conference - Proceedings

IS - January

M1 - 1435919

T2 - 2005 IEEE International Radar Conference Record, RADAR 2005

Y2 - 9 May 2005 through 12 May 2005

ER -

Computationally-efficient range-dependence compensation method for bistatic radar STAP

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this