Adaptive Wavelets Neural Networks Based Multiuser Detector

Ling Wang1,Haihong Tao1,Licheng Jiao1,Fang Liu2

1
Key Lab for Radar Signal Processing,Xidian University,
Xi’an,P.R.China,710071
2
School of Computer Science and Technology,Xidian University,
Xi’an, P.R.China,710071
E-mail:wanglingboy@yahoo.com.cn

Abstract
The capacity and performance of Code division multiple access(CDMA) system are
limited by multiple access interference (MAI) and “near-far” problem,the effect on
receivers of which depends on the users’ signatures and the actual detector in the
receiver.A adaptive wavelets neural networks(AWNN) based multiuser detector is
proposed for demodulation of direct sequence CDMA(DS-CDMA) signals in both
synchronous and asynchronous Gaussian channels,the complexity of which only lies on
that of AWNN.The performance analysis of the detector are carried out by Monte Carlo
simulations.The results show it greatly exceeds the matched filter detector and the
multiplayer perceptron based multiuser detector.In addition,it approaches to the
matched filters under single user scenario.
Keywords:DS-CDMA;Multiuser detection;Matched filter;Multiple access interference;
Adaptive wavelets neural networks

1. Introduction
There exist two major obstacles in DS-CDMA systems: MAI and near-far
problem.Originally,a matched filter was proposed for CDMA detection.Although this
detector is the simplest in its implementation and only requires the signature of the
required user,it suffers a large performance degradation when existing sever MAI and
“near-far” problem.Different multiuser detectors(MUD) have been proposed to solve
the two problems.Verdu’s seminal work analyzed optimal multiuser detector[1],but the
complexity of the detector is exponential in the number of users,which rendered the
optimal detector not practical, especially for a large number of users.Since then,many
linear and nonlinear suboptimal detectors have been developed,which are lower than the
optimal one in complexity and are suboptimal in performance[2].Multiuser detection
can be regarded as the problem of system optimization and artificial neural networks
can deal with it well. Artificial neural networks applied to multiuser detection have
been developed[3,4].But these detectors still exist some inherent problems,e.g slower
convergence speed,more difficult choice of bases function,and more probability of
being trapped in local minima.Wavelets show promise for both signal representation
and classification[5,6],both of which can be viewed as feature extraction problems in
which the goal is to find a set of daughter wavelets that either best represent the signal
or best separate various signal classes in the resulting feature space.H. H. Szu proposed
a kind of feedforward adaptive wavelets neural networks[6],parameters of which are
iteratively computed to minimize an energy function for representation or
classfiction.Detection of signals in DS-CDMA systems employing BPSK modulation
can be viewed as classification problem,in which one class is “1” and the other class is
“-1”.In this paper, we propose the adaptive wavelets neural networks based multiuser
detector(AWNNBMUD),which can be applied to synchronous and asynchronous

Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA’03)
0-7695-1957-1/03 $17.00 © 2003 IEEE
 channel model.Due to highly parallel structure and adaptability to system parameters of
AWNN,the detector will prove to be desirable alternative to the optimum and matched
filters for DS-CDMA.

2. Problem statement
Assume that K active users are assigned a finite energy waveform or signature sk (t ) where
t ∈ [0, T ] and the digital modulation technique is BPSK.Users transmit a string of bits by
modulating signatures.The baseband version of the received signal at receiver can be modeled
as
M K
r (t ) = ¦¦ wk bk (i ) sk (t − iT − τ k ) + n(t ) , (1)
i =1 k =1

