20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Coordinated Beamforming with Relaxed Zero Forcing: The Sequential Orthogonal Projection Combining Method and Rate Control

      Preprint
      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In this paper, coordinated beamforming based on relaxed zero forcing (RZF) for K transmitter-receiver pair multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) interference channels is considered. In the RZF coordinated beamforming, conventional zero-forcing interference leakage constraints are relaxed so that some predetermined interference leakage to undesired receivers is allowed in order to increase the beam design space for larger rates than those of the zero-forcing (ZF) scheme or to make beam design feasible when ZF is impossible. In the MISO case, it is shown that the rate-maximizing beam vector under the RZF framework for a given set of interference leakage levels can be obtained by sequential orthogonal projection combining (SOPC). Based on this, exact and approximate closed-form solutions are provided in two-user and three-user cases, respectively, and an efficient beam design algorithm for RZF coordinated beamforming is provided in general cases. Furthermore, the rate control problem under the RZF framework is considered. A centralized approach and a distributed heuristic approach are proposed to control the position of the designed rate-tuple in the achievable rate region. Finally, the RZF framework is extended to MIMO interference channels by deriving a new lower bound on the rate of each user.

          Related collections

          Author and article information

          Journal
          2012-03-08
          2012-10-02
          Article
          10.1109/TSP.2013.2258343
          1203.1758
          29093047-e1aa-41b0-b328-798ef9597c99

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          Lemma 1 proof corrected; a new SOPC algorithm invented; K > N case considered
          cs.IT math.IT

          Numerical methods,Information systems & theory
          Numerical methods, Information systems & theory

          Comments

          Comment on this article

          scite_
          0
          0
          0
          0
          Smart Citations
          0
          0
          0
          0
          Citing PublicationsSupportingMentioningContrasting
          View Citations

          See how this article has been cited at scite.ai

          scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.

          Similar content241

          Cited by4