scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Broadcast Approach to Multiple Access With Local CSIT

06 Aug 2019-IEEE Transactions on Communications (Institute of Electrical and Electronics Engineers (IEEE))-Vol. 67, Iss: 11, pp 7483-7498
TL;DR: A two-user multiple access channel is considered, in which the channels undergo slow block fading and the state of each channel is known only to its corresponding transmitter, and a novel broadcast strategy for multiple access communication is proposed.
Abstract: A two-user multiple access channel is considered, in which the channels undergo slow block fading and the state of each channel is known only to its corresponding transmitter. This paper proposes a novel broadcast strategy for multiple access communication in this channel. In the broadcast approach, in principle, a transmitter with CSI uncertainty sends multiple independent superimposed information layers where the rate of each layer is adapted to a specific channel realization. In the existing broadcast approaches to multiuser communication, the transmitters often directly adopt a single-user strategy and each transmitter adapts its transmission to one unknown channel. The novel aspect of the proposed strategy is that it adapts the designed codebooks to the state of the entire network. This is motivated by the fact that the contribution of each user to the network-wide measures (e.g., capacity region) depends not only on the user’s direct channel to the receiver, but also on the qualities of other channels. Average achievable rate region and outer bounds on the capacity region are characterized. Furthermore, the expected capacity region is investigated, where most part of the capacity region boundary is characterized. Finally, an asymptotic capacity region is also characterized.
Citations
More filters
Book ChapterDOI
01 Jan 1978

272 citations

Posted Content
TL;DR: In this article, a single-letter characterization of the capacity region of finite-state multiple-access channels is provided, where the channel state process is an independent and identically distributed sequence, the transmitters have access to partial (quantized) state information, and complete channel state information is available at the receiver.
Abstract: A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial (quantized) state information, and complete channel state information is available at the receiver. The partial channel state information is assumed to be asymmetric at the encoders. As a main contribution, a tight converse coding theorem is presented. The difficulties associated with the case when the channel state has memory are discussed and connections to decentralized stochastic control theory are presented.

20 citations

Journal ArticleDOI
TL;DR: This article focuses on the two-user interference channel and proposes a broadcast approach to interference management, whose hallmark is that the transmitters, unlike the receivers, are entirely oblivious to instantaneous channel states.
Abstract: Effective interference management in the multiuser interference channel strongly hinges on the channel state information’s availability at the transmitters (CSIT). In a broad range of emerging large-scale and distributed networks (e.g., the Internet of Things), acquiring the CSIT is prohibitive due to the extensive information exchange that it imposes. As a result, the interference management approaches that rely on the CSIT lose their effectiveness in such circumstances. This article focuses on the two-user interference channel and proposes a broadcast approach to interference management. Its hallmark is that the transmitters, unlike the receivers, are entirely oblivious to instantaneous channel states. Each transmitter splits its message into multiple superimposed encoded information layers, where each layer is adapted to a given possible state for the combined states of all channels. Depending on the relative gain between the direct and interfering channels, each receiver opportunistically decodes a subset of both transmitters’ received layers. An average achievable rate region is delineated, serving as an inner bound on the Gaussian interference channel’s average capacity region in the absence of CSIT. Finally, an upper bound on the gap between the achievable sum-rate and the sum-rate capacity is established.

13 citations


Cites background from "Broadcast Approach to Multiple Acce..."

  • ...This approach is then studied under various assumptions for multiple access communications [61]–[66], and for interference channels in [18]–[20]....

    [...]

Journal ArticleDOI
TL;DR: In this article, the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations are reviewed.
Abstract: This paper reviews the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. When the temporal variations are frequent enough, an effective long-term strategy is adapting the transmission strategies to the system's ergodic behavior. However, when the variations are infrequent, their temporal average can deviate significantly from the channel's ergodic mode, rendering a lack of instantaneous performance guarantees. To circumvent a lack of short-term guarantees, the {\em broadcast approach} provides principles for designing transmission schemes that benefit from both short- and long-term performance guarantees. This paper provides an overview of how to apply the broadcast approach to various channels and network models under various operational constraints.

9 citations

