نتایج جستجو برای: capacity region
تعداد نتایج: 803377 فیلتر نتایج به سال:
We derive the ergodic (Shannon) capacity region of an M-user broadcast fading channel for code-division (CD), time-division (TD) and frequency-division (FD), assuming that both the transmitter and the receivers have perfect channel side information. It is shown that by allowing dynamic resource allocation, TD, FD and CD without successive decoding have the same ergodic capacity region and optim...
This paper studies the problem of interference channels with one cognitive transmitter (ICOCT) where “cognitive” is defined from both the noncausal and causal perspectives. For the noncausal ICOCT, referred to as interference channels with degraded message sets (IC-DMS), we propose a new achievable rate region that generalizes existing achievable rate regions for IC-DMS. In the absence of the n...
In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the best achievable capacity region for interference channel up to now, we have shown that the improved secure capacity region compared with [2] now is the whole H...
In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel ...
A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. This channel generalizes the multiple access channel (MAC) in that the two users also receive channel outputs, and hence may obtain t...
We show how to compute or at least to estimate various capacity-related quantities for bosonic Gaussian channels. Among these are the coherent information, the entanglement-assisted classical capacity, the one-shot classical capacity, and a quantity involving the transpose operation, shown to be a general upper bound on the quantum capacity, even allowing for finite errors. All bounds are expli...
One of the most surprising recent results in quantum Shannon theory is the superactivation of the quantum capacity of a quantum channel. This phenomenon has its roots in the extreme violation of additivity of the channel capacity and enables to reliably transmit quantum information over zerocapacity quantum channels. In this work we demonstrate a similar effect for the classical capacity of a q...
In this thesis we investigate the capacity of multi-user wireless communication channels. We first establish a duality relationship between the Gaussian broadcast and multiple-access channels. This relationship allows us to characterize the capacity region of the Gaussian broadcast channel in terms of the dual Gaussian multiple-access channel, and vice versa. This relationship holds for constan...
Energy efficiency is an important issue in mobile wireless networks since the battery life of mobile terminals is limited. We are considering, besides the energy consumed for transmission, the energy consumed by being in the ‘on’ state, which we term ‘processing energy’. This energy constitutes a considerable fraction of the total energy available to battery-limited wireless devices, hence it i...
Previous work on the classical information capacities of bosonic channels has established the capacity of the single-user pure-loss channel, bounded the capacity of the single-user thermal-noise channel, and bounded the capacity region of the multiple-access channel. The latter is a multiple-user scenario in which several transmitters seek to simultaneously and independently communicate to a si...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید