DocumentCode :
3063697
Title :
On the capacity region of a multiple access channel with common messages
Author :
Gündüz, D. ; Simeone, O.
Author_Institution :
Centre Tecnol. de Telecomunicacions de Catalunya (CTTC), Barcelona, Spain
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
470
Lastpage :
474
Abstract :
The capacity region for a multiple access channel (MAC) with arbitrary sets of common messages was derived by Han in 1979, extending a result by Slepian and Wolf from 1973. The general characterization by Han involves one auxiliary random variable per message and one inequality per subset of messages. In this paper, at first, a special hierarchy of common messages is identified for which the capacity region is characterized with generally fewer auxiliary random variables and inequalities. It is also shown that this characterization requires no auxiliary random variable for certain message structures. A procedure is then proposed to transform any common message structure to this special hierarchy, leading to a general capacity characterization which generally requires fewer auxiliary random variables than the one given by Han.
Keywords :
channel capacity; multi-access systems; multiuser channels; random processes; auxiliary random variable; channel capacity; common message; multiple access channel; Capacity planning; Degradation; Memoryless systems; Probability distribution; Random variables; Telecommunications; Time sharing computer systems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
Type :
conf
DOI :
10.1109/ISIT.2010.5513444
Filename :
5513444
Link To Document :
بازگشت