A corrigendum for this article has been published. To view the corrigendum, please click here.

Mathematical Problems in Engineering

Volume 2018, Article ID 8076468, 9 pages

https://doi.org/10.1155/2018/8076468

## Blind Source Separation for Complex-Valued Signals Using Generalized Autocorrelation

^{1}School of Mechanical Engineering, Xian Jiaotong University, No.28, Xianning West Road, Xi’an, Shaanxi 710049, China^{2}School of Space Information, Space Engineering University of PLA, No.1, Bayi Road, Huairou District, Beijing 101416, China

Correspondence should be addressed to Jiong Li; moc.621@5102_jil

Received 11 February 2018; Revised 24 May 2018; Accepted 20 June 2018; Published 12 July 2018

Academic Editor: Bogdan Dumitrescu

Copyright © 2018 Xiaogang Tang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We introduce a new complex-valued blind source separation approach, based on generalized autocorrelations of sources, to improve the spectrum efficiency for the next-generation wireless communications system. The proposed algorithm considers the temporal structures of communication signals and the natural gradient-based method is used to optimize the demixing matrix. In addition, the local stability condition is proved. Simulation results are presented showing the superior performance of the proposed algorithm in the intersymbol interference of the estimated signals.

#### 1. Introduction

For the next-generation mobile communications system (5G), spectrum efficiency is a critical performance metric, which aims at achieving more than 10 times spectrum efficiency compared with the current communications system (4G) [1]. Since radios must either transmit or receive on the same channel, but not simultaneously, in previous wireless communications systems, the frequency resource is not utilized sufficiently. Fortunately, an emerging technique, co-frequency and co-time full-duplex (CCFD) [2–4], is able to address this issue. CCFD enables radios to transmit and receive signals on the same channel simultaneously and, thus, theoretically, can double the spectrum efficiency. CCFD technique claims to be the most potential duplex scheme for the 5G network. But, there is a challenge which lies in the application of CCFD technique, i.e., mitigating the local self-interference (SI) [3, 4]. Since the transmit and receive antenna work on the same frequency band, traditional interference cancellation techniques are invalid. As our previous work shown [5], blind source separation (BSS) [6] has an excellent capability to address such issue.

Since BSS is able to estimate original signals from their observed sensors’ signals without knowing both the mixing process and the sources, it has been one of the most attractive technologies in many fields, such as communications [7–9], speech signal processing [10, 11], and medical signal processing [12–14]. Depending on the application, the sources may be real or complex. This paper focuses on the separation of baseband communication signals which are usually complex-valued.

Independent component analysis (ICA) is a common method to realize BSS, which can estimate demixing matrix and separate signals up to an arbitrary scaling and permutation ambiguities if the source signals are mutually independent and no more than one Gaussian source exists. And most of complex ICA algorithms exploit the non-Gaussianity or sample dependency of sources. Non-Gaussianity is often measured by high order statistics. Fourth-order moments is used in fourth-order blind identification (FOBI) [15], which is very efficient but requires that the sources have different kurtosis. However, sources have identical distribution in many applications, and then FOBI is invalid. Joint approximate diagonalization of eigenmatrices (JADE) [16] is based on fourth-order cumulants and performance suffers when the number of sources increases. The strong uncorrelating transform (SUT) [17] and the generalized uncorrelating transform (GUT) [18] estimate mixing matrix by jointly diagonalizing the covariance matrix and pseudo-covariance matrix of mixed signals. Also, it is important to note that, for noncircular sources, SUT can achieve separation of themselves as long as they have distinct noncircularity indices.

The above methods make use of the non-Gaussianity property and neglect sample dependency. In this paper, we take the temporal characteristics of communication signals into account. We develop a new complex BSS algorithm motivated by generalized autocorrelations of the source signals. A natural gradient-based algorithm is derived for the generalized autocorrelations contrast function. Stability conditions are then derived in the complex domain for the generalized autocorrelations contrast function.

