Optimal Lattices for MIMO Precoding

Summary, in English

Consider the communication model (y) over bar = H F (x) over bar + (n) over bar, where H; F are real-valued matrices, (x) over bar is a data vector drawn from some real-valued lattice (e.g. M-PAM), (n) over bar is additive white Gaussian noise and (y) over bar is the received vector. It is assumed that the transmitter and the receiver have perfect knowledge of the channel matrix H (perfect CSI) and that the transmitted signal F (x) over bar is subject to an average energy constraint. The columns of the matrix H F can be viewed as basis vectors that span a lattice, and we are interested in the minimum distance of this lattice. More precisely, for a given H, which F under an average energy constraint will maximize the minimum distance of the lattice H F ? This particular question remains open within the theory of lattices. This work provides the solution for 2 x 2 matrices H; F. The answer is an F such that H F is a hexagonal lattice.

• Author: Dzevdan Kapetanovic; Hei Victor Cheng; Wai Ho Mow; Fredrik Rusek
• Department/s: Department of Electrical and Information Technology; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publishing year: 2011
• Language: English
• Pages: 2924-2928
• Publication/Series: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT)
• Links: http://dx.doi.org/10.1109/ISIT.2011.6034112
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE International Symposium on Information Theory, 2011
• Conference date: 2011-07-31 - 2011-08-05
• Conference place: Saint Petersburg, Russian Federation
• Status: Published
• ISBN/ISSN/Other: ISBN: 978-1-4577-0595-3