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 full item record

Item Metadata

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
Citation: M. Khojastepour, A. Sabharwal and B. Aazhang,"Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes," in Canadian Workshop on Information Theory,
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
Date Published: 2003-05-01

This item appears in the following Collection(s)

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