Printer Friendly

Robust adaptive beamforming with SSMUSIC performance optimization in the presence of steering vector errors.

ABSTRACT: A novel subspace projection approach was proposed to improve the robustness of adaptive beamforming and direction finding algorithms. The cost function of the signal subspace scaled multiple signal classification (SSMUSIC) is minimized in the uncertainty set of the signal steering vector, the optimal solution to the optimization problem is that the assumed steering vector can be modified as the weighed sum of the vectors orthogonally projected onto the signal subspace and the noise subspace. Using the estimated steering vector with small error to the true steering vector, the spectral peaks in the actual signal directions are guaranteed. Consequently, the problem of signal self-canceling encountered by adaptive beamforming due to steering vector mismatches is eliminated. Simulation and lake trial results show that the proposed method not only possesses high resolution performance, but also is robust to a few steering vector errors. Furthermore, the modified MUSIC algorithm outperforms the conventional MUSIC and SSMUSIC methods excellently.

Categories and Subject Descriptors

C. 3 [Special purpose and application based systems]; Signal Processing Systems G.4 [Mathematicsl Software]

General Terms

Signal processing, Signal Classification, Noise detection

Keywords: Robust adaptive beamforning, steering vector error, direction of arrival, diagonal loading, subspace projection matrix. Received 30 November 2006; Revised 15 February 2007; Accepted 12 March 2007

1. Introduction

Multi-channel array signal processing has been widely and successfully used in radar, sonar, seismology, wireless communications, audio and speech processing, etc. Adaptive beamforming and high resolution direction-of-arrival (DOA) estimation algorithms have received much attention in the past a few decades, and among which, the minimum variance distortionless response (MVDR) [1] and multiple signal classification (MUSIC) algorithm [2] are the most popular two techniques.

Adaptive beamforming is utilized to enhance the signal of interest (SOI) corrupted in unwanted interferers and noises. In order to maximize the signal-to-interference-plus-noise-ratio (SINR) of the adaptive beamforming, the array steering vector of the SOI usually needs to be known precisely. It is well known that the MVDR method may suffer significant performance degradation even when there are very small array steering vector errors [3], which may result from many factors, e.g., signal local scattering, DOA mismatch, small number of data snapshots, nonstationary propagating environment, and individual sensor errors of positions, gains and phases, etc. The performance of adaptive beamforming is even worse when the SOI is contained in the training data snapshots. Therefore, robust beamforming has been a key issue in array applications when there are signal model errors.

The most widely used method to improve the robustness of adaptive beamforming is diagonal loading (DL), for its simplicity and effectiveness [1], [5]. The idea is to add a scaled identity matrix to the array covariance matrix prior to inversion, so that the norm of the weight vector and the white noise gain are constrained, and the noise eigenvalues are equalized. The key problem of DL method is how to choose the proper diagonal loading parameter [4]. Recently, some worst case performance optimization methods have been proposed to determine the DL value properly [6]-[8], by which the array output power is minimized subject to the constraint that the SOI with steering vectors lying in an uncertainty set not being suppressed, and hence, the output SINR is maximized when there are steering vector errors, and the robustness is improved. Besson et.al [9] had derived the theoretical SINR performance analysis of the generalized diagonal loading beamformers when existing random steering vector errors, it was pointed out in [9] that for higher uncertainties, the remedy to improve robustness must be to estimate the steering vector or to obtain additional information about the actual steering vector, rather than to preserve the array's response over a larger uncertainty ellipsoid.

Another popular robust method is the subspace-based beamformer or the projection approach [10], which uses the orthogonal projection of the presumed steering vector onto the signal-plus-interference subspace, instead of the presumed steering vector. The performance of the subspace-based beamformer is improved in most steering vector error cases, but this approach is limited to high signal-to-noise-ratio (SNR) scenarios and its performance depends on the low-rank stationary model of the training data.

MUSIC [2] algorithm is a subspace high-resolution DOA estimation method, and it has been proved that the standard MUSIC method possesses a certain degree of inherent robustness to steering vector errors [11]. However, for small training sample data size, low SNRs, or correlated signals, the estimated noise subspace (eigenspace) is poorly aligned with the true noise subspace, which may result in DOA's missing or spurious peaks occurring. To mitigate these shortcomings, a new subspace identification algorithm called SSMUSIC was proposed in [12], SSMUSIC seeks the local maxima by the ratio of two quadratic forms in the steering vector, scaling the MUSIC cost function by the estimated signal subspace to deal with subspace mismatches. Since SSMUSIC exploits more information of the true covariance matrix, it appears to be more robust to low SNRs and small data sets than MUSIC.

