Search

This paper investigates the interference nulling capability of reconfigurable intelligent surface (RIS) in a multiuser environment where multiple single-antenna transceivers communicate simultaneously in a shared spectrum. From a theoretical perspective, we show that when the channels between the RIS and the transceivers have line-of-sight and the direct paths are blocked, it is possible to adjust the phases of the RIS elements to null out all the interference completely and to achieve the maximum $K$ degrees-of-freedom (DoF) in the overall $K$ -user interference channel, provided that the number of RIS elements exceeds some finite value that depends on $K$. Algorithmically, for any fixed channel realization we formulate the interference nulling problem as a feasibility problem, and propose an alternating projection algorithm to efficiently solve the resulting nonconvex problem with local convergence guarantee. Numerical results show that the proposed alternating projection algorithm can null all the interference if the number of RIS elements is only slightly larger than a threshold of $2K(K-1)$. For the practical sum-rate maximization objective, this paper proposes to use the zero-forcing solution obtained from alternating projection as an initial point for subsequent Riemannian conjugate gradient optimization and shows that it has a significant performance advantage over random initializations. For the objective of maximizing the minimum rate, this paper proposes a subgradient projection method which is capable of achieving excellent performance at low complexity. [ABSTRACT FROM AUTHOR]

This paper investigates the Gaussian state-dependent interference channel (IC) and Z-IC, in which two receivers are corrupted respectively by two different but correlated states that are noncausally known to two transmitters but are unknown to the receivers. Three interference regimes are studied, and the capacity region boundary or the sum capacity boundary is characterized either fully or partially under various channel parameters. In particular, the impact of the correlation between states on cancellation of state and interference as well as achievability of capacity is explored with numerical illustrations. For the very strong interference regime, the capacity region is achieved by the scheme where the two transmitters implement a cooperative dirty paper coding. For the strong but not very strong interference regime, the sum-rate capacity is characterized by rate splitting, layered dirty paper coding, and successive cancellation. For the weak interference regime, the sum-rate capacity is achieved via dirty paper coding individually at two receivers as well as treating interference as noise. This paper also provides the achievable region for the state-dependent IC with each state known at its corresponding transmitter. [ABSTRACT FROM AUTHOR]

This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: 1) each user wishes to communicate an independent message to the common receiver; and 2) the two encoders send a common message to the receiver and the non-cognitive encoder (i.e., the encoder that does not know the state) sends an independent individual message (this model is also known as the MAC with degraded message sets). For both scenarios, new outer bounds on the capacity region are derived, which improve uniformly over the best known outer bounds. In the first scenario, the two corner points of the capacity region as well as the sum rate capacity are established, and it is shown that a single-letter solution is adequate to achieve both the corner points and the sum rate capacity. Furthermore, the full capacity region is characterized in situations in which the sum rate capacity is equal to the capacity of the helper problem. The proof exploits the optimal-transportation idea of Polyanskiy and Wu (which was used previously to establish an outer bound on the capacity region of the interference channel) and the worst case Gaussian noise result for the case in which the input and the noise are dependent. [ABSTRACT FROM AUTHOR]

This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, suboptimal decoding rules that have been used in the literature (e.g., joint typicality decoding, treating interference as noise, and so on). The fact that the interfering signal is a codeword, rather than an i.i.d. noise process, complicates the application of conventional techniques of performance analysis of the optimum decoder. In addition, unfortunately, these conventional techniques result in loose bounds. Using analytical tools rooted in statistical physics, as well as advanced union bounds, we derive single-letter formulas for the random coding error exponents. We compare our results with the best known lower bound on the error exponent, and show that our exponents can be strictly better. Then, in the second part of this paper, we consider more complicated coding ensembles and find a lower bound on the error exponent associated with the celebrated Han–Kobayashi random coding ensemble, which is based on superposition coding. [ABSTRACT FROM AUTHOR]

This paper studies simultaneous wireless information and power transfer in a K-user multiple-input multiple-output interference channel. A new scheme jointly designing interference alignment (IA) and wireless energy harvesting is proposed. Firstly, the character of each receiver is determined according to the maximum achievable rate and maximum harvested power. The receiving users are used as either energy harvesting (EH) users or information decoding (ID) users, where EH users are used to harvest energy, and ID users are used to transmit information. Secondly, the doubleobjective problem is established by maximizing both the total power harvested by EH users and the total signal-tointerference- noise ratio (SINR) of the ID users. The problem is solved by the weighted sum method. Moreover, the transmit precoding matrices and the receive interference suppression matrices are solved by iterative optimization algorithm based on a complete IA constraint (IOA-CIA). Simulation results show that the proposed IOA-CIA algorithm provides higher sum rate and harvested power than the existing algorithm. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of coordinating several agents through their actions, focusing on an asymmetric observation structure with two agents. Specifically, one agent knows the past, present, and future realizations of a state that affects a common payoff function, while the other agent either knows the past realizations of nothing about the state. In both cases, the second agent is assumed to have strictly causal observations of the first agent’s actions, which enables the two agents to coordinate. These scenarios are applied to distributed power control; the key idea is that a transmitter may embed information about the wireless channel state into its transmit power levels so that an observation of these levels, e.g., the signal-to-interference-plus-noise ratio, allows the other transmitter to coordinate its power levels. The main contributions of this paper are twofold. First, we provide a characterization of the set of feasible average payoffs when the agents repeatedly take long sequences of actions and the realizations of the system state are i.i.d.. Second, we exploit these results in the context of distributed power control and introduce the concept of coded power-control. We carry out an extensive numerical analysis of the benefits of coded power control over alternative power-control policies, and highlight a simple yet non-trivial example of a power control code. [ABSTRACT FROM PUBLISHER]

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-interference channel with secrecy constraint at the receiver is considered. The paper proposes novel achievable schemes, where the schemes differ from each other based on how the key has been used in the encoding process. The first achievable scheme uses a combination of key rate splitting, one-time pad, stochastic encoding and superposition coding. In this scheme, one part of the key is used for one-time pad and the remaining part of the key is used for stochastic encoding. The encoding is performed such that the receiver experiencing interference can decode some part of the interference without violating the secrecy constraint. As a special case of the derived result, one can obtain the secrecy rate region when the key is completely used for one-time pad or part of the stochastic encoding. The second scheme uses the shared key to encrypt the message using one-time pad and in contrast to the previous case no interference is decoded at the receiver. The paper also derives outer bound on the sum rate and secrecy rate. The main novelty of deriving outer bound lies in the selection of side information provided to the receiver and using the secrecy constraint. The derived outer bounds are found to be tight for certain channel conditions and rate of the key. The scaling behaviour of key rate is also explored for different schemes using the notion of secure generalized degrees of freedom. The optimality of different schemes are characterized for some specific cases. The developed results show the importance of key rate splitting in enhancing the secrecy performance of the system. [ABSTRACT FROM AUTHOR]

