SIR-optimized weighted linear parallel interference canceller on fading channels

In this letter, we present a weighted linear parallel interference canceller (LPIC) where the multiple access interference (MAI) estimate in a stage is weighted by a factor before cancellation on Rayleigh fading and diversity channels. We obtain exact expressions for the average signal-to-interference ratio (SIR) at the output of the cancellation stages which we maximize to obtain the optimum weights for different stages. We also obtain closed-form expressions for the optimum weights for the different stages. We show that this SIR-optimized weighted LPIC scheme clearly outperforms both the matched filter (MF) detector as well as the conventional LPIC (where the weight is taken to be unity for all stages), in both near-far as well as non-near-far conditions on Rayleigh fading and diversity channels.     

Near-far resistance of multiuser detectors in asynchronous channels

Consideration is given to an asynchronous code-division multiple-access environment in which receiver has knowledge of the signature waveforms of all the users. Under the assumption of white Gaussian background noise, the authors compare detectors by their worst case bit error rate in a near-far environment with low background noise, where the received energies of the users are unknown to the receiver and are not necessarily similar. Conventional single-user detection in a multiuser channel is not near-far resistant, and the substantially higher performance of the optimum multiuser detector requires exponential complexity in the number of users. The authors explore suboptimal demodulation schemes which exhibit a low order of complexity while not exhibiting the impairment of the conventional single-user detector. It is shown that there exists a linear detector whose bit-error-rate is independent of the energy of the interfering users. It is also shown that the near-far resistance of optimum multiuser detection can be achieved by a linear detector. The optimum linear detector for worst-case energies is found, along with existence conditions, which are always satisfied in the models of practical interest     

Linear multiuser detectors for synchronous code-divisionmultiple-access channels

Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, the authors analyze the detection mechanism at the receiver, comparing different detectors by their bit error rates in the low-background-noise region and by their worst-case behavior in a near-far environment where the received energies of the users are not necessarily similar. Optimum multiuser detection achieves important performance gains over conventional single-user detection at the expense of computational complexity that grows exponentially with the number of users. It is shown that in the synchronous case the performance achieved by linear multiuser detectors is similar to that of optimum multiuser detection. Attention is focused on detectors whose linear memoryless transformation is a generalized inverse of the matrix of signature waveform crosscorrelations, and on the optimum linear detector. It is shown that the generalized inverse detectors exhibit the same degree of near-far resistance as the optimum multiuser detectors. The optimum linear detector is obtained     

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     

Neural Network Implementation of the Optimum CDMA Multi-user Detector

lintroductionCDMA,owingtoitshighcapacitypotentialandotherdesirablefeatures,suchasanti-mutipath,fadingandantljammingcapabilities,isaimatprovidingamuchhighercapacitythanthepreviousgenerationsofmobilecommunicationsystems.ThistechniquepermitSalltheuserin...     

Parallel group detection for synchronous CDMA communication overfrequency-selective Rayleigh fading channels

A group detector jointly detects a group of users, and a parallel group detection scheme is a bank of J independently operating group detectors, one for each group of a J group partition of the K transmitting users of a code-division multiple-access (CDMA) channel. In this paper, two group detectors are introduced for the frequency-selective Rayleigh fading (FSRF) CDMA channel. While the optimum multiuser detector has a time complexity per symbol (TCS) of O(M ^K/K) for M-ary signaling, each of the two group detectors has a TCS of O(M(|G|)/|G|) where |G| is the group size. Hence, there are parallel group detection schemes, based on each of the two group detectors, that satisfy a wide range of complexity constraints that result from the choice of partition. Each of the two group detectors is minimax optimal in the corresponding conditional group near-far resistance measure. Furthermore, a succinct indicator of the average BER over high SNR regions is defined via the asymptotic efficiency. A lower bound and an exact formula for the asymptotic efficiency are derived for the first and second group detectors, respectively. The group detection approach for the FSRF-CDMA channel generalizes previous approaches to the complexity-performance tradeoff problem. It yields the optimum detector when the group size is K. When the group size is equal to one, the first group detector results in a new optimum linear detector and the second reduces to a recently proposed suboptimum linear detector. All other nontrivial partitions yield new multiuser detectors whose performances are commensurate with their complexities     

