On the relation of OSTBC and code rate one QSTBC
Average rate, BER, and coding gain
 IEEE transactions on signal processing 56 (2008), No.10, pp.48794891 ISSN: 00963518 ISSN: 00189278 ISSN: 00961620 ISSN: 1053587X 

 English 
 Journal Article 
 Fraunhofer HHI () 
Abstract
Recently, the statistical properties of the equivalent channel representation of a multipleinputmultiple output (MIMO) system employing code rate one quasiorthogonal spacetime block codes (QSTBC), which are constructed by using orthogonal spacetime block codes (OSTBC) as building elements, was characterized. Based on these characterizations we analyze the average rate (or mean mutual information), the biterrorrate performance, and the coding gain achieved with QSTBC for any number of receive and n(T) = 2(n), n >= 2 transmit antennas. First, we study constellation rotation using a systematic approach in order to maximize the coding gain and to achieve full diversity QSTBC. Moreover, we present an upper bound on the coding gain. We derive a lower and upper bound on the BERperformance for QSTBC. Furthermore, we analyze the average rate achievable with QSTBC in case of an uninformed transmitter and also the case, in which the transmitter knows the mean channel matrix whereas the receiver has perfect CSI. Along with the analysis, we compare all the results of these performance measures with the results achieved with OSTBC, revealing important connections between OSTBC and QSTBC. For example, the coding gain of a QSTBC is upper bounded by the coding gain of the underlying OSTBC. Also, the BER of a QSTBC for n(T),T transmit and n(R) receive antennas is tightly lower bounded by the BER of a fulldiversity providing intersymbolinterference free system. In addition to that, we show that gains in terms of average rate by using a QSTBC (and, thus, with higher n(T)) instead of the underlying OSTBC are only attainable, if the available channel state information at the transmitter (CSIT) is utilized. Finally, we illustrate our theoretical results using numerical simulations.