The Optimal Constant for One-Shot Channel Simulation and Strong Functional Representation Lemma
Cheuk Ting Li
Abstract
We prove a tight bound for one-shot channel simulation via a stronger version of the strong functional representation lemma: for any random variables X,Y, there exists a random variable Z with I(Z;X)=H(Y|X,Z)=0 and H(Y|Z) I+ I+(1-γ) e- e+O(I-1 I), where I=I(X;Y) and γ is the Euler-Mascheroni constant. A more convenient bound is H(Y|Z)<I+(I+2)+1. The first bound is notable in the sense that the constant term (1-γ) e- e is optimal, and cannot be improved for any bound stated only in terms of I. Hence, this is the tightest form of the strong functional representation lemma up to the third order. We also prove that the Poisson functional representation is almost optimal up to a constant gap, and provide a simple finite-blocklength achievability bound that implies the (1/2) n redundancy of the simulation of memoryless non-singular channel. These are proved via a generalization of the functional information, in particular, the exponential functional information, which closely approximates the cost of one-shot channel simulation.
Create a lesson
Related papers
Optimal Preemption: Guaranteeing Information Freshness in Mean Age and Beyond
Aimin Li, Yiğit İnce, Elif Uysal
Spherical Tessellation of Circular Arrays for Massive MIMO: Favourable Propagation Conditions and Spectral Design
Geili T A El Sanousi, Tuan Anh Le, Raed A A Abd-Alhameed et al.
Physics-Informed Deep Learning for Channel Prediction in Satellite-Mounted Metasurface Reflection Communication Networks
Aolin Sun, Ruihong Jiang, Jincong Mo et al.
Two-Timescale Channel Estimation and Port Selection for Fluid Antenna Systems With Limited Port Observations
Xusheng Zhu, Kai-Kit Wong, Jiajian Wang et al.
Asymptotic Bounds for Codes in Toroidal Distance
Pengjie Zhong, Jinquan Luo
Feedback-Free FDD Cell-Free Massive MIMO With Sparse AP Activation and Dual-Mode Precoding
Wei Jiang, Hans Dieter Schotten