论文标题
信息瓶颈频道的广播方法
Broadcast Approach for the Information Bottleneck Channel
论文作者
论文摘要
这项工作考虑了一种分层的编码方法,用于在没有发射机通道状态信息(CSI)的无线块褪色通道上有效传输数据,该方法连接到有限的容量可靠链路(称为瓶颈通道)。考虑了两种主要方法,第一种方法是一种忽略的方法,在该方法中,采样的嘈杂观测值在瓶颈通道上被压缩和传输,而无需任何原始信息代码书。第二种方法是一种非掩盖解析(DF)继电器,在其中解码了采样的噪声数据,并且成功解码的任何内容都可以通过瓶颈通道可靠地传播。从继电器到目的地的瓶颈通道具有固定的容量C。我们还检查了由于回程链路上可变负载而导致的通道容量可以动态变化的情况。分析了只有接力赛知道下一个区块的可用容量的情况,并且对于源或中继不知道每个块的容量,而只有其容量分配的情况。幸运的是,有可能以封闭形式表达式进行分析描述,即最佳连续分层功率分布,从而最大化平均可实现的速率。数值结果证明了可实现的广播率。
This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. The second approach is a non-oblivious decode-forward (DF) relay where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. The bottleneck channel from relay to destination has a fixed capacity C. We examine also the case where the channel capacity can dynamically change due to variable loads on the backhaul link. The broadcast approach is analyzed for cases that only the relay knows the available capacity for next block, and for the case that neither source nor relay know the capacity per block, only its capacity distribution. Fortunately, it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate. Numerical results demonstrate the achievable broadcasting rates.