Parity Forwarding for Multiple-Relay Networks

Simple item page
dc.creatorRazaghi, P.
dc.creatorYu, W.
dc.date2007-11-17
dc.date.accessioned2026-07-07T08:43:36Z
dc.date.available2026-07-07T08:43:36Z
dc.descriptionThis 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.
dc.descriptionsubmitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/0711.2712
dc.identifierhttp://arxiv.org/abs/0711.2712
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142370
dc.subjectInformation Theory
dc.titleParity Forwarding for Multiple-Relay Networks
dc.typetext

Files

Collections

arXiv