Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Diss / 28.pdf
Скачиваний:
172
Добавлен:
27.03.2016
Размер:
7.05 Mб
Скачать

32  NARROWBAND DIRECTION OF ARRIVAL ESTIMATION FOR ANTENNA ARRAYS

where Rxx is the spatial covariance matrix and rxd the spatial covariance vector. As in the case of spectral analysis, the linear prediction method provides coefficients for an all-pole filter (in time series spectral estimation, an autoregressive (AR) process). Once w has been computed, the DOAs

can be determined by identifying the peaks in the frequency response of the all-pole filter whose

transfer function is:

H(z) =

1

 

 

 

 

 

 

 

 

(3.38)

 

N

 

 

1 wk zk .

 

k =1

It is assumed that the number of signals present is known beforehand to be r. If the r largest peaks in the above function are located at zi = exp( jφi ) i = 0, 2, …, r – 1, then the angles of arrival of the r signals can be related to the peaks in H(z) as follows:

θi =

 

sin1

(φi), i = 1, 2, . . . , r .

(3.39)

2

 

 

 

 

The linear prediction method works for a uniform linear array and could also be extended to work with a planar array. More information about the use of linear prediction for DOA estimation can be found in [21].

3.2.7 The Unitary ESPRIT for Linear Arrays

The unique feature of the unitary ESPRIT algorithm [22] is that it can operate with strictly real computations. In a uniform linear array, the center element of the array can be taken as the reference element where the phase of the signal is taken as zero. When the number of elements is odd and the center element is taken as the reference, the steering vector for the uniform linear array will be conjugate centrosymmetric (i.e., conjugate symmetric about the center element). This steering vector [22] is given by:

 

 

 

 

(N

1)

 

T

 

 

aN (θ) = ej (N

2− 1)

ω

· · · e1 e

· · · e j

 

ω

,

(3.40)

2

 

 

 

 

 

 

 

 

 

 

 

where ω = 2 dsin(θ). When N is even, the reference point of the array is taken as the center of the array even though no element is positioned there, i.e.,

 

j N2 ω

 

 

 

 

 

 

 

 

N

 

T

 

a

(θ) = │

. . . e

/2

e

/2

e

j 3ω/2

. . . e

j

ω

(3.41)

2

N

e

 

 

 

 

 

 

 

.

Define the matrix ∏N as the N × N matrix with ones on the antidiagonal and zeros elsewhere. Using this matrix, the following relationship can be established:

Π

a (θ) = a*

(θ) ,

(3.42)

 

N N

N

 

Nonadaptive Direction of Arrival Estimation  33

where * denotes conjugation of the matrix elements. The conjugate centrosymmetric steering vector aN(θ) can be transformed to a real vector through a unitary transformation whose rows are centrosymmetric. One possible transformation when N is even and N = 2k is:

 

 

 

 

 

 

 

 

 

 

 

 

 

QN =

1

 

ΠIkk jjIΠk k .

(3.43)

 

 

2

 

 

 

 

 

 

 

 

 

 

 

 

 

If N is odd, N = 2k + 1 and

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Ik

0

j Ik

 

QN =

1

 

 

T

 

 

 

T

.

 

 

0

2 0

(3.44)

2

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Πk

0

j Πk

 

 

 

 

 

 

 

 

 

 

 

 

 

The centroconjugate symmetric steering vector aN(θ) can be transformed to a real vector dN(θ) as follows:

dN (θ) = QNHaN (θ) = [cos uN

21 . . . cos(u)

1

 

cos(0) sin uN

21 . . .

 

 

 

(3.45)

2

. . . sin (u) ]T .

 

 

Next, the covariance matrix of the transformed received array data is given by [22]:

ˆ

H

]

H

x .

(3.46)

