Turbo receivers for interleave-division multiple-access systems

In this paper several turbo receivers for Interleave-Division Multiple-Access (IDMA) systems will be discussed. The multiple access system model is presented first. The optimal, Maximum A Posteriori (MAP) algorithm, is then presented. It will be shown that the use of a precoding technique at the emitter side is applicable to IDMA systems. Several low complexity Multi-User Detector (MUD), based on the Gaussian approximation, will be next discussed. It will be shown that the MUD with Probabilistic Data Association (PDA) algorithm provides faster convergence of the turbo receiver. The discussed turbo receivers will be evaluated by means of Bit Error Rate (BER) simulations and EXtrinsic Information Transfer (EXIT) charts

Iterative ('Turbo') Multiuser Detectors For Impulse Radio Systems

In recent years, there has been a growing interest in multiple access communication systems that spread their transmitted energy over very large bandwidths. These systems, which are referred to as ultra wide-band (UWB) systems, have various advantages over narrow-band and conventional wide-band systems. The importance of multiuser detection for achieving high data or low bit error rates in these systems has already been established in several studies. This paper presents iterative ('turbo') multiuser detection for impulse radio (IR) UWB systems over multipath channels. While this approach is demonstrated for UWB signals, it can also be used in other systems that use similar types of signaling. When applied to the type of signals used by UWB systems, the complexity of the proposed detector can be quite low. Also, two very low complexity implementations of the iterative multiuser detection scheme are proposed based on Gaussian approximation and soft interference cancellation. The performance of these detectors is assessed using simulations that demonstrate their favorable properties.Comment: To appear in IEEE Transactions on Wireless Communication

Iterative Joint Channel Estimation and Multi-User Detection for Multiple-Antenna Aided OFDM Systems

Multiple-Input-Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems have recently attracted substantial research interest. However, compared to Single-Input-Single-Output (SISO) systems, channel estimation in the MIMO scenario becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated. In the context of the Bell LAyered Space-Time architecture (BLAST) or Space Division Multiple Access (SDMA) multi-user MIMO OFDM systems, none of the known channel estimation techniques allows the number of users to be higher than the number of receiver antennas, which is often referred to as a “rank-deficient” scenario, owing to the constraint imposed by the rank of the MIMO channel matrix. Against this background, in this paper we propose a new Genetic Algorithm (GA) assisted iterative Joint Channel Estimation and Multi-User Detection (GA-JCEMUD) approach for multi-user MIMO SDMA-OFDM systems, which provides an effective solution to the multi-user MIMO channel estimation problem in the above-mentioned rank-deficient scenario. Furthermore, the GAs invoked in the data detection literature can only provide a hard-decision output for the Forward Error Correction (FEC) or channel decoder, which inevitably limits the system’s achievable performance. By contrast, our proposed GA is capable of providing “soft” outputs and hence it becomes capable of achieving an improved performance with the aid of FEC decoders. A range of simulation results are provided to demonstrate the superiority of the proposed scheme. Index Terms—Channel estimation, genetic algorithm, multiple-input-multiple-output, multi-user detection, orthogonal frequency division multiplexing, space division multiple access

Iterative Joint Channel Estimation and Symbol Detection for Multi-User MIMO OFDM

Multiple-Input-Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems have recently attracted substantial research interest. However, compared to Single-Input-Single-Output (SISO) systems, channel estimation in the MIMO scenario becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated. In the context of the Bell LAyered Space-Time architecture (BLAST) or Space Division Multiple Access (SDMA) multi-user MIMO OFDM literature, no channel estimation technique allows the number of users to be higher than the number of receiver antennas, which is often referred to as an “overloaded” scenario. In this contribution we propose a new Genetic Algorithm (GA) assisted iterative joint channel estimation and multiuser detection approach for MIMO SDMA-OFDM systems, which exhibits a robust performance in the above-mentioned overloaded scenario. Furthermore, GA-aided Multi-User Detection (MUD) techniques found in the literature can only provide a hard-decision output, while the proposed GA is capable of providing “soft” outputs, hence achieving an improved performance with the aid of channel decoders. Finally, a range of simulation results are provided to demonstrate the superiority of the proposed scheme

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-MIMO systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16x16 and 32x32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.Comment: v3: Performance/complexity comparison of the proposed scheme with other large-MIMO architectures/detectors has been added (Sec. IV-D). The paper has been accepted for publication in IEEE Journal of Selected Topics in Signal Processing (JSTSP): Spl. Iss. on Managing Complexity in Multiuser MIMO Systems. v2: Section V on Channel Estimation is update

Soft detection and decoding in wideband CDMA systems

A major shift is taking place in the world of telecommunications towards a communications environment where a range of new data services will be available for mobile users. This shift is already visible in several areas of wireless communications, including cellular systems, wireless LANs, and satellite systems. The provision of flexible high-quality wireless data services requires a new approach on both the radio interface specification and the design and the implementation of the various transceiver algorithms. On the other hand, when the processing power available in the receivers increases, more complex receiver algorithms become feasible. The general problem addressed in this thesis is the application of soft detection and decoding algorithms in the wideband code division multiple access (WCDMA) receivers, both in the base stations and in the mobile terminals, so that good performance is achieved but that the computational complexity remains acceptable. In particular, two applications of soft detection and soft decoding are studied: coded multiuser detection in the CDMA base station and improved RAKE-based reception employing soft detection in the mobile terminal. For coded multiuser detection, we propose a novel receiver structure that utilizes the decoding information for multiuser detection. We analyze the performance and derive lower bounds for the capacity of interference cancellation CDMA receivers when using channel coding to improve the reliability of tentative decisions. For soft decision and decoding techniques in the CDMA downlink, we propose a modified maximal ratio combining (MRC) scheme that is more suitable for RAKE receivers in WCDMA mobile terminals than the conventional MRC scheme. We also introduce an improved soft-output RAKE detector that is especially suitable for low spreading gains and high-order modulation schemes. Finally we analyze the gain obtained through the use of Brennan's MRC scheme and our modified MRC scheme. Throughout this thesis Bayesian networks are utilized to develop algorithms for soft detection and decoding problems. This approach originates from the initial stages of this research, where Bayesian networks and algorithms using such graphical models (e.g. the so-called sum-product algorithm) were used to identify new receiver algorithms. In the end, this viewpoint may not be easily noticeable in the final form of the algorithms, mainly because the practical efficiency considerations forced us to select simplified variants of the algorithms. However, this viewpoint is important to emphasize the underlying connection between the apparently different soft detection and decision algorithms described in this thesis.reviewe