A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching

Cheng, Minquan; Wang, Jinyu; Zhong, Xi; Wang, Qiang

doi:10.1109/tit.2021.3112492

Cited by 27 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In essence, considering that the requested files in this study directly correlate with users' locations, and each location may have varying wireless connectivity, allocating different portions of memory to different files based on the approximated (statistical) throughput becomes imperative. This stands in contrast to conventional CC studies that typically allocate the same memory portion to all files (refer, for example, to [26]- [36]).…”

Section: System Modelmentioning

confidence: 93%

“…Interestingly, authors in [33] demonstrated that all the schemes in [19], [26]- [32] could also be presented as PDAs. Motivated by the generalized framework in [33], various PDA-based CC schemes were later proposed for different settings, aiming for reduced subpacketization [34]- [36]. CC methods can be divided into different categories by their core caching and transmission scheme designs, which are briefly reviewed in the following.…”

Section: Introductionmentioning

confidence: 99%

“…2) The near-far effect: Another crucial problem of conventional CC schemes is the near-far issue, which affects content delivery applications (e.g., [26]- [36]) in general and XR applications in particular. In CC schemes, a common multicast message is transmitted to serve several users at a time, and all these users must be able to decode the message simultaneously.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Low-Complexity Multi-Antenna Coded Caching Using Location-Aware Placement Delivery Arrays

Bakhshzad Mahmoodi,

Salehi,

Tölli

2024

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

A location-aware multi-antenna coded caching scheme is proposed for applications with location-dependent data requests, such as wireless immersive experience, where users are immersed in a three-dimensional virtual world. The wireless connectivity conditions vary as the users move within the application area motivating the use of a non-uniform cache memory allocation process to avoid excessive delivery time for users located in wireless bottleneck areas. To this end, a locationaware placement and delivery array (LAPDA) is designed for cache-aided multiantenna data delivery with a fast converging, iterative linear beamforming process. The underlying weighted max-min transmit precoder design enables the proposed scheme to serve users in poor connectivity areas with smaller amounts of data while simultaneously delivering larger amounts to other users. Our new scheme is suitable for large networks due to its linear transceiver structure and it is not constrained by the number of users, cache size, or the number of antennas at the transmitter, unlike the existing schemes. Despite non-uniform cache placement, the proposed scheme still achieves a significant degree of coded caching gain that is additive to the multiplexing gain and greatly outperforms the conventional symmetric CC schemes in terms of both average and 95-percentile delivery time.

show abstract

Section: System Modelmentioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-Complexity Multi-Antenna Coded Caching Using Location-Aware Placement Delivery Arrays

Bakhshzad Mahmoodi,

Salehi,

Tölli

2024

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…In order to design a scheme with low subpacketization for the combination network caching system, the authors in [12] proposed the concept of combinatorial placement delivery array (CPDA) based on PDA which has been widely studied in [13,14]. When r divides H (denoted by r|H), based on the MN scheme, they proposed a scheme with lower subpacketization while the achieved transmission load for each relay is equal to that of the scheme in [5].…”

Section: Traditional Combination Network Caching Systemmentioning

confidence: 99%

Coded Caching for Combination Networks with Multiaccess

et al. 2022

Self Cite

View full text Add to dashboard Cite

In a traditional (H,r) combination network, each user connects to a unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess combination network problem wherein each unique set of r relays is connected by u users. In this paper, we focus on designing coded caching schemes for a (H,r,u) multiaccess combination network. By directly applying the well-known coding method (proposed by Zewail and Yener) for a (H,r) combination network, a coded caching scheme (called ZY scheme) for (H,r,u) multiaccess combination network is obtained. However, its subpacketization has an exponential order with the number of users which leads to high implementation complexity. In order to reduce subpacketization, a direct construction of a coded caching scheme (called the direct scheme) for (H,r,u) multiaccess combination network is proposed by means of combinational design theory, where the parameter u must be a combinatorial number. For the arbitrary parameter u, the hybrid construction of a coded caching scheme (called the hybrid scheme) for the (H,r,u) multiaccess combination network is proposed based on the direct scheme. Theoretical and numerical analysis shows that the direct scheme and the hybrid scheme have a smaller transmission load for each relay compared with the naive scheme (which is obtained by repeatedly applying the coded caching scheme for a traditional (H,r) combination network by u times) and have much lower subpacketization compared with the ZY scheme.

show abstract