where wk and τ k are the amplipude and delay respectively, s k (t ) is the signature
waveform(of duration T) which is assumed to have unit energy,the data bk (i) are independent
and equally likely to be –1 or +1,subscript k denotes the kth user,M is the length of data frame,
n(t ) is an additive white Gaussian noise process with zero mean and a two-sided power
spectral density of σ 2 .Without loss of generality,we let 0 ≤ τ 1 ≤ τ 2 ≤ " ≤ τ k ≤ T .For the kth
user,the mathched filter is operated in synchronization with its own symbol interval
[iT + τ k , (i + 1)T + τ k ] and then sampled at time instant t = (i + 1)T + τ k ( i = 0,1,... ),i.e. sampled at
symbol rate. Stacking the output of a bank of K matched filters and the transmitted data bits
into K × 1 vector r (i) = [r1 (i ), r2 (i ),… , rK (i)]T and b(i) = [b1 (i), b2 (i),", bK (i)]T .It has been shown that
the optimal multiuser detector is a nondeterministic polynomial time(NP)-complete problem
[2,3,4] and its calculation complexity is inacceptable in actual systems. Especially in the case
of existence of a lot of users,the classical ergodic searching altorithm will confront the
“exponential expansion” and it can hardly applied in the practical CDMA system.

3. Adaptive wavelets neural networks

3.1. Wavelet Transform,Representation,and Classfication
The wavelets applied to representation and classification usually are functions whose
dilations and translations form an orthogonal basis of L2 ( R) .Let h(t ) ∈ L2 ( R) be the mother
wavelet that satisfies the admissibility condition[5], then the corresponding families of dilated
and translated discrete wavelets are defined by
2
−
{hm , n (t ) = a m
h(a − m t − nc), m, n ∈ '} , (2)
where a and c the dilation and translation parameters respectively.By proper selection of a
and c,discrete daughter wavelets {hm , n (t )} can consitute a group of orthogonal bases of L2 ( R)
which can be constructed according to the theory of multi-resolution analysis. A L2 function
f (t ) can be decomposed
f (t ) = ¦ hm , n , f hm , n (t ) . (3)
m,n

The wavelet transform has good localization property which is very useful for the analysis of
non-stationary signals and the learning of nonlinear functions.It is possible to select a set of
wavelets to get the best representation of f (t ) or classification of the input data for the
network.

3.2. Adaptive Wavelets Neural Networks(AWNN) Classifier and Learning Algorithm

Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA’03)
0-7695-1957-1/03 $17.00 © 2003 IEEE
 Representation and classification can be viewed as feature extraction problems in
which the goal is to find a set of dauthter wavelets that either best represent the signal
or best separate various signal classes in the resulting feature space[6].Specially,the
extraction of features is the inner products of a set of wavelets with the input
signal.And then these features can be input to classifier.The key problem is which
wavelets should be selected and how to select.We consider the following combined
classifier and wavelets feature detector which uses wavelets weights rather than
wavelets nonlinearities of the representation network,whose structure is shown in Fig.1.

x1 h(1,a1,c1) w11 y1
Σ σ

x2 y2
Σ σ

xK yN
Σ σ
h(K,aM,cM) wNM
Fig. 1. Adaptive wavelets neural networks classifier
ªM K § k − cj ·º
yi (t ) = σ « ¦ wij ¦ xk (t )h ¨ ¸¸ » j = 1,..., N , (4)
«¬ j =1 k =1 ¨ aj
© ¹ »¼
where wij, ai,and ci are the weight coefficients, dilations,and translations for each daughter
wavelet which can be optimized by minimizing an energy function, K,M,and N are the node
number of input layer,hidden layer,and output layer respectively, xk (t ) , yi (t ) is the kth input
vector and the ith output vector for networks respectively, wij is weight coefficients, h(t ) is the
mother wavelet function,and σ ( x) = 1/ [1 + exp(− x)] is a sigmoidal function.For compactness,
denoting x(t ) = [ x1 (t ),..., xK (t )]T , y (t ) = [ y1 (t ),..., yN (t )]T , a = [ a1 ,..., aM ] , c = [ c1 ,..., cM ]
T T
,
ª w11 " w1M º ª h(1, a1 , c1 ) " h( K , a1 , c1 ) º
§ k − cj · « » « »
h( k , a j , c j ) = h ¨ ¸¸ , W=« # » ,and H = « h(1, a2 , c2 ) " h( K , a2 , c2 ) » ,we can
¨ a
© j ¹ «¬ wN 1 " wNM »¼ «¬ h(1, aM , cM ) " h( K , aM , cM ) »¼
get y (t ) = σ ( WHx(t )) .Once we obtain parameters of AWNN by training,the two layers are
changed into one because nonlinearity does not exist between the layers. The wavelets
network classifier parameters W,a and c can be optimized by minimizing the Least-mean-
squares(LMS) energy function
1 P N
¦¦ ( diq − yiq ) ,
2
E= (5)
2 q =1 i =1
where P is the number of the training samples, diq is the desired value of yiq .We use
h(t ) = cos(1.75t ) exp(−t 2 / 2) as mother wavelet for classfication.It can be proved that this
function confirms the frame condition.Let t ′ = (k − c j ) / a j ,then the gradients of E are
∂E P N
§ K ·
g ( wij ) = = −¦¦ ( diq − yiq ) yi (1 − yi ) wij ¨ ¦ xk cos(1.75t ′) exp(−t ′2 / 2) ¸ , (6)
∂wij q =1 i =1 © k =1 ¹
∂E P N K
g (c j ) = = −¦¦ (d iq − yiq ) yi (1 − yi ) wij ¦ xk ⋅ ,
∂c j q =1 i =1 k =1

{ª¬1.75sin(1.75t ′) exp(−t ′ 2
/ 2) + cos(1.75t ′) exp(−t ′ / 2) º¼ t ′ / a j } (7)

Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA’03)
0-7695-1957-1/03 $17.00 © 2003 IEEE
 ∂E
