Ant-Colony-Based Multiuser Detection for MC DS-CDMA Systems

In this contribution we present a novel ant colony optimization (ACO) based multi-user detector (MUD) designed for synchronous multi-carrier direct sequence code division multiple access (MC DSCDMA) systems. The operation of the ACO-based MUD is based on the behaviour of the ant colony in nature. The ACO-based MUD aims for achieving the same bit-error-rate (BER) performance as the optimum maximum likelihood (ML) MUD, without carrying out an exhaustive search of the entire MC DS-CDMA search space constituted by all possible combinations of the received multi-user vectors. We will demonstrate that the system is capable of supporting almost as many users as the number of chips in the spreading sequence, while searching only a small fraction of the entire ML search space. It will also be demonstrated that the number of floating point operations per second is a factor of 108 lower for the proposed ACO-based MUD than that of the ML MUD, when supporting K = 32 users in a MC DS-CDMA system employing 31-chip Gold codes as the T-domain spreading sequence

Multiuser Detection with Decision-Feedback Detectors and PIC in MC-CDMA System

In this paper we propose an iterative parallel decision feedback (P-DF) receivers associated with parallel interference cancellation (PIC) for multicarrier code division multiple access (MC-CDMA) systems in a Rayleigh fading channel (cost 207). First the most widely detection techniques, minimum mean-squared error MMSE, Maximum Likelihood ML and PIC were investigated in order to compare their performances in terms of Bit Error Rate (BER) with parallel feedback detection P-DFD. A MMSE DF detector that employs parallel decision-feedback (MMSE-P-DFD) is considered and shows almost the same BER performance with MMSE and ML, which present a better result than the other techniques. In a second time, an iterative proposed method based on the multi-stage techniques P-DFD (parallel DFD with two stages) and PIC was exploited to improve the performance of the system

Novel multiuser detection and multi-rate schemes for multi-carrier CDMA

A large variety of services is [sic] expected for wireless systems, in particular, high data rate services, such as wireless Internet access. Users with different data rates and quality of service (QoS) requirements must be accommodated. A suitable multiple access scheme is key to enabling wireless systems to support both the high data rate and the integrated multiple data rate transmissions with satisfactory performance and flexibility. A multi-carrier code division multiple access (MC-CDMA) scheme is a promising candidate for emerging broadband wireless systems. MC-CDMA is a hybrid of orthogonal frequency division multiplexing (OFDM) and code division multiple access (CDMA). The most salient feature of MC-CDMA is that the rate of transmission is not limited by the wireless channel\u27s frequency-selective fading effects caused by multipath propagation. In MC-CDMA, each chip of the desired user\u27s spreading code, multiplied by the current data bit, is modulated onto a separate subcarrier. Therefore, each subcarrier has a narrow bandwidth and undergoes frequency-flat fading. Two important issues for an MC-CDMA wireless system, multiuser detection and multi-rate access, are discussed in this dissertation. Several advanced receiver structures capable of suppressing multiuser interference in an uplink MC-CDMA system, operating in a frequency-selective fading channel, are studied in this dissertation. One receiver is based on a so-called multishot structure, in which the interference introduced by the asynchronous reception of different users is successfully suppressed by a receiver based on the minimum mean-square error (MMSE) criterion with a built-in de-biasing feature. Like many other multiuser schemes, this receiver is very sensitive to a delay estimation error. A blind adaptive two-stage decorrelating receiver based on the bootstrap algorithm is developed to combat severe performance degradation due to a delay estimation error. It is observed that in the presence of a delay estimation error the blind adaptive bootstrap receiver is more near-far resistant than the MMSE receiver. Furthermore, a differential bootstrap receiver is proposed to extend the limited operating range of the two-stage bootstrap receiver which suffers from a phase ambiguity problem. Another receiver is based on a partial sampling (PS) demodulation structure, which further reduces the sensitivity to unknown user delays in an uplink scenario. Using this partial sampling structure, it is no longer necessary to synchronize the receiver with the desired user. Following the partial sampling demodulator, a minimum mean-square error combining (MMSEC) detector is applied. The partial sampling MMSEC (PS-MMSEC) receiver is shown to have strong interference suppression and timing acquisition capabilities. The complexity of this receiver can be reduced significantly, with negligible performance loss, by choosing a suitable partial sampling rate and using a structure called reduced complexity PS-MMSEC (RPS-MMSEC). The adaptive implementation of these receivers yields a superior rate of convergence and symbol error rate performance in comparison to a conventional MMSEC receiver with known timing. All the above receiver structures are for a single-rate MC-CDMA. Three novel multi-rate access schemes for multi-rate MC-CDMA, fixed spreading length (FSL), coded FSL (CFSL) and variable spreading length (VSL), have been developed. These multi-rate access schemes enable users to transmit information at different data rates in one MC-CDMA system. Hence, voice, data, image and video can be transmitted seamlessly through a wireless infrastructure. The bit error rate performance of these schemes is investigated for both low-rate and high-rate users

Iterative Near-Maximum-Likelihood Detection in Rank-Deficient Downlink SDMA Systems

