Adaptive implementation of polynomial expansion detector formulti-user detection in DS-CDMA systems

The polynomial expansion (PE) multi-user detector was proposed to eliminate the computational complexity of matrix inversion involved in the decorrelating detector and the MMSE detector. Computation of the polynomial coefficients in a PE detector is, however, a complex task. A fast converging adaptive algorithm based on the Davidon-Fletcher-Powell (DFP) method is proposed for computing polynomial weights for a PE detector     

基于干扰空间的盲自适应多用户检测器

在现有盲自适应多用户检测技术基础上，本文提出一种更具有实际应用价值的基于干扰空间线性MMSE盲自适应多用户检测器及其相应的基于干扰自相关矩阵C1跟踪算法。数学分析和仿真结果表明：与现有盲自适应多用户检测器相比，该检测器具有更低的实现复杂度、更快的跟踪速度和更强的健壮性。     

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     

Recursive structures and finite impulse response implementations oflinear multiuser detectors for an asynchronous CDMA system

We present order-recursive structures for implementing the linear decorrelating and linear minimum mean square error (MMSE) detectors in a computationally efficient manner. These infinite memory length, linear time invariant, noncausal systems can be approximated by implementing them as K-input K-output finite impulse response (FIR) filters. We developed a linear multiuser receiver architecture called a recursive linear multiuser detector which has lower computational and memory requirements then an equivalent tap delay line FIR filter implementation. We establish the tradeoff between window length and bit error rate and find that relatively small window size yields performance indistinguishable from the ideal decorrelating detector and the ideal MMSE detector     

Constrained minimum-BER multiuser detection

A new linear multiuser detector that directly minimizes the bit-error rate (BER) subject to a set of reasonable constraints is proposed. It is shown that the constrained BER cost function has a unique global minimum. This allows us to develop an efficient Newton barrier method for finding the coefficients of the proposed detector using information about timing, amplitudes, channels, and the signature signals of all users. Although the new detector cannot be shown to be optimal among linear multiuser detectors without the constraints imposed, extensive simulations demonstrate that it achieves the lowest BER. Furthermore, in some cases, the BER of the proposed detector can be significantly lower than that of the decorrelating and MMSE detectors     

Near optimum tree-search detection schemes for bit-synchronousmultiuser CDMA systems over Gaussian and two-path Rayleigh-fadingchannels

Simple reduced tree-search detection schemes of the breadth-first type are applied to suboptimal joint multiuser detection in bit-synchronous code-division multiple access (CDMA) systems over both Gaussian and two-path Rayleigh-fading channels. It is pointed out that in contrast to the case of the optimal multiuser detector, the choice of the receiver filter severely influences the performance of suboptimal multiuser detectors. Simulation results supported by analysis show that breadth-first tree-search algorithms using a decorrelating noise whitening receiver filter perform better than similar receivers, which solely use a matched filter (MF) for virtually all nonsingular spreading code sets studied. Most of the code sets are randomly generated. The M- and T-algorithm detectors based on decorrelating noise whitening filter (WF) outputs can achieve near optimum performance at a very low complexity compared to the optimal detector, although the proposed detectors are more complex than some known suboptimum detectors. Furthermore, the use of combining techniques is considered for a two-path Rayleigh-fading channel, and a semi-synchronous CDMA structure is proposed. It is shown that if maximum ratio combining (MRC) is employed, the decorrelating noise WF still exists. The corresponding suboptimal combining detector with a decorrelating noise WF outperforms a similar noncombining detector     

Iterative implementation of linear multiuser detection for dynamicasynchronous CDMA systems

Several linear multiuser detectors for code-division multiple access (CDMA) systems can be characterized as an inverse of some form of correlation matrices. If the correlations change, the detectors must be redesigned. An ideal computation of the decorrelating or the linear minimum mean-squared-error (LMMSE) detector requires order K³ flops, where K is the number of users. To alleviate the computational complexity, iterative decorrelating and LMMSE detectors are proposed. The iterative detectors use steepest descent (SD), conjugate gradient (CG), and preconditioned conjugate gradient (PCG) algorithms, and require order K² flops per iteration. Their main advantages are the reduced number of flops and their suitability to highly parallel implementations. The correlation coefficient computation can also be embedded into the CG algorithm, which is an advantage with time-varying signature waveforms. The performance of the iterative algorithms is studied via computer simulations     

Asymptotic analysis of the MMSE multiuser detector fornonorthogonal multipulse modulation

We develop the minimum mean-squared-error (MMSE) multiuser detector for nonorthogonal multipulse modulation over the noncoherent additive white Gaussian noise channel. We analyze the asymptotic performance of the detector and show that, unlike the case of linear modulation, the MMSE detector does not generally approach the generalized maximum-likelihood (GML) detection rule as the noise power vanishes. It does, however, approach a detector which nulls out the multiaccess interference. This detector is termed the multipulse decorrelating detector due to its similarity to the linear decorrelating detector. The probability of error for this detector is derived and used to find the asymptotic multiuser efficiencies of both the multipulse decorrelating detector and the MMSE detector. It is shown that for noncoherent binary signaling, in which the multipulse modulation is two-dimensional, the multipulse decorrelating detector is superior to the GML detector asymptotically. This result does not generalize to larger dimensionality signal sets     

