Beamforming and Space-Time Adaptive Processing
Beamforming and Space-Time Adaptive Processing
Presented By:
Dr. Harshavardhan Singh
Assistant Professor
Midterm- 30 Marks
• Where is the jammer power and w(t) is a unit variance zero mean
white random process.
• A snapshot of the array response to the jammer gives
Adaptive Beamforming
Solution:
Use simply the formulas given in previous slide.
Space-Time Signal Modeling
• Space-time adaptive processing (STAP) applies vector matched filtering to the
combined slow-time/phase center data set in each range bin.
• The two-dimensional slice of the datacube in range bin l0, y[l0, m, n], is called a
space-time snapshot (or just snapshot) of the data. To proceed, the N × M two-
dimensional snapshot is converted to an NM × 1 = P × 1 column vector by
stacking the columns:
Two-dimensional spacetime
snapshot and then to a one-dimensional vector.
• Next, the filter weight vector h must be designed using Eq.
• The target model vector t = t(fD, θ) must represent the expected signal
from a target at some specific Doppler shift fDt and AOA θt of interest.
Define a temporal steering vector
• This is simply the model for the slow-time data sequence corresponding
to a target at normalized Doppler frequency fDt.
• The two-dimensional snapshot of the data from a target at Doppler fDt
and AOA θt would have the temporal variation of at(fDt) in each row
and the spatial variation of as(θt) in each column. The snapshot
therefore has the form of the outer product of as with at
where each terms are uncorrelated i.i.d. random variables with equal
power .
• The covariance of the jammer temporal variation is
• If the AOA of the jammer is θJ0, the space-time data vector for the jammer
component is
• where sigma square term represents the power of the θth clutter patch
as determined by the radar range equation.
• The total clutter vector is
where yf [m] and ya[m] are the fore and aft phase center outputs,
respectively. It is sufficient to work with a single “sub-CPI”, i.e., an interval
of Ms pulses, that spans the two pulses combined in the DPCA processor.
The complete CPI snapshot is then constructed of a series of M – Ms
overlapping sub-CPIs as shown in the bottom portion of Fig. (previous fig.)
for the case Ms = 2. The weight vector h1 that implements above eq. for a
single sub-CPI and the corresponding weight vector h for the entire CPI are
shown in below Fig in two-dimensional form.
• Viewed as a two-dimensional discrete function, the sub-CPI weight vector
h1 can be written as
Note that this function has a zero at ωD = kθ/Ms = βkθ, which is exactly the
expression for the clutter ridge in Eq. (9.28). Figure 9.19 shows |H1(fD, kθ)|
for the case Ms = 2. Clearly, the DPCA processor implements a null along the
clutter ridge.
• On the other hand, the constrained form of the weight vector Equation
prevents any combining of samples from different phase centers on the
same pulse so that the DPCA processor cannot provide any spatial
beamforming capability. As a result, DPCA processing can cancel the
clutter but not jammers.
Adaptive Matched Filtering
• Consequently, they can be used to compute a sample mean estimate
of SI, denoted ŜI. Specifically, the sample covariance of the data from
a single reference cell is