Information-Lossless Space–Time Block Codes From Crossed-Product Algebras

It is known that the Alamouti code is the only complex orthogonal design (COD) which achieves capacity and that too for the case of two transmit and one receive antenna only. Damen proposed a design for two transmit antennas, which achieves capacity for any number of receive antennas, calling the resulting space-time block code (STBC) when used with a signal set an information-lossless STBC. In this paper, using crossed-product central simple algebras, we construct STBCs for arbitrary number of transmit antennas over an a priori specified signal set. Alamouti code and quasi-orthogonal designs are the simplest special cases of our constructions. We obtain a condition under which these STBCs from crossed-product algebras are information-lossless. We give some classes of crossed-product algebras, from which the STBCs obtained are information-lossless and also of full rank. We present some simulation results for two, three, and four transmit antennas to show that our STBCs perform better than some of the best known STBCs and also that these STBCs are approximately 1 dB away from the capacity of the channel with quadrature amplitude modulation (QAM) symbols as input     

Generally Explicit Space–Time Codes With Nonvanishing Determinants for Arbitrary Numbers of Transmit Antennas

Nonvanishing determinants have emerged as an attractive criterion enabling a space–time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space–time code with nonvanishing determinants. In this paper, we explicitly construct space–time codes for arbitrary numbers of transmit antennas that achieve nonvanishing determinants and the optimal diversity-multiplexing gains tradeoff over $BBZ left [ {bf i}right ]$. Unlike previous methods usually arising a field compositum for two or more fields, our scheme, which only requires one simple extension, constitutes a much more efficient and feasible advancement whether in theory or practice.      

Real-Domain Decoder for Full-Rate Full-Diversity STBC with Multidimensional Constellations

In this letter, we present a new maximum likelihood (ML) decoding algorithm for space time block codes (STBCs) that employ multidimensional constellations. We start with a lattice representation for STBCs which transforms complex channel models into real matrix equations. Based on the lattice representation, we propose a new decoding algorithm for quasiorthogonal STBCs (QO-STBC) which allows simpleML decoding with performance identical to the conventional ML decoder. Multidimensional rotated constellations are constructed for the QO-STBCs to achieve full diversity. As a consequence, for quasi-orthogonal designs with an arbitrary number of transmit antennas N (N ? 4), the proposed decoding scheme achieves full rate and full diversity while reducing the decoding complexity from ∂(M_c^N/2) to ∂(M_c^N/4) in a M_c-QAM constellation.     

Gaussian integers and interleaved rank codes for space–time block codes

This paper presents the design of space–time block codes (STBCs) over maximum rank distance (MRD) codes, energy‐efficient STBCs, STBCs using interleaved‐MRD codes, the use of Gaussian integers for STBCs modulation, and Gabidulin's decoding algorithm for decoding STBCs. The design fundamentals of STBCs using MRD codes are firstly put forward for different number of transmit antennas. Extension finite fields (Galois fields) are used to design these linear block codes. Afterward, a comparative study of MRD‐based STBCs with corresponding orthogonal and quasi‐orthogonal codes is also included in the paper. The simulation results show that rank codes, for any number of transmit antennas, exhibit diversity gain at full rate contrary to orthogonal codes, which give diversity gain at full rate only for two transmit antennas case. Secondly, an energy‐efficient MRD‐STBC is proposed, which outperforms orthogonal STBC at least for 2 × 1 antenna system. Thirdly, interleaved‐MRD codes are used to construct higher‐order transmit antenna systems. Using interleaved‐MRD codes further reduces the complexity (compared with normal MRD codes) of the decoding algorithm. Fourthly, the use of Gaussian integers is utilized in mapping MRD‐based STBCs to complex constellations. Furthermore, it is described how an efficient and computationally less complex Gabidulin's decoding algorithm can be exploited for decoding complex MRD‐STBCs. The decoding results have been compared against hard‐decision maximum likelihood decoding. Under this decoding scheme, MRD‐STBCs have been shown to be potential candidate for higher transmit antenna systems as the decoding complexity of Gabidulin's algorithm is far less, and its performance for decoding MRD‐STBCs is somewhat reasonable. Copyright © 2015 John Wiley & Sons, Ltd.     

Signal constellations for quasi-orthogonal space-time block codes with full diversity

