Channel Simulation: Finite Blocklengths and Broadcast Channels

• URL: http://arxiv.org/abs/2212.11666v3
• Date: Mon, 5 Aug 2024 09:28:04 GMT
• Title: Channel Simulation: Finite Blocklengths and Broadcast Channels
• Authors: Michael X. Cao, Navneeth Ramakrishnan, Mario Berta, Marco Tomamichel,
• Abstract summary: We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
• Score: 13.561997774592667
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance. We show that this one-shot converse can be achieved exactly using no-signaling-assisted codes, and approximately achieved using common randomness-assisted codes. Our one-shot converse thus takes on an analogous role to the celebrated meta-converse in the complementary problem of channel coding, and we find tight relations between these two bounds. We asymptotically expand our bounds on the simulation cost for discrete memoryless channels, leading to the second-order as well as the moderate deviation rate expansion, which can be expressed in terms of the channel capacity and channel dispersion known from noisy channel coding. Our bounds imply the well-known fact that the optimal asymptotic rate of one channel to simulate another under common randomness assistance is given by the ratio of their respective capacities. Additionally, our higher-order asymptotic expansion shows that this reversibility falls apart in the second order. Our techniques extend to discrete memoryless broadcast channels. In stark contrast to the elusive broadcast channel capacity problem, we show that the reverse problem of broadcast channel simulation under common randomness assistance allows for an efficiently computable single-letter characterization of the asymptotic rate region in terms of the broadcast channel's multipartite mutual information.

Related papers

• One-shot Multiple Access Channel Simulation [9.271640666465364]
  We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs. We characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth max-information of the channel.
  arXiv  Detail & Related papers  (2024-10-22T17:18:38Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Improving Continuous-variable Quantum Channels with Unitary Averaging [37.69303106863453]
  We present a scheme of passive linear optical unitary averaging for protecting unknown Gaussian states transmitted through an optical channel. The scheme reduces the effect of phase noise on purity, squeezing and entanglement, thereby enhancing the channel via a probabilistic error correcting protocol.
  arXiv  Detail & Related papers  (2023-11-17T10:10:19Z)
• Deep Reinforcement Learning for IRS Phase Shift Design in Spatiotemporally Correlated Environments [93.30657979626858]
  We propose a deep actor-critic algorithm that accounts for channel correlations and destination motion. We show that, when channels aretemporally correlated, the inclusion of the SNR in the state representation with function approximation in ways that inhibit convergence.
  arXiv  Detail & Related papers  (2022-11-02T22:07:36Z)
• Random Orthogonalization for Federated Learning in Massive MIMO Systems [85.71432283670114]
  We propose a novel communication design for federated learning (FL) in a massive multiple-input and multiple-output (MIMO) wireless system. Key novelty of random orthogonalization comes from the tight coupling of FL and two unique characteristics of massive MIMO -- channel hardening and favorable propagation. We extend this principle to the downlink communication phase and develop a simple but highly effective model broadcast method for FL.
  arXiv  Detail & Related papers  (2022-10-18T14:17:10Z)
• Data-Driven Upper Bounds on Channel Capacity [4.974890682815778]
  We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown alphabet output. A novel-driven algorithm is proposed that exploits dual representation where the minimization over the input distribution is replaced with a reference distribution on the channel output.
  arXiv  Detail & Related papers  (2022-05-13T06:59:31Z)
• Detecting positive quantum capacities of quantum channels [9.054540533394926]
  A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate. This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel. We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
  arXiv  Detail & Related papers  (2021-05-13T14:26:45Z)
• Model-Driven Deep Learning Based Channel Estimation and Feedback for Millimeter-Wave Massive Hybrid MIMO Systems [61.78590389147475]
  This paper proposes a model-driven deep learning (MDDL)-based channel estimation and feedback scheme for millimeter-wave (mmWave) systems. To reduce the uplink pilot overhead for estimating the high-dimensional channels from a limited number of radio frequency (RF) chains, we propose to jointly train the phase shift network and the channel estimator as an auto-encoder. Numerical results show that the proposed MDDL-based channel estimation and feedback scheme outperforms the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-04-22T13:34:53Z)
• Coherence dynamics induced by attenuation and amplification Gaussian channels [0.0]
  We study the coherence dynamics introduced by these channels on input states. We write a simple expression for computing the entropy production due to the coherence for both channels. This can be useful to simulate many processes in quantum thermodynamics, as finite-time driving on bosonic modes.
  arXiv  Detail & Related papers  (2020-10-29T01:21:03Z)
• Deep Learning Based Antenna Selection for Channel Extrapolation in FDD Massive MIMO [54.54508321463112]
  In massive multiple-input multiple-output (MIMO) systems, the large number of antennas would bring a great challenge for the acquisition of the accurate channel state information. We utilize the neural networks (NNs) to capture the inherent connection between the uplink and downlink channel data sets and extrapolate the downlink channels from a subset of the uplink channel state information. We study the antenna subset selection problem in order to achieve the best channel extrapolation and decrease the data size of NNs.
  arXiv  Detail & Related papers  (2020-09-03T13:38:52Z)
• Operation-Aware Soft Channel Pruning using Differentiable Masks [51.04085547997066]
  We propose a data-driven algorithm, which compresses deep neural networks in a differentiable way by exploiting the characteristics of operations. We perform extensive experiments and achieve outstanding performance in terms of the accuracy of output networks.
  arXiv  Detail & Related papers  (2020-07-08T07:44:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.