Minimum mean square error(MMSE) detection algorithm can achieve nearly optimal performance when the number of antennas at the base station(BS) is large enough compared to the number of users. But the traditional MMSE ...Minimum mean square error(MMSE) detection algorithm can achieve nearly optimal performance when the number of antennas at the base station(BS) is large enough compared to the number of users. But the traditional MMSE involves complicated matrix inversion. In this paper, we propose a modified MMSE algorithm which exploits the channel characteristics occurring in massive multiple-input multipleoutput(MIMO) channels and the relaxation iteration(RI) method to avoid the matrix inversion. A proper initial solution is given to accelerate the convergence speed. In addition, we point out that the channel estimation scheme used in channel hardening-exploiting message passing(CHEMP) receiver is very appropriate for our proposed detection algorithm. Simulation results verify that the proposed algorithm can achieve very close performance of the traditional MMSE algorithm with a small number of iterations.展开更多
We consider the problem of nearly optimal energy efficiency in massive(Multiinput Multi-output) MIMO systems. Considering the correlated channel in practice, we derive the ergodic expression with zero-forcing precodin...We consider the problem of nearly optimal energy efficiency in massive(Multiinput Multi-output) MIMO systems. Considering the correlated channel in practice, we derive the ergodic expression with zero-forcing precoding and analyze the simplified antennas selection method. Aiming at optimizing the energy efficiency, the closed form expressions of the nearly optimal number of transmit antennas and transmit power are given under the circuit consumption model. The joint solution of the number of transmit antennas and transmit power was replaced to only solve transmit power. Based on the expression only related with transmit power, we give an energy efficiency optimization algorithm. The simulation results show that the proposed algorithm can achieve nearly optimal energy efficiency with fast convergence speed.展开更多
As an important part of the channel fading, large scale fading should be considered in downlink massive multiple-input multipleoutput(MIMO) systems. This paper investigates the downlink massive MIMO system over a larg...As an important part of the channel fading, large scale fading should be considered in downlink massive multiple-input multipleoutput(MIMO) systems. This paper investigates the downlink massive MIMO system over a large scale fading channel, when the base station takes advantage of maximum-radio transmission(MRT) precoding. The cases when the base station has perfect and imperfect channel state information(CSI) are considered respectively. Specially, through the analysis of single user's ergodic achievable rate, some novel and approximate expressions for the spectral efficiency(SE) are derived. Based on the approximate SE, the effect of the channel estimation error is analyzed intuitively. In addition, the average SE of all the users with different large-scale fading parameters is carefully investigated. Simulations validate that all the theoretical results coincide with numerical results and the large scale fading factors have little influence on SE reduction resulted from channel estimation.展开更多
In millimeter wave （mmWave） massive multiple-input multiple-output （MIMO） systems, because of the high hardware cost and high power consumption, the traditional fully digital beamforming （DBF） cannot be implemen...In millimeter wave （mmWave） massive multiple-input multiple-output （MIMO） systems, because of the high hardware cost and high power consumption, the traditional fully digital beamforming （DBF） cannot be implemented easily. Meanwhile, analog beamforming which is implemented with phase shifters has high availability but suffers poor performance. Considering the advantages of above two, a potential solution is to design an appropriate hybrid analog and digital beamforming structure, where the available iterative optimization algorithm can get performance close to fully digital processing, but solving this sparse optimization problem faces with a high computational complexity. The key challenge of seeking out hybrid beamforming （HBF） matrices lies in leveraging the trade-off between the spectral efficiency performance and the computational complexity. In this paper, we propose an asymptotically unitary hybrid precoding （AUHP） algorithm based on antenna array response （AAR） properties to solve the HBF optimization problem. Firstly, we get the optimal orthogonal analog and digital beamforming matrices relying on the channel＇s path gain in absolute value by taking into account that the AAR matrices are asymptotically unitary. Then, an improved simultaneously orthogonal matching pursuit （SOMP） algorithm based on recursion is adopted to refine the hybrid combining. Numerical results demonstrate that our proposed AUHP algorithm enables a lower computational complexity with negligible spectral efficiency performance degradation.展开更多
Due to the high cost and power consumption of the radio frequency（RF） chains, it is difficult to implement the full digital beamforming in millimeter-wave（mm Wave） multiple-input multiple-output（MIMO） systems. F...Due to the high cost and power consumption of the radio frequency（RF） chains, it is difficult to implement the full digital beamforming in millimeter-wave（mm Wave） multiple-input multiple-output（MIMO） systems. Fortunately, the hybrid beamforming（HBF） is proposed to overcome these limitations by splitting the beamforming process between the analog and digital domains. In recent works, most HBF schemes improve the spectral efficiency based on greedy algorithms. However, the iterative process in greedy algorithms leads to high computational complexity. In this paper, a new method is proposed to achieve a reasonable compromise between complexity and performance. The novel algorithm utilizes the low-complexity Gram-Schmidt method to orthogonalize the candidate vectors. With the orthogonal candidate matrix, the slow greedy algorithm is avoided. Thus, the RF vectors are found simultaneously without any iteration. Additionally, the phase extraction is applied to satisfy the element-wise constant-magnitude constraint on the RF matrix. Simulation results demonstrate that the new HBF algorithm can make substantial improvements in complexity while maintaining good performance.展开更多
基金supported by the National Hightech R&D Program of China(2014AA01A704)the Natural Science Foundation of China(61201135)111 Project(B08038)
文摘Minimum mean square error(MMSE) detection algorithm can achieve nearly optimal performance when the number of antennas at the base station(BS) is large enough compared to the number of users. But the traditional MMSE involves complicated matrix inversion. In this paper, we propose a modified MMSE algorithm which exploits the channel characteristics occurring in massive multiple-input multipleoutput(MIMO) channels and the relaxation iteration(RI) method to avoid the matrix inversion. A proper initial solution is given to accelerate the convergence speed. In addition, we point out that the channel estimation scheme used in channel hardening-exploiting message passing(CHEMP) receiver is very appropriate for our proposed detection algorithm. Simulation results verify that the proposed algorithm can achieve very close performance of the traditional MMSE algorithm with a small number of iterations.
基金supported by the Natural Science Foundation of China(61201135)State 863 Project(2014AA01A704)111 Project(B08038)
文摘We consider the problem of nearly optimal energy efficiency in massive(Multiinput Multi-output) MIMO systems. Considering the correlated channel in practice, we derive the ergodic expression with zero-forcing precoding and analyze the simplified antennas selection method. Aiming at optimizing the energy efficiency, the closed form expressions of the nearly optimal number of transmit antennas and transmit power are given under the circuit consumption model. The joint solution of the number of transmit antennas and transmit power was replaced to only solve transmit power. Based on the expression only related with transmit power, we give an energy efficiency optimization algorithm. The simulation results show that the proposed algorithm can achieve nearly optimal energy efficiency with fast convergence speed.
基金supported by the Natural Science Foundation of China(61201134)State 863 Project(2014AA01A704)111 Project(B08038)
文摘As an important part of the channel fading, large scale fading should be considered in downlink massive multiple-input multipleoutput(MIMO) systems. This paper investigates the downlink massive MIMO system over a large scale fading channel, when the base station takes advantage of maximum-radio transmission(MRT) precoding. The cases when the base station has perfect and imperfect channel state information(CSI) are considered respectively. Specially, through the analysis of single user's ergodic achievable rate, some novel and approximate expressions for the spectral efficiency(SE) are derived. Based on the approximate SE, the effect of the channel estimation error is analyzed intuitively. In addition, the average SE of all the users with different large-scale fading parameters is carefully investigated. Simulations validate that all the theoretical results coincide with numerical results and the large scale fading factors have little influence on SE reduction resulted from channel estimation.
基金supported by the National Natural Science Foundation of China(61201134)State Key Science and Research Project(MJ-2014-S-37)the 111 Project(B08038)
文摘In millimeter wave （mmWave） massive multiple-input multiple-output （MIMO） systems, because of the high hardware cost and high power consumption, the traditional fully digital beamforming （DBF） cannot be implemented easily. Meanwhile, analog beamforming which is implemented with phase shifters has high availability but suffers poor performance. Considering the advantages of above two, a potential solution is to design an appropriate hybrid analog and digital beamforming structure, where the available iterative optimization algorithm can get performance close to fully digital processing, but solving this sparse optimization problem faces with a high computational complexity. The key challenge of seeking out hybrid beamforming （HBF） matrices lies in leveraging the trade-off between the spectral efficiency performance and the computational complexity. In this paper, we propose an asymptotically unitary hybrid precoding （AUHP） algorithm based on antenna array response （AAR） properties to solve the HBF optimization problem. Firstly, we get the optimal orthogonal analog and digital beamforming matrices relying on the channel＇s path gain in absolute value by taking into account that the AAR matrices are asymptotically unitary. Then, an improved simultaneously orthogonal matching pursuit （SOMP） algorithm based on recursion is adopted to refine the hybrid combining. Numerical results demonstrate that our proposed AUHP algorithm enables a lower computational complexity with negligible spectral efficiency performance degradation.
基金supported by the National Natural Science Foundation of China (61201134)the Hi-Tech Research and Development Program of China (2014AA01A704)the 111 Project (B08038)
文摘Due to the high cost and power consumption of the radio frequency（RF） chains, it is difficult to implement the full digital beamforming in millimeter-wave（mm Wave） multiple-input multiple-output（MIMO） systems. Fortunately, the hybrid beamforming（HBF） is proposed to overcome these limitations by splitting the beamforming process between the analog and digital domains. In recent works, most HBF schemes improve the spectral efficiency based on greedy algorithms. However, the iterative process in greedy algorithms leads to high computational complexity. In this paper, a new method is proposed to achieve a reasonable compromise between complexity and performance. The novel algorithm utilizes the low-complexity Gram-Schmidt method to orthogonalize the candidate vectors. With the orthogonal candidate matrix, the slow greedy algorithm is avoided. Thus, the RF vectors are found simultaneously without any iteration. Additionally, the phase extraction is applied to satisfy the element-wise constant-magnitude constraint on the RF matrix. Simulation results demonstrate that the new HBF algorithm can make substantial improvements in complexity while maintaining good performance.
