Asynchronous CDMA Systems with Random Spreading-Part II: Design Criteria

Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In Part I, the fundamental limits of asynchronous CDMA systems are analyzed in terms of spectral efficiency and SINR at the output of the optimum linear detector. The focus of Part II is the design of low-complexity implementations of linear multiuser detectors in systems with many users that admit a multistage representation, e.g. reduced rank multistage Wiener filters, polynomial expansion detectors, weighted linear parallel interference cancellers. The effects of excess bandwidth, chip-pulse shaping, and time delay distribution on CDMA with suboptimum linear receiver structures are investigated. Recursive expressions for universal weight design are given. The performance in terms of SINR is derived in the large-system limit and the performance improvement over synchronous systems is quantified. The considerations distinguish between two ways of forming discrete-time statistics: chip-matched filtering and oversampling

Asynchronous CDMA Systems with Random Spreading-Part I: Fundamental Limits

Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit allowing for arbitrary chip waveforms and frequency-flat fading. Signal to interference and noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean square error (MMSE) detectors, are derived. The approach is general and optionally allows even for statistics obtained by under-sampling the received signal. All performance measures are given as a function of the chip waveform and the delay distribution of the users in the large system limit. It turns out that synchronizing users on a chip level impairs performance for all chip waveforms with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off factors. For example, with the pulse shaping demanded in the UMTS standard, user synchronization reduces spectral efficiency up to 12% at 10 dB normalized signal-to-noise ratio. The benefits of asynchronism stem from the finding that the excess bandwidth of chip waveforms actually spans additional dimensions in signal space, if the users are de-synchronized on the chip-level. The analysis of linear MMSE detectors shows that the limiting interference effects can be decoupled both in the user domain and in the frequency domain such that the concept of the effective interference spectral density arises. This generalizes and refines Tse and Hanly's concept of effective interference. In Part II, the analysis is extended to any linear detector that admits a representation as multistage detector and guidelines for the design of low complexity multistage detectors with universal weights are provided

Design and performance of CDMA codes for multiuser communications

Walsh and Gold sequences are fixed power codes and are widely used in multiuser CDMA communications. Their popularity is due to the ease of implementation. Availability of these code sets is limited because of their generating kernels. Emerging radio applications like sensor networks or multiple service types in mobile and peer-to-peer communications networks might benefit from flexibilities in code lengths and possible allocation methodologies provided by large set of code libraries. Walsh codes are linear phase and zero mean with unique number of zero crossings for each sequence within the set. DC sequence is part of the Walsh code set. Although these features are quite beneficial for source coding applications, they are not essential for spread spectrum communications. By relaxing these unnecessary constraints, new sets of orthogonal binary user codes (Walsh-like) for different lengths are obtained with comparable BER performance to standard code sets in all channel conditions. Although fixed power codes are easier to implement, mathematically speaking, varying power codes offer lower inter- and intra-code correlations. With recent advances in RF power amplifier design, it might be possible to implement multiple level orthogonal spread spectrum codes for an efficient direct sequence CDMA system. A number of multiple level integer codes have been generated by brute force search method for different lengths to highlight possible BER performance improvement over binary codes. An analytical design method has been developed for multiple level (variable power) spread spectrum codes using Karhunen-Loeve Transform (KLT) technique. Eigen decomposition technique is used to generate spread spectrum basis functions that are jointly spread in time and frequency domains for a given covariance matrix or power spectral density function. Since this is a closed form solution for orthogonal code set design, many options are possible for different code lengths. Design examples and performance simulations showed that spread spectrum KLT codes outperform or closely match with the standard codes employed in present CDMA systems. Hybrid (Kronecker) codes are generated by taking Kronecker product of two spreading code families in a two-stage orthogonal transmultiplexer structure and are judiciously allocated to users such that their inter-code correlations are minimized. It is shown that, BER performance of hybrid codes with a code selection and allocation algorithm is better than the performance of standard Walsh or Gold code sets for asynchronous CDMA communications. A redundant spreading code technique is proposed utilizing multiple stage orthogonal transmultiplexer structure where each user has its own pre-multiplexer. Each data bit is redundantly spread in the pre-multiplexer stage of a user with odd number of redundancy, and at the receiver, majority logic decision is employed on the detected redundant bits to obtain overall performance improvement. Simulation results showed that redundant spreading method improves BER performance significantly at low SNR channel conditions

A nonlinear M-estimation approach to robust asynchronous multiuser detection in Non-gaussian noise

