Link Adaptation for Rate Splitting Systems With Partial CSIT

Carlos Mosquera; Felipe Gómez-Cuba

doi:10.1109/jsac.2023.3240787

Home
Search
Link Adaptation for Rate Splitting Systems With Partial CSIT

9
https://doi.org/10.1109/jsac.2023.3240787

Link Adaptation for Rate Splitting Systems With Partial CSIT

May 1, 2023
IEEE Journal on Selected Areas in Communications
Carlos Mosquera +1 more

Listen

Abstract
Literature Map
References
Citations
Similar Papers

Abstract

Rate Splitting (RS) has emerged as a flexible multiple-access scheme for Multi-User Multiple-Input Multiple-Output (MU-MIMO) systems, generalizing more conventional approaches such as linear precoding or Non-Orthogonal Multiple Access (NOMA), and providing additional robustness against imperfect channel state information at the transmitter. Actual achievable rates cannot be pre-calculated when facing imperfect and/or outdated channel state information at the transmitter (CSIT), so practical real-time mechanisms in the form of link adaptation (LA) are required. The available CSIT is used to design the RS precoders, which can accommodate some degree of robustness, whereas the physical layer feedback reports the outcome of the decoding of the codewords, in the form of acknowledgement (ACK) or negative ACK (NACK), providing the additional meta-robustness needed when the statistical model of CSIT errors is not accurate, and/or the precoders cannot fully track the channel dynamics. We characterize the outage rate region of RS and analyze the convergence of the complete LA-RS system under partial CSIT (non-accurate and non-permanent), providing relevant insights for addressing the adaptation of private and common rates, designing robust precoders with throughput as relevant metric, and handling the time-variant CSIT quality.

Similar Papers

Research Article
4
10.1155/2017/6940368

Performance Analysis of MRC Receivers with Adaptive Modulation and Coding in Rayleigh Fading Correlated Channels with Imperfect CSIT

Jan 01, 2017
Wireless Communications and Mobile Computing
Ramiro Sámano-Robles + 2 more +2

This paper addresses the performance analysis of an adaptive wireless link with one antenna transmitter and a multiple antenna maximum-ratio combining (MRC) receiver. Two main assumptions are used in this paper: (1) Rayleigh fading correlated channels (i.e., MRC branch correlation) and (2) imperfect (outdated) channel state information at the transmitter (CSIT) side. The main contribution of this work lies in the derivation of analytic expressions (in terms of a series expansion) of the statistics of correct packet reception conditional on the decisions made by the transmitter based on outdated CSIT. The novelty of this derivation is the joint modelling of spatially correlated branches, imperfect CSIT, and adaptive modulation based on threshold-trigger decision. Contrary to common belief, the results presented here suggest that spatial correlation not always affects the performance of the MRC receiver: at low signal-to-noise ratio (SNR), correlation can improve performance rather than degrading it. In contrast, at high SNR, correlation is found to always degrade performance. At high SNR, correlation tends to worse the degrading effects of imperfect CSIT, particularly when the number of antennas increases. Imperfect CSIT causes errors in the assignment of MCSs, thus reducing throughput performance. These errors become more evident in the high SNR regime, particularly when the values of branch correlation and the number of antennas increase.

Conference Article
23
10.1109/isit.2010.5513465

The capacity region of fading Multiple Access Channels with cooperative encoders and partial CSIT

Jun 01, 2010
Ali Haghi + 3 more +3

In this paper, we study the two-user Gaussian fading Multiple Access Channel (MAC) with cooperative encoders. Two different scenarios are studied: the Gaussian fading MAC with a common message, and the Gaussian fading MAC with conferencing encoders. The throughput capacity region of these channels with partial Channel State Information (CSI) at the transmitters (CSIT) and perfect CSI at the receiver (CSIR) is established. For the Gaussian fading systems with only CSIR (transmitters have no access to CSIT), some numerical examples and simulation results are provided for Rayleigh fading models.

Conference Article
3
10.1109/acssc.2004.1399343

On the convergence behavior of weighted space-time bit-interleaved coded modulation

Jan 01, 2011
Thanh Tung Kim + 2 more +2

We have recently proposed to use a so-called mixing matrix to improve the performance of a space-time bit-interleaved coded modulation system with channel state information at the transmitter (CSIT). The present paper reviews the general system setup and then focuses on the impact of mixing matrices on the extrinsic information transfer characteristics of the inner detector. Our results show that with the mixing technique, a fixed outer code can interact efficiently with the inner detector under different assumptions on the quality of CSIT. Therefore, when combined with a turbo code, the proposed scheme performs very close to the capacity limits, even with partial CSIT.

