4.7 Article

Multi-Antenna Coded Caching From a Placement Delivery Array for Shared Caches

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching

Minquan Cheng et al.

Summary: The text presents a framework for constructing coded caching schemes, with the use of orthogonal arrays leading to more efficient solutions with lower transmission load and decreased implementation complexity.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

Article Telecommunications

Decentralized Coded Caching for Shared Caches

Monolina Dutta et al.

Summary: This study focuses on addressing network congestion caused by temporal variance in client demands in the client-server framework, and proposes a decentralized shared caching scheme. The proposed scheme, utilizing index coding techniques, is shown to be optimal among all linear schemes, achieving a comparable rate to existing centralized prefetching schemes.

IEEE COMMUNICATIONS LETTERS (2021)

Proceedings Paper Telecommunications

Coded Caching with Shared Caches from Generalized Placement Delivery Arrays

Elizabath Peter et al.

Summary: In this study, the coded caching problem with shared caches was considered, and a new coding scheme using the placement delivery arrays (PDAs) framework was proposed to reduce the sub-packetization requirements for shared caches. This approach enables the transformation of existing PDA structures into coded caching schemes with lower sub-packetization, ultimately leading to more efficient network performance. Additionally, it was demonstrated that the optimal scheme proposed by Parrinello, Unsal, and Elia could be recovered using a Maddah-Ali Niesen PDA.

2021 IEEE 32ND ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC) (2021)

Proceedings Paper Computer Science, Theory & Methods

Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs

Shanuja Sasi et al.

Summary: In this paper, we discussed the multi-access coded caching problem and proposed a deterministic scheme based on the concept of PDA, constructing new PDAs to specify the delivery scheme. The proposed scheme has advantages in terms of coding gain and sub-packetization level.

2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2021)

Article Engineering, Electrical & Electronic

Some Variant of Known Coded Caching Schemes With Good Performance

Minquan Cheng et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2020)

Article Computer Science, Information Systems

Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching

Emanuele Parrinello et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2020)

Article Telecommunications

Placement Delivery Array Based on Concatenating Construction

Xi Zhong et al.

IEEE COMMUNICATIONS LETTERS (2020)

Article Engineering, Electrical & Electronic

Placement Delivery Arrays From Combinations of Strong Edge Colorings

Jerod Michel et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2020)

Proceedings Paper Computer Science, Theory & Methods

Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches

Emanuele Parrinello et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

Article Computer Science, Information Systems

Improving Placement Delivery Array Coded Caching Schemes With Coded Placement

Zhang Mingming et al.

IEEE ACCESS (2020)

Article Engineering, Electrical & Electronic

Efficient File Delivery for Coded Prefetching in Shared Cache Networks With Multiple Requests Per User

Haisheng Xu et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2019)

Article Engineering, Electrical & Electronic

A Generalized Grouping Scheme in Coded Caching

Minquan Cheng et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2019)

Article Engineering, Electrical & Electronic

Constructions of Coded Caching Schemes With Flexible Memory Size

Minquan Cheng et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2019)

Proceedings Paper Computer Science, Information Systems

An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches

Nujoom Sageer Karat et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Article Telecommunications

Placement Delivery Array Design Through Strong Edge Coloring of Bipartite Graphs

Qifa Yan et al.

IEEE COMMUNICATIONS LETTERS (2018)

Article Engineering, Electrical & Electronic

Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File Sizes

Eleftherios Lampiris et al.

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2018)

Article Computer Science, Information Systems

The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching

Qian Yu et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2018)

Article Computer Science, Information Systems

Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes

Li Tang et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2018)

Article Computer Science, Information Systems

Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach

Chong Shangguan et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2018)

Article Computer Science, Information Systems

On the Placement Delivery Array Design for Centralized Coded Caching Scheme

Qifa Yan et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2017)

Article Computer Science, Information Systems

Finite-Length Analysis of Caching-Aided Coded Multicasting

Karthikeyan Shanmugam et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2016)

Article Computer Science, Hardware & Architecture

Online Coded Caching

Ramtin Pedarsani et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2016)

Article Computer Science, Hardware & Architecture

Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff

Mohammad Ali Maddah-Ali et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2015)

Article Computer Science, Information Systems

Fundamental Limits of Caching

Mohammad Ali Maddah-Ali et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2014)