Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward

Details Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward

2007-04-23

arxiv.org/abs/0704.2926v1

Proceedings of the 2007 IEEE International Symposium on Information Theory (ISIT 2007), Acropolis Congress and Exhibition Cent

Computer Science

Information Theory

Accepted and to be presented at the 2007 IEEE International Symposium on Information Theory (ISIT 2007), Acropolis Congress an

Scientific paper

10.1109/ISIT.2007.4557364

In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest DF rate. We first construct an algorithm that provably finds optimal DF routes. As the algorithm runs in factorial time in the worst case, we propose a polynomial time heuristic algorithm that finds an optimal route with high probability. We demonstrate that that the optimal (and near optimal) DF routes are good in practice by simulating a distributed DF coding scheme using low density parity check codes with puncturing and incremental redundancy.

Affiliated with

Also associated with

No associations

Rating

Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward 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 Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194617