Reza K. Farsani
This paper gives a solution to one of the long-standing open problems in network information theory: "What is the generalization of the strong interference regime to the K-user interference channel?"
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The capacity regions of multiple-input multiple-output Gaussian Z-interference channels are established for the very strong interference and aligned strong interference cases. The sum-rate capacity of such channels is established under noisy interference. These results generalize known results for scalar Gaussian Z-interference channels.
The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by letting the transceiver pair subject to the interference communicates at a rate such that its message can be decoded at the unintended receiver using single user detection. Moreover, this class of discrete memoryless interference channels is equivalent in capacity region to certain discrete degraded interference channels. This allows the construction of a ca…
This paper looks into the $K$-user interference channel. Interference Alignment is much likely to be applied with double-layered symbol extensions, either for constant channels in the H$ø$st-Madsen-Nosratinia conjecture or slowly changing channels. In our work, the core idea relies on double-layered symbol extensions to artificially construct equivalent time-variant channels to provide crucial \textit{channel randomness or relativity} required by conventional Cadambe-Jafar scheme in time-variant channels \cite{IA-DOF-Kuser-Interference}.
We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy interference regime, i.e., a regime where random coding and treating interference as noise achieves sum-capacity. Specializing our results to the Gaussian MIMO many-to-one interference channel, which is a special case of the class of channels considered, we obtain new capacity results. Firstly, we extend the noisy interference regime, previously studied for (many-to-on…
The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the sources' transmission. We derive a new outer bound for this channel using an argument originally devised for the "more capable" broadcast channel, and show the achievability of the proposed outer bound in the "very strong interference" regime, a class of channels where there is no loss in optimality if both destinations decode both messages. This result is analogo…
We show that the 2x2x2 interference channel, i.e., the multihop interference channel formed by concatenation of two 2-user interference channels achieves the min-cut outer bound value of 2 DoF, for almost all values of channel coefficients, for both time-varying or fixed channel coefficients. The key to this result is a new idea, called aligned interference neutralization, that provides a way to align interference terms over each hop in a manner that allows them to be cancelled over the air at the last hop.
An interference channel is said to have strong interference if for all input distributions, the receivers can fully decode the interference. This definition of strong interference applies to discrete memoryless, scalar and vector Gaussian interference channels. However, there exist vector Gaussian interference channels that may not satisfy the strong interference condition but for which the capacity can still be achieved by jointly decoding the signal and the interference. This kind of interference is called generally strong interference. Sufficient conditions for a vector Gaussian interferenc…
Interference Alignment on the Deterministic Channel and Application to Fully Connected AWGN Interference Networks
针对$K$用户干扰信道的确定性信道模型构造了干扰对齐示例。然后将确定性信道示例转换为高斯设置，创建具有单个天线节点、实的、非零的和恒定的信道系数并且没有传播延迟的完全连接的高斯$K$用户干扰网络的第一已知示例，其中实现了自由度外界。在基于传播延迟的干扰对准示例和确定性信道模型之间进行类比，确定性信道模型也允许2用户$X$信道的类似构造。
Capacity of Symmetric K-User Gaussian Very Strong Interference Channels
本文研究了具有K个发射机和K个接收机的对称K用户高斯干扰信道。一个“非常强”的干扰制度，推导出此信道设置。“非常强”的干扰状态是其中干扰信道的容量区域与没有干扰的信道的容量区域相同的状态。在这种情况下，干扰可以被所有接收机完美地消除，而不会招致任何速率惩罚。还提出了用于示例对称K用户确定性干扰信道的“非常强”干扰条件。
A simple encoding scheme based on Sato's non-naïve frequency division is proposed for a class of Gaussian interference channels with mixed interference. The achievable region is shown to be equivalent to that of Costa's noiseberg region for the onesided Gaussian interference channel. This allows for an indirect proof that this simple achievable rate region is indeed equivalent to the Han-Kobayashi (HK) region with Gaussian input and with time sharing for this class of Gaussian interference channels with mixed interference.
We consider the 3-user Gaussian interference channel and provide an outer bound on its capacity region. Under some conditions, which we call the mixed strong-very strong interference conditions, this outer bound is achievable. These conditions correspond to the case where at each receiver, one transmitter is causing strong interference and the other is causing very strong interference. Therefore, we characterize the capacity region of the 3-user interference channel with mixed strong-very strong interference.
The capacity regions of vector, or multiple-input multiple-output, Gaussian interference channels are established for very strong interference and aligned strong interference. Furthermore, the sum-rate capacities are established for Z interference, noisy interference, and mixed (aligned weak/intermediate and aligned strong) interference. These results generalize known results for scalar Gaussian interference channels.
On the Capacity of MIMO Interference Channels
研究了多输入多输出干扰信道（MIMO IC）的容量域，其中信道矩阵为平方可逆矩阵。强干扰的容量区域建立强干扰的定义平行的标量信道。此外，Z干扰，噪声干扰，和混合干扰的和速率容量的建立。这些结果推广了标量高斯IC的已知结果。
The Han-Kobayashi (HK) scheme achieves the best known achievable rate region for the K user interference channel (IC). Simple HK schemes are HK schemes with Gaussian signaling, no time sharing, and no private-common power splitting. The class of simple HK schemes includes the treating interference as noise (TIN) scheme and schemes that involve various levels of interference decoding and cancellation at each receiver. We derive conditions under which simple HK schemes achieve sum capacity for general K user Gaussian ICs. These results generalize existing sum capacity results for the TIN scheme …
Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime
推导了两用户高斯干扰信道总容量的新上界。使用这些界限，它示出了，如果干扰水平低于一定的阈值，则将干扰视为噪声来实现总容量。
Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) Gaussian interference channel in a low interference regime, where the interference levels are below certain thresholds. In this paper, such a low interference regime is characterized for multiple-input multiple-output (MIMO) Gaussian interference channels. Conditions are provided on the direct and cross channel gain matrices under which using Gaussian inputs and treating interference as noise at the receivers is sum ca…
Noisy-interference Sum-rate Capacity of Parallel Gaussian Interference Channels
并行高斯干扰信道的和速率容量是通过在子信道上独立传输并在每个子信道中将干扰视为噪声来实现的，如果信道系数和功率约束满足一定的条件。该条件要求干扰是弱的，这是通常在例如，数字用户线传输。最优功率分配的特点是使用的和速率容量作为功率约束的函数。
Interference alignment in the K-user MIMO interference channel with constant channel coefficients is considered. A novel constructive method for finding the interference alignment solution is proposed for the case where the number of transmit antennas equals the number of receive antennas (NT = NR = N), the number of transmitter-receiver pairs equals K = N + 1, and all interference alignment multiplexing gains are one. The core of the method consists of solving an eigenvalue problem that incorporates the channel matrices of all interfering links. This procedure provides insight into the feasib…
The capacity region of the one-sided Gaussian interference channel is established in the weak interference regime. To characterize this region, a new representation of the Han-Kobayashi inner bound for the one-sided Gaussian interference channel is first given. Next, a new outer bound on the capacity region of this channel is introduced which is tight in the weak interference regime. This is the first capacity region for any variant of the interference channel in the weak interference regime.
New sufficient conditions for a vector Gaussian interference channel to achieve the sum-rate capacity by treating interference as noise are derived, which generalize the existing results. More concise conditions for multiple-input-single-output, and single-input-multiple-output scenarios are obtained.
The diversity-multiplexing tradeoff (DMT) for interference networks, such as the interference channel, the X channel, the Z interference channel and the Z channel, is analyzed. In particular, we investigate the impact of rate-splitting and channel knowledge at the transmitters. We also use the DMT of the Z channel and the Z interference channel to distill insights into the "loud neighbor" problem for femto-cell networks.
This paper studies DoF of interference alignment in K-user MIMO interference channels.
In this paper, we propose low complexity opportunistic methods for interference alignment in $K$-transmitter MIMO interference channels by exploiting multiuser diversity. We do not assume availability of channel state information (CSI) at the transmitters. Receivers are required to feed back analog values indicating the extent to which the received interference subspaces are aligned. The proposed opportunistic interference alignment (OIA) achieves sum-rate comparable to conventional OIA schemes but with a significantly reduced computational complexity.
This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class of channels is determined. As with the Gaussian case, the sum-rate capacity is achieved by letting the transceiver pair subject to interference communicate at a rate such that its message can be decoded at the unintended receiver using single user detection. It is also established that this class of discrete memoryless interference channels is equivalent in c…
An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user Gaussian multiple-access channel where both users use a single linear code. The class of interference channels treated is such that all interference channel gains are rational. For this class of interference channels, beyond recovering the known results on the degrees of freedom, an explicit rate region is derived for finite signal-to-noise ratios, shedding light …
We consider a constant $K$-user Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver, denoted as a $(K,M,N)$ channel. Relying on a result on simultaneous Diophantine approximation, a real interference alignment scheme with joint receive antenna processing is developed. The scheme is used to provide new proofs for two previously known results, namely 1) the total degrees of freedom (DoF) of a $(K, N, N)$ channel is $NK/2$; and 2) the total DoF of a $(K, M, N)$ channel is at least $KMN/(M+N)$. We also derive the DoF region of the $(K,N,N)$ channel…
The interference relay channel (IRC) under strong interference is considered. A high-signal-to-noise ratio (SNR) generalized degrees of freedom (GDoF) characterization of the capacity is obtained. To this end, a new GDoF upper bound is derived based on a genie-aided approach. The achievability of the GDoF is based on cooperative interference neutralization. It turns out that the relay increases the GDoF even if the relay-destination link is weak. Moreover, in contrast to the standard interference channel, the GDoF is not a monotonically increasing function of the interference strength in the s…
On the Sum Capacity of A Class of Cyclically Symmetric Deterministic Interference Channels
某些确定性干扰信道已被证明可以在渐近低噪声状态下精确地模拟高斯干扰信道。出于这种对应关系，我们研究了一个K用户对，循环对称，确定性干扰信道中，每个接收器的经验，只从其相邻的发射机（Wyner模型）的干扰。我们建立了一个大的信道参数的总和容量，从而推广了以前的结果为2对的情况下。
We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The representative channels we consider are the ones that have clear interference alignment gain. For these channels, Z-channel type outer bounds are tight to within a constant gap from capacity. We present near-optimal achievable schemes based on rate-splitting and lattice alignment.
We propose a blind interference alignment (BIA) through staggered antenna switching scheme with no ideal channel assumption. Contrary to the ideal assumption that channels remain constant during BIA symbol extension period, when the coherence time of the channel is relatively short, channel coefficients may change during a given symbol extension period. To perform BIA perfectly with realistic channel assumption, we propose a grouping based supersymbol structure for $K$-user interference channels which can adjust a supersymbol length to given coherence time. It is proved that the supersymbol le…
An achievable rate region for certain noisy three-user-pair interference channels is proposed. The channel class under consideration generalizes the three-pair deterministic interference channel (3-DIC) in the same way as the Telatar-Tse noisy two-pair interference channel generalizes the El Gamal-Costa injective channel. Specifically, arbitrary noise is introduced that acts on the combined interference signal before it affects the desired signal. This class of channels includes the Gaussian case. The rate region includes the best-known inner bound on the 3-DIC capacity region, dominates treat…
Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in rate when insisting on zero error communication in the context of interference channels.
This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that for the Z-channel, i.e., when the secondary receiver experiences no interference and the primary receiver experiences strong interference, the proposed outer bound not only is the tightest among known bounds but is actually achievable for sufficiently strong interference. The latter is a novel capacity result that from numerical evaluations appears to be gene…
Communicating arbitrarily correlated sources over interference channels is considered in this paper. A sufficient condition is found for the lossless transmission of a pair of correlated sources over a discrete memoryless interference channel. With independent sources, the sufficient condition reduces to the Han-Kobayashi achievable rate region for the interference channel. For a special correlation structure (in the sense of Slepian-Wolf, 1973), the proposed region reduces to the known achievable region for interference channels with common information. A simple example is given to show that …
This paper studies a layered erasure model for two-user interference channels, which can be viewed as a simplified version of Gaussian fading interference channel. It is assumed that channel state information~(CSI) is only available at receivers but not at transmitters. Under such assumption, an outer bound is derived for the capacity region of such interference channel. The new outer bound is tight in many circumstances. For the remaining open cases, the outer bound extends previous results.
Interference Alignment and the Degrees of Freedom for the K User Interference Channel
虽然K个用户干扰信道的最公知的外边界规定不可能有多于K/2个自由度，但是已经证明，通常具有任意数量用户的恒定干扰信道只有一个自由度。在本文中，我们探索的空间自由度每正交的时间和频率维度的K个用户的无线干扰信道的信道系数采取不同的值跨频隙，但在时间上是固定的。我们回答五个密切相关的问题。首先，我们表明，K/2自由度可以通过信道设计来实现，即，如果允许节点选择最佳的常数，有限和非零信道系数值。其次，我们证明，如果信道系数不能由节点控制，而是由自然选择，即，从连续分布中随机抽取，K个用户干扰信道的空间自由度的总数几乎肯定是每个正交时间和频率维度的K/2。因此，由于对干扰信道上的发送和接收信号的分布式处理，仅损失了一半的空间自由度。第三，我们表明，干涉对齐和迫零足以实现所有的自由度在所有情况下。第四，我们表明，自由度$D$直接导致$\mathcal{O}(1)$容量表征的形式$C(SNR)=D\log(1+SNR)+\mathcal{O}(1)$的多址信道，广播信道，2用户干扰信道，2用户MIMO X信道和3用户干扰信道与M>1个天线在每个节点。第五，我们表征的自由度的好处，从认知共享的消息上的3个用户的干扰信道。
A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels
提出了高斯干扰信道容量域的一个新的外界。该界结合并改进了现有的基因辅助方法，并给出了本文定义的噪声干扰的总速率容量。具体地说，它表明，如果信道系数和功率约束满足一个简单的条件，那么在每个接收机的单用户检测是速率和最优的，即，将干扰视为噪声不会导致性能损失。这是第一个具体的（有限的信号噪声比）容量的高斯干扰信道的弱到中等干扰的结果。此外，对于某些混合（弱和强）干扰的情况下，新的外部边界给出了容量区域的角点。
In this paper, we study the effect of feedback on two-user MIMO interference channels. The capacity region of MIMO interference channels with feedback is characterized within a constant number of bits, where this constant is independent of the channel matrices. Further, it is shown that the capacity region of a MIMO interference channel with feedback and its reciprocal interference channel are within a constant number of bits. Finally, the generalized degrees of freedom region for the MIMO interference channel with feedback is characterized.
In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a constant gap regardless of channel parameters. These results are based on a layered modulo-lattice scheme which realizes distributed interference cancellation.
The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, we attain a line segment on the boundary of the capacity region. Moreover, the capacity region f…
Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied. The sum-capacity of this channel is characterized up to a constant number of bits. The coding scheme employed builds up on the superposition scheme of Han and Kobayashi (1981) for two-user interference channels without cooperation. New upperbounds to the sum-capacity are also derived.
We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We identify three regimes based on the channel parameters: weak, moderate, and strong interference regimes. Interestingly, this is similar to the generalized degrees of freedom of the two-user Gaussian interference channel where transmitters have perfect channel knowledge. We show that for the weak interference regime, treating interference as erasure is optimal whil…
In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound reduces to the capacity region of the deterministic broadcast channel and of the deterministic cognitive interference channel through nulling of certain channel inputs. It does not, however, reduce to that of certain deterministic interference channels for which capacity is known. As such, we subsequently tighten the bound for channels whose outputs satisfy an …
This paper studies a layered erasure interference channel model, which is a simplification of the Gaussian interference channel with fading using the deterministic model approach. In particular, the capacity region of the layered erasure one-sided interference channel is completely determined, assuming that the channel state information (CSI) is known to the receivers, but there is no CSI at transmitters (CSIT). The result holds for arbitrary fading statistics. Previous results of Aggarwal, Sankar, Calderbank and Poor on the capacity region or sum capacity under several interference configurat…
The K-user cyclic Z-interference channel models a situation in which the kth transmitter causes interference only to the (k-1)th receiver in a cyclic manner, e.g., the first transmitter causes interference only to the Kth receiver. The impact of noiseless feedback on the capacity of this channel is studied by focusing on the Gaussian cyclic Z-interference channel. To this end, the symmetric feedback capacity of the linear shift deterministic cyclic Z-interference channel (LD-CZIC) is completely characterized for all interference regimes. Using insights from the linear deterministic channel mod…
Interference management in a three-user interference channel with alternating connectivity with only topological knowledge at the transmitters is considered. The network has a Wyner-type channel flavor, i.e., for each connectivity state the receivers observe at most one interference signal in addition to their desired signal. Degrees of freedom (DoF) upper bounds and lower bounds are derived. The lower bounds are obtained from a scheme based on joint encoding across the alternating states. Given a uniform distribution among the connectivity states, it is shown that the channel has 2+ 1/9 DoF. …
This paper extends the literature on interference alignment to more general classes of deterministic channels which incorporate non-linear input-output relationships. It is found that the concept of alignment extends naturally to these deterministic interference channels, and in many cases, the achieved degrees of freedom (DoF) can be shown to be optimal.
The cognitive interference channel models cognitive overlay radio systems, where cognitive radios overhear the transmission of neighboring nodes. Capacity for this channel is not known in general. For the Gaussian case capacity is known in three regimes, usually denoted as the "weak interference", "very strong interference" and "primary decodes cognitive". This paper provides a new capacity result, based on rate-splitting of the primary user's message into a public and private part and that generalizes the capacity results in the "very strong interference" and "primary decodes cognitive" regim…
New Outer Bounds on the Capacity Region of Gaussian Interference Channels
最近的高斯干扰信道的容量区域上的外部边界被推广到$m$ -具有$m>2$和非对称功率和串扰系数的用户信道。再次示出的界限，给出高斯干扰信道的总速率容量与低功率和串扰系数。通过在每个接收机处使用单用户检测来实现容量，即，将干扰视为噪声不会导致性能损失。
This paper presents the achievable rate region frontiers for the n-user interference channel when there is no cooperation at the transmit nor at the receive side. The receiver is assumed to treat the interference as additive thermal noise and does not employ multiuser detection. In this case, the rate region frontier for the n-user interference channel is found to be the union of n hyper-surface frontiers of dimension n-1, where each is characterized by having one of the transmitters transmitting at full power. The paper also finds the conditions determining the convexity or concavity of the f…
While interference alignment schemes have been employed to realize the full multiplexing gain of $K$-user interference channels, the analyses performed so far have predominantly focused on the case when global channel knowledge is available at each node of the network. This paper considers the problem where each receiver knows its channels from all the transmitters and feeds back this information using a limited number of bits to all other terminals. In particular, channel quantization over the composite Grassmann manifold is proposed and analyzed. It is shown, for $K$-user multiple-input, mul…
Bargaining over the interference channel
在本文中，我们分析了干扰信道作为一种冲突的情况。这种观点意味着利率区域中的某些点对其中一个参与者来说是不合理的。因此，根据博弈论的考虑，这些点不能被认为是可以实现的。然后，我们建议使用纳什讨价还价的解决方案作为一种工具，提供首选点的边界上的博弈论利率区域。我们提供了使用FDM可实现速率区域的2x2干涉信道的分析。我们还概述了如何将我们的结果推广到其他可实现的速率区域的干扰信道以及多址接入信道。关键词：频谱优化，分布式协调，博弈论，干扰信道，多址信道。
The role of cooperation in managing interference - a fundamental feature of the wireless channel - is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full-duplex. The sum-capacity of this channel is obtained within a gap of a constant number of bits. The coding scheme used builds up on the superposition scheme of Han and Kobayashi (1981) for the two-user interference channel without cooperation. New upperbounds on the sum-capacity are also derived. The same coding scheme is shown to obtain the sum-capacity of the symme…
The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing achievable rate regions and outer bounds have been derived, some of which are tight under specific conditions. In this work we present a new unified inner bound for the discrete memoryless cognitive interference channel. We show explicitly how it encompasses all known discrete memoryless achievable rate regions as special cases. The presented achievable region …
In this work, we prove that a positive secure degree of freedom is achievable for a large class of Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wire-tap channel, the 2-user interference channel with confidential messages, the 2-user interference channel with an external eavesdropper. Best known achievable schemes to date for these channels use Gaussian signaling. In this work, we show that structured codes outperform Gaussian random codes at high SNR when channel gains are real numbers.
In this paper, we study the impact of different channel output feedback architectures on the capacity of the two-user interference channel. For a two-user interference channel, a feedback link can exist between receivers and transmitters in 9 canonical architectures (see Fig. 2), ranging from only one feedback link to four feedback links. We derive the exact capacity region for the symmetric deterministic interference channel and the constant-gap capacity region for the symmetric Gaussian interference channel for all of the 9 architectures. We show that for a linear deterministic symmetric int…
We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding schemes. We apply our achievability to two cases. First, we characterize the capacity region of a class of discrete memoryless interference relay channels. This class naturally generalizes the injective deterministic discrete memoryless interference channel by El Gamal and Costa and the deterministic discrete memoryless relay channel with orthogonal receive…
Han-Kobayashi achievable region is the best known inner bound for a general discrete memoryless interference channel. We show that the capacity region can be strictly larger than the Han-Kobayashi region for some channel realizations, and hence the strict sub-optimality of Han-Kobayashi achievable region.
Determining the feasibility conditions for vector space interference alignment in the K-user MIMO interference channel with constant channel coefficients has attracted much recent attention yet remains unsolved. The main result of this paper is restricted to the symmetric square case where all transmitters and receivers have N antennas, and each user desires d transmit dimensions. We prove that alignment is possible if and only if the number of antennas satisfies N>= d(K+1)/2. We also show a necessary condition for feasibility of alignment with arbitrary system parameters. An algebraic geometr…
The stable throughput region of the two-user interference channel is investigated here. First, the stability region for the general case is characterized. Second, we study the cases where the receivers treat interference as noise or perform successive interference cancelation. Finally, we provide conditions for the convexity/concavity of the stability region and for which a certain interference management strategy leads to broader stability region.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。