Resolvability Theory for the Multiple-Access Channel
Resolvability Theory for the Multiple-Access Channel
复制标题
多址信道的可解析性理论
DOI：
10.1109/18.661498
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Y. Steinberg
中科院分区：
文献类型：
--
作者：
Y. Steinberg
我们研究的随机性所需的近似输出分布的多路访问信道，其中原始的输入过程是相互独立的。近似是通过模拟（可能替代）输入过程中的每个条目，其中的随机性源可用于模拟器是彼此独立的，模拟器不合作。多址接入信道的可分辨区域被定义为所有随机比特率对的集合，在该集合上，精确的输出近似是可能的，其中仿真精度由有限维输出分布之间的变化距离来测量。导出了可分解域的内、外界，并论证了可分解域与容量域概念之间的密切关系。
We study the randomness needed for approximating the output distribution of a multiple-access channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are independent of each other, and the simulators do not cooperate. The resolvability region of a multiple-access channel is defined as the set of all random-bit rate pairs at which accurate output approximation is possible, where the simulation accuracy is measured by the variational distance between finite-dimensional output distributions. Inner and outer bounds on the resolvability region are derived, and close relations between the concepts of resolvability region and capacity region are demonstrated.