Blind multiuser detection for asynchronous MC-CDMA systems without channel estimation

This paper presents a blind adaptive decorrelating detector for asynchronous multicarrier code-division multiple-access (MC-CDMA) systems with Rayleigh-fading channels. This detector is derived by making use of the cross-correlation matrix between the consecutively received signals. The main attraction of the detection algorithm is its simplicity, since the detector can be implemented blindly without channel estimation, except for the synchronization of the desired user. To implement the proposed detector, a new adaptive subspace-tracking algorithm for any Hamiltonian matrices is developed, while the previously reported subspace-tracking methods can only estimate the subspace of a positive Hamiltonian matrix. Since a common drawback of the multiuser detector based on the subspace method is the existence of a phase factor that usually deteriorates the performance of the detector, a new method is developed to compensate for the phase of the proposed detector, based on the property of the complex white Gaussian noise. Results of extensive computer simulations show the performance improvement of the proposed detector.     

带有块间串扰MC-CDMA的时域信道估计和多用户检测

本文把带有IBI的MC-CDMA系统等效解释为特殊的直接序列码分多址（DS-CDMA）系统，并给出了相应的时域信道估计方法和时域线性最小均方误差（MMSE）多用户检测方法。仿真实验表明了本文方法的性能。     

BER of MC-CDMA systems with MRC in correlated Nakagami-m fading

Based on the characteristic function of the sum of correlated gamma random variables and an alternative expression of Q-function, a simple bit error rate (BER) expression is derived for the multicarrier code division multiple access (MC-CDMA) systems with maximal ratio combining (MRC) in correlated Nakagami-m fading channels. The much simpler approximate average BER expression using exponential approximation of the Q-function is also derived.     

Space-time turbo multiuser detection for coded MC-CDMA

The system capacity and performance of multicarrier code-division multiple-access (MC-CDMA) communication systems can be significantly enhanced by jointly employing MAP-based multiuser detection (MUD) and channel decoding techniques. In this paper, a group-oriented soft iterative MUD based on the combination of smart antennas and iterative MAP-based MUD is presented. The proposed method is featured as a novel technique for further increasing the system capacity and performance. In this method, all the users are first grouped into several groups according to their impinging direction of arrivals (DOAs). All users with similar DOAs are classified into the same group and then low-complexity MAP-based iterative MUD is employed in each group. Because spatial filtering cannot suppress all the interference between the groups, interference cancellation among the groups is used prior to MUD within each group. It is shown that the proposed group-oriented soft iterative MUD algorithm can significantly reduce the computational complexity compared with the conventional optimal MAP-based MUD schemes. It is also demonstrated that the performance of the proposed algorithm can approach that of a single-user coded MC-CDMA system with an antenna array in additive white Gaussian noise and frequency selective fading channels.     

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     

BER performance evaluation for MC-CDMA systems in Nakagami-m fading

Based on the approximation of the sum of several Nakagami-m variables and an alternative expression of the Q-function, an efficient bit error rate (BER) expression is described. The closed BER form is applicable to multicarrier code-division multiple-access (MC-CDMA) systems with equal gain combining (EGC) in frequency selective Nakagami (1960) fading channels.     

Asymptotic analysis of blind multiuser detection with blind channel estimation

The analytical performance of the subspace-based blind linear minimum mean-square error (MMSE) multiuser detection algorithm in general multipath multi-antenna code-division multiple-access (CDMA) systems is investigated. In blind multiuser detection, the linear MMSE detector of a given user is estimated from the received signals, based on the knowledge of only the spreading sequence of that user. Typically, the channel of that user must be estimated first, based on the orthogonality between the signal and noise subspaces. An asymptotic limit theorem for the estimate of the blind linear detector (when the received signal sample size is large) is obtained, based on which approximate expressions of the average output signal-to-inference plus noise ratios (SINRs) and bit error rates (BERs) for both binary phase-shift keying (BPSK) and quaternary phase-shift keying (QPSK) modulations are given. Corresponding results for group-blind multiuser detectors are also obtained. Examples are provided to demonstrate the excellent match between the theory developed in this paper and the simulation results.     

Iterative semi-blind multiuser detection for coded MC-CDMA uplink system

