Müller R, Guo D, Moustakas AL (2008)
Publication Status: Published
Publication Type: Journal article, Original article
Publication year: 2008
Publisher: Institute of Physics: Open Access Journals / Institute of Physics (IoP)
Book Volume: 95
Article Number: 012006
Journal Issue: 1
DOI: 10.1088/1742-6596/95/1/012006
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. © 2008 IOP Publishing Ltd.
APA:
Müller, R., Guo, D., & Moustakas, A.L. (2008). A quadratic programming problem arising from vector precoding in wireless communications. Journal of Physics : Conference Series, 95(1). https://dx.doi.org/10.1088/1742-6596/95/1/012006
MLA:
Müller, Ralf, Dongning Guo, and Aris L. Moustakas. "A quadratic programming problem arising from vector precoding in wireless communications." Journal of Physics : Conference Series 95.1 (2008).
BibTeX: Download