On the Capacity of `Cheap' Relay Networks

Files in this item

Files Size Format View
Kho2003Apr5OntheCapa.PDF 205.2Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: On the Capacity of `Cheap' Relay Networks
Author: Khojastepour, Mohammad; Sabharwal, Ashutosh; Aazhang, Behnaam
Type: Conference Paper
Keywords: relay channel; capacity; cheap node
Citation: M. Khojastepour, A. Sabharwal and B. Aazhang,"On the Capacity of `Cheap' Relay Networks," in Conference on Information Sciences and Systems,
Abstract: We consider the communication problem in a multi-hop relay network where the intermediate relay nodes cannot transmit and receive at the same time. The motivation for this assumption comes from the fact that current radios operate in TDD mode when the transmitting and receiving frequencies are the same. We label such a node radio as a 'cheap' radio and the corresponding node of the network as a 'cheap' node. In this paper we derive the capacities of the degraded cheap relay channel and the multi-hop network with cheap nodes. The proof of the achievability parts in coding theorems are presented based on the jointly typical sequences, while the proof of the converses are derived from the direct application of the upper bounds derived in [7].
Date Published: 2003-04-20

This item appears in the following Collection(s)

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