Systematic design of space-time trellis codes for diversity and coding advantages
EURASIP Journal on Applied Signal Processing - Space-time coding and its applications - part I
Low complexity receiver structures for space-time coded multiple-access systems
EURASIP Journal on Applied Signal Processing - Space-time coding and its applications - part I
Algebraic Constructions for PSK Space-Time Coded Modulation
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Multiantenna technology for high-speed wireless internet access
Wireless internet handbook
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
Transmission and reception with multiple antennas: theoretical foundations
Communications and Information Theory
Turbo equalization for block fading MIMO channels using random signal mapping
Computers and Electrical Engineering
Systematic design of space-time trellis codes for diversity and coding advantages
EURASIP Journal on Applied Signal Processing
Low complexity receiver structures for space-time coded multiple-access systems
EURASIP Journal on Applied Signal Processing
On some design issues of space-time coded multi-antenna systems
EURASIP Journal on Applied Signal Processing
EURASIP Journal on Applied Signal Processing
Majorization and matrix-monotone functions in wireless communications
Foundations and Trends in Communications and Information Theory
Computers and Electrical Engineering
Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
Joint application of STBC and RAKE receivers in multipath Rayleigh fading channels
IEEE Communications Letters
Space-time trellis codes for MSK
Computers and Electrical Engineering
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
On the design of delay-tolerant distributed space-time codes with minimum length
IEEE Transactions on Wireless Communications
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
MIMO based CDMA code acquisition in Rayleigh fading channels
WOC '08 Proceedings of the Eighth IASTED International Conference on Wireless and Optical Communications
An improved space-time decoder under MIMO system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Separable implementation of L2-orthogonal STC CPM with fast decoding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Performance Analysis of MIMO Based CDMA Code Acquisition Over Rayleigh Fading Channels
Wireless Personal Communications: An International Journal
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
Full-diversity space-time error correcting codes with low-complexity receivers
EURASIP Journal on Wireless Communications and Networking
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Adaptively Grouped Multilevel Space-Time Trellis Codes
Wireless Personal Communications: An International Journal
Hi-index | 754.96 |
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