The Experts below are selected from a list of 174840 Experts worldwide ranked by ideXlab platform
Shlomo Shamai - One of the best experts on this subject based on the ideXlab platform.
-
ISIT - On the Capacity Region of the Poisson interference channels
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Lifeng Lai, Yingbin Liang, Shlomo ShamaiAbstract:The Poisson interference channel is studied, which models optical communication systems with multiple transceivers. Conditions for the strong interference is characterized and the corresponding Capacity Region is given, which is the same as that of the compound Poisson multiple access channel with each receiver decoding both messages. For the cases when the strong interference conditions are not satisfied, inner and outer bounds on the Capacity Region are derived. Finally, numerical results are provided to illustrate the derived Regions.
-
secrecy Capacity Region of fading broadcast channels
International Symposium on Information Theory, 2007Co-Authors: Yingbin Liang, H V Poor, Shlomo ShamaiAbstract:The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy Capacity Region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy Capacity Region are derived. In particular, the secrecy Capacity Region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy Capacity results are then applied to give the ergodic secrecy Capacity Region for the fading BCC.
-
Secrecy Capacity Region of Parallel Broadcast Channels
2007 Information Theory and Applications Workshop, 2007Co-Authors: Yingbin Liang, H V Poor, Shlomo ShamaiAbstract:The parallel broadcast channel with confidential messages (BCC) is investigated, where a source node transmits to two receivers (receivers 1 and 2) over multiple independent subchannels. The source node has common information for both receivers, and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The secrecy Capacity Region of the parallel BCC is established. It is shown that independent input distribution for each subchannel is optimal. It is also shown that the secrecy Capacity Region of the parallel BCC can be larger than the sum of the secrecy Capacity Regions of the subchannels. The secrecy Capacity Region is further derived for the parallel BCC with degraded subchannels. Applications of these results to the fading BCC are also discussed.
-
ISIT - Secrecy Capacity Region of Fading Broadcast Channels
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Yingbin Liang, H V Poor, Shlomo ShamaiAbstract:The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy Capacity Region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy Capacity Region are derived. In particular, the secrecy Capacity Region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy Capacity results are then applied to give the ergodic secrecy Capacity Region for the fading BCC.
-
the Capacity Region of the gaussian mimo broadcast channel
International Symposium on Information Theory, 2004Co-Authors: H. Weingarten, Yossef Steinberg, Shlomo ShamaiAbstract:The dirty paper coding rate Region is shown to be the Capacity Region of the Gaussian MIMO broadcast channel. To that end, a new notion of an enhanced broadcast channel is introduced.
Andrea Goldsmith - One of the best experts on this subject based on the ideXlab platform.
-
The Capacity Region of the Degraded Finite-State Broadcast Channel
IEEE Transactions on Information Theory, 2010Co-Authors: Ron Dabora, Andrea GoldsmithAbstract:We introduce and study the discrete, finite-state broadcast channel (FSBC) with memory. For this class of channels we define physical degradedness and stochastic degradedness, and demonstrate these definitions with practical communication scenarios. We then show that a superposition codebook with memory achieves the Capacity Region of physically degraded FSBCs. This result is subsequently used to characterize the Capacity Region of stochastically degraded FSBCs. In both scenarios, we consider indecomposable as well as nonindecomposable channels.
-
The Capacity Region of the Degraded Finite-State Broadcast Channel
arXiv: Information Theory, 2008Co-Authors: Ron Dabora, Andrea GoldsmithAbstract:We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which we derive the Capacity Region. We then define the stochastically degraded finite-state broadcast channel and derive the Capacity Region for this scenario as well. In both scenarios we consider the non-indecomposable finite-state channel as well as the indecomposable one.
-
ITW - The Capacity Region of the degraded finite-state broadcast channel
2008 IEEE Information Theory Workshop, 2008Co-Authors: Ron Dabora, Andrea GoldsmithAbstract:We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which we derive the Capacity Region. We then define the stochastically degraded finite-state broadcast channel and derive the Capacity Region for this scenario as well. In both scenarios we consider the non-indecomposable finite-state channel as well as the indecomposable one.
-
on the Capacity Region of the vector fading broadcast channel with no csit
International Conference on Communications, 2004Co-Authors: Syed A Jafar, Andrea GoldsmithAbstract:We develop an upperbound on the Capacity Region of an isotropic fading vector broadcast channel in terms of the Capacity Region of a scalar fading broadcast channel. Using this upperbound we prove the optimality of the Alamouti scheme [1] in a broadcast setting and extend the recent results [2] on the Capacity Region of the fading scalar non-degraded broadcast channel to fading vector non-degraded broadcast channels. The upperbound is fundamental in that it makes no assumption regarding the distribution of the users' channel magnitudes, the distribution of the additive noise, or the amount of channel information available at the receiver. The scalar upperbound explicitly characterizes the loss of degrees of freedom in a vector broadcast channel when the transmitter has no information about the "direction" of the users' channel vectors.
-
vector mac Capacity Region with covariance feedback
International Symposium on Information Theory, 2001Co-Authors: Syed A Jafar, Sriram Vishwanath, Andrea GoldsmithAbstract:We analyze the Capacity Region for the multiple access channel with multiple transmit and receive antennas. For Rayleigh fading with perfect channel state information at the receiver (CSIR) and only a knowledge of the spatial correlations at the transmitter, we determine the optimal transmit strategies to achieve the points on the boundary of the Capacity Region under various correlation models.
Haim H. Permuter - One of the best experts on this subject based on the ideXlab platform.
-
ISIT - Capacity Region of the finite state MAC with cooperative encoders and delayed CSI
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Ziv Goldfeld, Haim H. Permuter, Benjamin M. ZaidelAbstract:In this paper, a single-letter characterization for the Capacity Region of finite-state multiple access channels (MACs) with partially cooperative encoders is derived. Partial cooperation here is in the sense that the encoders communicate with each other through finite-Capacity links. The channel states are assumed to be governed by a Markov processes. Full channel state information (CSI) is assumed at the receiver, while only delayed CSI is available at transmitters. The Capacity Region is derived by first solving the case of finite-state multiple access channels with common message, using rate splitting, multiplexing and simultaneous decoding in order to establish the achievability. The common message result is then used to derive the Capacity Region of the partially cooperative encoders case. Finally, we apply this result in order to obtain the Capacity Region for a finite-state Gaussian MAC with partially cooperative encoders.
-
Capacity Region of finite state multiple-access channel with delayed state information
2010 48th Annual Allerton Conference on Communication Control and Computing (Allerton), 2010Co-Authors: Uria Basher, Avihay Shirazi, Haim H. PermuterAbstract:A single-letter characterization is provided for the Capacity Region of finite-state multiple access channels, when the channel state is a Markov process, the transmitters have access to delayed state information, and channel state information is available at the receiver. The delays of the channel state information are assumed to be asymmetric at the transmitters. We apply the result to derive power control strategies to maximize the Capacity Region for finite-state additive Gaussian multiple access channels, and for the finite-state multiple-access fading channel.
-
Capacity Region of the Finite-State Multiple-Access Channel With and Without Feedback
IEEE Transactions on Information Theory, 2009Co-Authors: Haim H. Permuter, Tsachy Weissman, Jun ChenAbstract:The Capacity Region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this Region, using Massey's directed information. These bounds are shown to coincide, and hence yield the Capacity Region, of indecomposable FS-MACs without feedback and of stationary and indecomposable FS-MACs with feedback, where the state process is not affected by the inputs. Though multiletter in general, our results yield explicit conclusions when applied to specific scenarios of interest. For example, our results allow us to do the following. 1. Identify a large class of FS-MACs, that includes the additive mod2 noise MAC where the noise may have memory, for which feedback does not enlarge the Capacity Region. 2. Deduce that, for a general FS-MAC with states that are not affected by the input, if the Capacity (Region) without feedback is zero, then so is the Capacity (Region) with feedback. 3. Deduce that the Capacity Region of a MAC that can be decomposed into a multiplexer concatenated by a point-to-point channel (with, without, or with partial feedback), the Capacity Region is given by Sigmam Rm les C, where C is the Capacity of the point to point channel and m indexes the encoders. Moreover, we show that for this family of channels source-channel coding separation holds.
-
New Bounds for the Capacity Region of the Finite-State Multiple Access Channel
arXiv: Information Theory, 2008Co-Authors: Haim H. Permuter, Tsachy Weissman, Jun ChenAbstract:The Capacity Region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and outer bounds for this Region. These bounds are shown to coincide, and hence yield the Capacity Region, of FS-MACs where the state process is stationary and ergodic and not affected by the inputs, and for indecomposable FS-MAC when feedback is not allowed. Though the Capacity Region is `multi-letter' in general, our results yield explicit conclusions when applied to specific scenarios of interest.
-
ISIT - New bounds for the Capacity Region of the Finite-State Multiple Access Channel
2008 IEEE International Symposium on Information Theory, 2008Co-Authors: Haim H. Permuter, Tsachy Weissman, Jun ChenAbstract:The Capacity Region of the finite-state multiple access channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and outer bounds for this Region. These bounds are shown to coincide, and hence yield the Capacity Region for two cases of FS-MACs: (1) when the state process is stationary and ergodic and not affected by the inputs; (2) an indecomposable FS-MAC without feedback. Though the Capacity Region is "multi-letter" in general, our results yield explicit conclusions when applied to specific scenarios of interest.
Aydin Sezgin - One of the best experts on this subject based on the ideXlab platform.
-
The Approximate Capacity Region of the Gaussian Y-Channel.
arXiv: Information Theory, 2013Co-Authors: Anas Chaaban, Aydin SezginAbstract:A full-duplex wireless network with three users that want to establish full message-exchange via a relay is considered. Thus, the network known as the Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user. The users are not physically connected, and thus the relay is essential for their communication. The linear-shift deterministic Y-channel is considered first, its Capacity Region is characterized and shown not to be given by the cut-set bounds. The Capacity achieving scheme has three different components (strategies): a bi-directional, a cyclic, and a uni-directional strategy. Network coding is used to realize the bi-directional and the cyclic strategies, and thus to prove the achievability of the Capacity Region. The result is then extended to the Gaussian Y-channel where the Capacity Region is characterized within a constant gap independent of the channel parameters.
-
The Approximate Capacity Region of the
2013Co-Authors: Anas Chaaban, Aydin SezginAbstract:A full-duplex wireless network with three users that want to establish full message-exchange via a relay is considered. Thus, the network known as the Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user. The users are not physically connected, and thus the relay is essential for their communication. The linear-shift deterministic Y-channel is considered first, its Capacity r egion is characterized and shown not to be given by the cut-set bounds. The Capacity achieving scheme has three different components (strategies): a bi-directional, a cycli c, and a uni-directional strategy. Network coding is used to realize the bi-directional and the cyclic strategies, and thu s to prove the achievability of the Capacity Region. The resul t is then extended to the Gaussian Y-channel where the Capacity Region is characterized within a constant gap independent of the channel parameters.
-
ISIT - The Capacity Region of the linear shift deterministic Y-channel
2011 IEEE International Symposium on Information Theory Proceedings, 2011Co-Authors: Anas Chaaban, Aydin SezginAbstract:The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds for this setup are shown to be not sufficient to characterize its Capacity Region. New upper bounds are derived, which when combined with the cut-set bounds provide an outer bound on the Capacity Region. It is shown that this outer bound is achievable, and as a result, the Capacity Region of the linear shift deterministic Y-channel is characterized.
-
The Capacity Region of the linear shift deterministic Y-channel
2011 IEEE International Symposium on Information Theory Proceedings, 2011Co-Authors: Anas Chaaban, Aydin SezginAbstract:The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds for this setup are shown to be not sufficient to characterize its Capacity Region. New upper bounds are derived, which when combined with the cut-set bounds provide an outer bound on the Capacity Region. It is shown that this outer bound is achievable, and as a result, the Capacity Region of the linear shift deterministic Y-channel is characterized.
-
Capacity Region of the deterministic multi pair bi directional relay network
arXiv: Information Theory, 2009Co-Authors: Salman A Avestimehr, Aydin Sezgin, Amin M Khajehnejad, Babak HassibiAbstract:In this paper we study the Capacity Region of the multi-pair bidirectional (or two-way) wireless relay network, in which a relay node facilitates the communication between multiple pairs of users. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We examine this problem in the context of the deterministic channel interaction model, which eliminates the channel noise and allows us to focus on the interaction between signals. We characterize the Capacity Region of this network when the relay is operating at either full-duplex mode or half-duplex mode (with non adaptive listen-transmit scheduling). In both cases we show that the cut-set upper bound is tight and, quite interestingly, the Capacity Region is achieved by a simple equation-forwarding strategy.
Yingbin Liang - One of the best experts on this subject based on the ideXlab platform.
-
ISIT - On the Capacity Region of Gaussian interference channels with state
2013 IEEE International Symposium on Information Theory, 2013Co-Authors: Ruchen Duan, Yingbin Liang, Shlomo Shamai ShitzAbstract:The Gaussian interference channel with additive state at two receivers is investigated, in which the state information is noncausally known at both transmitters but not known at either receiver. For the very strong Gaussian interference channel with state, the Capacity Region is obtained under certain conditions on channel parameters. For the strong (but not very strong) Gaussian interference channel with state, points on the boundary of the Capacity Region are characterized under corresponding conditions on channel parameters. Finally, for the weak Gaussian interference channel with state, the sum Capacity is obtained for certain channel parameters. All the above Capacity-achieving rate points achieve the Capacity for the corresponding channel without state.
-
ISIT - On the Capacity Region of the Poisson interference channels
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Lifeng Lai, Yingbin Liang, Shlomo ShamaiAbstract:The Poisson interference channel is studied, which models optical communication systems with multiple transceivers. Conditions for the strong interference is characterized and the corresponding Capacity Region is given, which is the same as that of the compound Poisson multiple access channel with each receiver decoding both messages. For the cases when the strong interference conditions are not satisfied, inner and outer bounds on the Capacity Region are derived. Finally, numerical results are provided to illustrate the derived Regions.
-
secrecy Capacity Region of fading broadcast channels
International Symposium on Information Theory, 2007Co-Authors: Yingbin Liang, H V Poor, Shlomo ShamaiAbstract:The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy Capacity Region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy Capacity Region are derived. In particular, the secrecy Capacity Region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy Capacity results are then applied to give the ergodic secrecy Capacity Region for the fading BCC.
-
Secrecy Capacity Region of Parallel Broadcast Channels
2007 Information Theory and Applications Workshop, 2007Co-Authors: Yingbin Liang, H V Poor, Shlomo ShamaiAbstract:The parallel broadcast channel with confidential messages (BCC) is investigated, where a source node transmits to two receivers (receivers 1 and 2) over multiple independent subchannels. The source node has common information for both receivers, and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The secrecy Capacity Region of the parallel BCC is established. It is shown that independent input distribution for each subchannel is optimal. It is also shown that the secrecy Capacity Region of the parallel BCC can be larger than the sum of the secrecy Capacity Regions of the subchannels. The secrecy Capacity Region is further derived for the parallel BCC with degraded subchannels. Applications of these results to the fading BCC are also discussed.
-
ISIT - Secrecy Capacity Region of Fading Broadcast Channels
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Yingbin Liang, H V Poor, Shlomo ShamaiAbstract:The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy Capacity Region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy Capacity Region are derived. In particular, the secrecy Capacity Region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy Capacity results are then applied to give the ergodic secrecy Capacity Region for the fading BCC.
