Show simple item record

dc.contributor.authorKhojastepour, Mohammad
Sabharwal, Ashutosh
Aazhang, Behnaam
dc.creatorKhojastepour, Mohammad
Sabharwal, Ashutosh
Aazhang, Behnaam 2007-10-31T00:49:31Z 2007-10-31T00:49:31Z 2003-05-01 2003-05-01
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.language.iso eng
dc.subjectCheap relay
Achievable rate
dc.title Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes
dc.type Conference paper 2004-05-17
dc.citation.bibtexName inproceedings 2004-05-17
dc.contributor.orgCenter for Multimedia Communications (
dc.subject.keywordCheap relay
Achievable rate
dc.citation.conferenceName Canadian Workshop on Information Theory
dc.type.dcmi Text
dc.identifier.citation M. Khojastepour, A. Sabharwal and B. Aazhang, "Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes," 2003.

Files in this item


This item appears in the following Collection(s)

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

Show simple item record