WLC16-3: Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes

Abstract

ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have recently shown that a refined version of ABBA codes admit pair-wise real-symbol decoding, i.e. with minimum decoding complexity (MDC) achievable by non-orthogonal STBC. In this paper, we derive the exact symbol pair-wise error probability and the union bound on the symbol error rate (SER). The union bound is only 0.1 dB from the simulated SER at medium or high SNR < 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-2</sup> . Thus, by minimizing the SER union bound, we can find the optimal signal designs for any constellation with an arbitrary geometrical shape. Furthermore, we propose a new method combining signal rotation and power allocation for inphase-quadrature power-unbalanced constellations such as rectangular QAM. Our new optimal signal designs perform better than the existing ones and offer lower encoding/decoding complexities.