This paper is organized as follows. First, the BSS problem is formulated in Section 2. We then introduce the new contrast function based on the generalized autocorrelations of source signals and derive a natural gradient-based algorithm in Section 3. The performance of the algorithm is demonstrated with simulations in Section 4. Conclusions are drawn in Section 5.

#### 2. Problem Formulation

Considering there are sensors and independent sources, the instantaneous linear mixtures of these sources are observed at the sensors:where (superscript denotes transpose) is a vector of unknown zero mean and unit-variance source signals, is the observation vector, and is the unknown mixing matrix. We impose another assumption on the source signals that the source signals have specific temporal structures, linear or nonlinear autocorrelations.

In general, preprocessing operations of observed signals are needed before performing BSS algorithm. Two common preprocessing operations are removing mean and whitening. The whitening matrix can be obtained using the eigenvalue decomposition of covariance matrix (superscript denotes conjugate transpose; denotes expectation).where and are the eigenvalue matrix and the eigenvector matrix of the covariance matrix . The observations are whitened by :Then, , due to , , and is an orthogonal matrix which imposes orthogonal constraint on the demixing matrix . The sources can be estimated bywhere is the estimation of .

#### 3. Proposed Algorithm

Now we generalize the framework in [19] for complex-valued signals. We start from an arbitrary nonlinear contrast function and prove that its extrema coincide with the sources. The generalized autocorrelation of estimated signal is calculated with the selected nonlinear function and the nonlinear function can be chosen freely. Our contrast function based on complex generalized autocorrelation functions iswhere is a differentiable function which measures the generalized autocorrelation degree of the source signal, is the volume vector of demixing matrix , and , is a delay in time. Finding the extrema of a contrast is a well-defined problem only if the function is real. So we make our contrast functions operate on absolute values rather than complex values. Examples of choices of the differentiable function are , , . For simplicity, the time index is omitted in the following, i.e., , .

Theorem 1 gives the local stability of the estimators, the proof of which is given in Appendix.

Theorem 1. *Assume that the input data follows model (1). The prewhitening operation is performed on the observation signals as (3). Furthermore, assume that and are mutually independent and , . Then, the local maximum (respectively, minimum) of under the constraint includes those rows of the inverse of the global mixing matrix , so the corresponding sources satisfywhere we definewhere function is the derivative of .**We now give the conjugate gradient algorithm for complex signals under model (1). The problem given in (5) can be written as the following Lagrangian function:where the Lagrangian multiplier is a real number. The conjugate gradient of the contrast function with respect to can be obtained asFunction is the derivative of ; designates the complex conjugate of . Thus, the conjugate gradient-based update rule of can be written aswhere is the real-valued step-size.**It is known that, in general, relative gradient-based method converges slower than natural gradient-based method. To speed up the convergence, the natural gradient-based update rule of (13) can be written as*

#### 4. Simulation and Results

The proposed algorithm is compared with three competitive complex ICA algorithms: complex FastICA [20], EBM [21], and EASI [22]. FastICA is a Newton-based ICA algorithm which converges fast. EBM is a conjugate gradient-based algorithm. EASI is a relative gradient-based algorithm. In general, Newton method converges faster than conjugate gradient and relative gradient methods, and relative gradient method converges slowest. The performance index is defined as (15) which means the average intersymbol interference of the estimation sources.where is the combined separation-whitening-mixing matrix, and is the th entry of .

This article considers the situation where two traditional and classic modulation signals are mixed, i.e., two 8PSK signals. Figure 1 shows the constellation figures of two original 8PSK signals, their mixtures, and the estimations using the proposed algorithm employing the nonlinear function . In this simulation, the two 8PSK are with the following parameters: symbol rate , raised cosine filter which has 0.5 roll-off factor, and sampling frequency . The mixing matrix is randomly generated asFrom Figure 1, we can see that the source signals are properly estimated. As most complex BSS algorithms, there are some ambiguities, including amplitude, order, and phase. The combined separation-whitening-mixing matrix is estimated as