Header
Home | Sitemap Set as homepage | Add to favorites
  Search the Site     » Advanced Search
Sections



Turbo Multiuser Detection with Unknown Interferers

by

image

Turbo Multiuser Detection with Unknown Interferers

The turbo multiuser detection techniques developed so far assume that the spreading waveforms of all users are known to the receiver. Another important scenario, discussed in Chapter 3, is that the receiver has knowledge of the spreading waveforms of some but not all of the users in a system. Such a situation arises, for example, in a cellular system where the base station receiver knows the spreading waveforms of the in-cell users but not those of the out-of-cell users. In this section we discuss a turbo multiuser detection method that can be applied in the presence of unknown interference, which was first developed in [414].

6.4.1 Signal Model

Consider again the synchronous CDMA signal model (6.27). Here we assume that the spreading waveforms and the received amplitudes of the first graphics/328fig01.gif (graphics/328fig01.gif < K) users are known to the receiver, whereas the rest of the users are unknown to the receiver. Since some of the spreading waveforms are unknown, we cannot form the sufficient statistic (6.32). Instead, as done in Chapters 2 and 3, we sample the received continuous-time signal r(t) at the chip rate to convert it to discrete-time signal. The sample that corresponds to the jth chip of the ith symbol is given by

Equation 6.72

graphics/06equ072.gif


The resulting discrete-time signal corresponding to the ith symbol is then given by

Equation 6.73

graphics/06equ073.gif


Equation 6.74

graphics/06equ074.gif


with

graphics/329equ01.gif

where

Equation 6.75

graphics/06equ075.gif


is a Gaussian random variable; n[i] ~ N(0, s2 IN); sk is the normalized discrete-time spreading waveform of the kth user, with cn,k {+1, –1}; graphics/329fig01.gif; graphics/329fig02.gif; and graphics/329fig03.gif.

Denote by graphics/329fig05.gif the matrix consisting of the first graphics/329fig07.gif columns of S. Denote the remaining graphics/329fig07.gif = Kgraphics/329fig07.gif columns of S by graphics/329fig06.gif. These first graphics/329fig07.gif signature sequences are unknown to the receiver. Let graphics/324fig11.gif be the graphics/329fig07.gif-vector containing the first graphics/329fig07.gif bits of b[i], and let graphics/324fig11.gif contain the remaining graphics/329fig07.gif bits. Then we may write (6.74) as

Equation 6.76

graphics/06equ076.gif


Since we do not have knowledge of graphics/329fig06.gif, we cannot hope to demodulate graphics/324fig11.gif. We therefore write (6.76) as

Equation 6.77

graphics/06equ077.gif


where graphics/329fig04.gif is regarded as an interference term that is to be estimated and removed by the multiuser detector before it computes the a posteriori log-likelihood ratios (LLRs) for the bits in graphics/324fig11.gif.


134 times read

Related news

» HR-DSSS PMD Operation
by admin posted on Apr 30,2007
» DSSS Spreading Sequence
by admin posted on Apr 30,2007
» Next-Generation CDMA Technologies
by admin posted on Jan 10,2007
» EMC: THE PROBLEM
by admin posted on Jul 15,2007


More Top News
Cisco Wireless Networking
Most Popular
Featured Author