A quadratic programming problem arising from vector precoding in wireless communications

Ralf R. Müller, Dongning Guo, Aris L. Moustakas

Research output: Contribution to journalArticlepeer-review

Abstract

A quadratic programming problem is studied in the limit of asymptotically large kernel matrices by means of the replica method. It is found that inverse Wishart kernels are - within the validity range of the replica symmetric solution - asymptotically invariant to Cartesian relaxations. In the context of vector precoding for wireless communication systems with dual antenna arrays, so-called MIMO systems, this implies that adding more transmit antennas cannot reduce the minimum required transmit energy per bit significantly. By contrast, a new convex relaxation is proposed and shown to be a practical and useful method.

Original languageEnglish (US)
Article number012006
JournalJournal of Physics: Conference Series
Volume95
Issue number1
DOIs
StatePublished - Jan 1 2008

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'A quadratic programming problem arising from vector precoding in wireless communications'. Together they form a unique fingerprint.

Cite this