In this paper, we extend the SSMUSIC algorithm to a constrained optimization problem in the presence of steering vector errors, and the basic idea is that SSMUSIC or adaptive beamformer has a local maxima if the steering vector coincides with the true signal response vector. The appropriate estimate of the steering vector can be found to maximize the SSMUSIC spectral function, or to minimize its reciprocal in the constrained uncertainty set of the steering vector. It is computationally effective and the performance improvement is obvious, and the proposed method can be considered as a generalized subspace projection approach.

The rest of this paper is organized as follows. Section 2 presents the signal model, and the SSMUSIC algorithm and adaptive beamfoming techniques are briefly reviewed. Section 3 proposes the new optimized robust adaptive beamforming algorithm based on SSMUSIC performance optimization criterion. Section 4 gives some numerical simulation results that illustrate the good behaviour of the proposed algorithm. Lake trial results are demonstrated in section 5, and section 6 concludes the paper.

2. Signal Model

Consider a uniform linear array (ULA) comprised of M sensors with element spacing d, the array output signal can be written as

x(t) = a ([theta].sub.0])[s.sub.0](t) + [j.summation over (i=1)] a ([theta].sub.2])[s.sub.i](t) + n(t)

= As(t)+n(t)

= a ([[theta].sub.o])[s.sub.o](t) + [Bs.sub.i](t)+n(t) (1)

where, s(t) is the source signal, [s.sub.0](t) is the expected signal, [s.sub.i](t) is the Jx1 interference signal vector, A is the Mx(J+1) signal-plus-interference steering matrix, M x J matrix B is the steering matrix of interferences, and n(t) denotes the additive Gaussian noise vector. The matrix A is as follows: A=[a([[theta].sub.j]), a([[theta].sub.1]),...., a ([[theta].sub.j])] , where a([theta]) is the array steering vector with ith element be expressed as , exp(j2 [pi](i-1)d sin [theta] / [lambda]), in which [lambda] is the propagating signal wavelength, then the array covariance matrix and its eigendecomposition can be written as

R = E {[xx.sup.H]} = A R s [A.sup.H] + [[sigma].sub.1.sup.2] I

= U [LAMBDA] [U.sub.H] = [U.sub.s][[LAMBDA].sub.s] [U.sub.s.sup.H] + [U.sub.n] [[LAMBDA].sub.n] [U.sub.n.sup.H] (2)

where [U.sub.s], [U.sub.n] denote the eigenvector matrices of the signal and noise, respectively, and the diagonal elements of [[LAMBDA].sub.s], [[LAMBDA].sub.n] are the associated signal and noise eigenvalues. According to MUSIC algorithm, A and [U.sub.s] span the same signal subspace, and the MUSIC cost function g([theta]) = a [([theta]).sub.H][U.sub.n][U.sub.n.sup.H]a([theta]) has a local minima in the actual direction of the incoming signal when the steering vector is exactly known. However, when there are steering vector errors, the minima may be away from the true signal direction, and the null may be not deep enough as to be distinguished.

SSMUSIC is an optional method to improve the performance of MUSIC [12], especially in low SNRs and short training data cases. The SSMUSIC cost function is given by