g (a j ) = = t ′g (c j ) . (8)
∂a j
We use conventional conjugate gradient method to minimize E.Let n denotes the nth iteration;
g ( W (i,:)T ) = [ g ( wi1 ),..., g ( wiM )]T , g (c) = [ g (c j ),..., g (cM )]T and g (a) = [ g (a1 ),..., g (aM )]T are
gradient column vectors; z ( W(i,:)T ) , z (a) and z (c) are search directions for W(i,:)T , a and c
respectively.Iteration procedure can be described as following:
Step 1:if n is multiple of K(dimension number of input signal to AWNN) then
­ z ( W (i,:)T ) n = − g ( W (i,:)T ) n ­ z ( W (i,:)T ) n = − g ( W (i,:)T ) n + α ( g ( W (i,:)T ) n ) z ( W (i,:)T ) n −1
° °
® z (a) = − g (a)
n n
else ® z (a)n = − g (a)n + α ( g (a) n ) z (a) n −1
° z (c) n = − g (c) n ° z (c) n = − g (c) n + α ( g (c) n ) z (c) n −1
¯ ¯
2 2
where α ( g ( v) n ) = g ( v) n / g ( v)n −1 ( v is a column vector.)
­( W(i,:)T ) n +1 = ( W(i,:)T ) n + λin z ( W (i,:)T ) n , i = 1,..., N
°
Step 2: ®a n +1 = a n + λ (a) z (a) n
° c n +1 = cn + λ (c) z (c) n
¯

where λin , λ (a) ,and λ (c) are variable step-size.

4. AWNN based multiuser detector

The optimal detection is the problem of combinatorial optimization[2].Many researchers
on neural networks show that neural networks can solve the problem excellently and is easy
to implement by ASIC.The application of adaptive wavelets neural networks to multiuser
detection is considered.Adaptive wavelets neural networks are highly interconnected
networks of relatively simple processing units which operate in parallel.The massive
parallelism of neural nets and their robustness to the characteristics of the problems under
consideration make them desirable for solving various complex tasks.The AWNN contains
the nonlinearity of wavelets function in the artificial neurons rather than that of the standard
sigmoidal function.Thus the structure of the AWNN is simple.We consider the suboptimum
detector in Fig.2 that employ the AWNN for approximating a solution to the optimal
detector[2],where the output from matched filters are properly delayed so that the inputs to
the AWNN are in a synchronous mode.The input vector to the AWNN is the output vector
from K matched filters r (i ) = [r1 (i), r2 (i ),… , rK (i )]T ,while the output vector from the AWNN is
estimation of the bits vector b(i) = [b1 (i), b2 (i),", bK (i)]T transmitted by users.

(i + 1)T + τ 1
matched
Down
bˆ1 (i)
Adaptive wavelet neural

filter z − ( τ K − τ1 )
Converter
#1

(i + 1)T + τ 2
matched
networks

filter z − ( τ K − τ2 ) bˆ2 (i )
#2

(i + 1)T + τ K
matched
filter z
0
bˆK (i )
#K

Fig. 2. Structure of multiuser detector based on AWNN

5. Simulation examples and performance analysis

Several simulation examples are presented to illustrate the excellent performance of
the AWNN based MUD(AWNNBMUD) by comparing that of matched

Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA’03)
0-7695-1957-1/03 $17.00 © 2003 IEEE
 filters(MF),multiplayer perceptrons based MUD(MLPBMUD)[3],and the matched filter
under single user scenario,i.e. single user bounds(SUB).Since exact analysis of the bit
error probabilities for arbitrary neural networks receivers is analytically intractable,we
consider Monte Carlo simulatins.In all simulations,the signature waveform of each user
is Gold sequence whose length is 31. Define the signal-to-noise ratio of user k as
SNRk = wk / σ 2 .We employ 80 bits for training of the AWNN.The interesting user is user
1 while all other users in system are the interfering users.Let SNRE =SNR1,SNRI=SNR2~10.
The delay of each user in asynchronous is generated randomly between 0 and 31,and
keep unchanged in all simulation.
Example 1: The convergence performance of the AWNNBMUD of the synchronous and
asynchronous system with 8 users is simulated in this example.It is shown in Fig. 3.The SNR
of the interesting user and all interfering users are 10dB and 19dB respectively.The x-axis and
1 P
¦ ( d1q − y1q ) of the
2
the y-axis denote the iteration number and the total error energy E1 =
2 q =1
first output net of AWNN respectively.AWNNBMUD converge at the steady state and the
precision of the network is very high after 150 iteration.

