Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2009.5206072
DC FieldValue
dc.titleOptimal schedules for the D-node half duplex phase fading MRC
dc.contributor.authorOng, L.
dc.contributor.authorJohnson, S.J.
dc.contributor.authorMotani, M.
dc.date.accessioned2014-04-24T08:37:08Z
dc.date.available2014-04-24T08:37:08Z
dc.date.issued2009
dc.identifier.citationOng, 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
dc.identifier.isbn9781424443130
dc.identifier.issn21578102
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/51232
dc.description.abstractIn 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.2009.5206072
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/ISIT.2009.5206072
dc.description.sourcetitleIEEE International Symposium on Information Theory - Proceedings
dc.description.page1006-1010
dc.description.codenPISTF
dc.identifier.isiut000280141400205
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Dec 6, 2022

WEB OF SCIENCETM
Citations

1
checked on Dec 6, 2022

Page view(s)

174
checked on Dec 8, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.