Asynchronous Direct-sequence Code-division Multiple Access Research Articles

Multicarrier DS-CDMA System Under Fast Rician Fading and Partial-Time Partial-Band Jamming

The impact of joint partial-time, partial-band jamming on a multicarrier (MC) asynchronous direct-sequence code-division multiple access (DS-CDMA) system in a fast fading environment is studied in conjunction with two different subcarrier combining and decoding schemes. An easy-to-evaluate upper bound using the Chernoff bound is provided and compared to simulation results. Simulation results suggest that for soft-decision decoding systems, under Rayleigh fading, full-time, full-band jamming is most effective. In contrast to the Rayleigh case, when a sufficiently strong line-of-sight component exists in the channel, the jammer’s optimal strategy of attacking in time or frequency depends on the strength and the type of error correction that the system is deploying for that dimension. For hard-decision decoding systems, in Rayleigh fading, partial-band jamming is recommended. For the coding strategies examined, in Rician fading, the jammer should switch from full-time, partial-band jamming to a strategy that jams a higher percentage of the more heavily protected dimension as the jamming power increases. Furthermore, for AWGN channels, the results from the system show that the jammer should always jam a higher percentage of the more heavily protected dimension.

Improving performance of DS-CDMA systems using chaotic complex Bernoulli spreading codes

The most important goal of spreading spectrum communication system is to protect communication signals against interference and exploitation of information by unintended listeners. In fact, low probability of detection and low probability of intercept are two important parameters to increase the performance of the system. In Direct Sequence Code Division Multiple Access (DS-CDMA) systems, these properties are achieved by multiplying the data information in spreading sequences. Chaotic sequences, with their particular properties, have numerous applications in constructing spreading codes. Using one-dimensional Bernoulli chaotic sequence as spreading code is proposed in literature previously. The main feature of this sequence is its negative auto-correlation at lag of 1, which with proper design, leads to increase in efficiency of the communication system based on these codes. On the other hand, employing the complex chaotic sequences as spreading sequence also has been discussed in several papers. In this paper, use of two-dimensional Bernoulli chaotic sequences is proposed as spreading codes. The performance of a multi-user synchronous and asynchronous DS-CDMA system will be evaluated by applying these sequences under Additive White Gaussian Noise (AWGN) and fading channel. Simulation results indicate improvement of the performance in comparison with conventional spreading codes like Gold codes as well as similar complex chaotic spreading sequences. Similar to one-dimensional Bernoulli chaotic sequences, the proposed sequences also have negative auto-correlation. Besides, construction of complex sequences with lower average cross-correlation is possible with the proposed method.

Dual‐antenna‐based blind joint hostile jamming cancellation and multi‐user detection for uplink of asynchronous direct‐sequence code‐division multiple access systems

The authors investigate the problem of blind multi-user detection (MUD) for uplink of asynchronous direct-sequence code-division multiple access (DS-CDMA) systems with hostile jamming. To cope with the lack of prior knowledge of spread signals, hostile jamming and channel state information, the authors propose a scheme based on blind source separation (BSS) to solve this problem. Dual receive antennas are used in the proposed scheme. By exploiting the structure of the two received signals, a BSS model with dependent sources is formed, and then blind hostile jamming cancellation and MUD are obtained by solving this BSS problem. The proposed scheme does not require to know any information about the hostile jamming, and can work well under multiple kinds of hostile jamming. Simulation results further demonstrate that if such proposed approach is used to cancel hostile jamming and make MUD, then the bit-error-rate performance can be substantially improved as compared with earlier detectors.

Analysis of Asynchronous Band-Limited DS-CDMA with MMSE Multiuser Detector over Generalized-k Fading Channels