Ryy = E [yy

 

where y = QN

Let us now examine the effect of transforming the data vectors by QN just as the steering vectors were transformed in (3.45). We assume that the data vectors obey the model described in (2.13), x = As + v, where the columns of A are the steering vectors of the incoming signals. Transforming x gives:

y = QH x = QH As + QH v = Ds + QH v

 

N

N

N

N

 

= D Re{s} + j D Im{s} + Re {QNH v} + j Im {QNH v} .

(3.47)

The columns of matrix D are the real valued transformed steering vectors. From the equation above, one can see that in the absence of noise, y will simply be a linear combination of the columns of the matrix D. Therefore, the columns of D span the transformed signal subspace. This signal subspace can be estimated by either taking the real part of the transformed received array data vectors and finding a basis for the signal subspace of that set or operating in the same manner on the imaginary part. Both sets of data share a common signal subspace. Alternatively, the real and imaginary vectors can be combined into one large set of vectors and the signal subspace can be computed for the combined set. This allows all of the processing to be done with real valued computations [22].

34  NARROWBAND DIRECTION OF ARRIVAL ESTIMATION FOR ANTENNA ARRAYS

If the first N – 1 elements of aN(θ) are multiplied by e j ω, the resulting (N − 1) × 1 vector will be equal to the last N – 1 components of aN(θ). This can be expressed mathematically as:

e jωJ a

(θ) = J a (θ) ,

(3.48)

1 N

2 N

 

where J1 is an (N −1)×N matrix constructed by taking the first N – 1 rows of the N × N identity ma­ trix and J2 is the (N − 1) × N matrix constructed by taking the last N – 1 rows of the N × N identity matrix. The relation in the previous equation is known as the invariance relation [22]. Because QN is unitary, the following can be written:

e jωJ QH Q aN (θ) = J QH Q aN (θ) .

(3.49)

1 N N

2 N N

 

Now, using the definition [22] of dN(θ) in (3.45), we obtain:

e jωJ QH dN (θ) = J QH dN (θ) .

(3.50)

1

N

2

N

 

Using the following identities,

 

 

 

 

Π N1 J2ΠN = J1,

 

ΠN ΠN = I,

(3.51)

and multiplying J2 by ∏N − 1 on the left flips J2 up and down, and multiplying by ∏N on the right flips it left to right, resulting in the matrix J1.

QH

1

J Q

N

= QH

 

ΠN 1

ΠN 1 J ΠNΠNQ

 

 

 

 

N

2

 

N 1

 

2

 

N

 

 

 

 

 

 

 

 

= QNT 1 J1QN*

= QNH 1J1QN

*.

 

 

(3.52)

The above equation uses the fact that

Q

N

= Q* and QH

∏ 

= QT

. Now, let K

1

and K

2

 

 

 

 

N

 

 

N

N–1

N-1

N–1

 

 

be the real and imaginary parts of QHN–1J2QN , respectively. If we multiply the above equation by QNH–1, we obtain:

e QH

J Q

d (θ) = QH

J Q

d (θ) .

(3.53)

N 1

1 N

N

N 1

2

N N

 

Using the definitions for K1 and K2, the above equation becomes

 

e (K1 jK2)dN (θ) = (K1 + j K2)dN (θ)

(3.54)

e /2 (K1 jK2)dN (θ) = e/2 (K1 +

jK2)dN (θ).

(3.55)

Now rearrange by grouping the K1 and K2 terms

 

 

 

 

Nonadaptive Direction of Arrival Estimation  35

e /2 e/2 K1dN (θ) = e /2 + e /2 j K2dN (θ).

(3.56)

Using trigonometric identities we get:

tan(ω/2)K1dN (θ) = K2dN(θ) .

(3.57)

Now suppose that the DOAs are {θ1, θ2, …, θd}. Now, (3.57) can be extended to include all of dN(θ) as follows:

K1DΩ = K2D ,

(3.58)

where [22]

 

Ω = diag{tan( d sin θ1) . . . . tan( d sin θd)}.

(3.59)

The columns of D are the transformed steering vectors corresponding to the r incoming signals. As shown at the very beginning of this discussion, the signal subspace estimated from the real and imaginary vectors of the transformed data space y will span the same space spanned by the columns of the matrix D. If the basis for the signal subspace is contained in the columns of the matrix Es, then the matrices D and Es can be related by a matrix T. Es = DT, where T is r × r. Substituting D = EsT−1 into the equation K1DΩ = K2Ω, the result becomes:

K1EsT1 Ω = K2EsT1

(3.60)

or

 

K1EsT1 T = K2Es.

(3.61)

Let

 

Ψ = T1T

(3.62)

then the above equation becomes [22]

 

K1EsΨ = K2Es.

(3.63)

This says that the eigenvalues of Ψ are tan(d θi), i = 1, 2, …, r, and Ψ can be computed as the least squares solution to K1EsΨ = K2Es. This can be done because K1 and K2 are known and Es can be estimated from the data. Once Es is estimated, the DOAs can be computed [22] as the eigenvalues, λi, of Ψ, i.e.,

Соседние файлы в папке Diss