Blind equalization and multiuser detection in dispersive CDMAchannels

The problem of blind demodulation of multiuser information symbols in a high-rate code-division multiple-access (CDMA) network in the presence of both multiple-access interference (MAI) and intersymbol interference (ISI) is considered. The dispersive CDMA channel is first cast into a multiple-input multiple-output (MIMO) signal model framework. By applying the theory of blind MIMO channel identification and equalization, it is then shown that under certain conditions the multiuser information symbols can be recovered without any prior knowledge of the channel or the users' signature waveforms (including the desired user's signature waveform), although the algorithmic complexity of such an approach is prohibitively high. However, in practice, the signature waveform of the user of interest is always available at the receiver. It is shown that by incorporating this knowledge, the impulse response of each user's dispersive channel can be identified using a subspace method. It is further shown that based on the identified signal subspace parameters and the channel response, two linear detectors that are capable of suppressing both MAI and ISI, i.e., a zero-forcing detector and a minimum-mean-square-error (MMSE) detector, can be constructed in closed form, at almost no extra computational cost. Data detection can then be furnished by applying these linear detectors (obtained blindly) to the received signal. The major contribution of this paper is the development of these subspace-based blind techniques for joint suppression of MAI and ISI in the dispersive CDMA channels     

Wireless systems and interference avoidance

Motivated by the emergence of programmable radios, we seek to understand a new class of communication system where pairs of transmitters and receivers can adapt their modulation/demodulation method in the presence of interference to achieve better performance. Using signal to interference ratio as a metric and a general signal space approach, we present a class of iterative distributed algorithms for synchronous systems which results in an ensemble of optimal waveforms for multiple users connected to a common receiver (or colocated independent receivers). That is, the waveform ensemble meets the Welch (1974) bound with equality and, therefore, achieves minimum average interference over the ensemble of signature waveforms. We derive fixed points for a number of scenarios, provide examples, look at ensemble stability under user addition and deletion as well as provide a simplistic comparison to synchronous code-division multiple-access. We close with suggestions for future work     

Turbo multiuser detection with unknown interferers

We consider the problem of turbo multiuser detection for synchronous and asynchronous code-division multiple-access (CDMA) in the presence of unknown users. Turbo multiuser detectors, as previously developed, typically require knowledge of the signature waveforms of all of the users in the system and ignore users whose signature sequences are unknown, e.g., users outside the cell. We develop turbo multiuser detection for CDMA uplink systems and other environments in which the receiver has knowledge of the signature waveforms of only K˘⩽ K users. Subspace techniques are used to estimate the interference from the unknown-users and the interference estimate is subtracted from the received signal. We see that the new receiver significantly outperforms the conventional turbo multiuser receiver for moderate and high signal-to-noise ratios. It is also seen that the traditional turbo receiver provides little gain through iteration when unknown users are present     

Code division multiple-access techniques in optical fiber networks.I. Fundamental principles

An examination is made of fiber-optic code-division multiple-access (FO-CDMA), a technique in which low information data rates are mapped into very-high-rate address codes (signature sequences) for the purpose of achieving random, asynchronous communications free of network control, among many users. The need for a special class of signature sequences to achieve the multiple-access capability using fiber-optic signal processing techniques is discussed. A class of signature sequences called optical orthogonal codes (OOCs) that provide the auto- and cross-correlation properties required for FO-CDMA is introduced and used in an experiment to show the principles of FO-CDMA. The experiment demonstrates the auto- and cross-correlation properties of the codes. The concept of optical disk patterns, an equivalent way of representing the OOCs, is introduced. The patterns are used to derive the probability density functions associated with any two interfering OOCs. A detailed study of different interference patterns is presented, and the strongest and the weakest interference patterns are determined     

CDMA codeword optimization: interference avoidance and convergencevia class warfare

Interference avoidance has been shown to reduce total square correlation (TSC) for given ensembles of user signature waveforms (codewords) in a synchronous code-division multiple-access (CDMA) system. In all experiments we have conducted, sequential application of interference avoidance produces an optimal codeword set when starting from randomly chosen initial codewords. Here we provide the first formal proof of convergence to optimal codeword ensembles for greedy interference avoidance algorithms augmented by a technique called “class warfare” whereby users which reside in more heavily loaded areas of the signal space purposely interfere with (attack) the reception of users in less crowded areas. Coordination of deliberate interference by a complete class of aggrieved user is also sometimes necessary. Such “attacks” and subsequent codeword adjustment by attacked users are shown to strictly decrease TSC. Along the way we also show using linear algebra and a variant of stochastic ordering, equivalence between minimization of TSC and maximization of sum capacity     

