Space-Code CS-CDMA Systems over MISO Frequency-Selective Rayleigh Fading Channels

We propose a transmit diversity CDMA scheme which is a combination of convolutional spreading (CS) and space-time spreading (STS) over multiple-input single-output (MISO) multipath Rayleigh fading channels. With our scheme, multiuser detection over an MISO multipath channel is transformed to single-user detection over a single-input single-output (SISO) multipath channel as the scheme by Petre et al. Because of its simple configuration, it is immediate to see that our scheme realizes full transmit- and path-diversity for two transmit antennas. We extend the system to four transmit antennas employing quasi-orthogonal construction and show a necessary and sufficient condition for full transmit- and path-diversity to be realized. The proposed scheme requires less hardware complexity and less latency than the one by Petre et al.     

Large system performance of linear multiuser receivers in multipathfading channels

A linear multiuser receiver for a particular user in a code-division multiple-access (CDMA) network gains potential benefits from knowledge of the channels of all users in the system. In fast multipath fading environments we cannot assume that the channel estimates are perfect and the inevitable channel estimation errors will limit this potential gain. We study the impact of channel estimation errors on the performance of linear multiuser receivers, as well as the channel estimation problem itself. Of particular interest are the scalability properties of the channel and data estimation algorithms: what happens to the performance as the system bandwidth and the number of users (and hence channels to estimate) grows? Our main results involve asymptotic expressions for the signal-to-interference ratio of linear multiuser receivers in the limit of large processing gain, with the number of users divided by the processing gain held constant. We employ a random model for the spreading sequences and the limiting signal-to-interference ratio expressions are independent of the actual signature sequences, depending only on the system loading and the channel statistics: background noise power, energy profile of resolvable multipaths, and channel coherence time. The effect of channel uncertainty on the performance of multiuser receivers is succinctly captured by the notion of effective interference     

Group-blind intersymbol multiuser detection for downlink CDMA with multipath

Group-blind multiuser detectors for uplink code-division multiple-access (CDMA) were recently developed by Wang and Host-Madsen. These detectors make use of the spreading sequences of known users to construct a group constraint to suppress the intracell interference. However, such techniques demand the estimation of the multipath channels and the delays of the known users. In this paper, several improved blind linear detectors are developed for CDMA in fading multipath channels. The proposed detectors utilize the correlation information between consecutively received signals to generate the corresponding group constraint. It is shown that by incorporating this group constraint, the proposed detectors can provide different performance gains in both uplink and downlink environments. Compared with the previously reported group-blind detectors, our new methods only need to estimate the multipath channel of the desired user and do not require the channel estimation of other users. Simulation results demonstrate that the proposed detectors outperform the conventional blind linear multiuser detectors.     

A generalized linear quasi-ML decoder of OSTBCs for wireless communications over time-selective fading channels

We propose a novel generalized linear quasi-maximum-likelihood (quasi-ML) decoder for orthogonal space-time block codes (OSTBCs) for wireless communications over time-selective fading channels. The proposed decoder computes the decision statistics based on the channel-state information and completely removes the intertransmit-antenna interference to provide excellent diversity advantage when the channel varies from symbol to symbol. It is shown that when the channel is quasi-static, the proposed decoder is the optimum ML decoder for OSTBCs. The theoretical bit-error probabilities of the proposed decoder are given and it is shown that the proposed decoder does not exhibit error floors at high signal-to-noise ratios like the decoder proposed in and . Simulation results for various channel-fading rates are presented to verify the theoretical analysis.     

Multiuser channel estimation and tracking for long-code CDMA systems