This paper studies multi-user multi-cell visible light communications networks in which each cell is composed of multiple light emitting diode (LED) arrays. The use of multiple LED transmitters enables each cell to support multiple users by means of precoding techniques. In such multi-user multi-cell networks, the signal for each user can be severely interfered not only by the signals that are intended to other users in the same cell, i.e., intra-cell interference, but also by the signals for users of the other cells, i.e., inter-cell interference. While intra-cell interference can be handled by the underlying precoding scheme, it is hard to deal with the inter-cell one. This paper focuses on cell coordination/cooperation strategies and their corresponding coordinated/cooperative precoder designs as the approaches to alleviate, or possibly, to cancel out the inter-cell interference. We first derive lower and upper bounds on the capacity of Gaussian interference channels with amplitude constraints on the input and the interference. Capitalizing on derived bounds and the zero-forcing scheme as the underlying precoding technique, optimal coordinated/cooperative precoding designs to maximize users’ sum-rate are investigated under the non-negativity and amplitude-limited constraints on the channel inputs. The comprehensive numerical results are presented to compare the performance of the considered coordination/cooperation strategies. [ABSTRACT FROM AUTHOR]

Interference alignment (IA) has been shown as an important technique to achieve a linear capacity scaling in wireless communications. However, the IA scheme over finite signaling dimensions for a general multiple-input-multiple-output (MIMO) X channel is still rarely studied. The main challenge of MIMO X channels is that the two sets of conditions for IA, namely the interference nulling conditions and the rank preservation conditions, get coupled. The usual IA methods for the interference channel and the broadcasting channel cannot be applied anymore. In this paper, we show that the rank preservation conditions can be replaced by a group of specific rank conditions, under which the IA problem is simplified. Then, based on this technique, an iterative algorithm of IA is designed for the MIMO X channel. The algorithm is designed with limited signaling dimensions. From the simulation results, we find that the algorithm has good performances even under limited signal-to-noise ratio. [ABSTRACT FROM AUTHOR]

Over the past decade, the bulk of wireless traffic has shifted from speech to content. This shift creates the opportunity to cache part of the content in memories closer to the end users, for example in base stations. Most previous paper focuses on the reduction of load in the backhaul and core networks due to caching, i.e., on the benefits caching offers for the wireline communication link between the origin servers and the caches. In this paper, we are instead interested in the benefits caching can offer for the wireless communication link between the caches and the end users. To quantify the gains of caching for this wireless link, we consider an interference channel in which each transmitter is equipped with an isolated cache memory. Communication takes place in two phases, a content placement phase followed by a content delivery phase. The objective is to design both the placement and the delivery phases to maximize the rate in the delivery phase in response to any possible user demands. Focusing on the three-user case, we show that through careful joint design of these phases, we can reap three distinct benefits from caching: a load balancing gain, an interference cancellation gain, and an interference alignment gain. In our proposed scheme, load balancing is achieved through a specific file splitting and placement, producing a particular pattern of content overlap at the caches. This overlap allows to implement interference cancellation. Furthermore, it allows us to create several virtual transmitters, each transmitting a part of the requested content, which increases interference-alignment possibilities. [ABSTRACT FROM AUTHOR]

This paper investigates the symmetric degrees of freedom (DoF) of multiple-input multiple-output (MIMO) cellular networks with $G$ cells and $K$ users per cell, having $N$ antennas at each base station and $M$ antennas at each user. In particular, we investigate techniques for achievability that are based on either decomposition with asymptotic interference alignment or linear beamforming schemes and show that there are distinct regimes of $(G,K,M,N)$ , where one outperforms the other. We first note that both one-sided and two-sided decomposition with asymptotic interference alignment achieve the same DoF. We then establish specific antenna configurations under which the DoF achieved using decomposition-based schemes is optimal by deriving a set of outer bounds on the symmetric DoF. Using these results, we completely characterize the optimal DoF of any $G$ -cell network with single-antenna users. For linear beamforming schemes, we first focus on small networks and propose a structured approach to linear beamforming based on a notion called packing ratios. Packing ratio describes the interference footprint or shadow cast by a set of transmit beamformers and enables us to identify the underlying structures for aligning interference. Such a structured beamforming design can be shown to achieve the optimal spatially normalized DoF (sDoF) of two-cell two-user/cell network and the two-cell three-user/cell network. For larger networks, we develop an unstructured approach to linear interference alignment, where transmit beamformers are designed to satisfy conditions for interference alignment without explicitly identifying the underlying structures for interference alignment. The main numerical insight of this paper is that such an approach appears to be capable of achieving the optimal sDoF for MIMO cellular networks in regimes where linear beamforming dominates asymptotic decomposition, and a significant portion of sDoF elsewhere. Remarkably, polynomial identity test appears to play a key role in identifying the boundary of the achievable sDoF region in the former case. [ABSTRACT FROM AUTHOR]

In this paper, we study a wireless powered communication network (WPCN) in a general $N$ -user interference channel (IFC), where a hybrid access-point (H-AP) in each cell supports its corresponding user. In this multi-cell environment, the H-AP first sends the energy signal to charge users in the downlink (DL) phase, while in the subsequent uplink (UL) phase, each user transmits its information signal to the corresponding H-AP utilizing the previously harvested energy. For the WPCN in this IFC scenario, cross-link interference occurs due to asynchronous time allocation of the DL and the UL among $N$ cells which significantly affects the overall performance. To handle the interference issue efficiently, we jointly optimize the DL and UL time allocation of each cell as well as the transmit power allocation at the H-APs and the users so that the weighted sum-rate of UL information transmission is maximized. To tackle non-convexity of the weighted sum-rate maximization problem, we propose an iterative algorithm where the time allocation and the transmit power are updated based on the weighted minimum mean square error criteria and the gradient projection method, respectively. Furthermore, we consider two simple protocols where the DL time allocation of each cell is synchronized and present resource allocation method, respectively. In simulation results, we verify that the proposed algorithm for the asynchronous protocol outperforms conventional schemes. [ABSTRACT FROM AUTHOR]

