Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants

Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure with special QR decomposition characteristics. In this paper, we adopt a simplified form of this fast-decodable code structure and present a new way to optimize the code analytically. We show that the signal constellation topology (such as QAM, APSK, or PSK) has a critical impact on the existence of non-vanishing determinants of the full-rate STBC. In particular, we show for the first time that, in order for APSK-STBC to achieve non-vanishing determinant, an APSK constellation topology with constellation points lying on square grid and ring radius \sqrt{m^2+n^2} (m,n\emph{\emph{integers}}) needs to be used. For signal constellations with vanishing determinants, we present a methodology to analytically optimize the full-rate STBC at specific constellation dimension.Comment: Accepted by IEEE Transactions on Communication

Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov Random Field (MRF) based graphical model with pairwise interaction, in conjunction with {\em message/belief damping}, and 2) use of Factor Graph (FG) based graphical model with {\em Gaussian approximation of interference} (GAI). The per-symbol complexities are $O(K^2n_t^2)$ and $O(Kn_t)$ for the MRF and the FG with GAI approaches, respectively, where $K$ and $n_t$ denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large $Kn_t$. From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing $Kn_t$. Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of $M$-QAM symbol detection

Perfect Space–Time Block Codes

In this paper, we introduce the notion of perfect space–time block codes (STBCs). These codes have full-rate, full-diversity, nonvanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping. We present algebraic constructions of perfect STBCs for 2, 3, 4, and 6 antennas

Full-Diversity QO-STBC Technique for Large-Antenna MIMO Systems

YesThe need to achieve high data rates in modern telecommunication systems, such as 5G standard, motivates the study and development of large antenna and multiple-input multiple-output (MIMO) systems. This study introduces a large antenna-order design of MIMO quasi-orthogonal space-time block code (QO-STBC) system that achieves better signal-to-noise ratio (SNR) and bit-error ratio (BER) performances than the conventional QO-STBCs with the potential for massive MIMO (mMIMO) configurations. Although some earlier MIMO standards were built on orthogonal space-time block codes (O-STBCs), which are limited to two transmit antennas and data rates, the need for higher data rates motivates the exploration of higher antenna configurations using different QO-STBC schemes. The standard QO-STBC offers a higher number of antennas than the O-STBC with the full spatial rate. Unfortunately, also, the standard QO-STBCs are not able to achieve full diversity due to self-interference within their detection matrices; this diminishes the BER performance of the QO-STBC scheme. The detection also involves nonlinear processing, which further complicates the system. To solve these problems, we propose a linear processing design technique (which eliminates the system complexity) for constructing interference-free QO-STBCs and that also achieves full diversity using Hadamard modal matrices with the potential for mMIMO design. Since the modal matrices that orthogonalize QO-STBC are not sparse, our proposal also supports O-STBCs with a well-behaved peak-to-average power ratio (PAPR) and better BER. The results of the proposed QO-STBC outperform other full diversity techniques including Givens-rotation and the eigenvalue decomposition (EVD) techniques by 15 dB for both MIMO and multiple-input single-output (MISO) antenna configurations at 10−3 BER. The proposed interference-free QO-STBC is also implemented for 16×NR and 32×NR MIMO systems, where NR≤2. We demonstrate 8 x 16 and 32 transmit antenna-enabled MIMO systems with the potential for mMIMO design applications with attractive BER and PAPR performance characteristics

Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that the ML decoding performance can be achieved with a complexity of O(M^{4.5}) instead of O(M^8) in quasi static channel with M-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration

Efficient MIMO-OFDM Schemes for Future Terrestrial Digital TV with Unequal Received Powers

International audienceThis article investigates the effect of equal and unequal received powers on the performances of different MIMO-OFDM schemes for terrestrial digital TV. More precisely, we focus on three types of non-orthogonal schemes: the BLAST scheme, the Linear Dispersion (LD) code and the Golden code, and we compare their performances to that of Alamouti scheme. Using two receiving antennas, we show that for moderate attenuation on the second antenna and high spectral efficiency, Golden code outperforms other schemes. However, Alamouti scheme presents the best performance for low spectral efficiency and equal received powers or when one antenna is dramatically damaged. When three antennas are used, we show that Golden code offers the highest robustness to power unbalance at the receiving sid

System Level Evaluation of Innovative Coded MIMO-OFDM Systems for Broadcasting Digital TV

Single-frequency networks (SFNs) for broadcasting digital TV is a topic of theoretical and practical interest for future broadcasting systems. Although progress has been made in the characterization of its description, there are still considerable gaps in its deployment with MIMO technique. The contribution of this paper is multifold. First, we investigate the possibility of applying a space-time (ST) encoder between the antennas of two sites in SFN. Then, we introduce a 3D space-time-space block code for future terrestrial digital TV in SFN architecture. The proposed 3D code is based on a double-layer structure designed for intercell and intracell space time-coded transmissions. Eventually, we propose to adapt a technique called effective exponential signal-to-noise ratio (SNR) mapping (EESM) to predict the bit error rate (BER) at the output of the channel decoder in the MIMO systems. The EESM technique as well as the simulations results will be used to doubly check the efficiency of our 3D code. This efficiency is obtained for equal and unequal received powers whatever is the location of the receiver by adequately combining ST codes. The 3D code is then a very promising candidate for SFN architecture with MIMO transmission