Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Degrees of Freedom in Cognitive Radio Channels
97
0
0.0
(
0
)
Added by
Natasha Devroye
Publication date
2007
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
After receiving useful peer comments, we would like to withdraw this paper.
rate research
Read More
Previous work showed that the X network with M transmitters, N receivers has MN/(M+N-1) degrees of freedom. In this work we study the degrees of freedom of the X network with secrecy constraints, i.e. the X network where some/all messages are confidential. We consider the $M times N$ network where all messages are secured and show that N(M-1)/(M+N-1) degrees of freedom can be achieved. Secondly, we show that if messages from only M-1 transmitters are confidential, then MN/(M+N-1) degrees of freedom can be achieved meaning that there is no loss of degrees of freedom because of secrecy constraints. We also consider the achievable secure degrees of freedom under a more conservative secrecy constraint. We require that messages from any subset of transmitters are secure even if other transmitters are compromised, i.e., messages from the compromised transmitter are revealed to the unintended receivers. We also study the achievable secure degrees of freedom of the K user Gaussian interference channel under two different secrecy constraints where 1/2 secure degrees of freedom per message can be achieved. The achievable scheme in all cases is based on random binning combined with interference alignment.
We explore the capacity and generalized degrees of freedom of the two-user Gaussian X channel, i.e. a generalization of the 2 user interference channel where there is an independent message from each transmitter to each receiver. There are three main results in this paper. First, we characterize the sum capacity of the deterministic X channel model under a symmetric setting. Second, we characterize the generalized degrees of freedom of the Gaussian X channel under a similar symmetric model. Third, we extend the noisy interference capacity characterization previously obtained for the interference channel to the X channel. Specifically, we show that the X channel associated with noisy (very weak) interference channel has the same sum capacity as the noisy interference channel.
The Maddah-Ali and Tse (MAT) scheme is a linear precoding strategy that exploits Interference Alignment and perfect, but delayed, channel state information at the transmitters (delayed CSIT), improving the degrees of freedom (DoF) that can be achieved for the broadcast channel (BC). Since its appearance, many works have extended the concept of Retrospective Interference Alignment (RIA) to other multi-user channel configurations. However, little is known about the broadcast channel with multiple cells, i.e. the interference broadcast channel (IBC). In this work, the DoF are studied for the $K$-user $C$-cell multiple-input single-output (MISO) IBC with delayed CSIT (with $K/C$ users per cell). We show that the straightforward application of the MAT scheme over the IBC fails because it requires all interference to be received from the same source. Hence, in this case not all the interference can be cancelled, thus blocking the decoding of the received messages. We call this phenomenon as textit{interference coupling}, forcing to use the MAT scheme by serving just one cell at a time. In this work, we propose an extension, namely the uncoupled MAT scheme (uMAT), exploiting multiple cells, uncoupling the interference, and achieving the best known DoF inner bound for almost all settings.
We characterize the generalized degrees of freedom of the $K$ user symmetric Gaussian interference channel where all desired links have the same signal-to-noise ratio (SNR) and all undesired links carrying interference have the same interference-to-noise ratio, ${INR}={SNR}^alpha$. We find that the number of generalized degrees of freedom per user, $d(alpha)$, does not depend on the number of users, so that the characterization is identical to the 2 user interference channel with the exception of a singularity at $alpha=1$ where $d(1)=frac{1}{K}$. The achievable schemes use multilevel coding with a nested lattice structure that opens the possibility that the sum of interfering signals can be decoded at a receiver even though the messages carried by the interfering signals are not decodable.
In this paper, we explore the benefits, in the sense of total (sum rate) degrees of freedom (DOF), of cooperation and cognitive message sharing for a two-user multiple-input-multiple-output (MIMO) Gaussian interference channel with $M_1$, $M_2$ antennas at transmitters and $N_1$, $N_2$ antennas at receivers. For the case of cooperation (including cooperation at transmitters only, at receivers only, and at transmitters as well as receivers), the DOF is $min {M_1+M_2, N_1+N_2, max(M_1, N_2)), max(M_2, N_1)}$, which is the same as the DOF of the channel without cooperation. For the case of cognitive message sharing, the DOF is $min {M_1+M_2, N_1+N_2, (1-1_{T2})((1-1_{R2}) max(M_1, N_2) + 1_{R2} (M_1+N_2)), (1-1_{T1})((1-1_{R1}) max(M_2, N_1) + 1_{R1} (M_2+N_1)) }$ where $1_{Ti} = 1$ $(0)$ when transmitter $i$ is (is not) a cognitive transmitter and $1_{Ri}$ is defined in the same fashion. Our results show that while both techniques may increase the sum rate capacity of the MIMO interference channel, only cognitive message sharing can increase the DOF. We also find that it may be more beneficial for a user to have a cognitive transmitter than to have a cognitive receiver.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