Group detection for synchronous Gaussian code-divisionmultiple-access channels

The concept of group detection Is introduced to address the design of suboptimum multiuser detectors for code-division multiple-access (CDMA) channels. A group detection scheme consists of a bank of P group detectors, one each for detecting the information symbols of users in each group of a P group partition of the K simultaneously transmitting users. In a parallel group detection scheme, these group detectors operate independently, whereas in a sequential scheme, each group detector. Uses the decisions of the previous group detectors to successively cancel the interference from those users. Group detectors based on the generalized likelihood ratio test (GLRT) are obtained for the synchronous Gaussian CDMA channel. The complexity of these detectors is exponential in the group size, whereas that of the optimum detector is exponential in K. Since the partition of users is a design parameter, group sizes can be chosen to satisfy a wide range of complexity constraints. A key performance result is that the GLRT group detectors are optimally group near-far resistant. Furthermore, upper and lower bounds on the asymptotic efficiency of the sequential group detectors are derived. These bounds reveal that the sequential group detectors can, under certain conditions, perform as well as GLRT group detectors of much larger group sizes. Group detection provides a unifying approach to multiuser detection. When the users are partitioned into K single-user groups, the GLRT, a modified form of GLRT, and the sequential group detectors reduce to previously proposed suboptimal detectors; namely, the decorrelator, the two-stage detector, and the decorrelating decision-feedback detector, respectively. For the other nontrivial partitions, the group detectors are new and have a performance that is commensurate with their complexity     

Performance analysis of O/sup 3/BPSK LDD for asynchronous CDMA systems in the presence of synchronization errors

