Single-symbol ML decodable distributed STBCs for partially-coherent cooperative networks
IEEE Transactions on Wireless Communications
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
High-rate, multisymbol-decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
New space and time coding with high performance and very low peak to average power ratio
WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
A fast-decodable code structure for linear dispersion codes
IEEE Transactions on Wireless Communications
Embedded orthogonal space-time codes for high rate and low decoding complexity
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Achieving space and time diversity by using lattice constellation based joint alamouti coding
IEEE Communications Letters
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
Single-Symbol Maximum Likelihood Decodable STBCs with Fewer Zero-Entries
Wireless Personal Communications: An International Journal
| Hi-index | 35.86 |
Two new rate-one full-diversity space-time block codes (STBCs) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pairwise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.