Antenna Beam Pattern Modulation with Lattice Reduction Aided Detection

This paper introduces a novel transmission design for antenna beam pattern modulation (ABPM) with a low complexity decoding method. The concept of ABPM was first presented with the optimal maximum likelihood (ML) decoding. However, an ML detector may not be viable for practical systems when the constellation size or the number of antennas is large such as in massive multiple input multiple output (MIMO) systems. Linear detectors, on the other hand, have lower complexity but inferior performance. In this paper, we present the antenna pattern selection with a lattice reduction (LR) aided linear detector for ABPM to reduce the detection complexity with the bit error rate (BER) performance approaching that of ML while conserving low complexity. Simulation results show that even with this suboptimal detection, performance gain is achieved by the proposed scheme compared to different spatial modulation techniques using ML detection. In addition, to validate the results, an upper bound expression for BER is provided for ABPM with ML detection

Design guidelines for spatial modulation

A new class of low-complexity, yet energyefficient Multiple-Input Multiple-Output (MIMO) transmission techniques, namely the family of Spatial Modulation (SM) aided MIMOs (SM-MIMO) has emerged. These systems are capable of exploiting the spatial dimensions (i.e. the antenna indices) as an additional dimension invoked for transmitting information, apart from the traditional Amplitude and Phase Modulation (APM). SM is capable of efficiently operating in diverse MIMO configurations in the context of future communication systems. It constitutes a promising transmission candidate for large-scale MIMO design and for the indoor optical wireless communication whilst relying on a single-Radio Frequency (RF) chain. Moreover, SM may also be viewed as an entirely new hybrid modulation scheme, which is still in its infancy. This paper aims for providing a general survey of the SM design framework as well as of its intrinsic limits. In particular, we focus our attention on the associated transceiver design, on spatial constellation optimization, on link adaptation techniques, on distributed/ cooperative protocol design issues, and on their meritorious variants

Generalised MBER-based vector precoding design for multiuser transmission

We propose a generalized vector precoding (VP) design based on the minimum bit error rate (MBER) criterion for multiuser transmission in the downlink of a multiuser system, where the base station (BS) equipped with multiple transmitting antennas communicates with single-receiving-antenna mobile station (MS) receivers each having a modulo device. Given the knowledge of the channel state information and the current information symbol vector to be transmitted, our scheme directly generates the effective symbol vector based on the MBER criterion using the particle swarm optimization (PSO) algorithm. The proposed PSO-aided generalized MBER VP scheme is shown to outperform the powerful minimum mean-square-error (MMSE) VP and improved MMSE-VP benchmarks, particularly for rank-deficient systems, where the number of BS transmitting antennas is lower than the number of MSs supported

Low-complexity Lattice Reduction Aided Detection for Generalised Spatial Modulation

Generalised spatial modulation (GSM) was first introduced with the maximum-likelihood (ML) optimum decoder. However, ML decoder may be infeasible for practical implementation due to its exponential complexity especially when the number of antennas or the constellation size is large. Lattice reduction (LR) aided linear decoders are known to have much lower complexity while achieving near-optimal bit-error-rate (BER) performance in MIMO V-BLAST systems. In this paper, LR-aided linear decoders are applied to GSM systems for the first time, but the simulation results demonstrate unsatisfactory BER performances. Thereby, two improved LR-aided linear decoders are proposed in this work. The proposed schemes achieve significant BER performance enhancement compared to that of conventional LR-aided linear decoders as well as linear decoders including zero forcing (ZF) detection and minimum mean square error (MMSE) detection. Compared to the ML decoder, the proposed schemes can provide fairly lower complexities with small BER performance degradation

A universal space-time architecture for multiple-antenna aided systems

In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements

Channel coded iterative center-shifting K-best sphere detection for rank-deficient systems

Based on an EXtrinsic Information Transfer (EXIT) chart assisted receiver design, a low-complexity near-Maximum A Posteriori (MAP) detector is constructed for high-throughput MIMO systems. A high throughput is achieved by invoking high-order modulation schemes and/or multiple transmit antennas, while employing a novel sphere detector (SD) termed as a center-shifting SD scheme, which updates the SD’s search center during its consecutive iterations with the aid of channel decoder. Two low-complexity iterative center-shifting SD aided receiver architectures are investigated, namely the direct-hard-decision centershifting (DHDC) and the direct-soft-decision center-shifting (DSDC) schemes. Both of them are capable of attaining a considerable memory and complexity reduction over the conventional SD-aided iterative benchmark receiver. For example, the DSDC scheme reduces the candidate-list-generation-related and extrinsic-LLR-calculation related complexity by a factor of 3.5 and 16, respectively. As a further benefit, the associated memory requirements were also reduced by a factor of 16