Skip to main content

Correntropy-based DOA estimation algorithm under impulsive noise environments


In this paper, the direction of arrival (DOA) estimation of signals in the presence of impulsive noise environment is studied. Complex isotropic symmetric alpha-stable (SαS) random variables are modeled as impulsive noise, then a novel second-order statistic method that correntropy-based covariance matrix (CBCM) is defined, based on the combination of the CBCM of the array sensor outputs with the signal subspace technique (e.g., multiple signal classification (MUSIC)), which can be achieved source localization under impulsive noise environments. The Monte-Carlo simulation results illustrate the improved performance of CBCM-MUSIC for DOA estimation under a wide range of impulsive noise conditions.

1 Introduction

Array signal processing is an important branch in modern signal processing. It is widely used in the field of radar [1], sonar [2], 5G communication [3,4,5,6], and smart antenna [7]. DOA estimation algorithms under additive white noise have been extensively studied in the past several decades. However, literature [8,9,10,11] studies show that atmospheric environments, sea clutter, ground clutter, radar backscatter echoes, and urban mobile radio channels, sudden bursts, or sharp spikes are exhibited at the array outputs which can be characterized as impulsive; an impulsive environment can be well modeled by alpha-stable distribution [12], compared with the mixture Gaussian distribution, and the alpha-stable distribution has “thick tail” statistical characteristics of impulse noise, which makes it have strongly impulse characteristics in the time domain. Second-order statistics are not finite [12] under alpha-stable distribution. In order to suppress these impulsive outliers, researchers have proposed a series of DOA estimation methods based on fractional lower-order statistics (FLOS).

In [13], the authors proposed new subspace methods based on fractional lower-order moment (FLOM) covariance estimates, and the robust covariation-based MUSIC (ROC-MUSIC) used covariations under the assumption that the signals and the additive noise are jointly SαS, which does not hold always because signals of interest are generally of finite variances, and the ROC-MUSIC is defined only for 1 < α < 2.

In [14], the authors proposed a new class of covariance matrices named FLOM matrices for impulsive noise. The FLOM outperforms the ROC-MUSIC from the fact that it handles all types of signals. However, it is limited in the range of α (α > 1) for robust covariation.

In [15], the authors introduce a new subspace algorithm based on the phased fractional lower-order moment (PFLOM), and the new subspace algorithm based on the PFLOM covariance estimation shows a higher resolution capability and lower estimation error.

In [16], the authors proposed a new operator referred to as the correntropy-based correlation (CRCO), and it can be applied with MUSIC algorithm; despite the CRCO-MUSIC shows robustness in highly impulsive noise environments or in low generalized signal to noise ratio (GSNR) situation, the formulation for the robust CRCO statistics needs quite a number of snapshots.

Professor Principe’s team first proposed the correntropy in [17]. The correntropy is a new statistic that can quantify the time structure as well as the statistical distribution of two stochastic random processes. The correntropy function conveys information about the quadratic Renyi’s entropy of the generating source. At the same time, correntropy can well suppress impulse noise and does not depend on the prior knowledge of alpha-stable noise. Therefore, it has been widely used in signal detection [18], time delay estimation [19], adaptive filtering [17], and image processing [20].

In this paper, we focused on the issue of DOA estimation algorithm in extremely high impulsive noise environments along with low generalized signal to noise ratio (GSNR) levels and fewer snapshots and introduced a new operator based on correntropy, namely, correntropy-based covariance matrices (CBCM), which can be combined with subspace algorithm, such as MUSIC algorithm, that is CBCM-MUSIC algorithm. The CBCM-MUSIC algorithm exhibits an evident performance in low GSNR or in strong impulsive environments.

Our major contributions are listed as follows:

  1. (1)

    Consider the problem of DOA estimation in impulsive noise and proposes a new method to rebuild the covariance matrix based on correntropy.

  2. (2)

    Several experiments have been made for the selection of kernel size and suppression parameter.

  3. (3)

    The performances of different algorithms are compared, and the effectiveness of the proposed method is verified.

The paper is organized as follows: in Section 2, we define the problem of interest and briefly review some preliminaries on α-stable distributions. In Section 3, we provide the CBCM-MUSIC algorithm. Finally, some simulation examples are presented in Section 4, and the conclusion is given in Section 5.

