57 research outputs found
On the Input-Degradedness and Input-Equivalence Between Channels
A channel is said to be input-degraded from another channel if
can be simulated from by randomization at the input. We provide a
necessary and sufficient condition for a channel to be input-degraded from
another one. We show that any decoder that is good for is also good for
. We provide two characterizations for input-degradedness, one of which is
similar to the Blackwell-Sherman-Stein theorem. We say that two channels are
input-equivalent if they are input-degraded from each other. We study the
topologies that can be constructed on the space of input-equivalent channels,
and we investigate their properties. Moreover, we study the continuity of
several channel parameters and operations under these topologies.Comment: 30 pages. Submitted to IEEE Trans. Inform. Theory and in part to
ISIT2017. arXiv admin note: substantial text overlap with arXiv:1701.0446
Polarization and Channel Ordering: Characterizations and Topological Structures
Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Shannon did not provide an explicit construction of a practical coding scheme that achieves the capacity. Polar coding, invented by Arikan, is the first low-complexity coding technique that achieves the capacity of binary-input memoryless symmetric channels. The construction of these codes is based on a phenomenon called polarization. The study of polar codes and their generalization to arbitrary channels is the subject of polarization theory, a subfield of information and coding theories. This thesis consists of two parts. In the first part, we provide solutions to several open problems in polarization theory. The first open problem that we consider is to determine the binary operations that always lead to polarization when they are used in Arikan-style constructions. In order to solve this problem, we develop an ergodic theory for binary operations. This theory is used to provide a necessary and sufficient condition that characterizes the polarizing binary operations, both in the single-user and the multiple-access settings. We prove that the exponent of a polarizing binary operation cannot exceed 1/2. Furthermore, we show that the exponent of an arbitrary quasigroup operation is exactly 1/2. This implies that quasigroup operations are among the best polarizing binary operations. One drawback of polarization in the multiple-access setting is that it sometimes induces a loss in the symmetric capacity region of a given multiple-access channel (MAC). An open problem in MAC polarization theory is to determine all the MACs that do not lose any part of their capacity region by polarization. Using Fourier analysis, we solve this problem by providing a single-letter necessary and sufficient condition that characterizes all these MACs in the general setting where we have an arbitrary number of users, and each user uses an arbitrary Abelian group operation on his input alphabet. We also study the polarization of classical-quantum (cq) channels. The input alphabet is endowed with an arbitrary Abelian group operation, and an Arikan-style transformation is applied using this operation. We show that as the number of polarization steps becomes large, the synthetic cq-channels polarize to deterministic homomorphism channels that project their input to a quotient group of the input alphabet. This result is used to construct polar codes for arbitrary cq-channels and arbitrary classical-quantum multiple-access channels (cq-MAC). In the second part of this thesis, we investigate several problems that are related to three orderings of communication channels: degradedness, input-degradedness, and the Shannon ordering. We provide several characterizations for the input-degradedness and the Shannon ordering. Two channels are said to be equivalent if they are degraded from each other. Input-equivalence and Shannon-equivalence between channels are similarly defined. We construct and study several topologies on the quotients of the spaces of discrete memoryless channels (DMC) by the equivalence, the input-equivalence and the Shannon-equivalence relations. Finally, we prove the continuity of several channel parameters and operations under various DMC topologies
A Characterization of the Shannon Ordering of Communication Channels
The ordering of communication channels was first introduced by Shannon. In
this paper, we aim to find a characterization of the Shannon ordering. We show
that contains if and only if is the skew-composition of with
a convex-product channel. This fact is used to derive a characterization of the
Shannon ordering that is similar to the Blackwell-Sherman-Stein theorem. Two
channels are said to be Shannon-equivalent if each one is contained in the
other. We investigate the topologies that can be constructed on the space of
Shannon-equivalent channels. We introduce the strong topology and the BRM
metric on this space. Finally, we study the continuity of a few channel
parameters and operations under the strong topology.Comment: 23 pages, presented in part at ISIT'17. arXiv admin note: text
overlap with arXiv:1702.0072
Achieving Marton's Region for Broadcast Channels Using Polar Codes
This paper presents polar coding schemes for the 2-user discrete memoryless
broadcast channel (DM-BC) which achieve Marton's region with both common and
private messages. This is the best achievable rate region known to date, and it
is tight for all classes of 2-user DM-BCs whose capacity regions are known. To
accomplish this task, we first construct polar codes for both the superposition
as well as the binning strategy. By combining these two schemes, we obtain
Marton's region with private messages only. Finally, we show how to handle the
case of common information. The proposed coding schemes possess the usual
advantages of polar codes, i.e., they have low encoding and decoding complexity
and a super-polynomial decay rate of the error probability.
We follow the lead of Goela, Abbe, and Gastpar, who recently introduced polar
codes emulating the superposition and binning schemes. In order to align the
polar indices, for both schemes, their solution involves some degradedness
constraints that are assumed to hold between the auxiliary random variables and
the channel outputs. To remove these constraints, we consider the transmission
of blocks and employ a chaining construction that guarantees the proper
alignment of the polarized indices. The techniques described in this work are
quite general, and they can be adopted to many other multi-terminal scenarios
whenever there polar indices need to be aligned.Comment: 26 pages, 11 figures, accepted to IEEE Trans. Inform. Theory and
presented in part at ISIT'1
- …