A nonlinear M-estimation approach is proposed to solve the multiuser detection problem in asynchronous code-division multiple-access (CDMA) systems where the ambient noise is impulsive and the delays are not known. We treat the unknown delays as nuisance parameters and the transmitted symbols as parameters of interest. We also analyze the asymptotic performance of the proposed estimator and propose suboptimal but computationally efficient procedures for solving the nonlinear optimization function. Simulation results show considerable improvements over the conventional approaches

Blind user detection in doubly-dispersive DS/CDMA channels

In this work, we consider the problem of detecting the presence of a new user in a direct-sequence/code-division-multiple-access (DS/CDMA) system with a doubly-dispersive fading channel, and we propose a novel blind detection strategy which only requires knowledge of the spreading code of the user to be detected, but no prior information as to the time-varying channel impulse response and the structure of the multiaccess interference. The proposed detector has a bounded constant false alarm rate (CFAR) under the design assumptions, while providing satisfactory detection performance even in the presence of strong cochannel interference and high user mobility.Comment: Accepted for publication on IEEE Transactions on Signal Processin

Coherent receiver design and analysis for interleaved division multiple access (IDMA)

This thesis discusses a new multiuser detection technique for cellular wireless communications. Multiuser communications is critical in cellular systems as multiple terminals (users) transmit to base stations (or wireless infrastructure). Efficient receiver methods are needed to maximise the performance of these links and maximise overall throughput and coverage while minimising inter-cell interference. Recently a new technique, Interleave-Division Multiple Access (IDMA), was developed as a variant of direct-sequence code division multiple access (DS-CDMA). In this new scheme users are separated by user specific interleavers, and each user is allocated a low rate code. As a result, the bandwidth expansion is devoted to the low rate code and not weaker spreading codes. IDMA has shown to have significant performance gains over traditional DS-CDMA with a modest increase in complexity. The literature on IDMA primarily focuses on the design of low rate forward error correcting (FEC) codes, as well as channel estimation. However, the practical aspects of an IDMA receiver such as timing acquisition, tracking, block asynchronous detection, and cellular analysis are rarely studied. The objective of this thesis is to design and analyse practical synchronisation, detection and power optimisation techniques for IDMA systems. It also, for the first time, provides a novel analysis and design of a multi-cell system employing a general multiuser receiver. These tools can be used to optimise and evaluate the performance of an IDMA communication system. The techniques presented in this work can be easily employed for DS-CDMA or other multiuser receiver designs with slight modification. Acquisition and synchronisation are essential processes that a base-station is required to perform before user's data can be detected and decoded. For high capacity IDMA systems, which can be heavily loaded and operate close to the channel capacity, the performance of acquisition and tracking can be severely affected by multiple access interference as well as severe drift. This thesis develops acquisition and synchronisation algorithms which can cope with heavy multiple access interference as well as high levels of drift. Once the timing points have been estimated for an IDMA receiver the detection and decoding process can proceed. An important issue with uplink systems is the alignment of frame boundaries for efficient detection. This thesis demonstrates how a fully asynchronous system can be modelled for detection. This thesis presents a model for the frame asynchronous IDMA system, and then develops a maximum likelihood receiver for the proposed system. This thesis develops tools to analyse and optimise IDMA receivers. The tools developed are general enough to be applied to other multiuser receiver techniques. The conventional EXIT chart analysis of unequal power allocated multiuser systems use an averaged EXIT chart analysis for all users to reduce the complexity of the task. This thesis presents a multidimensional analysis for power allocated IDMA, and shows how it can be utilised in power optimisation. Finally, this work develops a novel power zoning technique for multicell multiuser receivers using the optimised power levels, and illustrates a particular example where there is a 50% capacity improvement using the proposed scheme. -- provided by Candidate

Adaptive interference suppression for DS-CDMA systems based on interpolated FIR filters with adaptive interpolators in multipath channels

In this work we propose an adaptive linear receiver structure based on interpolated finite impulse response (FIR) filters with adaptive interpolators for direct sequence code division multiple access (DS-CDMA) systems in multipath channels. The interpolated minimum mean-squared error (MMSE) and the interpolated constrained minimum variance (CMV) solutions are described for a novel scheme where the interpolator is rendered time-varying in order to mitigate multiple access interference (MAI) and multiple-path propagation effects. Based upon the interpolated MMSE and CMV solutions we present computationally efficient stochastic gradient (SG) and exponentially weighted recursive least squares type (RLS) algorithms for both receiver and interpolator filters in the supervised and blind modes of operation. A convergence analysis of the algorithms and a discussion of the convergence properties of the method are carried out for both modes of operation. Simulation experiments for a downlink scenario show that the proposed structures achieve a superior BER convergence and steady-state performance to previously reported reduced-rank receivers at lower complexity