Research Article
14
10.1109/tit.2019.2962136

On the Separability of Parallel MISO Broadcast Channels Under Partial CSIT: A Degrees of Freedom Region Perspective

Jan 10, 2020
IEEE Transactions on Information Theory
Hamdi Joudeh + 1 more +1

We study the K-user, M-subchannel parallel multiple-input-single-output (MISO) broadcast channel (BC) under arbitrary levels of partial channel state information at the transmitter (CSIT). We show that the parallel subchannels constituting this setting are separable from a degrees-of-freedom (DoF) region perspective if and only if the partial CSIT pattern is totally ordered. This total order condition corresponds to users abiding by the same order, with respect to their CSIT quality levels, in each of the parallel subchannels. For instance, let α k [l] and α j [l] be the CSIT quality parameters for users k and j over subchannel l. Under total order, having α k [l] ≥ α j [l] implies that α k [m] ≥ α j [m] holds for every subchannel m. In this case, the entire DoF region is achievable using simple separate coding, where a single-subchannel-type transmission scheme is employed in each subchannel. To show this separability result, we first derive an outer bound for the DoF region by extending the aligned image sets approach of Davoodi and Jafar to the considered setting. We then show that this outer bound coincides with the inner bound achieved through separate coding, given by the Minkowski sum of M single-subchannel DoF regions, under the total order condition, hence settling the if part of the main theorem. To prove the only if part of the theorem, we identify a set of DoF tuples achievable through joint coding across subchannels, yet not achievable through separate coding whenever the total order condition is violated. Moreover, we also highlight the implications of our main result on the design of CSIT feedback schemes for multi-carrier multi-antenna wireless networks.

Research Article
39
10.1109/lcomm.2012.050912.120383

Coordinated Multi-Cell Transmission for Distributed Antenna Systems with Partial CSIT

Jul 01, 2012
IEEE Communications Letters
Yanmin Wang + 4 more +4

In this letter, a multi-cell distributed antenna system (DAS) with multiple users served via linear beamforming in each cell is considered. We focus on joint beamformer optimization (JBO) with the target of system weighted sum capacity maximization based on only partial channel state information at the transmitter (CSIT), which includes instantaneous intra-cell and large-scale inter-cell CSIT. After the formulation of a non-convex JBO problem, an algorithm is proposed to find the globally optimal beamformers based on monotonic optimization and the bisection method. Simulation results are provided to show the superiority of the proposed algorithm and the noticeable performance gain of the JBO based on partial CSIT. The proposed algorithm can be used as a benchmark for low-complexity JBO scheme design for practical applications.

Conference Article
20
10.1109/isit.2015.7282578

On degrees-of-freedom of multi-user MIMO full-duplex network

Jun 01, 2015
Jingwen Bai + 2 more +2

When a multi-antenna (MIMO) base-station operates in full-duplex mode, multiple uplink and downlink streams can be supported simultaneously in the same frequency band. However, the inter-mobile interference from uplink streams to the downlink streams can limit the system performance. In this paper, we first characterize the degrees-of-freedom of a multiuser MIMO (MU-MIMO) full-duplex network with half-duplex mobile clients, and derive the regimes where the inter-mobile interference can be mitigated to yield significant gains over the half-duplex counterpart. The achievability is based on interference alignment and requires full channel-state information at the transmitter (CSIT). Next, we study the case with partial CSIT where only the base-station acquires downlink channel values to avoid collecting network-wide CSIT at all transmitters in the system. We show that the key to achieving the sum degrees-of-freedom upper bound with only partial CSIT is the ability of the base-station to switch antenna modes that can be realized via reconfigurable antennas.

Research Article
100
10.1109/tcomm.2021.3138437

Rate-Splitting Multiple Access for Downlink Multiuser MIMO: Precoder Optimization and PHY-Layer Design

Feb 01, 2022
IEEE Transactions on Communications
Anup Mishra + 3 more +3

