Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity

Elia, Petros;Jalden, Joakim
ALLERTON 2008, 46th Allerton Conference on Communication, Control and Computing, September 23-26, 2008, Monticello, USA

×nr MIMO channel, all known n×T ap-

 

= 2;nr = 1, draw from lattices ofr. Motivated by the case where nr < n,

dimension equal to or larger than nT, irrespec-

tive of n

the work describes construction criteria for lattice

codes that maintain their approximate universality

even when they are drawn from lattices of reduced

dimensionality.

 

This work presents new eigenvalue bounds, neces-

sary conditions and existence results for approxi-

mately universal linear (lattice) codes that can be

drawn from lattices of reduced dimension, and can

thus incur reduced decoding complexity. Currently

for the n

proximately universal codes, except for the Alam-

outi code for n

 

 

 

 


DOI
Type:
Conférence
City:
Monticello
Date:
2008-09-23
Department:
Systèmes de Communication
Eurecom Ref:
2934
Copyright:
© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:

PERMALINK : https://www.eurecom.fr/publication/2934