Elizabath Peter

Elizabath Peter

Auto-generated profile, based on publicly available information

Elizabath Peter

Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru, India

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KNK. K. Krishnan Namboodiri
K. K. Krishnan Namboodiri
EPElizabath Peter
Elizabath Peter
BRBalaji Sundar Rajan
Balaji Sundar Rajan
This work addresses the multi-antenna coded caching problem where a server with L transmit antennas communicates to K users through a wireless broadcast link. In the problem setting, the server has a library of N files, and each user is equipped with a dedicated cache of capacity M . A novel solution for the multi-antenna coded caching problem is obtained by designing a combinatorial structure called an extended placement delivery array (EPDA). It is shown that the placement delivery arrays known for the centralized coded caching scheme are a special class of EPDAs with L = 1. Furthermore, three constructions of EPDAs are proposed for the settings: a) K = t + L , b) K = nt + ( n - 1) L ; L ≥ t, n ≥ 2, and c) K, L, t such that t + L ≤ K , where t = KM/N is an integer. The multi-antenna schemes resulting from the first two constructions achieve the optimal degrees of freedom (DoF) t + L with a subpacketization number -the number of subfiles into which a file is divided- K /gcd( K, t,L ), which is lower than the subpacketization number of the existing schemes. The scheme obtained from the third construction also achieves the optimal DoF with a subpacketization number ( K /γ ( t + L )/γ) ( t + L )/γ, where γ = gcd( K, t,L ).

18 April 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
EPElizabath Peter
Elizabath Peter
BRBalaji Sundar Rajan
Balaji Sundar Rajan
The coded caching problem with shared caches where the server is equipped with multiple transmit antennas is considered. In a shared cache network, several users share a cache, but each user can access only a single cache. The fundamental limits of coded caching are known for the above setting under centralized uncoded placement. In the centralized case, to achieve the gains offered by coded caching, one requires a sub-packetization level which increases exponentially with the number of caches. The dedicated cache networks too had a similar issue, and placement delivery arrays (PDAs) were introduced as a solution to address the sub-packetization bottleneck of coded caching in the dedicated cache network. Our objective is to design coded caching schemes for shared caches with lower sub-packetization requirements than the existing schemes. By leveraging the PDA constructions, we propose a procedure to obtain new coded caching schemes for shared caches with reduced sub-packetization levels than the known schemes in both single and multi-antenna settings. The advantage of the proposed procedure is that all the existing PDA constructions can be transformed into coded caching schemes for shared caches, thereby reducing the sub-packetization level requirement. In addition, the proposed procedure also recovers the optimal caching schemes given by Parinello et al. by using a PDA corresponding to the Maddah-Ali Niesen scheme.

29 March 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
EPElizabath Peter
Elizabath Peter
KNK. K. Krishnan Namboodiri
K. K. Krishnan Namboodiri
BRBalaji Sundar Rajan
Balaji Sundar Rajan
This work studies the coded caching problem in a setting where users can access a private cache of their own along with a shared cache. The setting consists of a server connected to a set of users, assisted by a smaller number of helper nodes that are equipped with their own storage. In addition to the helper caches, each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache can serve an arbitrary number of users, but each user gets served by only one helper cache. We consider two scenarios: (a) the server has no prior information about the user-to-helper cache association, and (b) the server knows the user-to-helper cache association at the placement phase itself. We design centralized coded caching schemes under uncoded placement for the above two settings. For case (b), we propose four schemes, and establish the optimality of certain schemes in specific memory regimes by deriving matching lower bounds. The fourth scheme, called as the composite scheme, appropriately partitions the file library and the cache memories between two other schemes in case (b) to minimize the rate by leveraging the advantages of both.

27 January 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
EPElizabath Peter
Elizabath Peter
KNK. K. Krishnan Namboodiri
K. K. Krishnan Namboodiri
BRBalaji Sundar Rajan
Balaji Sundar Rajan
This work explores a multiple transmit antenna setting in a multi-access coded caching (MACC) network where each user accesses more than one cache. A MACC network has K users and K caches, and each user has access to r < K consecutive caches in a cyclic wrap-around manner. There are L antennas at the server, and each cache has a normalized size M/N ≤ 1. The cyclic wrap-around MACC network with a single antenna at the server has been well-investigated, and several coded caching schemes and improved lower bounds on the performance are derived for the same. However, this MACC network has not yet been studied under multi-antenna settings in the coded caching literature. We study the multi-antenna MACC problem and propose a solution for the same by constructing a pair of arrays called caching and delivery arrays. We present four constructions of caching and delivery arrays for different scenarios and obtain corresponding multi-antenna MACC schemes. Three of the above schemes achieve optimal performance under uncoded placement and one-shot delivery. The optimality is shown by matching the performance of the multi-antenna MACC scheme to the optimal performance in a dedicated cache network having K users and normalized cache size rM/N. Further, as a special case, one of the proposed schemes subsumes an existing optimal MACC scheme for the single-antenna setting.

26 April 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
EPElizabath Peter
Elizabath Peter
BRBalaji Sundar Rajan
Balaji Sundar Rajan
We consider the multi-antenna shared cache setup where the server is equipped with multiple transmit antennas and is connected to a set of users that are assisted with a smaller number of helper nodes. The helper nodes serve as caches that are shared among the users. Each user gets connected to exactly one helper cache. For this setting, under uncoded cache placement, an optimal multi-antenna coded caching scheme supporting all types of user-to-cache association is known in the literature which is applicable only when the number of antennas is at most the number of users connected to the least occupied cache. The other known multi-antenna shared caching schemes considered only uniform association of users to helper caches. In this work, we propose a multi-antenna coded caching scheme for the shared cache setting with more diverse user-to-cache associations where the number of antennas is not less than the number of users connected to the least occupied cache. Under certain scenarios, our scheme achieves the same performance exhibited by some optimal schemes.

4 May 2024 in arXiv
Verified
Preprint
Open access
PDF file
KNK. K. Krishnan Namboodiri
K. K. Krishnan Namboodiri
EPElizabath Peter
Elizabath Peter
BRB. Sundar Rajan
B. Sundar Rajan
We consider a coded caching network consisting of a server with a library of $N$ files connected to $K$ users, where each user is equipped with a dedicated cache of size $M_p$ units. In addition to that, the network consists of $Λ\leq K$ helper caches, each with a size $M_h$ units. Each helper cache can serve an arbitrary number of users; however, each user can access only a single helper cache. Also, we assume that the server knows the user-to-helper cache association, defined as the sets of users connected to each helper cache, during the cache placement phase. We propose a solution for the aforementioned coded caching problem by introducing a combinatorial structure called a Shared and Private Placement Delivery Array (SP-PDA). These SP-PDAs describe the helper cache placement, private cache placement, and the server transmissions in a single array. Further, we propose a novel construction of SP-PDAs using two Placement Delivery Arrays (PDAs). Interestingly, we observe that the permutations of the columns of the two chosen PDAs result in SP-PDAs with different performances. Moreover, we characterize the conditions for selecting the best column permutations of the chosen PDAs. Furthermore, the coded caching schemes resulting from SP-PDAs subsume two existing coded caching schemes as special cases. Additionally, SP-PDAs enable the construction of coded caching schemes with much smaller subpacketization numbers -subpacketization number is defined as the number of subfiles to which a file is divided- compared to the existing schemes, without paying much in terms of rate (the size of the transmission in the delivery phase).