Results 1  10
of
75
with Feedback
"... lemma, using gi P (X;:,,.., XL>, p;(x’i = (I,..., 1) infinitely often) = 1, since Cy = IP&? = cl;.., 1)) 2 Cy = 1pr = 00. Thus, for any r], one may find a k large enough such that P;(IJxI I 7) is arbitrarily small. 0 Remark: Note that we have actually shown that, for any fixed n and any E & ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
lemma, using gi P (X;:,,.., XL>, p;(x’i = (I,..., 1) infinitely often) = 1, since Cy = IP&? = cl;.., 1)) 2 Cy = 1pr = 00. Thus, for any r], one may find a k large enough such that P;(IJxI I 7) is arbitrarily small. 0 Remark: Note that we have actually shown that, for any fixed n and any E < 1 i/log,(3), one may construct a J? @ and a B such that the probability of error is arbitrarily close to 1. By defining pi, i 2 2, to be smaller, we could also take any l < 1.
Lossy Source Coding
 IEEE Trans. Inform. Theory
, 1998
"... Lossy coding of speech, highquality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called ratedistortion theory. For the first 25 year ..."
Abstract

Cited by 104 (1 self)
 Add to MetaCart
Lossy coding of speech, highquality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called ratedistortion theory. For the first 25
On Linear Processing for an AWGN Channel with Noisy Feedback
, 2009
"... Many communication systems can be modeled as having a noisy forward channel and a noisy or noiseless feedback channel. The use of the feedback channel is of great interest because it can greatly lower the complexity of the modulation scheme for the forward channel. In addition to complexity benefits ..."
Abstract
 Add to MetaCart
benefits, it can greatly increase the rate at which the probability of error decays. In this paper, we look at linear schemes and compare our results to the wellknown SchalkwijkKailath coding scheme. Starting from a general linear coding scheme, a new linear feedback coding method is developed
NETWORK COMMUNICATIONS WITH FEEDBACK VIA STOCHASTIC APPROXIMATION
, 2009
"... It is known that noiseless feedback does not increase the capacity of memoryless pointtopoint channels. However, such feedback can considerably increase the reliability or reduce the coding complexity of schemes that approach capacity. This thesis first develops a new class of coding schemes for ..."
Abstract
 Add to MetaCart
for additive white noise channels with feedback corrupted by additive noise, focusing much of the results and discussions on additive white Gaussian noise channels. These schemes are variants of the wellknown SchalkwijkKailath coding scheme and are based upon techniques from stochastic approximation
Boosting reliability over AWGN networks with average power constraints and noiseless feedback
 in Proceedings of IEEE Int. Symp. Info. Theory
, 2005
"... For the pointtopoint additive white Gaussian noise (AWGN) channel with noiseless feedback and an average power constraint, Schalkwijk and Kailath's scheme achieves a doublyexponential decay of the probability of error. While some coding schemes for networks with noiseless feedback incorporate ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
For the pointtopoint additive white Gaussian noise (AWGN) channel with noiseless feedback and an average power constraint, Schalkwijk and Kailath's scheme achieves a doublyexponential decay of the probability of error. While some coding schemes for networks with noiseless feedback
Coding for the feedback Gel'fandPinsker channel and the feedforward WynerZiv source
 IEEE Trans. Inf. Theory
, 2006
"... We consider both channel coding and source coding, with perfect past feedback/feedforward, in the presence of side information. It is first observed that feedback does not increase the capacity of the Gel’fand–Pinsker channel, nor does feedforward improve the achievable ratedistortion performance i ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
in the WynerZiv problem. We then focus on the Gaussian case showing that, as in the absence of side information, feedback/feedforward allows to efficiently attain the respective performance limits. In particular, we derive schemes via variations on that of Schalkwijk and Kailath. These variants, which
Error Exponent for Gaussian Channels with Partial Sequential Feedback
"... Abstract — We consider an additive white Gaussian noise (AWGN) channel with partial sequential feedback. Namely, for every fixedlength block of forward transmissions a fraction of the received symbols are fed back sequentially to the transmitter through a noiseless feedback link. It is well known t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract — We consider an additive white Gaussian noise (AWGN) channel with partial sequential feedback. Namely, for every fixedlength block of forward transmissions a fraction of the received symbols are fed back sequentially to the transmitter through a noiseless feedback link. It is well known
WRITING ON DIRTY PAPER WITH FEEDBACK ∗
"... Abstract. “Writing on dirty paper ” refers to the communication problem over a channel with both noise and interference, where the interference is known to the encoder noncausally and unknown to the decoder. This problem is regarded as a basic building block in both the singleuser and multiuser co ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
the most power efficient coding schemes for this problem, i.e., the schemes achieve lossless interference cancelation. These schemes are based on the Kalman filtering algorithm, extend the SchalkwijkKailath feedback codes, have low complexity and a doubly exponential reliability function, and reveal
Results 1  10
of
75