Algebraic reduction for space-time codes based on quaternion algebras
| dc.creator | Luzzi, Laura | |
| dc.creator | Othman, Ghaya Rekaya-Ben | |
| dc.creator | Belfiore, Jean-Claude | |
| dc.date | 2008-09-19 | |
| dc.date | 2008-09-30 | |
| dc.date.accessioned | 2026-07-07T10:05:57Z | |
| dc.date.available | 2026-07-07T10:05:57Z | |
| dc.description | In this paper we introduce a new right preprocessing method for the decoding of 2x2 algebraic STBCs, called algebraic reduction, which exploits the multiplicative structure of the code. The principle of the new reduction is to absorb part of the channel into the code, by approximating the channel matrix with an element of the maximal order of the algebra. We prove that algebraic reduction attains the receive diversity when followed by a simple ZF detection. Simulation results for the Golden Code show that using MMSE-GDFE left preprocessing, algebraic reduction with simple ZF detection has a loss of only $3 \dB$ with respect to ML decoding. | |
| dc.description | 29 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/0809.3365 | |
| dc.identifier | http://arxiv.org/abs/0809.3365 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170168 | |
| dc.subject | Information Theory | |
| dc.title | Algebraic reduction for space-time codes based on quaternion algebras | |
| dc.type | text |