In this paper, we investigate bit-error-rate (BER) performance of a minimum mean-squared error (MMSE) multiuser receiver for asynchronous band-limited direct- sequence code-division multiple-access (DS-CDMA) systems. We focus on the BER performance in the presence of multitone jamming (MTJ) over frequency-selective multipath fading channels. We consider the generalized-K fading model in our analysis, as it can model a large spectrum of fading-channel characteristics. We also analyze the effects of band- limited pulse shape on the BER performance of the system. Multipath diversity based on the maximal-ratio combining (MRC) scheme is employed to combat fading effects. Our analytical expressions are valid for arbitrary diversity levels and fading parameters. Spectrum raised cosine (SRC) and Beaulieu---Tan---Damen (BTD) pulse shapes are employed for numerical analysis. Numerical results show that in the presence of MTJ and under various channel conditions, the MMSE based receiver gives better BER performance than the one without it. Moreover, the system with BTD pulses outperforms the one with SRC pulses.

Analysis of BPSK modulated asynchronous band-limited DS-CDMA systems with diversity receivers over Generalised-K fading channels

The authors studied bit-error rate (BER) performance of asynchronous band-limited direct-sequence code-division multiple-access (DS-CDMA) systems with various diversity-combining receivers over Generalised-K fading channels. The effects of band-limited pulse shapes, multitone jamming, multiple-access interference as well as both flat and frequency-selective fading are considered. The Generalised-K model is adopted in order to include the effects of shadowing and fading of a wireless channel. The authors consider binary phase-shift keying as the modulation technique. The analytical expressions are valid for any arbitrary value of Generalised-K distribution parameters. Two types of band-limited pulses, namely spectrum raised cosine and Beaulieu–Tan–Damen (BTD) pulses, are incorporated in the analysis. Numerical results show that the system with BTD pulse outperforms the one with SRC pulse for various diversity-combining receivers under various channel conditions. Furthermore, by incorporating a minimum mean-square error stage in the multipath diversity receiver, the BER performance can be further improved.

Asynchronous, Decentralized DS-CDMA Using Feedback-Controlled Spreading Sequences for Time-Dispersive Channels

We propose a novel asynchronous direct-sequence codedivision multiple access (DS-CDMA) using feedback-controlled spreading sequences (FCSSs) (FCSS/DS-CDMA). At the receiver of FCSS/DS-CDMA, the code-orthogonalizing filter (COF) produces a spreading sequence, and the receiver returns the spreading sequence to the transmitter. Then the transmitter uses the spreading sequence as its updated version. The performance of FCSS/DS-CDMA is evaluated over time-dispersive channels. The results indicate that FCSS/DS-CDMA greatly suppresses both the intersymbol interference (ISI) and multiple access interference (MAI) over time-invariant channels. FCSS/DS-CDMA is applicable to the decentralized multiple access.

Minimum probability of error-based adaptive multiuser decision feedback detection

For synchronous direct-sequence code-division multiple access (DS-CDMA) systems, a new criterion based on minimum probability of error (MPE) is proposed for designing decision feedback detectors (DFDs) instead of the conventional minimum mean-squared error criterion. The MPE criterion-based DFD (MPEDFD) tries to minimize the average/conditional probability of error adaptively. Study of bit-error rate and convergence performance shows that the MPEDFDs work pretty well after a short training sequence. Moreover, the modified MPEDFD is applicable for the asynchronous DS-CDMA systems with multipath.

Precise analysis of bit-error probability for asynchronous multicode DS-CDMA systems

A precise bit-error probability (BEP) analysis method is derived for a multicode direct-sequence code-division multiple-access (DS-CDMA) system in an additive white Gaussian noise channel. The method is applicable to a multicode DS-CDMA system with an arbitrary number of multiple code sequences, and any selection of multiple code sequences. The precise method gives results that discriminate the effect of the selection of different multiple code sequences on the BEP, whereas Gaussian approximations (GAs) do not. Thus, the new method can be used to select the best multicode set for a given system, a task that cannot be achieved using GAs. A two-step analytical procedure enables deriving an explicit, compact form for the CF of the receiver decision statistic in a DS-CDMA system with an arbitrary number of multiple code sequences, and for any selection of multiple code sequences.

Simplified group interference cancelling for asynchronous DS-CDMA

