Computer Science – Information Theory
Scientific paper
2007-11-17
Computer Science
Information Theory
submitted to IEEE Transactions on Information Theory
Scientific paper
This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwards parities of the decoded codewords. This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages from relays with strong links to it. Hence, each relay may have several choices as to which messages to decode, and for a given network many different parity forwarding protocols may exist. A tree structure is devised to characterize a class of parity forwarding protocols for an arbitrary multirelay network. Based on this tree structure, closed-form expressions for the achievable rates of these DF schemes are derived. It is shown that parity forwarding is capacity achieving for new forms of degraded relay networks.
Razaghi Peyman
Yu Wenfei
No associations
LandOfFree
Parity Forwarding for Multiple-Relay Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parity Forwarding for Multiple-Relay Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parity Forwarding for Multiple-Relay Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-60950