Optimally near-far resistant multiuser detection in differentiallycoherent synchronous channels

The noncoherent demodulation of differentially phase-shift keyed signals transmitted simultaneously via a synchronous code-division multiple-access (CDMA) channel is studied under the assumption of white Gaussian background noise. A class of noncoherent linear detectors is defined with the objective of obtaining the optimal one. The performance criterion considered is near-far resistance that denotes worst-case multiuser asymptotic efficiency over near-far environments. It is shown that the optimal linear detector is a noncoherent decorrelating detector. The commonality between the properties of the decorrelating detectors for coherent and noncoherent channels is established. In particular, it is shown that no other differential phase-shift keying (DPSK), multiuser detector achieves a higher near-far resistance than does the noncoherent decorrelator     

长码DS/CDMA系统中的预优软判决多用户干扰消除

在长码DS/CDMA通信系统中,多级线性软判决并行多用户干扰消除(LSD-PIC)检测器的收敛性能受限于用户数,该文提出用矩阵计算的预优方法改进LSD-PIC检测器的收敛性能,克服由于系统高负载造成的LSD-PIC检测器的性能崩溃,并提出了低代价多项式预优子的概念,对零阶和一阶多项式预优子分别给出了最优系数。     

直扩卫星通信系统中多用户检测算法比较

实际在CDMA系统中,多址干扰(MAI)是主要的干扰来源,多用户检测技术完全可以抑制这种多址干扰。论文分析了几种典型的多用户检测技术,并在高斯信道环境下对解相关检测器、最小均方误差检测器和传统检测器进行了仿真和性能比较。     

Performance analysis of linear multiuser detectors for randomlyspread CDMA using Gaussian approximation

The performance of a linear decorrelating detector (LDD) and a minimum mean square error (MMSE) detector is analyzed for random spreading waveforms. The performance of the LDD and MMSE detectors is expressed in terms of the so-called near-far resistance, defined by a reciprocal of a diagonal component of inverse matrix. For random code division multiple access, which employs random spreading waveforms, the near-far resistance can be regarded as a random variable. Many papers have dealt with the analysis of multiuser detectors for random spreading sequences. In most cases, however, these analyses derived only the expectations or bounds for the near-far resistance. In this paper, we directly derive the approximate probability density function (PDF) of the near-far resistance and corresponding bit error rate expression for random spreading sequences. It is based on Gaussian approximation of the cross correlation between any two randomly generated spreading codes. The resulting PDF turned out to be a reversed-and-scaled version of chi-square distribution. The approximate expressions, both the PDF and the corresponding bit error rate expression, were verified via Monte Carlo simulations. The results showed that the approximation is quite close to the simulation results when the number of users is less than half the processing gain     

A New Multiuser Detector for Synchronous DS/CDMA System

1IntroductionInaCode-DivisionMultiple-Access(CDMA)system,severalindependentusersaccesssimulboeouslyacommonchannelbymodulatingpreassignedsignatUrewaveforms.Inthemobileradiochannels,MultipleAccessinterference(MAI)arises.Therefore,muchattelltionhasbeend...     

Multiuser receivers for randomly spread signals: fundamental limitswith and without decision-feedback

Synchronous code-division multiple-access (CDMA) communication systems with randomly chosen spreading sequences and capacity-achieving forward error correction coding are analyzed in terms of spectral efficiency. Emphasis is on the penalties paid by applying single-user coding in conjunction with suboptimal multiuser receivers as opposed to optimal joint decoding which involves complexity that is exponential in the number of users times the code word length. The conventional, the decorrelating, and the (re-encoded) decorrelating decision-feedback detectors are analyzed in the nonasymptotic case for spherical random sequences. The re-encoded minimum mean-squared error (MMSE) decision-feedback receiver achieving the same performance as joint multiuser decoding for equal power users is shown to be suboptimal in the case of equal rates     

Multiuser detection for packet-switched CDMA networks with retransmission diversity

In this paper, multiuser detection is developed with exploitation of retransmission diversity. A maximum likelihood detector (MLD) that has the same order of complexity as the MLD using only the data in one transmission is developed. It is shown that the retransmission diversity increases the minimum signal distance and, therefore, significantly improves the performance of MLD. The linear MMSE, decorrelating, and MF detectors are developed under two design approaches. In the first approach,we have considered the weighted sum of outputs of a number of linear detectors, where each is implemented for one transmission. The optimum set of weights that maximizes the signal-to-interference-and-noise ratio (SINR) is obtained. In the second approach, a linear detector jointly utilizes the statistics collected from all transmissions. When the SINR of a linear detector is the same in each transmission, the retransmission diversity is shown to increase the SINR by 10log/sub 10/J dB for a packet of J transmissions. The limiting bit error rate for these three linear detectors in large networks with random spreading sequences is obtained in closed form, which enables further network throughput evaluation.     

