Performance of direct-oversampling correlator-type receivers in chaos-based DS-CDMA systems over frequency non-selective fading channels

In this paper, we present a study on the performance of direct-oversampling correlator-type receivers in chaos-based direct-sequence code division multiple access systems over frequency non-selective fading channels. At the input, the received signal is sampled at a sampling rate higher than the chip rate. This oversampling step is used to precisely determine the delayed-signal components from multipath fading channels, which can be combined together by a correlator for the sake of increasing the SNR at its output. The main advantage of using direct-oversampling correlator-type receivers is not only their low energy consumption due to their simple structure, but also their ability to exploit the non-selective fading characteristic of multipath channels to improve the overall system performance in scenarios with limited data speeds and low energy requirements, such as low-rate wireless personal area networks. Mathematical models in discrete-time domain for the conventional transmitting side with multiple access operation, the generalized non-selective Rayleigh fading channel, and the proposed receiver are provided and described. A rough theoretical bit-error-rate (BER) expression is first derived by means of Gaussian approximation. We then define the main component in the expression and build its probability mass function through numerical computation. The final BER estimation is carried out by integrating the rough expression over possible discrete values of the PFM. In order to validate our findings, PC simulation is performed and simulated performance is compared with the corresponding estimated one. Obtained results show that the system performance get better with the increment of the number of paths in the channel.Peer ReviewedPostprint (author's final draft

Analog Network Coding for Multi-User Spread-Spectrum Communication Systems

This work presents another look at an analog network coding scheme for multi-user spread-spectrum communication systems. Our proposed system combines coding and cooperation between a relay and users to boost the throughput and to exploit interference. To this end, each pair of users, $\mathcal{A}$ and $\mathcal{B}$, that communicate with each other via a relay $\mathcal{R}$ shares the same spreading code. The relay has two roles, it synchronizes network transmissions and it broadcasts the combined signals received from users. From user $\mathcal{B}$'s point of view, the signal is decoded, and then, the data transmitted by user $\mathcal{A}$ is recovered by subtracting user $\mathcal{B}$'s own data. We derive the analytical performance of this system for an additive white Gaussian noise channel with the presence of multi-user interference, and we confirm its accuracy by simulation.Comment: 6 pages, 2 figures, to appear at IEEE WCNC'1

Weyl Spreading Sequence Optimizing CDMA

This paper shows an optimal spreading sequence in the Weyl sequence class, which is similar to the set of the Oppermann sequences for asynchronous CDMA systems. Sequences in Weyl sequence class have the desired property that the order of cross-correlation is low. Therefore, sequences in the Weyl sequence class are expected to minimize the inter-symbol interference. We evaluate the upper bound of cross-correlation and odd cross-correlation of spreading sequences in the Weyl sequence class and construct the optimization problem: minimize the upper bound of the absolute values of cross-correlation and odd cross-correlation. Since our optimization problem is convex, we can derive the optimal spreading sequences as the global solution of the problem. We show their signal to interference plus noise ratio (SINR) in a special case. From this result, we propose how the initial elements are assigned, that is, how spreading sequences are assigned to each users. In an asynchronous CDMA system, we also numerically compare our spreading sequences with other ones, the Gold codes, the Oppermann sequences, the optimal Chebyshev spreading sequences and the SP sequences in Bit Error Rate. Our spreading sequence, which yields the global solution, has the highest performance among the other spreading sequences tested

A novel approach to security enhancement of chaotic DSSS systems

In this paper, we propose a novel approach to the enhancement of physical layer security for chaotic direct-sequence spread-spectrum (DSSS) communication systems. The main idea behind our proposal is to vary the symbol period according to the behavior of the chaotic spreading sequence. As a result, the symbol period and the spreading sequence vary chaotically at the same time. This simultaneous variation aims at protecting DSSS-based communication systems from the blind estimation attacks in the detection of the symbol period. Discrete-time models for spreading and despreading schemes are presented and analyzed. Multiple access performance of the proposed technique in the presence of additional white Gaussian noise (AWGN) is determined by computer simulations. The increase in security at the physical layer is also evaluated by numerical results. Obtained results show that our proposed technique can protect the system against attacks based on the detection of the symbol period, even if the intruder has full information on the used chaotic sequence.Peer ReviewedPostprint (author's final draft

Multi user chaotic communication systems sing orthogonal chaotic vectors

Due to quasi orthogonal nature of chaotic spreading sequences, the co-channel interference will be introduced and increases with the increase in number of users and limits the number of simultaneous users transmitting information. In this dissertation the application of orthogonal chaotic vector (OCV) for spreading information bits is presented. The bit error rate of the multi user chaotic communication system is analysed through simulation and analytical expressions. Two main types of communication scenarios are considered, multi user chaotic communication system with coherent receiver and training assisted non coherent multi user chaotic communication system with adaptive receiver. The first case deals with ideal scenario where it is assumed that exact replica of chaotic vector used to spread data is available at the receiver and the information is extracted without synchronisation error. Thus lacks practical realisation but, the results obtained will provide a lower bound for comparison with other practical counter parts. The second scenario deals with more practical approach where a reference chaotic sequence is also transmitted by modulating with training bits so that the chaotic vector required for correlation can be recovered at the receiver

Performance analysis of multiple access chaotic-sequence spread-spectrum communication systems employing parallel interference cancellation detectors

Author name used in this publication: Francis C. M. LauAuthor name used in this publication: Chi K. TseRefereed conference paper2002-2003 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe