A-BLAST: a novel approach to adaptive layered space-time processing
Proceedings of the 2006 international conference on Wireless communications and mobile computing
EURASIP Journal on Applied Signal Processing
Wireless Personal Communications: An International Journal
Foundations and Trends in Signal Processing
Orthogonal structured linear dispersion code for fast sphere decoding
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
Performance of adaptive MIMO system based on beam-nulling
ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Design of linear dispersion codes for MIMO broadband wireless access systems
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Switched-mode BLAST technique for MIMO communications
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Rectangular information lossless linear dispersion codes
IEEE Transactions on Wireless Communications
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Coherent and differential space-time shift keying: a dispersion matrix approach
IEEE Transactions on Communications
Sparse fusion frames: existence and construction
Advances in Computational Mathematics
| Hi-index | 35.86 |
Multiple-input multiple-output (MIMO) wireless communication systems provide high capacity due to the plurality of modes available in the channel. Existing signaling techniques for MIMO systems have focused primarily on multiplexing for high data rate or diversity for high link reliability. In this paper, we present a new linear dispersion code design for MIMO Rayleigh fading channels. The proposed design bridges the gap between multiplexing and diversity and yields codes that typically perform well both in terms of ergodic capacity as well as error probability. This is important because, as we show, designs performing well from an ergodic capacity point of view do not necessarily perform well from an error probability point of view. Various techniques are presented for finding codes with good error probability performance. Monte Carlo simulations illustrate performance of some example code designs in terms of ergodic capacity, codeword error probability, and bit error probability.