Oversampled chaotic map binary sequences: definition, performance and realization

Author

Zhang, Hongtao ; Guo, Jichang ; Wang, Huiyun ; Ding, Runtao ; Chen, Wai-Kai

Author_Institution

Sch. of Electron. Inf. Eng., Tianjin Univ., China

fYear

2000

fDate

2000

Firstpage

618

Lastpage

621

Abstract

Based on chaotic maps, a simple method is given for obtaining the novel oversampled chaotic map (OSCM) binary sequences. Such sequences are a priori to chaotic map sequences in terms of the security. Furthermore, their balance property is optimal, the correlation properties of the two families are not clearly different, and the generation is easy. Hence, pseudonoise (PN) sequences based on OSCM are good candidates for spreading sequences of CDMA or W-CDMA,, especially for secure communications

Keywords

binary sequences; chaos; code division multiple access; pseudonoise codes; security of data; telecommunication security; CDMA; PN sequences; W-CDMA; correlation properties; data security; optimal balance property; oversampled chaotic map binary sequences; pseudonoise sequences; secure communications; sequence generation; spreading sequences; Binary sequences; Chaos; Chaotic communication; Chebyshev approximation; Equations; Logic; Multiaccess communication; Sampling methods; Security; Trajectory;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2000. IEEE APCCAS 2000. The 2000 IEEE Asia-Pacific Conference on

Conference_Location

Tianjin

Print_ISBN

0-7803-6253-5

Type

conf

DOI

10.1109/APCCAS.2000.913577

Filename

913577