Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1202.0445 (cs)
[Submitted on 2 Feb 2012]

Title:Iterative Mode-Dropping for the Sum Capacity of MIMO-MAC with Per-Antenna Power Constraint

Authors:Yang Zhu, Mai Vu
View PDF
Abstract:We propose an iterative mode-dropping algorithm that optimizes input signals to achieve the sum capacity of the MIMO-MAC with per-antenna power constraint. The algorithm successively optimizes each user's input covariance matrix by applying mode-dropping to the equivalent single-user MIMO rate maximization problem. Both analysis and simulation show fast convergence. We then use the algorithm to briefly highlight the difference in MIMO-MAC capacities under sum and per-antenna power constraints.
Comments: 6 pages double-column, 5 figures
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1202.0445 [cs.IT]
  (or arXiv:1202.0445v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1202.0445

Submission history

From: Yang Zhu [view email]
[v1] Thu, 2 Feb 2012 14:39:29 UTC (848 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2012-02
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Yang Zhu
Mai Vu
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)