Diss / (Springer Series in Information Sciences 25) S. Haykin, J. Litva, T. J. Shepherd (auth.), Professor Simon Haykin, Dr. John Litva, Dr. Terence J. Shepherd (eds.)-Radar Array Processing-Springer-Verlag
.pdf30 Z. Zhu and S. Haykin
Besides, A is of full column rank. Then, the rank of 'P;x, and hence, the rank of 'Py, are equal to K when K < M. Thus, the spectral representation of Ry is
(2.110)
where A = diag(A1" .. , AK) is the matrix of the K largest eigenvalues of Ry , with A1 ~ A2 ... ~ AK > (12, and V = [V1 ... VK] is the M x K matrix of the corresponding eigenvectors. Now, the unknown parameter vector 8 contains A and V.
Using the spectral representation theorem, we may express the positive definite matrix Syas
Sy = ELEH ,
where L = diag(/1' ... ,1M ) is the matrix ofthe eigenvalues of Sy =
11 > 12 ... > 1M > 0, and E = [E1 ... EM] is the matrix of the corresponding eigenvectors.
Following Anderson [2.17], the maximum likelihood estimates of Ai and Vi
are
Ai = Ii, |
|
Vi=Ei , |
(2.112) |
for i = 1, ... , K. Thus, the pseudo maximum likelihood estimate of Ry , under the assumption that only the rank of K of 'Py is known, and regardless that A is a known function of 01> ... , OK' may be expressed as
fly = Ediag(l1 - (12, ... , IK - (12,0, ... , O)EH + (121
(2.113)
Hence, we obtain
IRylA = (12(M-K) nK Ii . i=1
From (2.111) and (2.113), we have
tr |
{ |
A _ 1 |
Sy |
} |
= |
~ |
Ii |
+ K . |
|
Ry |
|
L... |
2 |
||||
|
|
|
|
|
|
i=K+1(1 |
|
Using the above relations, from (2.107) we obtain the log-likelihood function
for H1 when Ry equals fly as |
|
|
|
|
li) |
|
|
|
max In[JdYI8)] = N |
[ |
In |
( |
M |
M |
Ii |
] |
|
|
|
n |
2 |
- L |
2 - K |
|
||
Rank'l'y=K |
|
|
|
i=K+1(1 |
i=K+1(1 |
|
- Nln (nM.nli) .
• =1
2. Radar Detection Using Array Processing |
31 |
Letting Y = DX in the above equation, we get the log-likelihood function for HI when 'l'x equals its pseudo maximum-likelihood estimate as
max |
M |
[.) |
- |
M |
[. |
K |
] |
In[fl(XI@)] = N [ In ( TI |
~ |
L |
~ - |
|
|||
Rank'l'x=K |
i=K+10" |
|
i=K+10" |
|
|
||
|
- Nln(nMl\[i) - NlnlCol· |
|
(2.114) |
The log-likelihood function for Ho may be obtained by letting K = 0 in (2.114) as
- Nln(nMiU [i) - NlnlCol· |
(2.115) |
||||
From (2.114) and (2.115), we get the generalized log-likelihood ratio |
|
||||
In [2(X)] = |
max In[fl(XI@)] -In[fo(X)] |
|
|||
Rank'l'x = K |
|
|
|
|
|
|
K [. |
|
(K (.) |
] |
(2.116) |
=N [ L~-ln |
TI~ |
- K . |
|||
|
i=10" |
|
i=10" |
|
|
The test statistic may take the form |
|
|
|||
K [. |
( K ( . ) |
, |
|
|
(2.117) |
q= L~-ln |
TI~ |
|
|
||
i=10" |
i=10" |
|
|
|
|
which is in closed-form.
Now, let us consider the detection of Swerling II targets of an unknown number by a noncoherent radar. Two possible ways, based on the pseudo maximum likelihood estimate, will be described under the assumption that target signals are not fully correlated with each other.
a) The Multiple Alternative Hypothesis Testing Problem
Let H K be the hypothesis that the number of targets is K in a certain range gate.
From (2.114), the log-likelihood function for H K , when |
'l'x equals its pseudo |
|
maximum likelihood estimate, may be expressed as |
|
|
max |
InfdXI@K)] = N[ln( n)[~ - f |
[~ -KJ |
Rank'l'x = K |
i=K+ 1 0" i=K+ 10" |
(2.118)
32 Z. Zhu and S. Haykin
The generalized log-likelihood ratio of HM against HK is
=N [ |
M |
[. |
(M |
1-) |
-M+K |
] |
. |
(2.119) |
|
L |
-};-In |
|
n |
-}; |
|
||||
|
i=K+lO" |
|
i=K+lO" |
|
|
|
|
||
The test statistic is |
(M l.) |
|
|
|
|
|
|
||
M [. |
. |
|
|
|
|
(2.120) |
|||
qK = L -}; - In |
n -}; |
|
|
|
|
|
|||
i=K+lO" |
i=K+lO" |
|
|
|
|
|
|
|
Starting from K = 0 and lettingK = 0, 1, ... , P, where |
P < M, we conduct |
a sequence of binary hypothesis tests. The first time that |
we accept the null |
hypothesis H K , the number of targets is determined as that value of K.
b) The Model-Order Selection Problem
The log-likelihood function for HK when 'P" equals its pseudo maximum likelihood estimate was expressed by (2.118). The number of the adjustable parameters remains to be determined. When using the pseudo maximum
likelihood |
estimate of 'P", the unknown |
parameter vector 6 K |
contains |
|
Al , ... ,AK , |
and Vl , ... , VK • Observe that |
the eigenvalues of a |
Hermitian |
|
matrix are real and the eigenvectors are complex. Hence, 6 K has |
K |
+ 2MK |
parameters. But, the eigenvectors are constrained to be orthonormal. This amounts to a reduction in the degrees of freedom by 2K due to the normalization, and by K(K - 1) due to the mutual orthogonalization. Thus, the number of adjustable parameters, mK' is
mK = K (2M - K) . |
(2.121) |
Substituting (2.118) and (2.121) into (2.51) for the AIC criterion, and ignoring terms that do not depend on K, we obtain
AIC=2N[ |
t |
l~_ln( fI |
[~)+K]+2K(2M-K). |
(2.122) |
||||
|
i=K+lO" |
i=K+lO" |
|
|
|
|
||
Similarly, for the MDL criterion, we get |
|
|
|
|
||||
MDL = N [ |
M |
[. |
(M |
[.)] |
1 |
- |
K)lnN . |
(2.123) |
L |
-}; -In |
n |
-}; |
+ -K(2M |
||||
|
i=K+lO" |
i=K+lO" |
2 |
|
|
|
Both of these methods solve the detection part of a combined detectionestimation problem without explicitly estimating the parameters of the signals. Because these methods rely upon the pseudo maximum likelihood estimate, their performance may not be as good as when a true maximum likelihood estimate is utilized. Moreover, the method (a) suffers from the difficulty in
2. Radar Detection Using Array Processing |
33 |
determining the threshold, whereas the procedure (b) cannot freely control the error probability.
2.4 Passive Radar Detection
In the foregoing two sections we have discussed the detection in active coherent and noncoherent radars that are active. In this section, the passive radar detection problem using array processing is considered.
2.4.1 Signal and Noise Model
The concepts of range gate and pulse repetition period in an active pulsed radar are not available for use in a passive radar. In a passive radar array processing, snapshots of observation samples are taken at the rate of time sampling. We assume that the signals produced by emitters under surveillance are narrowband, and also have the same known carrier frequency.
We may use (2.56) to describe the signal sample of the kth emitter and the nth snapshot in a passive radar, reproduced here for convenience:
8kn = bknexp(jePkn), k = 1, ... ,K; n = 1, ... ,N . |
(2.56) |
The amplitude bkn and the phase ePkn are unknown variables as a function of n. As in Sect. 2.3.1, two signal models, one deterministic and the other narrowband Gaussian, will be considered.
Unlike the case ofan active radar, we may assume that the spatial covariance of noise in a passive radar is (121 due to the fact that, usually, only system noise is considered in this case. There are two possible situations for the noise power. If the noise power can be estimated by using reference noise samples, the problem becomes the same as in an active noncoherent radar. Alternatively, we may consider an unknown (12. In the sequel, we assume that the noise is independent of the signals, and the time series of observation samples is independent and identically distributed.
2.4.2 Detection of Emitters with Known Directions
In the unknown (12 case, an averaged likelihood ratio test is very difficult to implement, even for a single emitter with known direction. Therefore, we consider the detection of multiple emitters with known directions, including the single emitter as a special case.
If there exist K emitters, the observation vector is expressed as in (2.7) reproduced for convenience as
Xn = ASn + Wn, n = 1, ... ,N .
34 Z. Zhu and S. Haykin
We consider the binary hypothesis testing problem:
for n = 1, ... ,N. The case of a deterministic signal is considered.
Noting that Co = 1, then from (2.68), we have the following likelihood function for hypothesis H1:
(2.124)
The unknown parameter vector 8 in (2.124) contains (12 and S,,' n = 1, ... ,N. Like (2.70), the maximum likelihood estimate of s" is the solution of a linear least-squares problem. The result is
(2.125)
When s" equals s" of (2.125), the likelihood function for H1 becomes
max!1(XI8) = (n(12)-MN exp[-~( f X~X,,-J 2)], |
(2.126) |
||
~ |
(1 |
11=1 |
|
where |
|
|
|
|
N |
|
|
J2 = |
L x~A(AHA)-1AHx". |
|
(2.127) |
|
,,=1 |
|
|
Taking the natura1logarithm of (2.126), we get |
|
||
In[ ~~X!dXI8)]= -MNln(n(12) - |
:2 Ct1 x~x"- J2 ) . |
|
Setting the derivative of the above function with respect to (12 to zero, we find that the maximum likelihood estimate of (12 under H1 is given by
A2 |
1 |
(2.128) |
(11 = MN Jmin , |
||
where |
|
|
|
N |
|
Jmin = |
L X~X" - J2 • |
(2.129) |
|
,,=1 |
|
Substituting (2.125) and (2.128) into (2.124), we get |
|
|
!1(XI8) = (n~:n)MN |
(2.130) |
2. Radar Detection Using Array Processing |
35 |
The likelihood function for Ho can be written from (2.21) as
fo(XI0"2)=(n0"2)-MNexp(-~ f X~Xn). |
(2.131) |
0" n=l |
|
In a manner similar to (2.128), we can find the maximum likelihood estimate of 0"2 under H 0 as
~2 |
1 |
~ H |
0"0 |
=-N ~ XnX n · |
|
|
M |
n=l |
Substituting (2.132) into (2.131), we get
fo(XI 0-5) = ( ~NH )MN
ne L Xn Xn n=l
The generalized likelihood ratio is
Hence, the test statistic is
N
L x~xn
q = n=l
-N~---'-'-"'::""'-----
L xn[I - A(AHA)-l AH]Xn
n=l
(2.132)
(2.133)
(2.134)
(2.135)
We see, therefore, that when the noise power 0"2 is unknown, the test statistic for detecting emitters with known directions is a ratio of two sums of quadratic forms, the computation of which is more complicated than (2.75) for known 0"2. Even so, the test statistic of (2.135) is still in closed-form.
The generalized likelihood ratio test for detecting emitters of narrowband Gaussian model with known directions, may be derived on the basis of [2.6].
2.4.3 Detection of Emitters with Unknown Directions: Deterministic Signal
The deterministic signal is considered in this section. First, we discuss the case of a known number of emitters.
36 Z. Zhu and S. Haykin
The binary hypothesis testing problem of (2.67) is reproduced here as
for n = 1, ... , N. In the present case, however, both signals and directions of the emitters are unknown. Moreover, the noise power (J2 is also unknown.
As in Sect. 2.3.3, there are two approaches that we make in applying a generalized likelihood ratio test to solve the problem of (2.67). The first approach is based on a true maximum likelihood estimate. Here, we also have a least-squares problem. The linear part of the problem has a solution that is the maximum likelihood estimate of signals as shown by (2.125). The nonlinear part of the problem may be solved by a K-dimensional search to find the maximum likelihood estimate of emitter directions. As in Sect. 2.4.2, we can find the maximum likelihood estimate of the noise power (J2 under H 1 as
A2 |
= |
|
1 |
J' |
(2.136) |
(J1 |
MN |
min· |
|||
Here, |
|
|
|
|
|
|
|
|
N |
|
|
J:nin = |
L X~Xn - J 2max , |
(2.137) |
n=1
and
(2.138)
where A denotes A taking maximum likelihood estimates of directions as its arguments. We thus get the likelihood function for hypothesis H1 when 8 equals @as
(2.139)
From (2.133) and (2.139), the generalized likelihood ratio is
(2.140)
2. Radar Detection Using Array Processing |
37 |
The test statistic is
N |
|
L x~xn |
|
n=1 |
(2.141) |
q = -N.,------~~----- |
|
L x~[I-A(AHA)-1AHJxn |
|
n=1 |
|
Equation (2.141) is more complicated than (2.135), due to the fact that the denominator of (2.141) is a function more complex than the quadratic form given in (2.135). The reason for this is the dependence of A on X. Note that the test statistic of (2.141) is in a concise form but not a closed-form.
The second approach uses a pseudo maximum likelihood estimate based on an eigendecomposition method.
In a similar way to (2.81), and noting that Co = I, we can express the
likelihood function for H 1 as |
|
f1 (XI@) = (n0"2)-MN exp ( - :2tr {(X - U)H(X - U)} ) . |
(2.142) |
When the signals of the emitters are not fully correlated with each other, and the condition K < M ::; N holds, we may write, e.g. see (2.91):
max |
f1(XI@)=(n0"2)-MNexp(-~ |
t Ii)' |
(2.143) |
RankU=K |
0" |
i=K+1 |
|
where Ii is the eigenvalue of the sample covariance matrix Sx = (ljN)XXH in decreasing order with respect to i.
Taking the natural logarithm of(2.143), and setting the derivative of it, with respect to 0"2, to zero, we obtain the maximum likelihood estimate of 0"2 under
H1 as
&i =~ t |
Ii· |
|
|
|
(2.144) |
|
M i=K+1 |
|
|
|
|
|
|
Substituting (2.144) into (2.143), we get |
|
|||||
|
|
|
M |
|
MN |
|
max fdXI@)= ( |
) |
(2.145) |
||||
M |
||||||
Rank U = K,u2 |
|
ne |
L |
Ii |
|
|
|
|
|
i=K+1 |
|
|
|
From (2.133), using the relation |
|
|
||||
N |
M |
|
|
|
|
|
L x~Xn = N |
L Ii, |
|
|
|
(2.146) |
|
n=1 |
i=1 |
|
|
|
|
|
we get |
|
|
|
|
|
|
fO(XI&6)=( ne ~L Ii |
)MN |
|
|
(2.147) |
||
|
|
|
i= 1
38 |
Z. Zhu and S. Haykin |
||
|
The generalized likelihood ratio is obtained from (2.125) and (2.127) as |
||
|
|
max |
fl(XI6) |
|
,1,(X) = RankU=K,u' |
2 |
|
|
|
fo(Xlo-o) |
|
|
|
|
(2.148) |
The test statistic is |
|
||
|
|
M |
|
|
|
L li |
|
|
q= |
i= 1 |
(2.149) |
|
M |
||
|
|
L li |
|
i=K+1
which is in closed-form.
Finally, we consider two possible ways for detecting emitters of unknown numbers with unknown directions by the multiple alternative hypothesis testing.
a) The Method Based on a True Maximum Likelihood Estimate
Let H K denote the hypothesis that K emitters exist. The likelihood function for HK is fK(XI6K). The unknown parameter vector 6 K contains S1" •• ,SK; (}1" •• , (}K; and (12. The maximum likelihood estimate of 6 Kis denoted by 8K. From (2.139) we have
(2.150)
where J:!fJ may be expressed from (2.137) and (2.138) as
(2.151)
In (2.151), AK signifies Aassuming that the number of emitters is K. For K = 0,
'(O) _ |
",N |
H |
we have J min - |
Lm= 1 |
Xn X n • |
When K = M, we have J:!t!) = 0; then, (2.150) makes no sense if K = M. We consider K = M -1. From (2.130) we have
MN
) |
(2.152) |
1) |
|
2. Radar Detection Using Array Processing |
39 |
Setting K = 0, 1, ... , P, where P < M -I, we may conduct a sequence of binary hypothesis tests:
Hi :HM - 1 ,
(2.153)
H 0: H K' K = 0, I, ... , P .
At the Kth step, the generalized likelihood ratio may be obtained from (2.150) and (2.152) as
A(X) = fM-l(XI~M-d
fK(XI8K)
_ |
( |
J'(!') |
)MN |
mIn |
|
||
- |
|
J'(¥ |
1) |
|
|
mm |
|
~ xH[/_ 1 (1H1 )-11 |
H |
|
MN |
|
Jx |
|
|||
L..,;n |
KKK |
Kn |
) |
|
N |
|
|
|
|
n=l |
|
|
|
(2.154) |
( |
|
|
|
|
|
|
|
|
(2.155)
o
Starting from K = 0, we thus test HK sequentially. The value of K for which HK is first accepted is determined as the estimate [( of the number of emitters.
b) The Method Based on a Pseudo Maximum Likelihood Estimate
Assume that the emitter signals are not fully correlated with each other, and the condition K < M ~ N holds. We may then perform a sequence of binary hypothesis tests based on (2.153) for K = 0,1, ... , P, where P < M -1. The generalized likelihood ratio for the Kth step is obtained by using (2.145) as
max fM-l(XI8M-d
A(X) = RankU=M-l,u'
max fK(XI8K)
RankU= K,u'
|
|
|
(2.156) |
The test statistic for the K th step is |
|||
|
|
M |
|
q |
_ |
L |
Ii |
i=K+l |
(2.157) |
||
|
K- |
IM |
|
|
|
|