A new variable step size CMA blind equalization algorithm

Yuan Gao1, Xinyun Qiu2

1. Department of Automation Northeastern University at Qinhuangdao, Qinhuangdao 066004, China

E-mail: gaoyuan0335@126.com
2. Department of Automation Northeastern University at Qinhuangdao, Qinhuangdao 066004, China
E-mail: qiuxinyun@126.com
Abstract: A new variable step size blind equalization algorithm based on a variable step size blind equalization
algorithm in which step size is controlled by auto correlative error signal pointing to problems lie in limiting constant step
size blind equalization algorithm, which momentum term is introduced and momentum term weighted parameter is
adjusted by step size. The new algorithm which has a fast convergence and higher stability can equalize the channel
better by theoretical analysis and simulations.
Key Words: Equalizer, Blind Equalization Algorithm, CMA algorithm, Variable step, Momentum

INTRODUCTION

Blind equalizer is an adaptive equalizer. Equalization is not

by means of input training sequence. It uses only the
statistical properties of the received sequence itself to adjust
the equalizer weights, so that the output sequence is similar
to the sending sequence. Its purpose is to balance the
channel characteristics.
Blind equalization algorithm is the heart of the equalizer.
Godard [1] and Triechiar [2], who proposed CMA blind
equalization algorithm. In the blind equalization algorithm,
CMA is the most widely used. The algorithm is efficient, it
is realized in real time, and it has good convergence
properties. Algorithm cost function only with the amplitude
of the received sequence, which has nothing to do with the
phase, so it is not sensitive to carrier phase. Unknown
channel characteristics in the case, CMA blind equalization
algorithm based on the received sequence only some
statistical properties, they can gradually converge to the
optimal solution. It guarantees that the equalizer can reduce
ISI [3] [4].
Equalization algorithm performance is good or bad to
decide whether it has practical value. Convergence speed
and residual mean square error is a measure of performance
of blind equalization algorithm important indicator of good
or bad [5] [6]. In the iterative process, CMA convergence
speed as the step factor value increases quickly. But the
convergence of the residual mean square error is too large.
Instead, convergence has slowed; the residual mean square
error is smaller [7] [8] [9]. Therefore, the fixed step size is
used, the algorithm's convergence speed and accuracy are
mutually constraining. Adding momentum item, this paper
propose a new variable step-size CMA blind equalization
algorithm based on a variable step size blind equalization
algorithm in which step size is controlled by auto
correlative error signal.

This work is supported by National Nature Science Foundation under

Grant 60904035

c
978-1-4577-2074-1/12/$26.00 2012
IEEE

BLIND EQUALIZATION ALGORITHM OF

CMA

CMA blind equalizer structure is shown in Figure 1. x(n)

is the receiving sequence, which is the transversal filter
input. w(n) is the transversal filter weights. Recovery
sequence s ( n ) is the horizontal filter output, s ( n ) passed
without memory nonlinear estimator, estimated sequence
s ( n ) was obtained. s ( n ) minus s ( n ) is equal to e(n) .

e(n) is error signal. CMA blind equalization algorithm is

inside the dashed border.
x(n)
w(n)

s (n)

LMS

g ()

s (n)

e (n)

Fig 1. the structure diagram of CMA blind equalizer

CMA blind equalization algorithm adjusts equalizer tap

coefficients, and gradually finds the minimum cost function
points. When the cost function is minimized, the algorithm
is convergent, and equalizer tap coefficient is stable around
the optimal value.
The memory less nonlinear estimation function of CMA
blind equalization algorithm is in equation (1).
s (n)
3
g [ s (n)] =
s (n) + R2 s (n) s (n) 1

s (n)

The definition of R is in equation (2). It is a constant.

4
E s ( n)

R2 =
2

E s ( n)

Error signal is in equation (3).

2
e(n) = s (n) R2 s (n)

315

Cost function of algorithm is in equation (4).

1
2 2
J (n) = E R2 s (n)
4

4
Transmit signal power and the equalizer output signal
power is conserved. Therefore, the cost function selection is
reasonable. To replace the expected value of the gradient
with stochastic gradient obtained algorithm iteration
formula. It is in equation (5). is step size factor.
Generally, it is small enough constant.
2
5
w ( n + 1) = w ( n) + s ( n) R2 s ( n) x(n)

According to equation (1) to (5) computer simulation is

