Reduced-complexity equalization techniques for ISI and MIMO wireless channels in iterative decoding

Two reduced-complexity soft-input soft-output trellis decoding techniques are presented in this paper for equalizing single-input single-output intersymbol interference (ISI) channels and multiple-input multiple-output (MIMO) frequency selective fading channels. Given a trellis representing an ISI channel, the soft-output M-algorithm (SOMA) reduces the complexity of equalization by retaining only the best M survivors at each trellis interval. The remaining survivors are discarded. The novelty of the SOMA is the use of discarded paths to obtain soft-information. Through a simple update-and-discard procedure, the SOMA extracts reliable soft-information from discarded paths which enables a large trellis to be successfully decoded with a relatively small value of M. To decode a trellis representing a MIMO frequency selective fading channel, two challenges are faced. Not only that the trellis has a large number of states, the number of branches per trellis interval is also enormous. The soft-output trellis/tree M-algorithm (SOTTMA) expands each trellis interval into a tree-like structure and performs the M-algorithm twice: once at each trellis interval to reduce the number of states and the other at each tree sub-level to remove unwanted branches. With the proposed technique, high-order trellises with million of branches per interval can be decoded with modest complexity.     

Near-Optimum Iterative Multiuser Receiver for FEC Encoded DS-CDMA

The powerful iterative algorithm of Turbo code is employed in the proposed iterative multiuser receiver for the downlink of a forward error correction (FEC) coded direct-sequence code-division multiple access (DS-CDMA) environment. The receiver iterates between the 2 coding dimensions, namely the spreading codes and the FEC codes. The optimum iterative multiuser receiver uses the optimum decentralised single-user detector to generate the single-user extrinsic information for the single-user decoders. This paper suggests a near-optimum detector using a folded trellis preselection stage for the multiuser signal detection, in order to reduce the dominating complexity of the optimum decentralised detector. Simulation results show that performance is close to optimum. The effect of the single-user decoders' extrinsic information on the signal detection stage is also investigated and it is found that extrinsic information improves performance.     

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     

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.     

A chip-based multiuser detector for the downlink of a DS-CDMAsystem using a folded state-transition trellis

The maximum-likelihood sequence estimation (MLSE) multiuser detector has very good performance but at the expense of high computational complexity. The Viterbi algorithm is employed to implement the MLSE in the asynchronous uplink. In this scheme, the various bit-combinations are taken to be the different states in the decoding trellis. However, the number of states increases exponentially with the number of active users. We propose a scheme that exploits the feature of power-equality in the downlink to reduce the number of states involved. Each transmitted chip value can only take a certain number of possible discrete values. Using these discrete values as the states in the transition trellis diagram and operating the Viterbi algorithm at the chip level, the number of states is reduced from 4^K to (K+1) ^L where K is the number of users and L is the number of paths in the multipath channel     

一种粒子滤波的盲多用户检测快速算法

该文在时间观察状态空间模型基础上,针对粒子滤波计算复杂的问题,构造了一种在同步快变平衰落信道下计算复杂度低的粒子滤波的DS-CDMA盲多用户检测快速算法。该算法通过对超过门限数目的粒子分类,以不同类别粒子的概率差值作为粒子滤波所需粒子数目是否足够的判断准则,自动调节不同情况下所需的粒子数目,并对不同类别粒子概率差值下盲多用户检测性能进行分析。仿真结果表明,该文算法可以在保证盲多用户检测性能的前提下有效地降低运算复杂度,且检测性能与概率差值成正比。     

Blind decoders for linear dispersion codes in downlink DS-CDMAsystems

Among many proposed space-time codes, the linear dispersion (LD) space-time codes possess many coding advantages and retain a simple decoding at the same time. An LD decoder combined with a blind subspace-based multiuser detector (MUD) is studied in the downlink of a DS-CDMA system. To further improve the performance, a subspace-based sphere decoding algorithm is proposed. Finally, a decimation-combining processing is applied to the proposed subspace-based blind decoders to reduce the complexity with only slight performance loss     

Multiuser ML sequence estimator for convolutionally codedasynchronous DS-CDMA systems

