Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes

Show full item record

Title: Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes
Author: Khojastepour, Mohammad; Sabharwal, Ashutosh; Aazhang, Behnaam
Type: Conference Paper
Keywords: Cheap relay; Achievable rate; network
Center: Center for Multimedia Communications
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
URI: http://hdl.handle.net/1911/20012
Date Published: 2003-05-01

Files in this item

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

This item appears in the following Collection(s)

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

Show full item record

Browse

My Account