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
Distributed space-time codes: relays delays and code word overlays
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
IEEE Transactions on Wireless Communications
On the design of delay-tolerant distributed space-time codes with minimum length
IEEE Transactions on Wireless Communications
Code rate-diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
Asymptotic-information-lossless designs and the 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
IEEE Transactions on Information Theory
On the limitations of the naive lattice decoding
IEEE Transactions on Information Theory
Signal space diversity techniques with fast decoding based on MDS codes
IEEE Transactions on Communications
Space-time block codes for quasi-synchronous cooperative diversity
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Coded modulation with mismatched CSIT over MIMO block-fading channels
IEEE Transactions on Information Theory
Full-diversity space-time error correcting codes with low-complexity receivers
EURASIP Journal on Wireless Communications and Networking
Distributed Space-Time Codes Using Constellation Rotation
Wireless Personal Communications: An International Journal
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
Hi-index | 755.26 |
The problem of constructing space-time (ST) block codes over a fixed, desired signal constellation is considered. In this situation, there is a tradeoff between the transmission rate as measured in constellation symbols per channel use and the transmit diversity gain achieved by the code. The transmit diversity is a measure of the rate of polynomial decay of pairwise error probability of the code with increase in the signal-to-noise ratio (SNR). In the setting of a quasi-static channel model, let nt denote the number of transmit antennas and T the block interval. For any nt ≤ T, a unified construction of (nt × T) ST codes is provided here, for a class of signal constellations that includes the familiar pulse-amplitude (PAM), quadrature-amplitude (QAM), and 2K-ary phase-shift-keying (PSK) modulations as special cases. The construction is optimal as measured by the rate-diversity tradeoff and can achieve any given integer point on the rate-diversity tradeoff curve. An estimate of the coding gain realized is given. Other results presented here include i) an extension of the optimal unified construction to the multiple fading block case, ii) a version of the optimal unified construction in which the underlying binary block codes are replaced by trellis codes, iii) the providing of a linear dispersion form for the underlying binary block codes, iv) a Gray-mapped version of the unified construction, and v) a generalization of construction of the -ary case corresponding to constellations of size K. Items ii) and iii) are aimed at simplifying the decoding of this class of ST codes.