Space-time block codes (STBCs) from orthogonal designs proposed by Alamouti, and Tarokh-Jafarkhani-Calderbank have attracted considerable attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of an STBC from complex orthogonal designs for complex signals is only 3/4 for three and four transmit antennas, and it is difficult to construct complex orthogonal designs with rate higher than 1/2 for more than four transmit antennas. Recently, Jafarkhani, Tirkkonen-Boariu-Hottinen, and Papadias-Foschini proposed STBCs from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, the quasi-orthogonal STBCs still have a fast ML decoding, but do not have the full diversity. The performance of these codes is better than that of the codes from orthogonal designs at low signal-to-noise ratio (SNR), but worse at high SNR. This is due to the fact that the slope of the performance curve depends on the diversity. It is desired to have the quasi-orthogonal STBCs with full diversity to ensure good performance at high SNR. In this paper, we achieve this goal by properly choosing the signal constellations. Specifically, we propose that half of the symbols in a quasi-orthogonal design are chosen from a signal constellation set A and the other half of them are chosen from a rotated constellation e/sup j/spl phi// A. The resulting STBCs can guarantee both full diversity and fast ML decoding. Moreover, we obtain the optimum selections of the rotation angles /spl phi/ for some commonly used signal constellations. Simulation results show that the proposed codes outperform the codes from orthogonal designs at both low and high SNRs.     

Single-symbol maximum likelihood decodable linear STBCs

Space-time block codes (STBCs) from orthogonal designs (ODs) and coordinate interleaved orthogonal designs (CIOD) have been attracting wider attention due to their amenability for fast (single-symbol) maximum-likelihood (ML) decoding, and full-rate with full-rank over quasi-static fading channels. However, these codes are instances of single-symbol decodable codes and it is natural to ask, if there exist codes other than STBCs form ODs and CIODs that allow single-symbol decoding? In this paper, the above question is answered in the affirmative by characterizing all linear STBCs, that allow single-symbol ML decoding (not necessarily full-diversity) over quasi-static fading channels-calling them single-symbol decodable designs (SDD). The class SDD includes ODs and CIODs as proper subclasses. Further, among the SDD, a class of those that offer full-diversity, called Full-rank SDD (FSDD) are characterized and classified. We then concentrate on square designs and derive the maximal rate for square FSDDs using a constructional proof. It follows that 1) except for N=2, square complex ODs are not maximal rate and 2) a rate one square FSDD exist only for two and four transmit antennas. For nonsquare designs, generalized coordinate-interleaved orthogonal designs (a superset of CIODs) are presented and analyzed. Finally, for rapid-fading channels an equivalent matrix channel representation is developed, which allows the results of quasi-static fading channels to be applied to rapid-fading channels. Using this representation we show that for rapid-fading channels the rate of single-symbol decodable STBCs are independent of the number of transmit antennas and inversely proportional to the block-length of the code. Significantly, the CIOD for two transmit antennas is the only STBC that is single-symbol decodable over both quasi-static and rapid-fading channels.     

On channel orthogonalization using space-time block coding with partial feedback

Orthogonal space-time block codes (OSTBCs) yield full diversity gain even while requiring only a linear receiver. Such full-rate (rate-one) orthogonal designs are available for complex symbol constellations only for N=2 transmit antennas. In this paper, we propose a new family of full-rate space-time block codes (STBCs) using a single parameter feedback for communication over Rayleigh fading channels for N=3,4 transmit antennas and M receive antennas. The proposed rate-one codes achieve full diversity, and the performance is similar to maximum receiver ratio combining. The decoding complexity of these codes are only linear even while performing maximum-likelihood decoding. The partial channel information is a real phase parameter that is a function of all the channel gains, and has a simple closed-form expression for N=3,4. This feedback information enables us to derive (channel) orthogonal designs starting from quasi-orthogonal STBCs. The feedback complexity is significantly lower than conventional closed-loop transmit beamforming. We compare the proposed codes with the open-loop OSTBCs and also with the closed-loop equal gain transmission (EGT) scheme which uses equal power loading on all antennas. Simulated error-rate performances indicate that the proposed channel orthogonalized STBCs significantly outperform the open-loop orthogonal designs, for the same spectral efficiency. Moreover, even with significantly lower feedback and computational complexity, the proposed scheme outperforms the EGT technique for M>N.     

On Space–Time Coding With Pulse Position and Amplitude Modulations for Time-Hopping Ultra-Wideband Systems

In this work, we propose novel families of space-time (ST) block codes that can be associated with impulse radio ultra-wideband (IR-UWB) communication systems. The carrier-less nature of this nonconventional totally real transmission technique necessitates the construction of new suitable coding schemes. In fact, the last generation of complex-valued ST codes (namely, the perfect codes) cannot be associated with IR-UWB systems where the phase reconstitution at the receiver side is practically infeasible. On the other hand, while the perfect codes were considered mainly with quadrature amplitude modulation (QAM) and hexagonal (HEX) constellations, IR-UWB systems are often associated with pulse-position modulation (PPM) and hybrid PPM-PAM (pulse-amplitude modulation) constellations. In this paper, instead of adopting the classical approach of constructing ST codes over infinite fields or for the perfect codes), we study the possibility of constructing modulation-specific codes that are exclusive to PPM and PPM-PAM. The proposed full-rate codes are totally real, information lossless, and have a uniform average energy per transmit antenna. They permit to achieve a full diversity order with any number of transmit antennas. In some situations, the proposed schemes have an optimal nonvanishing coding gain and satisfy all the construction constraints of the perfect codes in addition to the constraint of being totally real. Simulations performed over realistic indoor UWB channels showed that the proposed schemes outperform the best known codes constructed from cyclic division algebras.     

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     

