Space Shift Keying (SSK-) MIMO with Practical Channel Estimates

International audienceIn this paper, we study the performance of space modulation for Multiple-Input-Multiple-Output (MIMO) wireless systems with imperfect channel knowledge at the receiver. We focus our attention on two transmission technologies, which are the building blocks of space modulation: i) Space Shift Keying (SSK) modulation; and ii) Time-Orthogonal-Signal-Design (TOSD-) SSK modulation, which is an improved version of SSK modulation providing transmit-diversity. We develop a single- integral closed-form analytical framework to compute the Average Bit Error Probability (ABEP) of a mismatched detector for both SSK and TOSD-SSK modulations. The framework exploits the theory of quadratic-forms in conditional complex Gaussian Random Variables (RVs) along with the Gil-Pelaez inversion theorem. The analytical model is very general and can be used for arbitrary transmit- and receive-antennas, fading distributions, fading spatial correlations, and training pilots. The analytical derivation is substantiated through Monte Carlo simulations, and it is shown, over independent and identically distributed (i.i.d.) Rayleigh fading channels, that SSK modulation is as robust as single-antenna systems to imperfect channel knowledge, and that TOSD-SSK modulation is more robust to channel estimation errors than the Alamouti scheme. Furthermore, it is pointed out that only few training pilots are needed to get reliable enough channel estimates for data detection, and that transmit- and receive-diversity of SSK and TOSD-SSK modulations are preserved even with imperfect channel knowledge

A virtual MIMO dual-hop architecture based on hybrid spatial modulation

International audienceIn this paper, we propose a novel Virtual Multiple-Input-Multiple-Output (VMIMO) architecture based on the concept of Spatial Modulation (SM). Using a dual-hop and Decode-and-Forward protocol, we form a distributed system, called Dual-Hop Hybrid SM (DH-HSM). DH-HSM conveys information from a Source Node (SN) to a Destination Node (DN) via multiple Relay Nodes (RNs). The spatial position of the RNs is exploited for transferring information in addition to, or even without, a conventional symbol. In order to increase the performance of our architecture, while keeping the complexity of the RNs and DN low, we employ linear precoding using Channel State Information (CSI) at the SN. In this way, we form a Receive-Spatial Modulation (R-SM) pattern from the SN to the RNs, which is able to employ a centralized coordinated or a distributed uncoordinated detection algorithm at the RNs. In addition, we focus on the SN and propose two regularized linear precoding methods that employ realistic Imperfect Channel State Information at the Transmitter. The power of each precoder is analyzed theoretically. Using the Bit Error Rate (BER) metric, we evaluate our architecture against the following benchmark systems: 1) single relay; 2) best relay selection; 3) distributed Space Time Block Coding (STBC) VMIMO scheme; and 4) the direct communication link. We show that DH-HSM is able to achieve significant Signal-to-Noise Ratio (SNR) gains, which can be as high as 10.5 dB for a very large scale system setup. In order to verify our simulation results, we provide an analytical framework for the evaluation of the Average Bit Error Probability (ABEP)

Application of Convolutional Neural Network Framework on Generalized Spatial Modulation for Next Generation Wireless Networks

A novel custom auto-encoder Complex Valued Convolutional Neural Network (AE-CVCNN) model is proposed and implemented using MATLAB for multiple-input-multiple output (MIMO) wireless networks. The proposed model is applied on two dierent generalized spatial modulation (GSM) schemes: the single symbol generalized spatial modulation SS - GSM and the multiple symbol generalized spatial modulation (MS-GSM). GSM schemes are used with Massive-MIMO to increase both the spectrum eciency and the energy eciency. On the other hand, GSM schemes are subjected to high computational complexity at the receiver to detect the transmitted information. High computational complexity slows down the throughput and increases the power consumption at the user terminals. Consequently, reducing both the total spectrum eciency and energy eciency. The proposed CNN framework achieves constant complexity reduction of 22.73% for SSGSM schemes compared to the complexity of its traditional maximum likelihood detector (ML). Also, it gives a complexity reduction of 14.7% for the MS-GSM schemes compared to the complexity of its detector. The performance penalty of the two schemes is at most 0.5 dB. Besides to the proposed custom AE CV-CNN model, a dierent ML detector0s formula for SS -GSM schemes is proposed that achieves the same performance as the traditional ML detector with a complexity reduction of at least 40% compared to that of the traditional ML detector. In addition, the proposed AE-CV-CNN model is applied to the proposed ML detector,and it gives a complexity reduction of at least 63.6% with a performance penalty of less than 0.5 dB. An interesting result about applying the proposed custom CNN model on the proposed ML detector is that the complexity is reduced as the spatial constellation size is increased which means that the total spectrum eciency is increased by increasing the spatial constellation size without increasing the computational complexity

Low-complexity precoding for spatial modulation

© 2017 IEEE. In this paper, we investigate linear precoding for spatial modulation (SM) over multiple-input-multiple-output (MIMO) fading channels. With channel state information available at the transmitter, our focus is to maximize the minimum Euclidean distance among all candidates of SM symbols. We prove that the precoder design is a large-scale non-convex quadratically constrained quadratic program (QCQP) problem. However, the conventional methods, such as semi-definite relaxation and iterative concave-convex process, cannot tackle this challenging problem effectively or efficiently. To address this issue, we leverage augmented Lagrangian and dual ascent techniques, and transform the original large-scale non-convex QCQP problem into a sequence of subproblems. These subproblems can be solved in an iterative manner efficiently. Numerical results show that the proposed method can significantly improve the system error performance relative to the SM without precoding, and features extremely fast convergence rate with very low computational complexity

A generalized space-frequency index modulation scheme for downlink MIMO transmissions with improved diversity

Multidimensional Index Modulations (IM) are a novel alternative to conventional modulations which can bring considerable benefits for future wireless networks. Within this scope, in this paper we present a new scheme, named as Precoding-aided Transmitter side Generalized Space-Frequency Index Modulation (PT-GSFIM), where part of the information bits select the active antennas and subcarriers which then carry amplitude and phase modulated symbols. The proposed scheme is designed for multiuser multiple-input multiple-output (MU-MIMO) scenarios and incorporates a precoder which removes multiuser interference (MUI) at the receivers. Furthermore, the proposed PT-GSFIM also integrates signal space diversity (SSD) techniques for tackling the typical poor performance of uncoded orthogonal frequency division multiplexing (OFDM) based schemes. By combining complex rotation matrices (CRM) and subcarrier-level interleaving, PT-GSFIM can exploit the inherent diversity in frequency selective channels and improve the performance without additional power or bandwidth. To support reliable detection of the multidimensional PT-GSFIM we also propose three different detection algorithms which can provide different tradeoffs between performance and complexity. Simulation results shows that proposed PT-GSFIM scheme, can provide significant gains over conventional MU-MIMO and GSM schemes.info:eu-repo/semantics/publishedVersio

A Unified Precoding Scheme for Generalized Spatial Modulation

© 1972-2012 IEEE. Generalized spatial modulation (GSM) activates Nt (1 ≤ nt < Nt) available transmit antennas, and information is conveyed through nt modulated symbols as well as the index of the nt activated antennas. GSM strikes an attractive tradeoff between spectrum efficiency and energy efficiency. Linear precoding that exploits channel state information at the transmitter enhances the system error performance. For GSM with nt=1 (the traditional SM), the existing precoding methods suffer from high computational complexity. On the other hand, GSM precoding for nt ≥ 2 is not thoroughly investigated in the open literature. In this paper, we develop a unified precoding design for GSM systems, which universally works for all nt values. Based on the maximum minimum Euclidean distance criterion, we find that the precoding design can be formulated as a large-scale nonconvex quadratically constrained quadratic program problem. Then, we transform this challenging problem into a sequence of unconstrained subproblems by leveraging augmented Lagrangian and dual ascent techniques. These subproblems can be solved in an iterative manner efficiently. Numerical results show that the proposed method can substantially improve the system error performance relative to the GSM without precoding and features extremely fast convergence rate with a very low computational complexity

