We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable with high probability by observing independent and identically distributed (i.i.d.) samples of correlated Gaussian sources and while communicating as little as possible over a noisy memoryless channel. We completely solve the problem by giving a single-letter characterization of the CR capacity for the proposed model and by providing a rigorous proof of it. Interestingly, we prove that the CR capacity is infinite when the Gaussian sources are perfectly correlated.
翻译:我们研究了在基本双方通信环境中常见随机生成(CR)的问题,在这种环境中,发送者和接收者旨在通过对相关高斯源的独立和同样分布(即d.)的样本进行观测,并在尽可能少地通过一个吵闹的没有记忆的频道进行沟通,从而商定一个概率很高的通用随机变量。我们完全解决问题的方法是,对拟议模型的CR能力进行单字母描述,并提供严格的证明。有趣的是,我们证明,当高斯源完全相关时,CR能力是无限的。