We propose two types of iterative semi-blind receivers for coded multicarrier code-division multiple-access (MC-CDMA) uplink systems in the presence of both intracell and intercell interference. The first is based on the minimum mean-square error criterion, and the second is a hybrid scheme, consisting of parallel interference cancellation and linear multiuser detection. These iterative receivers utilize known users' information for the computation of log-likelihood ratios (LLR) while blindly suppressing unknown interference. The LLR are refined successively during the iterative process through decoding of all known users. Simulation results demonstrate that the proposed iterative semiblind methods offer substantial performance gain over conventional noniterative and nonblind iterative receivers.     

Hopfield multiuser detection of asynchronous MC-CDMA signals inmultipath fading channels

Multiuser reception using Hopfield neural network (HNN) for asynchronous multicarrier code-division multiple access (MC-CDMA) in a multipath fading channel is investigated. We have shown that by the appropriate choice of HNN parameters from the channel state information, the HNN can collectively resolve the multipath fading effects and the multiple-access interference in the system     

Performance bounds for optimum multiuser DS-CDMA systems

In this letter we estimate the bit error probability (BEP) of optimum multiuser detection for synchronous and asynchronous code division multiple access (CDMA) systems on Gaussian and fading channels. We first compute an upper bound and a lower bound on the bit error probability for a given spreading code, then average the bounds over a few thousand sets of spreading codes. These bounds are obtained from a partial distance spectrum. On Gaussian channels, the upper bound converges to the lower bound at moderate to large signal-to-noise ratios. However, on fading channels the upper bound does not converge, hence we present our results for the lower bound only. The numerical results show that: 1) the BEP of a 31-user CDMA system with binary random spreading codes of length 31 is only two to four times higher than the BEP of the single user system; 2) the number of users that can be accommodated in an asynchronous CDMA system is larger than the processing gain; and 3) optimum multiuser detection outperforms linear detection (e.g., the decorrelating detector) by about 2.8 to 5.7 dB     

Nonblind and semiblind space-time-frequency multiuser detection for space-time block-coded MC-CDMA

In this paper, a novel space-time-frequency minimum mean squared error (STF-MMSE)-based parallel interference cancellation receiver is proposed for space-time block-coded multicarrier code division multiple access systems in time-varying fading channels. The signal processing of this new detector is jointly implemented in space, time, and frequency domains, which leads to a powerful capability of combating interference coming from different sources. An adaptive implementation based on subspace estimation is proposed for slow-varying fading channels. Furthermore, based on the characteristic function of a complex Gaussian random vector, an analytical method to calculate the bit error probability of the proposed STF-MMSE receiver is presented. Representative examples of the detector are provided to demonstrate its superior performance.     

Performance of multiuser detection with adaptive channel estimation

An adaptive multipath decorrelating multiuser receiver is considered for application in Rayleigh fading multipath channels with significant Doppler spread. Coherent diversity combining is performed using adaptively obtained channel estimates in a manner that minimizes the impact of estimation errors on data detection. The bit-error rate of the receiver is evaluated analytically, showing dependence on the fading rate of the channel and tracking capabilities of adaptive least mean square and recursive least square algorithms, in addition to the order of multipath diversity and the number of active code-division multiple-access users     

BER minimized OFDM systems with channel independent precoders

We consider the minimization of uncoded bit error rate (BER) for the orthogonal frequency division multiplexing (OFDM) system with an orthogonal precoder. We analyze the BER performance of precoded OFDM systems with zero forcing and minimum mean squared error (MMSE) receivers. In the case of MMSE receivers, we show that for quadrature phase shift keying (QPSK), there exists a class of optimal precoders that are channel independent. Examples of this class include the discrete Fourier transform (DFT) matrix and the Hadamard matrix. When the precoder is the DFT matrix, the resulting optimal transceiver becomes the single carrier system with cyclic prefix (SC-CP) system. We also show that the worst solution corresponds to the conventional OFDM system; the conventional OFDM system has the largest BER. In the case of zero forcing receivers, the design of optimal transceiver depends on the signal-to-noise ratio (SNR). For higher SNR, solutions of optimal precoders are the same as those of MMSE receivers.     

Adaptive resource allocation for downlink grouped MC-CDMA systems with power and BER constraints

