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
Capacity and performance analysis of space-time block codes in Rayleigh fading channels
WSEAS TRANSACTIONS on COMMUNICATIONS
Multi-hop capacity of MIMO-multiplexing relaying systems
IEEE Transactions on Wireless Communications
Switched-mode BLAST technique for MIMO communications
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
An efficient MIMO detection algorithm employed in imperfect noise estimation
WSEAS TRANSACTIONS on COMMUNICATIONS
WSEAS TRANSACTIONS on COMMUNICATIONS
WSEAS Transactions on Signal Processing
A new two-user cooperative transmission scheme with low-complexity FDE in SC-FDMA systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Per-antenna rate and power control for MIMO layered architectures in the low- and high-power regimes
IEEE Transactions on Communications
Multi-hop capacity of MIMO-multiplexing relaying in WiMAX mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Semiorthogonal space-time block codes
IEEE Transactions on Information Theory
Trellis coded spatial modulation
IEEE Transactions on Wireless Communications
Complexity Reduction by Using QR-Based Scheme in Computing Capacity for Optimal Transmission
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Hi-index | 0.13 |
In this paper, we discuss some of the most basic architectural superstructures for wireless links with multiple antennas: M at the transmit site and N at the receive site. Toward leveraging the gains of the last half century of coding theory, we emphasize those structures that can be composed using spatially one dimensional coders and decoders. These structures are investigated primarily under a probability of outage constraint. The random matrix channel is assumed to hold steady for such a large number of M-dimensional vector symbol transmission times, that an infinite time horizon Shannon analysis provides useful insights. The resulting extraordinary capacities are contrasted for architectures that differ in the way that they manage self-interference in the presence of additive receiver noise. A universally optimal architecture with a diagonal space-time layering is treated, as is an architecture with horizontal space-time layering and an architecture with a single outer code. Some capacity asymptotes for large numbers of antennas are also included. Some results for frequency selective channels are presented: It is only necessary to feedback M rates, one per transmit antenna, to attain capacity. Also, capacity of an (M,N) link is, in a certain sense, invariant with respect to signaling format.