In this paper, an intelligent probing method for interference constraint learning is proposed to allow a centralized cognitive radio network (CRN) to access the frequency band of a primary user (PU) in an underlay cognitive communication scenario. The main idea is that the CRN probes the PU and subsequently eavesdrops the reverse PU link to acquire the binary ACK/NACK packet. This feedback is implicit channel state information of the PU link, indicating whether the probing-induced interference is harmful or not. The intelligence of this sequential probing process lies in the selection of the power levels of the secondary users, which aims to minimize the number of probing attempts, a clearly active learning (AL) procedure, and expectantly the overall PU QoS degradation. The enhancement introduced in this paper is that we incorporate the probability of each feedback being correct into this intelligent probing mechanism by using a multivariate Bayesian AL method. This technique is inspired by the probabilistic bisection algorithm and the deterministic cutting plane methods (CPMs). The optimality of this multivariate Bayesian AL method is proven and its effectiveness is demonstrated through numerical simulations. Computationally cheap CPM adaptations are also presented, which outperform existing AL methods. [ABSTRACT FROM PUBLISHER]

This paper considers a K-user multiple-input multiple-output (MIMO) interference channel (IC) where 1) the channel state information obtained by the transmitters (CSIT) is completely outdated and 2) the number of transmit antennas at each transmitter, i.e., M is greater than the number of receive antennas at each user, i.e., N. The usefulness of the delayed CSIT was first identified in a K-phase retrospective interference alignment (RIA) scheme proposed by Maddah-Ali and Tse for the multiple-input single-output broadcast channel, but the extension to the MIMO IC is a non-trivial step as each transmitter only has the message intended for the corresponding user. Recently, Abdoli et al. focused on a single-input single-output IC and solved such bottleneck by inventing a K-phase RIA with distributed overheard interference retransmission. In this paper, we propose two K-phase RIA schemes suitable for the MIMO IC by generalizing and integrating some key features of both Abdoli's and Maddah-Ali's works. The two schemes jointly yield the best known sum degrees-of-freedom (DoF) performance so far. For the case (M/N)≥K, the achieved sum DoF is asymptotically given by (64/15)N when K→∞. [ABSTRACT FROM PUBLISHER]

This paper studies the achievable throughput performance of the cognitive uplink under a limited primary cooperation scenario wherein the primary base station cannot feed back all interference channel gains to the secondary base station. To cope with the limited primary cooperation, we propose a feedback protocol called K -out-of- N feedback protocol, in which the primary base station feeds back only the KN smallest interference channel gains, out of N of them, to the secondary base station. We characterize the throughput performance under the K -out-of- N feedback protocol by analyzing the achievable multiuser diversity gains (MDGs) in cognitive uplinks for three different network types. Our results show that the proposed feedback mechanism is asymptotically optimum for interference-limited (IL) and individual-power-and-interference-limited (IPIL) networks for a fixed positive KN . It is further shown that the secondary network throughput in the IL and IPIL networks (under both the full and limited cooperation scenarios) logarithmically scales with the number of users in the network. In total-power-and-interference-limited (TPIL) networks, on the other hand, the K -out-of- N feedback protocol is asymptotically optimum for {K_{N}}= N^\delta , where \delta \in \left ({0,1}\right )$ . We also show that, in TPIL networks, the secondary network throughput under both the limited and full cooperation scales logarithmically double with the number of users in the network. These results indicate that the cognitive uplink can achieve the optimum MDG even with limited cooperation from the primary network. They also establish the dependence of pre-log throughput scaling factors on the distribution of fading channel gains for different network types. [ABSTRACT FROM AUTHOR]

The beamforming techniques have been recently studied as possible enablers for underlay spectrum sharing. The existing beamforming techniques have several common limitations: they are usually system model specific, cannot operate with arbitrary number of transmit/receive antennas, and cannot serve arbitrary number of users. Moreover, the beamforming techniques for underlay spectrum sharing do not consider the interference originating from the incumbent primary system. This paper extends the common underlay sharing model by incorporating the interference originating from the incumbent system into generic combined beamforming design that can be applied on interference, broadcast, or multiple access channels. This paper proposes two novel multiuser beamforming algorithms for user fairness and sum rate maximization, utilizing newly derived convex optimization problems for transmit and receive beamformers calculation in a recursive optimization. Both beamforming algorithms provide efficient operation for the interference, broadcast, and multiple access channels, as well as for arbitrary number of antennas and secondary users in the system. Furthermore, this paper proposes a successive transmit/receive optimization approach that reduces the computational complexity of the proposed recursive algorithms. The results show that the proposed complexity reduction significantly improves the convergence rates and can facilitate their operation in scenarios, which require agile beamformer computation. [ABSTRACT FROM AUTHOR]

This paper shows that for the two-user Gaussian interference channel (G-IC) treating interference as noise without time sharing (TINnoTS) achieves the closure of the capacity region to within either a constant gap, or to within a gap of the order O(\log (\ln (\min ( \mathsf S, \mathsf I))/\gamma )) up to a set of Lebesgue measure \gamma \in (0,1] , where {\mathsf {S}} is the largest signal to noise ratio on the direct links and {\mathsf {I}}$ is the largest interference to noise ratio on the cross links. As a consequence, TINnoTS is optimal from a generalized degrees of freedom (gDoF) perspective for all channel gains except for a subset of zero measure. TINnoTS with Gaussian inputs is known to be optimal within 1/2 bit for a subset of the weak interference regime. Rather surprisingly, this paper shows that TINnoTS is gDoF optimal in all parameter regimes, even in the strong and very strong interference regimes where joint decoding of Gaussian inputs is optimal. For approximate optimality of TINnoTS in all parameter regimes, it is critical to use non-Gaussian inputs. This paper thus proposes to use mixed inputs as channel inputs for the G-IC, where a mixed input is the sum of a discrete and a Gaussian random variable. Interestingly, with reference to the Han–Kobayashi achievable scheme, the discrete part of a mixed input is shown to effectively behave as a common message in the sense that, although treated as noise, its effect on the achievable rate region is as if it were jointly decoded together with the desired messages at a non-intended receiver. The practical implication is that a discrete interfering input is a friend, while an Gaussian interfering input is in general a foe. This paper also discusses other practical implications of the proposed TINnoTS scheme with mixed inputs. Since TINnoTS requires neither explicit joint decoding nor time sharing, the results of this paper are applicable to a variety of oblivious or asynchronous channels, such as the block asynchronous G-IC (which is not an information stable channel) and the G-IC with partial codebook knowledge at one or more receivers. [ABSTRACT FROM AUTHOR]

