Results 1  10
of
26
The multiple access channel with causal and strictly causal side information at the encoders
 in Proc. Int. Zurich Seminar on Communications (IZS
, 2010
"... Abstract—We study the statedependent multiple access channel (MAC) with causal side information at the encoders. We consider two general models. In the first model, the state sequence is available at the two encoders in a strictly causal manner. We derive an achievable region, which is tight for t ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
(Show Context)
Abstract—We study the statedependent multiple access channel (MAC) with causal side information at the encoders. We consider two general models. In the first model, the state sequence is available at the two encoders in a strictly causal manner. We derive an achievable region, which is tight for the special case of a Gaussian MAC where the state sequence comprises the channel noise. Although the two senders do not have access to each other’s massage and no feedback is present, the capacity for this case coincides with the capacity of the same MAC without side information, but with full cooperation between the users. A SchalkwijkKailath type algorithm is developed, which achieves this capacity with a double exponential decay of the maximal probability of error. In the second model we consider, the state sequence is available, as in Shannon’s model, to the two encoders in a causal manner. A simple extension of the previous result, with the inclusion of Shannon strategies, yields an achievability result for this problem. Index Terms—Causal state information, feedback, multiple access channel, strictlycausal stateinformation. I.
LQG control approach to Gaussian broadcast channels with feedback
 IEEE Trans. on Inf. Theory
, 2012
"... ar ..."
(Show Context)
On the capacity of the discrete memoryless broadcast channel with feedback
 IEEE Trans. Inf. Theory
, 2013
"... ar ..."
(Show Context)
The multiple access channel with two independent states each known causally to one encoder
 in Proc. IEEE Int. Symp. Inf. Theory
, 2010
"... Abstract—We study the statedependent multiple access channel (MAC) with causal side information at the encoders. The channel state consists of two independent components, S1 and S2, available at Encoder 1 and Encoder 2, respectively. The problem where the state is available at only one of the encod ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We study the statedependent multiple access channel (MAC) with causal side information at the encoders. The channel state consists of two independent components, S1 and S2, available at Encoder 1 and Encoder 2, respectively. The problem where the state is available at only one of the encoders is a special case. We consider two scenarios. In the first, the states are available at the encoders in a strictly causal manner. We derive an achievable region, which is tight for a Gaussian MAC where the state sequence comprises the channel noise and is available at one of the encoders only. In the second scenario the state sequence is available to the encoders in a causal manner, as in Shannon’s model. A simple extension of the previous result to Shannon strategies yields an achievability result. Our region contains as a special case the naïve rate region obtained when each of the users applies Shannon strategies. In some cases the inclusion is strict. Index Terms—Causal state information, feedback, multiple access channel, strictlycausal stateinformation. I.
The multipleaccess channel with causal side information: Independent states
 IEEE Trans. Inf. Theory
"... Abstract—We show that if amemoryless multipleaccess channel (MAC) is governed by an independent and identically distributed state sequence, then—unlike the singleuser case—the capacity region is typically increased if the state is revealed to the encoders in a strictly causal way. For this scenar ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We show that if amemoryless multipleaccess channel (MAC) is governed by an independent and identically distributed state sequence, then—unlike the singleuser case—the capacity region is typically increased if the state is revealed to the encoders in a strictly causal way. For this scenario, we derive inner and outer bounds on the capacity region. For the Gaussian MAC whose state sequence comprises the channel noise, we compute the capacity region and propose a variation on the Schalkwijk–Kailath scheme that achieves capacity with a doubleexponential decay of the maximal probability of error. We also study the causal case for which we derive an achievable region, which is typically strictly larger than the region achievable with naïve Shannon strategies. Index Terms—Causal state information, feedback, multipleaccess channel (MAC), Shannon strategies, side information (SI), state, strictly causal state information. I.
An Achievable Rate Region for the Broadcast Channel with Feedback
, 2011
"... A singleletter achievable rate region is proposed for the tworeceiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves blockMarkov superposition coding using Marton’s coding scheme for the broadcast channel without feedback as the starting point ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
A singleletter achievable rate region is proposed for the tworeceiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves blockMarkov superposition coding using Marton’s coding scheme for the broadcast channel without feedback as the starting point. If the message rates in the Marton scheme are too high to be decoded at the end of a block, each receiver is left with a list of messages compatible with its output. Resolution information is sent in the following block to enable each receiver to resolve its list. The key observation is that the resolution information of the first receiver is correlated with that of the second. This correlated information is efficiently transmitted via joint sourcechannel coding, using ideas similar to the HanCosta coding scheme. The proposed rate region is computed for two examples, including the degraded AWGN broadcast channel, which show that the region can be strictly larger than the capacity region in the absence of feedback. Finally, the proposed rate region is shown to contain the achievable region proposed independently by Shayevitz and Wigger under certain mild conditions. 1
An achievable rate region for a multiuser halfduplex twoway channel
 in Annual Conference on Signal, Systems, and Computers, Asilomar, OctNov
, 2006
"... Abstract — Feedback is known to enlarge the capacity region of a multiuser channel. However, none of the information theoretic analysis account for resource usage of the feedback link. In this paper, we adopt a novel twoway formulation for multiuser systems, which jointly designs the uplink and dow ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract — Feedback is known to enlarge the capacity region of a multiuser channel. However, none of the information theoretic analysis account for resource usage of the feedback link. In this paper, we adopt a novel twoway formulation for multiuser systems, which jointly designs the uplink and downlink communication. By assuming that nodes are halfduplex (in time) and feedback shares resources with data, all resource usage is accurately accounted in the system. Our achievable rate region shows that feedback is beneficial only if the the channel is twoway, i.e, there is data to be sent in both directions. I.
Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback
"... Abstract — A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sumrate that the scheme achieves and the fullcooperation bound vanishes as the signaltonoise ratio tends to infin ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract — A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sumrate that the scheme achieves and the fullcooperation bound vanishes as the signaltonoise ratio tends to infinity. When the correlation coefficient is −1, the gains afforded by feedback are unbounded and the prelog is doubled. When the correlation coefficient is +1, we demonstrate a dichotomy that if the noise variances are equal, then feedback is useless, and otherwise, feedback affords unbounded rate gains and doubles the prelog. The unbounded feedback gains, however, require perfect (noiseless) feedback. When the feedback links are noisy, the feedback gains are bounded, unless the feedback noise decays to zero sufficiently fast with the signaltonoise ratio. Extensions to more receivers are also discussed as is the memoryless Gaussian interference channel with feedback. Index Terms — Broadcast channel, capacity, feedback, high SNR, interference channel, prelog.
1Perfect Output Feedback in the TwoUser Decentralized Interference Channel
, 2014
"... In this paper, the Nash equilibrium (NE) region of the twouser Gaussian interference channel (IC) with perfect output feedback is characterized to within 2 bits/s/Hz. The relevance of the NEregion is that it provides the set of ratepairs that are achievable and stable in the IC when both transmit ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
In this paper, the Nash equilibrium (NE) region of the twouser Gaussian interference channel (IC) with perfect output feedback is characterized to within 2 bits/s/Hz. The relevance of the NEregion is that it provides the set of ratepairs that are achievable and stable in the IC when both transmitterreceiver pairs autonomously tune their own transmit/receive configurations seeking an optimal individual transmission rate. Therefore, any rate tuple outside the NE region is not stable as there always exists at least one link able to increase its own transmission rate by updating its own transmit/receive configuration. The main conclusions of this paper are: (i) The NE region achieved with feedback is strictly larger than the NE region without feedback. More importantly, all the rate pairs uniquely achievable using feedback are at least weakly Pareto superior to those achievable without feedback. (ii) The use of feedback allows the achievability of all the strictly Pareto optimal rate pairs of the (approximate) capacity region of the Gaussian IC with feedback even when the network is fully decentralized. Index Terms Interference channels, feedback communications, Gaussian channels, wireless networks, distributed
An achievable region for the discrete memoryless broadcast channel with feedback
 in Proc. ISIT 2010
, 2010
"... Abstract—A coding scheme for the discrete memoryless broadcast channel with (possible noisy) feedback is proposed, and the corresponding achievable region derived. The scheme is based on a blockMarkov strategy where in each block the transmitter sends fresh data and update information that allows ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—A coding scheme for the discrete memoryless broadcast channel with (possible noisy) feedback is proposed, and the corresponding achievable region derived. The scheme is based on a blockMarkov strategy where in each block the transmitter sends fresh data and update information that allows the receivers to improve the channel outputs observed in the previous block. The region is analyzed for two specific broadcast channels: 1) A generalization of Dueck’s channel, where it is shown that for noiseless outputfeedback the region coincides with the capacity region; 2) A noisy version of Blackwell’s channel, where it is shown that for noiseless – and in some cases noisy – outputfeedback, the region improves upon the nofeedback capacity region. I.