Adaptive Communication for Wireless Massive MIMO Systems

The demand for high data rates in wireless communications is increasing rapidly. One way to provide reliable communication with increased rates is massive multiple-input multiple-output (MIMO) systems where a large number of antennas is deployed. We analyze three systems utilizing a large number of antennas to provide enhancement in the performance of wireless communications. First, we consider a general form of spatial modulation (SM) systems where the number of transmitted data streams is allowed to vary and we refer to it as generalized spatial modulation with multiplexing (GSMM). A Gaussian mixture model (GMM) is shown to accurately model the transmitted spatially modulated signal using a precoding framework. Using this transmit model, a general closed-form expression for the achievable rate when operating over Rayleigh fading channels is evaluated along with a tight upper and a lower bounds for the achievable rate. The obtained expressions are flexible enough to accommodate any form of SM by adjusting the precoding set. Followed by that, we study quantized distributed wireless relay networks where a relay consisting of many geographically dispersed nodes is facilitating communication between unconnected users. Due to bandwidth constraints, distributed relay networks perform quantization at the relay nodes, and hence they are referred to as quantized distributed relay networks. In such systems, users transmit their data simultaneously to the relay nodes through the uplink channel that quantize their observed signals independently to a few bits and broadcast these bits to the users through the downlink channel. We develop algorithms that can be employed by the users to estimate the uplink channels between all users and all relay nodes when the relay nodes are performing simple sign quantization. This setup is very useful in either extending coverage to unconnected regions or replacing the existing wireless infrastructure in case of disasters. Using the uplink channel estimates, we propose multiple decoders that can be deployed at the receiver side. We also study the performance of each of these decoders under different system assumptions. A different quantization framework is also proposed for quantized distributed relay networking where the relay nodes perform vector quantization instead of sign quantization. Applying vector quantization at the relay nodes enables us to propose an algorithm that allocates quantization resources efficiently among the relay nodes inside the relay network. We also study the beamforming design at the users’ side in this case where beamforming design is not trivial due to the quantization that occurs at the relay network. Finally, we study a different setup of distributed communication systems called cell-free massive MIMO. In cell-free massive MIMO, regular cellular communication is replaced by multiple access points (APs) that are placed randomly over the coverage area. All users in the coverage area are sharing time and frequency resources and all APs are serving all UEs while power allocation is done in a central processor that is connected to the APs through a high speed backhaul network. We study the power allocation in cell-free massive MIMO system where APs are equipped with few antennas and how the distribution of the available antennas among access points affects both the performance and the infrastructure cost

Boosting Spectral Efficiency with Data-Carrying Reference Signals on the Grassmann Manifold

In wireless networks, frequent reference signal transmission for accurate channel reconstruction may reduce spectral efficiency. To address this issue, we consider to use a data-carrying reference signal (DC-RS) that can simultaneously estimate channel coefficients and transmit data symbols. Here, symbols on the Grassmann manifold are exploited to carry additional data and to assist in channel estimation. Unlike conventional studies, we analyze the channel estimation errors induced by DC-RS and propose an optimization method that improves the channel estimation accuracy without performance penalty. Then, we derive the achievable rate of noncoherent Grassmann constellation assuming discrete inputs in multi-antenna scenarios, as well as that of coherent signaling assuming channel estimation errors modeled by the Gauss-Markov uncertainty. These derivations enable performance evaluation when introducing DC-RS, and suggest excellent potential for boosting spectral efficiency, where interesting crossings with the non-data carrying RS occurred at intermediate signal-to-noise ratios.Comment: 13 pages, 10 figure