Please use this identifier to cite or link to this item:
|Title:||Optimal schedules for the D-node half duplex phase fading MRC|
|Source:||Ong, L., Johnson, S.J., Motani, M. (2009). Optimal schedules for the D-node half duplex phase fading MRC. IEEE International Symposium on Information Theory - Proceedings : 1006-1010. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2009.5206072|
|Abstract:||In this paper, we extend our previous work on the half duplex multiple-relay channel (MRC). A capacity upper bound based on the max-flow min-cut argument and achievable transmission rates based on the decode-forward coding strategy (DF) for the half duplex MRC have been shown to be functions of the schedule of the network, which is defined as the probability mass function of the transmit state vector (a description of which nodes transmit and which receive). Finding the optimal (rate-maximizing) schedule for DF can be formulated as a maximin optimization problem which is not easily solved in general. In our recent paper, we presented a technique to find optimal schedules for the 4-node MRC based on minimax hypothesis testing. Closed-form solutions were obtained for certain channel topologies. In this paper, we extend the technique to solve for optimal schedules for the general D-node half duplex MRC, where D ≥ 3. © 2009 IEEE.|
|Source Title:||IEEE International Symposium on Information Theory - Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 21, 2018
checked on Feb 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.