done to test step on the convergence speed and the residual
square error. Simulation conditionsInputs are a random
sequence and a white Gaussian noise with SNR of 15dB.
They pass through a typical telephone channel. Transfer
Function of channel is in equation (6). Equalizer order is
2-order. The simulation results are shown in Figure 2.
H1 ( z ) = 0.005 + 0.009 z 1 0.024 z 2 + 0.854 z 3
6
0.218 z 4 + 0.049 z 5 0.016 z 6

0.1

0.06
MSE

THE NEW VARIABLE STEP-SIZE CMA

BLIND EQUALIZATION ALGORITHM

The momentum term is introduced based on The VS-CMA

algorithm to accelerate the convergence and improve the
overall performance of the algorithm, which is the proposed
new variable step size CMA algorithm, referred to as the
NVS-CMA algorithm. The core equation weights expressed
as the following formula:
w ( n + 1) = w ( n) + [ w (n) w (n 1) ] + ( n)e( n)x(n) (10)

Where [ w ( n) w ( n 1) ] is the momentum term [11-13],

is the momentum term parameter.

4.1 Performance Analysis

Suppose the optimal weight is w , the difference between
the filter weights of (n +1) time and n time coefficient
vector is:
11
w (n)=w ( n+1) w ( n)
Equation (11) into (10) is:

1 =0.0005
2 =0.0010

0.08

Therefore, VS-CMA convergence speed is faster than the

fixed step size CMA algorithm, and after convergence the
smaller the remaining steady-state mean square error, the
convergence speed and the convergence precision of the
algorithm are improved. Meanwhile, VS-CMA algorithm is
better than the fixed step size CMA algorithm of
anti-interference ability.

0.04

w (n)= n w (0) + i ( n i )e( n i ) x( n i ) 12

i =1

0.02

When w ( n ) w ( n ) and w ( n ) 0 the necessary

0
0

100

200

300

400

500

n
Fig 2. Convergence curve of the fixed step

The results show that, CMA algorithm with fixed step, the
algorithm convergence speed and convergence precision of
the step-size requirements are contradictory, and can only be
a compromise between the two, which greatly restricted its
application.

THE
STEP-VARIED
CMA
EQUALIZATION ALGORITHM

BLIND

Reference [10] proposed a variable step size CMA

algorithm; step size parameter is the error signal by the
autocorrelation values to adjust, here known as the
VS-CMA algorithm. Iterative equalizer weights are as
follows equations:
2
e( n) = s (n) R2 s ( n) 

w ( n + 1) = w ( n) + ( n)e( n)x(n) 

In equation8, (n) is a variable step size, defined by the
following equation:

(n) = {1 exp
e(n)e(n 1) }

Step of the algorithm is adaptive change, and only on the

input signal has nothing to do with the noise. Scale factor
is used to control the range of (n) , and is used to
control the speed of step changes.

316

condition for convergence of the algorithm is < 1 .

Equation (11) into (10), VS-CMA algorithm weights vector
difference w ( n) were obtained.
13
w ( n) = (n)e(n) x( n)
Comparing (12) and (13) can know that, NVS-CMA
algorithm weights the amount of each adjustment is larger
than VS-CMA algorithm, that is, the number from the
initial weights into the initial reduced, so convergence is
better.
The maximum allowed number of pages is 6.

Analysis of parameters of momentum

Order momentum term parameter is = (1 ( n ) ) , that is,
M

from step control, the NVS-CMA algorithm can be

expressed as:
2
e( n) = s (n) R2 s ( n) 

w ( n + 1) = w ( n) + (1 ( n ) )

[ w (n) w (n 1) ] 

+ ( n ) e( n) x( n)
In the early iterations, step size is large; momentum
parameter is smaller, so the momentum term is weighted by
the weights small. With the increase in the number of
iterations, step size becomes smaller, momentum parameter
increases, weight increases as the weighted momentum term
to accelerate convergence.

2012 24th Chinese Control and Decision Conference (CCDC)

Analysis of parameters of momentum

A simulation conditions: input is a random sequence of zero
mean and variance 1. After a typical telephone channel by
adding Gaussian white noise, SNR is 15dB; the equalizer is
a 2-order; = 0.05 , = 0.35 . The convergences of two
curves are shown in Figure 3.
0.09
VSCMA
NVSCMA

MSE

0.06

0.03

0
0

100

200

300

4000

5000

