|Publisher version (open access)||1 MB||Adobe Acrobat PDF||View/Open
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/921525
- Achievable rates and schedules for half duplex phase fading multiple-relay networks
- 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.
- International Symposium on Information Theory and Its Applications, 2008 (ISITA 2008). Proceedings of the International Symposium on Information Theory and Its Applications, ISITA 2008 (Auckland, New Zealand 7-10 December, 2008)
- Publisher Link
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Copyright © 2008 IEEE. Reprinted from the Proceedings of the International Symposium on Information Theory and Its Applications, ISITA 2008. 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 firstname.lastname@example.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text