152 research outputs found
On the Error Exponents of ARQ Channels with Deadlines
We consider communication over Automatic Repeat reQuest (ARQ) memoryless
channels with deadlines. In particular, an upper bound L is imposed on the
maximum number of ARQ transmission rounds. In this setup, it is shown that
incremental redundancy ARQ outperforms Forney's memoryless decoding in terms of
the achievable error exponents.Comment: 16 pages, 6 figures, Submitted to the IEEE Trans. on Information
Theor
Reliability of a Gaussian channel in the presence of Gaussian feedback
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (leaves 29-30).The communication reliability, or error exponent, of a continuous time, infinite band-width, Additive White Gaussian Noise channel was studied under a peak power constraint, in the presence of a feedback channel that was also a continuous time peak-power constrained infinite bandwidth Additive White Gaussian Noise channel. Motivated by [9], a two phase scheme was studied, where, in the first phase, the Encoder transmits the message in small bit-packets and the Decoder then informs the Encoder of the decoded message. With this knowledge, in the second phase, the Encoder sends a confirm or deny signal to the Decoder and the Decoder then informs the Encoder of its final action. In the first phase, the Encoder uses an orthogonal signalling scheme and the Decoder uses a deterministic Identification code. In the second phase, the Encoder uses antipodal signalling, while the Decoder utilizes a sequential semi-orthogonal peak-power constrained anytime code. To improve the reliability of the anytime code, additional messages are pipelined into the forward channel by the Encoder once it finishes its phase two transmission, before receiving the Decoder's phase two transmission.(cont.) Using this scheme, the following lower bound on the reliability of this channel is obtained: where 4R is the average rate of data transmission and C are the capacities of where R is the average rate of data transmission and Ci and 02 are the capacities of the forward and reverse channels respectively. To achieve this reliability, the capacity of the reverse channel, C2 must be greater than the forward capacity C1.by Aman Chawla.S.M
Control-theoretic Approach to Communication with Feedback: Fundamental Limits and Code Design
Feedback communication is studied from a control-theoretic perspective,
mapping the communication problem to a control problem in which the control
signal is received through the same noisy channel as in the communication
problem, and the (nonlinear and time-varying) dynamics of the system determine
a subclass of encoders available at the transmitter. The MMSE capacity is
defined to be the supremum exponential decay rate of the mean square decoding
error. This is upper bounded by the information-theoretic feedback capacity,
which is the supremum of the achievable rates. A sufficient condition is
provided under which the upper bound holds with equality. For the special class
of stationary Gaussian channels, a simple application of Bode's integral
formula shows that the feedback capacity, recently characterized by Kim, is
equal to the maximum instability that can be tolerated by the controller under
a given power constraint. Finally, the control mapping is generalized to the
N-sender AWGN multiple access channel. It is shown that Kramer's code for this
channel, which is known to be sum rate optimal in the class of generalized
linear feedback codes, can be obtained by solving a linear quadratic Gaussian
control problem.Comment: Submitted to IEEE Transactions on Automatic Contro
Gaussian Channels with Feedback: A Dynamic Programming Approach
In this paper, we consider a communication system where a sender sends
messages over a memoryless Gaussian point-to-point channel to a receiver and
receives the output feedback over another Gaussian channel with known variance
and unit delay. The sender sequentially transmits the message over multiple
times till a certain error performance is achieved. The aim of our work is to
design a transmission strategy to process every transmission with the
information that was received in the previous feedback and send a signal so
that the estimation error drops as quickly as possible. The optimal code is
unknown for channels with noisy output feedback when the block length is
finite. Even within the family of linear codes, optimal codes are unknown in
general. Bridging this gap, we propose a family of linear sequential codes and
provide a dynamic programming algorithm to solve for a closed form expression
for the optimal code within a class of sequential linear codes. The optimal
code discovered via dynamic programming is a generalized version of which the
Schalkwijk-Kailath (SK) scheme is one special case with noiseless feedback; our
proposed code coincides with the celebrated SK scheme for noiseless feedback
settings.Comment: 13 pages, 3 figure
On the Noisy Feedback Capacity of Gaussian Broadcast Channels
It is well known that, in general, feedback may enlarge the capacity region
of Gaussian broadcast channels. This has been demonstrated even when the
feedback is noisy (or partial-but-perfect) and only from one of the receivers.
The only case known where feedback has been shown not to enlarge the capacity
region is when the channel is physically degraded (El Gamal 1978, 1981). In
this paper, we show that for a class of two-user Gaussian broadcast channels
(not necessarily physically degraded), passively feeding back the stronger
user's signal over a link corrupted by Gaussian noise does not enlarge the
capacity region if the variance of feedback noise is above a certain threshold.Comment: 5 pages, 3 figures, to appear in IEEE Information Theory Workshop
2015, Jerusale
- …