On fast-decodable space-time block codes

  • Authors:
  • Ezio Biglieri;Yi Hong;Emanuele Viterbo

  • Affiliations:
  • Departament de Tecnologies de la Informació i les Comunicacions, Universitat Pompeu Fabra, Barcelona, Spain;Institute of Advanced Telecom., University of Wales, Swansea, Singleton Park, UK;DEIS, Università della Calabria, Rende, CS, Italy

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 755.08

Visualization

Abstract

We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2×2 and 4×2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 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 STBC, and show that it outperforms all previously known codes with certain constellations.