This paper proposes a complete solution to adaptively allocate resource for downlink Multi-Carrier Code Division Multiple Access (MC-CDMA) systems with the power and bit error rate (BER) constraints. Under frequency-selective fading channels, the whole spectrum is divided into several groups and each user is allocated to a group based on its channel state information (CSI). After grouping, the adaptive modulation algorithm assigns the bit loading and allocates the transmission power for each user according to its effective channel response. Simulation results show that the proposed solution can achieve high throughput, guarantee the required BER, and reduce the blocking probability.     

Performance analysis of MC-CDMA cellular systems employing MMSE multiuser detector in presence of own-cell and co-cell interference

In this work, it is analyzed the uplink performance of MC-CDMA cellular systems in order to show that a MMSE multiuser detector can mitigate not only the own-cell interference, but also the co-cell interference. For the analysis, it is also considered a linear antenna array at the base station. The channel includes additive white Gaussian noise, exponential path-loss and slow frequency-selective Rayleigh fading. First, the interference in the cellular system is analyzed. Then, approximate expressions to evaluate the signal-to-interference ratio (SIR) are derived. Also, expressions to evaluate the bit error rate (BER) both for BPSK and M-QAM modulations are obtained. Monte Carlo simulations verify the tightness of the expressions. The results show that when we include the co-cell interference statistics in the MMSE detector design, the effects of this interference can be mitigated. Also, it is observed that the system can be overloaded when the number of antennas in the array is increased while the mean BER maintains reasonable values. Finally, with an asymptotic analysis of the BER expressions, the BER reduction with the MMSE multiuser detector when compared with the zero-forcing multiuser detector is obtained. This BER reduction has not been previously obtained in the literature.     

Efficient BER evaluation of linear multiuser detectors with imperfect channel estimation for CDMA fading channels

In this paper, we present a unified mathematical framework to analyze the bit-error rate (BER) performance of general linear coherent multiuser receivers with diversity reception and imperfect channel estimation for doubly selective Rician-fading asynchronous code-division multiple-access channels. BERs of linear receivers with channel state information and data-aided channel estimation are analyzed, and both exact and low-complexity approximate BER evaluation formulas are presented. Furthermore, by using a Markov chain steady-state analysis, a tight BER approximation for receivers with decision-directed channel estimation is proposed. Numerical and simulation results verify the accuracy of the proposed BER evaluation methods.     

Subspace methods for blind joint channel estimation and multiuser detection in CDMA systems

Recently developed subspace techniques for blind adaptive multiuser detection are briefly reviewed first. In particular, blind methods based on signal subspace tracking for adapting linear multiuser detectors in AWGN CDMA channels are considered, as well as extensions of these techniques to frequency selective fading channels, dispersive channels, and antenna array spatial processing. In addition, subspace‐based nonlinear adaptive techniques for robust blind multiuser detection in non‐Gaussian ambient noise channels are also described. Several new techniques are then developed within the subspace framework for blind joint channel estimation and multiuser detection, under some specific channel conditions. These include (1) an adaptive receiver structure for joint multiuser detection and equalization in dispersive CDMA channels, (2) a subspace method for joint multiuser detection and equalization in unknown correlated noise, and (3) a method for joint interference suppression and channel tracking in time‐varying fading channels. This revised version was published online in August 2006 with corrections to the Cover Date.     

Fixed-point blind adaptive multiuser detection algorithm for IR UWB systems in multipath channel

Using the hypothesis that data transmitted by different users are statistically independent of each other, this paper proposes a fixed-point blind adaptive multiuser detection algorithm for Time-Hopping (TH) Impulse Radio (IR) Ultra Wide Band (UWB) systems in multipath channel, which is based on Inde-pendent Component Analysis (ICA) idea. The proposed algorithm employs maximizing negentropy criterion to separate the data packets of different users. Then the user characteristic sequences are utilized to identify the data packet order of the desired user. This algorithm only needs the desired user’s characteristic se-quence instead of channel information, power information and time-hoping code of any user. Due to using hypothesis of statistical independence among users, the proposed algorithm has the outstanding Bit Error Rate (BER) performance and the excellent ability of near-far resistance. Simulation results demonstrate that this algorithm has the performance close to that of Maximum-Likelihood (ML) algorithm and is a subopti-mum blind adaptive multiuser detection algorithm of excellent near-far resistance and low complexity.