Bandwidth-efficient multiple access (BEMA): a new strategy based onsignal design under quality-of-service constraints forsuccessive-decoding-type multiuser receivers

This paper considers the design of signature waveforms for successive-decoding-type multiuser receivers (including the optimum successive decoder (OSD)) in a correlated-waveform multiple-access channel. The problem is to obtain signature waveforms that require as little bandwidth as possible while allowing the receiver to meet a given set of quality-of-service (QoS) objectives. The QoS objectives are specified for each user in terms of capacity, or equivalently, the signal-to-interference ratio. A (generally unachievable) lower bound is obtained on the minimum bandwidth required to achieve these QoS constraints. Moreover, a simple algorithm is proposed for obtaining signal sets that meet the QoS constraints when used with the OSD, and which, while not optimal, require a bandwidth that can be very close to the minimum required bandwidth. It is also shown that such signal sets allow for a significantly more efficient use of bandwidth than do orthogonal signals used in time- or frequency-division multiple access (TDMA/FDMA). Based on our signal design approach, we propose a new multiple-access strategy that we refer to as bandwidth-efficient multiple access (BEMA). While BEMA is more bandwidth efficient than TDMA or FDMA, it retains their desirable feature of needing only single-user coding (and decoding) for each user     

Multiuser Constrained Water-Pouring for Continuous-Time Overloaded Gaussian Multiple-Access Channels

In this paper, signature waveforms and signal powers are jointly optimized for multiuser communications over strictly bandlimited, continuous-time, overloaded channels corrupted by additive white Gaussian noise (AWGN). The total signal power is minimized subject to general asymmetric signal-to-interference-plus-noise ratio (SINR) constraints at the output of linear minimum mean-squared error (LMMSE) receivers. Using vectorized Fourier transform (VFT) technique, the optimal solutions as well as a necessary and sufficient condition for the existence of a feasible solution are derived in the frequency domain. It turns out that every optimal solution performs the same as the optimal frequency-division multiple-access (FDMA) system. A geometric procedure called multiuser constrained water-pouring is developed to construct every possible optimal solution, of which profiles of signal power and equivalent bandwidth are, respectively, the same as those of signal power and physical bandwidth of the optimal FDMA system. It is shown that orthogonal signature waveforms are assigned to oversized users and continuous-time equivalents of generalized Welch bound equality (CTE-GWBE) sequences are assigned to non-oversized users.     

Blind adaptive multiuser detection

The decorrelating detector and the linear minimum mean-square error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in code-division multiple-access channels; in particular, those multiuser detectors provide optimum near-far resistance. When training data sequences are available, the MMSE multiuser detector can be implemented adaptively without knowledge of signature waveforms or received amplitudes. This paper introduces an adaptive multiuser detector which converges (for any initialization) to the MMSE detector without requiring training sequences. This blind multiuser detector requires no more knowledge than does the conventional single-user receiver: the desired user's signature waveform and its timing. The proposed blind multiuser detector is made robust with respect to imprecise knowledge of the received signature waveform of the user of interest     

Performance of binary and quaternary direct-sequencespread-spectrum multiple-access systems with random signature sequences

The performance of synchronous and asynchronous, binary and quaternary (with and without offset) direct-sequence spread-spectrum multiple-access (DS/SSMA) communication systems using random signature sequences and arbitrary chip waveforms is investigated. The average probability of error at the output of the correlation receiver is evaluated using a characteristic-function approach for these systems. Numerical results are presented that illustrate performance comparisons between systems using random and deterministic signature sequences, synchronous and asynchronous systems, systems with rectangular or sinewave chip waveforms, and binary and quaternary systems with the same data rates and bandwidth. In all cases, the accuracy of the Gaussian approximation is also examined     

Bit-to-bit error dependence in slotted DS/SSMA packet systems withrandom signature sequences

A technique is developed to find an accurate approximation to the probability of data bit error and the probability of packet success in a direct-sequence spread-spectrum multiple-access (DS/SSMA) packet radio system with random signature sequences. An improved Gaussian approximation to the probability of data bit error is performed. Packet performance is analyzed by using the theory of moment spaces to gain insight into the effect of bit-to-bit error dependence caused by interfering signal relative delays and phases which are assumed constant over the duration of a desired packet. Numerical results show that if no error control exists in the desired packet or if block error control is used when multiple-access interference is high, the error dependence increases the average probability of packet success beyond that predicted by models which use independent bit errors. However, when block error control is used and the multiple-access interference is low, the bit error dependencies cause a reduction in packet error performance     

