The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Optimal Two-Dimensional Lattices for Precoding of Linear Channels

På svenska

Author

Summary, in English

Consider the communication system model y = HFx+n, where H and F are the channel and precoder matrices, x is a vector of data symbols drawn from some lattice-type constellation, such as M-QAM, n is an additive white Gaussian noise vector and y is the received vector. It is assumed that both the transmitter and the receiver have perfect knowledge of the channel matrix H and that the transmitted signal Fx is subject to an average energy constraint. The columns of the matrix HF can be viewed as the basis vectors that span a lattice, and we are interested in the precoder F that maximizes the minimum distance of this lattice. This particular problem remains open within the theory of lattices and the communication theory. This paper provides the complete solution for any non-singular M x 2 channel matrix H. For real-valued matrices and vectors, the solution is that HF spans the hexagonal lattice. For complex-valued matrices and vectors, the solution is that HF, when viewed in four-dimensional real-valued space, spans the Schlafli lattice D-4.

Publishing year

2013

Language

English

Pages

2104-2113

Publication/Series

IEEE Transactions on Wireless Communications

Volume

12

Issue

5

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Two-dimensional lattices
  • precoding
  • linear channel

Status

Published

ISBN/ISSN/Other

  • ISSN: 1536-1276