Optimum chaotic quantized sequences for asynchronous DS-CDMA system

Author

Vladeanu, Calin

Author_Institution

Telecommun. Dept., “Politeh.” Univ. of Bucharest, Bucharest, Romania

fYear

2005

fDate

4-8 Sept. 2005

Firstpage

1

Lastpage

4

Abstract

Using chaotic sequences for spreading is a new approach for optimising the BER (Bit Error Rate) performances in the DS-CDMA (Direct Sequence - Code Division Multiple Access) systems. This paper presents the use of a very well known family of PWAM (Piece-Wise Affine Markov) maps, namely (n, t) - tailed shifts maps, and their optimum quantized versions. This optimisation involves the variance minimisation for the mean MAI (Multiple Access Interference) term, which minimises also the mean BER under the SGA (Standard Gaussian Approximation) condition.

Keywords

Gaussian processes; Markov processes; code division multiple access; error statistics; minimisation; quantisation (signal); radiofrequency interference; sequences; spread spectrum communication; BER; PWAM maps; SGA condition; asynchronous DS-CDMA system; bit error rate; direct sequence code division multiple access system; mean MAI; multiple access interference; optimum chaotic quantized sequences; piece-wise affine Markov maps; standard Gaussian approximation; tailed shift maps; variance minimisation; Bit error rate; Chaotic communication; Fading; Gold; Interference; Multiaccess communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Conference, 2005 13th European

Conference_Location

Antalya

Print_ISBN

978-160-4238-21-1

Type

conf

Filename

7078303