Low ML Decoding Complexity STBCs via Codes over GF(4)

arXiv1008.2526MaRDI QIDQ6220209

Author name not available (Why is that?)

Publication date: 15 August 2010

Abstract: In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field

m a t h b b F_{4}

. 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 over

m a t h b b F_{4}

, for number of transmit antennas mbox{

N = 2^{m}

}, mbox{

m g e q 1

}, and rates mbox{

R > 1

} complex symbols per channel use. When mbox{

R = 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 mbox{

(N, R)

} pairs.

This page was built for publication: Low ML Decoding Complexity STBCs via Codes over GF(4)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6220209)