1301

One-shot Linear Decorrelating Detector for Asynchronous

CDMA
M. Peng, Y. J . Guo and S. K. Barton
Telecommunication Research Group
Department of Electronic and Electrical Engineering
Bradford University, UK
Abstract
A one-shot linear decorrelating detector(LDD) for the detec-
tion of asynchronous CDMA is presented. By treating every
user as two independent users and using maximal ratio com-
bining, a bit-by-bit detection is obtained. By applying a
phase estimation algorithm on the output of the one-shot
LDD, it is shown that the proposed detector can be used for
the detection of asynchronous CDMA without the knowledge
of carrier phase of any user. Simulation results show that the
performance of the proposed detector approaches that of the
optimum detector for single user transmission.
1 Introduction
The fundamental limitation of the DS/CDMA system is
the so-called near-far problem, which leads to severe per-
formance degradation for the conventional receiver. In 1986,
Verdu investigated the optimuni maximum-likelihood mul-
tiuser receiver for multiuser communication [l]. Verdus re-
ceiver is near-far resistant, but its complexity is exponen-
tial in the number of active users. Recently much attention
has been given to suboptimal architectures with less com-
plexity. Among many suboptimal detectors proposed, Lupas
and Verdus linear decorrelating detector (LDD) [2] [3] has
attracted wide attention. The LDD achieves the same near-
far resistance as the optimum detector while its complexity
is linear in the number of users.
Although the LDD is much simpler than Verdus optimum
detector, it is still too complicated and will lead to unac-
ceptable detection delay while dealing with asynchronous
CDMA. With sacrifice of data transmission rate, Zheng and
Barton proposed an isolation bit insertion (IBI) LDD [4] to
simplify the implementation and reduce detection delay. An-
other scheme, also proposed by Verdu and Lupas, is called
one-shot LDD [ 5] [ 6] , where the detection of data is based
on the signal observed in one bit length period, called one-
shot window, so the detection of an asynchronous CDMA
is transformed into that of synchronous one. According to
Verdu and Lupass scheme, the one-shot window is syn-
chronised with one of the users, so for a K-user asynchronous
CDMA, a (2K-l)-user synchronous CDMA problem must be
solved for the detection of one user, and a total of K different
0-7803-3336-5196 $5.00 0 1996 IEEE
(2K-l)-user synchronous CDMA problems must be solved for
the detection of the total K users.
In this paper, an improved one-shot LDD scheme is pre-
sented, in which the one-shot window is not synchronised
with any user. By treating every user as two independent
users and using maximal ratio combining, a bit-by-bit de-
tection is obtained. With this approach, the multiuser de-
tection of a K-user asynchronous CDMA is converted into
that of a 2K-user synchronous CDMA. For the LDD and
many other detection schemes, a knowledge of the time de-
lay, the carriers frequency and phase, is normally assumed.
Noncoherent detection has been reported [7] for unknown
carrier phase. In-this paper, by applying a single-user phase
estimation algorithm at each output of the one-shot LDD,
it is shown that the proposed detector can be used for the
coherent detection of asynchronous CDMA without the pre-
knowledge of user phase. Simulation results show that the
performance of the proposed detector approaches that of the
optimum detector for single user transmission.
2 One-shot LDD
Consider a BPSK CDMA system. The received signal can
be expressed as:
N K
r ( t ) = b k ( i ) ~ S k ( t - - i T b - - 7 ; E ) c o s ( 2 . r r f , t +8 k ) +n ( t )
i =O k =l
(1)
where K is the number of total users, N the number of trans-
mitted information bits, Tb the duration of each information
bit, fc the carrier frequency, Pk and 8 k are power and initial
phase of user k, respectively, b k ( i ) is the ith bit of user I C,
n(t) the AWGN with variance a2, and s k ( t ) user ks signa-
ture waveform which satisfies:
and
Si ( t ) dt =1 (3)
The idea of the one-shot LDD is to transform the detection
of asynchronous CDMA into the detection of synchronous
1302
CDMA. Consider the one-shot window as shown in Fig-
ure 1. Each user can be treated as the superposition of two
independent users. For example, user k can be treated as the
superposition of two new users k and k? whose signatures
skf ( t ) and sk ( t ) are defined as:
The fact that Sk(t) has unit energy gives:
pk +pk =1
All new signatures have unit energy. In this paper, it is
also assumed that all new signatures, sk ( t ) and sk (t) (k =
1, 2, ..., K) , are linearly independent. Figure 2 shows an ex-
ample of the decomposition of signature waveforms.
(8)
b - - - - One-shot Window - - - -e - - - - Ooc-shot Window - - - - b
T h
7
... ,
Figure 1: One-shot window for a K-user asynchronous
CDMA.
Defining b k ( - 1 ) =0 (k =1, 2, ..., K) , equation (1) can be
rewritten as:
T ( t ) =xzo xf =i [ bk( i - l ) d m s k f ( t - ZTb) f
b k ( i ) d m s k ( t - iTb)] cos( 2~f ~t +6, ) +n( t )
(9)
Thus the original K-user asynchronous CDMA problem can
be treated as a 2K-user synchronous CDMA problem, on
which a synchronous LDD can be applied.
Let y ( i ) =[ yl t ( i ) , yl ( i ) , ..., yKt (i), y K (i)] represent the
matched filters output at time iTb, where
n
Figure 2: Decomposition of signature waveforms for the one-
shot LDD.
with p =1, 1 , ,.., K , K. Let R represent the correlation
matrix with its element given by:
(11)
n
where p , q =1, l , 2, 2, ..., K, K , and b(i) =[ bl ( i -
1) , b1 ( i ) , b2 (i - 1), b2 (i), .. ., b~ (i - 1), b~ (i)] represent the data
vector, then wehave
(12)
y ( i ) =RWb(i) +n(i )
where W e di ag[ , / n, d f l , ..., ,/SI Ja,
and n(i) is a zero-mean Gaussian K-vector with covariance
matrix equal to a2R.
With z ( i ) =[zl/ (i), zl ( i ) , ..., zK1 (i), z ~ (i)] representing
the LDD output, equation (12) gives
~ ( i ) =R- l y ( i )
a
A
=Wb(i) +n,(i) (13)
where n,(i) =[ n1/ ( i ) , n1( i ) , . . . , nK ( i ) , nK, , ( i ) ] is a noise
vector, whose elements nk and nk-3 are zero-mean Gaussian
noise with variance a 2 <k 1 k and a 2 < k k , respectively, where
< k l k : and <kk are the corresponding diagonal elements of
matrix R-l.
From equation (9), it can be seen that users k and k
in the synchronous CDMA share the power of user k in the
original asynchronous system. Therefore, any detection algo-
rithm based on one single bit period will suffer from the loss
1303
of signal-noise-ratio (SNR). On the other hand, it can also
be seen that for any two consecutive one-shot windows, user
k" in the first carries the same data information as user k' in
the following. Therefore, by combining the outputs of LDD
in two consecutive windows, the SNR loss can be recovered.
Y . ( i l
lI
A'
Figure 3: One-shot LDD for asynchronous CDMA.
Define Z k ( 2 ) as:
(14)
A
z k ( i ) ZZ x ; z k " (i - 1) +x ; z k l (i)
where A; and A; are weighting coefficients to be determined.
From equation (13), wehave:
Zk ( i ) = [A; d s + d z ] b k (2 - 1)
+&nkt ( i ) +&nkx, (i - 1)
(15)
As nkl ( i ) and n k " (i - 1) are independent zero-mean Gaus-
sian noise with variances c r 2 c k l k t and a 2 < k " k " , respectively,
the above two noise items can be represented as one noise
n k ( i ) , which is also zero-mean Gaussian but with variance
By solving an optimization problem, the maximum SNR
C2 [ ( ck' k' +(xk)2";e" k" 1.
in equation (15) is achieved with A; and A; given by:
Accordingly, equation (15) leads to:
where n k has variance 02[* +e], and the maximal
SNR is:
' k r k'
The above SNR is the efficient SNR for the one-shot LDD to
detect the information bits of user k under a CDMA scenario.
The maximum SNR, which can be obtained in the absence
of multiuser interference, is 9. The ratio of the two SNRs
characterises the near-far resistance of the one-shot LDD,
which is:
With the statistic z k ( i ) , the estimate of the data bit b k ( i - 1)
can be obtained:
&k ( i - 1) =s g n [ z k ( i ) ] (20)
This means that the above detector has one bit detection
delay.
From (19), it can be seen that the near-far resistance of
the one-shot LDD is determined by the diagonal elements of
the inverse of the cross-correlation matrix, k / and <k " k " ,
as well as the energy pkf and p k " defined by (6). Generally
speaking, both c k l k ~ and <k"k" are equal or larger than 1.
The larger their values, the less the value of NFR, and the
poorer the performance of the detector. Unfortunately, like
the original LDD [2], an analytic expression of Ck'k' or <k"k"
is very difficult to obtain. Simulation shows that the val-
ues of < k l k l and <k"k" are very close to 1, provided that the
spread-spectrum processing gain is reasonably larger than
the number of users K. The simulation also shows that the
NFR is not sensitive to the position shift of the "window".
This is attributed to the combining scheme used in the de-
tector.
3 One-shot LDD with unknown
phases
In the previous model, a knowledge of users' time delay, car-
rier frequency and phase was assumed. In this section, a
one-shot LDD architecture without a pre-knowledge of phase
is given. I t will be shown that the LDD operates indepen-
dently of user phase, and the phases can be estimated by
conventional single-user algorithms after the LDD and be-
fore detection.
The received signal r ( t ) is first sent to standard IQ demod-
ulator to produce two branches signals. The concise expres-
sion is followed, where a complex variable is used to represent
the signals of the two branches and is labeled by a character
with a symbol on the top. Therefore, the matched filter
outputs of the IQ branches are:
@,(.) 2 / ( i +l ) Tb r( t ) sp( t - iTb)ej2"fctdt
(21)
i Tb
where p =1', l", ..., K' , K" .
Outputs of IQ branches are then sent to a one-shot LDD,
respectively. The architecture of the one-shot LDD here is
similar to that given in section 2 but with a different correla-
tion matrix. The elements of the correlation matrix R' here
is given as:
Tb
.;, = S p ( t ) S q ( t ) d t (22)
where p , q =1' , 1" , 2', 2", ..., K' , K" , the multiplier cos(8, -
8,) in equation (11) has been removed.
1304
Phase & Delay ' 7-k
user 1 0 . 1 ~ 0.12Tb
user 2 0. 3~ 0.25Tb
user 3 - 0.15~ 0.3Tb
user 4 0. 23~ 0.76Tb
user 5 - 0.35~ 0.8Th
Let c'k~,k, and c'k,.kj, represent the diagonal elements Of
matrix (R )-', and let & represent the output of the LDD.
Similar to equation (17), wehave:
z k ( i ) =a[%f F ] b k ( i - 1)eJ ek +6 k (23)
e,, kt Ck" ,"
where Re{fik} and Im{6k} are independent zero-mean
Gaussian noise with variance c2[$k!- +-1.
From statistics zk, the estimation of data bk and phase
0k can be carried out on a single user basis. It is seen that
by using the one-shot LDD, the problem of multiuser phase
estimation has been simplified into that of single user one,
on which many techniques can be employed [8].
In this paper, a decision-feedback algorithm, similar to
that given in [8], is employed for phase estimation. The
estimate of the phase is updated in every bit period and is
based on all the statistics 2, and the estimate of data i&
before:
k l k' c,*. k , l
2-1
ek( i ) =arg [ x gk(j - l)zk(j)] (24)
, 3=1
For the first bit period, the estimate of the phase is carried
out as:
em =arg [%(O)l (25)
(26)
The estimate of data bit is given as:
gk( i - 1) =Sgn[Rte(zk(i)e-3sk(2))]
Power (9/202)(dB)
5
50
10
20
Similar to other phase estimation techniques, the above
method results in an ambiguity of T, but this problem can
be solved by using differentially encoded PSK transmission
(DEPSK) [8].
4 Computer simulation
511-chip Gold codes have been chosen as signatures in the
simulation. The first example is on the one-shot LDD with
known phases. A 5-user CDMA system is simulated. The
parameters of the 5 users are shown in Table 1. Fixing the
powers of noise and users 2, 3, 4 and 5, Figure 4 shows the
bit-error-ratio (BER) curve of user 1 with the change of its
SNR. For comparision, the theoretical BER curve of opti-
mum coherent detection for single user transmission is also
shown in Figure 4 (The two curves are very closely located.).
It can be seen that the performance of the one-shot LDD
is very close to that of the optimum detection with single
user transmission, which is the upper bound of any detec-
tion scheme for CDMA.
The second example is on the near-far resistance of the
proposed detector. Fixing the SNRs of user 1, 2, 4 and 5
and changing the SNR of user 3, the BER of user 1 is tested.
Figure 5 clearly shows the near-far resistance of the proposed
detector.
The third example is on the one-shot LDD without the
knowledge of phases. The parameters of users are the same
Table 1: Parameters of 5 users in the simulation system. The
power of user 1 will be changed during simulations.
0 1 2 3 4 5 6 7 8 9 10
SNRl =1010g(Pl /2i ~~) (dB)
Figure 4: User 1's BER with the change of its own power.
as that shown in Table 1. Differential coding is employed.
Fixing the powers of noise and users 2, 3, 4 and 5, the BER
curve of the user 1 with the change of its SNR is obtained,
based on the phase estimation and one-shot detection tech-
niques described in section 3. The estimates of phases are
updated in every bit period. The converging speed of the
estimate of a phase to its real value depends on the SNR of
the corresponding user. Simulation shows that the estima-
tion error is less than 5O after about 200 bit period time for
SNR=OdB, and about 10 bit period time for SNR=5dB. The
BER curve of user 1 is also shown in Figure 4. From Figure
4, it is observed that the BER for DEPSK approximately
doubles that for BPSK with the same SNR. This is a result
similar to that of single user transmission [8].
5 Conclusion
A one-shot LDD for the detection of asynchronous CDMA
has been investigated. By treating every user as two indepen-
dent users and using maximal ratio combining, a bit-by-bit
detection is obtained. Then by making use of the outputs of
the one-shot LDD and employing a phase estimation tech-
nique, a one-shot LDD without the knowledge of user phase
has been obtained. Computer simulation showed the per-
formance of the proposed detector approaches that of the
optimum detector for single user transmission, which is the
1305
SNRl =8dB
0 10 20 30 40 50 60
SNR3 =1010g(P~/20~) ( dB)
Figure 5: User 1s BER with the change of user 3s power.
upper bound of any detection schemes for CDMA. As the
proposed detector has very good performance but simple ar-
chitecture, it is a promising scheme for practical application.
References
S. Verdu. Minimum probability of error for asynchronous
gaussian multiple-access channels. IEEE Trans. Informa-
tion Theory, IT-3235-96, J an. 1986.
R. Lupas and S. Verdu. Linear multuser detectors for syn-
chronous code-division multiple-access channels. IEEE
Trans. Inform. Theory, IT-35:123-136, J an. 1989.
R. Lupas and S. Verdu. Near-far resistance of multiuser
detectors in asynchronous code-division multiple-access
communications. IEEE Trans. Communications, COM-
38:496-508, April 1990.
F-C. Zheng and S. K. Barton. Near-far resistant
detection of CDMA signals via isolation bit inser-
tion. IEEE Trans. Communications, COM-43:1313-1317,
Feb./ March/April 1995.
S. Verdu. Recent progress an multiyser detection: Ad-
vances in Communication and Consystem, CornCon 88
and Lecture Notes in Control and Information Sciences
Seraes. Springer Verlag, 1988.
Lupas. Near-far resistant linear multiuser detection. Ph.
D. thesis, Dept. Elec. Eng., Princeton Univ., Princeton,
NJ , 1989.
M. Varanasi. Noncoherent detection in asynchronous
multiuser channels. IEEE 13.ans. Inform. Theory, IT-
39:157-176, J an. 1993.
J .G. Proakis. Digital Communications. McGraw-Hill In-
ternational Edition, third edition, 1995.