Channel estimation techniques for code-division multiple access (CDMA) systems need to combat multiple access interference (MAI) effectively. Most existing estimation techniques are designed for CDMA systems with short repetitive spreading codes. However, current and next-generation wireless systems use long spreading codes whose periods are much larger than the symbol duration. We derive the maximum-likelihood channel estimate for long-code CDMA systems over multipath channels using training sequences and approximate it using an iterative algorithm to reduce the computational complexity in each symbol duration. The iterative channel estimate is also shown to be asymptotically unbiased. The effectiveness of the iterative channel estimator is demonstrated in terms of squared error in estimation as well as the bit error rate performance of a multistage detector based on the channel estimates. The effect of error in decision feedback from the multistage detector (used in the absence of training sequences) is also shown to be negligible for reasonable feedback error rates using simulations. The proposed iterative channel estimation technique is also extended to track slowly varying multipath fading channels using decision feedback. Thus, an MAI-resistant multiuser channel estimation and tracking scheme with reasonable computational complexity is derived for long-code CDMA systems over multipath fading channels.     

On the design of space-time and space-frequency codes for MIMO frequency-selective fading channels

The authors introduced an algebraic design framework for space-time coding in flat-fading channels . We extend this framework to design algebraic codes for multiple-input multiple-output (MIMO) frequency-selective fading channels. The proposed codes strive to optimally exploit both the spatial and frequency diversity available in the channel. We consider two design approaches: The first uses space-time coding and maximum likelihood decoding to exploit the multi-path nature of the channel at the expense of increased receiver complexity. Within this time domain framework, we also propose a serially concatenated coding construction which is shown to offer a performance gain with a reasonable complexity iterative receiver in some scenarios. The second approach utilizes the orthogonal frequency division multiplexing technique to transform the MIMO multipath channel into a MIMO flat block fading channel. The algebraic framework is then used to construct space-frequency codes (SFC) that optimally exploit the diversity available in the resulting flat block fading channel. Finally, the two approaches are compared in terms of decoder complexity, maximum achievable diversity advantage, and simulated frame error rate performance in certain representative scenarios.     

Multiuser detection in asynchronous CDMA frequency-selective fading channels

Multipath fading severely limits the performances of conventional code division multiple-access (CDMA) systems. Since every signal passes through an independent frequency-selective fading channel, even modest cross-correlations among signature sequences may induce severe near-far effects in a central multiuser receiver. This paper presents a systematic approach to the detection problem in CDMA frequency-selective fading channels and proposes a low complexity linear multiuser receiver, which eliminates fading induced near-far problem.We initially analyze an optimal multiuser detector, consisting of a bank of RAKE filters followed by a dynamic programming algorithm and evaluate its performance through error probability bounds. The concepts of error sequence decomposition and asymptotic multiuser efficiency, used to characterize the optimal receiver performance, are extended to multipath fading channels.The complexity of the optimal detector motivates the work on a near-far resistant, low complexity decorrelating multiuser detector, which exploits multipath diversity by using a multipath decorrelating filter followed by maximal-ratio combining. Analytic expressions for error probability and asymptotic multiuser efficiency of the suboptimal receiver are derived that include the effects of multipath fading, multiple-access interference and signature sequences correlation on the receiver's performance.The results indicate that multiuser detectors not only alleviate the near-far problem but approach single-user RAKE performance, while preserving the multipath diversity gain. In interference-limited scenarios multiuser receivers significantly outperform the RAKE receiver.This paper was presented in part at the Twenty-Sixth Annual Conference on Information Sciences and Systems, Princeton, NJ, March 1992 and MILCOM'92, San Diego, CA, October 1992. This work was performed while author was with the Department of Electrical and Computer Engineering, Northeastern University, Boston, USA.     

Multiuser detection in fast-fading multipath environments

We propose a new framework for multiuser detection in fast-fading channels that are encountered in many mobile communication scenarios. Existing multiuser RAKE receivers, developed to combat multipath fading and multiuser interference in slow fading, suffer substantial degradation in performance under fast fading due to errors in channel state estimation. The detectors proposed in this paper employ a novel receiver structure based on time-frequency (TF) processing that is dictated by a canonical representation of the wide-sense stationary uncorrelated scatterer (WSSUS) channel model. The workhorse of the framework is a TF generalization of the RAKE receiver that exploits joint multipath-Doppler diversity. Analytical and simulated results based on realistic fast-fading assumptions demonstrate that the proposed multiuser detectors promise substantially improved performance compared to existing systems due to the inherently higher level of diversity afforded by multipath-Doppler processing     