In this paper, we determine the entire secure degrees of freedom (s.d.o.f.) regions of the $K$ -user Gaussian multiple access (MAC) wiretap channel and the $K$ -user interference channel (IC) with secrecy constraints. For the IC, we consider three secrecy constraints: K-user IC with an external eavesdropper (IC-EE), K-user IC with confidential messages (IC-CM), and their combination Kuser IC with confidential messages and external eavesdropper (IC-CM-EE). The converse for the IC includes constraints both due to secrecy as well as due to interference. For the IC, although the portion of the region close to the optimum sum s.d.o.f. point is governed by the upper bounds due to secrecy constraints, the other portions of the region are governed by the upper bounds due to interference constraints. Different from the existing literature, in order to fully understand the characterization of the s.d.o.f. region of the IC, one has to study the four-user case, i.e., the two- or three-user cases do not illustrate the full generality of the problem. In order to prove the achievability, we use the polytope structure of the converse region. In both MAC and IC cases, we develop explicit schemes that achieve the extreme points of the polytope region given by the converse. In particular, the extreme points of the MAC region are achieved by an $m$ -user MAC wiretap channel with $K-m$ helpers, i.e., by setting $K-m$ users’ secure rates to zero and utilizing them as pure (structured) cooperative jammers. The extreme points of the IC region are achieved by a $(K-m)$ -user IC with confidential messages, $m$ helpers, and $N$ external eavesdroppers, for $m\ge 1$ and a finite $N$ . A byproduct of our results in this paper is that the sum s.d.o.f. is achieved only at one extreme point of the s.d.o.f. region, which is the symmetric-rate extreme point, for both MAC and IC channel models. [ABSTRACT FROM AUTHOR]

In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this paper, we show an interesting observation that adding a helper can totally remove the penalty in sum GDoF for a two-user symmetric Gaussian interference channel. For the interference channel where each transmitter sends a message to an intended receiver without secrecy constraints, the sum GDoF is a well-known “W” curve, characterized by Etkin–Tse–Wang in 2008. If the secrecy constraints are imposed on this interference channel, where the message of each transmitter must be secure from the unintended receiver (eavesdropper), then a GDoF penalty is incurred and the secure sum GDoF is reduced to a modified “W” curve, derived by Chen recently. In this paper, we show that, by adding a helper into this interference channel with secrecy constraints, the secure sum GDoF turns out to be a “W” curve, which is the same as the sum GDoF of the setting without secrecy constraints. The proposed scheme is based on the cooperative jamming and a careful signal design such that the jamming signal of the helper is aligned at a specific direction and power level with the information signals of the transmitters, which allows us to totally remove the penalty in GDoF due to the secrecy constraints. Furthermore, the estimation approaches of noise removal and signal separation due to the rational independence are used in the secure rate analysis. [ABSTRACT FROM AUTHOR]

This paper proposes a Gaussian mixture message passing (GMMP) scheme to implement the blind known-interference cancellation (BKIC). Being aware of interference data as a priori information, the BKIC aims at canceling the interference without estimating the interference channel. Since the target signals are represented by continuous real-valued variables, the previous BKIC scheme is constructed as a real-valued belief propagation (RBP) for implementing message passing on the factor graph that represents the corresponding signal model. To implement the RBP-BKIC, the real-valued variables are actually quantized into vectors of discrete values. As such, the quantized RBP-BKIC has some drawbacks: 1) its performance is determined by the quantization step size and 2) it can only be applied to real signaling with 1-D PAM modulations. To overcome these drawbacks, we propose a GMMP scheme for the BKIC. First, we reveal that all messages passing over the factor graph of BKIC systems can be exactly represented by the mixtures of weighted Gaussian probability density functions. Superior to the quantized RBP-BKIC, we further show that the proposed GMMP scheme is an exact and efficient solution to the BKIC. In particular, it can approach performances of point-to-point communication systems with complex QAM modulations at the cost of affordable computational complexities. Moreover, we put forth a message passing framework that combines the GMMP-BKIC and the channel decoding into an iterative message passing scheme. [ABSTRACT FROM AUTHOR]

In this paper, we study the number of different interference alignment (IA) solutions in a $K$ -user multiple-input multiple-output (MIMO) interference channel, when the alignment is performed via beamforming and no symbol extensions are allowed. We focus on the case where the number of IA equations matches the number of variables. In this situation, the number of IA solutions is finite and constant for any channel realization out of a zero-measure set and, as we prove in this paper, it is given by an integral formula that can be numerically approximated using Monte Carlo integration methods. More precisely, the number of alignment solutions is the scaled average of the determinant of a certain Hermitian matrix related to the geometry of the problem. Interestingly, while the value of this determinant at an arbitrary point can be used to check the feasibility of the IA problem, its average (properly scaled) gives the number of solutions. For single-beam systems, the asymptotic growth rate of the number of solutions is analyzed and some connections with classical combinatorial problems are presented. Nonetheless, our results can be applied to arbitrary interference MIMO networks, with any number of users, antennas, and streams per user. [ABSTRACT FROM PUBLISHER]

The degrees of freedom (DoFs) of the $K$ -user Gaussian interference channel determine the asymptotic growth of the maximal sum rate as a function of the signal-to-noise ratio. Subject to a very general sufficient condition on the cross-channel gains, we give a formula for the DoFs of the scalar interference channel as a function of the deterministic channel matrix, which involves maximization of a sum of information dimensions over $K$ scalar input distributions. Known special cases are recovered, and even generalized in certain cases with unified proofs. [ABSTRACT FROM PUBLISHER]

This paper studies the interference channel with a cognitive relay under delayed feedback. Three types of delayed feedback are studied: delayed channel state information at the transmitter, delayed output feedback, and delayed Shannon feedback. Outer bounds are derived for the degrees of freedom (DoF) region of the two-user multiple-input multiple-output interference channel with a cognitive relay with delayed feedback as well as without feedback. For the single-input single-output scenario, optimal schemes are proposed based on retrospective interference alignment. It is shown that while a cognitive relay without feedback cannot improve the sum-DoF in the two-user single-input single-output interference channel, delayed feedback in the same scenario can increase the sum-DoF to $4/3$ . For the multiple-input multiple-output case, achievable schemes are obtained via extensions of retrospective interference alignment, leading to the DoF regions that meet the respective upper bounds. [ABSTRACT FROM AUTHOR]

Consider a multi-user channel, where each user has a large but non-replenishable bit pool to transmit. Completion time refers to the number of channel uses spent by each user to complete its transmission. In this paper, an information-theoretic formulation of completion time is based on the concept of constrained rates, which are defined over possibly different number of channel uses. Analogous to the capacity region, the completion time region characterizes all possible trade-offs among users’ completion times. For a two-user multi-access channel, it is shown that the completion time region is achieved by operating the channel in two independent phases: a multi-access phase when both users are transmitting, and a point-to-point phase when one user has finished and the other is still transmitting. Using a similar two-phase approach, the completion time regions (or inner and outer bounds) are established for a two-user Gaussian broadcast channel and a two-user Gaussian interference channel. It is observed that although consisting of two convex subregions, the completion time region may not be convex in general. Finally, optimization problems of minimizing the weighted sum completion time for a Gaussian multi-access channel and a Gaussian broadcast channel are solved, demonstrating the utility of the completion time approach. [ABSTRACT FROM PUBLISHER]

