Chaos codes vs. orthogonal codes for CDMA

Author

Martoyo, I. ; Philip ; Susanto, Adhi ; Wijanto, Eddy ; Kanalebe, Herman ; Gandi, Kuniwati

Author_Institution

Electr. Eng., Universitas Pelita Harapan (UPH), Tangerang, Indonesia

fYear

2010

fDate

17-20 Oct. 2010

Firstpage

189

Lastpage

193

Abstract

Chaos phenomenon is capable of generating chaotic sequences with low crosscorrelation, which can be useful for CDMA spreading. In this paper, simulations are conducted to compare the bit-error-rate (BER) performance of logistic-map based chaos spreading codes with other spreading codes. RAKE receiver and time-invariant multipath channels are used for the simulations. The results show that chaos codes outperform m-sequences and Gold codes. We are also particularly interested in the performance comparison of chaos codes and the orthogonal codes (OVSF), which are commonly used in 3G systems. Although the OVSF codes always outperform the chaos codes in AWGN environment, there are cases with time-invariant multipath channels, in which the BER of the chaos codes are better.

Keywords

code division multiple access; error statistics; orthogonal codes; radio receivers; 3G systems; BER; CDMA; Gold codes; OVSF codes; RAKE receiver; bit-error-rate; chaos codes; chaotic sequences; logistic-map based chaos spreading codes; low crosscorrelation; m-sequences; orthogonal codes; time-invariant multipath channels; AWGN; Bit error rate; Chaotic communication; Correlation; Multiaccess communication; Multipath channels; CDMA; Chaos Theory; OVSF; RAKE; spreading codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Spread Spectrum Techniques and Applications (ISITA), 2010 IEEE 11th International Symposium on

Conference_Location

Taichung

ISSN

1943-7439

Print_ISBN

978-1-4244-6013-7

Electronic_ISBN

1943-7439

Type

conf

DOI

10.1109/ISSSTA.2010.5652316

Filename

5652316