- Title
- Optimal schedules for the D-node half duplex phase fading MRC
- Creator
- Ong, Lawrence; Johnson, Sarah J.; Motani, Mehul
- Relation
- 2009 IEEE International Symposium on Information Theory (ISIT 2009). Proceedings of the 2009 IEEE International Symposium on Information Theory (Seoul, Korea 28 June - 3 July, 2009) p. 1006-1010
- Publisher Link
- http://dx.doi.org/10.1109/ISIT.2009.5206072
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Date
- 2009
- Description
- 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 ges 3.
- Subject
- fading channels; multiplexing; optimisation; relays; scheduling
- Identifier
- http://hdl.handle.net/1959.13/918939
- Identifier
- uon:8741
- Identifier
- ISBN:9781424443130
- Rights
- Copyright © 2009 IEEE. Reprinted from the Proceedings of the 2009 IEEE International Symposium on Information Theory. 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: 2131
- Visitors: 2794
- Downloads: 727
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT03 | Publisher version (open access) | 408 KB | Adobe Acrobat PDF | View Details Download |