2008/09/19 by Laura Luzzi, Luzzi, Laura, Ghaya Rekaya-Ben Othman +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.0809.3365
openalex publication_date 2008/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.