This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operate without knowledge of the codebooks, i.e., it performs oblivious processing. Moreover, due to the bottleneck constraint, it is impossible for the relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we first provide an upper bound by assuming that the destination node can get the perfect CSI at no cost. Then, we provide four achievable schemes where each scheme satisfies the bottleneck constraint and gives a lower bound to the bottleneck rate. In the first and second schemes, the relay splits the capacity of the relay-destination link into two parts, and conveys both the CSI and its observation to the destination node. Due to CSI transmission, the performance of these two schemes is sensitive to the MIMO channel dimension, especially the channel input dimension. To ensure that it still performs well when the channel dimension grows large, in the third and fourth achievable schemes, the relay only transmits compressed observation to the destination node. Numerical results show that with simple symbol-by-symbol oblivious relay processing and compression, the proposed achievable schemes work well and can demonstrate lower bounds coming quite close to the upper bound on a wide range of relevant system parameters.

翻译：本文考虑了雷利(Rayleigh)多投多投多发频道(MIIMO)的信息瓶颈问题。 中继器被迫在对代码簿不知情的情况下运行, 也就是说, 进行隐蔽处理。 此外, 由于瓶颈制约, 中继器无法告知每个频道实现过程中完美的频道状态信息( CSI)的目的地节点。 为了评估瓶颈率, 我们首先提供上限, 假设目的地节点可以免费获得完美的 CSI 。 然后, 我们提供四种可实现的计划, 每个方案都满足瓶颈限制, 并且对瓶颈率有较低的约束。 在第一和第二个方案中, 中继器将中继- 目的地链接的能力分成两个部分, 并将CSI 及其观察传达到目的地节点。 由于 CSI 传输, 这两项计划的执行情况对MIMO频道的层面, 尤其是频道输入层面的层面十分敏感。 只有在频道的层面逐渐接近时, 我们提供四个可实现的可实现的计划。 在第三级和第四级级级级的中继器计划中, 展示了可实现的中继器。