Improved Robust Techniques for Multiuser Detection in Non-Gaussian Channels

In many physical channels where multiuser detection techniques are to be applied, the ambient channel noise is known through experimental measurements to be decidedly non-Gaussian, due largely to impulsive phenomena. This is due to the impulsive nature of man-made electromagnetic interference and a great deal of natural noise. This paper presents a robust multiuser detector for combating multiple access interference and impulsive noise in code division multiple access (CDMA) communication systems. A new M-estimator is proposed for "robustifying" the detector. The approach is corroborated with simulation results to evaluate the performance of the proposed robust multiuser detector compared with that of the linear decorrelating detector, and the Huber and the Hampel M-estimator based detectors. Simulation results show that the proposed detector with significant performance gain outperforms the linear decorrelating detector, and the Huber and the Hampel M-estimator based detectors. This paper also presents an improved robust blind multiuser detection technique based on a subspace approach, which requires only the signature waveform and the timing of the desired user to demodulate that user's signal. Finally, we show that the robust multiuser detection technique and its blind adaptive version can be applied to both synchronous and asynchronous CDMA channels.     

Simple polynomial detectors for CDMA downlink transmissions on frequency-selective channels

In code-division multiple-access (CDMA) transmissions, computing the multiuser minimum mean-squared error (MMSE) detector coefficients requires the inversion of the covariance matrix associated to the received vector signal, an operation usually difficult to implement when the spreading factor and the number of users are large. It is therefore interesting to approximate the inverse by a matrix polynomial. In this correspondence, means for computing the polynomial coefficients are proposed in the context of CDMA downlink transmissions on frequency-selective channels, the users having possibly different powers. Derivations are made in the asymptotic regime where the spreading factor and the number of users grow toward infinity at the same rate. Results pertaining to the mathematics of large random matrices, and in particular to free probability theory, are used. Spreading matrices are modeled as isometric random matrices (spreading vectors orthonormality is a natural assumption in downlink) and also as random matrices with independent and identically distributed (i.i.d.) elements.     

异步DS-CDMA系统中相对时延对多用户检测的性能影响: 分析与评估

多用户检测技术是DS-CDMA系统中的关键技术之一。在反向链路的基站接收机一端,接收信号是各用户异步发射信号经传输信道后的叠加,许多多用户检测器的输入是对系统中各用户用特征波形匹配滤波后以符号速率采样的信号。然而,异步用户间不同的相对时延将引起不等的部分互相关系数,从而也导致不一样的多用户检测性能。该文分析了平均部分互相关系数的解析表达式并给出了计算方法,采用进化算法求解最大以及最小部分互相关系数存在的相对时延条件,提出了异步系统中多用户检测在平均、最大以及最小部分互相关系数条件下的性能分析与评估方法,对分析和比较多用户检测接收机整体性能具有很大意义。     

Optimization of linear iterative interference-cancellation receivers for CDMA communications

Iterative methods to solve a linear equation system can be used to derive multistage interference cancellers (ICs) that converge to the decorrelating or the minimum mean-square error linear detectors. The link between linear multistage IC and iterative solution methods is well known; however, the parameters needed for fastest convergence are functions of the eigenvalues of the channel matrix. In this letter, we propose new methods for finding optimal parameters without eigendecomposition.     

Adaptive joint multiuser detection and channel estimation in multipath fading CDMA channels

The problem of joint multiuser detection and channel estimation in frequency-selective Rayleigh fading CDMA channels is considered. First the optimal multiuser detector for such channels is derived, which is seen to have a computational complexity exponential in the product of the number of users and the length of the transmitted data sequence. Two suboptimal detectors are then developed and analyzed, both of which employ decorrelating filters at the front-ends to eliminate the multiple-access interference and the multipath interference. The symbol-by-symbol detector uses a Kalman filter and decision feedback to track the fading channel for diversity combining. The per-survivor sequence detector is in the form of the Viterbi algorithm with the trellis updates being computed by a bank of Kalman filters in the per-survivor fashion. Both suboptimal detectors require the knowledge of all waveforms of all users in the channel and the channel fading model parameters. Adaptive versions of these suboptimal detectors that require only the knowledge of the waveform of the user of interest are then developed. The adaptive receivers employ recursive-least-squares (RLS) minimum-mean-square-error (MMSE) filters at the front-end to mitigate the interference, and use a bank of linear predictors to track the fading channels. It is shown that the front-end RLS-MMSE filters can be implemented using systolic arrays to exploit massively parallel signal processing computation, and to achieve energy efficiency. Finally, the performance of the suboptimal detectors and their adaptive versions are assessed by simulations. This revised version was published online in July 2006 with corrections to the Cover Date.