A low complexity precoding based on weighted two diagonal iteration in massive MIMO system
In massive MIMO systems,with the increase of the number of users and antennas,the complexity of the downlink zero forcing (ZF) precoding increases due to the existence of large matrix inversion.In order to reduce the complexity,an improved weighted two diagonal iteration precoding algorithm based on...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2018-09-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018187/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In massive MIMO systems,with the increase of the number of users and antennas,the complexity of the downlink zero forcing (ZF) precoding increases due to the existence of large matrix inversion.In order to reduce the complexity,an improved weighted two diagonal iteration precoding algorithm based on the Jacobi iterative algorithm was proposed.The low-two diagonal matrix was taken as iterative matrix,and the iterative results were weighed addition with the last results to accelerate the convergence speed of the iteration.According to the diagonally dominant characteristic of channel matrix in massive MIMO systems,the first term of the Neumann approximation of matrix inversion was used as the initial value of the iteration to accelerate the iteration further.Compared with the traditional ZF precoding,the proposed scheme can reduce the complexity with an order of magnitude and ensure the performance of the precoding scheme. |
|---|---|
| ISSN: | 1000-0801 |