Near-optimum detection in synchronous code-division multiple-accesssystems

Communication networks using code division multiple access (CDMA) include applications where several packets of information are transmitted synchronously and simultaneously over a common channel. Consideration is given to the problem of simultaneously demodulating every packet from such a transmission. A nonlinear detection scheme based on a linear complexity multistage multiple-access interference rejection algorithm is studied. A class of linear detectors is considered as constituting the first stage for the multistage detector. A bit-error probability comparison of the linear and multistage detectors is undertaken. It is shown that the multistage detectors are capable of achieving considerable improvements over the linear detectors, particularly in near-far situations, i.e., in the demodulation of weak signals in the presence of strong interfering signals. This problem has been of primary concern for currently operational CDMA systems     

A Sequential Algorithm for Joint Parameter Estimation and Multiuser Detection in DS/CDMA Systems with Multipath Propagation

A direct sequence (DS) spread spectrum code division multiple access (CDMA) communication system is considered where several users transmit data symbols over different multipath channels. The main objective of this work is the proposal of a sequential algorithm for joint parameter estimation and multiuser data detection. The computationally prohibitive maximization of the log-likelihood function is replaced by a sequential scheme using the multistage detector for recovering the data symbols and the expectation-maximization algorithm for estimating the channel parameters. The performance of the resulting multiuser receiver is evaluated via Monte Carlo simulations using both synthetic as well as measured channel impulse responses. A comparison of the performance with analytical expressions for the single-user single-path case shows that the proposed system is capable of eliminating the near-far effect existing in conventional DS/CDMA systems.     

Directly estimated adaptive detectors for code-division multiple-access signals

This paper presents adaptive multiuser detectors for code-division multiple-access (CDMA) signals in wireless communication systems. Directly estimated adaptive (DEA) detectors are developed by formulating CDMA detection as an inverse problem in the presence of channel-induced interference and noise. The detector parameters are computed by a fully sequential adaptive algorithm that requires no matrix inversion, and can be implemented online as the data arrive at the receiver. The proposed DEA detector is experimentally evaluated in terms of its robustness to noise, resistance to the near-far problem, and ability to handle multipath fading signals. This experimental study indicates that the proposed DEA detector requires shorter training sequences of bits to achieve the performance levels attained by existing adaptive implementations of the minimum mean-square error detector.     

A low complexity multiuser detector for synchronous CDMA system

In a code-division multiple-access (CDMA) system, multiuser detection (MUD) can exploit the information of signals from other interfering users to increase the system capacity. However, the optimum MUD for CDMA systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In this paper, we apply a hybrid algorithm to develop a suboptimal MUD strategy. The result of symmetric successive overrelaxation (SSOR) preconditioned conjugate-gradient method is first used to initialize the reduced-complexity recursive (RCR) multiuser detector. Then, RCR algorithm is applied to detect the received data bit by optimizing an objective function in relation with the linear system of decorrelating detector. Simulation results for the synchronous case show that the performance of our proposed SSOR-RCR multiuser detector is promising and outperform the decorrelator and linear minimum mean squared error multiuser detector with lower computational complexity.     

Multistage multiuser detection for FHMA

A multistage multiuser detector (MMD) is presented for frequency-hopping/code-division multiple access (FH/CDMA.) The MMD reduces the bit-error rate (BER) over the conventional detector by exploiting prior knowledge of the addresses and energies of the user signals. This detector is a conservative multiuser detector which is robust to unknown users and has a complexity that is only linear in the number of users. The performance analysis of the synchronous MMD includes both theoretical and simulation BERs for the noiseless case as well as simulation results that include the presence of noise. The MMD is then extended to the fully asynchronous case which makes this work the first to propose an FH/CDMA multiuser detector for asynchronous communications. This asynchronous MMD is compared via simulation to the conventional detector     

A New Algorithm for Optimum Multiuser Detection in Synchronous CDMA Systems

