Please use this identifier to cite or link to this item:
|Title:||Optimal routing for the Gaussian multiple-relay channel with decode-and-forward||Authors:||Ong, L.
|Issue Date:||2007||Citation:||Ong, L., Motani, M. (2007). Optimal routing for the Gaussian multiple-relay channel with decode-and-forward. IEEE International Symposium on Information Theory - Proceedings : 1061-1065. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2007.4557364||Abstract:||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. ©2007 IEEE.||Source Title:||IEEE International Symposium on Information Theory - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/51231||ISBN:||1424414296||ISSN:||21578101||DOI:||10.1109/ISIT.2007.4557364|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.