Space-time power optimization of variable-rate space-time block codes based on successive interference cancellation

Based on a zero-forcing with successive interference cancellation (ZFSIC) method, we construct variable-rate space-time block codes (STBCs) for two, three, and four transmit antennas in Rayleigh fading channels. Considering the error-propagation effect in the ZFSIC scheme, we analyze the bit-error rate (BER) and optimize the transmit power so that the average BER is minimized. Unlike the approach based on zero-forcing (ZF), the method adopted in this paper can construct variable-rate STBCs even when the receive antennas are fewer than the transmit antennas. In addition, to improve the BERs further, we propose space-time power optimization. Numerical results show that the codes presented in this paper provide much lower BERs, compared with the codes developed by Kim and Tarokh.     

Improved signal constellations for differential unitary space-time modulations with more than two transmit antennas

In this paper, we propose new and improved unitary signal constellations for differential unitary space-time modulations utilizing more than two transmit antennas. The proposed unitary designs are constructed from fundamental building blocks which comprise the generator matrices of diagonal cyclic codes, and the 2/spl times/2 and 3/spl times/3 rotational matrices. The performances of the proposed codes are superior to those of previously proposed codes.     

High Data Rate Alamouti Code From Field Extension

Alamouti code is the only known Orthogonal Space Time Block Code (OSTBC) with rate-1. All other known orthogonal codes have rate less than unity. The orthogonal property of OSTBCs reduces the decoding complexity to a large extent. High data rate Space Time Block Codes for arbitrary number of transmit antennas were recently proposed based on Division Algebras. But these STBCs are not orthogonal. Therefore their decoding complexity is very high. In this paper we propose high data rate Alamouti codes from field extensions for two transmit antennas. Our codes have better coding gain than the both high rate codes from division algebra and the rate-1 Alamouti code. Vishwanath R was born in Hyderabad, India in 1982. He did his B.E. in Electronics and Communications Engineering from Birla Institute Of Technology, Ranchi, India in 2002 and Master of Technology in Communications Engineering in 2005 from Indian Institute of Technology Delhi, India.. Currently he is pursuing PhD from Indian Institute of Technology Delhi, India. His research interests include Routing in Optical Networks, Signal Processing, Wireless Communications and Image Processing. He is a member of the IEEE. Bhatnagar Manav R was born in Moradabad, India in 1976. He did his B.E. in Electronics in 1997 and Master of Technology in Communications Engineering in 2005 from Indian Institute of Technology Delhi, India. He has worked as lecturer in Moradabad Institute of Technology, Moradabad, India from 1998–2003. He is currently pursuing PhD from Indian Institute of Technology Delhi, India. His research interests include Routing in Optical Networks, Signal Processing in Wireless Communications and Image Processing. He is a member of the IEEE.     

Novel Constructions of Improved Square Complex Orthogonal Designs for Eight Transmit Antennas

Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages that the power is equally transmitted via each transmit antenna during every symbol time slot and that a lower peak-to-average power ratio (PAPR) is required to achieve the same bit error rates as the conventional CO STBCs with zeros.     

Maximal Orders in the Design of Dense Space-Time Lattice Codes

In this paper, we construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, nonvanishing determinants (NVDs) for four transmit antenna multiple-input–single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions and can be extended to a larger number of Tx antennas. The usage of ideals guarantees an NVD larger than one and an easy way to present the exact proofs for the minimum determinants. The idea of finding denser sublattices within a given division algebra is then generalized to a multiple-input–multiple-output (MIMO) case with an arbitrary number of Tx antennas by using the theory of cyclic division algebras (CDAs) and maximal orders. It is also shown that the explicit constructions in this paper all have a simple decoding method based on sphere decoding. Related to the decoding complexity, the notion of sensitivity is introduced, and experimental evidence indicating a connection between sensitivity, decoding complexity, and performance is provided. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform both the earlier rectangular lattices and the rotated quasi-orthogonal ABBA lattice as well as the diagonal algebraic space-time (DAST) lattice. We also show that our quaternionic lattice is better than the DAST lattice in terms of the diversity-multiplexing gain tradeoff (DMT).      

Existence and construction of noncoherent unitary space-time codes

