Abstract

Traditional blind source separation (BSS) methods often want no additional noise effects. But in practice, noise is ubiquitous, and there are even cases with low signal-to-noise ratios (SNR). Unfortunately, these blind source separation methods have a significant impact on system performance in the presence of noise. This study proposes a blind source separation method to eliminate noise and extract signal information to the maximum extent. The method is based on improved complete ensemble empirical mode decomposition with adaptive noise (ICEEMDAN) and improved wavelet threshold (IWT) hierarchical decomposition to improve the signal separation effect. First, the signal is decomposed via ICEEMDAN to obtain the noise-dominated and information-dominated intrinsic mode function (IMF) components. Then, the noise-dominated IMF components are again decomposed by ICEEMDAN, and each component’s scale function is obtained via detrended fluctuation analysis (DFA). Next, the noise-dominated IMF components generated in the second decomposition round undergo an improved wavelet threshold denoising to obtain useful signal information. Finally, the information-dominated IMF components generated in the two rounds of decomposition and the resulting signal of wavelet denoising yield a reconstructed signal, which is then decomposed using the BSS algorithm to obtain the source signal. The experimental results demonstrate that the proposed method can accurately extract signal information and can better separate the source signal than the existing algorithm.

1. Introduction

Blind source separation aims to recover a source signal from a mix of signals in a transmission channel. The technique employs separation criteria based on the analysis of the observed signal’s time-frequency, statistical, and other characteristics and is suitable for scenarios where the source signals and transmission channel parameters are unknown [1, 2]. BSS algorithms are widely used in domains such as digital image processing [3], speech signal recognition [4, 5], magnetic resonance imaging of the brain [6], and remote sensing image processing [7]. Nevertheless, these applications typically ignore the noise impact on the system or regard the noise impact as small. However, certain communication systems (e.g., satellite communication systems) are sensitive to noise, thus preventing a direct application of BSS algorithms. The satellite communication system is a typical wireless communication system with a low signal-to-noise ratio, and a large variety of noises impact the accuracy of its signal reception. Research shows that the signal separation performance decreases significantly when the SNR is lower than 10 dB [8]. Therefore, there is a need to explore methods that can achieve high BSS performance in the presence of noise.

In recent years, scholars have put forward numerous theories and methods for BSS under noisy conditions, and the more common method is to combine the noise reduction algorithm with the BSS algorithm. At present, the mainstream noise reduction algorithms include multivariable time series [9], K-means [10], stochastic resonance [11], multiobjective evolutionary algorithms [12], wavelet transform, and Hilbert transform [13]. For example, Lei et al. [14] proposed a method that combines wavelet threshold denoising and independent component analysis (ICA) to separate noisy mixed speech signals. Independent component analysis and canonical correlation analysis (CCA) are widely used as two methods for noise removal of HD-sEMG signals, and Wang et al. [15] proposed a new method for noise removal based on independent vector analysis, which significantly improved the system performance. Snoussi and Idier [16] employed the generalized hyperbolic (GH) process to model the signal source and proposed a Bayesian sampling solution. The algorithm achieves good results in the cases of low SNR and underdetermined mixing. Regarding single-channel denoising, Hongyan and Guanglong [17] proposed a noisy speech signal separation method based on the single-channel ICA speech enhancement algorithm and the FastICA algorithm. Gu et al. [18] modeled the distribution of signal sources via the Gaussian mixture model (GMM) by using the non-Gaussian nature of signal sources. The expectation-maximization algorithm obtains the maximum a posteriori probability estimates of the mixture matrix, GMM parameters, and noise covariance matrix. Building on the receiver’s a priori knowledge, Weiss and Yeredor [19] proposed an iterative method for solving the source signal’s minimum mean square error based on maximum likelihood estimation. The discussed methods perform model fitting to recover source signals, which requires a considerable amount of a priori knowledge on source signals and runs a risk of achieving poor performance due to insufficient adaptability of the algorithm.

