Improved achievable rates for user cooperation and relay channels

Mohammad Ali Khojastepour, Ashutosh Sabharwal, Behnaam Aazhang

Research output: Contribution to journalConference articlepeer-review

26 Scopus citations

Abstract

We derive a new achievable rate region for the user cooperation channel, which exceeds the best known result for this channel [3]. Since the user cooperation channel includes many other known channels as a special case, the new rate region provides improved achievable rates for these cases. The most notable example is that of the Gaussian relay channel, for which we present a new closed form inner bound (Corollary 2) higher than the only known result (Theorem 5 in Cover and El Gamal) for many channel conditions.

Original languageEnglish (US)
Pages (from-to)4
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Improved achievable rates for user cooperation and relay channels'. Together they form a unique fingerprint.

Cite this