IEEE-50th Annual Allerton Conference on Communication, Control, and Computing - 2012 , 2012-10-01

Title : ( A Coding Theorem for the Discrete Memoryless Compound Multiple Access Channel with Common Message and Generalized Feedback )

Authors: Saeed Hajizadeh , mostafa monemizadeh , Ghosheh Abed Hodtani ,
File:

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

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

, Keywords, Backward decoding; common message; compound multiple access channel; generalized feedback; superposition block Markov encoding;