A simplified group interference cancelling (IC) approach is investigated for asynchronous direct-sequence code-division multiple access on flat fading channels. The technique employs grouping by estimated signal-to-noise-plus-interference ratio (SNIR), and interference cancellation is performed blockwise, for a subset of the total number of users. We consider long random spreading codes, and include the effects of imperfect amplitude, carrier phase, and delay estimation. Performance of the technique shows SNIR gains of several dB, and concomitant improvements in error probability, with lower computational complexity than that of parallel or serial interference cancelling techniques. We also show that our SNIR expressions are applicable to both the AWGN and flat fading channels, and for moderate near–far conditions. In addition, we determine optimal group sizes for our technique, where optimality is in terms of average error probability over all users. Copyright © 2006 John Wiley & Sons, Ltd.

Performance Improvement of MAI Cancellation in Fading DS/CDMA Channels

In this paper, we propose a single-user strategy for demodulating asynchronous direct-sequence code-division multiple access (DS/CDMA) signals for improving the performance of the adaptive receiver in fast fading channels. Since the adaptive receiver depends on the channel coefficient of all users, it cannot be implemented adaptively in fading channels due to severe tracking problem. A proposed adaptive receiver based on the modified minimum mean-squared-error (MMSE) criterion is used for solving this problem. By simulation, it is verified that our proposal is a promising method to solve the problem, and the results show that the proposed adaptive receiver has substantially larger capacity than the conventional adaptive receiver in fast fading channels.

Accurate computation of bit error probabilities of band-limited asynchronous DS-CDMA systems using higher order moments

An existing method called the simplified improved Gaussian approximation (SIGA) was previously applied to compute the bit error probabilities (BEPs) of band-limited asynchronous direct sequence code division multiple access (DS-CDMA) systems employing general pulse shaping (IEEE Trans. Commun., vol. 50, p. 656, 2002). The SIGA method uses moments up to the second order and is more accurate than the standard Gaussian approximation (SGA) (IEEE Trans. Commun., vol. 50, p. 656, 2002). In this paper, a new method that uses moments up to the fourth order is proposed for computing the BEP. The method is derived from a five-point Chebyshev interpolation formula and is inherently more accurate than the SIGA. Like the SIGA, the new method requires the evaluation of only closed-form expressions and the error function. The new method achieves higher accuracy with a modest increase in computational complexity.

A Theoretical Evaluation of Parallel Interference Cancellation in M-Ary Orthogonal Modulated Asynchronous DS-CDMA System Over Multipath Rayleigh Fading Channels

In this paper, we tackle the problem of theoretical evaluation for the multistage parallel interference cancellation (PIC) scheme in a direct-sequence code division multiple access (DS-CDMA) system with orthogonal modulation and long scrambling codes. The studied system operates on the reverse link in a time varying multipath Rayleigh fading channel. By applying the Central Limit Theorem and some other approximations to multiple access interference (MAI) and intersymbol interference (ISI), as well as assuming identically distributed chips from a single interferer, the bit error rate (BER) performance of the PIC scheme at any stage can be recursively computed from the signal-to-noise ratio, number of users, the number of path per user, processing gain of the CDMA system, and the average received power of each path. For completeness, the BER expression is derived for chip synchronous and chip asynchronous systems over both equal and unequal power multipath channels. The proposed analysis is validated by the Monte Carlo simulations and proved to be reasonably accurate, and it gives insight into the performance and capacity one can expect from PIC-based receivers under different situations. For instance, the analytical results can be used to examine the convergence property, multipath diversity gains, and near-far resistance of the PIC scheme.

Analysis of beamformer configurations for DS-CDMA systems