Rate-Splitting Multiple Access (RSMA) has recently appeared as a powerful and robust multiple access and interference management strategy for downlink Multi-user (MU) multi-antenna communications. In this work, we study the precoder design problem for RSMA scheme in downlink MU systems with both perfect and imperfect Channel State Information at the Transmitter (CSIT) and assess the role and benefits of transmitting multiple common streams. Unlike existing works which have considered single-antenna receivers (Multiple-Input Single-Output–MISO), we propose and extend the RSMA framework for multi-antenna receivers (Multiple-Input Multiple-Output–MIMO) and formulate the precoder optimization problem with the aim of maximizing the Weighted Ergodic Sum-Rate (WESR). Precoder optimization is solved using Sample Average Approximation (SAA) together with the proposed vectorization and Weighted Minimum Mean Square Error (WMMSE) based approach. Achievable sum-Degree of Freedom (DoF) of RSMA is derived for the proposed framework as an increasing function of the number of transmitted common and private streams, which is further validated by the Ergodic Sum Rate (ESR) performance using Monte Carlo simulations. Conventional MU–MIMO based on linear precoders and Non-Orthogonal Multiple Access (NOMA) schemes are considered as baselines. Numerical results show that with imperfect CSIT, the sum-DoF and ESR performance of RSMA is superior to those of the two baselines, and is increasing with the number of transmitted common streams. Moreover, by better managing the interference, RSMA not only has significant ESR gains over baseline schemes but is more robust to CSIT inaccuracies, network loads and user deployments.

Research Article
186
10.1109/tit.2013.2249573

On the Synergistic Benefits of Alternating CSIT for the MISO Broadcast Channel

Jul 01, 2013
IEEE Transactions on Information Theory
Ravi Tandon + 3 more +3

The degrees of freedom (DoFs) of the two-user multiple-input single-output (MISO) broadcast channel (BC) are studied under the assumption that the form, <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$I_{i},\;i=1, 2$</tex></formula> , of the channel state information at the transmitter (CSIT) for each user's channel can be either perfect <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$(P)$</tex></formula> , delayed <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$(D)$</tex></formula> , or not available <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$(N)$</tex></formula> , i.e., <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$I_{1},I_{2} \in \{P,N,D\}$</tex> </formula> , and therefore, the overall CSIT can alternate between the nine resulting states <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$I_{1}I_{2}$</tex></formula> . The fraction of time associated with CSIT state <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$I_{1}I_{2}$</tex></formula> is denoted by the parameter <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$\lambda_{I_{1}I_{2}}$</tex></formula> and it is assumed throughout that <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$\lambda_{I_{1}I_{2}} = \lambda_{I_{2}I_{1}}$</tex></formula> , i.e., <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\lambda_{PN} = \lambda_{NP}, \lambda_{PD}=\lambda_{DP}, \lambda_{DN}=\lambda_{ND}$</tex> </formula> . Under this assumption of symmetry, the main contribution of this paper is a complete characterization of the DoF region of the two-user MISO BC with alternating CSIT. Surprisingly, the DoF region is found to depend only on the marginal probabilities <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$(\lambda_{P}, \lambda_{D},\lambda_{N})=\left(\sum_{I_{2}}\lambda_{PI_{2}},\sum_{I_{2}}\lambda_{DI_{2}}, \sum_{I_{2}}\lambda_{NI_{2}}\right)$</tex></formula> , <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$I_{2} \in \{P,D,N\}$</tex></formula> , which represent the fraction of time that any given user (e.g., user 1) is associated with perfect, delayed, or no CSIT, respectively. As a consequence, the DoF region with all nine CSIT states, <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\cal {D}}(\lambda_{I_{1}I_{2}}:I_{1},I_{2} \in \{P,D,N\})$</tex> </formula> , is the same as the DoF region with only three CSIT states <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\cal {D}}(\lambda_{PP}, \lambda_{DD}, \lambda_{NN})$</tex> </formula> , under the same marginal distribution of CSIT states, i.e., <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$(\lambda_{PP}, \lambda_{DD},\lambda_{NN})=(\lambda_{P},\lambda_{D},\lambda_{N})$</tex></formula> . The sum-DoF value can be expressed as <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\rm DoF}=\min \left({{4+2\lambda_{P}} \over {3}}, 1+\lambda_{P}+\lambda_{D}\right)$</tex></formula> , from which one can uniquely identify the minimum required marginal CSIT fractions to achieve any target DoF value as <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$(\lambda_{P},\lambda_{D})_{\min}=\left({{3} \over {2}} {\rm DoF}-2,1- {{1} \over {2}} {\rm DoF}\right)$</tex></formula> when <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\rm DoF} \in \big [{{4} \over {3}},2\big]$</tex></formula> and <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$(\lambda_{P},\lambda_{D})_{\min}=(0,({\rm DoF}-1)^{+})$</tex></formula> when <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\rm DoF} \in \big [0, {{4} \over {3}}\big)$</tex></formula> . The results highlight the synergistic benefits of alternating CSIT and the tradeoffs between various forms of CSIT for any given DoF value. Partial results are also presented for the multiuser MISO BC with <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$M$</tex></formula> transmit antennas and <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$K$</tex> </formula> single antenna users. For this problem, the minimum amount of perfect CSIT required per user to achieve the maximum DoFs of <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\min (M,K)$</tex></formula> is characterized. By the minimum amount of CSIT per user, we refer to the minimum fraction of time that the transmitter has access to perfect and instantaneous CSIT from a user. Through a novel converse proof and an achievable scheme, it is shown that the minimum fraction of time perfect CSIT is required per user in order to achieve the DoF of <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\min (M,K)$</tex></formula> is given by <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\min (M,K)/K$</tex></formula> .

Conference Article
1
10.1109/vetecs.2011.5956373

Mixed CSIT DL Channel: Gains with an Additional Receive Antenna

May 01, 2011
Umer Salim + 1 more +1

We study a practical version of the broadcast channel (BC) where the channel state information at the transmitter (CSIT) is available only for some of the users, dubbing the system as mixed CSIT. We start with the simplest instance of such a heterogeneous BC where a multi-antenna transmitter base-station (BS) is trying to communicate data to two single-antenna user equipments (UE), having the perfect CSIT about UE1 and no CSIT about UE2. We propose a very simple transmission strategy at the BS for such a system and compare its performance with the interference alignment solution proposed elsewhere which achieves full degrees-of-freedom (DOF) when channel coherence lengths and switching instants abide by certain restrictions. Then with an additional receive antenna granted to UE2 (whose CSIT is not available) and keeping the same CSIT perspective, achievable rates for two users are derived and compared with earlier schemes. Analytical and simulation results show that this additional receive antenna brings significant gains in the system with the same transmission strategy and without any extra requirement of channel training or feedback.

Research Article
10.1049/cje.2015.01.032

Dynamic Decode‐and‐Forward Relaying with Partial CSIT and Optimal Time Allocation

Jan 01, 2015
Chinese Journal of Electronics
Yinjie Su + 2 more +2

A Dynamic decode-and-forward (DDF) relaying protocol with partial Channel state information at the transmitter (CSIT) for a three-node half-duplex single-antenna network, which consists of a single source destination pair and a relay, is proposed. A Diversity multiplexing trade off (DMT) analysis is presented, in which the DMT of the proposed protocol is derived in a closed form and an adaptive time allocation strategy is also developed to achieve the optimal performance. It is shown that time allocation with partial CSIT significantly improves the achievable DMT for DDF relaying. Moreover, unlike the existing DDF protocol with CSIT, which is performed with the assumption of long-term power constraint, the proposed protocol can be generalized to the practical scenarios where a strict short-term power constraint is often imposed on, due to the environmental safety and interference prevention.

Research Article
10.1587/transcom.e94.b.1770

Precoding for OFDM Systems with Imperfect Channel State Information at the Transmitter

Jan 01, 2011
IEICE Transactions on Communications
Chongbin Xu + 2 more +2

We study the transmission techniques in orthogonal frequency division multiplexing (OFDM) systems with imperfect channel state information at the transmitter (CSIT). We focus on the issue of utilizing the available CSIT by a single forward error control (FEC) code. We first analyze the system performance for the ideal coding case. We then develop a simple but efficient scheme for the practical coding case, which is based on joint FEC coding and linear precoding at the transmitter and iterative linear minimum-mean-square-error (LMMSE) detection at the receiver. Numerical results show that significant performances gains can be achieved by the proposed scheme.

Conference Article
26
10.1109/isit.2016.7541508

GDoF of the MISO BC: Bridging the gap between finite precision CSIT and perfect CSIT

Jul 01, 2016
Arash Gholami Davoodi + 1 more +1

This work bridges the gap between sharply contrasting results on the degrees of freedom of the K user broadcast channel where the transmitter is equipped with K transmit antennas and each of the K receivers is equipped with a single antenna. This channel has K DoF when channel state information at the transmitter (CSIT) is perfect, but as shown recently, it has only 1 DoF when the CSIT is limited to finite precision. By considering the full range of partial CSIT assumptions parameterized by β ∈ [0,1], such that the strength of the channel estimation error terms scales as ~ SNR -β relative to the channel strengths which scale as ~ SNR, it is shown that this channel has 1 - β + Kβ DoF. For K = 2 users with arbitrary β ij parameters, the DoF are shown to be 1 + min i,j β ij . To explore diversity of channel strengths, the results are further extended to the symmetric Generalized Degrees of Freedom setting where the direct channel strengths scale as ~ SNR and the cross channel strengths scale as ~ SNR α , α ∈ [0,1], β ∈ [0,α]. Here, the roles of α and β are shown to counter each other on equal terms, so that the sum GDoF value in the K user setting is (α - β) + K(1 - (α-β )) and for the 2 user setting with arbitrary β ij , is 2 - α + min i,j β ij .

