skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Low-Complexity MISO Cache-Aided Communication via Meta-User Scheduling
We present a novel low-complexity scheme for cache-aided communication, where a multi-antenna base station serves multiple single-antenna mobile users. The scheme is based on dividing the users into meta-users, where all users in the same meta-user store the same content during the placement phase. The inter meta-user interference is mitigated by using the cache as well as zero forcing, while the interference between users of the same meta-user is mitigated by zero forcing. Compared to the current state of the art, this scheme is feasible for a wider range of parameters. Moreover, while still achieving the optimal number of degrees of freedom (DoF), the proposed scheme imposes the same or less complexity compared to all the known schemes for each set of parameters. Consequently, the proposed scheme enables practical implementation of cache-aided communication for a large number of users.  more » « less
Award ID(s):
1749981
PAR ID:
10337039
Author(s) / Creator(s):
;
Date Published:
Journal Name:
International ITG Workshop on Smart Antennas WSA
Volume:
25
ISSN:
2473-358X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP))
    We present a novel scheme for cache-aided communication over multiple-input and single output (MISO) cellular networks. The presented scheme achieves the same number of degrees of freedom as known coded caching schemes, but, at much lower complexity. The scheme is derived for communication systems with heterogeneous rates and finite signal-to-noise ratio, in which links are modeled by wideband fading channels. The base station is serving multiple users simultaneously, by sending a combination of several packets, each intended for one user. The interference is either suppressed using the cache content or nulled by zero-forcing at the unintended users. We focus on efficient coding schemes, which allow for a maximum number of users to be served throughout the course of communication. An achievable rate region is characterized by determining the extreme rate vectors satisfying an efficient transmission. The analysis results in a simple scheduling scheme and in a closed-form performance analysis. 
    more » « less
  2. ; ; ; ; (, 2022 IEEE International Symposium on Information Theory (ISIT))
    We consider the cache-aided multiuser private information retrieval (MuPIR) problem with a focus on the special case of two messages, two users and arbitrary number of databases where the users have distinct demands of the messages. We characterize the optimal memory-load trade-off for the considered MuPIR problem by proposing a novel achievable scheme and a tight converse. The proposed achievable scheme uses the idea of cache-aided interference alignment (CIA) developed in the literature by the same authors. The proposed converse uses a tree-like decoding structure to incorporate both the decodability and privacy requirements of the users. While the optimal characterization of the cache-aided MuPIR problem is challenging in general, this work provides insight into understanding the general structure of the cache-aided MuPIR problem. 
    more » « less
  3. ; ; ; ; (, 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT))
    In the problem of cache-aided Multiuser Private Information Retrieval (MuPIR), a set of K u cache-aided users wish to download their desired messages from a set of N distributed non-colluding databases each holding a library of K independent messages. The communication load of this problem is defined as the total number of bits downloaded (normalized by the message length) by the users. The goal is to find the optimal memory-load trade-off under the constraint of user demand privacy, which ensures that any individual database learns nothing about the demands of the users. In this paper, for the MuPIR problem with K=2 messages, Ku=2 users and N≥2 databases, we provide achievability for the memory-load pairs (N−12N,N+1N) and (2(N−1)2N−1,N+12N−1) by constructing specific achievable schemes based on the novel idea of Private Cache-aided Interference Alignment (PCIA). We prove that the proposed scheme is optimal if the cache placement is uncoded (i.e., users directly cache a subset of the library bits). Computer-aided investigation also shows that the proposed schemes are optimal in general when N=2,3. 
    more » « less
  4. ; ; ; ; (, 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT))
    In the problem of cache-aided Multiuser Private Information Retrieval (MuPIR), a set of Ku cache-aided users wish to download their desired messages from a set of N distributed non-colluding databases each holding a library of K independent messages. The communication load of this problem is defined as the total number of bits downloaded (normalized by the message length) by the users. The goal is to find the optimal memory-load trade-off under the constraint of user demand privacy, which ensures that any individual database learns nothing about the demands of the users. In this paper, for the MuPIR problem with K = 2 messages, K u = 2 users and N ≥ 2 databases, we provide achievability for the memory-load pairs (N-1/2N, N+1/N) and(2(N-1)/2N-1,N+1/2N-1) by constructing specific achievable schemes based on the novel idea of Private Cacheaided Interference Alignment (PCIA). We prove that the proposed scheme is optimal if the cache placement is uncoded (i.e., users directly cache a subset of the library bits). Computer-aided investigation also shows that the proposed schemes are optimal in general when N = 2, 3. 
    more » « less
  5. ; ; ; ; (, 2020 IEEE International Symposium on Information Theory (ISIT))
    In the shared-link coded caching problem, formulated by Maddah-Ali and Niesen (MAN), each cache-aided user demands one file (i.e., single file retrieval). This paper generalizes the MAN problem so as to allow users to request scalar linear functions (aka, linear combinations with scalar coefficients) of the files. We propose a novel coded delivery scheme, based on MAN uncoded cache placement, that allows for the decoding of arbitrary scalar linear functions of the files on arbitrary finite fields. Surprisingly, it is shown that the load for cache-aided scalar linear function retrieval depends on the number of linearly independent functions that are demanded, akin to the cache-aided single-file retrieval problem where the load depends on the number of distinct file requests. The proposed scheme is proved to be optimal under the constraint of uncoded cache placement, in terms of worst-case load, and within a factor 2 otherwise. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email