Optimal generalized inverses for zero forcing precoding

Ami Wiesel*, Yonina C. Eldar, Shlomo Shamai

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

We consider the problem of linear zero forcing precoding design, and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is given to a specific generalized inverse known as the pseudo-inverse. We begin with the standard design under the assumption of a total power constraint and prove that precoders based on the pseudo-inverse are optimal in this setting. Then, we proceed to examine individual per-antenna power constraints. In this case, the pseudo-inverse is not necessarily the optimal generalized inverse. In fact, finding the optimal inverse is non-trivial and depends on the specific performance measure. We address two common criteria, fairness and throughput, and show that the optimal matrices may be found using standard convex optimization methods. We demonstrate the improved performance offered by our approach using computer simulations.

Original languageAmerican English
Title of host publicationForty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings
Pages130-134
Number of pages5
DOIs
StatePublished - 2007
Externally publishedYes
Event41st Annual Conference on Information Sciences and Systems, CISS 2007 - Baltimore, MD, United States
Duration: 14 Mar 200716 Mar 2007

Publication series

NameForty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings

Conference

Conference41st Annual Conference on Information Sciences and Systems, CISS 2007
Country/TerritoryUnited States
CityBaltimore, MD
Period14/03/0716/03/07

Fingerprint

Dive into the research topics of 'Optimal generalized inverses for zero forcing precoding'. Together they form a unique fingerprint.

Cite this