16

14

12
Total error energy of
the first output net

10

6
asynchronous
4 synchronous

0
0 100 200 300 400 500 600 700 800 900 1000
Number of iteration

Fig.3 Convergence performance of AWNNBMUD

Example 2: In this example, we illustrate the average bit error rate (BER) performance of the
synchronous system with 10 users,shown in Fig.4.In Fig. 4(a), SNRI =19dB,while SNRE
changes from 1dB to 12dB.In Fig.4(b), SNRE =9dB,while SNRI change from 13dB to 23dB,i.e.
the range of the “near-far” effect E k / E1 is from 4dB to 14dB.The number of the hidden layer
of the AWNN is 15.From these two figures, it is clear that there is a performance degradation
between MF and SUB due to the MAI.Using AWNNBMUD greatly improves the
performance of the demodulated data error,especially at high SNR.
0 -1
10 10

-1
10

-2 -2 MF
10 10 MLPBMUD
AWNNBMUD
BER
BER

-3
10

MF
-4
10 MLPBMUD -3
10
AWNNBMUD
SUB
-5
10

-6 -4
10 10
0 2 4 6 8 10 12 4 5 6 7 8 9 10 11 12 13 14
SNRE ( dB) SNRI − SNRE (dB)

(a) (b)
Fig.4. Bit error rate performance of the synchronous system with 10 users

Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA’03)
0-7695-1957-1/03 $17.00 © 2003 IEEE
 Example 3: In this example, we illustrate the average BER performance in asynchronous
system with 8 users,shown in Fig. 5. In Fig. 5(a), SNRI =19dB,while SNRE changes from 0dB
to 14dB.In Fig.5(b), SNRE =11dB,while SNRI change from 13dB to 21dB,i.e. the range of the
“near-far” effect E k / E1 is from 2dB to 10dB.The number of the hidden layer of the AWNN is
15.From example 2 and example 3,there is a performance degradation due to
asynchronism,but the BER performance of the AWNNBMUD is still better than that of the
MF and MLPBMUD.
0 0
10 10

-1
10 MF
-1
MLPBMUD
10 AWNNBMUD
-2
10

-3

BER
BER

10 -2
10

-4 MF
10 MLPBMUD
AWNNBMUD -3
SUB 10
-5
10

-6
10 -4
0 2 4 6 8 10 12 14 10
2 3 4 5 6 7 8 9 10
SNR (dB) SNRI − SNRE (dB)

(a) (b)
Fig.5. Bit error rate performance of the asynchronous system with 8 users

6. Conclusion
A novel multiuser detectors based on adaptive wavelets neural networks,which can
be applied in synchronous and asynchronous system,have been presented in this paper.
Wavelets parameters and shapes are adaptively computed to minimize and energy
function.The advantage of using the neural networks is that the localizing characteristic
of the wavelets makes the efficient estimation of regression functions.The structure of
the multiuser detector is simple and the complexity of the detector only lies on that of
wavelets networks.It offers significant performance improvement over the MF, the
MLPBMUD,and approaches to the single user bounds.The simulation results have
shown that the proposed detectors can suppress the MAI and solve the “near-far”
problem effectively. And it can converge rapidly.

References
[1] S. Verdu,“Optimum multiuser asymptotic efficiency,” IEEE Trans. COM , vol.34,Sept. 1986, pp. 890-
897
[2] S.Verdu,“Computational complexity of multiuser detection,”Algorithmica,vol.38,1989,pp.406-508.
[3] B. Aazhang,et al,“Neural networks for multiuser detection in CDMA communications,” IEEE Trans.
COM ,vol. 40,no. 7,July 1992,pp. 1212-1222.
[4] G. Kechriotis, et al,“Hopfield neural network implementation of the optimal CDMA multiuser
detector,” IEEE Trans. NN ,vol. 7,no. 1,Jan. 1996,pp. 131-141.
[5] I. Daubechies,“The wavelet transform,time-frequency localization and signal analysis,” IEEE Trans.
IT ,vol. 36,no. 9,1990,pp.961-1054.
[6] H. H. Szu, et al, “Neural network adaptive wavelets for signal representation and classification,”
Optical Engineering ,vol. 31,no. 9,Sep. 1992,pp.1907-1916.
[7] J. Zhang, et al , “Wavelet neural networks for function learning,” IEEE Trans. SP ,vol.43,no.6,July
1995,pp.1485-1496.

Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA’03)
0-7695-1957-1/03 $17.00 © 2003 IEEE