deposit_your_work

Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes

Files in this item

Files Size Format View
Kho2003May5Achievable.PS 306.1Kb application/postscript View/Open

Show simple item record

Item Metadata

dc.contributor.author Khojastepour, Mohammad
Sabharwal, Ashutosh
Aazhang, Behnaam
dc.creator Khojastepour, Mohammad
Sabharwal, Ashutosh
Aazhang, Behnaam
dc.date.accessioned 2007-10-31T00:49:31Z
dc.date.available 2007-10-31T00:49:31Z
dc.date.issued 2003-05-01
dc.date.submitted 2003-05-01
dc.identifier.uri http://hdl.handle.net/1911/20012
dc.description Conference Paper
dc.description.abstract In 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 nodes
dc.subject Cheap relay
Achievable rate
network
dc.title Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes
dc.type Conference Paper
dc.date.note 2004-05-17
dc.citation.bibtexName inproceedings
dc.date.modified 2004-05-17
dc.contributor.center Center for Multimedia Communications (http://cmc.rice.edu/)
dc.subject.keyword Cheap relay
Achievable rate
network
dc.citation.conferenceName Canadian Workshop on Information Theory
dc.identifier.citation M. Khojastepour, A. Sabharwal and B. Aazhang,"Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes," in Canadian Workshop on Information Theory,

This item appears in the following Collection(s)

  • ECE Publications [1082 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students