Multigroup decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
IEEE Transactions on Information Theory
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
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
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
On the nonexistence of rate-one generalized complex orthogonal designs
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks
IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
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
Novel precoded relay-assisted algorithm for cellular systems
EURASIP Journal on Wireless Communications and Networking
Hi-index | 754.90 |
Distributed orthogonal space-time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by Yi and Kim for cooperative networks, and an upper bound on the maximal rate of such codes along with code constructions has been presented. In this paper, a new class of single-symbol ML decodable precoded distributed space-time block codes (SSD-PDSTBCs) called semiorthogonal SSD-PDSTBCs (semi-SSD-PDSTBCs) is introduced wherein, the source performs linear precoding of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of semi-SSD-PDSTBCs. A special class of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of semi-SSD-PDSTBCs is presented when the number of relays K ≤ 4. The constructed codes are shown to achieve the upper bound on the rate when K is of the form 0 or 3 modulo 4. For the rest of the values of K, the constructed codes are shown to have rates higher than that of DOSTBCs. It is shown that semi-SSD-PDSTBCs cannot be constructed with any form of linear processing at the relays when the source does not perform linear precoding of the information symbols.