Algebraic reduction for the golden code

From MaRDI portal
Publication:414943

DOI10.3934/AMC.2012.6.1zbMATH Open1278.94093arXiv0809.3365OpenAlexW2074275457MaRDI QIDQ414943FDOQ414943


Authors: Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore Edit this on Wikidata


Publication date: 11 May 2012

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: 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 3dB with respect to ML decoding.


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




Recommendations





Cited In (3)





This page was built for publication: Algebraic reduction for the golden code

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