Multiuser detection of quasisynchronous CDMA signals using lineardecorrelators

A linear decorrelator detector is proposed for a quasisynchronous code-division multiple-access (QS-CDMA) cellular system. It is assumed that each of N users has a Global Positioning System (GPS) generated local clock and attempts to transmit synchronously with the other users in its cell. The base station thus receives N signature waveforms which are approximately synchronized, but with a small timing error due to local oscillator drift, Doppler shifts, and variable distances from the mobiles to the base. The residual timing offset is discretized, and a decorrelator is constructed which attempts to reject the multiuser interference vectors corresponding to the set of possible offsets. A noncoherent version of the decorrelator detector is presented, along with a maximum-likelihood scheme for synchronizing to the desired signal. Bounds and analytical results for the bit-error rate (BER) are obtained for various interferer conditions     

Performance Analysis of Subspace Based Downlink Channel Estimation for W-CDMA Systems Using Chaotic Codes

This paper presents blind channel estimation for downlink W-CDMA system that employs chaotic codes and Walsh codes for spreading information bits of the multiple users. In a W-CDMA system, while transmitting over multipath channels, both intersymbol interference (ISI) as a result of Inter Chip Interference and multiple access interference (MAI) cannot be easily eliminated. Although it is possible to design multiuser detectors that suppress MAI and ISI, these detectors often require explicit knowledge of at least the desired users’ signature waveform. Earlier work focused on a subspace based channel estimation algorithm for asynchronous CDMA systems to estimate the multiple users’ symbols, where only AWGN channel was considered. In our work, we study a similar subspace-based signature waveform estimation algorithm for downlink W-CDMA systems, which use chaotic codes instead of pseudo random codes, that provide estimates of the multiuser channel by exploiting structural information of the data output at the base station. In particular, we show that the subspace of the (data+noise) matrix contains sufficient information for unique determination of channels, and hence, the signature waveforms and signal constellation. We consider Rayleigh and Rician fading channel model to quantify the multipath channel effects. Performance measures like bit error rate and root mean square error are plotted for both chaotic codes and Walsh codes under Rayleigh and Rician fading channels.     

Asynchronous multiple-access interference suppression and chipwaveform selection with aperiodic random sequences

A linear decentralized receiver capable of suppressing multiple-access interference (MAI) for asynchronous direct-sequence code-division multiple-access (DS-CDMA) systems with aperiodic random signature sequences is proposed. Performance bounds on this receiver are also obtained. Using them as performance measures, the problem of chip waveform selection in DS-CDMA systems with the proposed receiver under the near-far scenario is investigated. In particular, the performance of several practical chip waveforms is compared. An LMS-type adaptive algorithm is developed to obtain the parameters needed in the receiver, which only requires the signature sequence and coarse timing information of the desired user     

Single-user detectors for multiuser channels

Optimum decentralized demodulation for asynchronous Gaussian multiaccess channels is considered. It is assumed that the receiver is the destination of the information transmitted by only one active user, and single-user detectors that take into account the existence of the other active users in the channel are obtained. The problem considered is one of signal detection in additive colored nonGaussian noise, and attention is focused on one-shot structures where detection of each symbol is based only on the received process during its corresponding interval. Particular emphasis is placed on asymptotically optimum detectors for weak interferers, for CDMA (code-division multiple-access) signature waveforms with long spreading codes, and for low background Gaussian noise level     

Blind adaptive multiuser detection in multipath CDMA channels basedon subspace tracking

A blind adaptive technique for signal demodulation in multipath code-division multiple-access (CDMA) communication channels is proposed. This technique is based on signal subspace estimation. The receiver employs a bank of linear filters (decorrelating filters or linear MMSE filters) at the front end to mitigate the multiple-access interference and the multipath interference. A channel estimator is used to estimate the channel state for diversity combining. It is shown that through the use of signal subspace estimation, both the decorrelating filterbank and the linear MMSE filterbank can be obtained blindly, i.e., they can be estimated from the received signal with the prior knowledge of only the signature waveform of the desired user. Two forms of the subspace-based linear filterbanks are developed and their equivalence in terms of the interference suppression capability is established. These subspace-based blind adaptive interference suppression techniques require, at each symbol epoch, the eigenvalues and the eigenvectors of an appropriate signal subspace, which ran be obtained using computationally efficient sequential adaptive eigendecomposition (subspace tracking) algorithms. Moreover, a blind adaptive method for estimating the channel state is developed, which also produces the postcombining decision statistic as a byproduct     

