On Fast-Decodable Space-Time Block Codes

Ezio Biglieri, Yi Hong, Emanuele Viterbo
2008 2008 IEEE International Zurich Seminar on Communications  
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2 2 2 and 4 2 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 2 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 2 2 STBC, and show that it outperforms all previously known codes with certain constellations. Index Terms-Alamouti code,
more » ... ecoding complexity, multiple-input multiple-output (MIMO), quasi-orthogonal space-time block codes (STBCs), sphere decoder.
doi:10.1109/izs.2008.4497289 fatcat:djfhfr64xngjzncalsoreamufq