1. Introduction
Recent developments in remote sensing, wireless communications, radar, and sonar have heightened the need for wideband signals. Due to the reflection and refraction from the atmosphere and objects such as mountains and buildings, multipath propagation is very common in practice. Highly correlated or coherent wideband signals could be received by antenna array when the multipath delays are less than the correlation time of wideband signals. For direction-of-arrival (DOA) estimation [
1,
2,
3], previous studies about correlated wideband signals can be categorized into two types: sparse recovery (SR)-based algorithms and some subspace-based ones. The subspace-based methods contain the coherent signal subspace methods (CSM) [
4] and some improved incoherent signal subspace methods, such as the coherent test of orthogonality of projected subspaces (CTOPS) [
5]. CSM exploits the focusing operation to increase the rank of the covariance matrix associated with the reference frequency bin of correlated signals and CTOPS reconstructs the covariance matrix of correlated sources before the TOPS [
6] method.
SR-based approaches often formulate wideband signals as the block sparsity problem and perform well in low signal-to-noise ratio (SNR) and limited snapshots [
7,
8]. However, not all the SR-based methods can deal with correlated wideband signals. On the one hand, if the sparse model is established after vectorization of the covariance matrix (e.g., underdetermined DOA estimation algorithms [
9,
10]), only diagonal elements of the covariance matrix are utilized, thus the correlated sources cannot be handled. On the other hand, the grid-less based sparse methods [
11,
12] can be viewed as the parameter estimation in the continuous range based on well-established covariance fitting criteria [
13], but these criteria are not robust to the correlated sources.
The existing methods can only deal with correlated wideband signals in the frequency domain, the coexistence of both uncorrelated and correlated wideband signals in the multipath environment has not been considered, and there is still abundant room for further progress. Previous researches [
14,
15,
16,
17,
18] about the estimation of mixed sources under multipath conditions only consider the narrowband sources. Although the wideband sources are used in [
19], the information of sub-bands is not considered, and the wideband sources are processed in the same way as narrowband signals. In these studies, the delay in the envelope is ignored, which leads to two problems: (1) these methods cannot handle wideband sources appropriately owing to the nonignorable propagation delay in the envelope; (2) the existing models are limited to coherent signals because the multipath propagation delay is regarded as 0. Inspired by the data aligning concept used in uncorrelated noncircular wideband DOA estimation [
20,
21], a novel direction-finding approach for wideband sources is proposed in a multipath scenario to overcome the above drawbacks. To the best of our knowledge, this work is the pioneering one for the DOA estimation of the mixed wideband sources in multipath cases.
The contribution and novelty are reflected in the following aspects:
Considering the propagation delay, a novel signal model with the coexistence of uncorrelated and correlated wideband signals is established in the time domain. Not only the coherent signals but also the partially correlated signals can be addressed.
A wideband DOA estimation algorithm is proposed for the multipath environment, the uncorrelated and correlated components are estimated separately.
The strategy of linear search is used to improve the proposed method and the operation speed is accelerated. Furthermore, the off-grid signals can be estimated without the Taylor approximation to the signal model.
The Cramer–Rao bound (CRB) for DOA estimation of multipath wideband signals is derived in detail.
Throughout the paper, , and represent conjugation, transposition, and conjugation transposition, respectively. , , and mean the diagonal, the block diagonal, and the vectorization operators. denotes the matrix norm. is the zero matrix, is the identity matrix. ⊗ and ⊙ stand for the Kronecker product and Khatri–Rao product. means the expectation. and mean the real and the imaginary parts. and denote the real set and complex set.
2. Problem Formulation
Suppose that
K signals from
far field statistically independent wideband sources impinging on the uniform linear array (ULA) with
M sensors, where
and
. The first
ones are line of sight (LOS) uncorrelated signals without multipath components, the other
correlated signals can be divided into
groups with one LOS signal and
multipath signals in each group, i.e.,
. The baseband output of the
mth sensor is:
where
is the complex envelope of the
kth signal.
is the DOA of
kth source,
.
and
are the direction and the complex fading coefficient corresponding to
ith path of
kth source,
.
is the propagation delay of
kth source between
mth sensor and the reference array element.
and
are the propagation delay and multipath delay corresponding to the
ith path of
kth source.
is the zero-mean circular noise of
mth sensor. Assuming that the noise is uncorrelated with signals, the signals are stationary zero-mean processes. Denote
and
, where
is the array steering vector. Define the fading coefficient and multipath propagation delay matrices as
and
, respectively. The array observation vector can be formulated as:
where
,
, and
,
, with
. Through the discrete Fourier transform (DFT), we have
Based on the fact
, where
means the inverse DFT, the delay term can be compensated in frequency domain by a matrix
associated with the scan angle
as
is unknown, i.e.,
where
,
,
,
,
.
3. Proposed Algorithm
In this section, the proposed algorithm for both uncorrelated and correlated wideband signals are discussed in detail.
3.1. Estimation for Uncorrelated Wideband Signals
The uncorrelated wideband signals are firstly estimated. Consider
, which means the time delay is compensated with the DOA of uncorrelated signal. Using the complex envelope-aligned approach, one may have
where
is the time-delayed noise and
The covariance matrix associated with
can be formulated as:
and
where
and
are the ordered eigenvalues of
. The first
ones are the dominant eigenvalues and the others are the subordinate eigenvalues. Similarly,
are eigenvalues of
. Owing to the independence of sources,
can be regarded as the covariance matrix of these signals after compensating the time delay except signal from
. Thus, the first
ones are the dominant eigenvalues.
and
are the eigenvectors related to
and
, respectively. Define two augmented matrices as
and
, the rank of
is
. From the above derivation,
can be formulated as:
As the eigenvalue vector matrix of
is unitary,
and
when
, thus
where
, and
,
. Both
and
are full column rank matrices,
is full column rank. When
,
and
, yielding
According to the subspace theory,
for
, and
for
because the covariance matrix
is noise-free. Thus, the error
can be neglected. Clearly, the DOA of uncorrelated wideband signals can be found by searching the peak of the spectrum:
where
.
When the compensated delay is associated with the DOA of correlated signal,
,
,
, the envelope aligned vector can be expressed as:
yielding
Unlike the first condition, the first term in the envelope-aligned vector belongs to the
kth group of multipath signals; it is coherent with other multipath signals coming from the same wideband source. Consequently,
cannot be taken as the covariance matrix of original signals excluding signal from
. Actually,
may be written as
where
, and
.
Similar to the uncorrelated signals, let
, and
,
can be treated as the covariance matrix of original signals without the
th multipath signal. Similar to (20), one can get:
where
. Despite
can be ignored, (11) do not hold for correlated signals due to the presence of
, which means the peak searching of
can only obtain the DOA of uncorrelated wideband signals.
3.2. Estimation for Correlated Wideband Signals
In this subsection, the correlated components are extracted from the covariance matrix and the DOA can be acquired. To eliminate the uncorrelated components, the covariance matrices can be analyzed in a unified manner, i.e.,
where
The
th element in
and
are:
The autocorrelation function of the stationary signal is an even function that depends only on the time lag, thus the elements on each diagonal of are equal. From (39), , is a Hermitian Toeplitz matrix. Affected by the exponential term and the coefficient term, is not the Hermitian Toeplitz matrix. The noise covariance matrix is a Toeplitz matrix.
Define an exchange matrix
whose antidiagonal elements are ones and the other elements are zeros. For Hermitian Toeplitz matrix with real diagonals,
. Clearly, the uncorrelated and the noise components can be eliminated by
. To deal with the correlated components, the spatial smoothing preprocessing scheme may be applied. Select
L submatrices from
and the
lth submatrix can be defined as:
where
is the selection matrix. The submatrices selected along the diagonal of
are theoretically the same Hermitian Toeplitz matrix thus the spatial differencing matrix can be denoted to remove the uncorrelated entries, i.e.,
The eigenvalue decomposition (EVD) is:
where
are the ordered eigenvalues of
. The first
ones are the dominant eigenvalues, and the others are the subordinate eigenvalues.
and
,
can be formulated as:
where
.
Consider
, one can extract the covariance of envelope aligned term from
, i.e.,
Let
and
, yielding:
where
. When
,
. Because the noise has been removed,
for
and
. Consequently,
is neglected and the correlated wideband signals can form peaks in the spectrum, i.e.,
where
.
3.3. Efficient Implementation
Although the proposed approaches can acquire DOA of uncorrelated and correlated wideband signals, the computational complexity of operations (delay compensation, peak searching, etc.) corresponding to each scanning angle is prohibitive for the dense grid. Inspired by the linear search strategy, an efficient implementation is proposed.
For brevity,
,
,
, and
are denoted as
,
,
, and
, respectively. Define the quantities for iteration
i as:
where
,
,
,
. The initial approximations for directions can be found in (12) and (31) in the coarse grid. Then the accurate estimation result for each angle can be acquired using the following iteration:
The main cost of the proposed algorithm is the EVD, which requires computations for each scanning angle. Using (36) and (37), the number of grids is greatly reduced and the DOA results can be searched efficiently. In addition, the off-grid signals can also be estimated without the Taylor approximation to the signal model.
The detailed steps of the proposed algorithm are summarized in Algorithm 1.
Algorithm 1: Estimate the mixed uncorrelated and correlated wideband signals |
Step 1: Set the coarse grid . |
Step 2: For each scanning angle , calculate by (4). |
Step 3: Estimate the corresponding covariance matrix by , perform EVD on to get . |
Step 4: Estimate the corresponding differencing matrix by (25) and obtain . |
Step 5: Compute the approximate output by (12), find the largest peaks as the initial values for the accurate searching of uncorrelated wideband signals. |
Step 6: Compute the approximate output by (31), find the largest peaks as the initial values for the accurate searching of correlated wideband signals. |
Step 7: For each initial angle, repeat Step 2–Step 6. |
Step 8: Obtain the next generation by (36) and (37) until convergence. |
Step 9: Output the accurate results for mixed wideband signals. |
4. Simulation Results
In this section, the proposed algorithm is compared with existing methods for correlated wideband sources such as the CSM [
4], CTOPS [
5], and the state-of-the-art sparse Bayesian learning based on off-grid methods in [
7,
8]. For brevity, we denote the off-grid methods in [
7,
8] as OG1 and OG2, respectively.
First of all, three uncorrelated off-grid wideband signals from
and two groups of five off-grid wideband signals from
and
impinging on the ULA with 12 sensors. The fading coefficients of the two groups of correlated signals are
and
. The multipath propagation delays are set as
and
times the correlation time
. The element spacing
d equals the half wavelength at the center frequency. The carrier frequency is 2 GHz and the bandwidth is 400 MHz, which is
of the center frequency. The sampling frequency is twice the highest frequency. The number of snapshots and SNR are 5000 and 10 dB. The number of submatrices
L is 5. The step sizes for the subspace-based methods, the SR-based methods, and the proposed algorithm are set as
,
and
, respectively. Results in
Figure 1 depict that the proposed algorithm can distinguish all the uncorrelated and correlated wideband signals extremely well.
Figure 1 shows that CSM and CTOPS may miss part of the signals, the resolution performance of OG2 is not good enough, and OG1 forms some false peaks between the two close targets. Moreover, none of these algorithms can distinguish between uncorrelated and correlated signals.
Next, the root-mean-square error (RMSE) of the above algorithms is compared. The RMSE can be defined as
, where the Monte Carlo trial number
T is 100. Two uncorrelated wideband signals from
and a group of three wideband signals from
impinging on the ULA. The fading coefficients and the multipath propagation delays of the wideband correlated signals are
and
.
, other parameters remain unchanged. Let the SNR increases from
to 10 dB gradually and the number of snapshots is 5000; the results are shown in
Figure 2a. Then snapshot number ranges from 1000 to 5000 and the SNR is 0 dB; results are displayed in
Figure 2b. The CRB of the first
uncorrelated LOS wideband signals can be found in [
22]. For
correlated multipath wideband signals, the CRB is deduced in detail (see
Appendix A). It can be seen that the uncorrelated and correlated signals can be processed separately in the proposed algorithm. For correlated signals, it is not so close to CRB because the smoothing and spatial differencing sacrifices the array aperture and the power. However, the accuracy of the proposed algorithm is higher than that of other approaches in the multipath environment.
In the third case, the resolution probabilities of the above algorithms are compared to illustrate the performance further. Two correlated wideband signals and a group of two correlated wideband signals come from
and
, respectively. The step size is set as
for the proposed method and the signals are resolved if the biases are smaller than
. Let the SNR increases from
to 10 dB gradually and the number of snapshots is 5000; results are shown in
Figure 3a. Then snapshot number ranges from 1000 to 10,000 and the SNR is 0 dB; results are shown in
Figure 3b. The resolution capability of the proposed algorithm is the best, and the resolution performance of the correlated components is inferior to that of the uncorrelated components. Although the off-grid algorithm can resolve two close directions in high SNR, many false peaks are formed between the targets.
In the fourth case, we compare the computational cost of these algorithms.
Figure 4a depicts the CPU time of the simulations in
Figure 2b. Then the SNR and the snapshots number are set as 0 dB and 1000, respectively. Other parameters remain unchanged,
Figure 4b shows the results when the number of sensors changes from 10 to 50. For other subspace-based methods, only one EVD is needed regardless of the number of scanning angles. However, for the proposed algorithm, EVD is required for each scanning angle because the delay in the envelope is compensated corresponding to the scanning angle. Consequently, the proposed algorithm before efficient implementation has the lowest performance compared with other algorithms. It is observed that the CPU time of the proposed algorithm has been shortened by more than three hundred times by the efficient implementation, because the number of scanning angles in efficient implementation is much less than that of the proposed algorithm without improvement. As the snapshots number increases, the operation time is longer than that of CSM due to the operations (delay compensation, EVD, peak searching, etc.) corresponding to each scanning angle but is much shorter than that of the other algorithms.