We consider transmission using N transmit and reception using M receive antennas in a wireless environment assuming that neither the transmitter nor the receiver knows the channel coefficients. For the scenario that the transmission employs noncoherent T /spl times/ N unitary space-time codes and for a block-fading channel model where the channel is static during T channel uses and varies from T channel uses to the other, we establish the bound r /spl les/ min(T-N, N) on the diversity advantage rM provided by the code. In order to show that the requirement r /spl les/ min(T-N, N) cannot be relaxed, for any given R, N, T, and r /spl les/ min(T-N, N), we then construct unitary T /spl times/ N space-time codes of rate R that guarantee diversity advantage rM. Two constructions are given that are also amenable to simple encoding and noncoherent maximum-likelihood (ML) decoding algorithms.     

Performance bounds for space-time block codes with receive antenna selection

In this correspondence, we present a comprehensive performance analysis of orthogonal space-time block codes (STBCs) with receive antenna selection. For a given number of receive antennas M, we assume that the receiver uses the best L of the available M antennas, where, typically, L/spl les/M. The selected antennas are those that maximize the instantaneous received signal-to-noise ratio (SNR). We derive explicit upper bounds on the bit-error rate (BER) performance of the above system for any M and L, and for any number of transmit antennas. We show that the diversity order, with antenna selection, is maintained as that of the full complexity system, whereas the deterioration in SNR is upper-bounded by 10log/sub 10/(M/L) decibels. Furthermore, we derive a tighter upper bound for the BER performance for any N and M when L=1, and derive an expression for the exact BER performance for the Alamouti scheme when L=1. We also present simulation results that validate our analysis.     

On the theory of space-time codes for PSK modulation

The design of space-time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codewords, which is difficult to relate to traditional code designs over finite fields and rings. We present general binary design criteria for PSK-modulated space-time codes. For linear BPSK/QPSK codes, the rank of (binary projections of) the unmodulated codewords, as binary matrices over the binary field, is a sufficient design criterion: full binary rank guarantees full spatial diversity. This criterion accounts for much of what is currently known about PSK-modulated space-time codes. We develop new fundamental code constructions for both quasi-static and time-varying channels. These are perhaps the first general constructions-other than delay diversity schemes-that guarantee full spatial diversity for an arbitrary number of transmit antennas     

Cyclic Algebras for Noncoherent Differential Space–Time Coding

We investigate cyclic algebras for coding over the differential noncoherent channel. Cyclic algebras are an algebraic object that became popular for coherent space-time coding, since it naturally yields linear families of matrices with full diversity. Coding for the differential noncoherent channel has a similar flavor in the sense that it asks for matrices that achieve full diversity, except that these matrices furthermore have to be unitary. In this work, we give a systematic way to find infinitely many unitary matrices inside cyclic algebras, which holds for all dimensions. We show how cyclic algebras generalize previous families of unitary matrices obtained using the representation of fixed-point-free groups. As an application of our technique, we present families of codes for three and four antennas that achieve high coding gain.     

Full-rate full-diversity STBCs for three and four transmit antennas

A novel technique is presented for the construction of full-rate, fulldiversity space?time block codes (STBCs) from orthogonal STBCs (OSTBCs), having empty slots left in their codeword matrices for orthogonality. Two new STBCs are obtained, which are both fullrate and full-diversity, for three and four transmit antennas. The higher decoding complexity of these structures is reduced owing to non-orthogonality by using a conditional maximum-likelihood decoder. The new optimised codes provide better error performance than their full-rate full-diversity counterparts given in the literature.     

Unitary Nongroup STBC From Cyclic Algebras

Space-time block codes (STBCs) are designed for multiple-input-multiple-output (MIMO) channels. In order to avoid errors, single-input-single-output (SISO) fading channels require long coding blocks and interleavers that result in high delays. If one wishes to increase the data rate it is necessary to take advantage of space diversity. Early STBC, that where developed by Alamouti for known channels and by Tarokh for unknown channels, have been proven to increase the performance of channels characterized by Rayleigh fading. Codes that are based on division algebras have by definition nonzero diversity and therefore are suitable for STBC in order to achieve high rates at low symbol-to-noise ratio (SNR). This work presents new high-diversity group-based STBCs with improved performance both in known and unknown channels. We describe two new sets of codes for multiple antenna communication. The first set is a set of "superquaternions" and improves considerably on the Alamouti codes. It is based on the mathematical fact that "normalized" integral quaternions are very well distributed over the unit sphere in four-dimensional (4-D) Euclidean space. The second set of codes gives arrays of 3times3 unitary matrices with full diversity. Here the idea is to use cosets of finite subgroups of division algebras that are nine-dimensional (9-D) over their center, which is a finite cyclotomic extension of the field of rational numbers. It is shown that these codes outperform Alamouti and G _mr