A coding theorem for the discrete memoryless compound multiple access channel with common message and generalized feedback

Author

Hajizadeh, Saeed ; Monemizadeh, Mostafa ; Hodtani, Ghosheh Abed

Author_Institution

Dept. of Electr. Eng., Ferdowsi Univ. of Mashhad, Mashhad, Iran

fYear

2012

Firstpage

1991

Lastpage

1996

Abstract

In this paper, we characterize an achievable rate region for the two-user discrete memoryless compound Multiple Access Channel (MAC) with common message and with generalized feedback (CMACC-GF). The achievable rate region that we provide is proved using a combination of rate splitting, Superposition Block Markov Encoding (SBME), and backward decoding. It is shown that the derived achievable rate for the CMACC-GF subsumes achievable regions for some classes of multiuser channels such as: the CMACC without feedback, CMACC with output feedback, strong interference channel with common message (SICC) and with generalized/output feedback as well as SICC without feedback.

Keywords

channel coding; multi-access systems; MAC; backward decoding; coding theorem; common message; generalized/output feedback; multiuser channels; strong interference channel; superposition block Markov encoding; two-user discrete memoryless compound multiple access channel; Compounds; Decoding; Encoding; Interference channels; Markov processes; Output feedback; Transmitters; Backward decoding; common message; compound multiple access channel; generalized feedback; superposition block Markov encoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on

Conference_Location

Monticello, IL

Print_ISBN

978-1-4673-4537-8

Type

conf

DOI

10.1109/Allerton.2012.6483466

Filename

6483466