Fully decentralized approximate zero-forcing precoding for massive MIMO systems

M Sarajlić, F Rusek, JR Sánchez, L Liu… - IEEE Wireless …, 2019 - ieeexplore.ieee.org
IEEE Wireless Communications Letters, 2019ieeexplore.ieee.org
We analyze the downlink of a massive multiuser multiple input, multiple output (MIMO)
system where antenna units at the base station are connected in a daisy chain without a
central processing unit and only possess local channel knowledge. For this setup, we
develop and analyze a linear precoding algorithm for suppressing interuser interference. It is
demonstrated that the algorithm is close to zero-forcing precoding in terms of performance
for a large number of antennas. Moreover, we show that with careful scheduling of …
We analyze the downlink of a massive multiuser multiple input, multiple output (MIMO) system where antenna units at the base station are connected in a daisy chain without a central processing unit and only possess local channel knowledge. For this setup, we develop and analyze a linear precoding algorithm for suppressing interuser interference. It is demonstrated that the algorithm is close to zero-forcing precoding in terms of performance for a large number of antennas. Moreover, we show that with careful scheduling of processing across antennas, requirements for interconnection throughput are reduced compared with the fully centralized solution. Favorable tradeoff between performance and interconnection throughput makes the daisy chain a viable candidate topology for real-life implementations of base stations in MIMO systems where the number of antennas is very large.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果