We establish the degrees of freedom (DoF) region for the multiple-input multiple-output (MIMO) two-transmitter, and two-receiver ( $2 \times 2$ ) interference network with a general message set consisting of nine messages, one for each pair of a subset of transmitters at which that message is known and a subset of receivers where that message is desired. An outer bound on the general nine-message $2 \times 2$ interference network is obtained and it is shown to be tight, thereby establishing the DoF region for the most general antenna setting wherein the four nodes have an arbitrary number of antennas each. The DoF-optimal scheme is applicable to the MIMO $2 \times 2$ interference network with constant channel coefficients, and hence, a fortiori, to time/frequency varying channel scenarios. In particular, a linear precoding scheme is proposed that can achieve all the DoF tuples in the DoF region. In it, the precise roles played by transmit zero-forcing, interference alignment, random beamforming, symbol extensions, and asymmetric complex signaling (ACS) are delineated. For instance, we identify a class of antenna settings, in which ACS is required to achieve the fractional-valued corner points. Evidently, the DoF regions of all previously unknown cases of the $2 \times 2$ interference network with a subset of the nine-messages are newly established as special cases of the general result of this paper. For instance, the DoF region of the well-known four-message (and even three-message) MIMO $X$ channel is newly established. This problem had remained open despite previous studies, which had found inner and outer bounds that were not tight in general. Hence, the DoF regions of all special cases obtained from the general DoF region of the nine-message $2\times 2$ interference network of this paper that include at least three of the four $X$ channel messages are new, among many others. This paper sheds light on how the same physical $2 \times 2$ interference network could be used by a suitable choice of message sets to take most advantage of the channel resource in a flexible and efficient manner. [ABSTRACT FROM PUBLISHER]

In this paper, we study the average sum DoF of cached interference networks over random user requests. First, we derive a closed-form average sum DoF upper bound of the cached interference channels over all possible caching and transmission strategies. Then, we propose an online cache content placement algorithm to maximize the achievable average sum DoF without explicit knowledge of the popularity of the content files. We show that the gap between the DoF upper bound and an achievable DoF is small for some typical scenarios. Moreover, we quantify the DoF gain due to caching with respect to some important system parameters. We show that large DoF gain over interference network without cache is possible even if the number of files $L\rightarrow \infty$ . Both simulation and analysis indicate that the proposed scheme has significant gains over various baselines. [ABSTRACT FROM PUBLISHER]

In this paper, the fundamental limits of simultaneous information and energy transmission in the two-user Gaussian interference channel with and without perfect channel-output feedback are approximated by two regions in each case, i.e., an achievable region and a converse region. When the energy transmission rate is normalized by the maximum energy rate, the approximation is within a constant gap. In the proof of achievability, the key idea is the use of power-splitting between two signal components: an information-carrying component and a no-information component. The construction of the former is based on random coding arguments, whereas the latter consists of a deterministic sequence known by all transmitters and receivers. The proof of the converse is obtained via cut-set bounds, genie-aided channel models, Fano’s inequality, and some concentration inequalities considering that channel inputs might have a positive mean. Finally, the energy transmission enhancement due to feedback is quantified and it is shown that feedback can at most double the energy transmission rate at high signal-to-noise ratios. [ABSTRACT FROM AUTHOR]

To improve diversity gain in an interference channel and hence to maximize diversity multiplexing tradeoff (DMT), we propose an on-off switched interference alignment (IA) where IA is intermittently utilized by switching IA on/off. For on-off switching, either IA with symbol extension or IA with Alamouti coding is adopted in this paper. Deriving and analyzing DMT of the proposed schemes, we reveal that the intermittent utilization of IA with simultaneous non-unique decoding can improve DMT in the 2-user X-channel with two antennas. Both proposed schemes are shown to achieve a diversity gain of 4 and DoF per user of $\frac {4}{3}$. In particular, the on-off switched IA with Alamouti coding, to the best of our knowledge, surpasses any other existing schemes for the 2-user X-channel with two antennas and nearly approaches the ideal DMT. [ABSTRACT FROM AUTHOR]

In the presence of perfect channel state information (CSI), the achievable degrees of freedom (DoF) in wireless interference networks can be linearly scaled up with the number of users. Achievability is based on the idea of interference alignment (IA). However, in the presence of imperfect CSI, the sum rate becomes degraded, and full DoF may no longer be achievable. In this paper, we propose novel least squares (LS)- and minimum mean square error (MMSE)-based IA schemes that adaptively design beamformers by relying on the availability of imperfect CSI and knowledge of the channel estimation error variance in advance. Interestingly and unlike the other robust algorithms, the proposed adaptive schemes do not impose extra computational complexity compared to their nonadaptive counterparts. It is shown that the LS-based IA is able to outperform interference leakage minimization algorithms under both perfect and imperfect CSI. Furthermore, we compare the performance of the proposed MMSE-based IA with maximum signal-to-interference-plus-noise ratio (Max-SINR) algorithm. We show that while under perfect CSI, the MMSE-based IA achieves the same performance as that of Max-SINR, the former outperforms the latter under CSI mismatch. Meanwhile, it is shown that the proposed MMSE-based IA needs less CSI to be available and has less computational complexity compared to Max-SINR. [ABSTRACT FROM PUBLISHER]

In this paper, the $\eta $ -Nash equilibrium ( $\eta $ -NE) region of the two-user Gaussian interference channel (IC) with perfect output feedback is approximated to within 1 bit/s/Hz and $\eta $ arbitrarily close to 1 bit/s/Hz. The relevance of the $\eta $ -NE region is that it provides the set of rate pairs that are achievable and stable in the IC when both transmitter–receiver pairs autonomously tune their own transmit–receive configurations seeking an $\eta $ -optimal individual transmission rate. Therefore, any rate tuple outside the $\eta $ -NE region is not stable as there always exists one link able to increase by at least $\eta $ bits/s/Hz its own transmission rate by updating its own transmit–receive configuration. The main insights that arise from this paper are as follows. First, the $\eta $ -NE region achieved with feedback is larger than or equal to the $\eta $ -NE region without feedback. More importantly, for each rate pair achievable at an $\eta $ -NE without feedback, there exists at least one rate pair achievable at an $\eta $ -NE with feedback that is weakly Pareto superior. Second, there always exists an $\eta $ -NE transmit–receive configuration that achieves a rate pair that is at most 1 bit/s/Hz per user away from the outer bound of the capacity region. [ABSTRACT FROM PUBLISHER]

