803 research outputs found
Reliable Physical Layer Network Coding
When two or more users in a wireless network transmit simultaneously, their
electromagnetic signals are linearly superimposed on the channel. As a result,
a receiver that is interested in one of these signals sees the others as
unwanted interference. This property of the wireless medium is typically viewed
as a hindrance to reliable communication over a network. However, using a
recently developed coding strategy, interference can in fact be harnessed for
network coding. In a wired network, (linear) network coding refers to each
intermediate node taking its received packets, computing a linear combination
over a finite field, and forwarding the outcome towards the destinations. Then,
given an appropriate set of linear combinations, a destination can solve for
its desired packets. For certain topologies, this strategy can attain
significantly higher throughputs over routing-based strategies. Reliable
physical layer network coding takes this idea one step further: using
judiciously chosen linear error-correcting codes, intermediate nodes in a
wireless network can directly recover linear combinations of the packets from
the observed noisy superpositions of transmitted signals. Starting with some
simple examples, this survey explores the core ideas behind this new technique
and the possibilities it offers for communication over interference-limited
wireless networks.Comment: 19 pages, 14 figures, survey paper to appear in Proceedings of the
IEE
Parsing a sequence of qubits
We develop a theoretical framework for frame synchronization, also known as
block synchronization, in the quantum domain which makes it possible to attach
classical and quantum metadata to quantum information over a noisy channel even
when the information source and sink are frame-wise asynchronous. This
eliminates the need of frame synchronization at the hardware level and allows
for parsing qubit sequences during quantum information processing. Our
framework exploits binary constant-weight codes that are self-synchronizing.
Possible applications may include asynchronous quantum communication such as a
self-synchronizing quantum network where one can hop into the channel at any
time, catch the next coming quantum information with a label indicating the
sender, and reply by routing her quantum information with control qubits for
quantum switches all without assuming prior frame synchronization between
users.Comment: 11 pages, 2 figures, 1 table. Final accepted version for publication
in the IEEE Transactions on Information Theor
Joint Compute and Forward for the Two Way Relay Channel with Spatially Coupled LDPC Codes
We consider the design and analysis of coding schemes for the binary input
two way relay channel with erasure noise. We are particularly interested in
reliable physical layer network coding in which the relay performs perfect
error correction prior to forwarding messages. The best known achievable rates
for this problem can be achieved through either decode and forward or compute
and forward relaying. We consider a decoding paradigm called joint compute and
forward which we numerically show can achieve the best of these rates with a
single encoder and decoder. This is accomplished by deriving the exact
performance of a message passing decoder based on joint compute and forward for
spatially coupled LDPC ensembles.Comment: This paper was submitted to IEEE Global Communications Conference
201
Nonbinary Spatially-Coupled LDPC Codes on the Binary Erasure Channel
We analyze the asymptotic performance of nonbinary spatially-coupled
low-density parity-check (SC-LDPC) codes built on the general linear group,
when the transmission takes place over the binary erasure channel. We propose
an efficient method to derive an upper bound to the maximum a posteriori
probability (MAP) threshold for nonbinary LDPC codes, and observe that the MAP
performance of regular LDPC codes improves with the alphabet size. We then
consider nonbinary SC-LDPC codes. We show that the same threshold saturation
effect experienced by binary SC-LDPC codes occurs for the nonbinary codes,
hence we conjecture that the BP threshold for large termination length
approaches the MAP threshold of the underlying regular ensemble.Comment: Submitted to IEEE International Conference on Communications 201
Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
We consider quantum channels with two senders and one receiver. For an
arbitrary such channel, we give multi-letter characterizations of two different
two-dimensional capacity regions. The first region is comprised of the rates at
which it is possible for one sender to send classical information, while the
other sends quantum information. The second region consists of the rates at
which each sender can send quantum information. For each region, we give an
example of a channel for which the corresponding region has a single-letter
description. One of our examples relies on a new result proved here, perhaps of
independent interest, stating that the coherent information over any degradable
channel is concave in the input density operator. We conclude with connections
to other work and a discussion on generalizations where each user
simultaneously sends classical and quantum information.Comment: 38 pages, 1 figure. Fixed typos, added new example. Submitted to IEEE
Tranactions on Information Theor
- …