Multi-Antenna Coded Caching
Seyed Pooya Shariatpanahi, Giuseppe Caire, Babak Hossein Khalaj

TL;DR
This paper explores multi-antenna coded caching strategies in a downlink scenario, comparing three delivery schemes and highlighting the trade-offs between Degrees of Freedom and throughput at different SNR levels.
Contribution
It introduces and analyzes three delivery schemes combining coded caching with multi-antenna techniques, providing closed-form rate expressions and insights into their performance across SNR regimes.
Findings
Schemes with coded chunks in the data domain outperform in Degrees of Freedom.
Power loss occurs when forming coded chunks in the signal domain at intermediate SNR.
Modified schemes are needed for optimal performance across all SNR regimes.
Abstract
In this paper we consider a single-cell downlink scenario where a multiple-antenna base station delivers contents to multiple cache-enabled user terminals. Based on the multicasting opportunities provided by the so-called Coded Caching technique, we investigate three delivery approaches. Our baseline scheme employs the coded caching technique on top of max-min fair multicasting. The second one consists of a joint design of Zero-Forcing (ZF) and coded caching, where the coded chunks are formed in the signal domain (complex field). The third scheme is similar to the second one with the difference that the coded chunks are formed in the data domain (finite field). We derive closed-form rate expressions where our results suggest that the latter two schemes surpass the first one in terms of Degrees of Freedom (DoF). However, at the intermediate SNR regime forming coded chunks in the signal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Multi-Antenna Coded Caching
Seyed Pooya Shariatpanahi1, Giuseppe Caire2, Babak Hossein Khalaj3
1: School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran.
2: Technical University of Berlin, 10587 Berlin, Germany.
3: Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran.
(emails: [email protected], [email protected], [email protected])
Abstract
In this paper we consider a single-cell downlink scenario where a multiple-antenna base station delivers contents to multiple cache-enabled user terminals. Based on the multicasting opportunities provided by the so-called Coded Caching technique, we investigate three delivery approaches. Our baseline scheme employs the coded caching technique on top of max-min fair multicasting. The second one consists of a joint design of Zero-Forcing (ZF) and coded caching, where the coded chunks are formed in the signal domain (complex field). The third scheme is similar to the second one with the difference that the coded chunks are formed in the data domain (finite field). We derive closed-form rate expressions where our results suggest that the latter two schemes surpass the first one in terms of Degrees of Freedom (DoF). However, at the intermediate SNR regime forming coded chunks in the signal domain results in power loss, and will deteriorate throughput of the second scheme. The main message of our paper is that the schemes performing well in terms of DoF may not be directly appropriate for intermediate SNR regimes, and modified schemes should be employed.
I Introduction
Caching content near end-users is one of the most promising solutions proposed for next generation wireless networks such as 5G [1]. The main reason of the effectiveness of this approach is that a significant portion of mobile traffic is multimedia-like which makes demands predictable [2]. On the other hand, memory hardware is much cheaper than bandwidth, and is abundantly available at mobile devices. Thus, using a technique which turns memory into bandwidth (i.e., Caching) is of high interest.
The surprising finding of [3] shows that by careful caching at end-users the delivery bandwidth burden can be greatly relaxed by multicasting coded file chunks to these users. The main idea of this so-called Coded Caching approach is to cache non-identical file chunks among different users, which will provide coded multicasting opportunities. This idea has been extended to other scenarios such as hierarchical caching [4], D2D networks [5], and multi-server setup [6].
Since the coded caching scheme is not originally designed for wireless scenarios (such as 5G) this approach should carefully be adapted to specific characteristics of wireless channels. In order to achieve this goal we consider a multi-antenna transmitter (e.g., a base station) delivering contents to multiple single-antenna receivers (e.g., user terminals), i.e., cache-enabled MISO broadcast. Since the coded caching approach is designed to provide multicasting opportunities, the baseline scheme we consider is using the multiple antennas at the transmitter to design max-min fair multicast transmissions to receiver groups. The second approach we consider is employing the transmit antennas’ multiplexing gain to enlarge the size of multicast groups, following ideas in [6]. We investigate this approach by assuming coded file chunks formed in both the signal domain (complex field) and the data domain (finite field). For all the aforementioned schemes we derive delivery rate at finite SNR.
It should be noticed that a conventional approach using caching in the non-cooperative traditional way would simply cache a fraction of the library at each user, and serve a number of users (smaller than the number of transmit antennas) via spatial multiplexing and single-user codes. In contrast to our proposed schemes, such solution does not benefit from the cooperative caching gain making it non-scalable for large networks.
While there are other works which have considered coded caching in wireless scenarios such as [7, 8, 9, 10] our paper addresses the problem at finite SNR. Such finite SNR analysis proposes important design guidelines not revealed in earlier (high SNR) DoF analysis of wireless coded caching papers. Moreover, although the paper [11] considers a finite SNR setup, in contrast to our paper, their scheme is designed for a massive MIMO scenario with more transmit antennas than users. In this case, if full Channel State Information at the Transmitter (CSIT) is available, there is no need for multicasting opportunities provided by coded caching.
The rest of the paper is organized as follows. In Section II we describe the model. In Section III we describe the baseline scheme of Max-Min Fair Multicasting. In Sections IV and V we analyze Multi-Antenna Coded Caching. Section VI compares the three schemes, and finally, Section VII concludes the paper.
In this paper we use the following notations. We use to denote the Hermitian of a complex matrix. Let and denote the set of complex and natural numbers and be the norm of a complex vector. Also denotes the set of integer numbers , and represents addition in the corresponding finite field. For any vector , we define such that .
II Model
We consider downlink transmission from a multiple-antenna base station (BS) with antennas having access to a library of files , each of size bits. The transmission is to single antenna User Terminals (UT). The wireless channel from the BS to the UTs is represented by the matrix (complex baseband discrete-time channel model). In addition, we consider to be constant over large blocks of channel uses in the time-frequency domain. Also, we assume full CSIT is available, and .
Let us represent data by -bit symbols in the finite field . Consider a one-to-one map from to complex numbers belonging to a Gaussian codebook , i.e., , which constitute the transmit signal from BS antennas passed through channel uses. We also assume a power constraint on the codebook as follows: If is an -bit symbol, then we should have . The operator encodes a vector of symbols element-wise. For ease of presentation we denote the encoded version of file with throughout the paper.
Consider channel uses. Then, the received signal at user is given by
[TABLE]
where denote the received signal sequence (over channel uses) at receiver and the corresponding additive white Gaussian noise sequence, with i.i.d. components , is the -th column of , and is the space-time block of transmitted coded signal collectively transmitted by the BS over the channel uses. Also, we consider the total transmit power constraint
[TABLE]
In the system at hand, the users are equipped with a cache memory of capacity bits. Before the network operations (e.g., at off-peak times, or at home, downloading from a home INTERNET access) each user has stored in its cache a message , where denotes a function of the library files with entropy not larger than bits. This operation is referred to as the cache content placement, and it is performed once and at no cost. During the network operation, users place requests for files in the library. We let denote the request of user and be the request vector.
Upon a set of requests at the content delivery phase, the BS transmits a coded signal, such that at the end of transmission all users can reliably decode their requested files. Notice that user decoder, in order to produce the decoded file , makes use of its own cache content as well as of its own received signal from the wireless channel.
In this work we focus on the worst-case (over the users) delivery rate at which the system can serve any users requesting any file of the library. Consider the MIMO channel at hand, and suppose that the coded multicasting codeword is formed by the concatenation of subcodewords , where each subcodeword is dedicated to a subset of users, of length bits each. Let (in bit/s) denote the multicast rate at which the BS can communicate a common message to all users in subset . It follows that the total transmission time necessary to deliver all multicast subcodewords is given by
[TABLE]
Since time is necessary for each user to be able to decode its own request file of bits, the system symmetric rate can be defined as the “goodput” (useful bits per second) at which each user is served. Since each user is able to decode a file of bits after time , the per user symmetric rate is given by
[TABLE]
III Coded Caching with Max-Min Fair Multicasting
In this case, the cache content placement works exactly as in Maddah-Ali and Niesen scheme [3]. For the case of , each file is partitioned into non-overlapping subfiles as:
[TABLE]
Each user stores in its cache all subfiles such that . These are , such that the cache memory is completely used since .
In the content delivery phase, let be the current demand vector. For all subsets of size (denoted in the following as -subsets), the BS forms the coded message
[TABLE]
In Maddah-Ali and Niesen proposal [3] the BS communicates to all users simultaneously through an error free link of capacity bits per unit time. In this case, the coded multicast codeword consists simply of the concatenation of the coded messages
[TABLE]
The transmission length of is
[TABLE]
resulting in the symmetric rate
[TABLE]
(consistently with our definition given before).
Now, it turns out that each coded message is useful only to the users in . Therefore, each message can be sent by multicasting to the group of users . In order to do this we use a beamforming vector (where ) which results in the following common rate for group :
[TABLE]
which can be maximized by choosing
[TABLE]
This optimization problem has been shown to be NP-Hard, however, close-to-optimal solutions can be obtained by a Semidefinite Relaxation (SDR) approach [12].
This will result in the symmetric rate
[TABLE]
where is the solution to (7).
IV Multi-Antenna Coded Caching,
Linear Combination in the Complex Field
The basic idea of the last section was to adapt the multicasting opportunities to the wireless channel via max-min fair beamforming. However, in the above scheme the spatial multiplexing gain of transmit antennas is not exploited. In this section we introduce a new scheme which exploits multiplexing and caching gains simultaneously. This scheme borrows the idea of simultaneous Zero-Forcing and Coded Caching in the delivery phase from [6], which is here adapted to the wireless scenario. Let us first explain the main idea through an example.
Example 1**.**
Here we consider transmit antennas, users, files , and . In the first phase, each file is divided into three equal-sized parts and in the cache content placement phase the caches are filled as:
[TABLE]
Then, the transmitter will send the following blocks sequentially
[TABLE]
where and are complex blocks, requiring channel uses. The first user will receive and sequentially, and with the help of its cache contents, the first user extracts
[TABLE]
where is the unitary matrix
[TABLE]
This user multiplies its received signal by , and then can decode its desired messages if encoding rate of subfiles and is less than:
[TABLE]
Thus, considering the minimum rate of all the three users, the common transmission rate to all three users should be less than
[TABLE]
This results in the symmetric rate:
[TABLE]
The scheme in Example 1 can be extended to the general case of , , , and , following the same guidelines in [6], adapted to the wireless scenario. This generalization is shown in Algorithm 1. Theorem 1 characterizes the symmetric rate of this algorithm.
Theorem 1**.**
Algorithm 1 will result in the following symmetric rate
[TABLE]
where
[TABLE]
Proof.
Please refer to the Appendix A. ∎
V Multi-Antenna Coded Caching,
Linear Combination in the Finite Field
In this section we analyze a similar scheme, but here the coded caching messages are developed in the finite field, and then modulated to complex numbers. Let us first revisit our example:
Example 2**.**
Here the problem setup and the cache content placement is the same as Example 1, but the second phase is different. In the delivery phase, the transmitter will send
[TABLE]
where is a complex block, requiring channel uses. Let us focus on the first user who will receive as follows
[TABLE]
Since User 1 is interested in decoding both and , and their encoding is done independently, this can be considered as a MAC channel. Let us define
[TABLE]
Then, if we operate the MAC channel at an equal rate point, user 1 will receive useful information with the effective sum rate:
[TABLE]
Similarly, effective sum rate for other users will be and . Then, the symmetric rate will be:
[TABLE]
The generalization of Example 2 to general , , , and is shown in Algorithm 2. Theorem 2 characterizes the symmetric rate of Algorithm 2.
Theorem 2**.**
Algorithm 2 will result in the following symmetric rate
[TABLE]
where
[TABLE]
Proof.
Please refer to the Appendix B. ∎
Remark 1**.**
It should be noted that the main difference between Algorithm 1 and 2 is that in Algorithm 1 is a linear combination of subfiles in the complex field, while in Algorithm 2 is linear combination of subfiles in the finite field.
VI Performance Comparison
All the above schemes exploit multiple antennas at the transmitter, in addition to multicasting opportunities provided by coded caching. It can easily be verified that by defining per user we will have
[TABLE]
which is consistent with the results in [3] and [6].
For numerical illustrations at finite we consider the settings in Examples 1 and 2 in a Rayleigh fading wireless setup. Figure 1 shows the symmetric rate of the three schemes for the range . This figure shows that at low the max-min fair multicasting has the best performance, while for the multi-antenna coded caching with finite field combination has the best performance. Figure 2 shows symmetric rate for the range . In this figure we see that at high both multi-antenna coded caching schemes (complex and finite field linear combinations) surpass the max-min fair approach, which is consistent with the DoF analysis above.
VII Conclusions
In this paper we have considered a cache-enabled MISO broadcast scenario, and have investigated the performance of a scheme benefiting from multiplexing and caching gains at the same time. We have derived finite SNR rate expressions for the proposed scheme. Although the proposed scheme is shown to surpass a max-min fair multicast baseline scheme in terms of DoF performance, careful modifications are required for proper performance at low SNR values. .
Appendix A
Proof of Theorem 1.
For the general , , , and case, the placement procedure is the same as [3]. However, here we divide each sub-packet further into mini-packets of equal size as follows:
[TABLE]
The delivery phase is based on the ideas proposed in [6], adapted to the wireless medium, which is represented in Algorithm 1.
Consider a -subset of users named . This subset has number of -subsets which we call . Our aim is to deliver
[TABLE]
to the subset . Here means a random linear combination. Upon successful reception of this linear combination at , each user can, with the help of its cache contents, decode .
The main idea in Algorithm 1 is that with the help of the Zero-Forcing techniques we can deliver to all simultaneously. The main challenge is that the members of are not interested in receiving . Thus, to avoid interference, is zero-forced at these users. For doing the same idea for all the transmitter should send
[TABLE]
where we design such that: for all , if and if , and . This task is done by the procedure BFV in Algorithm 1, where its details are shown in Auxiliary Procedures.
The index in ensures that, with appropriate choice of coefficients, each user will receive independent linear combinations of its desired mini-files. The index in Algorithm 1 ensures that each user will not receive the same sub-file more than once. The Procedures INDEX-INIT and INDEX-UPDATE will take care of that concern in Algorithm 1, where their details are shown in Auxiliary Procedures.
It has been shown in [6] that, in a noise-free scenario the Algorithm 1 will succeed in delivering the requested files to all the users. However, in the current finite SNR wireless scenario we should limit the transmit rate of all the mini-files encoders to guarantee successful delivery at all the receivers. The following lemma characterizes the maximum transmission rate to each subset of users, at which all these users can decode their required mini-files successfully.
Lemma 1**.**
Consider a -subset of users . Then, if the common transmission rate to this subset according to Algorithm 1 is less than
[TABLE]
then all the users can decode their required mini-files successfully.
In order to prove Lemma 1 let us consider user in a fixed -subset . This user will receive
[TABLE]
for all . In (21), follows from (18), follows from the fact that if , and follows from the fact that this user has cached, and thus can eliminate for all .
Let us define
[TABLE]
and the matrix such that
[TABLE]
for all , where for . Then, the observations of this user can be shown as
[TABLE]
where it is easy to verify that the coefficients can be chosen such that we have:
[TABLE]
where is a unitary matrix. Also we have used the fact that if all the coefficients satisfy
[TABLE]
then the transmit power constraint in (2) is satisfied.
Thus, user can decode all its required data if the transmission rate is less than
[TABLE]
Considering the fact that we need all the users in to successfully decode, they should have the common rate
[TABLE]
It should be noted that, based on Lemma 1, each user in can receive data with rate (23). Since each user in decodes
[TABLE]
bits after transmission to is concluded, the symmetric rate will be equal to (1), and the proof is complete.
∎
Appendix B
Proof of Theorem 2.
Algorithm 2 is the same as Algorithm 1 in the cache content placement phase. The only difference is in the delivery phase. In Algorithm 1 the coded chunks are formed in the signal domain (complex field), while in Algorithm 2 they are formed in the data domain (finite field). Thus, let us first form the coded chunks as
[TABLE]
Then, in Algorithm 2 the transmitter will send
[TABLE]
It can be easily checked that the transmit signal in (25) satisfies the transmit power constraint in (2).Then, the following lemma characterizes the rate for successful transmission of .
Lemma 2**.**
Consider a -subset of users . Then, if the common transmission rate to this subset according to Algorithm 2 is less than
[TABLE]
where
[TABLE]
this transmission will be successful.
In order to prove Lemma 2, let us focus on user who will receive
[TABLE]
Considering the fact that User is interested in decoding all the terms in above summation with equal rates, and using achievable capacity region of MAC channels [13], the lemma proof is complete.
Now, since each user in decodes
[TABLE]
bits after transmission to is concluded, the symmetric rate will be equal to (2), and the proof of Theorem 2 is complete.
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Bastug, M. Bennis and M. Debbah, ”Living on the edge: The role of proactive caching in 5G wireless networks,” IEEE Communications Magazine , vol. 52, no. 8, pp. 82-89, Aug. 2014.
- 2[2] “Mobile traffic forecasts 2010–2020,” Tech. Rep. UMTS Forum, MSUCSE- 00-2, Jan. 2011.
- 3[3] M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Transactions on Information Theory , vol. 60, no. 5, pp. 2856–2867, 2014.
- 4[4] N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. N. Diggavi, “Hierarchical Coded Caching,” IEEE Transactions on Information Theory , vol. 62, no. 6, pp. 3212–3229,2016.
- 5[5] M. Ji, G. Caire, and A. F. Molisch, “Fundamental Limits of Caching in Wireless D 2D Networks,” IEEE Transactions on Information Theory , vol. 62, no. 2, pp. 849–869, 2016.
- 6[6] S. P. Shariatpanahi, S. A. Motahari, and B. H. Khalaj, “Multi-server coded caching,” IEEE Transactions on Information Theory , vol. 62, no. 12, pp. 7253-7271, 2016.
- 7[7] J. Zhang and P. Elia, “Fundamental limits of cache-aided wireless bc: Interplay of coded-caching and csit feedback,” ar Xiv preprint ar Xiv:1511.03961, 2015.
- 8[8] N. Naderializadeh, M. A. Maddah-Ali, and A. S. Avestimehr, “Fundamental limits of cache-aided interference management,” in Proc. IEEE ISIT, Jul. 2016.