This paper presents two analog precoder feedback (PFB) schemes namely the simple PFB (SPFB) scheme and the reduced PFB (RPFB) scheme for interference channels. In the first scheme, each destination transmits full precoder, while in the second one, the size of the precoder to be fed back is reduced by removing the redundant rows of the precoder matrix. This reduced feedback is particularly useful in the systems, where the number of transmit antennas are more than the number of receive antennas. These schemes have been analyzed for the cases where time slots in the feedback duration are independent of the number of users and where the time slots scale linearly with the number of users. For both these schemes, the precoder reconstruction methods are investigated using the chordal distance. For interference alignment, the rate loss upper bound analysis shows that the rate loss increases with signal-to-noise-ratio (SNR) at low SNR, while it remains constant in high SNR range. Simulation results verify that the linear sum rate scaling is preserved at high SNRs. The full precoder feedback dominates, when the source cooperation is assumed, while RPFB yields improvements over SPFB scheme, when no source cooperation is assumed and $Kd$ time slots are utilized in either orthogonal or independent transmission case. [ABSTRACT FROM AUTHOR]

Nonorthogonal multiple access (NOMA) has been considered as a promising technology for fifth-generation wireless communication systems. In this paper, we consider a two-cell multiple-input-multiple-output NOMA downlink interference channel with one multiantenna base station (BS) and multiple multiantenna users in each cell. Each user treats interferences from adjacent cell as additional noises and does not attempt to decode them. This paper aims to design interference channel beamformers to maximize weighted sum capacity of the strongest users in two cells under quality of service requirements at other users and transmit power budget constraint at each BS. Such problem is complicated and nonconvex due to the expression of a logarithm of a determinant $(\log \det)$ minus $\log \det$ in the objective function and constraints. For the nonconvex problem, we put forward a successive convex approximation (SCA) based iterative algorithm. Since the computational complexity of SCA-based iterative algorithm is high, we also put forward an efficient majorization-minimization based iterative algorithm. Based on simulation results, we show that our developed NOMA schemes are superior to the zero-forcing-based NOMA, orthogonal-NOMA, and orthogonal multiple access schemes. [ABSTRACT FROM AUTHOR]

We investigate the benefits of incorporating relays in future multi-user wireless networks that seek to exploit unexplored bands of very high frequency spectrum, where transmitted signals are known to be highly susceptible to outages. To this end, we examine a two-user bursty MIMO Gaussian interference channel with an in-band relay, where Bernoulli random states conceptually capture signal outages. As our main result, we show that an in-band relay can provide a degrees of freedom (DoF) gain in this bursty channel. This beneficial role of in-band relays in the bursty channel is in direct contrast to their role in the non-bursty channel which is not as significant to provide a DoF gain. More importantly, we demonstrate that in certain antenna configurations, an in-band relay can help achieve interference-free performances with increased DoF. We find the benefits particularly substantial in high-outage circumstances, as the DoF gain can grow linearly with the number of antennas at the relay. In this paper, first we derive an outer bound from which we obtain a necessary condition for interference-free DoF performances. Then we develop a novel scheme that exploits information of the bursty channel states to achieve them. [ABSTRACT FROM AUTHOR]

Interference has been a key challenge to wireless networks. As a fundamental transmission unit, the Gaussian interference channel (GIC) provides much insight on understanding the optimal transmission policy and the transmission limit over wireless networks. This paper investigates the multiple-layer power allocation of GIC that maximizes the system sum-rate. First, we derive the optimal signal-layer power allocation and the corresponding sum-rate in closed form for all cases of weak interference GIC based on the rate splitting scheme. Theoretical result indicates that: 1) In low power and asymmetric power regimes, the rate splitting scheme degrades to the pure public or private message transmission at transmitters and simple successive decoding process is efficient enough at receivers and 2) the signal-layer sum-rate is not concave for weak interference GIC and a frequency division scheme brings strict positive sum-rate gain for some power constraints. Second, we specify the relationship between the optimal bandwidth-power allocation of the frequency division scheme and the concave envelope of signal-layer sum-rate in the subband-layer. Finally, considering general GIC with time-varying flat fading, we present an optimal channel-state-layer power allocation associated with rate splitting and frequency division. Numerical results demonstrate that the comprehensive power allocation over the signal-layer, the frequency subbands, and the channel states can largely increase the sum-rate of weak interference GIC in most scenarios. [ABSTRACT FROM PUBLISHER]

In order to gain new insights into multiple-input–multiple-output (MIMO) interference networks, the optimality of \sum k=1^{K} Mk/2 (half the cake per user) degrees of freedom is explored for a K -user MIMO interference channel where the cross-channels have arbitrary rank constraints, and the k th transmitter and receiver are equipped with Mk antennas each. The result consolidates and significantly generalizes results from prior studies by Krishnamurthy et al., of rank-deficient interference channels where all users have M antennas; and by Tang et al., of full rank interference channels where the $k$ th user pair has M_{k} antennas. The broader outcome of this paper is a novel class of replication-based outer bounds for arbitrary rank-constrained MIMO interference networks where replicas of existing users are added as auxiliary users and the network connectivity is chosen to ensure that any achievable scheme for the original network also works in the new network. The replicated network creates a new perspective of the problem, so that even simple arguments such as user cooperation become quite powerful when applied in the replicated network, giving rise to stronger outer bounds, than when applied directly in the original network. Remarkably, the replication-based bounds are broadly applicable not only to MIMO interference channels with arbitrary rank-constraints, but much more broadly, even beyond Gaussian settings. [ABSTRACT FROM PUBLISHER]

Inspired by the promising potentialof reconfigurable intelligent surface (RIS)-based transmission, this paper investigates the RIS-aided vehicle-to-everything (V2X) communication system with the social trust, where multiple vehicle-to-infrastructure (V2I) links share the spectrum with vehicle-to-vehicle (V2V) links. Subject to the reliability constraint of V2V links, the sum V2I link capacity is maximized, through jointly optimizing the power allocation, RIS reflection coefficients and spectrum allocation. The formulated mix-integer and non-convex problem is effectively converted into three subproblems, which can be iteratively solved by our proposed three-stage joint resource allocation and RIS optimization (JRARO) algorithm. Simulation results demonstrate the effectiveness of the proposed algorithm, and that the RIS can significantly improve the quality of vehicular communications in terms of the sum V2I capacity. [ABSTRACT FROM AUTHOR]