Notation: Lowercase (capital) bold symbols denote vector (matrix). (·)T, (·)*, and (·)H denote transpose, complex conjugation, and conjugate transposition, respectively; E{·} denotes expectation operator; and |·| stands for an absolute value of a random quantity.

2 Problem definition

Here, the array signal model has given in Section 2.1, and then the impulsive noise model (alpha-stable noise) is presented in Section 2.2.

2.1 Data model

Consider a uniform linear array (ULA) with M sensors and P narrowband far-field signal source impinging on the ULA from angular direction θp, which space half of the wavelength. The sensor received signal kth sample can be modeled as

$$ X(k)=\sum \limits_{p=1}^P{AS}_k\left({\theta}_p\right)+N(k) $$

where X(k) is the array received observation vector

$$ X(k)={\left[{X}_1(k),{X}_2(k),\cdots, {X}_M(k)\right]}^T\in {C}^{M\times N} $$

Am is an ideal steering matrix when setting the first sensor as the reference

$$ A={\left[1,{e}^{- j\pi \sin \left({\theta}_p\right)},\cdots, {e}^{-j\left(M-1\right)\pi \sin \left({\theta}_p\right)}\right]}^T\in {C}^{M\times P} $$

Sk(θ) is the signal vector

$$ {S}_k\left(\theta \right)={\left[{S}_k\left({\theta}_1\right),{S}_k\left({\theta}_2\right),\cdots, {S}_k\left({\theta}_P\right)\right]}^T $$

N(k) is alpha-stable noise

$$ N(K)={\left[{N}_1(k),{N}_2(k),\cdots, {N}_M(k)\right]}^T $$

Our objective is to estimate the DOA (θ1, θ2, …, θp) of the source from X(k), the second-order statistical is the most commonly used method, that is

$$ R=E\left[{XX}^H\right] $$

In practice, the covariance matrix R can be estimated with a finite number of snapshots via

$$ \overset{\wedge }{R}=\frac{1}{N}\sum \limits_{k=1}^NX(k){X}^H(k)\in {C}^{M\times M} $$

By performing eigenvalue decomposition (EVD) on R^, we can obtain

$$ \overset{\wedge }{R}=U\Lambda {U}^H={U}_S{\Lambda}_S{U}_S^H+{U}_n{\Lambda}_n{U}_n^H $$

where U = [Us, Un], Us, and Un are the noise and signal subspace matrices and Λs and Λn are the corresponding eigenvalue matrices. According to the orthogonality between noise and signal subspaces [21], UsUn, spatial power spectrum can be obtained from

$$ {P}_{MUSIC}=\frac{1}{a^H\left(\theta \right){U}_n{U^H}_na\left(\theta \right)}\kern0.5em -{90}^{{}^{\circ}}\le \theta \le {90}^{{}^{\circ}} $$

2.2 Alpha-stable noise (SαS)

Recent studies show that alpha-stable distribution is well suited for describing impulsive noise [12], which is defined by a characteristic function

$$ \phi (t)=\exp \left( j\xi t-\gamma {\left|t\right|}^{\alpha}\left[1+ j\beta sign(t)\omega \Big(t,\alpha \Big)\right]\right) $$


