Please use this identifier to cite or link to this item:
|Title:||Achievable rates and schedules for half duplex phase fading multiple-relay networks|
|Source:||Ong, L.,Wang, W.,Motani, M. (2008). Achievable rates and schedules for half duplex phase fading multiple-relay networks. 2008 International Symposium on Information Theory and its Applications, ISITA2008 : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ISITA.2008.4895550|
|Abstract:||We present part of our work on the capacity upper bound, achievable rates, and scheduling for the half duplex multiple-relay channel (HD MRC) where every node can either transmit or listen, but not both, at any time. We derive a capacity upper bound based on the cut-set argument, and achievable rates based on the decode-forward coding strategy (DF). We discover that the upper bound and achievable rates are functions of the transmit state vector (a description of which nodes transmit and which receive). More precisely, they are functions of the time fraction of different transmit state vectors, which we term a schedule. We formulate the optimal scheduling problem to find the best schedule, one that maximizes the DF rate. For the phase fading HD MRC, surprisingly, we show that the expressions for the capacity upper bound and for DF rate can be transformed into linear programming problems.|
|Source Title:||2008 International Symposium on Information Theory and its Applications, ISITA2008|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.