Low ML Decoding Complexity STBCs via Codes Over the Klein Group
Lakshmi Prasad Natarajan, Balaji Sundar Rajan · IEEE Transactions on Information Theory · 2011
In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein groupK. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes overK, for number of transmit antennasN=2m,m≥ 1, and ratesR>; 1 complex symbols per channel use. WhenR=N, the new STBCs are information-lossless as well. The new class of STBCs have the least known ML decoding complexity among all the codes available in the literature for a large set of (N,R) pairs.