Rate-constrained Relaying: A Model for Cooperation with Limited Relay Resources
dc.citation.bibtexName | article | en_US |
dc.citation.journalTitle | IEEE Transactions on Information Theory | en_US |
dc.contributor.author | Sabharwal, Ashutosh | en_US |
dc.contributor.author | Mitra, Urbashi | en_US |
dc.contributor.org | Center for Multimedia Communications (http://cmc.rice.edu/) | en_US |
dc.date.accessioned | 2007-10-31T01:03:31Z | en_US |
dc.date.available | 2007-10-31T01:03:31Z | en_US |
dc.date.issued | 2005-06-01 | en_US |
dc.date.modified | 2005-06-17 | en_US |
dc.date.submitted | 2005-06-11 | en_US |
dc.description | Journal Paper | en_US |
dc.description.abstract | In this paper, the impact of limited resources on achievable rates in relay channels is investigated. Resource limitation is modeled as a rate constraint, Rbar, which constrains the rate at which a relay can reliably <i>decode</i> or <i>source-code</i> data. With this constraint in hand, the achievable rates for several protocols are derived and compared: decode-and-forward, estimate-and-forward, a Markovian amplify-and-forward and a hybrid scheme that combines decode-and-forward and amplify-and-forward. The key result is that the relative performance of these protocols in the unconstrained case is not maintained in rate constrained scenarios. The case of severe resource limitation (Rbar --> 0) is also considered. Previously established rates for unconstrained decode-and-forward and estimate-and-forward are re-examined in the context of optimal parameters and asymptotic performance. For most relay locations (topologies), either decode-and-forward and estimate-and-forward offers superior performance. However, for severe rate constraints, amplify-and-forward generally offers the best performance. | en_US |
dc.identifier.citation | A. Sabharwal and U. Mitra, "Rate-constrained Relaying: A Model for Cooperation with Limited Relay Resources," <i>IEEE Transactions on Information Theory,</i> 2005. | en_US |
dc.identifier.uri | https://hdl.handle.net/1911/20314 | en_US |
dc.language.iso | eng | en_US |
dc.relation.project | http://www.ece.rice.edu/~ashu | en_US |
dc.subject | Relay channel | en_US |
dc.subject | complexity | en_US |
dc.subject | achievable rates | en_US |
dc.subject | decode and forward | en_US |
dc.subject | estimate and forward | en_US |
dc.subject | amplify and forward | en_US |
dc.subject.keyword | Relay channel | en_US |
dc.subject.keyword | complexity | en_US |
dc.subject.keyword | achievable rates | en_US |
dc.subject.keyword | decode and forward | en_US |
dc.subject.keyword | estimate and forward | en_US |
dc.subject.keyword | amplify and forward | en_US |
dc.title | Rate-constrained Relaying: A Model for Cooperation with Limited Relay Resources | en_US |
dc.type | Journal article | en_US |
dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Sab2005Jun1Rateconstr.PDF
- Size:
- 440.55 KB
- Format:
- Adobe Portable Document Format