Matrix analysis
Multi-Antenna Transceiver Techniques for 3g and Beyond
Multi-Antenna Transceiver Techniques for 3g and Beyond
On fast-decodable space-time block codes
IEEE Transactions on Information Theory
High-rate, single-symbol ML decodable precoded DSTBCs for cooperative networks
IEEE Transactions on Information Theory
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
IEEE Transactions on Information Theory
Cyclic distributed space-time codes for wireless relay networks with no channel information
IEEE Transactions on Information Theory
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
Four-Group Decodable Space–Time Block Codes
IEEE Transactions on Signal Processing
Quasi-orthogonal STBC with minimum decoding complexity
IEEE Transactions on Wireless Communications
Asynchronous cooperative diversity
IEEE Transactions on Wireless Communications
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
A distributed space-time coding in asynchronous wireless relay networks
IEEE Transactions on Wireless Communications - Part 2
IEEE Transactions on Wireless Communications - Part 2
Algebraic distributed differential space-time codes with low decoding complexity
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
New algebraic constructions of rotated Zn-lattice constellations for the Rayleigh fading channel
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Information-Lossless Space–Time Block Codes From Crossed-Product Algebras
IEEE Transactions on Information Theory
Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks
IEEE Transactions on Information Theory
Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
IEEE Journal on Selected Areas in Communications
Partially-coherent distributed space-time codes with differential encoder and decoder
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Wireless Communications
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory
Low complexity distributed STBCs with unitary relay matrices for any number of relays
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Cooperative transmission for wireless relay networks using limited feedback
IEEE Transactions on Signal Processing
Hi-index | 754.91 |
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is considered and the problem of constructing space-time block codes (STBCs) which optimally tradeoff rate and ML decoding complexity is posed. Recently, sufficient conditions for multigroup ML decodability have been provided in the literature and codes meeting these sufficient conditions were called Clifford unitary weight (CUW) STBCs. An algebraic framework based on extended Clifford algebras (ECAs) is proposed to study CUW STBCs and using this framework, the optimal tradeoff between rate and ML decoding complexity of CUW STBCs is obtained for few specific cases. Code constructions meeting this tradeoff optimally are also provided. The paper then focuses on multigroup ML decodable DSTBCs for application in synchronous wireless relay networks and three constructions of four-group ML decodable DSTBCs are provided. Finally, the orthogonal frequency-division multiplexing (OFDM)-based Alamouti space-time coded scheme proposed by Li-Xia for a 2-relay asynchronous relay network is extended to a more general transmission scheme that can achieve full asynchronous cooperative diversity for arbitrary number of relays. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Four-group decodable DSTBCs applicable in the proposed OFDM-based transmission scheme are also given.