BROADCAST CHANNELS
BROADCAST CHANNELS
复制标题
DOI：
10.1109/tit.1972.1054727
复制
发表时间：
1972-01-01
影响因子：
2.5
通讯作者：
COVER, TM
中科院分区：
文献类型：
--
作者：
COVER, TM
我们引入了一个单一的源试图同时通信信息给几个接收器的问题。其目的是对具有多个接收器的广播器或具有许多听众的讲师的情况进行建模。因此，指定了具有公共输入字母表的几个不同通道。我们将确定许多极端频道类别的同时可达到的传输速率族。将找到容量区域的上界和下界，并将证明理论上可实现的速率族优于以前已知的分时和最大化过程可实现的速率族。这种改进是通过将高速率信息叠加在低速率信息上获得的。这些结果为研究复合通道问题提供了一种新的思路。
We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified. We shall determine the families of simultaneously achievable transmission rates for many extreme classes of channels. Upper and lower bounds on the capacity region will be found, and it will be shown that the family of theoretically achievable rates dominates the family of rates achievable by previously known time-sharing and maximin procedures. This improvement is gained by superimposing high-rate information on low-rate information. All of these results lead to a new approach to the compound channels problem.