Optimum multiuser detection for Code Division Multiple Access (CDMA) systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In order to reduce the complexity of the optimum multiuser detection, we propose a Reduced Complexity Maximum Likelihood (RCML) algorithm that includes a set of novel certain boundary rules and characteristics. We investigate the performance and complexity tradeoffs for the RCML algorithm by conducting a set of simulations; Maximum Likelihood (ML) detection as a reference for performance comparisons, and relaxation based Semidefinite Programming (SDPB) algorithm as a reference for complexity comparisons. We show that the RCML algorithm is a promising algorithm for its computational savings over relaxation based algorithms in lightly-to-moderately loaded CDMA systems, and for its optimality in highly loaded CDMA systems.     

快跳频多址通信多级迭代干扰消除多用户检测

提出了多级迭代干扰消除快跳频多址多用户检测算法。首先使用传统检测器检测,对只有一个最大行的用户做出正确译码,对相应时频矩阵元素进行信干噪声功率比估计,确定干扰消除迭代权值,然后,对干扰元素做加权运算,逐渐消除干扰,直到所有用户译码完成。该算法消除了迭代中权值估计带来的误差,计算量同用户数成线性关系。仿真结果表明：提出的多级迭代干扰消除算法性能优于文献中的多用户检测算法,特别是在用户数较多时性能有较明显改善。     

Energy-add multistage detector: a novel multiuser detection methodfor synchronous CDMA systems

In synchronous code division multiple access (CDMA) systems, both multiple access interference (MAI) and intersymbol interference (ISI) arise. MAI is present due to the CDMA format while ISI is present due to channel multipath. One approach to overcome these problems is to detect the entire package of data for all users at once. This implies working with matrices with dimensions proportional to the product of the data package length and the number of active users. In this paper, we present an alternative approach. This alternative consists of a type of multistage detector that overcomes the MAI and ISI problems; in addition, it has complexity proportional to the number of CDMA users, is computationally efficient, and is suitable for pipeline implementation which allows fast data processing. Simulations are compared to a derived single user bound for the average bit error probability and the results prove the validity of the proposed detection method     

Complexity of Verdu optimum multiuser detection algorithm inmultichannel CDMA systems

A statistical characterization of the complexity function of the Verdu optimum multiuser detection (VOMD) algorithm is presented for a communication system employing a finite number of randomly accessed orthogonal channels and a finite number of simultaneous users. Multichannel code-division multiple-access (CDMA) systems are proposed. It is proved that the probability, in which the individual channel complexity is greater than A^r(1+α), approaches zero exponentially fast as the average number of simultaneous users in each channel increases, where A is the modulation alphabet size and α>0. When the number of simultaneous users is large, the complexity of applying the VOMD algorithm to each individual channel is negligible when compared with the complexity of applying the same algorithm directly to the traditional single-channel CDMA system supporting the same number of simultaneous users. The probability distribution of the joint complexity function of the aggregate system is found. It is shown that when the number of simultaneous users is large, the joint complexity function is negligible compared with applying the VOMD algorithm directly to the traditional single-channel CDMA system supporting the same number of simultaneous users. Therefore, a multichannel CDMA communication system can support a comparable population of simultaneous users to the traditional single-channel CDMA system of comparable bandwidth, while reducing the complexity of optimum multiuser detection to a practical level     

Noncoherent multistage multiuser detection of M-ary orthogonal signals

In recent years, a great deal of research has been performed on methods of alleviating the performance degradations suffered by code division multiple access (CDMA) systems due to multiple access interference. In this paper, we consider a multistage detector for noncoherent CDMA using M-ary orthogonal signals. Using a decorrelating detector as its first stage, the detector iteratively estimates the multiple access interference affecting the desired signal, subtracts the estimated interference, and forms symbol estimates for each of K users. Through numerical examples, the bit error performance of the proposed detector is demonstrated to be superior to that of previous detectors for the same signalling scheme. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Systematic Approach to Multistage Detectors in Multipath Fading Channels

