The Capacity of Gaussian Orthogonal Multiple-Access Relay Channel

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.