Abstract—In this paper, a precoded and iteratively detected downlink multiuser system is proposed, which is capable of operating in rankdeficient scenarios, when the number of transmitters exceeds the number of receivers. The literature of uplink space division multiple access (SDMA) systems is rich, but at the time of writing there is a paucity of information on the employment of SDMA techniques in the downlink. Hence, we propose a novel precoded downlink SDMA (DL-SDMA) multiuser communication system, which invokes a low-complexity nearmaximum-likelihood sphere decoder and is particularly suitable for the aforementioned rank-deficient scenario. Powerful iterative decoding is carried out by exchanging extrinsic information between the precoder’s decoder and the outer channel decoder. Furthermore, we demonstrate with the aid of extrinsic information transfer charts that our proposed precoded DL-SDMA system has a better convergence behavior than its nonprecoded DL-SDMA counterpart. Quantitatively, the proposed system having a normalized system load of Ls = 1.333, i.e., 1.333 times higher effective throughput facilitated by having 1.333 times more DL-SDMA transmitters than receivers, exhibits a “turbo cliff” at an Eb/N0 of 5 dB and hence results in an infinitesimally low bit error rate (BER). By contrast, at Eb/N0 = 5 dB, the equivalent system dispensing with precoding exhibits a BER in excess of 10%. Index Terms—Iterative decoding, maximum likelihood detection, space division multiple access (SDMA) downlink, sphere decoding

Ant-colony-based multiuser detection for multifunctional-antenna-array-assisted MC DS-CDMA systems

A novel Ant Colony Optimization (ACO) based Multi-User Detector (MUD) is designed for the synchronous Multi-Functional Antenna Array (MFAA) assisted Multi-Carrier Direct-Sequence Code-Division Multiple-Access (MC DS-CDMA) uplink (UL), which supports both receiver diversity and receiver beamforming. The ACO-based MUD aims for achieving a bit-error-rate (BER) performance approaching that of the optimum maximum likelihood (ML) MUD, without carrying out an exhaustive search of the entire MC DS-CDMA search space constituted by all possible combinations of the received multi-user vectors. We will demonstrate that regardless of the number of the subcarriers or of the MFAA configuration, the system employing the proposed ACO based MUD is capable of supporting 32 users with the aid of 31-chip Gold codes used as the T-domain spreading sequence without any significant performance degradation compared to the single-user system. As a further benefit, the number of floating point operations per second (FLOPS) imposed by the proposed ACO-based MUD is a factor of 108 lower than that of the ML MUD. We will also show that at a given increase of the complexity, the MFAA will allow the ACO based MUD to achieve a higher SNR gain than the Single-Input Single-Output (SISO) MC DS-CDMA system. Index Terms—Ant Colony Optimization, Multi-User Detector, Multi-Functional Antenna Array, Multi-Carrier Direct-Sequence Code-Division Multiple-Access, Uplink, Near-Maximum Likelihood Detection

MIMO-aided near-capacity turbo transceivers: taxonomy and performance versus complexity

In this treatise, we firstly review the associated Multiple-Input Multiple-Output (MIMO) system theory and review the family of hard-decision and soft-decision based detection algorithms in the context of Spatial Division Multiplexing (SDM) systems. Our discussions culminate in the introduction of a range of powerful novel MIMO detectors, such as for example Markov Chain assisted Minimum Bit-Error Rate (MC-MBER) detectors, which are capable of reliably operating in the challenging high-importance rank-deficient scenarios, where there are more transmitters than receivers and hence the resultant channel-matrix becomes non-invertible. As a result, conventional detectors would exhibit a high residual error floor. We then invoke the Soft-Input Soft-Output (SISO) MIMO detectors for creating turbo-detected two- or three-stage concatenated SDM schemes and investigate their attainable performance in the light of their computational complexity. Finally, we introduce the powerful design tools of EXtrinsic Information Transfer (EXIT)-charts and characterize the achievable performance of the diverse near- capacity SISO detectors with the aid of EXIT charts

Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA

In a system supporting numerous users the complexity of the optimal Maximum Likelihood Multi-User Detector (ML MUD) becomes excessive. Based on the superimposed constellations of K users, the ML MUD outputs the specific multilevel K-user symbol that minimizes the Euclidean distance with respect to the faded and noise-contaminated received multi-level symbol. Explicitly, the Euclidean distance is considered as the Cost Function (CF). In a system supporting K users employing M-ary modulation, the ML MUD uses MK CF evaluations (CFE) per time slot. In this contribution we propose an Early Stopping-aided Durr-Høyer algorithm-based Quantum-assisted MUD (ES-DHA QMUD) based on two techniques for achieving optimal ML detection at a low complexity. Our solution is also capable of flexibly adjusting the QMUD's performance and complexity trade-off, depending on the computing power available at the base station. We conclude by proposing a general design methodology for the ES-DHA QMUD in the context of both CDMA and SDMA systems

A Tight Bound for Probability of Error for Quantum Counting Based Multiuser Detection

Future wired and wireless communication systems will employ pure or combined Code Division Multiple Access (CDMA) technique, such as in the European 3G mobile UMTS or Power Line Telecommunication system, but also several 4G proposal includes e.g. multi carrier (MC) CDMA. Former examinations carried out the drawbacks of single user detectors (SUD), which are widely employed in narrowband IS-95 CDMA systems, and forced to develop suitable multiuser detection schemes to increase the efficiency against interference. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated for the next years, which meets the advert of 3G and 4G systems. In this paper we analyze the error probability and give tight bounds in a static and dynamically changing environment for a novel quantum computation based Quantum Multiuser detection (QMUD) algorithm, employing quantum counting algorithm, which provides optimal solution.Comment: presented at IEEE ISIT 2002, 7 pages, 2 figure