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:1807.07196 (cs)
[Submitted on 19 Jul 2018]

Title:Achievable Rate maximization by Passive Intelligent Mirrors

Authors:Chongwen Huang, Alessio Zappone, Mérouane Debbah, Chau Yuen
View PDF
Abstract:This paper investigates the use of a Passive Intelligent Mirrors (PIM) to operate a multi-user MISO downlink communication. The transmit powers and the mirror reflection coefficients are designed for sum-rate maximization subject to individual QoS guarantees to the mobile users. The resulting problem is non-convex, and is tackled by combining alternating maximization with the majorization-minimization method. Numerical results show the merits of the proposed approach, and in particular that the use of PIM increases the system throughput by at least $40\%$, without requiring any additional energy consumption.
Comments: 5-pages, Be accepted by the ICASSP 2018
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1807.07196 [cs.IT]
  (or arXiv:1807.07196v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1807.07196

Submission history

From: Chongwen Huang [view email]
[v1] Thu, 19 Jul 2018 00:34:47 UTC (3,286 KB)
Full-text links:

Access Paper:

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

References & Citations

DBLP - CS Bibliography

listing | bibtex
Chongwen Huang
Alessio Zappone
Mérouane Debbah
Chau Yuen
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?)