Empirical mode decomposition (EMD) is a signal processing method proposed by Huang et al. [20] for processing nonlinear and nonstationary signals. EMD decomposes a signal into multiple intrinsic mode functions with different frequencies and bandwidths according to the signal’s time scale characteristics. It is an adaptive decomposition method that requires no a priori information. Due to this advantage, many EMD denoising algorithms have been proposed. Using the fact that higher-order statistics of Gaussian white noise are zero, Tsolis and Xenos [21] proposed a method to detect whether there is only Gaussian white noise in an IMF component. In real-world applications, however, noisy signal sampling points are very limited, and calculating the higher-order statistics using such limited sampling points may introduce large errors. Inspired by translation invariant wavelet threshold, Kopsinis and McLaughlin [22] proposed an interval threshold algorithm based on EMD, ensuring the reconstructed signal’s continuity. Qian et al. [23] combined DFA with EMD, where DFA generates a threshold function for separating IMF components.

The listed EMD-based denoising methods mostly obtain the dividing point between noise-dominated IMF components and information-dominated IMF components by calculating the relationship between the threshold function and the threshold. Furthermore, the methods discard the noise-dominated IMF components before reconstructing the signal. In real-world applications, however, certain signal information is contained in noise-dominated IMF components. Therefore, directly discarding these components affect the system’s performance. To solve this problem, Zhou et al. [24] proposed a hierarchical denoising strategy (EMD-HMA) based on EMD. According to this strategy, after the noise-dominated IMF components are distinguished from the information-dominated IMF components, the noise-dominated IMF components are decomposed once again to extract the signal information further. However, the algorithm achieves only a limited improvement in simulation analysis. To further promote the denoising performance and the signal information retainment, this study proposes a BSS method featuring a hierarchical decomposition and denoising strategy based on ICEEMDAN and IWT denoising.

The main contributions of this study are summarized as follows:(i)As an adaptive data-driven approach, ICEEMDAN has more precise and reliable performance than EMD and its extension methods while overcoming their problems(ii)As a dividing point calibration method for noise-dominated IMF components and information-dominated IMF components, the DFA method better solves the calibration fuzzy problem(iii)We propose a strategy for suppressing noise-based hierarchical decomposition, which can maximize the extraction of signal information through secondary decomposition and further IWT denoising.

The rest of this study is organized as follows. Section 2 is the introduction of prior knowledge, including the BSS algorithm, ICEEMDAN algorithm, DFA algorithm, and improved wavelet threshold function. The BSS method featuring a hierarchical decomposition and denoising strategy is proposed in Section 3. The computer numerical simulation results are presented in Section 4. Finally, a conclusion is drawn in Section 5.

2. Prior Knowledge

2.1. BSS Algorithm

Independent component analysis (ICA) is a classical BSS method based on the statistical independence of source signals. Since communication signals originate from different transmitting sources, they are statistically independent and, therefore, satisfy the ICA conditions.

The system model under noisy conditions iswhere denotes the source signal, is the observed signal, A is the full rank mixing matrix, and N denotes the additive Gaussian white noise. BSS aims to find a separation matrix W and process the received signal assuch that Y is an effective estimate of the source signal S. However, BSS cannot achieve complete identification of the separation matrix W. There are two uncertainties in BSS:(1)Scale uncertainty: since the transmission system parameters and the source signals are unknown, the observed signal X may be the interaction result of the mixing matrix A and the source signal S at different scales. However, the BSS algorithm does not limit the separation matrix scale, resulting in a scale difference between the estimated signal Y and the source signal S.(2)Order uncertainty: switching the positions of the source signal S and the corresponding position in the mixing matrix A yields an identical observation signal X. Therefore, the order of the signals cannot be determined after separation.

2.2. ICEEMDAN Algorithm

