Title :
Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity
Author :
Elia, Petros ; Jalden, Joakim
Author_Institution :
Dept. of Mobile Commun., EURECOM, Sophia Antipolis
Abstract :
This work presents new eigenvalue bounds, necessary conditions and existence results for approximately universal linear (lattice) codes that can be drawn from lattices of reduced dimension, and can thus incur reduced decoding complexity. Currently for the n times nr MIMO channel, all known n times T approximately universal codes, except for the Alamouti code for n = 2,nr = 1, draw from lattices of dimension equal to or larger than nT, irrespective of nr. Motivated by the case where nr < n, the work describes construction criteria for lattice codes that maintain their approximate universality even when they are drawn from lattices of reduced dimensionality.
Keywords :
MIMO communication; approximation theory; communication complexity; linear codes; space-time codes; wireless channels; MIMO channel; construction criteria; eigenvalue bounds; lattice codes; reduced decoding complexity; universal linear space-time codes; Decoding; Eigenvalues and eigenfunctions; Fading; Lattices; Linear approximation; MIMO; Mobile communication; OFDM modulation; Space time codes; Symmetric matrices;
Conference_Titel :
Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Conference_Location :
Urbana-Champaign, IL
Print_ISBN :
978-1-4244-2925-7
Electronic_ISBN :
978-1-4244-2926-4
DOI :
10.1109/ALLERTON.2008.4797719