Encoding for the Blackwell Channel with Reinforced Belief Propagation

Details Encoding for the Blackwell Channel with Reinforced Belief Propagation Encoding for the Blackwell Channel with Reinforced Belief Propagation

2007-05-03

arxiv.org/abs/0705.0423v1

IEEE International Symposium on Information Theory (ISIT07); 2007. p. 1891-5

Computer Science

Information Theory

5 pages, 8 figures, submitted to ISIT 2007

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Encoding for the Blackwell Channel with Reinforced Belief Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Encoding for the Blackwell Channel with Reinforced Belief Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Encoding for the Blackwell Channel with Reinforced Belief Propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496984