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:1506.04583 (cs)
[Submitted on 15 Jun 2015 (v1), last revised 16 Jun 2015 (this version, v2)]

Title:On the Benefits of Edge Caching for MIMO Interference Alignment

Authors:Matha Deghel, Ejder Baştuğ, Mohamad Assaad, Merouane Debbah
View PDF
Abstract:In this contribution, we jointly investigate the benefits of caching and interference alignment (IA) in multiple-input multiple-output (MIMO) interference channel under limited backhaul capacity. In particular, total average transmission rate is derived as a function of various system parameters such as backhaul link capacity, cache size, number of active transmitter-receiver pairs as well as the quantization bits for channel state information (CSI). Given the fact that base stations are equipped both with caching and IA capabilities and have knowledge of content popularity profile, we then characterize an operational regime where the caching is beneficial. Subsequently, we find the optimal number of transmitter-receiver pairs that maximizes the total average transmission rate. When the popularity profile of requested contents falls into the operational regime, it turns out that caching substantially improves the throughput as it mitigates the backhaul usage and allows IA methods to take benefit of such limited backhaul.
Comments: 20 pages, 5 figures. A shorter version is to be presented at 16th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC'2015), Stockholm, Sweden
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1506.04583 [cs.IT]
  (or arXiv:1506.04583v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1506.04583
Related DOI: https://doi.org/10.1109/SPAWC.2015.7227119

Submission history

From: Ejder Baştuğ [view email]
[v1] Mon, 15 Jun 2015 13:07:32 UTC (106 KB)
[v2] Tue, 16 Jun 2015 13:53:48 UTC (106 KB)
Full-text links:

Access Paper:

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

References & Citations

DBLP - CS Bibliography

listing | bibtex
Matha Deghel
Ejder Bastug
Mohamad Assaad
Mérouane Debbah
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?)