Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userZero-Error Capacity of Multiple Access Channels via Nonstochastic Information
79
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of nonstochastic information is applied to characterise the zero-error capacity region for the case of two correlated transmitters. Unlike previous contributions, this analysis does not assume that the blocklength is asymptotically large. Finally, a new notion of nonstochastic information is proposed for a noncooperative problem involving three agents. These results are preliminary steps towards understanding information flows in worst-case distributed estimation and control problems.
rate research
Read More
Intelligent reflecting surface (IRS) is a new promising technology that is able to manipulate the wireless propagation channel via smart and controllable signal reflection. In this paper, we investigate the capacity region of a multiple access channel (MAC) with two users sending independent messages to an access point (AP), aided by $M$ IRS reflecting elements. We consider two practical IRS deployment strategies that lead to different user-AP effective channels, namely, the distributed deployment where the $M$ reflecting elements form two IRSs, each deployed in the vicinity of one user, versus the centralized deployment where all the $M$ reflecting elements are deployed in the vicinity of the AP. For the distributed deployment, we derive the capacity region in closed-form; while for the centralized deployment, we derive a capacity region outer bound and propose an efficient rate-profile based method to characterize an achievable rate region (or capacity region inner bound). Furthermore, we compare the capacity regions of the two cases and draw useful insights into the optimal deployment of IRS in practical systems.
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information.
Rate-splitting multiple access (RSMA) is a promising technique for downlink multi-antenna communications owning to its capability of enhancing the system performance in a wide range of network loads, user deployments and channel state information at the transmitter (CSIT) inaccuracies. In this paper, we investigate the achievable rate performance of RSMA in a multi-user multiple-input single-output (MU-MISO) network where only slow-varying statistical channel state information (CSI) is available at the transmitter. RSMA-based statistical beamforming and the split of the common stream is optimized with the objective of maximizing the minimum user rate subject to a sum power budget of the transmitter. Two statistical CSIT scenarios are investigated, namely the Rayleigh fading channels with only spatial correlations known at the transmitter, and the uniform linear array (ULA) deployment with only channel amplitudes and mean of phase known at the transmitter. Numerical results demonstrate the explicit max min fairness (MMF) rate gain of RSMA over space division multiple access (SDMA) in both scenarios. Moreover, we demonstrate that RSMA is more robust to the inaccuracy of statistical CSIT.
The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channels zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may require more than one channel use. These phenomena do not occur when the state is revealed to the transmitter causally, a case that is solved here using Shannon strategies. Cost constraints on the channel inputs or channel states are also discussed, as is the scenario where---in addition to the message---also the state sequence must be recovered.
Wireless connectivity creates a computing paradigm that merges communication and inference. A basic operation in this paradigm is the one where a device offloads classification tasks to the edge servers. We term this remote classification, with a potential to enable intelligent applications. Remote classification is challenged by the finite and variable data rate of the wireless channel, which affects the capability to transfer high-dimensional features and thus limits the classification resolution. We introduce a set of metrics under the name of classification capacity that are defined as the maximum number of classes that can be discerned over a given communication channel while meeting a target classification error probability. The objective is to choose a subset of classes from a library that offers satisfactory performance over a given channel. We treat two cases of subset selection. First, a device can select the subset by pruning the class library until arriving at a subset that meets the targeted error probability while maximizing the classification capacity. Adopting a subspace data model, we prove the equivalence of classification capacity maximization to Grassmannian packing. The results show that the classification capacity grows exponentially with the instantaneous communication rate, and super-exponentially with the dimensions of each data cluster. This also holds for ergodic and outage capacities with fading if the instantaneous rate is replaced with an average rate and a fixed rate, respectively. In the second case, a device has a preference of class subset for every communication rate, which is modeled as an instance of uniformly sampling the library. Without class selection, the classification capacity and its ergodic and outage counterparts are proved to scale linearly with their corresponding communication rates instead of the exponential growth in the last case.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