Two different beamformer configurations for the base station receiver in direct-sequence code-division multiple access (DS-CDMA) systems, namely, a chip-based and a symbol-based configuration, are studied. In the chip-based configuration, different interfering components are rejected based on the spatial distribution of their power. In the symbol-based configuration, spatial diversity is exploited after despreading and different interfering components are rejected based on their interfering strength, which depends on both their power and code correlation with the signal of interest. For the symbol-based configuration, more effort is applied to rejecting the interfering components with higher interfering strength, and thus, a more selective and efficient system is achieved. Detailed performance analysis and simulations show that in the presence of multiple-access interference, the symbol-based configuration can lead to a significant improvement in the signal-to-interference-plus-noise ratio relative to that achieved with the chip-based configuration for both asynchronous and synchronous DS-CDMA systems.

Effects of Array Weight Errors on Interference Cancellation Receiver in Uplink Synchronous and Asynchronous DS-CDMA Systems

This paper investigates the impacts of array weight errors (AWE) in an antenna array (AA) on a parallel interference cancellation (PIC) receiver in uplink synchronous and asynchronous direct sequence code division multiple access (DS-CDMA) systems. The performance degradation due to an AWE, which is approximated by a Gaussian distributed random variable, is estimated as a function of the variance of the AWE. Theoretical analysis, confirmed by simulation, demonstrates the tradeoffs encountered between system parameters such as the number of antennas and the variance of the AWE in terms of the achievable average bit error rate and the user capacity. Numerical results show that the performance of the PIC with the AA in the DS-CDMA uplink is sensitive to the AWE. However, either a larger number of antennas or uplink synchronous transmissions have the potential of reducing the overall sensitivity, and thus improving its performance.

On the Ultimate Limits of Chaos-Based Asynchronous DS-CDMA—I: Basic Definitions and Results

The ultimate limits of chaos-based asynchronous direct-sequence code-division multiple access systems are investigated using the concept of capacity taken from information theory. To this aim, we model the spreading at the transmitter and the sampling of the incoming signal at the receiver with a unique linear multi-input multi-output transfer function. We then assume the existence of a coding/decoding pair that is able to transmit information through this channel with a vanishing error probability. The capacity of the system is then identified with the maximum rate at which such an errorless link may operate. The capacity is a random quantity depending on the spreading sequences and, due to the asynchronism, on the users relative delays and phases. We then compare different spreading strategies [classical m and Gold codes, independent identically distributed (i.i.d.) and chaos-based codes] in terms of expected performance as well as of the probability that one method outperforms another. To ease further analytical investigations that should cope with expectations of logarithms, we measure capacity not only in bits per use but also in codewords per use. Some formal results along with extensive numerical evidence show that this does not alter the performance ranking. Such a ranking shows that chaos-based spreading always outperforms i.i.d. spreading and those trying to mimic it. This aligns with and complements what was already known about the ability of chaos-based techniques of minimizing multiple access interference.

On the Ultimate Limits of Chaos-Based Asynchronous DS-CDMA—II: Analytical Results and Asymptotics

The ultimate limits of chaos-based asynchronous direct-sequence code-division multiple access systems are investigated using the concept of capacity taken from information theory. To this aim, we model the spreading at the transmitter and the sampling of the incoming signal at the receiver with a unique linear multi-input multi-output transfer function depending on spreading sequences and on the users relative delays and phases. The capacity can be computed using a known formula and is a random quantity depending on the process generating the spreading codes and on the delays and phases that are random in asynchronous environments. In the companion paper, we show that chaos-based spreading is able to outperform classical spreading in most cases. We delve here into analytical investigations aimed at clarifying such phenomena and show that chaos-based spreading is actually able to reach the absolute maximum performance in the classical two-user case as well as when the number of users and the spreading factor grow to infinity. Under suitable conditions, and in complete analogy with what happens for suboptimal receivers dominated by multiple-access interference, maximum capacity is attained by spreading sequences whose auto-correlation profile is well approximated by an exponential trend with rate r-=-2+/spl radic/3.

Space-Time Adaptive Reduced-Rank Multistage Wiener Filtering for Asynchronous DS-CDMA

