- Title
- Optimal routing for the Gaussian multiple-relay channel with decode-and-forward
- Creator
- Ong, Lawrence; Motani, Mehul
- Relation
- IEEE International Symposium on Information Theory, 2007 (ISIT 2007). Proceedings of the IEEE International Symposium on Information Theory, ISIT 2007 (Nice, France 24-29 June, 2007) p. 1061-1065
- Publisher Link
- http://dx.doi.org/10.1109/ISIT.2007.4557364
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Date
- 2007
- Description
- 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.
- Subject
- algorithm design and analysis; decoding; Gaussian noise; heuristic algorithms; parity check codes; polynomials; propagation losses; random variables; relays; routing
- Identifier
- http://hdl.handle.net/1959.13/921536
- Identifier
- uon:9341
- Identifier
- ISBN:9781424413973
- Rights
- Copyright © 2007 IEEE. Reprinted from the Proceedings of the IEEE International Symposium on Information Theory, ICIT 2007. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Language
- eng
- Full Text
- Reviewed
- Hits: 1621
- Visitors: 2470
- Downloads: 546
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT01 | Publisher version (open access) | 375 KB | Adobe Acrobat PDF | View Details Download |