f ([theta]) = [a.sup.H] ([theta]) [P.sup.n] a ([theta])/([a.sup.H]([theta])[R.sub.A.sup.+] a([theta]) (3)

where the numerator of f([theta]) is the familiar MUSIC cost function which measures the energy that resolves in the noise subspace, and the denominator is a bearing response function that resolves finer scale information about the signal subspace. Thus SSMUSIC shows some robustness to the subspace mismatches since it exploits the full structure of the array spatial covariance matrix. And [P.sub.n] = [U.sub.n][U.sub.n.sup.H] is the orthogonal projection matrix onto the noise subspace. [R.sub.A.sup.+] is the pseudo inverse of the signal covariance matrix [R.sub.A] x [R.sub.A] and [R.sub.A.sup.+] are given by [12]:

[R.sub.A] = R - [[sigma].sub.n.sup.2] I = [AR.sub.s][A.sup.H]

= [U.sub.s] ([[LAMBDA].sub.s] - [[sigma].sub.n.sup.2] I) [U.sub.s.sup.H] (4)

[R.sub.A.sup.+] = [U.sub.s] [([[LAMBDA].sub.S] - [[sigma].sub.n.sup.2]I).sup.-1] [U.sub.s.sup.H] (5)

In practice, the exact covariance matrix R is unavailable. Therefore, the sample covariance matrix (SCM) estimated from N data snapshots

R = 1/N [N.summation over (t=1)] X (t) [X.sup.H] (t). (6)

is used instead of R. In theory, [??] is a consistent estimator of R, in other words, it converges in probability to R [14]. Thus, (5) is replaced by:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

with

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

where [lambda] is the eigenvalues of [??].

Perhaps the MVDR algorithm is the most commonly used adaptive beamforming, it is a spatial filter intending to make the output power minimized with the constraint that its response is equal to unity in the SOI direction. The MVDR criterion can be expressed as [1]:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

Using the Lagrange multiplier method, the solution of (7) is given by

[w.sub.MW] = [[??].sup.-1]a ([[theta].sub.0])/[a.sup.H] ([[theta].sub.0]) [[??].sup.1]a([[theta].sub.0]) (8)

(8) is also referred to as sample matrix inversion (SMI) technique. The number N of data snapshots is required to be larger than the number M of sensors, so that the SCM is invertible. In order to obtain an average output SINR within 3dB of that of the optimum one, N is needed to satisfy that, N [greater than or equal to] 2M [13]. To combat the finite sample size effects and other random steering vector errors, the classical MVDR solution (8) is modified by adding a positive real factor a to the diagonal entries of the SCM, i.e., diagonal loading:

[w.sub.DL] = [([??] + [alpha]I).sup.-1] a )[[theta].sub.0]/[a.sup.H]([[theta].sub.0])[([??] + [alpha]I).sup.-1]a ([[theta].sub.0]) (9)

where [alpha] is the diagonal loading factor.

The robust beamforming algorithms proposed in [6]-[8] can be regarded as generalized diagonal loading methods. The beamforming constraint condition is that the beamformer's response be a little above unity for steering vectors that lie in an uncertainty ellipsoid being centered around the presumed steering vector. The corresponding worst case performance optimized solution is given by [9]

[w.sub.ADL] + [([??] + Q).sup.-1]a/[a.sup.H] [([??] + Q).sup.-1]a (10)

where Q is the generalized diagonal loading matrix, and ADL represents adaptive diagonal loading. When the ellipsoid is a sphere, (10) is reduced to (9). To model the uncertainty ellipsoid is very complex as in [8], and from the results in [6], the performance of the robust Capon beamforming (RCB) with ellipsoid constraint is not better than that of the RCB with sphere constraint. So only the sphere constraint on the steering vector will be considered in this paper.

3. Proposed Robust Beamforming with SSMUSIC Performance Optimization

In [11], the MUSIC algorithm was extended to a constrained minimization problem when there existing steering vector errors, and it was shown that the extended MUSIC can't provide better DOA estimates than the standard MUSIC, but it has some robustness, i.e., there is a tradeoff between the robustness and the performance of the estimation bias and variance. Below, we'll generalize an extended SSMUSIC algorithm and apply its results to adaptive beamforming, in order to obtain robustness against the steering vector errors.

3.1 Constrainedly Optimized SSMUSIC Algorithm

When the signal steering vector is exactly known, the SSMUSIC can achieve better resolution than standard MUSIC algorithm, especially in low sample size scenarios [12]. Now let the assumed steering vector and the true steering vector be ([epsilon] > [theta]) and [??]([theta]) when there are steering vector errors, the norm of the steering vector error can be bounded by a known

: [??] [greater than or equal to]