Group-blind multiuser detection for uplink CDMA

Previously developed blind techniques for multiuser detection in code division multiple access (CDMA) systems lead to several near-far resistant adaptive receivers for demodulating a given user's data with the prior knowledge of only the spreading sequence of that user. In the CDMA uplink, however, typically the base station receiver has the knowledge of the spreading sequences of all the users within the cell, but not that of the users from other cells. In this paper, group-blind techniques are developed for multiuser detection in such scenarios. These new techniques make use of the spreading sequences and the estimated multipath channels of all known users to suppress the intracell interference, while blindly suppressing the intercell interference. Several forms of group-blind linear detectors are developed based on different criteria. Moreover, group-blind multiuser detection in the presence of correlated noise is also considered. In this case, two receiving antennas are needed for channel estimation and signal separation. Simulation results demonstrate that the proposed group-blind linear multiuser detection techniques offer substantial performance gains over the blind linear multiuser detection methods in a CDMA uplink environment     

Adaptive feedforward/feedback architectures for multiuser detectionin high data rate wireless CDMA networks

We consider the design and performance of nonlinear minimum mean-square-error multiuser detectors for direct sequence code-division multiple-access (CDMA) networks. With multiple users transmitting asynchronously at high data rates over multipath fading channels, the detectors contend with both multiple-access interference (MAI) and intersymbol interference (ISI). The cyclostationarity of the MAI and ISI is exploited through a feedforward filter (FFF), which processes samples at the output of parallel chip-matched filters, and a feedback filter (FBF), which processes detected symbols. By altering the connectivity of the FFF and FBF, we define four architectures based on fully connected (FC) and nonconnected (NC) filters. Increased connectivity of the FFF gives each user access to more samples of the received signal, while increased connectivity of the FBF provides each user access to previous decisions of other users. We consider three methods for specifying the FFF sampling and propose a nonuniform FFF sampling scheme based on multipath ray tracking that can offer improved performance relative to uniform FFF sampling. For the FC architecture, we capitalize on the sharing of filter contents among users by deriving a multiuser recursive least squares (RLS) algorithm and direct matrix inversion approach, which determine the coefficients more efficiently than single-user algorithms. We estimate the uncoded bit-error rate (BER) of the feedforward/feedback detectors for CDMA systems with varying levels of power control and timing control for multipath channels with quasi-static Rayleigh fading. Simulations of packet-based QPSK transmission validate the theoretical BER analysis and demonstrate that the multiuser RLS adapted detectors train in several hundred symbols and avoid severe error propagation during data transmission mode     

在相关多入多出(MIMO)信道中的可变速率多用户分集技术

在本篇文章中,我们研究基于MIMO虚拟信道表述的可变速率多用户分集技术.为实现慢衰落相关信道中的多用户分集,本文在发射端采用随机波束成形技术,并提出一种新的利用MIMO虚拟信道来产生随机波束成形矩阵的方法.同时,我们对期望用户的子信道采用自适应编码调制技术,以进一步提高系统性能.     

Algebraic properties of space-time block codes in intersymbol interference multiple-access channels

In this paper, we study the multiple-access channel where users employ space-time block codes (STBC). The problem is formulated in the context of an intersymbol interference (ISI) multiple-access channel which occurs for transmission over frequency-selective channels. The algebraic structure of the STBC is utilized to design joint interference suppression, equalization, and decoding schemes. Each of the K users transmits using M/sub t/=2 transmit antennas and a time-reversed STBC suitable for frequency-selective channels. We first show that a diversity order of 2M/sub r/(/spl nu/+1) is achievable at full transmission rate for each user, when we have M/sub r/ receive antennas, channel memory of /spl nu/, and an optimal multiuser maximum-likelihood (ML) decoder is used. Due to the decoding complexity of the ML detector we study the algebraic structure of linear multiuser detectors which utilize the properties of the STBC. We do this both in the transform (D-domain) formulation and when we impose finite block-length constraints (matrix formulation). The receiver is designed to utilize the algebraic structure of the codes in order to preserve the block quaternionic structure of the equivalent channel for each user. We also explore some algebraic properties of D-domain quaternionic matrices and of quaternionic circulant block matrices that arise in this study.     

Space-Time-Block-Coded Transmissions for Downlink MC-CDMA Transmissions Over Frequency-Selective Fading Channels

Mitigation of multipath fading effects and suppression of multiuser interference (MUI) constitute major challenges in the design of the third generation wireless mobile systems. Space-time (ST) coding offers a attractive solution to cope with mutipath fading, but most existing ST coding schemes assume flat fading channels that may not be realistic for wide-band communications. Especially multiuser ST block-coded transmissions through multipath fading channels present unique challenge in suppressing not only MUI but also intersymbol/chip interference. In this paper, we design ST multiuser transceivers for MC-CDMA quasi-synchronous systems, capable to reliably transmit over frequency-selective multipath downlink channels. The proposed system is able to provide transmit diversity and to guarantee symbol recovery in multiuser environments, regardless of unknown multipath. Unlike existing approaches, the mobile does not need to know the channel of other users. In addition to decoding simplicity, computer simulations show the performance merits of the proposed transceiver.     

A Study of the Technique of Linear Multiuser

The technique of linear multiuser detection in DS-CDMA systems is studied in this paper. The purpose is to find a receiver structure with good performance and moderate complexity, so that the receiver can efficiently suppress multiple-access interference(MAI) and multipath interference and has good near-far resistant ability, which may improve the system's capability while reducing the requirement for power control. The main work of the dissertation can be summarized as follows: the performance of MMSE multiuser detector in synchronous/asynchronous DS-CDMA systems over different channels is analyzed in chapter 2 of the dissertation. Using matrix method, we analyze the relation between performance measurement and spreading code correlation matrix, Signal-Interference-Ratio(SIR) and near-far factor, and prove that the performance of MMSE detector is better than that of the decorrelating detector. For fading channel, we analyze the performance of MMSE detector in DS-SS system firstly. Results show that the detector can efficiently suppress multipath interference. Extending to synchronous/asynchronous DS-CDMA systems over fading channels, we propose a simple linear detector structure that accomplishes despreading, detection and combining. Thus, the receiver is easy for implementation. Based on the proposed notion of combined spreading codes, we prove that the synchronous/asynchronous CDMA system is equivalent to the synchronous CDMA system over AWGN channel with double users. Therefore, the MMSE detector can efficiently suppress MAI and multipath interference in steady state, and has good near-far resistant ability. In chapter 3, we study the adaptive algorithm based on MMSE criterion. Firstly, the approach to the blind algorithm based on subspace is analyzed. We improve the algorithm in the part of channel estimation, which decreases the computational complexity while guaranteeing the performance. Meanwhile, we point out that CMOE-RLS algorithm is essentially an algorithm based on subspace approach. Also, it is shown from simulation that PASTd subspace tracking algorithm is not applicable for multiuser detection. Secondly, we propose an adaptive algorithm based on pilot channel, called PCA/PCRA. The algorithm does not require channel estimation, and has a rapid convergence rate. The steady state performance can be achieved by increasing the transmitting power in pilot channel. Computational complexity is only O(N2). Therefore, PCA/PCRA is suitable for the engineering application. The cost is that a pilot channel is needed for each user in the system. In chapter 4, constant algorithms for multiuser detection are studied. Firstly, we analyze the capture performance of CMA, and point out there exist many local stationary points. Initializations to guarantee CMA converges to the desired point are discussed. Results show that the convergence of CMA is decided by constant, step-size, spreading code correlation matrix and near-far factor. Secondly, we propose the constrained constant algorithm (C-CMA) for multiuser detection. It is shown that when the constant is greater than the triple power of the desired user, C-CMA globally converges to the desired point. Simulations illustrate that C-CMA has a rapid convergence rate and the steady state performance is good. However, great step-size can also reult in dispersion for the algorithm. Since C-CMA is a variable step-size CMOE-LMS algorithm, we propose a variable step-size constraint algorithm (VSCA). VSCA has the advantages of both CMOE-LMS and C-CMA such as robust, rapid convergence rate and good steady state performance. Thus, VSCA is suitable for engineering application. But the improper selection of step-size coefficients may degrade performance seriously. The computational complexity of the above constant algorithms is only O(N). In Section 5, the cyclostationarity of spreading signals is analyzed in the first part. We prove that spreading signals are ergodic cyclostationary signals with a cyclic period that is equal to the period of spreading code. Methods for processing cyclostationary signals are then given. It is shown that this method can mitigate the interference from a stationary noise for channel estimation. But the computational complexity for cyclostationary correlation is high, which prevents its application in implementation. In the second part, we discuss the application of oversampling technique in spreading communication systems. Although the oversampling can improve the performance of the linear multiuser detector, the improvement is trivial. On the contrary, oversampling increases the computational complexity of the weight vector greatly, which prevents its application in implementation. Additionally, we prove that FSE plus despreading or despreading pus FSE is equivalent to the linear detector with different lengths of delay line. However, the two kinds of structure have lower computational complexity.     

MUI-free receiver for a synchronous DS-CDMA system based on blockspreading in the presence of frequency-selective fading

We discuss a synchronous direct-sequence code division multiple-access (DS-CDMA) system based on block spreading in the presence of frequency-selective fading. Note that block spreading, which is also known as chip interleaving, refers to a spreading of a data block sequence, which is obtained by dividing a data symbol sequence into consecutive blocks. For such a system, we develop a simple new receiver that completely removes the multiuser interference (MUI) without using any channel information. The MUI-free operation is obtained by the use of a shift-orthogonal set of code sequences on which this receiver is based. Within the framework of the MUI-free receiver, we further present a subspace deterministic blind single-user channel estimation algorithm. As a benchmark for the MUI-free receiver and the corresponding subspace deterministic blind single-user channel estimation algorithm, we consider the linear multiuser equalizer and the corresponding subspace deterministic blind multiuser channel estimation algorithm developed by Liu and Xu (1996) for a standard synchronous DS-CDMA system in the presence of frequency-selective fading. We show that the complexity of the MUI-free receiver using the corresponding subspace deterministic blind single-user channel estimation algorithm is much smaller than the complexity of the linear multiuser equalizer using the corresponding subspace deterministic blind multiuser channel estimation algorithm. We further show that the performance of the MUI-free receiver is comparable with the performance of the linear multiuser equalizer. This is for the case in which the channels are known as well as for the case in which the channels are estimated with the corresponding subspace deterministic blind channel estimation algorithm     

Space-time block-coded multiple access through frequency-selectivefading channels

Mitigation of multipath fading effects and suppression of multiuser interference (MUI) constitute major challenges in the design of wide-band third-generation wireless mobile systems. Space-time (ST) coding offers an effective transmit-antenna diversity technique to combat fading, but most existing ST coding schemes assume flat fading channels that may not be valid for wide-band communications. Single-user ST coded orthogonal frequency-division multiplexing transmissions over frequency-selective channels suffer from finite-impulse response channel nulls (fades). Especially multiuser ST block-coded transmissions through (perhaps unknown) multipath present unique challenges in suppressing not only MUI but also intersymbol/chip interference. In this paper, we design ST multiuser transceivers suitable for coping with frequency-selective multipath channels (downlink or uplink). Relying on symbol blocking and a single-receive antenna, ST block codes are derived and MUI is eliminated without destroying the orthogonality of ST block codes. The system is shown capable of providing transmit diversity while guaranteeing symbol recovery in multiuser environments, regardless of unknown multipath. Unlike existing approaches, the mobile does not need to know the channel of other users. In addition to decoding simplicity, analytic evaluation and corroborating simulations reveal its flexibility and performance merits     

A subspace approach to blind space-time signal processing forwireless communication systems

The two key limiting factors facing wireless systems today are multipath interference and multiuser interference. In this context, a challenging signal processing problem is the joint space-time equalization of multiple digital signals transmitted over multipath channels. We propose a blind approach that does not use training sets to estimate the transmitted signals and the space-time channel. Instead, this approach takes advantage of spatial and temporal oversampling techniques and the finite alphabet property of digital signals to determine the user symbol sequences. The problem of channels with largely differing and ill-defined delay spreads is discussed. The proposed approach is tested on actual channel data     

Analysis and design of short block OFDM spreading matrices for use on multipath fading channels

We consider the use of block spreading in a multicarrier system to gain diversity advantage when employed over multipath fading channels. The main idea is to split the full set of subcarriers into smaller blocks and spread the data symbols across these blocks via unitary spreading matrices in order to gain multipath diversity across each block at the receiver. We pose the problem of designing the spreading matrix as a finite dimensional optimization problem in which the asymptotic error is minimized. This formulation allows us to find explicit solutions for the optimal spreading matrices. The performance is validated for the uncoded channel as well as for the coded channel employing turbo-iterative decoding. We further demonstrate that suboptimal linear complexity equalization strategies for spread orthogonal frequency division multiplexing (OFDM) do not gain any diversity advantage over traditional diagonal OFDM.     

Group-metric multiuser decoding

We propose the new group metric (GM) soft-decision decoder for convolutionally coded synchronous multiple-access channels. The GM decoder exploits the independently operating encoders of the multiuser channel by making decoding decisions for a subset of the users, but incorporating all the multiuser information in its metrics. For a single user, this decoder will have a reduced complexity that is exponential in the sum of encoder memory and the number of users. The soft-decision maximum-likelihood (ML) joint decoder is well known. This optimal decoder suffers from a high complexity requirement that is exponential in the product of encoder memory and the number of users. The size of the decoded subset is a design parameter which allows a tradeoff between complexity and performance. The performance of the GM decoder, once properly characterized, can be analyzed using standard techniques. In addition, a new analysis technique is presented which considers decomposable sequences for the fading channel. With this analysis, we have a new tool for bounding error probabilities for multiuser decoders. Applying this technique to the GM decoder, we can directly identify sequences that are decomposable some fraction of the time, and obtain a new upper bound. Further, this improved bound can be expressed in closed form. Numerical results show that the actual performance gap between the GM and ML decoders can be quite small     

PN sequence blind estimation in multiuser DS‐CDMA systems with multipath channels based on successive subspace scheme

In this paper, we proposed a new method based on expanding subspace algorithm and finite alphabet characteristics, for blind estimation of the users' spreading sequences in the multiuser direct sequence code division multiple access system in the presence of the multipath channels. In the proposed scheme, we show that the estimation of the users' overall channels in the direct sequence code division multiple access system is equivalent to the impulse response estimation of the multi‐input multi‐output finite impulse response channels. Our proposed approach is based on the successive estimation of the columns of the equivalent multi‐input multi‐output finite impulse response channels from the lowest degree columns to the highest degree ones. Accordingly, each user's overall channel that is the convolution of the original multipath channel and the spreading sequence is estimated. Then we extract PN sequences from the overall channel using finite alphabet characteristics of the spreading sequence chips for each user. According to simulation results, our proposed scheme outperforms the conventional methods in that it does not require symbol synchronization and does not have channel constraints (for example, AWGN and single user system) in the multipath channels.