12,310 research outputs found
Graph-Based Decoding in the Presence of ISI
We propose an approximation of maximum-likelihood detection in ISI channels
based on linear programming or message passing. We convert the detection
problem into a binary decoding problem, which can be easily combined with LDPC
decoding. We show that, for a certain class of channels and in the absence of
coding, the proposed technique provides the exact ML solution without an
exponential complexity in the size of channel memory, while for some other
channels, this method has a non-diminishing probability of failure as SNR
increases. Some analysis is provided for the error events of the proposed
technique under linear programming.Comment: 25 pages, 8 figures, Submitted to IEEE Transactions on Information
Theor
First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory
This article considers the performance of digital communication systems
transmitting messages over finite-state erasure channels with memory.
Information bits are protected from channel erasures using error-correcting
codes; successful receptions of codewords are acknowledged at the source
through instantaneous feedback. The primary focus of this research is on
delay-sensitive applications, codes with finite block lengths and, necessarily,
non-vanishing probabilities of decoding failure. The contribution of this
article is twofold. A methodology to compute the distribution of the time
required to empty a buffer is introduced. Based on this distribution, the mean
hitting time to an empty queue and delay-violation probabilities for specific
thresholds can be computed explicitly. The proposed techniques apply to
situations where the transmit buffer contains a predetermined number of
information bits at the onset of the data transfer. Furthermore, as additional
performance criteria, large deviation principles are obtained for the empirical
mean service time and the average packet-transmission time associated with the
communication process. This rigorous framework yields a pragmatic methodology
to select code rate and block length for the communication unit as functions of
the service requirements. Examples motivated by practical systems are provided
to further illustrate the applicability of these techniques.Comment: To appear in IEEE Transactions on Information Theor
Black holes as mirrors: quantum information in random subsystems
We study information retrieval from evaporating black holes, assuming that
the internal dynamics of a black hole is unitary and rapidly mixing, and
assuming that the retriever has unlimited control over the emitted Hawking
radiation. If the evaporation of the black hole has already proceeded past the
"half-way" point, where half of the initial entropy has been radiated away,
then additional quantum information deposited in the black hole is revealed in
the Hawking radiation very rapidly. Information deposited prior to the half-way
point remains concealed until the half-way point, and then emerges quickly.
These conclusions hold because typical local quantum circuits are efficient
encoders for quantum error-correcting codes that nearly achieve the capacity of
the quantum erasure channel. Our estimate of a black hole's information
retention time, based on speculative dynamical assumptions, is just barely
compatible with the black hole complementarity hypothesis.Comment: 18 pages, 2 figures. (v2): discussion of decoding complexity
clarifie
- …