Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity
2008 (English)In: 2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, NEW YORK: IEEE , 2008, 1359-1364 p.Conference paper (Refereed)
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 x n(r) MIMO channel, all known n x T approximately universal codes, except for the Alamouti code for n = 2, n(r) = 1, draw from lattices of dimension equal to or larger than nT, irrespective of n(r). Motivated by the case where n(r) < n, the work describes construction criteria for lattice codes that maintain their approximate universality even when they are drawn from lattices of reduced dimensionality.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2008. 1359-1364 p.
IdentifiersURN: urn:nbn:se:kth:diva-34898DOI: 10.1109/ALLERTON.2008.4797719ISI: 000268229600193OAI: oai:DiVA.org:kth-34898DiVA: diva2:427961
46th Annual Allerton Conference on Communication, Control and Computing Monticello, IL, SEP, 2008
QC 201106292011-06-292011-06-172011-06-29Bibliographically approved