Optimal Chaotic Binary Spreading Sequences for Asynchronous CDMA System
Boxi Wu
Abstract
Boxi Wu
Abstract
In order to expand the group of sequences and improve the system performance of asynchronous CDMA communication, study on the characteristic of optimal chaotic sequence is conducted. On this base, some criteria on selecting spreading sequences are proposed and implemented to generate binary chaotic spreading sequences with optimal performance. Numerical simulation and statistical analysis show that these sequences are more adapted for asynchronous CDMA system than conventional Gold sequence.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to expand the group of sequences and improve the system performance of asynchronous CDMA communication, study on the characteristic of optimal chaotic sequence is conducted. On this base, some criteria on selecting spreading sequences are proposed and implemented to generate binary chaotic spreading sequences with optimal performance. Numerical simulation and statistical analysis show that these sequences are more adapted for asynchronous CDMA system than conventional Gold sequence.
Key concepts: Asynchronous communication, Chaotic, Pseudorandom binary sequence, Code division multiple access, Sequence (biology), Gold code, Binary number, Computer science