On Capacity of Gaussian â Cheapâ Relay Channel

Simple item page
dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameGlobecomen_US
dc.contributor.authorKhojastepour, Mohammaden_US
dc.contributor.authorSabharwal, Ashutoshen_US
dc.contributor.authorAazhang, Behnaamen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:49:29Z
dc.date.available2007-10-31T00:49:29Z
dc.date.issued2003-12-01
dc.date.modified2004-05-17en_US
dc.date.note2004-05-17en_US
dc.date.submitted2003-12-01en_US
dc.descriptionConference Paperen_US
dc.description.abstractIn this paper, we derive the capacity of the Gaussian degraded â cheapâ relay channel, consisting of nodes using â cheapâ radios operating in TDD mode when transmitting and sending in the same frequency band. The TDD model captures a practical limitation of most of the RF radios used in commercial wireless systems. The proof of achievability relies on a combination of superposition encoding and list decoding, while the converse is derived using the min-cut max-flow theorem for networks with â cheapâ nodes (previously derived by the authors). Even with â cheapâ radios, our capacity analysis shows that cooperative coding is beneficial and has a capacity advantage over direct transmission.en_US
dc.identifier.citationM. Khojastepour, A. Sabharwal and B. Aazhang, "On Capacity of Gaussian â Cheapâ Relay Channel," 2003.
dc.identifier.urihttps://hdl.handle.net/1911/20011
dc.language.isoeng
dc.subjectcheap relay*
dc.subjectgaussian*
dc.subjectcapacity*
dc.subject.keywordcheap relayen_US
dc.subject.keywordgaussianen_US
dc.subject.keywordcapacityen_US
dc.titleOn Capacity of Gaussian â Cheapâ Relay Channelen_US
dc.typeConference paper
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kho2003Dec5OnCapacity.PDF
Size:
113.21 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications