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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Universitat Pompeu Fabra |
| Repositorio: | Repositorio Digital de la UPF |
| OAI Identifier: | oai:repositori.upf.edu:10230/20431 |
| Acceso en línea: | http://hdl.handle.net/10230/20431 http://dx.doi.org/10.1109/TIT.2008.2009817 |
| Access Level: | acceso abierto |
| Palabra clave: | Comunicació sense fil, Sistemes de Sistemes MIMO Alamouti code Decoding complexity Multiple-input multiple-output (MIMO) Quasi-orthogonal space-time block codes (STBCs) Sphere decoder |
| Sumario: | 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. |
|---|