Conference Article
10.1109/vetecs.2006.1683127

On the Diversity and Multiplexing Tradeoff for MIMO Links with Imperfect CSIT

May 07, 2006
A.W.C Lim + 1 more +1

Multiple antennas can be used for increasing the packet reliability (spatial diversity) or the spectral efficiency (spatial multiplexing) in wireless communication systems with slow fading. Zheng and Tse showed that both types of gains can be simultaneously obtained for a given multiple antenna channel, but there is a fundamental tradeoff between spatial diversity and spatial multiplexing. They considered the case of no CSIT but perfect CSIR. In this paper, we focus on the role of channel state information at the transmitter (CSIT) on the diversity multiplexing tradeoff. When there is perfect CSIT, there is no packet outage in slow fading channels through proper rate adaptation and hence, the diversity order can be regarded as infinity. However, perfect CSIT is not realistic. Thus, we consider the diversity and multiplexing tradeoff with imperfect CSIT for slow fading MIMO channels. The imperfect CSIT is parameterized by the CSIT estimation error sigma2 DeltaH. Hence, the results obtained are the generalizations of the Zheng-Tse results. We show that when SNRsigma2 DeltaH rarr infin as SNR rarr infin, the availability of the imperfect CSIT does not improve the diversity multiplexing tradeoff

Research Article
269
10.1109/tsp.2016.2591501

Robust Transmission in Downlink Multiuser MISO Systems: A Rate-Splitting Approach

Dec 01, 2016
IEEE Transactions on Signal Processing
Hamdi Joudeh + 1 more +1

We consider a downlink multiuser MISO system with bounded errors in the Channel State Information at the Transmitter (CSIT). We first look at the robust design problem of achieving max-min fairness amongst users (in the worst-case sense). Contrary to the conventional approach adopted in literature, we propose a rather unorthodox design based on a Rate-Splitting (RS) strategy. Each user's message is split into two parts, a common part and a private part. All common parts are packed into one super common message encoded using a public codebook, while private parts are independently encoded. The resulting symbol streams are linearly precoded and simultaneously transmitted, and each receiver retrieves its intended message by decoding both the common stream and its corresponding private stream. For CSIT uncertainty regions that scale with SNR (e.g. by scaling the number of feedback bits), we prove that a RS-based design achieves higher max-min (symmetric) Degrees of Freedom (DoF) compared to conventional designs (NoRS). For the special case of non-scaling CSIT (e.g. fixed number of feedback bits), and contrary to NoRS, RS can achieve a non-saturating max-min rate. We propose a robust algorithm based on the cutting-set method coupled with the Weighted Minimum Mean Square Error (WMMSE) approach, and we demonstrate its performance gains over state-of-the art designs. Finally, we extend the RS strategy to address the Quality of Service (QoS) constrained power minimization problem, and we demonstrate significant gains over NoRS-based designs.

Conference Article
10
10.1109/iccw.2017.7962818

On storage allocation in cache-enabled interference channels with mixed CSIT

May 01, 2017
Mohammad Ali Tahmasbi Nejad + 2 more +2

Recently, it has been shown that in a cache-enabled interference channel, the storage at the transmit and receive sides are of equal value in terms of Degrees of Freedom (DoF). This is derived by assuming full Channel State Information at the Transmitter (CSIT). In this paper, we consider a more practical scenario, where a training/feedback phase should exist for obtaining CSIT, during which instantaneous channel state is not known to the transmitters. This results in a combination of delayed and current CSIT availability, called mixed CSIT. In this setup, we derive DoF of a cache-enabled interference channel with mixed CSIT, which depends on the memory available at transmit and receive sides as well as the training/feedback phase duration. In contrast to the case of having full CSIT, we prove that, in our setup, the storage at the receive side is more valuable than the one at the transmit side. This is due to the fact that cooperation opportunities granted by transmitters' caches are strongly based on instantaneous CSIT availability. However, multi-casting opportunities provided by receivers' caches are robust to such imperfection.