An adaptive near-far resistant self-synchronizing receiver for asynchronous direct-sequence (DS) code-division multiple access (CDMA) systems with a J-element antenna array is presented in this paper. The primary requirement is prior knowledge of the spreading-code sequence of the desired user. A low-complexity version of the proposed receiver is developed that utilizes the concept of the reduced-rank multistage Wiener filter (MWF) introduced recently by Goldstein and Reed. This results in a self-synchronizing detection criterion that requires no inversion or eigen-decomposition of a covariance matrix. It also achieves a rapid adaptive convergence with only limited data support. Simulation results show that the proposed receiver provides superior performance both as an increasing function of the size of the J-element antenna array and the amount of sample support. As a consequence, this new self-synchronizing communications receiver significantly outperforms the conventional DS-CDMA receiver that uses a standard matched filter for acquisition. When compared with the MMSE-type receiver, the proposed receiver can accomplish a similar performance level without the requirement of known propagation delays.

Chip-locked space-time filtering for maximizing SINR in asynchronous DS-CDMA systems

This paper considers a chip-locked space-time (CLST) filtering technique for direct-sequence code-division multiple access (DS-CDMA) systems. CLST filtering exploits the knowledge of the multiple access interference (MAI) chip delays, as well as the fact that the MAI spectrum is colored in the time and space domains. Chip delays of interferers from the same cell as the desired user are available at the base station and can be used to improve performance of single-user receivers. CLST filtering reduces MAI through joint optimization of spatio-temporal filtering and exploitation of chip delays of locked interference, without the need of interferers spreading codes. A significant improvement in signal-to-interference plus noise ratio can be achieved through CLST filtering with respect to the case when the interference is unlocked. The capabilities of CLST filtering to suppress chip-delay-locked interference improves with increasing chip waveform excess bandwidth. Numerical results show that CLST filtering already provides significant performance gains with square-root raised cosine chip pulses of small excess bandwidth. Furthermore, it is also shown that CLST filtering for a long observation interval is suitable for DS-CDMA systems employing long sequence spreading.

DOA estimation in the asynchronous DS-CDMA system

It was previously shown that the number of array elements must exceed the number of sources for subspace-based directional-of-arrival (DOA) estimation. This is clearly not practical for a direct-sequence code-division multiple access (DS-CDMA) wireless system since the number of mobile users is very large. To overcome the restriction, a DOA's estimator employing the code-matched filters and parallel MUSIC algorithms is proposed. In the asynchronous DS-CDMA system, we show that the multiple access interference (MAI) throughout the code-matched filter tends toward the real Gaussian distribution with zero mean. In addition, based on the singular value decomposition (SVD) of a finite amount of data, we achieve a theoretical expression for the mean-squared error (MSE) of the DOA's estimation. With the advantage of code-matched filter inherent in the DS-CDMA system, we prove that the proposed technique can obtain an unbiased DOA estimation with low MSE, even in the environment where the number of mobile users far exceeds the number of array elements. Simulation results verify the theoretical derivation.

An optimal signal design for band-limited asynchronous DS-CDMA communications

An optimal signal design for band-limited, asynchronous, direct-sequence code-division multiple-access (DS-CDMA) communications with aperiodic random spreading sequences and a conventional matched filter receiver is considered in an additive white Gaussian noise (AWGN) channel. With bandwidth defined in the strict sense, two optimization problems are solved under finite bandwidth and zero interchip interference constraints. First, a chip waveform optimization is performed given the system bandwidth, the data symbol transmission rate, and the processing gain. A technique to characterize a band-limited chip waveform with a finite number of parameters is developed, and it is used to derive optimum chip waveforms which minimize the effect of multiple-access interference (MAI) for any energy and delay profile of users. Next, a joint optimization of the processing gain and the chip waveform is performed, given the system bandwidth and the data symbol transmission rate. A sufficient condition for a system to have lower average probability of bit error for any energy profile is found, and it is used to derive some design strategies. It is shown that the flat spectrum pulse with the processing gain leading to zero excess bandwidth results in the minimum average probability of bit error. Design examples and numerical results are also provided.