[parallel][??] - a[parallel] [less than or equal to [epsilon] (11)

When the actual signal steering vector belongs to the uncertainty set (11), the SSMUSIC cost function must has a minima along the steering vector, so the robust SSMUSIC algorithm can be written as a constrained minimization problem as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (12)

Using the fact that [U.sub.s][U.sub.s.sup.H] + [U.sub.n][U.sub.n.sup.H] = I, with I the identity matrix. We can write

[??] = [U.sub.s] [U.sub.s.sup.H][??] + [U.sub.n] [U.sub.n.sup.H][??] = [U.sub.s] [beta] + [U.sub.n] [gamma] (13)

where [beta] = [U.sub.s.sup.H][??], [gamma] = [U.sub.n.H][??] and f([theta]) can be rewritten as

f([theta] = [[parallel][gamma][parallel].sup.2] / [[parallel][([[LAMBDA].sub.s] - [[sigma].sub.n.sup.2]I).sup.1/2][beta] [parallel].sup.2] (14)

Inserting (13) in (12) leads to the new constraint condition:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (15)

Since the denominator of f([theta]) only influences the amplitude, the signal DOA is mainly determined by the nulls of f, i.e. the zeros of the numerator. The vector [beta] is taken as [??] = [[lambda].sub.1][U.sub.s.sup.H]a, thus the optimized solution of [gamma] is [??] = [[lambda].sub.2][U.sub.n.sup.H]a, [gamma] can't comprise one component which is perpendicular to [U.sub.n.sup.H] a.

Otherwise, the value of f([theta]) will increase and the constraint set will decrease, which is the same phenomenon as in [11]. Using [??] and [??] in (14), the minimization problem of (12) is reformulated as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (16)

It is obvious that [lambda] and [[lambda].sub.2] are confined to an ellipse centered at coordinate (1,1) as shown in Figure 1, and the half-lengths of the elliptical axes are [[epsilon].sup.1/2] / [parallel][U.sub.s.sup.H]a[parallel] and [[epsilon].sup.1/2] / [parallel] [U.sub.n.sup.H] [parallel], respectively.

Observing the geometrical relationship between [[lambda].sub.1] and [[lambda].sub.2], it can be concluded that the solution of problem (16) is

[[??].sub.1] = 1 + [[epsilon].sup.1/2] / [parallel][U.sub.s.sup.H]a[parallel],

[[??].sub.2] = 1 + [[epsilon].sup.1/2] / [parallel][U.sub.n.sup.H]a[parallel] (7)

for [epsilon]<[[parallel][U.sub.n.sup.H]a[parallel].sup.2], whereas when [epsilon] [greater than or equal to] [[parallel][U.sub.n.sup.H]a[parallel].sup.2], the solution of (16)

is [[??].sub.2] - 0, and it is obvious to see that [??] can be chosen arbitrarily.

[FIGURE 1 OMITTED]

Using (17) in (13), the approximation to the actual steering vector [??]([theta]) can be estimated by:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (18)

To maintain the modulus of the estimated vector [??] be constant to be M, which is the modulus of the assumed steering vector a, is scaled to

[??] = [??] [square root of M] / [parallel][??][parallel] (19)

The advantage of the scaling operation is that the signal power estimate can be less biased, it's because that the array weight vector has the "scaling ambiguity" [6], i.e., [w.sup.H]a = (1/[alpha])[w.sup.H]([alpha] a), with w the adaptive weight vector to maintain the signal undistortionless for MVDR beamforming.

Form (18), we can see that the steering vector estimate is the weighted sum of the projection of the presumed steering vector a onto the signal plus interference subspace and the noise subspace, respectively. Thus, the proposed method can be considered as a generalized projection approach, which is more robust to the steering vector errors since it exploits more eigen-structure information. Using (19) instead of the presumed steering vector a, the robust SSMUSIC spatial spectral function is given by

fH-SSMUSIC (theta) = ([??].sup.H], [theta]) [R.sub.A] + [??] ([theta])) / [??].sup.H] ([theta]) [P.sub.n] [??] ([theta]), (20)

which is the reciprocal of the cost function in (12).

3.2 Robust Eigenspace-based Beamforming

The proposed robust eigenspace-based beamforming is to using (19) instead of the presumed steering vector a in the MVDR weight vector (8):

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (21)

4. Numerical Results

An 8-element uniform linear array with 1m interelement spacing, which is half-wavelength of the received narrowband signal with center frequency 750Hz, is considered here. The underwater sound speed is assumed to be c=1500m/s. The received noise is modelled as additive temporal Gaussian white noise with power 0dB. There are two uncorrelated narrowband sources impinging on the array from [[theta].sub.1] = 0[degrees] and [[theta].sub.2] = 20[degrees] relative to the array broadside, respectively. The 0[degrees] signal is the expected signal and the 20[degrees] signal is assumed to be the interference. Three algorithms are compared: MVDR, diagonal loaded MVDR (LMVDR) and the proposed robust eigenspace-based adaptive beamforming (R-ES). For the LMVDR algorithm, the DL factor [alpha] is 10 (i.e. 10dB relative to the background noise). The array output SINRs are obtained by averaging 100 independent realizations.

