Finite Precision Channel State Information At The Transmitters Research Articles

Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities

Aligned-Images Sum-set Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference channel under the robust assumption that the channel state information at the transmitters (CSIT) is limited to finite precision. First, the sum-GDoF value is characterized for the <inline-formula> <tex-math notation="LaTeX">$2\times 2\times 2$ </tex-math></inline-formula> setting that is comprised of 2 sources, 2 relays, and 2 destinations. It is shown that the sum-GDoF does not improve even if perfect CSIT is allowed in the first hop, as long as the CSIT in the second hop is limited to finite precision. The sum GDoF characterization is then generalized to the <inline-formula> <tex-math notation="LaTeX">$2\times 2\times \cdots \times 2$ </tex-math></inline-formula> setting that is comprised of <inline-formula> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula> hops. Remarkably, for large <inline-formula> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula>, the sum-GDoF value approaches that of the one-hop broadcast channel that is obtained by full cooperation among the two transmitters of the last hop, with finite precision CSIT. Previous studies of multi-hop interference networks either identified sophisticated GDoF optimal schemes under perfect CSIT, such as aligned interference neutralization and network diagonalization, that are powerful in theory but too fragile to be practical, or studied robust achievable schemes like classical amplify/decode/compress-and-forward without claims of information-theoretic optimality. In contrast, under finite precision CSIT, we show that the benefits of fragile schemes are lost, while a combination of classical random coding schemes that are simpler and much more robust, namely a rate-splitting between decode-and-forward and amplify-and-forward, is shown to be GDoF optimal. As such, this work represents another step towards bridging the gap between theory (optimality) and practice (robustness) with the aid of Aligned-Images Sum-set Inequalities.

Secure GDoF of the Z-Channel With Finite Precision CSIT: How Robust are Structured Codes?

Under the assumption of perfect channel state information at the transmitters (CSIT), it is known that structured codes offer significant advantages for secure communication in an interference network, e.g., structured jamming signals based on lattice codes may allow a receiver to decode the sum of the jamming signal and the signal being jammed, even though they cannot be separately resolved due to secrecy constraints, subtract the aggregate jammed signal, and then proceed to decode desired codewords at lower power levels. To what extent are such benefits of structured codes fundamentally limited by uncertainty in CSIT? To answer this question, we explore what is perhaps the simplest setting where the question presents itself -- a Z interference channel with secure communication. Using sum-set inequalities based on Aligned Images bounds we prove that the GDoF benefits of structured codes are lost completely under finite precision CSIT. The secure GDoF region of the Z interference channel is obtained as a byproduct of the analysis.

Cellular Networks With Finite Precision CSIT: GDoF Optimality of Multi-Cell TIN and Extremal Gains of Multi-Cell Cooperation

We study the generalized degrees-of-freedom (GDoF) of cellular networks under finite precision channel state information at the transmitters (CSIT). We consider downlink settings modeled by the interfering broadcast channel (IBC) under no multi-cell cooperation, and the overloaded multiple-input-single-output broadcast channel (MISO-BC) under full multi-cell cooperation. We focus on three regimes of interest: the mc-TIN regime, where a scheme based on treating inter-cell interference as noise (mc-TIN) was shown to be GDoF optimal for the IBC; the mc-CTIN regime, where the GDoF region achievable by mc-TIN is convex without the need for time-sharing; and the mc-SLS regime which extends a previously identified regime, where a simple layered superposition (SLS) scheme is optimal for the 3-transmitter-3-user MISO-BC, to overloaded cellular-type networks with more users than transmitters. We first show that the optimality of mc-TIN for the IBC extends to the entire mc-CTIN regime when CSIT is limited to finite precision. The converse proof of this result relies on a new application of aligned images bounds. We then extend the IBC converse proof to the counterpart overloaded MISO-BC, obtained by enabling full transmitter cooperation. This, in turn, is utilized to show that a multi-cell variant of the SLS scheme is optimal in the mc-SLS regime under full multi-cell cooperation, albeit only for 2-cell networks. The overwhelming combinatorial complexity of the GDoF region stands in the way of extending this result to larger networks. Alternatively, we appeal to extremal network analysis, recently introduced by Chan et al., and study the GDoF gain of multi-cell cooperation over mc-TIN in the three regimes of interest. We show that this extremal GDoF gain is bounded by small constants in the mc-TIN and mc-CTIN regimes, yet scales logarithmically with the number of cells in the mc-SLS regime.

Toward an Extremal Network Theory—Robust GDoF Gain of Transmitter Cooperation Over TIN

Significant progress has been made recently in Generalized Degrees of Freedom (GDoF) characterizations of wireless interference channels (IC) and broadcast channels (BC) under the assumption of finite precision channel state information at the transmitters (CSIT), especially for smaller or highly symmetric network settings. A critical barrier in extending these results to larger and asymmetric networks is the inherent combinatorial complexity of such networks. Motivated by other fields such as extremal combinatorics and extremal graph theory, we explore the possibility of an extremal network theory, i.e., a study of extremal networks within particular regimes of interest. As our test application, we study the GDoF benefits of transmitter cooperation in a K user IC over the simple scheme of power control and treating interference as Gaussian noise (TIN) for three regimes of interest - a TIN regime identified by Geng et al. where TIN was shown to be GDoF optimal for the K user interference channel, a CTIN regime identified by Vi and Caire where the GDoF region achievable by TIN is convex without time-sharing, and an SLS regime identified by Davoodi and Jafar where a simple layered superposition (SLS) scheme is shown to be optimal in the K user MISO BC, albeit only for K ≤ 3. The SLS regime includes the CTIN regime, and the CTIN regime includes the TIN regime. As our first result, we show that under finite precision CSIT, TIN is GDoF optimal for the K user IC throughout the CTIN regime. Furthermore, under finite precision CSIT, appealing to extremal network theory we obtain the following results. In the TIN regime as well as the CTIN regime, we show that the extremal GDoF gain from transmitter cooperation over TIN is bounded regardless of the number of users. In fact, the gain is exactly a factor of 3/2 in the TIN regime, and 2 - 1/K in the CTIN regime, for arbitrary number of users K > 1. However, in the SLS regime, the gain is ⊖(log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> (K)), i.e., it scales logarithmically with the number of users.

