Rate-constrained relaying: Achievable rates and protocol comparisons

Ashutosh Sabharwal, Urbashi Mitra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper, the impact of limited resources on achievable rates in relay channels is investigated. Resource limitation is modeled (as previously proposed) by (R̄) which constrains the rate at which a relay can reliably decode or encode data. With this constraint in hand, the achievable rates for two commonly studied protocols, decode-and-forward and estimate-nd-forwarad are derived and_compared. In particular, the case of severe resource limitation (R 0) is considered. While decode-and-forward is the superior protocol for most relay locations (topologies) under no rate constraints, estimate-and forward almost always offers superior performance when relaying with strong rate constraints.

Original languageEnglish (US)
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages1216-1220
Number of pages5
DOIs
StatePublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2005
ISSN (Print)2157-8099

Conference

Conference2005 IEEE International Symposium on Information Theory, ISIT 05
Country/TerritoryAustralia
CityAdelaide
Period9/4/059/9/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Rate-constrained relaying: Achievable rates and protocol comparisons'. Together they form a unique fingerprint.

Cite this