Abstract
This paper and its companion are devoted to the evaluation of the impact of chaos-based techniques on communications systems with asynchronous code division multiple access. Sequences obtained by repeating a truncated and quantized chaotic time series are compared with classical ra-sequences and Gold sequences by means of a performance index taken from communication theory which is here defined and thoroughly discussed. This analysis reveals that, unlike conventional sequences, chaotic spreading codes can be generated for any number of users and allocated bandwidth. Numerical simulations are reported, showing that systems based on chaotic spreading sequences perform generally better than the conventional ones. Some analytical tools easing the comprehension of these advantages are here summarized and proved in Part II where formal arguments are developed and discussed to ensure general applicability of chaotic spreading codes. © 1997 IEEE.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 937-947 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications |
| Volume | 44 |
| Issue number | 10 |
| DOIs | |
| State | Published - Dec 1 1997 |
| Externally published | Yes |
Bibliographical note
Generated from Scopus record by KAUST IRTS on 2023-02-15ASJC Scopus subject areas
- Electrical and Electronic Engineering