Space-Time Coding
Complex Orthogonal Space-Time Processing in Wireless Communications
Complex Orthogonal Space-Time Processing in Wireless Communications
Space-time diversity using orthogonal and amicable orthogonal designs
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05
Multigroup decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
Four-Group Decodable Space–Time Block Codes
IEEE Transactions on Signal Processing
Quasi-orthogonal STBC with minimum decoding complexity
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Correction to "Space-time block codes from orthogonal designs"
IEEE Transactions on Information Theory
Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Remarks on space-time codes including a new lower bound and an improved code
IEEE Transactions on Information Theory
New algebraic constructions of rotated Zn-lattice constellations for the Rayleigh fading channel
IEEE Transactions on Information Theory
Signal constellations for quasi-orthogonal space-time block codes with full diversity
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Partially-coherent distributed space-time codes with differential encoder and decoder
IEEE Journal on Selected Areas in Communications
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
Hi-index | 754.90 |
It is well known that space-time block codes (STBCs) obtained from orthogonal designs (ODs) are single-symbol decodable (SSD) and from quasi-orthogonal designs (QODs) are double-symbol decodable (DSD). However, there are SSD codes that are not obtainable from ODs and DSD codes that are not obtainable from QODs. In this paper, a method of constructing g-symbol decodable (g-SD) STBCs using representations of Clifford algebras are presented which when specialized to g = 1, 2 gives SSD and DSD codes, respectively. For the number of transmit antennas 2a the rate (in complex symbols per channel use) of the g-SD codes presented in this paper is a+1-g/2a-g. The maximum rate of the DSD STBCs from QODs reported in the literature is a/2a-1 which is smaller than the rate a-1/2a-2 of the DSD codes of this paper, for 2a transmit antennas. In particular, the reported DSD codes for 8 and 16 transmit antennas offer rates 1 and 3/4, respectively, whereas the known STBCs from QODs offer only 3/4 and 1/2, respectively. The construction of this paper is applicable for any number of transmit antennas. The diversity sum and diversity product of the new DSD codes are studied. It is shown that the diversity sum is larger than that of all known QODs and hence the new codes perform better than the comparable QODs at low signal-to-noise ratios (SNRs) for identical spectral efficiency. Simulation results for DSD codes at various spectral efficiencies are provided.