We consider linear multistage detectors with universal (large system) weighting for synchronous code-division multiple access (CDMA) in multipath fading channels with many users. A convenient choice of the basis of the projection subspace allows a joint projection of all users. Taking advantage of this property, the complexity per bit of multistage detectors with universal weights scales linearly with the number of users on the uplink CDMA channel, while other known multistage detectors with universal weights and different bases of the projection subspace keep the same quadratic complexity order per bit as the linear minimum mean-square error (LMMSE) detector. We focus on the design of two kinds of detectors with linear complexity. The detector of Type I is obtained as an asymptotic approximation of the polynomial expansion detector proposed by Moshavi The detector of Type II has the same performance as the multistage Wiener filter (MSWF) in large systems. Additionally, general performance expressions for large systems, applicable to any multistage detector with the same basis of the projection subspace (e.g., linear parallel interference canceling detectors), are derived. As a by-product, the performance analysis disproves the widespread belief that the MSWF and the polynomial expansion detector are equivalent. We show that, in general, the MSWF outperforms the latter one and they are equivalent only asymptotically in the case of equal received powers.     

A Systolic Array Implementation of the One-Shot Decorrelating Detector Used for Mobile CDMA Communications

A systolic array implementation of the one-shot decorrelating detector algorithm designed for Code-Division Multiple-Access (CDMA) spread spectrum communication systems used in mobile communications environments is developed. This detector has the advantage that it is near-far resistant, that is, it minimizes the interference effects that near-end users have on far-end users. However, its implementation requires the on-line inversion of the correlation matrix between the desired and interfering users. For this reason, a systolic computation approach is chosen to help solve the problem of fast on-the-fly matrix inversion. Performance of the proposed implementation is assessed via digital computer simulation. The implementation methodology presented here leads to a VLSI implementation structure.     

A new multistage detector for synchronous CDMA communications

In this paper, we develop a new multistage detector to approach the optimal solution of the detection problem in a synchronous code division multiple access (CDMA) system. The transformation modifies the diagonal elements of the Hessian matrix of the quadratic likelihood function and brings the continuous minimum of the transformed function as close to the optimal solution as possible. The computational complexity is essentially linear with the number of users, except that a few computations of a quadratic function are needed     

Multistage detection in asynchronous code-division multiple-accesscommunications

A multiuser detection strategy for coherent demodulation in an asynchronous code-division multiple-access system is proposed and analyzed. The resulting detectors process the sufficient statistics by means of a multistage algorithm based on a scheme for annihilating successive multiple-access interference. An efficient real-time implementation of the multistage algorithm with a fixed decoding delay is obtained and shown to require a computational complexity per symbol which is linear in the number of users K. Hence, the multistage detector contrasts with the optimum demodulator, which is based on a dynamic programming algorithm, has a variable decoding delay, and has a software complexity per symbol that is exponential in K. An exact expression is obtained and used to compute the probability of error is obtained for the two-stage detector, showing that the two-stage receiver is particularly well suited for near-far situations, approaching performance of single-user communications as the interfering signals become stronger. The near-far problem is therefore alleviated. Significant performance gains over the conventional receiver are obtained even for relatively high-bandwidth-efficiency situations     

Systematic approach to multistage linear successive interferencecancellation for multiuser detection in dynamic asynchronous CDMAsystems

A systematic approach is proposed for the implementation of multistage linear successive interference cancellation (SIC) in dynamic asynchronous CDMA systems. It is shown that the multistage linear SIC can asymptotically converge to the ideal decorrelating or LMMSE detector in the random code time-varying CDMA systems as well as in short-code time-invariant systems. Through simulations it is found that a moderate number of stages gives a performance close to that of an ideal detector     

Systematic approach to multistage linear successive interferencecancellation for multiuser detection in dynamic asynchronous CDMAsystems

A systematic approach is proposed for the implementation of multistage linear successive interference cancellation (SIC) in dynamic asynchronous CDMA systems. It is shown that the multistage linear SIC can asymptotically converge to the ideal decorrelating or LMMSE detector in random code time-varying CDMA systems as well as in short-code time-invariant systems. Through simulations it is found that a moderate number of stages gives a performance close to that of an ideal detector     

Adaptive decorrelating detectors for CDMA systems

