Reference : Optimal Two-Dimensional Lattices for Precoding of Linear Channels
Scientific journals : Article
Engineering, computing & technology : Electrical & electronics engineering
Optimal Two-Dimensional Lattices for Precoding of Linear Channels
Kapetanovic, Dzevdan mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Cheng, Hei Victor []
Mow, Wai Ho []
Rusek, Fredrik []
IEEE Transactions on Wireless Communications
Institute of Electrical and Electronics Engineers
Yes (verified by ORBilu)
New York
[en] MIMO ; Precoding ; Lattices
[en] 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 nonsingular
M ×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 D4.
The work of the first and the fourth author were supported by the Swedish Foundation for Strategic Research through its Center for High Speed Wireless Communication at Lund University, Sweden.

File(s) associated to this reference

Fulltext file(s):

Open access
TW-Mar-12-0452.pdfAuthor preprint344.45 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.