For the Gaussian case, we also derived an inner bound using GDPC and an outer bound by providing the channel state to the decoder also.
Figures 7 and 8 illustrate the inner bound in Corollary 3 and the outer bound in Proposition 3 in two cases, and, respectively, for and.
As increases and, in the strong additive Gaussian state case, the inner bound in Corollary 3 and the outer bound in Proposition 3 meet asymptotically.
First, we consider a class of degraded MA-CIFC and derive conditions under which the inner bound in Theorem 1 achieves the outer bound of Theorem 4. Next, we investigate the strong interference regime by deriving two sets of strong interference conditions under which the region of Theorem 3 achieves capacity.
Figure 5 depicts the inner bound using GDPC given in Theorem 2 and the outer bound specified in Proposition 2 for the case in which,,, and.
Figure 2 depicts the inner bound using generalized binary DPC specified in Corollary 1 and the outer bound specified in Proposition 1 for the case in which,, and.
The following theorem presents the second inner bound.
The following theorem provides an inner bound for the DM case.
Of course, it is desirable to find the outermost inner bound.
In this section, we discuss the inner bound in Theorem 2 as.
The following definition and theorem give an inner bound for the Gaussian MAC with one informed encoder.
