Wireless Pers Commun

DOI 10.1007/s11277-013-1286-6
Noisy Blind Signal-jamming Separation Algorithm
Based on VBICA
Yuling Duan Hang Zhang
Springer Science+Business Media New York 2013
Abstract Aiming at the blind signal-jamming separation (BSJS) in wireless communication
environment, we propose a noisy BSJS based on Variational Bayesian Independent Com-
ponent Analysis algorithm to separate the communication signal from jamming signals and
noises. This algorithm takes the KullbackLeibler divergence between the true post distri-
butions of source signals and the approximate ones as objective function, models sources
using mixture of Gaussians, and updates parameters of the model using variational-Bayesian
learning method, so as to make the estimated approximate posterior distributions close to
the true ones and recover source communication signals nally. The simulation results show
that the proposed algorithm is effective for the BSJS in noisy environment.
Keywords Variational Bayesian Noisy mixture MOG
Blind signal-jamming separation Blind source separation
1 Introduction
Blind source separation (BSS) technique has become a new study eld in the modern sig-
nal processing. Its purpose is to recover the independent sources from the observed mixed
signals using the statistical characteristics when the sources and the channel parameters are
all unknown [1]. Presently, the technique has been used in a good many elds, such as
biomedicine, speech recognition, machine malfunction elimination and so on [24]. In this
paper, we use it to separate communication signal from observed signals which are mixed by
jamming signals and noises, and achieving the purpose of anti-jamming. We call it as blind
signal-jamming separation (BSJS).
Y. Duan
Nanjing Artillery Academy, Nanjing, China
e-mail: xizi529@sina.com
H. Zhang (B)
Institute of Communications Engineering,
PLA University of Science and Technology, Nanjing, China
e-mail: hangzh_2002@163.com
123
Y. Duan, H. Zhang
Unknown
Mixing
matrix
Observation
signals
) (
1
t x
) (
2
t x
) (t x
M
S
o
u
r
c
e

s
i
g
n
a
l
s
A
) (
2
t s
) (t s
N
) (
1
t s
Fig. 1 Noise-free mixing model of observed signals in BSS system
Unknown
Mixing
matrix
Observation
signals
) (
1
t x
) (
2
t x
) (t x
M
A
) (
1
t n
) (
2
t n
) (t n
M
) (
2
t J
) (t J
N
) (
1
t s
S
o
u
r
c
e

s
i
g
n
a
l
s
Fig. 2 Noisy mixing model of observed signals in BSJS system
1.1 Conventional BSS Model
Conventional BSS is processing in noise-free environment. Figure 1 describes the noise-free
mixing model of observed signals in BSS.
In Fig. 1, the observed signals can be described as
X(t ) = AS(t ) (1)
where X(t ) = [x
1
(t ), x
2
(t ), . . . , x
M
(t )]
T
is a set of observed signals, t = 1, 2, . . . , L,
L denotes the number of the sampling point. A is a M N linear mixing matrix. S(t ) =
[s
1
(t ), s
2
(t ), . . . , s
N
(t )]
T
is a set of source signal vector. In (1), X(t ) is known only, and the
A and S(t ) are both unknown.
BSS algorithms try to nd a matrix W which is called as separation matrix, make the
output signals y = WX are the best estimation of source signals. In a word, the conventional
BSS algorithm is to solve the inverse transform of the mixing matrix A for getting the best
estimation of the source signals S(t ) from the observed mixing signals X(t ).
1.2 Noisy BSJS Model
But in actual environment, noise cannt be neglected. Especially in BSJS system, noise and
jamming are simultaneous. The noisy mixing model of the observed signals in BSJS system
is shown in Fig. 2. By this time, the mixing process is no longer invertible because of the
additive noise, and conventional BSS algorithms are difcult to get the inverse transform of
the mixing matrix directly, so they also cannt separate source communication signal from
jamming and noises effectively.
123
Noisy BSJS Algorithm Based on VBICA
In Fig. 2, the observed signals can be described as
X(t ) = AS(t ) + n(t ) (2)
where, S(t ) = [s
1
(t ), J
2
(t ), . . . , J
N
(t )]
T
is a set of source signal vector from N trans-
mitters, s
1
(t ) is communication signal, J
i
(t ), i = 2, . . . , N are jamming signals. n(t ) =
[n
1
(t ), n
2
(t ), . . . , n
M
(t )]
T
is noise vector. And we assume that the source signals and addi-
tive noise components are mutually statistically independent. In this paper, we only talks
about non-underdetermined case, namely the mixing matrix A is full rank. So it needs that
the number of the observation signal is greater than or equal to the number of the source
signal. There, we use M receive antennas, and M N.
Its clearly that noisy mixture blind source separation is more signicant to study.
1.3 Previous Work and Our Work
Presently, some noisy BSS algorithms have been proposed. One of which is a kind of BSS
algorithm based on denoise technique, such as Wang et al. [5] presented a concurrent time-
frequency and noise-pretreatment methodology for blind source separation in an additive
white Gaussian noise channel, which is based on wavelet denoise and empirical mode decom-
position (EMD) denoise. This kind of algorithm could eliminate some noise although, their
separation performance mainly depends on the denoise techniques and increase the cost of
system in a certain extent. The other kind of noisy BSS algorithm is a fast ICA for noisy data
using Gaussian moments algorithm proposed by Hyvarinen [6]. But, this algorithm needs
known noise precision and just aims at Gaussian noise. Besides, these above-mentioned
noisy BSS algorithms are almost based on ICA theory. But ICA theory has many limits.
For example, it requires the most only one source signal is gaussian signal, and the mixing
matrix is full column rank. Most importantly, ICAtheory ignores noise in mixing process. So
these algorithms also cannt solve actual BSJS problem effectively. Fortunately, Choudrey
[7] proposed an independent component analysis based on Variational Bayesian (VBICA),
which overcomes these limits of the conventional ICA theory.
Considering the noise-robustness of VBICA, and combining with the model of commu-
nication signal and the observed signals in noisy BSJS system, we propose a BSJS algorithm
based on VBICA to separate source communication signal s
1
(t ) from jamming signals and
noises. Firstly, we model the source signals, noise and the mixing process of the observed
signals, then get the approximate posterior distributions of the source signals by variational
Bayesian learning. Finally, the source communication signal is recovered. And in order to
verify this algorithm, we do a large number of simulations to separate communication sig-
nal such as BPSK, 16QAM from jamming signals and noises, and have a good separation
performance.
The rest of this paper is organized as follows. In Sect. 2, we infer the VBICA algorithm
and the modeling process of the parameters in BSJS detailedly. In the next section, the noisy
BSJS algorithm based on VBICA is proposed and a series of simulation results are provided.
At the end of the paper, the remarkable conclusions are presented.
2 The VBICA Algorithm
VBICA algorithm is a kind of BSS algorithm based on model estimation which combines
the Bayesian theory with the ICA theory. Firstly, it uses prior probability density functions
(PDFs) to model the variables in Fig. 2 including source signals, mixing matrix and noise,
123
Y. Duan, H. Zhang
Apriori Knowledge of
Communication
System
Sources Model Noise Model
1
x
2
x
N
x
Mixing Model
Parameters
Learning
Sources Model
Parameters
Learning
R
e
c
o
v
e
r
s
o
u
r
c
e
s
s
1

J
2

J
1

M
J
Transfer Parameters
Transfer Data
Mixing
Model
O
b
s
e
r
v
e
d
S
i
g
n
a
l
s
S
o
u
r
c
e
s

a
p
p
r
o
x
i
m
a
t
e
p
o
s
t
e
r
i
o
r
p
r
o
b
a
b
i
l
i
t
y
d
e
n
s
i
t
y
Noise Model
Parameters
Learning
R
e
c
o
v
e
r
e
d
s
i
g
n
a
l
s
Fig. 3 Simplied description of VBICA algorithm
constructs a parameter model (called as Generated Model) based on the probability theory,
which describes the generative process of the observed signals. Then, VB learning method is
used to update the parameters so that the parameter model can reect the generative process
as exactly as possible. Finally, we get posterior PDFs of the variables and recover source
signals, especially the source communication signal. The algorithm can be simplied to
Fig. 3.
In Fig. 3, the PDF of observed signals X(t ) expresses as
p(X(t )|S(t ), A, ) = | det(/2)|
1/2
exp[E
D
] (3)
where E
D
= (X(t ) AS(t ))
T
(X(t ) AS(t ))/2. denotes diagonal precision matrix of
noise.
Since the sources S(t ) = [s
1
(t ), J
2
(t ), , J
N
(t )]
T
are mutually independent, so the
distribution of S(t ) can be written as
p(S(t )) =
N

i =1
p(s
i
(t )) (4)
Theoretically, we could recover the sources by calculating the posterior distributions of the
sources given the observed signals and the model,
p (S(t )|X(t ), ) =
p (X(t )|S(t ), ) p (S(t )|)
p (X(t )|)
(5)
where p(S(t )|) is the prior distribution of source signal model, p(X(t )|) is the margin
probability of X(t ) under the model .
2.1 Objective Function
In this algorithm, an appropriate objective function is needed as convergence condition dur-
ing the learning processing. There, we adopt negative-free-energy as the objective function.
123
Noisy BSJS Algorithm Based on VBICA
The detailed deduction is given as follows. The logarithm marginal likelihood of observed
signals X is
log p(X) = log
p(X, W)
p(W|X)
(6)
where W is an aggregate of all variables and parameters. p(W |X) is the true posterior distrib-
ution. As the logarithmmarginal likelihood of Xdoes not depend on W, it can be re-written as
log p(X) =
_
p

(W) log
p

(W) p(X, W)
p

(W) p(W|X)
dW
=
_
p

(W) log
p(X, W)
p

(W)
dW +
_
p

(W) log
p

(W)
p(W|X)
dW (7)
= F[X] + KL[ p

(W) p(W |X) ]

where p

(W) is approximate posterior distribution of p(W |X); and

F[X] = log p(X, W)
p

(W)
+ H[ p

(W)] (8)
KL[ p

(W)|| p(W|X)] =
_
p

(W) log
p

(W)
p(W|X)
dW (9)
F[X] is called as negative-free-energy [7] . In (8), the rst term is expectation of the joint
possibility density between sources and observed signals under p

(W). And H[ p

(W)] is the
entropy of p

(W). KL[ p

(W)|| p(W|X)] is the KullbackLeibler (KL) divergence which

measures the difference between two probability densities, and it is strictly non-negative. So,
log p(X) F[X] (10)
with equality when p

(W) equals p(W|X).

Therefore, maximizing the F[X] means to minimize the KL divergence between the
approximate posterior PDF and true one. That is to say, F[X] is higher, the estimated data is
more closing to the true one. So the objective function of this algorithm is to maximize the
F[X].
2.2 Modeling
2.2.1 Source Model
In this paper, mixture of Gaussians (MOG) model is chosen to model the source signals. Sta-
tistically, MOGmodel could toward any probability density distribution as exactly as possible
by choosing appropriate number of Gaussian components and appropriate parameters. So
S(t ) is modeled as N MOGs with m
i
Gaussian components.
p(S(t )|) =
N

i =1
m
i

q
i
=1
p(q
i
= q
i
|
i
) p(s
i
(t )|q
i
,
i,q
i
,
i,q
i
) (11)
=
N

i =1
m
i

q
i
=1

i,q
i
N(s
i
(t );
i,q
i
,
i,q
i
)
where q
i
represents the chosen Gaussian component in the i th source. The mixing weight

i,q
i
= p(q
i
= q
i
|
i
) is the prior probability of the Gaussian component q
i
. N() means
Gaussiandistribution,
i,q
i
,
i,q
i
represent the meanandprecisionof the Gaussiancomponent
123
Y. Duan, H. Zhang
q
i
respectively. The complete parameter set of the i th source is
i
=
_

i
,
i
,

i
_
, and

i
,
i
,

i
are m
i
dimension vectors respectively. So the parameter set of the sources vector
is = {
1
,
2
, . . . ,
N
}.
The prior probability over the source model parameters is
p() = p() p() p() (12)
wherep()over the mixing weight is Dirichlet
p() =
N

i =1
D(
i
,
i 0
) (13)
p() over the means is product of Gaussians
p() =
N

i =1
m
i

q
i
=1
N(
i,q
i
, m
i 0
,
i 0
) (14)
p() over the precisions is product of Gammas
p() =
N

i =1
m
i

q
i
=1
G(
i,q
i
; b
i 0
, c
i 0
) (15)
2.2.2 Noise Model
The noise n(t ) is assumed to be Gaussian, with zero mean and diagonal precision matrix ,
the PDF of which is
p(n(t )) = N(n(t )|0, ; ) (16)
The prior probability p() over the diagonal precision matrix is also product of Gammas
p() =
M

j =1
G(
j
; b
j
, c
j
) (17)
2.2.3 Mixing Matrix Model
The prior PDF p(A) over the mixing matrix is product of Gaussians
p(A) =
N

i =1
M

j =1
N(A
j i
|0,
j i
) (18)
where
j i
denotes the variance of the ( j, i ) mixing coefcient in mixing matrix.
In (13)(17),

, m

, b

, c

are called as hyper-parameters.

2.3 Initialization
In VBICA, initializing variables and parameters is needed. In cooperative communication,
some prior information of communication signals is known, such as the signals modulation
mode, shape lter, symbol rate, carrier frequency and so on. By many tests time after time,
these hyper-parameters of p(), p(), p(), p(A), p() in the model are initialized as
follows:
123
Noisy BSJS Algorithm Based on VBICA
2
x
1
x
10 10
, b c
10 10
, m
10

1,1

1
1,m

1,1

1
1, m
0 N

,1 N

,
N
N m

,1 N

,
N
N m

N
q
1
s
N

N
J
1,1

1,1
a
M

,
M M
b c

2 2
, b c

1

1
q
1 1
, b c

0 0
,
N N
m
0 0
,
N N
b c
M
x
Fig. 4 VBICA mixing system model parameters

i 0
= 5, m = 0, = 1, 000, b
()
= 1, 000, c
()
= 0.001,
b
()
= 1, 000, c
()
= 0.001, b
()
= 1, 000, c
()
= 0.001
This paper performs Singular Value Decomposition (SVD) on the observation signals to
initialize the mixing matrix, noise and the sources. Then, we can get the weights, means and
precise of the MOG model by k-means clustering [8] on the initialized sources.
2.4 VB Learning
After initialization, its time for VB learning. In this model, all the parameters and their
relationship are described as Fig. 4, where circles represent random variables and rectangles
represent hyper-parameters.
In VBICA model, objective function F[X] is shown in (8), where W = {A, , S, q, } is
aggregate of the source variables and parameters. Maximizing the F[X] equals to maximize
the p

(W). There, we use variational approximation method [9] to maximize the factors of
p

(W).
p

(W) = p

() p

(A) p

(S|q) p

(q) p

() (19)
where p

() = p

() p

() p

().
p (X, W) = p (X|A, , S) p (S|q, , ) p (q|) p () p (A) p () (20)
where p(X|A, , S) =

L
t =1
p(x(t )|s(t ), A, ).
Combining (19) (20) with (8),
F = log p(X|A, , S)
p

(A) p

() p

(S)
+ log p(S|q, , )
p

(S|q) p

(q) p

() p

()
+H[ p

(S|q)] + log p(q | )

p

(q) p

()
+ H[ p

(q)] + log p()

p

()
+H[ p

()] + log p()

p

()
+ H[ p

()] + log p()

p

()
+H[ p

()] + log p(A)

p

(A)
+ H[ p

(A)]
+ log p()
p

()
+ H[ p

()] (21)
123
Y. Duan, H. Zhang
where,
p

(q) =
N

i =1
L

t =1

t
i,q
i
(22)

t
i,q
i
=
t
i,q
i
_

t
i,q

i
,
t
i,q
i
=
i,q
i
p
i,q
i
.
p

(S|q) =
N

i =1
L

t =1
N
_
s
i
(t );
t
i,q
i
,

t
i,q
i
_
(23)
The other posteriors PDFs have the same form as the priors. The update equations of these
parameters are detailed in Appendix A.
Updating these parameters iteratively until convergence that means the F = |F
new

F
old

is less than a tolerance . In this paper, = 0.0001.

After VB learning, we can estimate the sources by getting the posteriors PDFs of these
variables.
3 The Noisy BSJS Based on VBICA
In VBICA algorithm, the noise is modeled and learned. Comparing with other noise-free
BSS algorithms, VBICA is robust to noise. So we employ it to solve the BSJS problem in
noisy communication system, the ow chart is shown in Fig. 5, where the pre-processing
means removing means and whitening [1]. Then, we model the sources, noise and mixing
process, and initialize the prior PDFs of all the parameters in this model. Next, VB learning
method is used to update these parameters until convergence. Finally, posterior PDFs of the
variables are estimated, and we also recover the source communication signal and jamming
signal from the observed signals.
In order to verify the performance of the noisy BSJS based on VBICA algorithm, we
do a series of simulations at Matlab 7 platform. Firstly, we simulate the MOG models
validity for the source signals. Secondly, simulations that prove the separation performance
of the algorithm for BPSK signal under multi-tone jamming signal in well-determined case
( ) t X
P
r
e
-
p
r
o
c
e
s
s
i
n
g
( ) t Z
N
VBICA
algorithm
Y
R
e
c
o
v
e
r
s
o
u
r
c
e
s
Variables approxi
mate posterior
probability density
( ), ( ), ( ),
( ), ( ), ( )
( | )
p' q p' p'
p' p' p'
p' q
A
S
s
1
J
2
J
1 M
J
R
e
c
o
v
e
r
e
d
s
i
g
n
a
l
s
new old
F F
Convergence?
VB learning, updating
parameters in the model
iteratively
, , , , ,
, , , , ,
,
, , , , ,
, , , , ,
, , , ,
i i i i i
i i i i i
i ji j j
t t t
i q i q i q i q i q
i q i q i q i q i q
i q a ji
p
m b
c m b c
Setting up VBICA model
( ) p A
Mixing Model
( ( )) p t n
Noise Model
( ( ) | ) p t S
Sources Model
F
Setting up Objective Function,
negative-free-energy
1
x
2
x
M
x
O
b
s
e
r
v
e
d
S
i
g
n
a
l
s
Initializing mixing matrix,
noise, sources and hyper-
parameters in the model
0 ( ) ( )
( ) ( ) ( ) ( )
, , , , ,
, , ,
i
m b c
b c b c
Transfer Parameters
Transfer Datas

<

Fig. 5 Flow chart of the noisy BSJS based on VBICA

123
Noisy BSJS Algorithm Based on VBICA
(M = N) are carried out. Finally, we use it to separate the 16QAM signal from broadband-
noise jamming signal and multi-tone jamming signal in over-determined case (M > N). The
detailed simulation analyses and results are described as follows.
3.1 Simulation for MOG Modeling and Analysis
There, sources signals including BPSK, 16QAM, broadband-noise jamming signal and multi-
tone jamming signal are to be modeled respectively. Figure 6a, b show their time-domain
waveforms and corresponding probability density distribution histograms. Every source sig-
nal is modeledusingMOGwithve Gaussiancomponents. Bylearningthe model, probability
density distributions of estimated signals are described in Fig. 6c. Many tests indicate that the
number of Gaussian components in every MOG is less work on the separation performance
of the algorithm.
In Fig. 6c, these colorful broken lines represent the probability density distributions of ve
Gaussian components in each source model respectively, and the black real lines represent the
probability density distributions of the MOGs which are mixture of ve Gaussian components
in proportion respectively. Comparing Fig. 6c with b, the probability density distributions of
sources and the ones of the estimated signals using MOG are almost coincident. That is to
say, MOG could model the source signals successfully.
3.2 Simulation for BPSK Under Multi-tone Jamming Signal and Analysis
In this simulation, source communication signal s
1
(t ) is BPSK signal, symbol rate R
b
=
10 kbit/s, carrier frequency f
c
= 20 kHz. Jamming signal J
1
(t ) is a multi-tone with carrier
frequencies f
c1
= 19 kHz, f
c2
= 19.99 kHz, f
c3
= 21 kHz respectively. The jamming-
signal-ratio (JSR) is 10dB. Mixture matrix A
22
is generated randomly. Noise is Gaussian
noise, and the signal-noise-ratio (SNR) is 10dB. Equation (2) is used to create X(t ), sampling
frequency f
s
= 100 kHz. After separating the X(t ) using the algorithm shown in Fig. 5,
the simulation results are shown in Fig. 7. We also analyses the separation performance
in different SNR cases. Figure 8 plots the bit-error-ratio (BER) of the recovered BPSK
signals using EASI algorithm [10], FICA algorithm [11], JADE algorithm [12] and the
VBICA algorithm respectively. The result is the average of 50 Monte Carlo experiments.
Furthermore, comparing the separation running time of the four algorithms, which is related
with the sampling points of the observation signal, the result is shown in Table 1.
From Fig. 7, we can see that the recovered signals waveforms are almost same as the
source signal waveforms except the scale and phase ambiguity, but it doesnt matter for
receiving communication signal correctly. In order to measure the accuracy of separation,
we calculate the similitude coefcient matrix Ee, the (i, j ) element of which is dened as

i j
= (y
i
, s
j
) =

N
k=1
y
i
(k)s
j
(k)

N
k=1
y
2
i
(k)

N
k=1
s
2
j
(k)
(24)
where N is the number of source signals; y
i
, s
j
are the recovered signals and the source
signals respectively. The separation performance is good when there is only one element
closes to one, and the others all close to zero at every row and every column in Ee.
Now, we calculate the Ee between the recovered signals and the source signals in Fig. 7.
Ee =
_
0.9996 0.0059
0.0014 0.9560
_
123
Y. Duan, H. Zhang
0 5000 10000
-1
0
1
16QAM
0 5000 10000
-5
0
5
Broadband-noise
0 5000 10000
-1
0
1
Multi-tone
0 5000 10000
-0.5
0
0.5
BPSK
sampling points
scale
/ V
(a)
-1 -0.5 0 0.5 1
0
100
200
300
16QAM
-4 -2 0 2 4
0
200
400
Broadband-noise
-1 -0.5 0 0.5 1
0
1000
2000
Multi-tone
-0.5 0 0.5
0
1000
2000
BPSK
(b)
-4 -2 0 2 4
0
0.5
1
Broadband-noise
-1.5 -1 -0.5 0 0.5 1 1.5
0
2
4
6
8
Multi-tone
-1.5 -1 -0.5 0 0.5 1 1.5
0
0.5
1
1.5
2
16QAM
-5 0 5
0
0.5
1
1.5
2
BPSK
(c)
Fig. 6 Modeling source signals using MOG. a Time-domain waveforms of the source signals. b Probability
density distribution histograms of the source signals. c Probability density distribution of the estimated source
signals using MOG
123
Noisy BSJS Algorithm Based on VBICA
0 50 100
-0.5
0
0.5
BPSK
0 500 1000
-5
0
5
Multi-tone
0 500 1000
-5
0
5
Observation signal 1
0 500 1000
-5
0
5
Observation signal 2
0 50 100
-2
0
2
BPSK
0 500 1000
-5
0
5
Multi-tone
Scale
/ V
Sampling Points
Fig. 7 Separation performance using VBICA for BPSK under multi-tone jamming signal (JSR=10dB,
SNR=10dB). The rst row plots the time-domain waveforms of sources, the second row plots the ones
of observed signals and the last row plots the time-domain waveforms of recovered signals
0 2 4 6 8 10 12 14
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
SNR/ dB
B
E
R
BSJS algorithm based on VBICA
EASI algorithm
FICA algorithm
JADE algorithm
Fig. 8 The BER of the recovered BPSK signal (JSR=10dB)
The 1st column of Ee denotes the similarity between the recovered BPSK signal and the
source BPSK signal, which is 0.9996 (see the Ee). That means the recovered signal is a good
estimation to the source signal.
123
Y. Duan, H. Zhang
Table 1 The separation running
time of these algorithms in the
same case
Sampling points VBICA/s EASI/s FICA/s JADE/s
1,000 2.34 0.03 0.05 0.01
In Fig. 8, when SNR is more than 9dB, the BER of the recovered BPSK signal by the
proposed algorithmis <10
3
. Comparing with the other three conventional BSS algorithms,
the BERusing VBICAis lower at the same SNR, namely, the noise-robustness of the VBICA
algorithm is stronger than the other three ones. Whereas, the separation running time of
VBICA is further longer (see Table 1). So we must try to reduce its computing complexity
in next work.
3.3 Simulation for 16QAM Under Broadband-Noise Jamming Signal and Analysis
In this section, source communication signal s
1
(t ) is 16QAM signal. Shape lter is raised
cosine lter whose roll-off factor is 0.5. R
b
= 1 kbit/s. f
c
= 10 kHz. Jamming signal J
1
(t )
is broadband- noise whose bandwidth is 5 45 kHz, JSR is 5dB. Mixture matrix A
32
is
generated randomly. Noise is Gaussian noise, and the SNR is 10dB. Equation (2) is used
to create X(t ), f
s
= 100 kHz. Similarly, X(t ) is separated according to Fig. 5, but the pre-
processing would be replaced by quasi-whitening processing [13] in this simulation. The
simulation results are shown in Fig. 9.
Comparing Fig. 9a with c, the waveforms of the recovered signals are almost coinci-
dent with the ones of sources. To calculate the Ee between the sources and the recovered
signals,
Ee =
_
0.0207 0.9405
0.9739 0.0085
_
The similarity between the recovered 16QAM and the source 16QAM is 0.9739 (see the
Ee). That means the recovered signals is a good estimation to the sources. So the VBICA
algorithm achieved the BSJS for the 16QAM under broadband-noise in a certain SNR
case.
3.4 Simulation for 16QAM Under Multi-tone Jamming Signal and Analysis
Simulation parameters and condition are same as Sect. 3.3 except that the jamming signal
is multi-tone jamming signal, f
c1
= 9 kHz, f
c2
= 10 kHz, f
c3
= 11 kHz, JSR is 5dB.
Simulation results are shown in Fig. 10.
The Ee between the sources and the recovered signals is
Ee =
_
0.0539 0.9431
0.9754 0.0205
_
Comparing Fig. 10a with c, we can see that the waveforms of the recovered signals are almost
coincident with the ones of sources clearly. Moreover, the similarity between the recovered
16QAM and the source 16QAM is 0.9754 (see the Ee). So, the recovered signals is a good
estimate to the sources and the VBICA algorithm achieved the BSJS for the 16QAM under
multi-tone jamming signal in a certain SNR case effectively.
123
Noisy BSJS Algorithm Based on VBICA
0 1000 2000 3000
-1
-0.5
0
0.5
1
16QAM
0 1000 2000 3000
-2
-1
0
1
2
Broadband-noise
0 2 4 6
x 10
4
0
10
20
30
0 1 2 3 4 5
x 10
4
0
1
2
3
16QAM Broadband-noise
Sampling Point
Frequency /Hz
Scale
/ V
(a)
0 500 1000 1500 2000 2500 3000
-1
0
1
observation signal 1
0 500 1000 1500 2000 2500 3000
-1
0
1
observation signal 2
0 500 1000 1500 2000 2500 3000
-1
0
1
Sampling Point
observation signal 3
Scale
/ V
(b)
0 1000 2000 3000
-1
0
1
Broadband-noise
0 1000 2000 3000
-2
0
2
16QAM
0 1 2 3 4 5
x 10
4
0
0.5
1
0 2 4 6
x 10
4
0
100
200
16QAM Wideband Noise
Sampling point
Frequency / Hz
Scale
/ V
(c)
Fig. 9 The noisy BSJS based on VBICA for 16QAM under broadband-noise jamming signal (JSR=5dB,
SNR=10dB). a Time and frequency waveforms of sources. b Time-domain waveforms of observed signals.
c Time-domain and frequency-domain waveforms of recovered sources
123
Y. Duan, H. Zhang
0 1000 2000 3000
-1
-0.5
0
0.5
1
16QAM
0 1000 2000 3000
-2
-1
0
1
2
Multi-tone
0 2 4 6
x 10
4
0
5
10
15
0 2 4 6
x 10
4
0
50
100
16QAM
Multi-tone
Sampling Point
Frequency/ Hz
Scale
/V
(a)
0 500 1000 1500 2000 2500 3000
-1
0
1
observation signal 1
0 500 1000 1500 2000 2500 3000
-1
0
1
observation signal 2
0 500 1000 1500 2000 2500 3000
-1
0
1
Sampling Point
observation signal 3
Scale
/ V
(b)
0 1000 2000 3000
-1
0
1
Multi-tone
0 1000 2000 3000
-2
0
2
16QAM
0 2 4 6
x 10
4
0
5
10
15
0 2 4 6
x 10
4
0
20
40
60
Multi-tone 16QAM
Sampling Point
Frequency / Hz
Scale
/ V
(c)
Fig. 10 The noisy BSJS based on VBICA for 16QAM anti multi-tone jamming signal (JSR=5dB,
SNR=10dB). a Time and frequency waveforms of sources. b Time-domain waveforms of observed signals.
c Time-domain and frequency-domain waveforms of recovered signals
123
Noisy BSJS Algorithm Based on VBICA
Table 2 The separation similitude coefcient matrix Ee of these algorithms in the different SNRs case
SNR (dB) Algorithm
Ee
VBICA FICA based on
Gaussian moments
Noise-robust EASI
0
_
0.0191 0.5087
0.8513 0.0501
_ _
0.4138 0.4653
0.462 0.4082
_ _
0.3055 0.4902
0.5762 0.3509
_
2
_
0.0007 0.5903
0.8934 0.0173
_ _
0.5134 0.4699
0.4892 0.5085
_ _
0.4443 0.5252
0.5578 0.4469
_
3
_
0.0157 0.65
0.9165 0.0245
_ _
0.5159 0.5144
0.5255 0.5543
_ _
0.2651 0.6327
0.7766 0.3115
_
5
_
0.0107 0.737
0.9452 0.0201
_ _
0.9448 0.0116
0.0057 0.7369
_ _
0.0926 0.7321
0.9338 0.125
_
7
_
0.0179 0.8155
0.9614 0.0166
_ _
0.9615 0.0637
0.05 0.8118
_ _
0.0875 0.8096
0.9558 0.1076
_
10
_
0.0408 0.8791
0.9791 0.0548
_ _
0.9801 0.0435
0.0382 0.8765
_ _
0.0711 0.8645
0.9783 0.1653
_
In addition, we compare the separation similitude of the VBICA algorithm with other two
noisy BSS algorithms that are noise-robust EASI algorithm [14] and noisy ICA algorithm
based on Gaussian moments [6] in same simulation condition. The simulation parameters
and condition are almost same as Sect. 3.4. Considering the condition that the energies of the
communication signal and jamming signal are almost equal, JSR is 1dB. The Ee is shown
in Table 2.
In Table 2, the similitude coefcient with read in Ee represents the similarity between the
recovered 16QAM and the source 16QAM. We can see that the separation performances of
the three algorithms are better as the SNR is higher. Concerning the anti-noise performance,
the Ees of VBICA have smaller changes than those of other two algorithms when SNR
changes. That is to say, the anti-noise performance of VBICA is more excellent. Besides,
when the SNR is less than 5dB, the separation predominance of VBICA is more obvious.
So VBICA is more effective to solve BSJS problem in lower SNR cases.
4 Conclusions
Aiming at the blind signal-jamming separation problem in noisy communication system,
this paper applies the Variational Bayesian ICA theory, uses MOG to model the sources,
and proposes a noisy BSJS based on VBICA algorithm. Simulation results prove that the
algorithm is effective to solve the BSJS problem in a certain SNR case for BPSK signal
under multi-tone jamming signal and 16QAM signal under broadband-noise or multi-tone
jamming signal. Besides, its anti-noise performance exceeds conventional BSS algorithms
and the other two noisy BSS algorithms. But, some improvements need to be done about its
computing complexity.
Acknowledgments The authors would like to thank the anonymous reviewers for their constructive com-
ments and suggestions. This work is supported in part by Natural Science Foundation of China under Grant
61001106 and National Program on Key Basic Research Project of China under Grant 2009CB320400.
123
Y. Duan, H. Zhang
Appendix A: The Update Equations of the Parameters in VBICA Model
In p

(S|q),

t
i,q
i
=
1

t
i,q
i

i,q
i
_ _

i,q
i
_
+
M

j =1
_

j
_ _
a
j i
_ _
x
j
(t )
_
x
j,k=i
(t )
__

(25)
=

t
i,q
i
=
_

i,q
i
_
+
M

j =1
_

j
_
_
a
2
j i
_
(26)
In p

(q),

t
i,q
i
=
i,q
i
p
i,q
i
(27)

t
i,q
i
=

t
i,q
i

t
i,q

i
(28)

i,q
i
= exp

i,q
i
_

i,q

(29)
p
i,q
i
=
_

i,q
i

t
i,q
i
_1
2
exp
_
1
2
_

t
i,q
i

t
2
i,q
i

_

i,q
i
_
_

2
i,q
i
__
_
(30)

i,q
i
=

b
i,q
i
exp
_

_
c
i,q
i
__
(31)
In (5) and (7),() is Digamma function.
In p

(),
m
i,q
i
=
1

i,q
i
_

i 0
m
i 0
+
_

i,q
i
_
L

t =1

t
i,q
i
_
s
i
(t )|q
t
i
_
_
(32)

i,q
i
=
i 0
+
_

i,q
i
_
L

t =1

t
i,q
i
(33)
In p

(),

b
i,q
i
=
_
1
b
i 0
+
1
2

i,q
i
_
1
(34)
c
i,q
i
= c
i 0
+
1
2
L

t =1

t
i,q
i
(35)

i,q
i
=
L

t =1

t
i,q
i
_
_
s
2
i
(t )|q
t
i
_
2
_

i,q
i
_ _
s
i
(t )|q
t
i
_
+
_

2
i,q
i
__
(36)
123
Noisy BSJS Algorithm Based on VBICA
In p

(A),
m
a
j i
=
_

j
_

j i
L

t =1
s
i
(t )
_
x
j
(t )
_
x
j,k=i
(t )
__
(37)

j i
=
j i
+
_

j
_
L

t =1
_
s
2
i
(t )
_
(38)
s
i
(t ) =
m
i

q
i
=1
p

_
q
t
i
= q
i
_ _
s
i
(t )|q
t
i
_
(39)
_
s
2
i
(t )
_
=
m
i

q
i
=1
p

_
q
t
i
= q
i
_ _
s
2
i
(t )|q
t
i
_
(40)
p

_
q
t
i
= q
i
_
=
t
i,q
i
(41)
_
s
i
(t )|q
t
i
_
=
t
i,q
i
(42)
_
s
2
i
(t )|q
t
i
_
=
_

t
i,q
i
_
2
+
1

t
i,q
i
(43)
In p

(),

b
j
=
_
1
b
j
+
1
2
L

t =1
_
_
x
j
(t ) x
j
(t )
_
2
_
_
1
(44)
c

j
= c

j
+
L
2
(45)
References
1. Shi, X. (2008). Blind signal processingTheory and practice. Shanghai: Shanghai Jiao Tong University.
2. Deng, K., & Jiang, X. (2010). Detection of bio-impedance gastric motility signal based on independent
component analysis. Transducer and Microsystem Technologies, 29(6), 124127.
3. Nesta, F., &Matassoni, M. (2011). Robust automatic speech recognition through on-line semi blind source
extraction. In: CHiME 2011 workshop on machine listening in multisource envirionments.
4. Lu, Y., Li, Z., & Zeng, Y. (2010). Blind separation of machine fault sources based on cohen class time-
frequency analysis. Machine Tool and Hydraulics, 38(7), 134137.
5. Wang, E., Zhang, N., & Meng, W. (2009). A concurrent time-frequency and noise-preteatment methodol-
ogyfor blindsource separationinanadditive white Gaussiannoise channel. Journal of HarbinEngineering
University, 30(4), 390394.
6. Hyvarinen, A. (1999). Fast ICA for noisy data using Gaussian moments. Circuits and Systems. In Pro-
ceedings of the 1999 IEEE international symposium, ISCAS99.
7. Choudrey, R. A. (2002). Variational methods for Bayesian independent component analysis (Doctoral
dissertation, University of Oxford).
8. Bishop, C. (1995). Neural networks for pattern recognition. Oxford: Clarendon Press.
9. Valpola, H. (Coordinator) (2003). BLISS IST-1999-14190, Blind source separation and applications:
Technical report on Bayesian method. Deliverable D17 report version: Final report preparation date: June
27, 2003.
10. Caridso, J.-F., & Laheld, B. H. (1996). Equivariant adaptive source separation. IEEE Transactions of
Signal Processing, 44(12), 30173030.
11. Hyvarinen, A., &Oja, E. (1997). Afast xed-point algorithmfor independent component analysis. Neural
Computation, 9(7), 14831492.
12. Cardoso, J.-F., & Souloumiac, A. (1993). Blind beamforming for non-Gaussian signals. IEE Proceedings
F (Rader and, Signal Processing), 140(6), 362370.
123
Y. Duan, H. Zhang
13. Fu, W., Yang, X., & Liu, N. (2008). Robust algorithm for communication signal blind separation fourth-
order-cumulant-based. Journal of Electronics and Information Technology, 30(8), 18531856.
14. Duan, Y, & Zhang, H. (2011). A noise-robust EASI algorithm for noisy blind interference-signal separa-
tion. In Proceedings of international conference CyberC-2011. Beijing, pp. 535539.
Author Biographies
Yuling Duan received the master degree from Institute of Communi-
cations Engineering, University of Science and Technology, China in
2012. Now, she works as a teacher at Nanjing Artillery College. Ms.
Duans research interests are in the areas of signal processing and esti-
mation theory, and their applications to communication systems.
Hang Zhang has been a professor and Ph.D. supervisor in Institute of
Communications Engineering, University of Science and Technology,
China. Her research interests are in the areas of communication system,
satellite communication technologies and signal processing, especially,
blind signal processing technique.
123