Recent results have shown that feedback can significantly increase the capacity of interference networks. This paper considers the impact of noise on such gains due to feedback. In particular, this paper considers the two-user linear deterministic interference channel with noisy feedback, as a stepping stone to characterize the approximate capacity region for the two-user Gaussian interference channel with noisy feedback. First, the capacity region for the symmetric linear deterministic interference channel with noisy feedback is obtained. It is shown that noisy feedback enlarges the capacity region if and only if the number of feedback bits l is greater than a certain threshold l^{*} . It is found that, excluding the regime ({1}/{2}) \leq \alpha \leq 2 , where \alpha is the normalized interference level, in which even full feedback does not increase symmetric capacity, this threshold l^{*} is equal to the per-user symmetric capacity without feedback. One of the key ideas is a novel converse outer bounding technique for the weighted sum rates 2R_{1} + R_{2}$ and R_{1} + 2R_{2} . These results and the techniques developed for the linear deterministic model are then applied to characterize inner bounds and outer bounds for the symmetric Gaussian interference channel with noisy feedback. The outer bounds are shown to be at most 4.7 b/s/Hz away from the achievable rate region. As a corollary, the generalized-degrees-of-freedom region, which approximates the capacity region of the symmetric Gaussian interference channel at high SNR, is found. [ABSTRACT FROM PUBLISHER]

This paper considers a multiple-input-multiple-output (MIMO) cognitive radio network, where secondary users (SUs) equipped with multiple antennas coexist with a primary user (PU). Joint power allocation and transmission beamforming design is proposed to optimize the network energy efficiency under power constraint and interference temperature constraint. Distributed algorithm that maximizes energy efficiency of each individual node is derived through fractional programming. Simulation results are presented to validate the convergence and effectiveness of the proposed algorithm. [ABSTRACT FROM PUBLISHER]

In spectrum underlay cognitive radio networks, secondary users (SUs) are allowed to reuse the spectrum allocated to a primary system. The interference between SUs actually carries information and can potentially be exploited to improve the network performance through information-theoretic interference processing. In this paper, we design an optimal joint power and rate control algorithm that maximizes the secondary system utility subject to the interference temperature constraints of primary users based on the capacity-approaching interference processing scheme called as the Han-Kobayashi scheme. The optimal solution is difficult to achieve because the optimization problem is in general non-convex. To make the optimization problem tractable, this paper first transforms the problem into a monotonic optimization problem through exploiting its hidden monotonicity. We then devise an effective algorithm to obtain the global optimal solution to the joint power and rate control problem in the Han-Kobayashi scheme. The key idea behind the proposed algorithm is to construct a sequence of shrinking polyblocks that approximate the upper boundary of the feasible region with increasing precision. Numerical results further show that the achieved utility of our scheme significantly outperforms the utility of conventional schemes which treat the interference between SUs as the noise. [ABSTRACT FROM PUBLISHER]

This paper characterizes the sum-capacity of the ergodic fading Gaussian overlay cognitive interference channel (EGCIFC), a time-varying channel with two source–destination pairs in which a primary/licensed transmitter and a secondary/cognitive transmitter share the same spectrum and where the cognitive transmitter has noncausal knowledge of the primary user's message. The throughput/sum-capacity is characterized under the assumption of perfect knowledge of the instantaneous fading states at all terminals, which are assumed to form an ergodic process. A genie-aided outer bound on the sum-capacity is developed and then matched with an achievable scheme, thereby completely characterizing the sum-capacity of the EGCIFC. The power allocation policy that maximizes the sum-capacity is derived. It is shown that the sum-capacity achieving scheme for an EGCIFC is “separable” in all regimes (i.e., coding across fading states is not necessary), as opposed to the classical interference channel. Extensions to the whole capacity region are discussed. As a capacity achieving scheme for the EGCIFC under certain channel gain conditions, and as a topic of independent interest, the ergodic capacity of a point-to-point multiple-input–single-output channel with per-antenna power constraints and with perfect channel state information at all terminals is also derived. [ABSTRACT FROM PUBLISHER]

This paper studies and derives new results for the interference channel with a relay (ICR). Three inner bounds for the discrete memoryless ICR are proposed, based on three coding strategies that employ layered code at the relay. The first scheme is inspired by layered noisy network coding, proposed by Lim et al. for the two-way relay channel, the second and the third schemes rely on simpler encoding and decoding processes, dubbed layered quantize-forward. Performance of the proposed schemes is investigated for two classes of channels with Gaussian noise: the interference channel with in-band relay reception/out-of-band relay transmission and the interference with in-band relay reception/in-band relay transmission. For the former class of channels, it is shown that the first proposed scheme achieves the same inner bound as the generalized hash-forward scheme with incremental binning. In addition, the inner bound is within 0.5 bit of the capacity region under certain conditions on the channel parameters. For the latter class of channels, new upper bounds on sum-rate are established by extending known upper bounds for symmetric channels. The first inner bound is shown to be within 0.5 bit of the capacity region if the relay’s power exceeds a certain threshold, which depends on channel parameters. Numerical examples show that the proposed schemes can achieve significantly higher sum-rates when compared with other compress-forward schemes. Analysis also reveals a tradeoff between achievable rates, coding delay, and complexity of the proposed schemes. Results in this paper provide a better understanding of coding for the ICR, in particular, they show that layered coding is a beneficial element in multiuser networks with relays. [ABSTRACT FROM AUTHOR]

In this paper, capacity bounds for the two-user interference channels with cooperative receivers via conferencing links of finite capacities are investigated. Capacity results known for these communication scenarios are limited to a very few special cases of the one-sided channels. One of the challenges in obtaining capacity limits of such cooperative networks is how to establish efficient capacity outer bounds for them. In this paper, by applying new techniques, novel capacity outer bounds are established for the interference channels with conferencing receivers. Using the outer bounds, several new capacity results are proved for interesting channels with unidirectional cooperation in strong and mixed interference regimes. A conferencing link (between receivers) may be utilized to provide a receiver with “information about its desired signal” or “information about its interfering signal”. It is demonstrated that both strategies can be helpful to achieve capacity. Finally, for the case of Gaussian interference channel with conferencing receivers, it is argued that our outer bound is strictly tighter than the previous one derived by Wang and Tse. [ABSTRACT FROM AUTHOR]

