LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, NEW YORK: IEEE , 2009, 1263-1267 p.Conference paper (Refereed)
Currently for the n(T) x n(R) MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML) decoding, which may incur prohibitive decoding complexity. In this paper we prove that MMSE regularized lattice decoding, as well as the computationally efficient lattice reduction (LR) aided MMSE decoder, allows for efficient and DMT optimal decoding of any approximately universal lattice-based code. The result identifies for the first time an explicitly constructed encoder and a computationally efficient decoder that achieve DMT optimality for all multiplexing gains and all channel dimensions. The results hold irrespective of the fading statistics.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 1263-1267 p.
Other Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-34886DOI: 10.1109/ISIT.2009.5205961ISI: 000280141400257ScopusID: 2-s2.0-70449515667OAI: oai:DiVA.org:kth-34886DiVA: diva2:427877
IEEE International Symposium on Information Theory (ISIT 2009) Seoul, SOUTH KOREA, JUN 28-JUL 03, 2009
QC 201106292011-06-292011-06-172016-05-09Bibliographically approved