Since its proposal, the EMD algorithm has been widely used in nonlinear and nonstationary signal processing problems. However, the EMD’s mode mixing problem greatly affects the algorithm’s performance. To overcome the problems regarding long calculation time, residual noise, and mode mixing, Wu et al. proposed ensemble empirical mode decomposition (EEMD) [25]. However, the method introduces noise during signal decomposition, thus producing a distortion in signal reconstruction. Yeh et al. aimed to eliminate this reconstruction error in EEMD and, in 2010, proposed a complementary EEMD (i.e., CEEMD) [26], which adds noise to the original data in pairs. However, although CEEMD significantly reduces the residual noise in the reconstructed signal, there is no guarantee that the same number of modes can be generated. In 2011, Torres et al. proposed the complete EEMD with the adaptive noise (i.e., CEEMDAN) [27] algorithm to address this problem. The CEEMADN algorithm has been shown to achieve better results in underwater acoustic signal processing [28, 29]. However, several “pseudo” modes appear in the early stage of this algorithm’s decomposition process. The pseudomode problem was effectively solved in 2014 when Colominas et al. proposed the improved CEEMDAN (i.e., ICEEMDAN) [30]. The ICEEMDAN algorithm’s steps are as follows:(1)Calculate the mean value of results produced via EMD in I rounds, obtaining the first residual:Here, is the Gaussian white noise whose th average value and unit variance are zero, denotes the set SNR, and is the operator for calculating the mean value using the EMD algorithm.(2)In the first stage (), calculate the first mode:(3)In the second stage (), estimate the second residual and obtain the second mode:Here, is the operator for generating the th mode using the EMD algorithm.(4)For , calculate the th residual:(5)Calculate the th mode:(6)Continue filtering until the resulting residual’ no further decompositions can be performed (i.e., until less than three local extrema are found):where is the final residual, and is the total number of IMF components. Therefore, the signal is represented as

2.3. DFA Algorithm

The DFA algorithm [31] is a long-term power-law relationship technique. It was first proposed by Peng et al. in 1994 for DNA research, but it is also applicable to the nonstationary signals’ processing. The DFA algorithm can better solve the calibration ambiguity problem, so the algorithm can obtain the critical values of noise-dominated and information-dominated IMF components. The specific steps are as follows:(1)Calculate the mean value of time series in a given interval and perform mean subtraction on the time series :Here, time series is divided into subspace series segments, represents the rounding function, and denotes the interval length.(2)The polynomial fitting trend of each subinterval is(3)When the fluctuation trend of each subinterval is removed, the volatility variance of each subinterval is expressed asThe second-order fluctuation coefficient of the segment series is expressed as(4)Changing the subinterval length n in step (1) and repeating steps (2) and (3) to obtain the time series fluctuation curve, one derives the Hurst index of the time series :(5)The relationship between scale function and fluctuation function is

Steps (4) and (5) show that the scaling function is related to the Hurst index. In this study, the values of the two items are set to be equal. When , the component is the noise-dominated component. Furthermore, indicates that the component is irrelevant to the signal, and finally, when , the component is information-dominated [32]. Thus, by comparing the IMF components’ values, noise-dominated IMF components can be distinguished from information-dominated IMF components.

2.4. Improved Wavelet Threshold Function

In order to solve the problem of signal information loss caused by the ICEEMDAN method, wavelet threshold function is introduced to denoise the noise-dominant IMF components, so as to extract the useful information. The traditional wavelet threshold function mainly includes hard threshold function and soft threshold function. However, the hard threshold function has the problem of discontinuity at the threshold λ, so there will be local oscillation in signal reconstruction. The soft threshold function is smoothed, but there is a problem of large deviation after signal reconstruction. Applying wavelet threshold function directly to the EMD algorithm significantly affects the reconstructed signal’s continuity [24]. Therefore, on the basis of integrating wavelet threshold function and the EMD algorithm, Wang et al. [33] proposed an improved wavelet threshold function, which combines the advantages of hard threshold function and soft threshold function to further reduce the reconstruction error.

