A family of distributed space-time trellis codes with asynchronous cooperative diversity
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Linear diversity-embedding STBC: design issues and applications
IEEE Transactions on Communications
Code rate-diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
Diversity product properties of Lu-Kumar's space-time codes
IEEE Transactions on Information Theory
A space-time code design for CPM: diversity order and coding gain
IEEE Transactions on Information Theory
Layered video multicast using diversity embedded space time codes
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Spectra of Boolean functions, subspaces of matrices, and going up versus going down
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Signal space diversity techniques with fast decoding based on MDS codes
IEEE Transactions on Communications
Full-diversity space-time error correcting codes with low-complexity receivers
EURASIP Journal on Wireless Communications and Networking
Hi-index | 755.02 |
We show that for any (Q×M) space-time code S having a fixed, finite signal constellation, there is a tradeoff between the transmission rate R and the transmit diversity gain ν achieved by the code. The tradeoff is characterized by R≤Q-ν+1, where Q is the number of transmit antennas. When either binary phase-shift keying (BPSK) or quaternary phase-shift keying (QPSK) is used as the signal constellation, a systematic construction is presented to achieve the maximum possible rate for every possible value of transmit diversity gain.