Sum-GDoF of 2-User Interference Channel With Limited Cooperation Under Finite Precision CSIT

The Generalized Degrees of Freedom (GDoF) of the two user interference channel are characterized for all parameter regimes under the assumption of finite precision channel state information at the transmitters (CSIT), when a limited amount of (half-duplex or full-duplex) cooperation is allowed between the transmitters in the form of $\pi $ DoF of shared messages. In all cases, the number of over-the-air bits that each cooperation bit buys is shown to be equal to either $0, 1, 1/2$ or $1/3$ . The most interesting aspect of the result is the $1/3$ slope, which appears only under finite precision CSIT and strong interference, and as such has not been encountered in previous studies that invariably assumed perfect CSIT. Indeed, the achievability and converse for the parameter regimes with $1/3$ slope are the most challenging aspects of this work. In particular, the converse relies on non-trivial applications of Aligned Images bounds.

&lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$K$ &lt;/tex-math&gt; &lt;/inline-formula&gt;-User Symmetric &lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$M\times N$ &lt;/tex-math&gt; &lt;/inline-formula&gt; MIMO Interference Channel Under Finite Precision CSIT: A GDoF Perspective

Generalized degrees of freedom (GDoF) are characterized for the symmetric $K$ -user multiple-input multiple-output interference channel under the assumption that the channel-state information at the transmitters (CSITs) is limited to finite precision. In this symmetric setting, each transmitter is equipped with $M$ antennas, each receiver is equipped with $N$ antennas, each desired channel (i.e., a channel between a transmit antenna and a receive antenna belonging to the same user) has strength $\sim P$ , while each undesired channel has strength $\sim P^\alpha $ , where $P$ is a nominal SNR parameter. The result generalizes a previous GDoF characterization for the SISO setting $(M=N=1)$ and is enabled by a significant extension of the aligned image sets bound that is broadly useful. GDoF per user take the form of a $W$ -curve with respect to $\alpha $ for fixed values of $M$ and $N$ . Under finite precision CSIT, in spite of the presence of multiple antennas, all the benefits of interference alignment are lost.

Network Coherence Time Matters—Aligned Image Sets and the Degrees of Freedom of Interference Networks With Finite Precision CSIT and Perfect CSIR

This paper obtains the first degrees of freedom (DoFs) bound that is provably sensitive to network coherence time, i.e., coherence time in an interference network, where all channels experience the same coherence patterns. This is accomplished by a novel adaptation of the aligned image sets bound and settles various open problems noted previously by Naderi and Avestimehr and by Gou et al. For example, a necessary and sufficient condition is obtained for the optimality of 1/2 DoF per user in a partially connected interference network, where the channel state information at the receivers (CSIRs) is perfect, the channel state information at the transmitters (CSITs) is instantaneous but limited to finite precision, and the network coherence time is $T_{c}=1$ . The surprising insight that emerges is that even with perfect CSIR and instantaneous finite precision CSIT, the network coherence time matters, i.e., it has a DoF impact.

Generalized Degrees of Freedom of the Symmetric $K$ User Interference Channel Under Finite Precision CSIT

The generalized degrees of freedom (GDoF) characterization of the symmetric $K$ user interference channel is obtained under finite precision channel state information at the transmitters (CSIT). The symmetric setting is where each cross channel is capable of carrying $\alpha $ DoF, while each direct channel is capable of carrying 1 DoF. Remarkably, under finite precision CSIT the symmetric $K$ user interference channel loses all the GDoF benefits of interference alignment. The GDoF per user diminish with the number of users everywhere except in the very strong (optimal for every receiver to decode all messages) and very weak (optimal to treat all interference as noise) interference regimes. The result stands in sharp contrast to prior work on the symmetric setting under perfect CSIT, where the GDoF per user remain undiminished due to interference alignment. The result also stands in contrast to prior work on a subclass of asymmetric settings under finite precision CSIT, i.e., the topological interference management problem, where interference alignment plays a crucial role and provides substantial GDoF benefits.

Transmitter Cooperation Under Finite Precision CSIT: A GDoF Perspective

The benefits of partial and full transmitter cooperation are evaluated for a two user interference channel under finite precision channel state information at the transmitters (CSITs), using the generalized degrees of freedom (GDoFs) metric. Under finite precision CSIT, the benefits of interference alignment are completely lost, so that the X channel obtained by partial transmitter cooperation does no better than the underlying interference channels. Full transmitter cooperation produces a vector broadcast channel, which has a strict GDoF advantage over partial cooperation (X channel) and whose GDoF is fully achieved by interference enhancement.