The improved wavelet threshold function is expressed aswhere is the wavelet coefficients obtained after the wavelet transform, and is the threshold. Both (k > 0) and the so-called “scaling index” () can be adjusted according to the actual situation. As , the threshold function is closer to the hard threshold function, whereas when , the threshold function is closer to the soft threshold function. Similarly, the larger the scaling index , the smoother the signal’s potential trend. When , the improved wavelet threshold function is continuous at the threshold . When , the improved wavelet threshold function is an asymptote, and the reconstructed signal is closer to the actual signal.

The threshold is expressed aswhere represents the noise intensity, i is the number of decomposition layers, and N is the signal length. Threshold decreases with the increase in the number of decomposition layers.

3. BSS Method Featuring Hierarchical Decomposition and Denoising Strategy Based on ICEEMDAN and Improved Wavelet Threshold

In the decomposition process of traditional EMD-based denoising algorithms [34], the first IMF component is usually dominated by noise. Therefore, it has minimum signal information and is usually discarded to suppress noise. Although several methods successfully distinguish noise-dominated IMF components from information-dominated ones, discarding noise-dominated IMF components deletes the signal information contained therein, which will undoubtedly affect the signal separation performance.

Hierarchical multiresolution analysis is to zoom the signal in a particular frequency band by representing the signal in that particular frequency band as the sum of next level components [35]. The method of EMD-based hierarchical multiresolution analysis can further zoom the intrinsic time scales from coarse level to fine level. Since the detail information of the noise-dominated IMF is obtained from a further decomposition level, better denoising performance can be achieved [24]. However, EMD has the problems of long calculation time, residual noise, and mode aliasing. Therefore, we use the ICEEDMDAN algorithm to replace the EMD algorithm and hope to further decompose the noise-dominated IMF components generated in the first decomposition round and perform IWT denoising on the noise-containing part to maximally retain the signal components. The block diagram of the proposed algorithm is shown in Figure 1.

First, the source signal interferes with noise in the transmission process, and the receiver receives the mixed signal . The received signal is decomposed using ICEEMDAN to obtain the first-round decomposition components denoted by . For the first dividing point calibration, the IMF components decomposed for the first time are preliminarily screened by using the principle of correlation coefficient [36].

The estimated value of the signal can be defined as

Correlation coefficients are calculated aswhere N is the signal length, and M is the value at which the correlation coefficient begins falls below a certain constant C, i.e., a threshold dividing the noise-dominated IMF components and the information-dominated IMF components generated in the first round of decomposition. Typically, . In this study, C is set to 0.80. Now,where M is the number of IMF components generated in the first decomposition round. Taking the mth IMF component as the dividing point, the previous IMF components are the noise-dominated IMF components, and the rest are the information-dominated IMF components. In the first decomposition, most of the signal information has been filtered out.

Then, the second-round ICEEMDAN decomposition is performed on the noise-dominated IMF components to obtain the IMF components of the second-round decomposition. Because most of the signal information has been filtered out in the first decomposition, the second dividing point calibration needs to be more accurate. The DFA algorithm can better solve the problem of calibration ambiguity. Therefore, we choose to use the DFA algorithm to calibrate the dividing point of the second decomposition, and the scaling function is obtained based on the Hurst index of each IMF component. The dividing point k separating the noise-dominated IMF components from the information-dominated ones generated in the second-round decomposition is obtained. Then, IWT denoising is performed on the noise-dominated IMF components of the second-round decomposition to obtain the signal information part .

Finally, signal reconstruction is performed using the information-dominated IMF components obtained in the first and second decomposition rounds, as well as the signal information resulting from denoising the noise-dominated IMF components in the second-round decomposition.where K is the number of IMF components generated in the second-round decomposition, and and are the residuals generated in the first and second decomposition rounds, respectively. The reconstructed signal undergoes a BSS separation process to obtain the estimated values of the source signals. In this work, JADE is used as the BSS algorithm.