Fig 3. the convergence of two curves

Results show that, NVS-CMA convergence speed is faster

than the VS-CMA algorithm, and convergence is still
smaller steady-state after the residual mean square error.
Second simulation conditions: SNR is 20dB; = 0.005 ,
= 10 . When the algorithm iterations to 4 000, the channel
parameter sudden changes. Transfer Function of channel is
in equation (14). The convergences of two curves are shown
in Figure 4.
H 2 ( z ) = 0.003 + 0.006 z 1 0.018 z 2 + 0.550 z 3

0.153 z 4 + 0.032 z 5 0.010 z 6
0.

MSE

VSCMA
NVSCMA

0.

0
0

1000

2000

3000

4000

5000

6000

7000

Fig4. the convergence of two curves when the channel parameter sudden
changes

Results show that, NVS-CMA algorithm has a fast track

channel change. Therefore, NVS-CMA algorithm is better
than VS-CMA algorithm.

CONCLUSION

The fixed step-size CMA blind equalization algorithm

convergence speed and convergence precision of the two
properties are interrelated constraints. Based on VS-CMA
algorithm a new variable step-size CMA blind equalization
algorithm is proposed, it is simply called NVS-CMA
algorithm, which momentum term is introduced and
momentum term weighted parameter is adjusted by step size.
Theoretical analysis and computer simulation results show:
NVS-CMA algorithm is compared with the VS-CMA

algorithm, convergence speed is faster, steady-state residual

mean square error is smaller, and has a strong ability to track
time-varying channels.

REFERENCES
[1] D N. Godard, Self-recovering equalization and carrier
tracking in two-dimensional data communication
systems[J], IEEE Trans. Commun., 1980, 28(11), pp.
1867-1875.
[2] J. R. TREICHIAR, B. AGEE, A new approach to multi path
correction of constant modulus signals[J], IEEE Trans.
ASSP, 1983, 31(2), pp. 459-471.
[3] Y. Xiang, Blind source separation based on constant
modulus criterion and signal mutual information[J],
Computers & Electrical Engineering, 2008, 34(5), pp.
416-422.
[4] X. Wang, G. Z. Feng, Performance analysis of RLS linearly
constrained constant modulus algorithm for multiuser
detection[J], Signal Processing, 2009, 89(2), pp. 181-186.
[5] T. S. QIU, H. TANG, D. F. ZHAI, Capture properties of the
generalized CMA in alpha stable noise environment [C],
Seventh International Conference on Signal Processing,
Beijing: International Conference on Signal Processing,
2004, pp. 439-442.
[6] W. RAO, Y. G. HAN, Y. C. GUO, A new family of
combination blind equalization with a new constant modulus
algorithm based on variable slope error function[C],Eighth
International Conference on Signal Processing. Guilin: [s.
n.], 2006, pp. 16-20.
[7] K. ENEMAN, M. MOONEN, Iterated partitioned block
frequency-domain adaptive filtering for acoustic echo
cancellation [J],IEEE Transactions on Speech and Audio
Processing, 2003, 11(2), pp.143-158.
[8] S. A. ATHURALIYA, L. M. GARTH, Quantized CMA
equalization for shaped signal constellations[J], IEEE
Signal Processing Letters, 2004, 11(2), pp.67-70.
[9] N. LI, Y. GUO, L. GUO, Property of the constant modulus
algorithm to capture the weak signal[J],The Journal of
China Universities of Posts and Telecommunications, 2003,
10(1), pp.9-14.
[10] Xinyun QIU Yuan GAO, A step-varied CMA Blind
Equalization Algorithm Based on Autocorrelation of Error
Signal, Proceedings of the 29th Chinese Control
Conference July 29-31, 2010, Beijing, China, pp. 2171-2174.
[11] N. Kalouptsidis, S. Theodoridis, Adaptive system
identification and signal processing algorithms[M],
Englewood Cliffs: Prentice Hall, 1993.
[12] D. Chazan, Y. Medan, U.Shvadron, Noise cancellation for
hearing aids[J], IEEE Trans Acoust, Speech, Signal Process,
1988, 36, pp.1 697-1 705.

[13] M. R. Sambur, Adaptive noise cancelling for speech

signals[J], IEEE Trans Acoust, Speech, Signal
Process, 1978, 26, pp. 419-423.

2012 24th Chinese Control and Decision Conference (CCDC)

317