Citation Context

...ieves the symmetric GDoF for each user. This result is generalized to K-user fully-connected symmetric Gaussian interference channels in [8] and to cyclic asymmetric Gaussian interference channels in =-=[9]-=-. However, not much is known about the regime where TIN is GDoF-optimal for the general fully-connected, fully-asymmetric K-user Gaussian interference channel. In this work we present a general condit...

Citation Context

...pacity to within 0.5 bits is derived. All of the achievable schemes are based on the above optimized simple HK scheme. The generalization to the K-user case (K > 3) is also discussed. In related work =-=[10]-=-, Zhou and Yu considered a similar channel model named cyclic GIC where the Etkin-Tse-Wang scheme was shown to achieve the capacity region to within some constant number of bits in the weak interferen...

Citation Context

...an approximate capacity region is an open problem beyond two-user IC, although capacity regions have been found in some special cases like double-Z [23], oneto-many [24], many-to-one [24], and cyclic =-=[25]-=- ICs. In the presence of feedback, an approximate capacity region for the two-user SISO IC was recently given in [8], where the capacity region is characterized within two bits. It was shown that the ...

Citation Context

...ised of a cyclically ordered subset of users where each user causes interference only to the preceding user and suffers interference only from the following user in the cycle. As shown by Zhou et al. =-=[24]-=- and translated into the GDoF setting by Geng et al. in [5], the sumGDoF of a cyclic interference sub-network is simply the sum of all desired link strengths minus the sum of all cross link strengths....

Citation Context

...ith specific connectivity [14], [15], sum-capacity itself is not fully characterized. Recently, the approximate capacity was derived for a K-user Gaussian IC with specific cyclic interference pattern =-=[19]-=-. However, in this kind of interference channel, the key problem of interference alignment does not arise. A new achievable rate region evaulated for a fully-connected 3-user deterministic IC by ‘inte...

Citation Context

... IC (a fully connected IC where all the direct links have strength SNR and all interfering links have strength INR) is the same as for the 2-user case and is given by the so-called W-curve of [2]. In =-=[6]-=- it was shown that the gDoF of the cyclic symmetric Z-channel (a very sparse IC where all the direct links have strength SNR and each receiver experiences interference from one transmitter only with s...

Citation Context

...pacity to within 0.5 bits is derived. All of the achievable schemes are based on the above optimized simple HK scheme. The generalization to the K-user case (K > 3) is also discussed. In related work =-=[10]-=-, Zhou and Yu considered a similar channel model named cyclic GIC where the Etkin-Tse-Wang scheme was shown to achieve the capacity region to within some constant number of bits in the weak interferen...

Citation Context

...n approximate capacity region is an open problem beyond two-user IC, although capacity regions have been found in some special cases like double-Z [23], one-to-many [24], many-to-one [24], and cyclic =-=[25]-=- ICs. In the presence of feedback, an approximate capacity region for the two-user SISO IC was recently given in [8], where the capacity region is characterized within two bits. It was shown that the ...

Citation Context

...nd open problem. Although the exact capacity is not known even for the simplest form, the 2-user SISO IC, inspiring approximations [2], [3], achievable rate regions [4], [5] and capacity regions [6]– =-=[8]-=- and outerbounds are available [9]–[12]. There are several approaches to tackle this intriguing problem. We give some representable results in the following. The capacity of the two-user SISO IC is on...