So-called improper complex signals have been shown to be beneficial in the single-antenna two-user Gaussian interference channel under the assumptions that all input signals are Gaussian and that we treat interference as noise (TIN). This result has been obtained under a restriction to pure strategies without time-sharing, and it was extended to the case where the rates, but not the transmit powers, may be averaged over several transmit strategies. In this paper, we drop such restrictions and discuss the most general case of coded time-sharing, where both the rates and the powers may be averaged. Since coded time-sharing can in general not be expressed by means of a convex hull of the rate region, we have to account for the possibility of time-sharing already during the optimization of the transmit strategy. By means of a novel channel enhancement argument, we prove a surprising result: proper signals are optimal if coded time-sharing is allowed. In addition to establishing this result, we present an algorithm to compute the corresponding achievable rate region. [ABSTRACT FROM AUTHOR]

Low latency and high reliability are key features of the fifth-generation (5G) machine-type communications. In this paper, we provide a stringently delay-constrained model for multi-user interference channel, and formulate the rate and power allocation problem based on Markov decision process (MDP), which is solved by value iteration algorithm. In particular, to make timely transmission of each packet after being encoded, we characterize the delay constraint on sum of buffering delay and transmission delay. Then, the rate splitting and group decoding are employed at transmitters and receivers, respectively, which can offer significant improvement of achievable rate region. In addition, we also consider the receiving latency and propose novel delay-constrained partial group decoding (DC-CPGD), where all desired messages can be decoded within allowable interference cancellation steps to effectively control this latency. Two rate allocation algorithms are proposed with limited information exchange. Numerical results demonstrate that the proposed DC-CPGD can perform close to exhaustive search, and the proposed MDP-based adaptive transmission combined with DC-CPGD can significantly reduce the transmission cost under stringent delay requirement. [ABSTRACT FROM AUTHOR]

In this paper, we consider $K$ –user interference channels with $M$ antennas per node and with backhaul collaboration in one side (among the transmitters or among the receivers), for $M,K\in \mathbb {N}$ , and investigate the tradeoff between the rate in the channel versus the communication load in the backhaul. In this investigation, each node is equipped with $M$ antennas and we focus on a first order approximation result, where the rate of the wireless channel is measured by the degrees of freedom (DoF) per user, and the load of the backhaul is measured by the entropy of backhaul messages per user normalized by $\log $ of transmit power, at high power regimes. This tradeoff is fully characterized for the case of even values of $K$ and approximately characterized for the case of odd values of $K$ , with vanishing approximation gap as $K$ grows. To achieve DoF of $M$ per user, this result establishes the asymptotic optimality of the most straightforward scheme, called central processing, in which the messages are collected at one of the nodes, centrally processed, and forwarded back to each node. In addition, this result shows that the gain of the schemes, relying on distributed processing, through pairwise communication among the nodes (e.g., cooperative alignment) does not scale with the size of the network. For the converse, we develop a new outer-bound on the tradeoff based on splitting the set of collaborative nodes (transmitters or receivers) into two subsets and assuming full cooperation within each group. We further present a sufficient condition on the wireless channel connectivity, which although more relaxed, guarantees the validity of the above tradeoff. Finally, we show that verifying this condition takes a polynomial time in the network size. [ABSTRACT FROM AUTHOR]

In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$ -user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider both active and passive IRSs. While both types of IRS can attenuate the amplitude and change the phase of a reflected electromagnetic wave, active IRSs are also capable of amplifying the wave. We derive inner and outer bounds for the DoF region and lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of an active IRS and prove that the maximum value of $K$ for the sum DoF can be achieved if the number of IRS elements exceeds a certain finite value. The analysis framework developed for active IRSs forms the basis for our analysis of passive IRS-assisted systems. In particular, we present probabilistic inner and outer bounds for the DoF region and probabilistic lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of a passive IRS and prove that the lower bound for the sum DoF asymptotically approaches $K$ as the number of IRS elements grows large. [ABSTRACT FROM AUTHOR]

We consider the $K$ -user Multiple Input Multiple Output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver. It is assumed that channel coefficients are constant real numbers and are available at all transmitters and at all receivers. The main objective of this paper is to characterize the number of Degrees of Freedom (DoF) of this channel. Using the real interference alignment technique introduced in Motahari et al., 2014, we show that $\frac {MN}{M+N} K$ degrees of freedom can be achieved for almost all channel realizations. Also, a new upper-bound on the DoF of this channel is provided. This upper-bound coincides with our achievable DoF for $K\geq K_{u} \triangleq \frac {M+N}{\gcd (M,N)}$ , where $\gcd (M,N)$ denotes the greatest common divisor of $M$ and $N$. This gives an exact characterization of DoF for $M\times N$ MIMO Gaussian interference channel in the case of $K\geq K_{u}$. Since there is no cooperation between transmit (or receive) antennas of each user in our transmission scheme, this result shows that the DoF benefit of joint processing in collocated antennas vanishes when the number of users is greater than a certain threshold. [ABSTRACT FROM AUTHOR]

This paper reconsiders the design of blind interference alignment (BIA) for $K$-user MISO interference channel in which each receiver is equipped with a reconfigurable antenna of preset $M_k\geq 3$ modes. Beyond the degree of freedom (DoF)-oriented BIA (D-BIA) design proposed by Lu et al., we further take into account the frequency of mode switching within one supersymbol frame. Even though every receiving antenna is reconfigurable with preset multiple modes, from an engineering perspective, it is of practical importance for each receiving antenna to make less number of mode switching in order to gain the benefits such as less switching power consumption and less signal distortion. To this end, we propose in this paper switching-oriented BIA (S-BIA) scheme, which preserves the same degree of freedom (DoF) gain as D-BIA while offering reduced mode switching frequency. Theoretical analysis and simulation results demonstrate that, compared to D-BIA, S-BIA can gain $100/(M-1)$ percent of switching saving when $M_k = M$ is odd for all transmitters. Remarkably, S-BIA offers 50% switching saving for multiuser $3\times 1$ interference channels. [ABSTRACT FROM AUTHOR]

In this paper, a spectrum-band selection scheme is developed for secondary users (SUs) in underlay spectrum-sharing networks to balance the performance between SUs and primary users (PUs) while guaranteeing PUs' priority. With the developed scheme, among multiple candidate spectrum bands, a given secondary transmitter (ST) is scheduled to access the spectrum band with minimum ratio of the ST–PU channel power gain to the SU link channel power gain. To evaluate this scheme, the SU's performance is investigated concerning its service delay. Under the constraint on average interference from the ST to PUs, the ST's optimal power allocation is obtained in a closed form to achieve the maximum effective capacity (EC) over SU links. Illustrative numerical results and asymptotic discussions substantiate the validity of our derivations and, moreover, demonstrate that, for the case of stringent delay requirements but loose average interference constraint, the band-selection scheme developed in this paper achieves better performance than both the selection of the band with maximum SU link channel power gain and that with minimum ST–PU channel power gain. [ABSTRACT FROM PUBLISHER]