$$ \omega \left(t,\alpha \right)=\left\{\begin{array}{c}\tan \left(\frac{\alpha \pi}{2}\right),\kern0.5em \alpha \ne 1\\ {}\frac{\pi }{2}\log \left|t\right|,\begin{array}{cc}& \alpha =1\end{array}\end{array}\right. $$
$$ signt(t)=\left\{\begin{array}{c}1,\kern0.5em t>0\\ {}0,\begin{array}{cc}& t=0\end{array}\\ {}-1,\begin{array}{cc}& t<0\end{array}\end{array}\right. $$

As can be seen from the above Eqs. (10, 11 and 12), alpha-stable distribution is determined by α, β, γ, and μ, and its characteristics are as follows.

  1. (1)

    α is the characteristic exponent which is characterized the strength of the impulsiveness, the smaller α, the heavier the tails of the alpha-stable probability density function, 0 < α ≤ 2;

  2. (2)

    β is the symmetry parameter which is characterized by the level of out-of-center for alpha-stable probability density function. Alpha-stable distribution is called symmetric alpha stable (SαS) when β = 0, − 1 ≤ β ≤ 1;

  3. (3)

    γ is the dispersion parameter which is characterized by the degree of out-of-mean for the random variable, γ > 0;

  4. (4)

    ξ is the location parameter which is determined by the central position of alpha-stable distribution. ξ denotes the mean of the random variable when the α satisfies with 1 < α ≤ 2; ξ denotes the median of the random variable when the characteristic exponent satisfies 0 < α < 1, − ∞ < ξ < + ∞.

Figure 1 presents the symmetric α-stable probability density functions, and Figs. 2 and 3 are the SαS distributed signal in the time domain. There are some especial distributions as follows: Gaussian (α = 2, β = 0, γ = 1, ξ = 0), Cauchy (α = 1, β = 0, γ = 1, ξ = 0), Levy (α = 0.5, β = − 1, γ = 1, ξ = 0). The Matlab code was used to generate a complex isotropic symmetric alpha-stable distribution reference as ROC-MUSIC [13].

Fig. 1
figure 1

Symmetric α-stable probability density functions with different α (β = 0, γ = 1, ξ = 0)

Fig. 2
figure 2

SαS distributed signal with α = 1.5

Fig. 3
figure 3

SαS distributed signal with α = 2

3 Proposed solution

In this section, we proposed a new operator correntropy-based covariance matrix (CBCM), and it applied with MUSIC to estimating DOA in the presence of an impulsive noise environment. We present the definition of correntropy in Section 3.1 and correntropy-induced metric (CIM) in Section 3.2. Correntropy-based covariance matrix was proposed in Section 3.3, and then the implementation of CBCM-MUSIC algorithm is given.

3.1 Correntropy

For two arbitrary random variables X and Y, the cross correntropy defined by [17]:

$$ {V}_{\sigma}\left(X,Y\right)=E\left[{\kappa}_{\sigma}\left(X-Y\right)\right] $$

where κσ(•) is the kernel function that satisfies Mercer’s theory, σ is the kernel size, and E[•] represents the mathematical expectation. In practice, the joint probability density function (pdf) is unknown, and only a finite number of data {[xi, yi]Ni = 1} can obtain to estimate the correntropy for random variables X and Y,

$$ {\overset{\wedge }{V}}_{\sigma}\left(X,Y\right)=\frac{1}{N}\sum \limits_{i=1}^N{\kappa}_{\sigma}\left({x}_i-{y}_i\right) $$

In general, we use the Gaussian kernel kσ(•), using Taylor series expansion for Eq. (14), and the correntropy can be rewritten as [17]

$$ {k}_{\sigma}\left(\cdot \right)=\frac{1}{\sqrt{2\pi}\sigma}\exp \left(-\frac{{\left(\cdot \right)}^2}{2{\sigma}^2}\right) $$
$$ {V}_{\sigma}\left(X,Y\right)=\frac{1}{\sqrt{2\pi \sigma}}\sum \limits_{n=0}^{\infty}\frac{{\left(-1\right)}^n}{2^nn!}E\left[\frac{{\left(X-Y\right)}^{2n}}{\sigma^{2n}}\right] $$

Equation (16) indicates that correntropy involves all the even-order moments of the (X-Y); note that if n = 1, we can get

$$ E\left[{\left(X-Y\right)}^2\right]=E\left[{X}^2\right]+E\left[{Y}^2\right]-2E\left[ XY\right] $$

Equation (17) reveals that correntropy includes the conventional relation.

3.2 Correntropy-induced metric

Correntropy can also induce a metric (CIM) [18]. There are two vector a = (a1, a2,···,aN)T and b = (b1,b2,···,bN)T, and the function CIM defines as

$$ CIM\left(a,b\right)={\left({\kappa}_{\sigma }(0)-V\left(a,b\right)\right)}^{0.5} $$

Apparently, when the Gaussian kernel is used,

$$ {\kappa}_{\sigma }(0)=\frac{1}{\sqrt{2\pi}\sigma } $$

The properties of CIM can be listed as follows:

  1. (1)


CIM(a,b) ≥ 0, CIM(a,b) = 0 if and only if a = b;

  1. (2)


CIM(a,b) = CIM(b,a);

  1. (3)

    Triangle inequality:

CIM(a,c) ≤ CIM(a,b) + CIM(b,c).

Figure 4 shows the contours of distance from X to the origin in a 2D space, and Fig. 5 displays the surface. Compared with the conventional metric, CIM presents “mix norm” property. From Fig. 4, we can see that three zones have been divided. This metric divides space into three regions named the Euclidean region, transition region, and rectification region [18]. In the Euclidean region, CIM behaves as l2-norm, in the transition region, CIM behaves as l1-norm, and in rectification region, CIM behaves like l0-norm. The kernel size σ controls the bandwidth of the CIM “mix norm.”

Fig. 4
figure 4

The contours of CIM σ = 2

Fig. 5
figure 5

CIM surface plot showing to distant regions σ = 0.4

3.3 Correntropy-based covariance matrix

Theorem 1 If X and Y are jointly SαS and have a symmetric distribution, the correntropy-based covariance matrix by using the Gaussian kernel of X and Y can be defined as

$$ {R}_{CBCM}\overset{\Delta}{=}E\left[\exp \left(-\frac{{\left(X-\mu Y\right)}^2+{\left(Y-\mu X\right)}^2}{2{\sigma}^2}\right) XY\right]\kern0.5em 0<\mu <1 $$

where μ is the suppression parameter and σ is the kernel size.

The proof of the boundedness of CBCM reference as Appendix B [16], here, inspired by the phase fractional lower-order moment; the suppression parameter μ is introduced to exert different suppressed effects on random variables X and Y. Equation (21) can be expressed as

$$ {R}_{CBCM}\overset{\Delta}{=}E\left[\exp \left(-\frac{{\left(X-\mu Y\right)}^2}{2{\sigma}^2}\right)X\exp \left(-\frac{{\left(Y-\mu X\right)}^2}{2{\sigma}^2}\right)Y\right]\kern2em 0<\mu <1 $$

3.4 The implementation of CBCM-MUSIC

Summarizing the existing algorithms, knowing that the key to implementing DOA is to modify the conventional covariance matrix to suit for impulsive noise environment, then the DOA estimation can be implemented in combination with the subspace technology. Inspired by correntropy and Gaussian kernel function to suppress impulse noise, and the prior parameters of noise do not need to know, this paper proposed a modified covariance matrix (CBCM) based on correntropy with Gaussian kernel function.

CBCM cannot only preserve the similarity measure in the sense for two random variables, but also it can suppress the “outliers” by using the rapid reduction of the exponential function; thus, CBCM achieves the purpose of adapting to the environment.

The main steps of the CBCM-MUSIC are summarized as follows:

  • Step 1. Compute the M × M matrix R^, whose (i,j)th entry is

$$ {\mathrm{R}}_{\mathrm{i},\mathrm{j}}=\frac{1}{\mathrm{N}}\sum \limits_{\mathrm{n}=1}^{\mathrm{N}}\left[\exp \left(\hbox{-} \frac{{\left({\mathrm{x}}_{\mathrm{i}}\left(\mathrm{n}\right)\hbox{-} {\upmu \mathrm{x}}_{\mathrm{j}}\left(\mathrm{n}\right)\right)}^2+{\left({\mathrm{x}}_{\mathrm{j}}\left(\mathrm{n}\right)\hbox{-} {\upmu \mathrm{x}}_{\mathrm{i}}\left(\mathrm{n}\right)\right)}^2}{2{\upsigma}^2}\right){\mathrm{x}}_{\mathrm{i}}\left(\mathrm{n}\right){\mathrm{x}}_{\mathrm{j}}^{\ast}\left(\mathrm{n}\right)\right]\kern2em 0<\upmu <1 $$

Section 4.1 gives the discussion for the selection of the suppression parameter μ and kernel size σ.

  • Step 2. Perform eigenvalue decomposition (EVD) on the covariance matrix R^ to obtain the noise subspace matrix Uˆn

  • Step 3. Compute the corresponding CBCM-MUSIC spatial spectrum via

$$ {P}_{CMCB- MUSIC}=\frac{1}{a^H\left(\theta \right){U}_N{U^H}_Na\left(\theta \right)}\kern2em -{90}^{{}^{\circ}}\le \theta \le {90}^{{}^{\circ}} $$
  • Step 4. Choose P local peaks of PCMCB-MUSIC as the estimates of DOAs.

4 Simulation and results

To assess the performance of the CBCM-MUSIC, two performance criteria are used to evaluate the proposed algorithms: the probability of resolution and RMSE (root-mean-square-error). The two sources are recognized to be successfully resolved if and only if [6]

$$ \frac{f\left({\theta}_1\right)+f\left({\theta}_2\right)}{2}>f\left(\frac{\theta_1+{\theta}_2}{2}\right) $$

where ƒ(·) stands for the spectral value. Root-mean-square-error (RMSE) can be expressed as

$$ RMSE=\sqrt{\frac{1}{400}\sum \limits_{i=1}^{200}\sum \limits_{p=1}^2{\left(\overset{\wedge }{\theta_{i,p}}-{\theta}_p\right)}^2} $$

where θp is the actual angle of the pth signal, and θˆi,p is the estimated angle of θp in the ith Monte-Carlo trial, where i = 1, 2, · · · , 200. All the numerical results were obtained with 200 independent trials.

In the following experiments, this paper considers two sources (Gaussian, QPSK, BPSK, QAM, PAM) that have the same variance imping on a uniform linear array (ULA), an M = 8 elements ULA with an interelement spacing equal to half a wavelength, supposing that the source number is known. A generalized signal-to-noise (GSNR) ratio was used to describe signal-to-noise ratio [13], that is

$$ GSNR=10\lg \left(\frac{\sigma_S^2}{\gamma}\right) $$
$$ {\overset{\wedge }{\sigma}}_S^2=\frac{1}{N}\sum \limits_{n=1}^N{\left|{\overset{\wedge }{\sigma}}_s^2(n)\right|}^2 $$

where N indicates the snapshots, γ indicates the dispersion parameter, and σ2s indicates the signal power.

Section 4.1 gives the recommendations for the selection of parameters; Section 4.2 compares the DOA spatial spectrum for ROC-MUSIC, FLOM-MUSIC, PFLOM-MUSIC, CRCO-MUSIC, and CBCM-MUSIC; finally, the performance of analysis for CBCM-MUSIC presents in Section 4.3.

4.1 Parameter selection

In this section, we have discussed the selection of the parameters of the CBCM-MUSIC algorithm, including the kernel size σ and suppression parameter μ. According to the correntropy, the kernel bandwidth σ is full and controls the scale of the CIM norm, that is, a small kernel size will lead to a tight linear region (L2 norm) and to a large L0 region. The selection of the kernel size is described as conventional signals that fall into L2 norms and impulse signals that fall into L1 and L2 norms.

In order to make kernel size σ and suppression parameter μ widely applicable, different types of communication signals were used to DOA’s sources embedded in complex isotropic SαS noise, such as quaternary amplitude modulation (QAM), binary phase-shift keying (BPSK), quaternary phase-shift keying (QPSK), and Gaussian source, note that BPSK is noncircular signals.

4.2 Suppression parameter μ

Suppression parameter μ is limited in the range of [0, 1], and the covariance matrix degenerates into a traditional covariance matrix when μ = 1. Snapshots N = 256, a moderate impulsive noise condition with α = 1.4, GSNR = 8 dB, ULA with 8 sensors, we select the kernel size σ = 8 tentatively.

Figure 6 illustrates the influence of the suppression parameter, we can see that μ[0.5, 0.9] would be the optimal fields for CBCM-MUSIC, and the suppression parameter μ is relatively small over a wide range of μ[0.4, 0.9] to Monte-Carlo runs in terms of RMSE of CBCM-MUSIC. According to Figs. 6 and 7, the desired results are achieved at μ = 0.7; hence, in the following experiment, we perform Monte-Carlo runs with μ = 0.7.

Fig. 6
figure 6

Probability of resolution against suppression parameter μ

Fig. 7
figure 7

RMSE against suppression parameter μ

4.2.1 Kernel size σ

Snapshots N = 256, μ = 0.7, and GSNR = 8 dB. α = 1.4, ULA with 8 sensors. From Figs. 8 and 9, it can be seen that the CBCM-MUSIC algorithm obtains better DOA estimation performance in the range of σ [6, 20], but the optimal value of the kernel size cannot be determined.

Fig. 8
figure 8

Probability of resolution against kernel size σ

Fig. 9
figure 9

RMSE against kernel size σ

Since the selection of σ is closely related to GSNR [16], the rectification region is affected by the kernel size. Below, the RMSE and probability of resolution are analyzed at different GSNR σ [2, 20], μ = 0.7, and α = 1.4. From Figs. 10 and 11, we can observe that kernel size σ = 10 would be the optimal value for CBCM-MUSIC to reach its best performance. In particular, the probability of resolution in low SNR and high impulsive environments is shown in Fig. 10. Based on the above description and discussion, the simulations in Section 4.2 and Section 4.3 are implemented by setting μ = 0.7 and σ = 10.

Fig. 10
figure 10

Probability of resolution against kernel size σ under different GSNR

Fig. 11
figure 11

RMSE against kernel size σ under different GSNR

4.3 Spatial spectrum estimation

In order to directly show the performance of the proposed CBCM-MUSIC algorithm, we also compare spatial spectrum with that of the ROC-MUSIC (p = 1.1) [13], FLOM-MUSIC (p = 1.1) [14], PFLOM-MUSIC (p = 0.2) [15], and CRCO-MUSIC (μ = 0.5, σ = 1.4sqrt(σs^2)) [16], where σs^2 is the estimated variance of the noise-free signal S and p is the order of the moment. Consider a uniform linear array of 8 sensors with an interspacing of half a wave is used, two uncorrelated Gaussian sources (θ1 = − 5°, θ2 = 5°) impinge on this array, GSNR = 8 dB, snapshots N = 256, and α = 1.4.

The results of 10 runs of the normalized spatial spectrum are displayed in Fig. 12. Comparing the results of the above five algorithms, we can observe that CBCM-MUSIC algorithm shows better focus ability for true DOA under impulsive noise environments, the performance of MUSIC is degraded seriously and 10 runs fail to distinguish two incident signals successfully. Seeing the performance degradation of the MUSIC, ROC-MUSIC, FLOM-MUSIC, and PFLOM-MUSIC algorithms in the impulsive noise environment by no means, further analyses are made in the following experiments.

Fig. 12
figure 12

The normalized spatial spectrum of the algorithms (black lines: true DOAs)

4.4 Performance analysis

In this section, the performance of the proposed CBCM-MUSIC algorithm is compared with CRCO-MUSIC (μ = 0.5, σ = 1.4sqrt(σs^2)) [16] and SCM-MUSIC [22]. In terms of resolution probability and RMSE, the performance of the number of snapshots, GSNR, characteristic exponent α, and angular separation is investigated in this experiment.

4.4.1 Effect of the number of snapshots

In the first experiment, we study the effect of the number of snapshots and the results are exhibited in Figs. 13 and 14. An M = 8 element ULA with an interspacing of half a wave is used, two independent QAM sources are located at θ1 = − 5° and θ2 = 5°, the complex isotropic SαS is α = 1.4, and the GSNR is set as a constant at 8 dB. From Fig. 13, we can observe that CBCM–MUSIC gains a more evident decrease in RMSE than the other algorithms as the number of the snapshots increases. Figure 14 displays the probability of resolution against snapshots.

Fig. 13
figure 13

RMSE against snapshots

Fig. 14
figure 14

Probability of resolution against snapshots

4.4.2 Effect of the GSNR

Figures 15 and 16 illustrate the performance of CBCM-MUSIC, CRCO-MUSIC [16], and SCM-MUSIC [22] under a wide range of GSNRs from 0 to 10 dB, and the number of snapshots available to the algorithms is N = 256. A moderate impulsive noise α = 1.4 embedded in two QAM sources (θ1 = − 5°, θ2 = 5°). Figures 15 and 16 depict the improved performance of CBCM-MUSIC over that conventional algorithm both in terms of resolution probability and RMSE.

Fig. 15
figure 15

RMSE against GSNR

Fig. 16
figure 16

Probability of resolution against GSNR

4.4.3 Effect of the characteristic exponent α

In this experiment, we study the robustness of the CBCM-MUSIC algorithm under a wide range of characteristic exponent α from 0.6 to 2. Consider two QAM sources (θ1 = − 5°, θ2 = 5°) impinge on the ULA with 8 sensors, the GSNR = 8 dB and the number of snapshots N = 256. Fig. 17 and Fig. 18 give the simulation results. We note that CBCM-MUSIC showed better performance than SCM-MUSIC and CRCO-MUSIC as the characteristic exponent α is decreased.

Fig. 17
figure 17

RMSE against characteristic exponent α

Fig. 18
figure 18

Probability of resolution against characteristic exponent α

4.4.4 Effect of the angular separation

In the final experiment, we study the variation of the algorithmic performance with respect to the angular separation of the two incoming QAM signals, for N = 256, GSNR = 10 dB, and α = 1.4. As expected, by contrast with the performance of the SCM-MUSIC and CRCO-MUSIC, the resolution capability of CBCM-MUSIC algorithms is improved with increasing angle-separated value between the two sources based on Figs. 19 and 20.

Fig. 19
figure 19

RMSE against the angular separation

Fig. 20
figure 20

Probability of resolution against the angular separation

5 Discussion

In this paper, we proposed a novel method that formulated the covariation matrix of the sensor outputs under the impulsive noises, which is based on correntropy. The improved performance of the proposed CBCM-MUSIC algorithm in the presence of a wide range of impulsive noise environments was demonstrated via Monte-Carlo experiments.

This paper assumed sources are independent that illuminated the array sensor. In many practical conditions, the sources are coherent signals due to multipath; hence, future research includes the development of methods for the DOA of the coherent signals in the presence of impulsive noise. Secondly, we will address the problem of localizing multiple wide-band sources in impulsive noise

Availability of data and materials

Not applicable.



Binary phase-shift keying


Correntropy-based covariance matrix


Correntropy-induced metric


Correntropy-based correlation


Direction of arrival


Eigenvalue decomposition


Fractional lower-order moments


Fractional lower-order statistic


Generalization signal to noise ratio


Multiple signal classification


Probability density function




Quaternary amplitude modulation


Quaternary phase-shift keying


Robust covariance-MUSIC

SαS :

Symmetric alpha stable


Uniform linear array


  1. A. Hassanien, S.A. Vorobyov, Phased-MIMO radar: A tradeoff between phased-array and MIMO radars. IEEE Trans Signal Processing 58(6), 3137–3151 (2010)

    Article  MathSciNet  Google Scholar 

  2. J.J. Jiang, F.J. Duan, X.Q. Wang, A universal two-dimensional direction of arrival estimation method without parameter match. IEEE Sensors J. 16(9), 3141–3146 (2016)

    Article  Google Scholar 

  3. S.T. Yuan, Q.L. Liang, 3D nested distributed massive MIMO: Modeling and performance analysis. Ad Hoc Netw. 58, 6–12 (2016)

    Article  Google Scholar 

  4. H. Yin, D. Gesbert, M. Filippou, Y. Liu, A coordinated approach to channel estimation in large-scale multiple-antenna systems. IEEE J Selected Areas Commun 31(2), 264–273 (2013)

    Article  Google Scholar 

  5. A.F. Molisch et al., Hybrid beamforming for massive MIMO: A survey. IEEE Commun. Mag. 55(9), 134–141 (2017)

    Article  Google Scholar 

  6. N. Wu, F.Q. Zhu, Q.L. Liang, Evaluating spatial resolution and channel capacity of sparse cylindrical arrays for massive MIMO. IEEE Access 5, 23994–24003 (2017)

    Article  Google Scholar 

  7. M. Carlin, P. Rocca, G. Oliveri, F. Viani, A. Massa, Directions-of-arrival estimation through Bayesian compressive sensing strategies. IEEE Trans Antennas Propagation 61(7), 3828–3838 (2013)

    Article  MathSciNet  Google Scholar 

  8. M.D. Button, J.G. Gardiner, I.A. Glover, Measurement of the impulsive noise environment for satellite-mobile radio systems at 1.5 GHz. IEEE Trans Vehicular Technol 51(3), 551–560 (2002)

    Article  Google Scholar 

  9. K.L. Blackard, T.S. Rappaport, C.W. Bostian, Measurements and models of radio frequency impulsive noise for indoor wireless communications. IEEE J Selected Areas Commun 11(7), 991–1001 (1993)

    Article  Google Scholar 

  10. A. Chandraa, Measurements of radio impulsive noise from various sources in an indoor environment at 900 MHz and 1800 MHz, 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Lisboa, Portugal, 639-643 (2002).

  11. B. Stuck, B.A. Kleiner, Statistical analysis of telephone noise. Bell System Tech J 53(7), 1263–1320 (1974)

    Article  Google Scholar 

  12. C.L. Nikias, M. Shao, Signal Processing with α-Stable Distribution and Applications (Wiley, New York, 1995)

    Google Scholar 

  13. P. Tsakalides, C.L. Nikias, Robust covariation-based MUSIC (ROC-MUSIC) algorithm for bearing estimation in impulsive noise environments. IEEE Trans. Signal Process. 44(7), 1623–1633 (1996)

    Article  Google Scholar 

  14. T.H. Liu, J.M. Mendel, A subspace-based direction finding algorithm using fractional lower order statistics. IEEE Trans. Signal Process. 49(8), 1605–1613 (2001)

    Article  MathSciNet  Google Scholar 

  15. H. Belkacemi, S. Marcos, Robust subspace-based algorithms for joint angle/Doppler estimation in non-Gaussian clutter. Signal Process. 87(7), 1547–1558 (2007)

    Article  Google Scholar 

  16. J. Zhang, T. Qiu, A. Song, H. Tang, A novel correntropy based DOA estimation algorithm in impulsive noise environments. Signal Process. 104, 346–357 (2014)

    Article  Google Scholar 

  17. I. Santamaría, P.P. Pokharel, J.C. Principe, Generalized correlation function: Definition, properties and application to blind equalization. IEEE Trans. Signal Process. 54(6), 2187–2197 (2006)

    Article  Google Scholar 

  18. W. Liu, P.P. Pokharel, J.C. Príncipe, Correntropy: Properties and applications in non-Gaussian signal processing. IEEE Trans Signal Proc 55(11), 5286–5298 (2007)

    Article  MathSciNet  Google Scholar 

  19. A. Song, T. Qiu, The equivalency of minimum error entropy criterion and minimum dispersion criterion for symmetric stable signal processing. IEEE Signal Proc Lett 17(1), 32–35 (2010)

    Article  MathSciNet  Google Scholar 

  20. R. He, W.S. Zheng, B.G. Hu, Maximum correntropy criterion for robust face recognition. IEEE Trans Pattern Anal Machine Intell 33(8), 1561–1576 (2011)

    Article  Google Scholar 

  21. R.O. Schmidt, Multiple emitter location and signal parameter estimation. IEEE Trans. Antennas and Propagation 34(3), 276–280 (1986)

    Article  Google Scholar 

  22. S. Visuri, H. Oja, V. Koivunen, Subspace-based direction-of-arrival estimation using non-parametric statistics. IEEE Trans. Signal Process. 49(9), 2060–2073 (2001)

    Article  Google Scholar 

Download references


This work has been supported by the National Natural Science Foundation of China (Grant No: 61701344), Tianjin Higher Education Creative Team Funds Program in China, and Tianjin Normal University Doctoral Foundation (52XB1603, 52XB1713). I sincerely thank the anonymous referees for their technical suggestions and their advice on decorum.

Author information

Authors and Affiliations



JinChen gives the overall research direction and ideas. ShengGuan read the relevant literature and books and drafts the article and makes the corresponding experimental simulation. The author(s) read and approved the final manuscript.

Authors’ information

Jin Chen was born in Wuhu, China, in 1976. He received the M.S. degree from Tianjin Normal University and the Ph.D. degree from College of Precision Instrument and Opto-electronics Engineering, Tianjin University, in 2002 and 2013, respectively. Since 2005, he has been working at Tianjin Normal University. He is an associate professor of the Tianjin Key Laboratory of Wireless Mobile Communications and Power Transmission. His research interests include acoustic signal acquisition and processing, broadband sensor array signal processing, and artificial intelligence.

Sheng Guan was born in JiLin, China, in 1993. He received the B.S. degree in textile engineering from the Inner Mongolia University of Technology in 2017. He is currently working toward the M.S. degree in information and communication engineering at Tianjin Normal University. His research interests include beamforming optimization and nonstationary signal processing.

Corresponding authors

Correspondence to Jin Chen or Sheng Guan.

Ethics declarations

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, J., Guan, S. Correntropy-based DOA estimation algorithm under impulsive noise environments. J Wireless Com Network 2020, 154 (2020).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: