Turbo编码DS/CDMA系统中的迭代多用户接收器

本文提出了一种用于Turbo编码DS/CDMA系统的迭代多用户接收器。该接收器由一个软输入/软输出（SISO）的多用户检测器和一组单用户SISO信道译码器组成。每次迭代过程中，多用户检测器和信道译码器都输出信息作为下一代迭代的先验信息，仿真结果表明，这种接收器的比特误码性能接近Turbo编码系统的单用户限。     

Turbo greedy multiuser detection

Previously, a novel scheme for iterative multiuser detection and turbo decoding was proposed by Damnjanovic and Vojcic (2000, 2001). In this scheme, multiuser detection and single-user turbo decoding are tightly coupled to maximize the overall gain. The extrinsic probabilities for the coded bits of the interfering users, obtained after each turbo decoding iteration, are used as a priori probabilities in the following multiuser iteration and the extrinsic information for the systematic bits of the desired user is used as a priori information in the next single-user turbo decoding iteration. Turbo decoding of parallel concatenated convolutional codes is carried out in parallel fashion. It has been shown that the proposed detector approaches the multiuser capacity limit within 1 dB in the low signal-to-noise ratio region. However, the main drawback of the scheme is its exponential complexity in the number of users, which is due to the complexity of the maximum a posteriori probability (MAP) multiuser detector. In this paper, we show that the complexity of the scheme can be significantly reduced by replacing the (MAP) multiuser detector with an iterative detector derived from the greedy multiuser detector proposed by AlRustamani and Vojcic (2000). In this paper, we demonstrate that, for both the additive white Gaussian noise and the frequency-nonselective Rayleigh fading, the substantial reduction in complexity of the iterative scheme proposed by Damnjanovic and Vojcic when the greedy detector is utilized introduces a slight degradation in performance     

Decision-feedback soft-input/soft-output multiuser detector foriterative decoding of coded CDMA

The optimal decoding scheme for a code-division multiple-access (CDMA) system that employs convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input/soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders. However, a direct implementation of the full-complexity SISO multiuser detector also has the exponential computational complexity in terms of the number of users. This paper proposes a low-complexity SISO multiuser detector based on tentative hard decisions that are made and fed back from the channel decoders in the previous iteration. The computational complexity of the proposed detector is linear in terms of the number of users and can be adjusted according to the complexity/performance tradeoff. Simulation results show that even with this simple feedback scheme, the performance of the coded multiuser system approaches that of the single-user system for moderate to high signal-to-noise ratios (SNRs)     

Iterative receivers for multiuser space-time coding systems

Space-time coding (STC) techniques, which combine antenna array signal processing and channel coding techniques, are very promising approaches to substantial capacity increase in wireless channels. Multiuser detection techniques are powerful signal processing methodologies for interference suppression in CDMA systems. In this paper, by drawing analogies between a synchronous CDMA system and an STC multiuser system, we study the applications of some multiuser detection methods to STC multiuser systems. Specifically, we show that the so-called “turbo multiuser detection” technique, which performs soft interference cancellation and decoding iteratively, can be applied to STC multiuser systems in flat-fading channels. An iterative multiuser receiver and its projection-based variants are developed for both the space-time block coding (STBC) system and the space-time trellis coding (STTC) system. During iterations, extrinsic information is computed and exchanged between a soft multiuser demodulator and a bank of MAP decoders, to achieve successively refined estimates of the users' signals. Computer simulations demonstrate that the proposed iterative receiver techniques provide significant performance improvement over conventional noniterative methods in both single-user and multiuser STC systems. Furthermore, the performance of the proposed iterative multiuser receiver approaches that of the iterative single-user receiver in both STBC and STTC systems     

A spatial-temporal decorrelating receiver for CDMA systems withbase-station antenna arrays

We investigate multiuser signal detection with a base-station antenna array for a synchronous DS-CDMA uplink using nonorthogonal codes in Rayleigh fading channels. We have developed a new formulation for a spatial-temporal decorrelating detector using the maximum-likelihood criteria. The detector is shown to be near-far resistant. We propose to implement the spatial-temporal decorrelating receiver iteratively by applying the space-alternating generalized expectation-maximization (SAGE) algorithm. Simulation results show that the SAGE-based decorrelating receiver significantly outperforms the conventional single-user receiver and with performance close to that of a spatial-temporal decorrelating receiver with known channel parameters. We have observed that adding base-station antennas can actually improve convergence of the proposed iterative receiver     

Iterative multiuser detection for CDMA with FEC: near-single-userperformance

This paper introduces an iterative multiuser receiver for direct sequence code-division multiple access (DS-CDMA) with forward error control (FEC) coding. The receiver is derived from the maximum a posteriori (MAP) criterion for the joint received signal, but uses only single-user decoders. Iterations of the system are used to improve performance, with dramatic effects. Single-user turbo code decoders are utilized as the FEC system and a complexity study is presented. Simulation results show that the performance approaches single-user performance even for moderate signal-to-noise ratios     

Iterative (turbo) soft interference cancellation and decoding forcoded CDMA

The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. At each iteration, extrinsic information is extracted from detection and decoding stages and is then used as a priori information in the next iteration, just as in turbo decoding. Given the multipath CDMA channel model, a direct implementation of a sliding-window SISO multiuser detector has a prohibitive computational complexity. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft interference cancellation and instantaneous linear minimum mean-square error filtering. The properties of such a nonlinear interference suppressor are examined, and an efficient recursive implementation is derived. Simulation results demonstrate that the proposed low complexity iterative receiver structure for interference suppression and decoding offers significant performance gain over the traditional noniterative receiver structure. Moreover, at high signal-to-noise ratio, the detrimental effects of MAI and ISI in the channel can almost be completely overcome by iterative processing, and single-user performance can be approached     

A low-complexity SISO multiuser detector for iterative decoding of asynchronous CDMA systems with convolutional codes

The optimal decoding scheme for asynchronous code-division multiple-access (CDMA) systems that employ convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders. A direct implementation of the optimal SISO multiuser detector, however, has exponential computational complexity in terms of the number of users which is still prohibitive for channels with a medium to large number of users. This paper presents a low-complexity SISO multiuser detector using the decision-feedback scheme, of which tentative hard decisions are made and fed back to the SISO multiuser from the previous decoding output. In the proposed scheme, the log-likelihood ratios (LLR) as well as the tentative hard decisions of code bits are fed back from the SISO decoders. The hard decisions are used to constrain the trellis of the SISO multiuser detector and the LLRs are used to provide a priori information on the code bits. The detector provides good performance/complexity tradeoffs. The computational complexity of the detector can be set to be as low as linear in the number of users. Simulations show that the performance of the low-complexity SISO multiuser detector approaches that of the single-user system for moderate to high signal-to-noise ratios even for a large number of users.     

Iterative multiuser detection for asynchronous CDMA withconcatenated convolutional coding

We propose iterative multiuser detectors for asynchronous code-division multiple-access with parallel-concatenated convolutional codes (turbo codes) and with serially concatenated convolutional codes (SCCC). At each iteration we update and exchange the extrinsic information from the multiuser detector and channel decoders and regenerate soft information between constituent convolutional decoders. Simulation results show that with the proposed structure, near-single-user performance can be achieved. We also propose two reduced-complexity techniques, i.e., the reduced-state iterative multiuser detector based on the T-MAP algorithm and the iterative interference canceler based on a noise-whitening filter. Simulation results show a small performance degradation for these two techniques, particularly for the T-MAP receiver     

Iterative multiuser detection for turbo-coded synchronous CDMA inGaussian and non-Gaussian impulsive noise

We develop an iterative multiuser receiver for decoding turbo-coded synchronous code-division multiple-access signals in both Gaussian and non-Gaussian noise. A soft-input soft-output nonlinear multiuser detector is combined with a set of single-user channel decoders in an iterative detection/decoding structure. The nonlinear multiuser detector utilizes the prior probabilities of each user's bits to form soft estimates used for multiple-access interference cancellation. The channel decoders perform turbo-code decoding and produce posterior probabilities which are fed back to the multiuser detector for use as prior probabilities. Simulation results show that the proposed multiuser receiver performs well in both Gaussian and non-Gaussian noise. In particular, single-user turbo-code performance can be approached within a few iterations with medium to low cross correlation (ρ⩽0.5)     

Iterative multiuser detection/decoding for turbo coded CDMA systems

We propose a novel scheme for iterative multiuser detection and turbo decoding. The multiuser detector and single-user turbo decoders are coupled such that after each turbo decoding iteration the extrinsic information of the interfering users is passed to the multiuser detector, and after each multiuser iteration, updated a posteriori probabilities are passed to the single-user turbo decoders as the soft input metrics. In synchronous systems, the proposed detector approaches the multiuser capacity limit within 1 dB in the low signal-to-noise ratio region     

A low-complexity iterative multiuser receiver for turbo-codedDS-CDMA systems

Optimal joint multiuser detection and decoding for direct-sequence code-division multiple-access (DS-CDMA) systems with forward error correction normally requires prohibitively high computational complexity. A suboptimal solution with low complexity is therefore appealing for use in practical applications. We propose a low-complexity iterative multiuser receiver for turbo-coded DS-CDMA systems. The proposed approach consists of a modified decorrelating decision-feedback detector (MDDFD) and K single-user turbo decoders, where K is the number of users in the DS-CDMA system. The MDDFD is derived on the basis of maximizing a likelihood probability and has a feature that it can use the reliability information from the turbo decoders' output. In addition, the MDDFD can deliver interference-cancelled soft outputs to the turbo decoders where the calculation of transition metrics is modified appropriately. Both performance analysis and computer simulation results have indicated that the reliability information from the turbo decoders' output can enhance the multiuser detection capability of the MDDFD. Computer simulations have also shown that the proposed iterative multiuser receiver outperforms the conventional DDFD-based multiuser receiver in terms of the bit-error probability     

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     

Turbo Interference Mitigation in Layered Space-Time MIMO DS-CDMA Uplink with TTCM(Turbo Trellis Coded Modulation)

In this paper we propose the use of a turbo receiver for the uplink of a MIMO CDMA system employing layered space-time transmission. The proposed receiver consists of a low complexity layered space-time multi-user detector using minimum mean squared error (MMSE) filtering with a-priori information and a bank of MAP SISO decoders. Using the soft estimates from a bank of MAP decoders we obtain soft values of the interfering symbols. The SISO multiuser detector subtracts the vector of the interfering symbols from the incoming signal. The resulting vector is then filtered by an adaptive MMSE filter to reduce the residual MAI. This process iterates by exchanging extrinsic informations between the bank of MAP decoders and the SISO multiuser detector. Turbo Trellis Coded Modulation (TTCM) is used as Forward Error Correcting (FEC) code due to its high bandwidth efficiency. Our computer simulations show that the proposed structure outperforms a classical iterative receiver based on parallel interference cancellation (PIC) as well as a non-iterative MMSE receiver. Furthermore, in a multiuser context, the proposed receiver offers an error performance similar to that of single-user case at high SNR. Jean-Pierre Cances graduated in electrical engineering from ENST Bretagne in 1990. He received his Ph.D degree from Télécom Paris in satellite communication engineering in 1993. He is now an assistant Professor at the Ecole Nationale Supérieure d'Ingénieurs de Limoges (ENSIL). His current research interests include satellite communication systems, multicarrier detection and synchronization algorithms, MIMO communication systems. Gholam Reza Mohammad-khani received his BSc. and MSc. degrees in communication engineering from Sharif University of Technology, Tehran, Iran, respectively in 1992 and 1994. He worked as a lecturer in Mashhad University in 1997. His current research interests include satellite communication systems, multiuser detection and synchronization algorithms. Vahid Meghdadi received his BSc. and MSc. degrees in communication engineering from Sharif University of Technology, Tehran, Iran, respectively in 1989 and 1992. He worked as a lecturer in Mashhad University in 1993. Since 1994, he has been a Ph.D. student inEcole nationale Supérieure d'Ingenieurs de Limoges (ENSIL) where he is now an assistant professor. His current research interests include satellite communication systems, multiuserdetection and synchronization algorithms, MIMO communication systems.     

Joint Channel Estimation, Partial Successive Interference Cancellation, and Data Decoding for DS-CDMA Based on the SAGE Algorithm

