Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes

Simple item page
dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameCanadian Workshop on Information Theoryen_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:31Zen_US
dc.date.available2007-10-31T00:49:31Zen_US
dc.date.issued2003-05-01en_US
dc.date.modified2004-05-17en_US
dc.date.note2004-05-17en_US
dc.date.submitted2003-05-01en_US
dc.descriptionConference paperen_US
dc.description.abstractIn this paper, we derive achievable rates for arbitrary network topologies consisting of â cheapâ nodes. A node is labeled â cheapâ if its radio can only operate in TDD mode when transmitting and receiving in the same frequency band. Two main results are shown. The first result provides an achievable rate for the channel with either continuous alphabet or discrete channel. The second result provides the achievable rate for the Gaussian channel with average power constraint. The two results are applied to the case of Gaussian relay channel and concatenated channel with cheap nodesen_US
dc.identifier.citationM. Khojastepour, A. Sabharwal and B. Aazhang, "Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes," 2003.en_US
dc.identifier.urihttps://hdl.handle.net/1911/20012en_US
dc.language.isoengen_US
dc.subjectCheap relayen_US
dc.subjectAchievable rateen_US
dc.subjectnetworken_US
dc.subject.keywordCheap relayen_US
dc.subject.keywordAchievable rateen_US
dc.subject.keywordnetworken_US
dc.titleAchievable Rates for Arbitrary Network Topologies with â Cheapâ Nodesen_US
dc.typeConference paperen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Kho2003May5Achievable.PS
Size:
298.95 KB
Format:
Postscript Files
Download
Collections
ECE Publications