Du är här

Design of close to optimal Euclidean distance MIMO-precoders

Publiceringsår: 2009
Språk: Engelska
Sidor: 1268-1272
Dokumenttyp: Konferensbidrag


In this work we study the problem of constructing precoders for
spatially multiplexed multiple-input multiple output (MIMO) channels with close to
optimal minimum Euclidean distance. In order to exploit the full
potential of such designs, an ML detector must be used. Our design takes
the decoding complexity into account and constrain it to a
reasonable level. For our simplest case, the ML detector can be
implemented by a Viterbi algorithm operating on a state space of
size equal to the size of the modulation alphabet.
The design problem will be relaxed by using precoders $F$ such that $F^{ast}H^{ast}HF$ is a
cyclic Toeplitz matrix. Within this class of precoders, the optimal precoder can
be found via linear programming. Of uttermost practical importance
is the discovery that there only exist very few different effective
channels $HF$ even for large MIMO setups; thus, the optimization at the transmitter side reduces
into choosing the best precoder from a small list. Receiver tests will verify that
our method improves upon the currently best precoder designs.



  • Technology and Engineering


International Symposium on Information Theory (ISIT)
  • Telecommunication Theory

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen

LERU logo U21 logo