DOI
26 Feb 2020
TL;DR: The single user parallel multiple input multiple output (MIMO) slow (block) flat fading channel, subject to a two-state fading per channel with additive white Gaussian noise (AWGN) is examined.
Abstract: The single user parallel multiple input multiple output (MIMO) slow (block) flat fading channel, subject to a two-state fading per channel with additive white Gaussian noise (AWGN) is examined. The fading in each of the parallel channels is interpreted as state, which takes on two values with prescribed probabilities. We focus here on the variable to fixed channel rate (the broadcast approach) where a novel view of extension of El-Gamal’s capacity of degraded broadcast product channels is examined. The optimized average rate is analytically derived over the parameters of the proposed scheme, and comparison to the simple scheme that employs the broadcast approach per each of the parallel channels separately. The achievable improvement in rates under the latency demand (transmission in a single fading block) is reflected.

2 citations


Cites methods from "Broadcast Approach to Multiple Acce..."

  • ...This is by analyzing the finite state parallel MIMO channel, where El-Gamal’s capacity region [15] is used to address the multi-layering optimization problem for maximizing the expected rate of a two-state fading [19]–[21] parallel MIMO channel....

    [...]

References
More filters
Proceedings ArticleDOI
18 Jun 1995
TL;DR: By examining the bit error-rate with antipodal signalling, it is shown that an increase in capacity over a perfectly-power controlled (Gaussian) channel can be achieved, especially if the number of users is large, and the inherent diversity in multiuser communications over fading channels is shown.
Abstract: We consider a power control scheme for maximizing the information capacity of the uplink in single-cell multiuser communications with frequency-flat fading, under the assumption that the users attenuations are measured perfectly. Its main characteristics are that only one user transmits over the entire bandwidth at any particular time instant and that the users are allocated more power when their channels are good, and less when they are bad. Moreover, these features are independent of the statistics of the fading. Numerical results are presented for the case of single-path Rayleigh fading. We show that an increase in capacity over a perfectly-power controlled (Gaussian) channel can be achieved, especially if the number of users is large. By examining the bit error-rate with antipodal signalling, we show the inherent diversity in multiuser communications over fading channels.

2,265 citations

Journal ArticleDOI
TL;DR: This paper describes the statistical models of fading channels which are frequently used in the analysis and design of communication systems, and focuses on the information theory of fading channel, by emphasizing capacity as the most important performance measure.
Abstract: In this paper we review the most peculiar and interesting information-theoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both single-user and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.

2,017 citations


"Broadcast Approach to Multiple Acce..." refers background in this paper

  • ...for assessing the reliability of wireless networks [1] and [2]....

    [...]

Journal ArticleDOI
TL;DR: This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.
Abstract: We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified. We shall determine the families of simultaneously achievable transmission rates for many extreme classes of channels. Upper and lower bounds on the capacity region will be found, and it will be shown that the family of theoretically achievable rates dominates the family of rates achievable by previously known time-sharing and maximin procedures. This improvement is gained by superimposing high-rate information on low-rate information. All of these results lead to a new approach to the compound channels problem.

1,781 citations

Journal ArticleDOI
TL;DR: Some information-theoretic considerations used to determine upper bounds on the information rates that can be reliably transmitted over a two-ray propagation path mobile radio channel model, operating in a time division multiplex access (TDMA) regime, under given decoding delay constraints are presented.
Abstract: We present some information-theoretic considerations used to determine upper bounds on the information rates that can be reliably transmitted over a two-ray propagation path mobile radio channel model, operating in a time division multiplex access (TDMA) regime, under given decoding delay constraints. The sense in which reliability is measured is addressed, and in the interesting eases where the decoding delay constraint plays a significant role, the maximal achievable rate (capacity), is specified in terms of capacity versus outage. In this case, no coding capacity in the strict Shannon sense exists. Simple schemes for time and space diversity are examined, and their potential benefits are illuminated from an information-theoretic stand point. In our presentation, we chose to specialize to the TDMA protocol for the sake of clarity and convenience. Our main arguments and results extend directly to certain variants of other multiple access protocols such as code division multiple access (CDMA) and frequency division multiple access (FDMA), provided that no fast feedback from the receiver to the transmitter is available. >

1,216 citations


"Broadcast Approach to Multiple Acce..." refers background in this paper

  • ...for assessing the reliability of wireless networks [1] and [2]....

    [...]

Proceedings Article
01 Jan 1973

757 citations