A low-complexity approach to space-time coding for multipath fading channels
EURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Applied Signal Processing
Majorization and matrix-monotone functions in wireless communications
Foundations and Trends in Communications and Information Theory
Guaranteed performance region in fading orthogonal space-time coded broadcast channels
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
Multilevel and multidimensional Hadamard matrices
Designs, Codes and Cryptography
High-rate Complex Orthogonal Space-time Block Codes for 5 and 6 Transmit Antennas
Wireless Personal Communications: An International Journal
Throughput versus fairness: channel-aware scheduling in multiple antenna downlink
EURASIP Journal on Wireless Communications and Networking - Special issue on fairness in radio resource management for wireless networks
IEEE Transactions on Communications
Square complex orthogonal designs with low PAPR and signaling complexity
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Low PAPR square STBCs from complex partial-orthogonal designs (CPODs)
IEEE Transactions on Wireless Communications
Single-symbol ML decodable distributed STBCs for partially-coherent cooperative networks
IEEE Transactions on Wireless Communications
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
Novel constructions of improved square complex orthogonal designs for eight transmit antennas
IEEE Transactions on Information Theory
High-rate, single-symbol ML decodable precoded DSTBCs for cooperative networks
IEEE Transactions on Information Theory
New space and time coding with high performance and very low peak to average power ratio
WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
High-rate, 2-group ML-decodable STBCs for 2m transmit antennas
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Novel rotated quasi-orthogonal space-time block codes with the fixed nearest neighbor number
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A novel construction of complex orthogonal designs with maximal rate and low-PAPR
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
High-rate groupwise STBC using low-complexity SIC based receiver
IEEE Transactions on Wireless Communications
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
IEEE Transactions on Information Theory
STBCs with reduced sphere decoding complexity for two-user MIMO-MAC
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Embedded orthogonal space-time codes for high rate and low decoding complexity
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The final case of the decoding delay problem for maximum rate complex orthogonal designs
IEEE Transactions on Information Theory
Semiorthogonal space-time block codes
IEEE Transactions on Information Theory
IEEE Communications Letters
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
Cooperative transmission for wireless relay networks using limited feedback
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Orthogonal-like space-time-coded CPM systems with fast decoding for three and four transmit antennas
IEEE Transactions on Information Theory
IEEE Transactions on Signal Processing
On space-time block codes from coordinate interleaved orthogonal designs
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Impact of spatial correlation and precoding design in OSTBC MIMO systems
IEEE Transactions on Wireless Communications
WSEAS TRANSACTIONS on COMMUNICATIONS
Tensor space-time (TST) coding for MIMO wireless communication systems
Signal Processing
Continuous Phase Modulation and Space-Time Coding: A Candidate for Wireless Robotics
Wireless Personal Communications: An International Journal
Hi-index | 755.38 |
Orthogonal designs have been used as space-time block codes for wireless communications with multiple transmit antennas, which can achieve full transmit diversity and have a very simple decoupled maximum-likelihood decoding algorithm. The rate of an orthogonal design is defined as the ratio of the number of transmitted information symbols in a block of channel uses to the length of the given block, which reflects the bandwidth efficiency of the employed space-time block code constructed from the orthogonal design. This paper focuses on the analysis and synthesis of orthogonal designs with the maximum possible rates, which may be real or complex and square or rectangular matrices. We first provide several representations of orthogonal designs and their characterizations in terms of Hurwitz-Radon matrix equations. Next, we observe that the real orthogonal designs, square or rectangular, and the complex square orthogonal designs with maximal rates have been well understood from the existing results in the mathematics literature which can be dated back to 1890s. However, unfortunately, it is not the case for the complex rectangular orthogonal designs with rates as high as possible. We then construct a class of complex orthogonal designs for any number of transmit antennas. The proposed complex orthogonal designs for the number of transmit antennas n=2m-1 and 2m have the same rate m+1 and 2m, where m is any natural number. Finally, we demonstrate that, for n=2m-1 and 2m with any given natural number m, the value m+1 and 2m is the maximum possible rate that the complex orthogonal designs, square or rectangular, with n transmit antennas can achieve.