Quick search Find article
Quick search
Find article

A quadratic programming problem arising from vector precoding in wireless communications

R R Müller1, D Guo2 and A L Moustakas3

Show affiliations


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.


PACS

84.40.Ua Telecommunications: signal transmission and processing; communication satellites

84.40.Ba Antennas: theory, components and accessories

Subjects

Electronics and devices

Dates

Issue 1 (2008)



Related review articles

What's this?
View review articles related to this research to gain an insight into the key trends in this subject area. Related review articles are selected based on PACS/MSC codes, and are no more than three years old.

  1. Nanoantennas for visible and infrared radiation
  2. The physics and applications of superconducting metamaterials
  3. Problems in synthetic-aperture radar imaging

View by subject




Export






Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.