Title :
The Capacity of Gaussian Orthogonal Multiple-Access Relay Channel
Author_Institution :
State Key Lab. Of Intergrated Services Networks, Xidian Univ., Xi´´an, China
fDate :
4/1/2011 12:00:00 AM
Abstract :
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.
Keywords :
Gaussian channels; channel capacity; channel coding; entropy; minimax techniques; multi-access systems; network coding; set theory; ε-entropy-typical sequence; Gaussian orthogonal multiple-access relay channel capacity; cut-set upper bound; joint network channel coding; max-flow min-cut interpretation; Decoding; Encoding; Error probability; Interference; Parity check codes; Relays; Upper bound; Joint network channel coding; max-flow min-cut interpretation; multi-access relay network;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2011.012511.102075
