Prezentace aplikace PowerPoint

1
Sub-Optimum MSF-MUD for CDMA Systems
Dušan Kocur, Jana Cížová, Stanislav
Marchevský Department of Electronics and
Multimedia Communications Faculty of Electrical
Engineering and Informatics Technical University
of Košice, Park Komenského 13, 041 20
Košice Slovak Republic E-mail Dusan.Kocur_at_tuke.sk
, Jana.Cizova_at_tuke.sk, Stanislav.Marchevsky_at_tuke.s
k
2
COST 289 Antalya, July 6-8, 2004
2 of 29
3
2. MSF-MUD receiver

• MSF-MUD is the promising member of the nonlinear
  singlestage multi-user receivers' (NSSMUD)
  family,
• NSS-MUDs approximate the nonlinear boundary of
  the decision regions better than the linear
  receivers,
• the output of the NSS-MUD is taken as the sign of
  the nonlinear transformation of the output of a
  bank of the matched filters (BMF),
• the nonlinear transformation is done by
  multi-channel conventional microstatistic filter
  (M-CMF).

COST 289 Antalya, July 6-8, 2004
3 of 29
4
COST 289 Antalya, July 6-8, 2004
4 of 29
5
3. M-CMF
COST 289 Antalya, July 6-8, 2004
5 of 29
6
3.1 Threshold decomposer
COST 289 Antalya, July 6-8, 2004
6 of 29
7
4. M-CMF and MSF-MUD
COST 289 Antalya, July 6-8, 2004
7 of 29
8
5. The M-CMF design procedure

• minimum meansquare error criterion
• where
• threshold value vector,
• desired signals.

COST 289 Antalya, July 6-8, 2004
8 of 29
9
5. The M-CMF design procedure basic principle
Step 1 threshold values estimation (SC-M, GA-M,
CDF-M). Step 2 optimum coefficients estimation
, ...crosscorrelatio
n vector of the desired signals and the
signals at the output of the TDi,
... crosscorrelation function of the signals at
the output of the TDi , Step 3
evaluation of the cost function of MSF-MUD
(minimum BER).
COST 289 Antalya, July 6-8, 2004
9 of 29
10
6. TD level estimation
COST 289 Antalya, July 6-8, 2004
10 of 29
11
6. TD level estimation (cont.)
COST 289 Antalya, July 6-8, 2004
11 of 29
12
6.1 Scanning method (SC-M)
COST 289 Antalya, July 6-8, 2004
12 of 29
13
6.2 Genetic algorithm based method (GA-M)
COST 289 Antalya, July 6-8, 2004
13 of 29
14
6.3 Method of cumulative distribution function
(CDF-M)
COST 289 Antalya, July 6-8, 2004
14 of 29
15
7. Computer experiments

• synchronous DSCDMA base-band transmission system
  in the AWGN channel,
• first 3 experiments are deal with MSF-MUD design
  procedure,
• next 9 experiments are deal with MSF-MUD
  properties.

15 of 29
COST 289 Antalya, July 6-8, 2004
16
7. Computer experiments (cont.)
Number of users 2
Number of Transmitted bits 1 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Number of threshold levels 4
16 of 29
COST 289 Antalya, July 6-8, 2004
17
7. Computer experiments (cont.)
Number of users 30
Number of transmitted bits 10, 100, 200, 300, 500, 1 000, 2 000, 5 000, 7 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Number of threshold levels 4
17 of 29
COST 289 Antalya, July 6-8, 2004
18
7. Computer experiments (cont.)
Number of users 20
Length of training sequence 300
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Number of threshold levels 4
18 of 29
COST 289 Antalya, July 6-8, 2004
19
7. Computer experiments (cont.)
Number of users 2
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 11
19 of 29
COST 289 Antalya, July 6-8, 2004
20
7. Computer experiments (cont.)
Number of users 10
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 11
20 of 29
COST 289 Antalya, July 6-8, 2004
21
7. Computer experiments (cont.)
Number of users 20
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 11
21 of 29
COST 289 Antalya, July 6-8, 2004
22
7. Computer experiments (cont.)
Number of users 30
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 11
22 of 29
COST 289 Antalya, July 6-8, 2004
23
7. Computer experiments (cont.)
Number of users 1, 2, 5, 7, 10, 20, 30
Number of transmitted bits 10 000, 7 000
Spreading codes Gold
Number of chips for 1 period 31
Eb/No 5 dB
Environment AWGN
Near-far effect 11
23 of 29
COST 289 Antalya, July 6-8, 2004
24
7. Computer experiments (cont.)
Number of users 2
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 0.11
24 of 29
COST 289 Antalya, July 6-8, 2004
25
7. Computer experiments (cont.)
Number of users 5
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 0.11
25 of 29
COST 289 Antalya, July 6-8, 2004
26
7. Computer experiments (cont.)
Number of users 2
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Eb/No 5 dB
Environment AWGN
Near-far effect 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 11
26 of 29
COST 289 Antalya, July 6-8, 2004
27
7. Computer experiments (cont.)
Number of users 5
Number of transmitted bits 10 000
Spreading codes Gold
Number of chips for 1 period 31
Environment AWGN
Near-far effect 11
27 of 29
COST 289 Antalya, July 6-8, 2004
28
8. CONCLUSIONS

• the design procedure of M-CMF and MSF-MUD was
  described.
• Properties
• comparable or lower complexity than other
  non-linear MUD,
• easily rearranged in adaptive or blind
  modifications,
• attractive and promissing for CDMA and advanced
  transmission systems like MC-CDMA.

COST 289 Antalya, July 6-8, 2004
28 of 29
29
THANK YOU FOR YOUR ATTENTION
COST 289 Antalya, July 6-8, 2004
29 of 29