Article

The feedback capacity region of a class of discrete memoryless multiple access channels (Corresp.)

IEEE Transactions on Information Theory (impact factor: 3.01). 02/1982; DOI:10.1109/TIT.1982.1056437 pp.93 - 95
Source: IEEE Xplore

ABSTRACT The capacity region of a class of discrete memoryless multiple access channels with feedback is determined, including as a special case the channel considered by Gaarder and Wolf.

0 0
 · 
0 Bookmarks
 · 
31 Views
  • Source
    Article: Interference Channels with Rate-Limited Feedback
    Alireza Vahid, Changho Suh, Amir Salman Avestimehr
    [show abstract] [hide abstract]
    ABSTRACT: We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new challenges arise due to the capacity limitations of the feedback links, both in deriving inner-bounds and outer-bounds. We study this problem under three different interference models: the El Gamal-Costa deterministic model, the linear deterministic model, and the Gaussian model. For the first two models, we develop an achievable scheme that employs three techniques: Han-Kobayashi message splitting, quantize-and-binning, and decode-and-forward. We also derive new outer-bounds for all three models and we show the optimality of our scheme under the linear deterministic model. In the Gaussian case, we propose a transmission strategy that incorporates lattice codes, inspired by the ideas developed in the first two models. For symmetric channel gains, we prove that the gap between the achievable sum-rate of the proposed scheme and our new outer-bounds is bounded by a constant number of bits, independent of the channel gains.
    03/2011;
  • Source
    Article: On the Computation of the Capacity Region of the Discrete MAC
    E. Calvo, D.P. Palomar, J.R. Fonollosa, J. Vidal
    [show abstract] [hide abstract]
    ABSTRACT: The computation of the channel capacity of discrete memoryless channels is a convex problem that can be efficiently solved using the Arimoto-Blahut (AB) iterative algorithm. However, the extension of this algorithm to the computation of capacity regions of multiterminal networks is not straightforward since it gives rise to non-convex problems. In this context, the AB algorithm has only been successfully extended to the calculation of the sum-capacity of the discrete memoryless multiple-access channel (DMAC). Thus, the computation of the whole capacity region still requires the use of computationally demanding search methods. In this paper, we first give an alternative reformulation of the capacity region of the DMAC which condenses all the non-convexities of the problem into a single rank-one constraint. Then, we propose efficient methods to compute outer and inner bounds on the capacity region of the two-user DMAC by solving a relaxed version of the problem and projecting its solution onto the original feasible set. Targeting numerical results, we first take a randomization approach. Focusing on analytical results, we study projection via minimum divergence, which amounts to the marginalization of the relaxed solution. In this case we derive sufficient conditions and necessary and sufficient conditions for the bounds to be tight. Furthermore, we are able to show that the class of channels for which the marginalization bounds match exactly the capacity region includes all the two-user binary-input deterministic DMACs as well as other non-deterministic channels. In general, however, both methods are able to compute very tight bounds as shown for various examples.
    IEEE Transactions on Communications 01/2011; · 1.68 Impact Factor
  • Source
    Article: On the AWGN MAC With Imperfect Feedback
    A. Lapidoth, M. Wigger
    [show abstract] [hide abstract]
    ABSTRACT: New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irrespective of the (finite) Gaussian feedback-noise variances, the regions include rate points that lie outside the no-feedback capacity region, and when the feedback-noise variances tend to zero the regions converge to the perfect-feedback capacity region. The new achievable regions also apply to the partial-feedback setting where one of the transmitters has a noisy feedback link and the other transmitter has no feedback at all. Again, irrespective of the (finite) noise variance on the feedback link, the regions include rate points that lie outside the no-feedback capacity region. Moreover, in the case of perfect partial feedback, i.e., where the only feedback link is noise-free, for certain channel parameters the new regions include rate points that lie outside the Cover-Leung region. This answers in the negative the question posed by van der Meulen as to whether the Cover-Leung region equals the capacity region of the Gaussian multiple-access channel with perfect partial feedback. Finally, we propose new achievable regions also for a setting where the receiver is cognizant of the realizations of the noise sequences on the feedback links.
    IEEE Transactions on Information Theory 12/2010; · 3.01 Impact Factor

Show more

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

discrete memoryless multiple access channels
 
Gaarder
 
special case
 

F. Willems