4.1 Beam Directivity Comparison

The SNRs of the two signals are set to be 5dB and 10dB. The number of data snapshots is N=200, and [epsilon] = 0.6 for our proposed R-ES method. Figure 2 (a) shows the beampatterns of the three algorithms with no DOA mismatch, i.e., the array steering angle is 0[degrees], in accordance with the actual signal direction. It can be seen that the MVDR method has a deeper null nearby the interference, but its sidelobe level is relatively higher, and the maximum response axis (MRA) is a little deviated from the actual source position. The performance of the proposed R-ES method is similar to that of the LMVDR but has a deeper null at the interference position.

Figure 2 (b) displays the corresponding beampatterns when there are DOA mismatch, in this example, the array is steered to 1[degrees]. In this case, the MVDR beamformer forms a null at the direction of the expected signal, because it is treated as a interference due to undistortionless response constraint in the direction of 1[degrees]. This is the so called "signal self-cancelling" for the adaptive weight try to make the output power minimized, which would suppress the useful signal. The contrary is that all the three algorithms have a null in the interference direction, this is also caused by the power minimization criterion for the interference direction is far away from the steering direction. Thus, small errors of the interferers' steering vectors have little effect on the beamformer's performance. The MRA of the R-ES method is still well steered to 0[degrees], however, the LMVDR has a larger MRA deviation despite it has some robustness.

4.2 Spatial Spectra Comparison

In this example, the spatial spectra of the MVDR-like and MUSIC-like algorithms are compared, respectively. Figure 3 is the normalized spectra of the MVDR-like algorithms. It can be seen that, for small steering vector errors, such as [epsilon] = 0.06, the proposed R-ES method is reduced to the MVDR algorithm. But for larger [epsilon], for example, [epsilon] = 0.6, the R-ES has a wider spectral peaks near the signal DOA's, that is to say that the acceptance angle of the robust method is widened. Moreover, the output background noise level is much lower that that of the LMVDR's, and the resolution of LMVDR is dropped. We can adjust the parameter [??] by a tradeoff between the high-resolution capability and the robustness.

[FIGURE 2 OMITTED]

Figure 4 demonstrates the superior performance of the proposed robust method relative to MUSIC and SSMUSIC. The R-ES method has super-low sidelobes, and super-directivity for small . Similar to those in Figure 3, the width of the spectral peak is increasing as [epsilon] is increasing, which shows the robustness to the steering vector errors. Furthermore, The R-ES method not only has robustness, but also maintains high-resolution seeing the keen-edged peaks. SSMUSIC has a lower sidelobe than MUSIC, but its resolution is somewhat decreased. The MUSIC method has the highest sidelobe level.

Now we consider that the array is suffered from shape distortion, i.e. element position perturbations, which is common in towed sonar applications. The position perturbations of M elements is assumed to be independently, and identically distributed (i.i.d) random variables, and mutually uncorrelated each other. Then the coordinate of the ith element position at the nth snapshot can be written as

([x.sub.i](n), yi (n)) = ((i-1)d + [DELTA][x.sub.i] (n), [DELTA] [y.sub.i] (n)) (22)

where [DELTA] [x.sub.i](n), [DELTA] [y.sub.i](n) are random Gaussian processes with equal variance, and the standard deviation in this example is assumed to be 0.08m, which is one percentage of 12.5 wavelengths. Figure 5 (a) shows the DOA estimation root-mean-square-errors (RMSEs) versus input SNR for 0[degrees] source, the two sources have equal power, [epsilon] = 0.6 is for the R-ES method. The stochastic Cramer-Rao bound (CRB) [15] of the bearing estimation is also depicted, which is given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (23)

where D is the derivative matrix of A with respect to [theta], [[PI].sup.[perpendicular].sub.A] is the orthogonal projection matrix onto the complementary subspace of A:

[[PI].sup.[perpendicular to].sub.A] = I - A [([A.sup.H] A).sup.-1] [A.sup.H], (24)

and [??] denotes the Hardmard-Schur product, Re(*) the real part. It's clear to see the performance improvements of the R-ES algorithm under shape distortion condition.

[FIGURE 3 OMITTED]

[FIGURE 4 OMITTED]