This paper deals with the derivation and optimization of an iterative receiver architecture performing joint multiuser decoding and channel estimation. We consider an asynchronous multirate convolutional coded DS-CDMA system that communicates over quasi-static flat Rayleigh fading channels. The proposed receiver is derived within the space-alternating generalized expectation-maximization (SAGE) framework in connection with the noise-splitting approach. The used theoretical framework guarantees convergence of the receiver, as opposed to many other iterative receiver structures. Furthermore, the noise-splitting approach provides a set of noise-weighting coefficients that can be optimized under weak constraints. The inputs to the single-user decoders are linear combinations of two kinds of soft values with weights determined by the noise-weighting coefficients. These two kinds of soft values can be interpreted as a priori information and extrinsic information, respectively, if the channels are known. In the case of unknown channels, they are asymptotically a priori and asymptotically extrinsic, i.e., they become a priori and extrinsic when the length of the observed frame tends to infinity. In most cases, the optimum coefficients lead to extrinsic or asymptotically extrinsic values fed to the input of the single-user decoders. Monte Carlo simulations show that the proposed receiver is resistant to channel estimation errors and supports high system loads.     

Iterative MMSE receivers for space-time trellis-coded CDMA systems in multipath fading channels

We explore code-division multiple-access (CDMA) systems with multiple transmit and receive antennas combined with space-time trellis codes over a frequency-selective channel. The conventional noniterative multiuser minimum mean square error (NIMU-mmse) detector is generalized to accommodate multiple antennas and multiple paths and then extended to include the turbo principle in an iterative fashion, allowing interference regeneration and cancellation at the receiver. Iterative multiuser mmse (IMU-mmse) receivers employing chip- and symbol-level detectors are derived and their equivalence is demonstrated. Computer simulations show that the proposed iterative mmse equalizers completely remove the interference of the other users in a multiantenna environment; they provide a significant improvement over the NIMU-mmse detector and they effectively achieve the single-user performance, even in a fully loaded system. Two suboptimal iterative mmse detectors, which allow a computational complexity reduction of up to three orders of magnitude compared to the IMU-mmse and still outperform the NIMU-mmse detector, are introduced. The proposed iterative mmse equalizers are analyzed and supported by extensive computer simulations.     

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     

Optimum Multiuser Asymptotic Efficiency

The degradation in bit error rate due to the presence of multiple-access interference in a white Gaussian channel can be measured by the multiuser asymptotic efficiency, defined as the ratio between the SNR required to achieve the same uncoded bit error rate in the absence of interfering users and the actual SNR. In this paper, the asymptotic efficiency of the optimum multiuser demodulator (a bank of matched filters followed by a Viterbi algorithm) is investigated and compared to that of the conventional single-user matched filter receiver. The computation of the optimum asymptotic efficiency of any given user is equivalent to the minimization of the Euclidean distance between any pair of multiuser signals which differ in at least one of the symbols of that user. It is shown that the optimum multiuser efficiency of asynchronous systems is nonzero with probability 1, and therefore the optimum demodulator does not become multiple-access limited in contrast to the single-user receiver. A class of signal constellations with moderate cross-correlation requirements is shown to achieve unit optimum multiuser efficiencies and, hence, to be equivalent to orthogonal signal sets from the viewpoint of performance of the optimum multiuser detector.     

A low-complexity enhancement to suboptimal CDMA receivers

Conventional matched-filter detectors for code-division multiple-access (CDMA) systems suffer from multiple-access interference (MAI) caused by nonzero correlation between spreading codes at the receiver. A host of advanced detector structures have been proposed to reduce the effect of MAI and, hence, improve performance. However, most multiuser detectors suffer from their relatively complex implementations. A simple method is proposed to improve the performance of the conventional detector by detecting and correcting decision errors at its output without the use of forward error correcting (FEC) codes. The proposed post-detection error control method is shown to substantially improve the performance of the conventional detector, but has a much lower complexity than most other multiuser detectors.     

An iterative multiuser decoder for near-capacity communications

The combination of forward error correction (FEC) coding and random interleaving is shown to overcome the limitations of multiuser detectors/decoders when the user cross correlations are high. In particular, one can asymptotically achieve single-user performance in a highly correlated multiuser system. In addition, an optimal iterative multiuser detector is derived from iterative techniques for cross-entropy minimization. A practical suboptimal implementation of this algorithm is presented, and simulations demonstrate that, even with highly correlated users, it achieves optimal asymptotic efficiency. The effects of the theoretical limits on channel capacity are evident in many of the simulation results. The complexity of the suboptimal algorithm is approximately (O(2^K)+O(2^κ)) per bit per iteration where K is the number of users and κ is the code constraint length