Decentralized Beamforming with Parallelity between Local Channels

A decentralized beamforming algorithm with parallelity between local channels is proposed in the present work. The whole users are divided into two groups, who can participate in zero-forcing algorithm and cannot participate, the former users are selected with the parallelity between local channels to achieve beamforming vectors. The simulations show that under the different $E_{b} / N_{0}$, the decentralized beamforming algorithm proposed here outperforms traditional algorithms with a higher data rate.