On Fast-Decodable Space-Time Block Codes

Simple item page
dc.creatorBiglieri, Ezio
dc.creatorHong, Yi
dc.creatorViterbo, Emanuele
dc.date2007-08-21
dc.date2008-03-18
dc.date.accessioned2026-07-07T09:26:58Z
dc.date.available2026-07-07T09:26:58Z
dc.descriptionWe 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.
dc.descriptionsubmitted to IEEE trans IT
dc.identifierhttps://arxiv.org/abs/0708.2804
dc.identifierhttp://arxiv.org/abs/0708.2804
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156940
dc.subjectInformation Theory
dc.subjectE.4; H.1.1
dc.titleOn Fast-Decodable Space-Time Block Codes
dc.typetext

Files

Collections

arXiv