Multi-user detection allows for the efficient use of bandwidth in Code-Division Multiple-Access (CDMA) channels through mitigation of near-far effects and multiple-access noise limitations. Due to its inherent noise and multipath immunity, CDMA multi-access is being considered as a platform for personal communication systems (PCS). As CDMA based digital communication networks proliferate, the need to determine the presence of a new user and integrate knowledge of this new user into the detection scheme becomes more important. The decorrelating detector is a linear multi-user detector that is asymptotically optimal in terms of near far resistance; however, in the presence of a new unknown user, performance of the decorrelator is severely degraded. Adaptive decorrelators are constructed which adaptively augment an existing conventional decorrelator to demodulate a new active user in addition to existing users. Several likelihood ratio based schemes are employed. Both synchronous and asynchronous communication are investigated.This research was supported by the U.S. Army Research Office under Grant DAAH04-93-G-0219.     

Adaptive decorrelating detectors for CDMA systems

Multi-user detection allows for the efficient use of bandwidth in Code-Division Multiple-Access (CDMA) channels through mitigation of near-far effects and multiple-access noise limitations. Due to its inherent noise and multipath immunity, CDMA multi-access is being considered as a platform for personal communication systems (PCS). As CDMA based digital communication networks proliferate, the need to determine the presence of a new user and integrate knowledge of this new user into the detection scheme becomes more important. The decorrelating detector is a linear multi-user detector that is asymptotically optimal in terms of near far resistance; however, in the presence of a new unknown user, performance of the decorrelator is severely degraded. Adaptive decorrelators are constructed which adaptively augment an existing conventional decorrelator to demodulate a new active user in addition to existing users. Several likelihood ratio based schemes are employed. Both synchronous and asynchronous communication are investigated.This research was supported by the U.S. Army Research Office under Grant DAAH04-93-G-0219.     

On the performance of linear parallel interference cancellation

This paper analyzes the performance of the linear parallel interference cancellation (LPIC) multiuser detector in a synchronous multiuser communication scenario with binary signaling, nonorthogonal multiple access interference, and an additive white Gaussian noise channel. The LPIC detector has been considered in the literature lately due to its low computational complexity, potential for good performance under certain operating conditions, and close connections to the decorrelating detector. In this paper, we compare the performance of the two-stage LPIC detector to the original multistage detector proposed by Varanasi and Aazhang (1990, 1991) for CDMA systems. The general M-stage LPIC detector is compared to the conventional matched filter detector to describe operating conditions where the matched filter detector outperforms the LPIC detector in terms of error probability at any stage M. Analytical results are presented that show that the LPIC detector may exhibit divergent error probability performance under certain operating conditions and may actually yield error probabilities greater than 0.5 in some cases. Asymptotic results are presented for the case where the number of LPIC stages goes to infinity. Implications of the prior results for code division multiple access (CDMA) systems with random binary spreading sequences are discussed in the “large-system” scenario. Our results are intended to analytically corroborate the simulation evidence of other authors and to provide cautionary guidelines concerning the application of LPIC detector to CDMA communication systems     

Genetically modified multiuser detection for code division multipleaccess systems

The problem of multiple access interference (MAI) and intersymbol interference (ISI) suppression in code division multiple access (CDMA) systems is considered. By combining the theory of multiuser detection (MUD) and evolutionary computation, a hybrid genetic engine is proposed, suitable for the detection of CDMA signals in the presence of MAI and ISI. The proposed hybrid detector structure can be extended to most multiuser detectors and used as the base detector within the structure. Using random selection, mutation and crossover operators and a unique chromosome structure, the genetic algorithm evolves the base detector to a group of more efficient detectors in terms of bit-error rate performance. First, a new packet-level genetic MUD technique, using a conventional single user detector as the base detector, is proposed for asynchronous CDMA (ACDMA) with negligible ISI. Then the signal-subspace-based minimum mean square error detector is chosen as a base detector and wrapped inside the hybrid genetic engine to evolve to a better structure nearly to eliminate both ISI and MAI. The novelty of the proposed structure is the way the deterministic closed-form solution of the base detector is mapped to a genetic engine resulting in a group of more efficient and adaptive detectors