Search
CSV
RISGaussian doubly dirty compound multiple-access channel with partial side information at the transmitters
Abstract: In this study, the authors study a two-user Gaussian doubly dirty compound multiple-access channel with partial side information (GDD-CMAC-PSI) where two independent additive interference signals are considered, each one known noncausally...
An Achievable Rate Region and a Capacity Outer Bound for Three-User Gaussian Multiple Access Channel with Feedback
Extension of the Ozarow capacity theorem [1] for two transmitter Gaussian multiple access channel with feedback (TT-GMAC-F) to the channels with more than two transmitters is a widely studied and long standing problem (for example, see the Kramer...
Capacity for the doubly dirty multiple access channel with partial side information at the transmitters
Abstract: In this study, the authors establish achievable rate and capacity regions for three kinds of Gaussian multiple access channels (MACs) with side information (SI) partially (estimated or sensed version) and non-causally known...
Capacity Region of the Compound Multiple Access Channels with Common Message and in the Presence of Intersymbol Interference
The capacity region of a two-user linear Gaussian compound Multiple Access Channel with common message (CMACC) and intersymbol interference (ISI) under an input power constraint is derived. To obtain the capacity region we first convert the channel...
Compound Multiple Access Channel with Common Message and Intersymbol Interference
Abstract—In this paper, we characterize the capacity region for
the two-user linear Gaussian compound Multiple Access Channel
with common message (MACC) and with intersymbol
interference (ISI) under an input power constraint...
Achievable Rate Regions for Compound MultipleAccess Channel with Channel State Information
Abstract—We study the two-user discrete memoryless compound
multiple access channel (MAC) with common message and two
specially correlated channel states each known non-causally by
one of the encoders. Two channel states...
State-Dependent Multiple Access Channels with Feedback
Abstract—In this paper, we examine discrete memoryless
Multiple Access Channels (DM-MACs) with feedback in the
presence of two correlated channel states, each known to one
encoder. Depending on feedback is two-sided or one...
Numerical Computation of Discrete Memoryless Channels with Causal Side Information
The computation of capacity for discrete memoryless channels can be efficiently solved by using the Arimoto-
Blahut (AB) iterative algorithm. However, the extension of this algorithm to compute the capacity for ...
Finite Field Spreading for Multiple-Access Channel
A Coding Theorem for the Discrete Memoryless Compound Multiple Access Channel with Common Message and Generalized Feedback
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...