Massive MIMO is a promising technology to improve spectral efficiency, cell coverage, and system capacity for 5G. However, these benefits take place at great cost of computational complexity, especially in systems wit...Massive MIMO is a promising technology to improve spectral efficiency, cell coverage, and system capacity for 5G. However, these benefits take place at great cost of computational complexity, especially in systems with hundreds of antennas at the base station. This paper aims to address the minimum mean square error(MMSE) detection in uplink massive MIMO systems utilizing the symmetric complex bi-conjugate gradients(SCBiCG) and the Lanczos method. Both the proposed methods can avoid the large scale matrix inversion which is necessary for MMSE, thus, reducing the computational complexity by an order of magnitude with respect to the number of user equipment. To enable the proposed methods for soft-output detection, we also derive an approximating calculation scheme for the log-likelihood ratios(LLRs), which further reduces the complexity. We compare the proposed methods with existing exact and approximate detection methods. Simulation results demonstrate that the proposed methods can achieve near-optimal performance of MMSE detection with relatively low computational complexity.展开更多
A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on t...A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure. With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.展开更多
In multiuser massive Multiple Input Multiple Output(MIMO)systems,a large amount of antennas are deployed at the Base Station(BS).In this case,the Minimum Mean Square Error(MMSE)detector with soft-output can achieve th...In multiuser massive Multiple Input Multiple Output(MIMO)systems,a large amount of antennas are deployed at the Base Station(BS).In this case,the Minimum Mean Square Error(MMSE)detector with soft-output can achieve the near-optimal performance at the cost of a large-scale matrix inversion operation.The optimization algorithms such as Gradient Descent(GD)method have received a lot of attention to realize the MMSE detection efficiently without a large scale matrix inversion operation.However,they converge slowly when the condition number of the MMSE filtering matrix(the coefficient matrix)increases,which can compromise the efficiency of their implementation.Moreover,their soft information computation also involves a large-scale matrix-matrix multiplication operation.In this paper,a low-complexity soft-output signal detector based on Adaptive Pre-conditioned Gradient Descent(APGD-SOD)method is proposed to realize the MMSE detection with soft-output for uplink multiuser massive MIMO systems.In the proposed detector,an Adaptive Pre-conditioner(AP)matrix obtained through the Quasi-Newton Symmetric Rank One(QN-SR1)update in each iteration is used to accelerate the convergence of the GD method.The QN-SR1 update supports the intuitive notion that for the quadractic problem one should strive to make the pre-conditioner matrix close to the inverse of the coefficient matrix,since then the condition number would be close to unity and the convergence would be rapid.By expanding the signal model of the massive MIMO system and exploiting the channel hardening property of massive MIMO systems,the computational complexity of the soft information is simplified.The proposed AP matrix is applied to the GD method as a showcase.However,it also can be used by Conjugate Gradient(CG)method due to its generality.It is demonstrated that the proposed detector is robust and its convergence rate is superlinear.Simulation results show that the proposed detector converges at most four iterations.Simulation results also show that the proposed approach achieves a better trade-off between the complexity and the performance than several existing detectors and achieves a near-optimal performance of the MMSE detector with soft-output at four iterations without a complicated large scale matrix inversion operation,which entails a big challenge for the efficient implementation.展开更多
基金supported by Chinas 863 Project NO.2015AA01A706the National S&T Major Project NO.2014ZX03001011+1 种基金the Science and Technology Program of Beijing NO.D151100000115003the Scientific and Technological Cooperation Projects NO.2015DFT10160B
文摘Massive MIMO is a promising technology to improve spectral efficiency, cell coverage, and system capacity for 5G. However, these benefits take place at great cost of computational complexity, especially in systems with hundreds of antennas at the base station. This paper aims to address the minimum mean square error(MMSE) detection in uplink massive MIMO systems utilizing the symmetric complex bi-conjugate gradients(SCBiCG) and the Lanczos method. Both the proposed methods can avoid the large scale matrix inversion which is necessary for MMSE, thus, reducing the computational complexity by an order of magnitude with respect to the number of user equipment. To enable the proposed methods for soft-output detection, we also derive an approximating calculation scheme for the log-likelihood ratios(LLRs), which further reduces the complexity. We compare the proposed methods with existing exact and approximate detection methods. Simulation results demonstrate that the proposed methods can achieve near-optimal performance of MMSE detection with relatively low computational complexity.
文摘A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure. With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.
基金supported by National Natural Science Foundation of China under Grant 61501072 and 61701062Chongqing Research Program of Basic Research and Frontier Technology under Grant cstc2019jcyj-msxmX0079Program for Changjiang Scholars and Innovative Research Team in University under Grant IRT16R72.
文摘In multiuser massive Multiple Input Multiple Output(MIMO)systems,a large amount of antennas are deployed at the Base Station(BS).In this case,the Minimum Mean Square Error(MMSE)detector with soft-output can achieve the near-optimal performance at the cost of a large-scale matrix inversion operation.The optimization algorithms such as Gradient Descent(GD)method have received a lot of attention to realize the MMSE detection efficiently without a large scale matrix inversion operation.However,they converge slowly when the condition number of the MMSE filtering matrix(the coefficient matrix)increases,which can compromise the efficiency of their implementation.Moreover,their soft information computation also involves a large-scale matrix-matrix multiplication operation.In this paper,a low-complexity soft-output signal detector based on Adaptive Pre-conditioned Gradient Descent(APGD-SOD)method is proposed to realize the MMSE detection with soft-output for uplink multiuser massive MIMO systems.In the proposed detector,an Adaptive Pre-conditioner(AP)matrix obtained through the Quasi-Newton Symmetric Rank One(QN-SR1)update in each iteration is used to accelerate the convergence of the GD method.The QN-SR1 update supports the intuitive notion that for the quadractic problem one should strive to make the pre-conditioner matrix close to the inverse of the coefficient matrix,since then the condition number would be close to unity and the convergence would be rapid.By expanding the signal model of the massive MIMO system and exploiting the channel hardening property of massive MIMO systems,the computational complexity of the soft information is simplified.The proposed AP matrix is applied to the GD method as a showcase.However,it also can be used by Conjugate Gradient(CG)method due to its generality.It is demonstrated that the proposed detector is robust and its convergence rate is superlinear.Simulation results show that the proposed detector converges at most four iterations.Simulation results also show that the proposed approach achieves a better trade-off between the complexity and the performance than several existing detectors and achieves a near-optimal performance of the MMSE detector with soft-output at four iterations without a complicated large scale matrix inversion operation,which entails a big challenge for the efficient implementation.
