1,125 research outputs found
Encoding for the Blackwell Channel with Reinforced Belief Propagation
A key idea in coding for the broadcast channel (BC) is binning, in which the
transmitter encode information by selecting a codeword from an appropriate bin
(the messages are thus the bin indexes). This selection is normally done by
solving an appropriate (possibly difficult) combinatorial problem. Recently it
has been shown that binning for the Blackwell channel --a particular BC-- can
be done by iterative schemes based on Survey Propagation (SP). This method uses
decimation for SP and suffers a complexity of O(n^2). In this paper we propose
a new variation of the Belief Propagation (BP) algorithm, named Reinforced BP
algorithm, that turns BP into a solver. Our simulations show that this new
algorithm has complexity O(n log n). Using this new algorithm together with a
non-linear coding scheme, we can efficiently achieve rates close to the border
of the capacity region of the Blackwell channel.Comment: 5 pages, 8 figures, submitted to ISIT 200
Conditions for a Monotonic Channel Capacity
Motivated by results in optical communications, where the performance can
degrade dramatically if the transmit power is sufficiently increased, the
channel capacity is characterized for various kinds of memoryless vector
channels. It is proved that for all static point-to-point channels, the channel
capacity is a nondecreasing function of power. As a consequence, maximizing the
mutual information over all input distributions with a certain power is for
such channels equivalent to maximizing it over the larger set of input
distributions with upperbounded power. For interference channels such as
optical wavelength-division multiplexing systems, the primary channel capacity
is always nondecreasing with power if all interferers transmit with identical
distributions as the primary user. Also, if all input distributions in an
interference channel are optimized jointly, then the achievable sum-rate
capacity is again nondecreasing. The results generalizes to the channel
capacity as a function of a wide class of costs, not only power.Comment: This is an updated and expanded version of arXiv:1108.039
Self-concatenated code design and its application in power-efficient cooperative communications
In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions
- …