Single-symbol ML decodable distributed STBCs for partially-coherent cooperative networks
IEEE Transactions on Wireless Communications
High-rate, single-symbol ML decodable precoded DSTBCs for cooperative networks
IEEE Transactions on Information Theory
High-rate, multisymbol-decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
Optimal and robust distributed channel co-phasing for cooperative parallel-relay networks
RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
STBCs with reduced sphere decoding complexity for two-user MIMO-MAC
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Shift-orthogonal space-time block codes
IEEE Transactions on Communications
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
Distributed space-time block code over mixed rayleigh and rician frequency-selective fading channels
EURASIP Journal on Wireless Communications and Networking
Novel precoded relay-assisted algorithm for cellular systems
EURASIP Journal on Wireless Communications and Networking
Hi-index | 755.02 |
In this correspondence, the distributed orthogonal space-time block codes (DOSTBCs), which achieve the single-symbol maximum likelihood (ML) decodability and full diversity order, are first considered. However, systematic construction of the DOSTBCs is very hard, since the noise covariance matrix is not diagonal in general. Thus, some special DOSTBCs, which have diagonal noise covariance matrices at the destination terminal, are investigated. These codes are referred to as the row-monomial DOSTBCs. An upper bound of the data-rate of the row-monomial DOSTBC is derived and it is approximately twice higher than that of the repetition-based cooperative strategy. Furthermore, systematic construction methods of the row-monomial DOSTBCs achieving the upper bound of the data-rate are developed when the number of relays and/or the number of information-bearing symbols are even.