Advanced

Design of close to optimal Euclidean distance MIMO-precoders

Rusek, Fredrik LU and Kapetanovic, Dzevdan LU (2009) IEEE International Symposium on Information Theory (ISIT), 2009 p.1268-1272
Abstract
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to conference
publication status
published
subject
pages
1268 - 1272
conference name
IEEE International Symposium on Information Theory (ISIT), 2009
external identifiers
  • WOS:000280141400258
  • Scopus:70449515467
language
English
LU publication?
yes
id
0434be66-9f1b-4484-ba0d-ade8ed4ea8b7 (old id 1277702)
date added to LUP
2009-01-14 09:47:07
date last changed
2016-10-13 04:57:46
@misc{0434be66-9f1b-4484-ba0d-ade8ed4ea8b7,
  abstract     = {In this work we study the problem of constructing precoders for<br/><br>
 spatially multiplexed multiple-input multiple output (MIMO) channels with close to<br/><br>
 optimal minimum Euclidean distance. In order to exploit the full<br/><br>
 potential of such designs, an ML detector must be used. Our design takes<br/><br>
 the decoding complexity into account and constrain it to a<br/><br>
 reasonable level. For our simplest case, the ML detector can be<br/><br>
 implemented by a Viterbi algorithm operating on a state space of <br/><br>
 size equal to the size of the modulation alphabet.<br/><br>
 The design problem will be relaxed by using precoders $F$ such that $F^{ast}H^{ast}HF$ is a<br/><br>
 cyclic Toeplitz matrix. Within this class of precoders, the optimal precoder can<br/><br>
 be found via linear programming. Of uttermost practical importance<br/><br>
 is the discovery that there only exist very few different effective<br/><br>
 channels $HF$ even for large MIMO setups; thus, the optimization at the transmitter side reduces<br/><br>
 into choosing the best precoder from a small list. Receiver tests will verify that<br/><br>
 our method improves upon the currently best precoder designs.},
  author       = {Rusek, Fredrik and Kapetanovic, Dzevdan},
  language     = {eng},
  pages        = {1268--1272},
  title        = {Design of close to optimal Euclidean distance MIMO-precoders},
  year         = {2009},
}