On Fast-Decodable Space–Time Block Codes

DOI10.1109/TIT.2008.2009817MaRDI QIDQ4975716zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ezio Biglieri, Yi Hong, Emanuele Viterbo

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0708.2804

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Abstract: We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a unified analysis of two families of 2x2 STBCs that were recently proposed. In particular, we describe a reduced-complexity sphere decoding algorithm suitable for QAM signal constellations. Next, we derive a novel reduced-complexity 4x2 STBC, and show that it outperforms all previously known codes with certain constellations.

Cited in

(5)

• On fast-decodable algebraic space-time codes
• Constructions of fast-decodable distributed space-time codes
• FULL-RATE AND LOW-COMPLEXITY SPACE-TIME BLOCK CODING CONCATENATED WITH CHANNEL CODES
• How to obtain division algebras used for fast-decodable space-time block codes
• Physical layer network coding for wireless multi-way relaying with finite signal sets

This page was built for publication: On Fast-Decodable Space–Time Block Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975716)