On Fast-Decodable Space-Time Block Codes
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 x 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.
multiple-input multiple-output (mimo) alamouti code decoding complexity quasi-orthogonal space-time block codes (stbcs) sphere decoder