This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel. Due to the bottleneck constraint, it is impossible for the oblivious relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we provide an upper bound by assuming that the destination node can get the perfect CSI at no cost and two achievable schemes with simple symbol-by-symbol relay processing and compression. Numerical results show that the lower bounds obtained by the proposed achievable schemes can come close to the upper bound on a wide range of relevant system parameters.

翻译：本文考虑了雷利(Rayleigh)减少多输入多输出(MIIMO)频道的信息瓶颈问题。 由于瓶颈限制, 忽略的中继无法告知目的地节点每个频道实现的完美频道状态信息。 为了评估瓶颈率, 我们提供了一个上限, 假设目的地节点可以免费获得完美的 CSI, 以及两个可以实现的、 简单的符号逐个符号继电器中继处理和压缩的方案。 数字结果显示, 拟议的可实现计划获得的下限可以接近广泛的相关系统参数的上限 。