Bandwidth-constrained signature waveforms for maximizing thenetwork capacity of synchronous CDMA systems

Synchronous code-division multiple-access systems where each receiver is a minimum mean-squared-error receiver and each user has the same received power, signaling rate, and required signal-to-interference ratio are considered. Based on the results Viswanath, Anantharam and Tse (see IEEE Trans. Inform. Theory, vol.45, p.1968-83, 1999), the optimal signature waveforms under both fractional out-of-band energy and root-mean-square bandwidth constraints that maximize the network capacity are determined. Comparison to various suboptimal signature waveforms, including the ones constructed from rectangular pulses, is also made to quantify the gain achieved by the optimal signature waveforms     

On the use of interference suppression to reduce intermodulationdistortion in multicarrier CDMA systems

This paper presents a coded multicarrier direct-sequence code-division multiple-access (DS-CDMA) system that, by the use of a minimum mean-squared-error receiver, achieves frequency diversity (instead of path diversity as in a conventional single-carrier RAKE DS-CDMA) and has the ability to suppress the intermodulation distortion and partially compensate for the signal distortion introduced by a nonlinear amplifier at the transmitter. A frequency-selective Rayleigh fading channel is decomposed into M frequency-nonselective channels, based on the channel coherence bandwidth. A rate 1/M convolutional code, after being interleaved, is used to modulate M different DS-CDMA waveforms. The new system is shown to effectively combat intermodulation distortion in the presence of multiple-access interference     

Estimated bit-error probability of DS-SSMA/MPSK with coherentdetector on satellite mobile channel

In this paper we estimate the average bit-error probability of a direct-sequence spread-spectrum multiple-access (DS-SSMA) system using MPSK and a linear coherent detector on the satellite mobile channel (SMC). The formulas derived in this paper are suitable for various types of signature sequences and chip waveforms. The numerical results are presented for DS-SSMA using BPSK and QPSK with random signature sequences and three different chip waveforms: the rectangular, the cosine, and the root Nyquist filter (RNF) with rolloff rate, β=0.4. The results show that the performance of a DS-SSMA system with complex random signature sequences is superior to a system using binary random signature sequences on Gaussian and Rician (K=10) channels, while on flat fading Rayleigh channels the performance for both systems is similar. In DS-SSMA, the RNF has the highest bandwidth efficiency of the three chip waveforms. The performance of DS-SSMA is also analyzed on the SMC using the Gaussian approximation (GA) method. Compared to the estimated results, GA gives a pessimistic approximation for binary random signature sequences on Gaussian and Rician channels     

Parallel interference cancellation for uplink multirate overlay CDMA channels

To provide new and/or higher rate wireless services with limited spectrum resources, frequency overlay has been naturally proposed to accommodate the new and legacy systems in a common band. We address the multiuser detection problem for overlaid code-division multiple-access (CDMA) scenarios. However, in contrast to the well-studied conventional single-rate CDMA, miscellaneous systems overlay almost always indicates the presence of multirate traffic that introduces an additional degree of freedom in receiver design-i.e., differences in the symbol rates. We concentrate on receiver design for multirate traffic, while assuming a lack of information exchange between the constituent (new and legacy) systems, as is commonplace in practice. We propose a receiver architecture based on linear parallel interference cancellation where the out-of-rate intersystem interference is estimated and subtracted by means of its characteristic subspace, thereby avoiding the need for the exact knowledge of signature waveforms of the interfering system. Simulation results validate our solution and show that the proposed receiver has better performance in various aspects than several other solutions for the same purpose.     

A multiuser receiver for trellis-coded DS/CDMA systems inasynchronous channels

We propose and analyze a multiuser receiver using a decorrelating filter and Viterbi decoders for trellis-coded direct-sequence code-division multiple-access (DS/CDMA) systems with biorthogonal signal constellation in asynchronous channels. The biorthogonality is implemented by user signature waveforms and the decorrelating filter. The performance of the proposed system is investigated with emphasis on the asymptotic cases: it is shown that the proposed system provides us with some coding gain and near-far resistance. It is confirmed that we can enhance the performance of the proposed system by using base-station antenna arrays