By Topic

The Capacity of Gaussian Orthogonal Multiple-Access Relay Channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Junyun Cui ; State Key Lab. Of Intergrated Services Networks, Xidian Univ., Xi''an, China

This paper is concerned with the capacity of Gaussian orthogonal multi-access relay channel (OMARC) where multiple sources communicate with one destination in the presence of one relay. The achievability proof and converse for the capacity of Gaussian OMARC are given by ε-entropy-typical sequences and cut-set upper bound, respectively. The capacity of Gaussian OMARC is shown to have a max-flow min-cut interpretation.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 4 )