4. Performance Analysis

We use the “heavy sine” test signal with a length of 1,024 in MATLAB as the source signal . Set . The mixing matrix is . An additive Gaussian white noise is added to the mixed signal, and SNR ranges between 0 and 15 dB.

During the first-round decomposition, the generated IMF components are screened based on the correlation coefficient to obtain the point m dividing noise-dominated from information-dominated IMF components. The correlation coefficient value diagram is shown in Figure 2. It can be seen from the figure that when SNR equals 5 dB, m equals five (i.e., 1–5 IMF components are noise-dominated, whereas 6–9 IMF components are information-dominated).

The noise-dominated IMF components are useless in the traditional EMD denoising algorithms. However, implementing the hierarchical decomposition and denoising strategy allows them to be decomposed once again to extract signal information. First, the Hurst index of each IMF component generated in the second-round decomposition is calculated using the DFA algorithm, and the IMF component dividing point is obtained. Then, the noise-dominated IMF components are denoised using the IWT denoising algorithm to obtain useful signal information. Next, signal reconstruction is performed following equation (21) to obtain the reconstructed signal. Finally, JADE is used to decompose the reconstructed signal, obtaining the source signal. Figure 3 shows the source signal, the observed signal, and the separated signal yielded by the proposed algorithm when SNR equals 1 dB.

In this study, the performance index (PI) [37] is used as a metric to evaluate the separation effect. PI is defined aswhere , C is the system matrix, and is the jth element in the ith row of C. As defined, the PI value cannot be less than 0. When C is a generalized permutation matrix, PI reaches its minimum value (i.e., zero). The closer the PI is to 0, the better the separation performance of the algorithm and the higher the signal separation accuracy.

This study compares the proposed algorithm with EMD-HMA [24], EMD-DFA [23], wavelet threshold denoising[38], and traditional EMD denoising method [39] (Figure 4).

As shown in Figure 4, the proposed algorithm achieves a better separation effect than other considered algorithms, exhibiting a salient advantage under the condition of low SNR. When SNR is 1 dB, the PI value of the proposed algorithm is −23.87 dB, which amounts to an improvement of 10.12 dB compared with the EMD-HMA’s PI (−13.75 dB). The difference in the traditional EMD-based algorithms’ performance stems from a signal information loss due to discarding the noise-dominated IMF components, resulting in incomplete signal recovery. To mitigate the limitations of EMD-DFA and traditional EMD denoising methods, the EMD-HMA algorithm proposed in [24] adopts a hierarchical decomposition strategy. However, this method discards the noise-dominated IMF components generated in the second-round decomposition, thus leading to incomplete signal recovery. Furthermore, the wavelet threshold denoising method has poor adaptability due to the intrinsic limitations of the wavelet basis. Based on an analysis of the deficiencies of the existing algorithms, this work adopts a hierarchical decomposition strategy for the proposed algorithm. With this arrangement, the noise-dominated IMF components generated in the second-round decomposition are processed using the IWT denoising method, maximally retaining the signal information and endowing the algorithm with a degree of adaptability.

5. Conclusion

The BSS algorithm separates the source signals from a mix of signals. However, noise seriously affects signal separation. Given this problem, this work carried out an in-depth study on the problem of BSS under a noisy condition and proposed a method that mitigates the shortcomings of the existing algorithms. The new BSS method features hierarchical decomposition and denoising strategy based on ICEEMDAN and IWT and can retain the signal information to the maximum extent, improving the separation effect. The simulation analysis results indicate that the proposed algorithm is superior to the existing algorithms. When SNR is 1 dB, the proposed algorithm achieves a signal separation effect of at least 10.12 dB higher than the existing algorithms, significantly improving the signal separation effect under low SNR conditions.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (62001516).