For comparison, Figure 5 (b) shows the corresponding RMSEs of the 0[degrees] source versus SNR without array shape distortion, the performances of the R-ES method and MUSIC method are similar, which is a little better than that of the SSMUSIC algorithm in low SNR scenarios, such as when SNR is below -10dB, and when the SNR of the received signal is larger than -7.5dB, the estimation RMSE of R-ES method is dropped quickly, even below the CRB value. If the 5 (b), steering vector errors bounding parameter [epsilon] is fixed when SNR is changing, the RMSE would not drop any more, from Figure the curve is fluctuating around -35dB, and it will be larger than the CRB value again when the input SNR reaches a certain even larger threshold.

[FIGURE 5 OMITTED]

4.3 SINR Performance for DOA Mismatch Error Case Besides the beam directivity, another important measure of the beamformer performance is the SINR, which is given by

SINR = [[sigma].sub.5.sup.2][[absolute value of [w.sup.H][a.sub.d]].sup.2]/[w.sup.H][[??].sub.i+n]w (25)

where [[sigma].sub.s.sup.2] is the interested signal power, and [a.sub.s] is the corresponding steering vector. [[??].sub.i+n] is the sample covariance matrix of the interference-plus-noise.

Using the interested signal-free snapshots, we can get the "optimal" weight vector and the "optimal" SINR. The optimal weight vector [w.sup.opt] is given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (26)

Thus, using (26) in (25), we can derive the optimal output SINR as follows:

SIN [R.sub.opt] =[[sigma].sub.s.sup.2][a.sup.H.sub.s][[??].sup.1.sub.i+n] [a.sub.s] (27)

Figure 6 depicts the output SINRs versus SNR when there are no DOA mismatch and 2[degrees] DOA mismatch by 100 independent Monte-Carlo experiments, respectively. From Figure 6 (a), the SINR of R-ES is nearly identical to that of the LMVDR's with no DOA mismatch, and the SINR of MVDR is increasing with the input SNR. However, even small DOA mismatches can cause great performance degradation for conventional MVDR method as shown in Figure 6 (b), and in this case, the proposed R-ES method outperforms LMVDR for the improper chosen loading value, and the loading value is not varying with the SNR and the steering vector errors. The SINR of the proposed R-ES approaches the optimal.

[FIGURE 6 OMITTED]

Figure 7 shows the array SINR curves versus the number of snapshots with no DOA mismatch and 2[degrees] DOA mismatch, respectively. The parameter is 0.6. Without DOA mismatch, the asymptotic (large snapshots N) performances of R-ES and LMVDR are similar, and they are much better than that of MVDR's, as shown in Figure 7 (a). However, when there are 2[degrees] small DOA mismatch, approximately 2dB SINR improvement is achieved using R-ES method than LMVDR at the stable state in Figure 7 (b), and the MVDR method is asymptotically less inefficient, whose SINR is about 11dB less than that of R-ES method.

[FIGURE 7 OMITTED]

4.4 Performance vs. DOA Mismatch

In this example, we'll examine the algorithm performance as the DOA mismatch is changing. Figure 8 demonstrates the output SINR curves when the value of the DOA mismatch is varying from -8[degrees] to 8[degrees], the SINR of MVDR decreases quickly when the mismatch is increasing, LMVDR shows some better performance than MVDR, and a little performance degradation starts occurring when the DOA mismatch being larger than 4[degrees] for the optimal beamformer that using the signal-free snapshots. However, interestingly and wonderfully, our proposed method maintains the constant optimal SINR value among the total mismatched array steering angle area ranging from -8[degrees] to 8[degrees], the best robustness is obtained.

4.5 SINR Performance for Local Scattering Case

This example corresponds to the scenario where the received signal of interest is distorted by local scattering effects, e.g. active sonar targets reflected signals, multipath wireless propagating environment. The coherent local scattering signal steering vector can be written as in [9]:

[??] = a + 1/[square root of L] [L.summation over (k-1) [g.sub.k]b([[??].sub.k]) (28)

b([theta]) represents the steering vector of a plane wave arriving from [theta], L is the number of scattering paths, and [g.sub.k] is zero-mean, i.i.d. random variable with power [[sigma].sup.2.sub.g]. According to (28), the covariance matrix of the steering vector errors can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (29)

where p ([??]) is the probability density function (pdf) of [??], the frequently used pdf models are uniform and Gaussian distributions, which are given as follows, respectively:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (30)

[p.sub.g] ([??], [[sigma].sub.[theta]] = 1/[square root of 2[[phi][[sigma].sub.[theta]] exp (- [([??] - [theta]).sup.2]/2[[sigma].sub.[theta].sup.2] (31)

where the subscript "u" means the uniform distribution, and "g" means the Gaussian distribution. [theta] is the normal arriving angle or central angle, [sigma][theta] is the standard deviation of the scattering angular spread.

[FIGURE 8 OMITTED]

For small deviation [[sigma][theta], we have

sin ([theta] + [??]) [approximately equal to] sin [theta] + [??] cos [theta] (32)

Using (30)-(32), and by some arithmetic manipulations, the k,lth (1 [less than or equal to] k,l [less than or equal to] M) element of (29) can be derived as

[[[C.sub.2.sup.u]].sub.[kl]] = [[sigma].sup.2.sub.g] exp (j[PHI]sin [theta])sinc([PHI]cos[theta][[sigma].sub.[theta]]) (33)

[[[C.sub.2.sup.g]].sub.[kl]] = [[sigma].sup.2.sub.g] exp (j[PHI]sin [theta])exp(- [([PHI]cos[theta][[sigma].sub.[theta]]).sup.2] (34)

[PHI] = 2 [pi] f (k - l)d/c

sinc (x) = sin x/x.

(29) can also be written in matrix form:

[C.sup.u.sub.a] = (a([theta])[a.sup.H] ([theta])) [THETA][[??].sup.u.sub.2] (35)

[C.sup.g.sub.a] = (a([theta])[a.sup.H] ([theta])) [THETA][[??].sup.g.sub.2] (36)

with

[[[[??].sub.u.sup.a]].sub.kl] = [[sigma].sup.2.sub.g] sinc ([theta] cos [theta][[sigma].sub.[theta]])

[[[[??].sub.u.sup.a]].sub.kl] = [[sigma].sup.2.sub.g] exp [-[([theta] cos [theta][[sigma].sub.[theta]]).sup.2]/2]

Therefore, the scattered signal steering vector for small angular spread is given by

[??] = a + [C.sub.a.sup.1/2]u (37)

where u is the zero-mean, unit-variance circular complex Gaussian vector.

The corresponding SINR for local scattering scenarios is given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (38)

where [E.sub.a] denotes the expectation with respect to the pdf of vector a, and using (27), the averaging optimal SINR is given as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (39)

where Tr(*) denotes the matrix trace, p(a) is the pdf of a.

Experimental conditions: the interference signal from 20[degrees] is assumed to be a plane wave with interference-to-noise-ratio (INR)=20dB, but the signal of interest from 0[degrees] is a local scattered source with angular spread [sigma] [theta] = 2[degrees], and the array steering direction is 2[degrees], i.e., 2[degrees] DOA mismatch with the actual signal direction. Figure 9 shows the SINR curves of the optimal and adaptive beamforming evaluated by (38) and (39), and the SOI is uniform and Guassian angular spread, respectively. It's obvious to see the enhanced performance of the proposed R-ES approach, and the algorithm behaviors are similar under the two scattering scenarios.

Figure 10 displays the performance of the test methods versus the number of snapshots for the fixed sensor SNR=5dB, note that the SNR in this example is defined by taking into account only the direct arriving signal path, and the Gaussian angular spread source is considered here. Figure 11 compares the output SINR of the test methods versus the DOA mismatch, which is changing from -8[degrees] to 8[degrees], the R-ES method has the superior robustness against DOA mismatch and local scattering.

5. Lake Trial Results

In this section, the algorithm performances are compared using the towed sonar lake trial data. One narrowband source signal with 1kHz central frequency impinges on the line array, and 10 sensors are selected to perform adaptive beamforming. The snapshots are 1024, and the sampling frequency was 12kHz, and the parameter a is still chosen as 0.6, and the DL value of LMVDR is 10dB as before.

The spatial spectra of R-ES, LMVDR and MVDR algorithms are depicted in Figure 12, it is obvious that the R-ES method outperforms the other two, and the signal power is underestimated by MVDR. The R-ES method has the highest resolution and the effective signal power estimate. The LMVDR method has higher background noise level due to the imprecise DL value. Since there are array shape distortions, and sensor amplitude and phase errors in practice, our method is robust to a variety of steering vector errors from the lake trial result, and its performance is less sensitive to the robust parameter [epsilon].

[FIGURE 9 OMITTED]

[FIGURE 10 OMITTED]

[FIGURE 11 OMITTED]

[FIGURE 12 OMITTED]

Steered to 2[degrees], =2[degrees], INR=20dB, [epsilon] =0.6, Gaussian angular spread.

6. Conclusions

A novel eigenspace-based robust high-resolution array signal processing method is proposed based on the extended SSMUSIC subspace DOA estimation algorithm. This method effectively combines the spatial selectivity of adaptive beamforming with the super-resolution property of the subspace-based algorithm which has the inherent robustness. Theoretical analysis and numerical results have shown the performance improvements in beampattern, SINR, resolution and sensitivity to steering vector errors such as DOA mismatches, array shape distortions and local scattering. Furthermore, this method is computationally less complex and asymptotically efficient.

References

[1] Cox, H., Zeskind, R.M., Owen, M.H (1987). Robust adaptive beamforming. IEEE Trans. Acoust., Speech, Signal Processing, 35 (10) 1365-1376.

[2] Schmidt, R. O (1986). Multiple emitter location and signal parameter estimation. IEEE Trans. Antennas Propagat., 34 (3) 276-280.

[3] Er, M.H., Ng, B.C. (1994). A new approach to robust beamforming in the presence of steering vector errors. IEEE Trans. Signal Processing, 42 (7) 1826-1829.

[4] Gershman, A.B. (2003). Robust adaptive beamforming: an overview of recent trends and advances in the field. Proceedings of Int. Conf. on Antennas Theory and Tech, Sevastopal, Ukraine. 30-35.

[5] Trees, H.V. (2002). Optimum Array Processing. New York: Wiley. 505. and sensor amplitude and phase errors in practice, our method is robust to a variety of steering vector errors from the lake trial result, and its performance is less sensitive to the robust parameter .

[6] Li, J., Stoica, P., Wang, Z. (2003). On robust Capon beamforming and diagonal loading. IEEE Trans. Signal Process., 51(7), 1702-1715.

[7] Vorobyov, S., Gershman, A., Luo, Z (2003). Robust adaptive beamforming using worst-case performance optimization: a solution to the signal mismatch problem. IEEE Trans. Signal Process., 51 (2) 313-324.

[8] Lorenz, R., Boyd, S (2003). Robust minimum variance beamforming. Proceedings of 37th Asilomar Conf. 1345-1352.

[9] Besson, O., Vincent, F (2005). Performance analysis of beamformers using generalized loading of the covariance matrix in the presence of random steering vector errors. IEEE Trans. Signal Process., 53 (2) 452-459.

[10] Feldman, D. D., Griffiths, L. J (1994). A projection approach to robust adaptive beamforming. IEEE Trans. Signal Processing, 42 (4) 867-876.

[11] Stoica, P., Wang, Z.S. Li, J (2005). Extended derivations of MUSIC in the presence of steering vector errors. IEEE Trans. Signal Processing, 53 (3) 1209-1211.

[12] McCloud, M.L., Scharf, L.L. (2002). A new subspace identification algorithm for high-resolution DOA estimation. IEEE Trans. Antennas Propagat., 50 (10) 1382-1390.

[13] Mestre, X., Lagunas, M.A (2006). Finite sample size effect on minimum variance beamformers: Optimum diagonal loading factors for large arrays. IEEE Trans. Signal Process., 54 (1) 69-82.

[14] Morell, A., P.-Iserte, A., P.-Neira, A.I. (2005). Fuzzy inference based robust beamforming. Signal Processing, 85 (10) 2014-2049. [15] Stoica, P., Nehorai, A (1989). MUSIC, Maximum likelihood, and Cramer-Rao bound. IEEE Trans. Acoust., Speech, Signal Processing, 37 (5) 720-741.

* This work is partially supported by Chinese national defense project under contract 1010507010401.

Biao Jiang, Qianliu Cheng, Guomin Ling

Lab of Sonar Syetem Research

Hangzhou Applied Acoustics Research Institute

Hangzhou, 310012, China

jbiao78@yahoo.com.cn
COPYRIGHT 2007 Digital Information Research Foundation
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2007 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Author:Biao, Jiang; Qianliu, Cheng; Guomin, Ling
Publication:Journal of Digital Information Management
Article Type:Report
Geographic Code:9CHIN
Date:Jun 1, 2007
Words:5806
Previous Article:Stack-based pattern matching algorithm for XML query processing.
Next Article:Knowledge-based support for object-oriented software design and synthesis: a category theoretic approach.
Topics:

Terms of use | Copyright © 2017 Farlex, Inc. | Feedback | For webmasters