Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
A new achievable rate and the capacity of some classes of multilevel relay network
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Degraded Gaussian multirelay channel: capacity and optimal power allocation
IEEE Transactions on Information Theory
On the capacity of large Gaussian relay networks
IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel
IEEE Transactions on Information Theory
Capacity of a class of relay channels with orthogonal components
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
IEEE Transactions on Information Theory
Analysis of a mixed strategy for multiple relay networks
IEEE Transactions on Information Theory
Optimal relay-subset selection and time-allocation in decode-and-forward cooperative networks
IEEE Transactions on Wireless Communications
| Hi-index | 754.91 |
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.