Capacity of a class of relay channels with orthogonal components

Authors:
A. El Gamal;S. Zahedi
Affiliations:
Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 23

On-demand diversity wireless relay networks

Mobile Networks and Applications
Relaying protocols for two colocated users

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cooperative communications

Foundations and Trends® in Networking
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
On the ergodic capacity of multi-hop wireless relaying systems

IEEE Transactions on Wireless Communications
Secrecy capacity of a class of orthogonal relay eavesdropper channels

EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Parity forwarding for multiple-relay networks

IEEE Transactions on Information Theory
Ergodic channel capacities for the amplify-and-forward half-duplex cooperative systems

IEEE Transactions on Information Theory
Information secrecy from multiple eavesdroppers in orthogonal relay channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Achievable rates and capacity for Gaussian relay channels with correlated noises

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Transmission schedule optimization for half-duplex multiple-relay networks

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Ei-Transform: a useful and general framework for channel capacity analysis over fading channels

SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
On the sum-capacity of degraded Gaussian multiple-access relay channels

IEEE Transactions on Information Theory
Level crossing rate and average outage duration of incremental DF relay channel

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Capacity of a class of modulo-sum relay channels

IEEE Transactions on Information Theory
Compound relay channel with informed relay and destination

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Capacity performance of amplify-and-forward MIMO relay with transmit antenna selection and maximal-ratio combining

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Relay scheduling in the half-duplex Gaussian parallel relay channel

IEEE Transactions on Information Theory
Cooperative wireless multicast: performance analysis and power/location optimization

IEEE Transactions on Wireless Communications
On the capacity of a class of relay channels with orthogonal components and noncausal state information at source

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Optimum power loading for non-coherent frequency-selective relay channels

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Cooperation with an untrusted relay: a secrecy perspective

IEEE Transactions on Information Theory
Rate allocation for cooperative orthogonal-division channels with dirty-paper coding

IEEE Transactions on Communications

Quantified Score

Hi-index	755.20

Visualization

Abstract

The capacity of a class of discrete-memoryless relay channels with orthogonal channels from the sender to the relay receiver and from the sender and relay to the receiver is shown to be equal to the max-flow min-cut upper bound. The result is extended to additive white Gaussian noise (AWGN) relay channels where the channel from the sender to the relay uses a different frequency band from the channel from the sender and the relay to the receiver.