4,270 research outputs found
Approximate Sum-Capacity of K-user Cognitive Interference Channels with Cumulative Message Sharing
This paper considers the K user cognitive interference channel with one
primary and K-1 secondary/cognitive transmitters with a cumulative message
sharing structure, i.e cognitive transmitter knows non-causally
all messages of the users with index less than i. We propose a computable outer
bound valid for any memoryless channel. We first evaluate the sum-rate outer
bound for the high- SNR linear deterministic approximation of the Gaussian
noise channel. This is shown to be capacity for the 3-user channel with
arbitrary channel gains and the sum-capacity for the symmetric K-user channel.
Interestingly. for the K user channel having only the K th cognitive know all
the other messages is sufficient to achieve capacity i.e cognition at
transmitter 2 to K-1 is not needed. Next the sum capacity of the symmetric
Gaussian noise channel is characterized to within a constant additive and
multiplicative gap. The proposed achievable scheme for the additive gap is
based on Dirty paper coding and can be thought of as a MIMO-broadcast scheme
where only one encoding order is possible due to the message sharing structure.
As opposed to other multiuser interference channel models, a single scheme
suffices for both the weak and strong interference regimes. With this scheme
the generalized degrees of freedom (gDOF) is shown to be a function of K, in
contrast to the non cognitive case and the broadcast channel case.
Interestingly, it is show that as the number of users grows to infinity the
gDoF of the K-user cognitive interference channel with cumulative message
sharing tends to the gDoF of a broadcast channel with a K-antenna transmitter
and K single-antenna receivers. The analytical additive additive and
multiplicative gaps are a function of the number of users. Numerical
evaluations of inner and outer bounds show that the actual gap is less than the
analytical one.Comment: Journa
Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages
A new achievable rate region is given for the Gaussian cognitive many-to-one
interference channel. The proposed novel coding scheme is based on the
compute-and-forward approach with lattice codes. Using the idea of decoding
sums of codewords, our scheme improves considerably upon the conventional
coding schemes which treat interference as noise or decode messages
simultaneously. Our strategy also extends directly to the usual many-to-one
interference channels without cognitive messages. Comparing to the usual
compute-and-forward scheme where a fixed lattice is used for the code
construction, the novel scheme employs scaled lattices and also encompasses key
ingredients of the existing schemes for the cognitive interference channel.
With this new component, our scheme achieves a larger rate region in general.
For some symmetric channel settings, new constant gap or capacity results are
established, which are independent of the number of users in the system.Comment: To appear in IEEE Transactions on Information Theor
On the Statistics of Cognitive Radio Capacity in Shadowing and Fast Fading Environments (Journal Version)
In this paper we consider the capacity of the cognitive radio channel in
different fading environments under a low interference regime. First we derive
the probability that the low interference regime holds under shadow fading as
well as Rayleigh and Rician fast fading conditions. We demonstrate that this is
the dominant case, especially in practical cognitive radio deployment
scenarios. The capacity of the cognitive radio channel depends critically on a
power loss parameter, , which governs how much transmit power the
cognitive radio dedicates to relaying the primary message. We derive a simple,
accurate approximation to in Rayleigh and Rician fading environments
which gives considerable insight into system capacity. We also investigate the
effects of system parameters and propagation environment on and the
cognitive radio capacity. In all cases, the use of the approximation is shown
to be extremely accurate.Comment: Submitted to the IEEE Transactions on Wireless Commun. The conference
version of this paper appears in Proc. IEEE CrownCom, 200
Flexible Backhaul Design and Degrees of Freedom for Linear Interference Networks
The considered problem is that of maximizing the degrees of freedom (DoF) in
cellular downlink, under a backhaul load constraint that limits the number of
messages that can be delivered from a centralized controller to the base
station transmitters. A linear interference channel model is considered, where
each transmitter is connected to the receiver having the same index as well as
one succeeding receiver. The backhaul load is defined as the sum of all the
messages available at all the transmitters normalized by the number of users.
When the backhaul load is constrained to an integer level B, the asymptotic per
user DoF is shown to equal (4B-1)/(4B), and it is shown that the optimal
assignment of messages to transmitters is asymmetric and satisfies a local
cooperation constraint and that the optimal coding scheme relies only on
zero-forcing transmit beamforming. Finally, an extension of the presented
coding scheme is shown to apply for more general locally connected and
two-dimensional networks.Comment: Submitted to IEEE International Symposium on Information Theory (ISIT
2014
On the Average Rate of HARQ-Based Quasi-Static Spectrum Sharing Networks
Spectrum sharing networks are communication setups in which unlicensed secondary users are permitted to work within the spectrum resources of primary licensees. Considering quasi-static fading environments, this paper studies the effect of hybrid automatic repeat request (HARQ) feedback on the average rate of unlicensed spectrum sharing channels. The results are obtained for different scenarios; Under both peak and average secondary user transmission power constraints, the channel average rate is determined under primary user limited received interference power conditions when there is perfect information about the interference available at the secondary user transmitter. An approximate solution for power allocation between incremental redundancy (INR) HARQ-based data retransmissions is proposed which can be applied in single-user networks as well. Then, we investigate the effect of imperfect secondary-primary channel state information on the interference-limited average rate of the secondary channel. Finally, we restudy all mentioned scenarios in the case where the data transmission is constrained to have limited outage probability. Substantial performance improvement is observed with even a single HARQ-based retransmission in all simulations
- …