A convenient signaling scheme, termed orthogonal on-off binary phase-shift keying (O/sup 3/BPSK), along with a simple one-shot linear decorrelating detector (LDD), was proposed by F.C. Zheng and S.K. Barton (see ibid., vol.47, p.969-76, 1998; Proc. IEEE PIMRC'94, p.194-8, 1994) as a technique for near-far resistant detection in asynchronous direct-sequence code-division multiple-access (DS/CDMA) systems. The temporally adjacent bits from different users in the received signals are decoupled by using on-off signaling, and the data rate is maintained with no increase in the transmission rate by adopting an orthogonal structure. The paper examines the effects of three classes of synchronization errors (time-delay errors, carrier phase errors, and carrier frequency errors) on the performance of the O/sup 3/BPSK LDD in an asynchronous CDMA near-far environment. It is shown that the performance of the O/sup 3/BPSK LDD has an advantage over that of the isolation bit insertion detector in the presence of synchronization errors. In addition, numerical results show that the O/sup 3/BPSK LDD still offers a good near-far resistant property as long as synchronization errors do not exceed some practical limit.     

On the average near-far resistance for MMSE detection of directsequence CDMA signals with random spreading

The performance of a near-far-resistant, finite-complexity, minimum mean squared error (MMSE) linear detector for demodulating direct sequence (DS) code-division multiple access (CDMA) signals is studied, assuming that the users are assigned random signature sequences. We obtain tight upper and lower bounds on the expected near-far resistance of the MMSE detector, averaged over signature sequences and delays, as a function of the processing gain and the number of users. Since the MMSE detector is optimally near-far-resistant, these bounds apply to any multiuser detector that uses the same observation interval and sampling rate. The lower bound on near-far resistance implies that, even without power control, linear multiuser detection provides near-far-resistant performance for a number of users that grows linearly with the processing gain     

The Applicative Investigation of Adaptive BP Networks for Multi-user Detection in Asynchronous DS-CDMA Mobile Communications

1　ＩｎｔｒｏｄｕｃｔｉｏｎＭｕｌｔｉｐｌｅａｃｃｅｓｓｉｎｇｉｎｔｈｅｃｏｄｅｄｏｍａｉｎｉｓａｃｈｉｅｖｅｄｂｙｓｐｒｅａｄｉｎｇｔｈｅｓｐｅｃｔｒｕｍｏｆｔｈｅｔｒａｎｓｍｉｔ ｔｅｄｓｉｇｎａｌｓｕｓｉｎｇｐｒｅａｓｓｉｇｎｅｄｃｏｄｅｉｎｆｏｒｍａｔｉｏｎ .Ｓｉｎｃｅｉｔｉｓｎｏｔｐｏｓｓｉｂｌｅｔｏｄｅｓｉｇｎｓｉｇｎａｔｕｒｅｓｅｑｕｅｎｃｅｆｏｒａｎｙｐａｉｒｏｆｕｓｅｒｓｔｈａｔａｒｅｉｄｅａｌｌｙｏｒｔｈｏｇｏｎａｌ,ｔｈｅｉｎｔｅｒ ｆｅｒｅｎｃｅｆｒｏｍｔｈｅｏｔｈｅｒｕｓｅ…     

Linear space-time multiuser detection for multipath CDMA channels

We consider the problem of detecting synchronous code division multiple access (CDMA) signals in multipath channels that result in multiple access interference (MAI). It is well known that such challenging conditions may create severe near-far situations in which the standard techniques of combined power control and temporal single-user RAKE receivers provide poor performance. To address the shortcomings of the RAKE receiver, multiple antenna receivers combining space-time processing with multiuser detection have been proposed in the literature. Specifically, a space-time detector based on minimizing the mean-squared output between the data stream and the linear combiner output has shown great potential in achieving good near-far performance with much less complexity than the optimum space-time multiuser detector. Moreover, this space-time minimum mean-squared error (ST-MMSE) multiuser detector has the additional advantage of being well suited for adaptive implementation. We propose novel trained and blind adaptive algorithms based on stochastic gradient techniques, which are shown to approximate the ST-MMSE solution without requiring knowledge of the channel. We show that these linear space-time detectors can potentially provide significant capacity enhancements (up to one order of magnitude) over the conventional temporal single-user RAKE receiver     

An Adaptive MMOE-PIC Detector for Asynchronous DS-CDMA Communications

We propose a modified linear parallel interference cancelation (PIC) structure using the adaptive minimum mean output-energy (MMOE) algorithm for direct-sequence code-division multiple-access (DS-CDMA) systems. The complexity of the proposed receiver structure is shown to be linear in the number of users and hence, lower complexity than the centralized minimum mean-squared error (MMSE) multiuser detector. It is demonstrated that the proposed receiver structure can significantly reduce the long training period required by the standard adaptive MMOE receiver in near-far environments. Both numerical and theoretical results show that the proposed receiver performs close to the optimum MMSE receiver whereas the conventional adaptive MMOE detector suffers from high BER’s due to the imperfect filter coefficients. Also our results show a three fold increase in the number of users when the MMOE-PIC is used relative to the conventional MMOE receiver. Furthermore, the transient behavior of the proposed MMOE-PIC receiver due to abrupt changes in the interference level is examined. It is shown that the proposed adaptive receiver offers much faster self recovery, with less signal-to-interference ratio (SIR) degradation, than the standard MMOE in sever near-far scenarios.     

Multiuser detection of asynchronous CDMA with frequency offset

This article presents a near-far resistant detection scheme for asynchronous code-division multiple access with frequency offset. Based on a one-shot technique and Taylor expansion, a zeroth-order and a first-order one-shot linear decorrelating detector (LDD) are proposed. The zeroth-order LDD has simple architecture but suffers performance degradation for large frequency offset. The first-order one-shot LDD, with increased complexity, has very good near-far resistant property even for large frequency offset. Two versions of the first-order one-shot LDD are investigated according to different Taylor expansion approaches. The feasibility of the proposed detectors is demonstrated by computer simulations     

Performance of a Multiuser Detector with Multicarrier Transmission for a DS/CDMA System

In this paper, a new multiuser detector combining decorrelating detector and multicarrier transmission scheme is proposed and analyzed in a frequency selective Rayleigh fading channel. The bit error probability and asymptotic multiuser efficiency are derived as performance measures. From numerical results, it is shown that the proposed detector achieves better BER performance and lower computational complexity compared to a conventional decorrelating detector. It is also shown that the proposed detector is robust to partial narrowband interference, and alleviates near-far problem effectively. The results in this paper can be applied to design of a wideband CDMA system.     

采用symbol级干扰对消的多用户检测方法

CDMA通信系统中常规的匹配滤波器接收机无法克服CDMA的多址干扰和远近效应,而已有的干扰抑制的多用户接收机都比较复杂,在进行干扰对消中均需要对信号进行重建,增加了系统延时。文中提出了一种基于门限判决和symbol级对消的多用户检测方法,它在symbol级上重构了真正的多址干扰成分,并依据门限,选择性地在symbol极上进行对消。理论分析和数值计算表明这种方法与常规方法和其它干扰对消方法相比能够有效减少运算量,提高解调信噪比和处理速度,提高抗多址干扰能力。     

一种神经网络多用户检测器

本文提出采用Ｈｏｐｆｉｅｌｄ神经网络实现ＣＤＭＡ多用户通信系统中多用户信号的检测。利用基于检测序列最大后验概率最佳多用户检测器的似然函数与Ｈｏｐｆｉｅｌｄ神经网络的能量函数的对应关系,构造一种离散Ｈｏｐｆｉｅｌｄ神经网络多用户检测器。研究表明,这种多用户检测器具有优良的性能,其计算复杂度低于最佳多用户检测器、抑制多址干扰和克服远近效应能力又大大优于传统检测器。     

Noncoherent detection in asynchronous multiuser channels

The noncoherent demodulation of multiple differentially phase-shift-keyed signals transmitted simultaneously over an asynchronous code-division multiple-access (CDMA) channel with white Gaussian background noise is considered. A class of bilinear detectors is defined with the objective of obtaining the optimal bilinear detector. The optimality criterion considered is near-far resistance that denotes worst-case asymptotic efficiency over the signal energies and phases which are unknown at the receiver. The optimal bilinear detector is therefore obtained by solving a minimax optimization problem. In the finite packet length case, this detector is shown to be a time-varying multiinput multioutput linear decorrelating filter followed by differential decision logic. In the limit as packet lengths go to infinity, the time-varying decorrelating detector is replaced by a time-invariant multiinput multioutput decorrelating filter. Several properties of the optimally near-far resistant detector are established     

一种基于禁忌搜索的多用户检测方法

本文提出一种实现码分多址(ＣＤＭＡ)系统上多用户检测(ＭＵＤ)的禁忌搜索(ｔａｂｕｓｅａｒｃｈ)的方法。 该方法利用传统检测方法的输出作为初始解,直接应用禁忌搜索算法来解决最佳多用户检测的非线性优化组合问题。通过分析以及对同步和异步情况的仿真表明,该方法简单易于实现,具有多项式的计算复杂度,对远近问题不敏感,并且能够得到与最佳检测方法(ＯＤ)非常接近的误码率性能和抗多址干扰性能．     

混合粒子群优化算法在CDMA系统多用户检测中的应用

针对粒子群优化算法易早熟的问题,提出了一种混合粒子群优化算法(HPSO)。首先在算法中采用惯性权重的分段递减策略,以提高算法的全局搜索能力;然后在算法后期,引入拉伸技术剔除比局部极值大的点,缩小搜索空间,使算法能及时跳出局部最优从而加速收敛,最后提出了基于HPSO算法的多用户检测器。仿真结果表明在信噪比相同的条件下,该多用户检测器的误码率和抗远近效应性能更接近于最佳多用户检测器,有效解决了码分多址通信系统中的多址干扰问题。     

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