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.

Design of close to optimal Euclidean distance MIMO-precoders

Author

Summary, in English

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.

Publishing year

2009

Language

English

Pages

1268-1272

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory (ISIT), 2009

Conference date

2009-06-28 - 2009-07-03

Conference place

Seoul, Korea, Democratic People's Republic of

Status

Published

Research group

  • Telecommunication Theory