[PDF][PDF] Visible-frequency metasurface for structuring and spatially multiplexing optical vortices

MQ Mehmood, S Mei, S Hussain, K Huang… - Adv …, 2016 - nanotechlab.itu.edu.pk
Recently, an intriguing 2D metamaterial, called the metasurface,[24] has gained attention
due to its ability to manipulate optical phase fronts. Instead of acquiring a desired phase …

Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback

J Zhang, P Elia - IEEE Transactions on Information Theory, 2017 - ieeexplore.ieee.org
Building on the recent coded-caching breakthrough by Maddah-Ali and Niesen, the work
here considers the K-user cache-aided wireless multi-antenna symmetric broadcast channel …

Fundamental limits of coded caching: Improved delivery rate-cache capacity tradeoff

MM Amiri, D Gündüz - IEEE Transactions on Communications, 2016 - ieeexplore.ieee.org
A centralized coded caching system, consisting of a server delivering N popular files, each
of size F bits, to K users through an error-free shared link, is considered. It is assumed that …

Noisy broadcast networks with receiver caching

SS Bidokhti, M Wigger, R Timo - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
An erasure broadcast network is considered with two disjoint sets of receivers: a set of weak
receivers with all-equal erasure probabilities and equal cache sizes and a set of strong …

Optimization of heterogeneous coded caching

AM Daniel, W Yu - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
This paper aims to provide an optimization framework for coded caching that accounts for
various heterogeneous aspects of practical systems. An optimization theoretic perspective …

Coded caching for a large number of users

MM Amiri, Q Yang, D Gündüz - 2016 IEEE Information Theory …, 2016 - ieeexplore.ieee.org
We consider the coded caching problem with a central server containing N files, each of
length F bits, and K users, each equipped with a cache of capacity MF bits. We assume that …

Decentralized caching and coded delivery with distinct cache capacities

MM Amiri, Q Yang, D Gündüz - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Decentralized proactive caching and coded delivery is studied in a content delivery network,
where each user is equipped with a cache memory, not necessarily of equal capacity …

Benefits of cache assignment on degraded broadcast channels

SS Bidokhti, M Wigger, A Yener - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated
with cache memories. Lower and upper bounds are derived on the capacity-memory …

Improved converses and gap results for coded caching

CY Wang, SS Bidokhti, M Wigger - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of
the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and …

Cache-aided content delivery over erasure broadcast channels

MM Amiri, D Gündüz - IEEE Transactions on Communications, 2017 - ieeexplore.ieee.org
A cache-aided broadcast network is studied, in which a server delivers contents to a group
of receivers over a packet erasure broadcast channel. The receivers are divided into two …