The optimal multiuser sequence estimator is formulated for an asynchronous direct-sequence code-division multiple-access (DS-CDMA) system where each user employs convolutional coding to improve its performance on a nondispersive additive white Gaussian noise (AWGN) channel. It is shown that the decoder may be implemented efficiently using a Viterbi algorithm which operates on a time-varying trellis with a number of states which is exponential in the product of the number of users in the system and the constraint length of the codes used (for the rate 1/2 code case). The asymptotic efficiency of this receiver relative to an uncoded coherent binary phase shift keying (BPSK) receiver (termed asymptotic multiuser coding gain, or AMCG) is then upper and lower bounded. The AMCG parameter unifies the asymptotic coding gain parameter and the asymptotic multiuser efficiency parameter which are traditional figure of merit parameters for single-user coded systems and multiuser uncoded systems, respectively. Finally, some simulations are presented to illustrate the performance of the maximum likelihood sequence estimator (MLSE) at moderate and low bit error rates     

A Soft-Input Soft-Output Decorrelating Block Decision-Feedback Multiuser Detector for Turbo-Coded DS-CDMA Systems

Previously, a decorrelating decision-feedback multiuser detector for direct-sequence code-division multiple-access (DS-CDMA) systems normally produces only hard-decision outputs of users' data. In turbo-coded DS-CDMA systems, such a multiuser detector does not match well with the soft-input soft-output nature of a turbo-decoding algorithm, thereby resulting in some extent of performance loss. In this paper, a soft-input soft-output decorrelating block decision-feedback multiuser detector is proposed to perform joint multiuser detection and turbo decoding in an iterative manner. This multiuser detector partitions the received users' data into a number of blocks appropriately and then detects the users' data on a block-by-block basis, where the soft-decision outputs are generated based on the maximum a posteriori criterion and the decision outputs of a stronger block (with a higher energy) are fed back for use in making decisions of those weaker ones. Computer simulation results show that the proposed iterative multiuser detector with turbo decoding significantly improves the bit error rate performance of a DS-CDMA receiver.     

Soft-Information Assisted Near-Optimum Nonlinear Detection for BLAST-type Space Division Multiplexing OFDM Systems

In this contribution, a nonlinear hybrid detection scheme based on a novel soft-information assisted genetic algorithm (GA) is proposed for a turbo convolutional (TC) coded space division multiplexing (SDM) aided orthogonal frequency division multiplexing (OFDM) system. Our numerical results show that the performance of the currently known GA-assisted system can be improved by about 2 dB with the aid of the GA's population-based soft solution, approaching the optimum performance of the soft-information assisted maximum likelihood (ML) detection, while exhibiting a lower complexity, especially in high-throughput scenarios. Furthermore, the proposed scheme is capable of achieving a good performance even in the so-called overloaded systems, where the number of transmit antennas is higher than the number of receiver antennas     

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.     

Multiuser Detection Based on Adaptive LMS and Modified Genetic Algorithm in DS-CDMA Communication Systems

In this paper, we present an efficient evolutionary algorithm for the multi-user detection (MUD) problem in direct sequence-code division multiple access (DS-CDMA) communication systems. The optimum detector for MUD is the maximum likelihood (ML) detector, but its complexity is very high and involves an exhaustive search to reach the best fitness of transmitted and received data. Thus, there has been considerable interest in suboptimal multiuser detectors with less complexity and reasonable performance. The proposed algorithm is a combination of adaptive LMS Algorithm and modified genetic algorithm (GA). Indeed the LMS algorithm provides a good initial response for GA, and GA will be applied for this response to reach the best answer. The proposed GA reduces the dimension of the search space and provides a suitable framework for future extension to other optimization algorithms. Our algorithm is compared to ML detector, Matched Filter (MF) detector, conventional detector with GA; and Adaptive LMS detector which have been used for MUD in DS-CDMA. Simulation results show that the performance of this algorithm is close to the optimal detector with very low complexity, and it works better in comparison to other algorithms.     

(1+/spl lambda/) evolution strategy method for asynchronous DS-CDMA multiuser detection

This letter introduces a new multiuser detection algorithm based on (1+/spl lambda/) evolution strategy for asynchronous DS-CDMA systems. By setting the offspring population size and the mutation probability appropriately, the new algorithm can approach the minimum probability of error with great computation efficiency. Simulation results show that the proposed algorithm converges very rapidly and provides good BER performance for cases where other suboptimum algorithms perform poorly. The average computation time is polynomial complexity in the number of users.     

基于Kalman滤波的盲多用户检测算法

盲多用户检测技术是第三代移动通信的关键技术,本文仿真分析了DS-CDMA通信系统中盲多用户检测的Kalman滤波算法的性能.并且将子空间算法和Kalman滤波算法进行结合,使得盲多用户检测的Kalman滤波算法的计算量大大降低.     

一种基于ML准则的适用于频率选择性多径衰落的多用户检测算法

本文采用ML准则得出了适于频率选择性衰落的线性解相关算法。仿真表明本方法性能优于Zvonar提出的先解相关再最大比值合并的算法;且该方法由于采用等价扩频序列实现,硬件耗费也较少。     

On channel parameter estimation in a space-time bit-interleaved-coded modulation system for multipath DS-CDMA uplink with receive diversity

In this paper, we consider iterative space-time multiuser detection and channel parameter estimation in a bit-interleaved coded modulation scheme for asynchronous direct-sequence code division multiple access (DS-CDMA) transmission over frequency selective, slowly fading channels. Accurate estimation of the channel parameters is critical as it has great impact on the overall BER performance. We present an iterative space-time multiuser (STMU) turbo detection and estimation scheme, based on space alternating generalized expectation maximization (SAGE) algorithm. This algorithm operates on the coded symbols by exchanging soft information between the detector and the estimator. We show through computer simulations that the proposed low complexity STMU receiver considerably outperforms conventional estimation schemes and achieves excellent performance, both in terms of BER and estimation error variance. Finally, we will consider different mapping strategies and investigate their impact on the performance and complexity of the estimator.     

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)     

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.     

基于多用户反馈的判决反馈均衡器的研究

本文提出的一种新颖的基于多用户反馈的判决反馈均衡器,解决了在CDMA多用户检测中传统自适应判决反馈均衡器误码率高、系统容量小的缺点.它由具有误差反馈滤波器的判决反馈均衡器(Decision Feedback Equalizer with Error Feedback Filter,DFE-EFF)构成,并在判决后反馈多用户数据抵消多址干扰(多用户反馈干扰抵消).文中给出其结构图,分析各种判决反馈均衡算法.理论证明,具有误差反馈滤波器的多用户反馈干扰抵消判决反馈均衡器(多用户反馈干扰抵消DFE-EFF)较各种判决反馈均衡器为最优,它能同时有效处理ISI,MAI和噪声的干扰.仿真结果表明,在误码率性能和系统容量两方面,多用户反馈干扰抵消DFE-EFF比DFE、DFE-EFF均有较大改善.     

Decision feedback sequence estimation for unwhitened ISI channelswith applications to multiuser detection

Decision feedback sequence estimation (DFSE), which is a reduced-complexity alternative to maximum likelihood sequence estimation (MLSE), can be used effectively for equalization of intersymbol interference (ISI) as well as for multiuser detection. The algorithm performs very well for whitened (minimum-phase) channels. For nonminimum-phase channels, however, the algorithm is not very effective. Moreover, DFSE requires a noise-whitening filter, which may not be feasible to compute for time-varying channels such as a multiuser direct-sequence code division multiple access (DS-CDMA) channel. Noise-whitening is also cumbersome for applications that involve bidirectional equalization such as the global system for mobile communication (GSM) system. In such conditions, it is desirable to use the Ungerboeck (1974) formulation for sequence estimation, which operates directly on the discrete-time unwhitened statistic obtained from conventional matched filtering. Unfortunately, DFSE based on matched filter statistics is severely limited by untreated interference components. We identify the anticausal interference components, using an error probability analysis. This leads us to a modified unwhitened decision feedback sequence estimator (MUDFSE) in which the components are canceled, using tentative decisions. We obtain approximate error probability bounds for the proposed algorithm. Performance results indicate that the modified algorithm, used on unwhitened channels with relatively small channel correlations, provides similar performance/complexity tradeoffs as the DFSE used on the corresponding whitened minimum-phase channels. The algorithm is especially attractive for multiuser detection for asynchronous DS-CDMA channels with long spreading codes, where it can achieve near-MLSE performance with exponentially lower complexity