阅读说明：本技术 一种大规模mimo检测方法、装置、设备和存储介质 (Large-scale MIMO detection method, device, equipment and storage medium ) 是由 张川 王辉征 杨敏华 黄永明 尤肖虎 于 2021-08-13 设计创作，主要内容包括：本发明公开了一种大规模MIMO检测方法、装置、设备和存储介质,根据接收信号、MIMO信道矩阵和噪声方差计算EPA算法中需要进行矩阵求逆的初始化参数矩阵；将所述初始化参数矩阵分解为块对角矩阵和非块对角矩阵,根据所述块对角矩阵和非块对角矩阵基于Neumann迭代方法得到发送信号的近似后验联合概率分布的均值向量；根据所述发送信号的近似后验联合概率分布的均值向量计算近似后验联合概率分布的腔分布的初始均值,根据腔分布的初始均值计算替代分布的均值,根据替代分布的均值更新腔分布的均值,迭代计算替代分布的均值,将达到最大迭代次数的替代分布的均值作为发送信号的检测值。在相关性信道下本发明能够极大降低MIMO检测的复杂度。(The invention discloses a large-scale MIMO detection method, a device, equipment and a storage medium, wherein an initialization parameter matrix which needs matrix inversion in an EPA algorithm is calculated according to a received signal, an MIMO channel matrix and a noise variance; decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix, and obtaining a mean value vector of approximate posterior joint probability distribution of the transmitted signal based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix; calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean vector of the approximate posterior joint probability distribution of the transmission signal, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration times as a detection value of the transmission signal. The invention can greatly reduce the complexity of MIMO detection under a correlation channel.)

1. A massive MIMO detection method is characterized by comprising the following steps:

acquiring a received signal, an MIMO channel matrix and a noise variance;

calculating an initialization parameter matrix which needs matrix inversion in an EPA algorithm according to a received signal, an MIMO channel matrix and noise variance, and decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix; obtaining a mean value vector of approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix;

calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as a detection value of the transmission signal.

2. The massive MIMO detection method according to claim 1, wherein: the value of the mean vector μ of the approximated a posteriori joint probability distribution of the transmitted signal in the kth Neumann iteration is:

μ^(k)＝Ψμ^(k-1)+D^-1b,k＝2,3,…

wherein Ψ ═ D^-1E；D is a block diagonal matrix, E is a non-block diagonal matrix,h is the MIMO channel matrix, y is the received signal, and γ is the first setting parameter.

3. The massive MIMO detection method according to claim 1, wherein: decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix, including:

and sequentially extracting a plurality of block sub-matrixes along the main diagonal direction of the initialized parameter matrix, wherein the block sub-matrixes are sequentially used as block diagonal matrixes along the main diagonal direction and the matrixes with the rest elements of 0, and the initialized parameter matrix subtracts the block diagonal matrixes to obtain a non-block diagonal matrix.

4. The massive MIMO detection method according to claim 3, wherein:

the block submatrices are m in number and m in size_UE×m_UEWhere m is the number of users at the transmitting endAmount, m_UEThe number of antennas provided for each user.

5. The massive MIMO detection method according to claim 1, wherein: calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of alternative distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the alternative distribution, iteratively calculating the mean value of the alternative distribution, and taking the mean value of the alternative distribution reaching the maximum iteration number as a detection value of the transmission signal, wherein the method comprises the following steps:

calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed and the block diagonal matrix;

calculating the mean value of the alternative distribution in the current iteration according to the initial mean value of the cavity distribution and the symbol set in the constellation diagram;

updating the mean value of the cavity distribution for the next iteration according to the noise variance, the MIMO channel matrix, the received signal, the mean value of the substitution distribution in the current iteration, the energy normalization factor and the set weighting coefficient;

and if the maximum iteration times are reached, taking the mean value of the alternative distribution obtained by the last iteration as the detection value of the sending signal.

6. The massive MIMO detection method according to claim 5, wherein:

the initial mean of the cavity distribution of the approximate posterior joint probability distribution is:

after the Neumann iteration is completedOf the transmission signal, L_NSAThe total number of Neumann iterations; sigma_d＝diag(D^-1) (ii) a Λ is a second setting parameter; d is a block diagonal matrix;

the mean of the substitution distribution is:

wherein the content of the first and second substances,mean vector η representing the distribution of substitutions at the ith iteration^(l)The elements of the ith dimension of the group,mean value t representing the cavity distribution at the first iteration^(l)The element of the ith dimension in (i) represents a symbol set of a constellation diagram (theta)_aRepresents the a-th symbol in the constellation diagram, Na represents the number of symbols in the constellation diagram, and argmin represents the number of symbols in the constellation diagramTheta at minimum_aValue, mean vector of alternative distributions at the l-th iteration

The mean of the cavity distributions for the next iteration is: t is t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)；

Wherein: t'^(l+1)＝m^(l)./V+δ^(l)，m^(l)＝b-Aδ^(l)，δ^(l)＝E_norm×η^(l)；V＝diag(A)，Is a noise variance, H is an MIMO channel matrix, y is a received signal, and gamma is a first setting parameter; beta is a weighting coefficient; e_normIs an energy normalization factor.

7. A massive MIMO detection apparatus, comprising:

an obtaining module, configured to obtain a received signal, a MIMO channel matrix, and a noise variance;

the Neumann iteration module is used for calculating an initialization parameter matrix which needs matrix inversion in an EPA algorithm according to a received signal, an MIMO channel matrix and noise variance, and decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix; obtaining a mean value vector of approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix;

and the detection value iteration calculation module is used for calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean value vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as the detection value of the transmission signal.

8. The massive MIMO detection apparatus as claimed in claim 7, wherein: the value of the mean vector μ of the approximated a posteriori joint probability distribution of the transmitted signal in the kth Neumann iteration is:

μ^(k)＝Ψμ^(k-1)+D^-1b,k＝2,3,…

wherein Ψ ═ D^-1E；D is a block diagonal matrix, E is a non-block diagonal matrix,h is the MIMO channel matrix, y is the received signal, and γ is the first setting parameter.

9. The massive MIMO detection apparatus as claimed in claim 7, wherein: and decomposing the initialized parameter matrix into a block diagonal matrix and a non-block diagonal matrix, sequentially extracting a plurality of block sub-matrices along the main diagonal direction of the initialized parameter matrix, sequentially using the matrices which are formed by the block sub-matrices along the main diagonal and have 0 elements as block diagonal matrices, and subtracting the block diagonal matrices from the initialized parameter matrix to obtain the non-block diagonal matrix.

10. The massive MIMO detection apparatus as claimed in claim 9, wherein:

the block submatrices are m in number and m in size_UE×m_UEWhere m is the number of users at the transmitting end, m_UEThe number of antennas provided for each user.

11. The massive MIMO detection apparatus as claimed in claim 7, wherein: the calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the alternative distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the alternative distribution, iteratively calculating the mean value of the alternative distribution, and taking the mean value of the alternative distribution reaching the maximum iteration number as a detection value of the transmission signal includes:

calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed and a block diagonal matrix;

calculating the mean value of the alternative distribution in the current iteration according to the initial mean value of the cavity distribution and the symbol set in the constellation diagram;

updating the mean value of the cavity distribution for the next iteration according to the noise variance, the MIMO channel matrix, the received signal, the mean value of the substitution distribution in the current iteration, the energy normalization factor and the set weighting coefficient;

and if the maximum iteration times are reached, taking the mean value of the alternative distribution obtained by the last iteration as the detection value of the sending signal.

12. The massive MIMO detection apparatus as claimed in claim 11, wherein: the method comprises the following steps:

the initial mean of the cavity distribution of the approximate posterior joint probability distribution is:

for the mean vector of the approximate a posteriori joint probability distribution of the transmitted signal after Neumann iteration is completed, L_NSAThe number of Neumann iterations; sigma_d＝diag(D^-1) (ii) a Λ is a second setting parameter; d is a block diagonal matrix;

the mean of the substitution distribution is:

wherein the content of the first and second substances,mean vector η representing the distribution of substitutions at the ith iteration^(l)The elements of the ith dimension of the group,mean value t representing the cavity distribution at the first iteration^(l)Element of the ith dimension in (g), Θ represents a starSet of symbols, Θ, of the seating chart_aRepresents the a-th symbol in the constellation diagram, Na represents the number of symbols in the constellation diagram, and argmin represents the number of symbols in the constellation diagramTheta at minimum_aValue, mean vector of alternative distributions at the l-th iteration

The mean of the cavity distributions for the next iteration is: t is t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)；

Wherein: t'^(l+1)＝m^(l)./V+δ^(l)，m^(l)＝b-Aδ^(l)，δ^(l)＝E_norm×η^(l)；V＝diag(A)，Is a noise variance, H is an MIMO channel matrix, y is a received signal, and gamma is a first setting parameter; beta is a weighting coefficient; e_normIs an energy normalization factor.

13. A massive MIMO detection device comprising a processor, a memory and a computer program stored on the memory and operable on the processor, wherein the processor implements the massive MIMO detection method of any one of claims 1 to 6 when executing the program.

14. A computer-readable storage medium having stored thereon computer-executable instructions for performing the massive MIMO detection method of any one of claims 1 to 6.

Technical Field

The invention belongs to the technical field of mobile communication, and particularly relates to a large-scale MIMO detection method, device, equipment and storage medium.

Background

With the rapid development of mobile communication technology and multimedia services, mobile users have made higher demands on the speed, stability, etc. of wireless communication. For this reason, further improvements in the spectrum efficiency and data transmission rate of wireless communication networks are urgently needed. As one of the key technologies of the fifth generation mobile communication system, a large-scale multiple-input multiple-output (MIMO) technology greatly improves the spatial degree of freedom of a wireless channel by increasing the number of antennas at both transmitting and receiving ends (usually reaching tens or even hundreds), so that the spatial channel can carry more information in limited time-frequency resources. Therefore, compared to the conventional small-scale MIMO system, the large-scale MIMO system has higher data transmission rate, energy efficiency, and spectrum efficiency.

Although in a massive MIMO system, as the number of antennas increases, the diversity gain and multiplexing gain provided by the system are larger, so as to provide the system with larger system capacity and stronger link reliability, the huge antenna scale also provides a small challenge to baseband signal processing, and how to implement efficient signal detection is a key issue. Theoretically, the best detection method is the maximum likelihood detection (ML) algorithm, however, the computation complexity increases exponentially with the number of antennas at the transmitting end of the system and the modulation order, and for a large-scale MIMO system with dozens of antennas or even hundreds of antennas, the computation complexity is unacceptable and hard to implement by hardware. The sphere decoding algorithm (SD) and the K-best algorithm are two variations of the ML algorithm, both of which can control the computational complexity by adjusting the number of nodes searched in each layer, thereby achieving an effective balance between performance and complexity, but both of the algorithms require orthogonal triangle (QR decomposition) decomposition of a matrix, which results in a great computational complexity. For this reason, commonly used linear detection algorithms are proposed, including Minimum Mean Square Error (MMSE) algorithm and Zero Forcing (ZF) algorithm, however, the performance of these two linear detection algorithms is often not satisfactory under some channels with correlation, and the computation complexity is also high because both of them include an inversion calculation of a large matrix.

Expectation Propagation (EP) is an efficient bayesian approximate inference algorithm that can approximate the moment features of a probability distribution in an iterative manner by means of moment matching, thereby achieving the approximation of the probability distribution. When the method is applied to signal detection of a large-scale MIMO system, compared with a traditional linear detection algorithm and a nonlinear detection algorithm, the method can show excellent detection performance under different antenna configuration ratios and modulation orders. However, at present, the inverse of an explicit matrix needs to be calculated in each iteration of the EP detection algorithm, which is a key pain point of the EP detection algorithm, because it brings huge calculation complexity.

In order to reduce the complexity of matrix inversion in each iteration of the EP detection algorithm, EP detection algorithms (EP-NSA) based on Newman series iteration, EP detection algorithms (EPA) based on approximation and EP detection algorithms (EP-WNSA) based on weighted Newman series iteration are all proposed. However, the above algorithms are all obtained under the assumption of ideal conditions of the channel, i.e., rayleigh channel; however, in practical systems, each ue usually has several antennas at the transmitting end of massive MIMO system, and there is correlation between the ue antennas due to the small distance between the ue devices and the small spacing between the ue antennas. Since the number of antennas in a massive MIMO system increases to an unprecedented extent, spatial correlation between antennas is a key factor affecting the performance of the massive MIMO system, and the antenna correlation must be properly considered if efficient signal detection is to be performed. Therefore, how to implement efficient detection of signals and reduce algorithm complexity under the correlation channel of the massive MIMO system becomes an urgent problem to be solved.

Disclosure of Invention

The purpose of the invention is as follows: the invention discloses a large-scale MIMO detection method, a device, equipment and a storage medium, aiming at the problem of higher computation complexity of the existing detection algorithm under a multi-user correlation channel of a large-scale MIMO system.

The technical scheme is as follows: in order to achieve the purpose, the invention adopts the following technical scheme: a massive MIMO detection method, comprising:

acquiring a received signal, an MIMO channel matrix and a noise variance;

calculating an initialization parameter matrix which needs matrix inversion in an EPA algorithm according to a received signal, an MIMO channel matrix and noise variance, and decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix; obtaining a mean value vector of approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix;

calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as a detection value of the transmission signal.

Further, the value of the mean vector μ of the approximated posterior joint probability distribution of the transmitted signal in the kth Neumann iteration is:

μ^(k)＝Ψμ^(k-1)+D^-1b，k＝2，3，…

wherein Ψ ═ D^-1E；D is a block diagonal matrix, E is a non-block diagonal matrix,h is the MIMO channel matrix, y is the received signal, and γ is the first setting parameter.

Further, decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix includes:

and sequentially extracting a plurality of block sub-matrixes along the main diagonal direction of the initialized parameter matrix, wherein the block sub-matrixes are sequentially used as block diagonal matrixes along the main diagonal direction and the matrixes with the rest elements of 0, and the initialized parameter matrix subtracts the block diagonal matrixes to obtain a non-block diagonal matrix.

Further, the block submatrices have m numbers, and the size of each block submatrix is m_UE×m_UEWhere m is the number of users at the transmitting end, m_UEThe number of antennas provided for each user.

Further, calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as a detection value of the transmission signal, including:

calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed and the block diagonal matrix;

calculating the mean value of the alternative distribution in the current iteration according to the initial mean value of the cavity distribution and the symbol set in the constellation diagram;

updating the mean value of the cavity distribution for the next iteration according to the noise variance, the MIMO channel matrix, the received signal, the mean value of the substitution distribution in the current iteration, the energy normalization factor and the weighting coefficient;

and if the maximum iteration times are reached, taking the mean value of the alternative distribution obtained by the last iteration as the detection value of the sending signal.

Further, the initial mean of the cavity distribution of the approximate posterior joint probability distribution is:

for the mean vector of the approximate a posteriori joint probability distribution of the transmitted signal after the Neumann iteration is completed, L_NSAThe total number of Neumann iterations; sigma_d＝diag(D^-1) (ii) a Λ is a second setting parameter; d is a block diagonal matrix;

the mean of the substitution distribution is:

wherein the content of the first and second substances,mean vector η representing the distribution of substitutions at the ith iteration^(l)The elements of the ith dimension of the group,mean value t representing the cavity distribution at the first iteration^(l)The element of the ith dimension in (i) represents a symbol set of a constellation diagram (theta)_aRepresents the a-th symbol in the constellation diagram, Na represents the number of symbols in the constellation diagram, and argmin represents the symbol numberTheta at minimum_aValue, mean vector of alternative distributions at the l-th iteration

The mean of the cavity distributions for the next iteration is: t is t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)；

Wherein: t'^(l+1)＝m^(l)./V+δ^(l)，m^(l)＝b-Aδ^(l)，δ^(l)＝E_norm×η^(l)；V＝diag(A)，Is a noise variance, H is an MIMO channel matrix, y is a received signal, and gamma is a first setting parameter; beta is a weighting coefficient; e_normIs an energy normalization factor.

A massive MIMO detection apparatus comprising:

an obtaining module, configured to obtain a received signal, a MIMO channel matrix, and a noise variance;

the Neumann iteration module is used for calculating an initialization parameter matrix which needs matrix inversion in an EPA algorithm according to a received signal, an MIMO channel matrix and noise variance, and decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix; obtaining a mean value vector of approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix;

and the detection value iteration calculation module is used for calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean value vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as the detection value of the transmission signal.

Further, the value of the mean vector μ of the approximated posterior joint probability distribution of the transmitted signal in the kth Neumann iteration is:

μ^(k)＝Ψμ^(k-1)+D^-1b，k＝2，3，…

wherein Ψ ═ D^-1E；D is a block diagonal matrix, E is a non-block diagonal matrix,h is the MIMO channel matrix, y is the received signal, and γ is the first setting parameter.

Further, the initialization parameter matrix is decomposed into a block diagonal matrix and a non-block diagonal matrix, a plurality of block sub-matrices are sequentially extracted along the main diagonal direction of the initialization parameter matrix, the block sub-matrices are sequentially taken as block diagonal matrices along the main diagonal, and the non-block diagonal matrices are obtained by subtracting the block diagonal matrices from the initialization parameter matrix.

Further, the block submatrices have m numbers, and the size of each block submatrix is m_UE×m_UEWhere m is the number of users at the transmitting end, m_UEThe number of antennas provided for each user.

Further, the calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean vector of the approximate posterior joint probability distribution of the transmission signal after the Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as the detection value of the transmission signal includes:

calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed and a block diagonal matrix;

calculating the mean value of the alternative distribution in the current iteration according to the initial mean value of the cavity distribution and the symbol set in the constellation diagram;

updating the mean value of the cavity distribution for the next iteration according to the noise variance, the MIMO channel matrix, the received signal, the mean value of the substitution distribution in the current iteration, the energy normalization factor and the weighting coefficient;

and if the maximum iteration times are reached, taking the mean value of the alternative distribution obtained by the last iteration as the detection value of the sending signal.

Further, the initial mean of the cavity distribution of the approximate posterior joint probability distribution is:

for the mean vector of the approximate a posteriori joint probability distribution of the transmitted signal after Neumann iteration is completed, L_NSAThe number of Neumann iterations; sigma_d＝diag(D^-1) (ii) a Λ is a second setting parameter; d is a block diagonal matrix;

the mean of the substitution distribution is:

wherein the content of the first and second substances,mean vector η representing the distribution of substitutions at the ith iteration^(l)The elements of the ith dimension of the group,mean value t representing the cavity distribution at the first iteration^(l)The element of the ith dimension in (i) represents a symbol set of a constellation diagram (theta)_aRepresents the a-th symbol in the constellation diagram, Na represents the number of symbols in the constellation diagram, and argmin represents the number of symbols in the constellation diagramTheta at minimum_aValue, mean vector of alternative distributions at the l-th iteration

The mean of the cavity distributions for the next iteration is: t is t^(l+1)＝βt'^(l+1)+(1-β)·t^(l)；

Wherein: t'^(l+1)＝m^(l)./V+δ^(l)，m^(l)＝b-Aδ^(l)，δ^(l)＝E_norm×η^(l)；V＝diag(A)，Is a noise variance, H is an MIMO channel matrix, y is a received signal, and gamma is a first setting parameter; beta is a weighting coefficient; e_normIs an energy normalization factor.

A massive MIMO detection apparatus comprising a processor, a memory and a computer program stored on the memory and executable on the processor, the processor implementing any one of the massive MIMO detection methods described above when executing the program.

A computer-readable storage medium storing computer-executable instructions for performing any of the massive MIMO detection methods described above.

Has the advantages that: compared with the prior art, the invention has the following beneficial effects:

the detection method is based on an EPA algorithm, the initialization parameter matrix is decomposed into a block diagonal matrix and a non-block diagonal matrix, and the initialization parameter matrix is approximately inverted according to the block diagonal matrix and the non-block diagonal matrix, so that channel information can be reserved to a large extent; neumann iteration is carried out on the mean value vector by using a Neumann iteration mode, and only the mean value is required to be calculated without calculating the variance; calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of alternative distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the alternative distribution, iteratively calculating the mean value of the alternative distribution, and taking the mean value of the alternative distribution reaching the maximum iteration number as a detection value of the transmission signal;

by the detection method, the computational complexity of detection can be greatly reduced on the premise of realizing the detection performance close to the EPA, so that a better detection effect is realized; and the larger the correlation degree of the channel is, the more obvious the advantages of the detection method are.

Drawings

Fig. 1 is a flowchart of a MIMO detection method according to an embodiment of the present invention;

FIG. 2 is a diagram illustrating a massive MIMO system model according to an embodiment of the present invention;

FIG. 3 is a schematic flow diagram of an EPA detection algorithm;

FIG. 4 is a diagram illustrating block diagonalization feature extraction according to an embodiment of the present invention;

FIG. 5 is a schematic flow chart illustrating a detection method according to an embodiment of the present invention;

fig. 6 shows a detection method and other detection methods in an embodiment of the present invention, where N-128, M-16, and M are antenna configurations_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.2 and receiving end antenna correlation coefficient xi_rGraph of BER as a function of SNR for 0 case, where L is the detection algorithm of EP_EPIndicating number of iterations, L in EPA detection Algorithm_EPARepresenting the number of iterations; in the EP-NSA detection algorithm and in the detection method of the invention, L_NSADenotes the number of Neumann iterations, L_EPRepresenting the number of overall iterations;

fig. 7 shows a detection method and other detection methods in an embodiment of the present invention, where N-128, M-32, M are antenna configurations_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.4 and receiving end antenna correlation coefficient ζ_rBER versus SNR plot in the case of 0.2;

fig. 8 shows a detection method and other detection methods in an embodiment of the present invention, where N-128, M-32, M are antenna configurations_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.6 sum of receiving end antenna phaseCoefficient of correlation ζ_rBER versus SNR plot in the case of 0.5;

fig. 9 shows a detection method and other detection methods in an embodiment of the present invention, where N-128, M-16, and M are antenna configurations_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.2 and receiving end antenna correlation coefficient ζ_rA plot of performance versus complexity for the case of 0, where the abscissa represents the signal-to-noise ratio loss at a certain bit error rate level based on EP, and the ordinate represents the computational complexity;

fig. 10 shows a detection method and other detection methods in an embodiment of the present invention, where N-128, M-32, and M are antenna configurations_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.4 and receiving end antenna correlation coefficient ζ_rA plot of performance versus complexity for the case of 0.2, where the abscissa represents the signal-to-noise ratio loss at a certain bit error rate level based on EP, and the ordinate represents the computational complexity;

fig. 11 shows a detection method and other detection methods in an embodiment of the present invention, where N-128, M-32, and M are antenna configurations_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.6 and receiving end antenna correlation coefficient ζ_rA plot of performance versus complexity for the case of 0.5, where the abscissa represents the signal-to-noise ratio loss at a certain bit error rate level based on EP, and the ordinate represents the computational complexity;

fig. 12 is a block diagram of a detecting device according to an embodiment of the present invention.

Detailed Description

The present invention will be further described with reference to the accompanying drawings.

Considering a large-scale MIMO system as shown in fig. 2, the number of antennas of the receiving end base station is N, the transmitting end has m users, and each user is equipped with m users_UEThe number of antennas at the transmitting end is M m.m_UE. Using column vectorsRepresenting the transmitted signal, the elements of which take values in an independent, equi-probability manner in a constellation diagram, wherein the constellation diagramIs denoted as Θ, x_iI denotes the transmission signal of the ith antenna, i denotes the serial number of the antenna, i.e., the signal dimension in the transmission signal x, i is 1,2, …, M,representing a column vector of dimension M x 1. Order toRepresenting the MIMO channel matrix from the transmitting end to the receiving end, then receiving the signalComprises the following steps:

y＝Hx+n

wherein the content of the first and second substances,representing additive white Gaussian noise, the elements of which are independent and identically distributed zero-mean complex Gaussian random variables with variance of sigma_n ²I_N，σ_n ²Representing the variance of the noise, I_NRepresenting an nxn dimensional identity matrix.

The task of MIMO detection is to estimate a transmitted signal x according to a received signal y, and x is estimated by considering a Bayesian estimation method and taking the posterior mean value as an estimation value_iThe estimated values of (c) are:

wherein, p (x)_iY) is the edge distribution of the joint posterior probability density distribution function p (x y). According to the Bayesian formula:

p(x|y)∝p(y|x)p(x)

wherein, oc represents proportional to and indicates that the two differ by only one coefficient; p (x) is a prior probability density distribution function of the vector x; p (y | x) is the transition probability density distribution function for the MIMO channel:

wherein the content of the first and second substances,means that the received signal y obeys a mean vector of Hx and a covariance matrix ofComplex gaussian distribution.

In a large-scale MIMO system, the great computational complexity is brought by directly solving the posterior probability of each transmission signal, so the EP detection algorithm approximates the posterior probability density distribution of the transmission signal with gaussian distribution: the EP detection algorithm first replaces the prior probability density distribution of the transmit signal of each transmit-end antenna with a non-normalized gaussian distribution, i.e.Secondly, a complex Gaussian distribution is constructedTo approximate the a posteriori joint probability density distribution of the transmitted signal, called approximate a posteriori joint probability distribution, the mean μ and variance Σ of the approximate a posteriori joint probability distribution q (x) are continuously updated in an iterative process, approaching the optimum. The approximate a posteriori joint probability distribution q (x) can be written as:

wherein, γ_iAnd Λ_iDetermining the mean and variance of the i-th non-normalized dimension Gaussian distribution in the prior probability density distribution of the transmitted signal, gamma_iThe physical meaning of (A) is mean divided by the square difference, Λ_iThe physical meaning of (a) is the inverse of the variance. Further, γ ═ γ₁,γ₂,…,γ_M]^HIn the EPA algorithm, the value is a setting vector and is a first setting parameter;Λ＝diag[Λ₁,Λ₂,…,Λ_M]and Λ represents by [. lamda ]₁,Λ₂,…,Λ_M]A diagonal matrix is constructed for the main diagonal, and the value is a setting vector and is a second setting parameter in the EPA algorithm; (.)^HRepresenting the conjugate transpose of a matrix or vector.

And because the approximate a posteriori joint probability distribution q (x) also obeys a joint gaussian distribution, it can be expressed as:

where μ denotes a mean vector of the approximate a posteriori joint probability distribution q (x), and Σ denotes a covariance matrix of the approximate a posteriori joint probability distribution q (x).

It is thus possible to obtain: for this approximate a posteriori joint probability distribution q (x), the update formula for the mean vector μ and the covariance matrix Σ is as follows:

obviously, the parameter pairs (γ) in each dimension are iteratively updated_i，Λ_i) I.e. the mean vector mu and the covariance matrix Σ, which correspond to the update of the approximated a posteriori joint probability distribution q (x). In fact, the parameter pair (γ)_i，Λ_i) The complexity of the iterative update process is not high, asWherein M represents the number of antennas at the transmitting end; the main computational complexity lies in the updating of the mean vector mu and the covariance matrix sigma, especially in the matrix inversion operation in the covariance matrix sigma updating formulaFor convenience of explanation, letThe core of the problem is W^-1W is the initialization parameter matrix that needs matrix inversion in the EPA algorithm.

In the prior art, an EP-based approximation algorithm (EPA) successfully simplifies the computation of matrix inversion in each iteration process by approximation, as shown in fig. 3, the specific operation process is as follows:

step 1: inputting the known quantity: received signal y, MIMO channel matrix H, noise varianceMaximum number of iterations L_EPAThe weighting coefficient β;

initializing parameters, let Λ ═ I_MAnd gamma is 0, thenI_MRepresenting an M × M dimensional identity matrix.

Step 2: calculating a covariance matrix Σ and a mean vector μ, and a vector Σ, approximating a posterior joint probability distribution q (x) by initializing parameters and the following formula_dAnd V:

Σ_d＝diag(Σ)

wherein Σ represents a covariance matrix that approximates the a posteriori joint probability distribution q (x); u-expression approximation a posteriori joint ruleA mean vector of the rate distribution q (x); sigma_dA vector consisting of the main diagonal elements representing the matrix Σ; v is a matrixThe main diagonal elements of (a).

Step3, initializing initial mean value t of cavity distribution of approximate posterior joint probability distribution q (x) by setting current iteration number l to 1⁽¹⁾And variance h, namely calculating:

wherein h represents the variance of the cavity distribution, h ═ h₁,h₂,…,h_M]^H；t⁽¹⁾An initial mean value of the distribution of the cavities is represented,". x", "-" and "/" denote multiplication, subtraction and division operations between elements of corresponding dimensions in a matrix or vector, respectively, i.e. the variance of the cavity edge distribution in the ith signal dimension isAnd an initial mean value ofWherein, sigma_diIs vector sigma_dOf the ith signal dimension, mu_iBeing the element in the ith signal dimension of the vector μ, diag (Λ) is the vector made up of the main diagonal elements of the matrix Λ, Λ_iIs the element in the ith signal dimension of the vector diag (Λ).

Step4 average of M lumen edge distributions in the current l-th iterationSum variance h_iAnd calculating the distribution probability of each symbol on the constellation diagram, and calculating as follows:

wherein the content of the first and second substances,during the first iteration, the mean value of the cavity edge distribution of the posterior joint probability distribution q (x) is approximated, theta represents a symbol set in a constellation diagram, exp (-) represents the exponential operation of e, and the obtained value is calculatedIs the probability of the distribution followed by the symbol on the constellation that matches the cavity edge distribution on the ith signal dimension in the current ith iteration, where:

wherein, theta_aRepresenting the a-th symbol in the constellation diagram,na represents the number of symbols in the constellation,on a constellation diagram representing the l-th iteration matched to the cavity edge distribution in the i-th signal dimensionThe a-th symbol Θ of_aThe probability of the distribution followed.

Step5 according to distribution probabilityCalculating a mean of surrogate distributions that match the cavity edge distribution in the ith signal dimension

I.e. the mean of the surrogate distribution matching the cavity edge distribution in the ith signal dimensionIs the a-th symbol theta in the constellation diagram_aAnd summed with the product of the distribution probabilities followed by the symbol.

Step6 calculation of intermediate variable m^(l)＝y-Hη^(l)Wherein, in the step (A),is the mean vector of the surrogate distribution.

Step7 calculation of lumen distribution parameters at iteration l +1

Step8 calculation of mean t 'of luminal distribution at l +1 iteration'^(l+1)：

t'^(l+1)＝ρ^(l+1)./V

Wherein the mean of the cavity edge distribution in the ith signal dimension isWhereinIs the vector rho^(l+1)Of the ith signal dimension, V_iIs the element in the ith signal dimension of vector V.

Step9 updating the mean value t of the luminal distribution in the 1 st iteration^(l+1)：

t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)

Wherein, beta is a weighting coefficient, and beta belongs to [0, 1 ].

Step10, judging whether the iteration is finished, namely whether L +1 is more than the maximum iteration number L_EPAIf L +1 is not greater than the maximum number of iterations L_EPATaking l +1 as a new l value, and repeating the Step4-Step 10; if L +1 is greater than the maximum iteration number L_EPAThen the mean vector η is output^(l)And carrying out hard decision.

Vector η of mean value^(l)The hard decision is made as: for mean vector η^(l)Element in the ith signal dimensionFinding AND elements in a set of symbols of a constellation diagramThe nearest symbol is used as the detection value of the transmitted signal in the ith signal dimensionThen the signal is sent as

It can be seen from the solution algorithm of the EPA algorithm that although the EPA algorithm simplifies the matrix inversion calculation in each iteration, the calculation initialization (Step2) still includes a complete matrix inversion calculation, so that the calculation complexity still reaches the level of the matrix inversion calculationThe magnitude of (d); and also contains a large number of exponential operations (see St)ep4), which will impose a significant computational burden on the system as the number of antennas increases in a massive MIMO system.

Therefore, the invention discloses a large-scale MIMO detection method, namely an EPA algorithm (BD-NSA-EPA) based on a block diagonal Newman (Neumann) series, which utilizes a Gram matrix under a multi-user correlation channel, namely a matrix H^HThe block diagonal dominance characteristic of H is expanded by Neumann series, the inversion problem of the matrix W is approximately solved, the inversion calculation of the initialization parameter matrix W in an EPA algorithm is simplified, and meanwhile, exponential operation required when the distribution probability of each symbol on a constellation diagram is calculated is avoided.

According to the Neumann series theorem, if the diagonal dominance matrix X and the matrix W satisfy the following condition:

then W is^-1Can be written as

Where n represents an exponent, and according to the Neumann series expansion theorem, in general, the more elements of the matrix W contained in the diagonal dominant matrix X, the more accurate the result of the approximate inversion.

Considering the Gram matrix, H, under the multi-user correlation channel in the massive MIMO system^HH has a specific block diagonal dominance characteristic, and the larger the correlation of the channel is, the more obvious the block diagonal dominance characteristic of the Gram matrix is, so in order to include more elements in the matrix W and make the inversion effect more optimal, the block diagonal matrix D of the matrix W can be used to approximate X, and the above formula can be written as:

wherein the non-block diagonal matrix E ═ W-D. Assuming that the Neumann iteration result of the top k terms is retained, the above equation can be rewritten as follows:

(W^(k))^-1＝Ψ(W^(k-1))^-1+D^-1,k＝2,3,…

wherein Ψ ═ D^-1E，(W^(k))^-1Representing the approximate inverse of the k-th iteration of the matrix W. Further, rememberB is multiplied right at two sides of the equation at the same time, so that the Neumann iterative relationship of the mean vector mu can be further directly obtained:

μ^(k)＝Ψμ^(k-1)+D^-1b,k＝2,3,…

wherein, mu^(k)＝(W^(k))^-1b，μ^(k-1)＝(W^(k-1))^-1b，μ⁽¹⁾＝D^-1b。

Therefore, direct inversion calculation of the matrix W can be avoided, thereby reducing the overall computational complexity of EPA detection.

Example 1:

as shown in fig. 1, a massive MIMO detection method includes:

step S01, obtaining a receiving signal, an MIMO channel matrix and a noise variance;

step S02, calculating an initialization parameter matrix which needs matrix inversion in an EPA algorithm according to a received signal, an MIMO channel matrix and noise variance, and decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix; obtaining a mean value vector of approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix;

step S03, calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean vector of the approximate posterior joint probability distribution of the transmission signal after the Neumann iteration is completed, calculating a mean value of the surrogate distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the surrogate distribution, iteratively calculating the mean value of the surrogate distribution, and taking the mean value of the surrogate distribution reaching the maximum iteration number as a detection value of the transmission signal.

Preferably, the mean vector μ of the approximated a posteriori joint probability distribution of the transmitted signal has a value in the kth Neumann iteration:

μ^(k)＝Ψμ^(k-1)+D^-1b,k＝2,3,…

wherein Ψ ═ D^-1E；D is a block diagonal matrix, E is a non-block diagonal matrix,h is the MIMO channel matrix, y is the received signal, and γ is the first setting parameter.

Preferably, decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix includes:

and sequentially extracting a plurality of block sub-matrixes along the main diagonal direction of the initialized parameter matrix, wherein the block sub-matrixes are sequentially used as block diagonal matrixes along the main diagonal direction and the matrixes with the rest elements of 0, and the initialized parameter matrix subtracts the block diagonal matrixes to obtain a non-block diagonal matrix.

Preferably, the block submatrices have m blocks and all m block submatrices have the size of m_UE×m_UEWhere m is the number of users at the transmitting end, m_UEThe number of antennas provided for each user.

Preferably, the calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signal after the Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as the detection value of the transmission signal includes:

calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed and the block diagonal matrix;

calculating the mean value of the alternative distribution in the current iteration according to the initial mean value of the cavity distribution and the symbol set in the constellation diagram;

updating the mean value of the cavity distribution for the next iteration according to the noise variance, the MIMO channel matrix, the received signal, the mean value of the substitution distribution in the current iteration, the energy normalization factor and the set weighting coefficient;

and if the maximum iteration times are reached, taking the mean value of the alternative distribution obtained by the last iteration as the detection value of the sending signal.

Preferably, the initial mean of the cavity distribution of the approximate posterior joint probability distribution is:

for the mean vector of the approximate a posteriori joint probability distribution of the transmitted signal after the Neumann iteration is completed, L_NSAThe total number of Neumann iterations; sigma_d＝diag(D^-1) (ii) a Λ is a second setting parameter; d is a block diagonal matrix;

the mean of the substitution distribution is:

wherein the content of the first and second substances,mean vector η representing the distribution of substitutions at the ith iteration^(l)The elements of the ith dimension of the group,mean value t representing the cavity distribution at the first iteration^(l)Element of the ith dimension in (g), Θ represents a starSet of symbols, Θ, of the seating chart_aRepresents the a-th symbol in the constellation diagram, Na represents the number of symbols in the constellation diagram, and argmin represents the number of symbols in the constellation diagramTheta at minimum_aValue, mean vector of alternative distributions at the l-th iteration

The mean of the cavity distributions for the next iteration is: t is t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)；

Wherein: t'^(l+1)＝m^(l)./V+δ^(l)，m^(l)＝b-Aδ^(l)，δ^(l)＝E_norm×η^(l)；V＝diag(A)，Is a noise variance, H is an MIMO channel matrix, y is a received signal, and gamma is a first setting parameter; beta is a weighting coefficient; e_normIs an energy normalization factor.

Example 2:

as shown in fig. 5, the present invention discloses a large-scale MIMO detection method, which comprises the following specific processes:

step 1: inputting the known quantity: received signal y, MIMO channel matrix H, noise varianceMaximum number of iterations L_EPNumber of Neumann iterations L_NSAWeight coefficient beta, energy normalization factor E_normThe energy normalization factor E_normMay be determined based on the modulation order, e.g. 16-QAM modulation,

initialization Λ ═ I_M，γ＝0，V ═ diag (a), V being the vector formed by the main diagonal elements of matrix a.

Step 2: sigma of calculation_d＝diag(D^-1)；

Therein, sigma_dA vector formed by the main diagonal elements of the inverse matrix of matrix D, D being the block diagonal matrix of matrix W, containing M/M_UEA block sub-matrix, wherein the size of the block sub-matrix is determined by the number m of antennas of each user at the transmitting end_UEDetermining, i.e. the size of the partitioned submatrix to be m_UE×m_UE. The extraction method of the block diagonal matrix D comprises the following steps: according to m_UEAlong the main diagonal direction of the matrix W, M/M is extracted_UEAll sizes are m_UE×m_UEThe block submatrix of (a); the matrix composed of these block submatrices along the main diagonal with the remaining elements being 0 is the block diagonal matrix D. Fig. 4 specifically illustrates that the number M of antennas at the transmitting end is 8, and the number M of antennas at each user end_UEUnder the condition of 2, the block diagonal matrix D is partitioned, and is mathematically expressed as follows:

wherein D is_(1，1)、D_(1，2)、D_(1，3)、D_(1，4)Are all matrices of size 2 x 2.

And carrying out accurate inversion calculation on each block sub-matrix in the matrix D through a Cholesky inversion algorithm, thereby reserving MIMO channel information to the maximum extent. In obtaining an inverse matrixAndthen, according to the property of the block matrix, the inverse matrix of D can be obtained as follows:

step3 calculating the mean vector of the following Neumann iterations

μ^(k)＝Ψμ^(k-1)+μ⁽¹⁾；k＝2,3,…,L_NSA

Wherein, mu^(k)A value of a mean vector μ representing an approximate a posteriori joint probability distribution of the transmitted signal in a k-th Neumann iteration, Ψ -D^-1E，E＝W-D，Is the mean vector of the approximate a posteriori joint probability distribution of the transmitted signal after Neumann iteration is completed.

Step4, initializing initial mean value t of cavity distribution of approximate posterior joint probability distribution q (x) of sending signal by setting current iteration number l to 1⁽¹⁾Namely, calculating:

wherein, t⁽¹⁾An initial mean value of the distribution of the cavities is represented,initial mean of the cavity edge distribution in the ith signal dimension isWherein the content of the first and second substances,is a vectorOf the ith signal dimension, sigma_diIs vector sigma_dIs a vector of the main diagonal elements of the matrix Λ, Λ_iIs the element in the ith signal dimension of the vector diag (Λ). In this step, compared to the traditional EPA algorithm, there is no need to calculate the variance of the cavity distribution.

Step5 average of each lumen edge distribution in the current l-th iterationCalculating the mean of the surrogate distribution in each signal dimension

Wherein, theta_aRepresenting the value of the symbols in the constellation, Na representing the number of symbols in the constellation, argmin representing the number of symbols in the constellationTheta at minimum_aValue, i.e. taking andthe value of the symbol of the closest constellation; mean vector

Step6 calculation of the intermediate parameter, m^(l)＝b-Aδ^(l)Wherein, in the step (A),δ^(l)＝E_norm×η^(l)。

step7 calculating t'^(l+1)：

t'^(l+1)＝m^(l)./V+δ^(l)

Wherein the mean of the cavity edge distribution in the ith signal dimension isWhereinIs a vector m^(l)Of the ith signal dimension, V_iBeing the element in the ith signal dimension of the vector V,is a vector delta^(l)The ith signal dimension of (1).

Step8 updating the mean value t of the luminal distribution in the 1 st iteration^(l+1)：

t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)

Wherein, beta is a weighting coefficient, and beta belongs to [0, 1 ].

Step9, judging whether the iteration is finished, namely whether L +1 is more than the maximum iteration number L_EPIf L +1 is not greater than the maximum number of iterations L_EPTaking l +1 as a new l value, and repeating the Step5-Step 9; if L +1 is greater than the maximum iteration number L_EPThen the mean vector η is output^(l)As a detected value of the transmission signal.

The invention takes a 16-QAM modulation mode as an example, builds an MIMO transmission system on an MATLAB platform, and compares the performance difference of the detection method with detection algorithms such as MMSE, EP, EPA and the like under different antenna configurations.

Table 1 shows the mathematical expressions of the computational complexity of the BD-NSA-EPA algorithm and other detection algorithms in the embodiment of the present invention:

TABLE 1 Table of mathematical expressions for the computational complexity of the BD-NSA-EPA algorithm and other detection algorithms

From Table 1, since m_UEM, the calculation complexity of the method, namely the BD-NSA-EPA algorithm, is far less thanOf the order of magnitude of (d).

The following is described in detail with reference to fig. 6-11:

as shown in FIG. 6, the antennas at the transmitting end and the receiving end are arranged to be 128 × 16, m_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.2, receiving end antenna correlation coefficient ζ_rWhen the value is equal to 0, the BD-NSA-EPA algorithm and MMSE, EP, EPA and EP-NSA algorithms provided by the invention can realize better detection performance. Specifically, as shown in fig. 9, the EPA algorithm is set to 10 in terms of Bit Error Rate (BER) based on the EP algorithm^-3The time signal-to-noise ratio (SNR) loss is about 0 dB; MMSE algorithm at BER 10^-3The SNR loss is about 1.1dB, and the computation complexity is about 50% of the EPA algorithm; EP-NSA algorithm (L)_NSA＝3，L_EP3) at BER 10^-3The SNR loss is about 1.5dB, and the calculation complexity reaches 2 times of that of an EPA algorithm; EP-NSA algorithm (L)_NSA＝5，L_EP3) at BER 10^-3The SNR loss is about 0.4dB, and the calculation complexity reaches nearly 8 times of that of an EPA algorithm; BD-NSA-EPA algorithm (L) proposed by the present invention_NSA＝3，L_EP3) at BER 10^-3The temporal SNR loss is about 0.1dB, and the computational complexity is about 80% of the EPA algorithm; BD-NSA-EPA algorithm (L) proposed by the present invention_NSA＝5，L_EP3) at BER 10^-3The SNR loss at time is approximately 0dB, close to EPA detection, but the computational complexity is only 90% of the EPA algorithm. The combination of SNR loss and computational complexity shows that the BD-NSA-EPA algorithm provided by the invention can realize the approximate EP with lower computational costDetection performance of algorithm a.

As shown in FIG. 7, the antennas at the transmitting end and the receiving end are arranged to be 128 × 32 m_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.4, receiving end antenna correlation coefficient ζ_rAt 0.2, the conventional EP-NSA algorithm has been unable to converge. Specifically, as shown in fig. 10, based on the EP algorithm, the EPA algorithm has a BER of 10^-2The SNR loss is about 0.2 dB; MMSE algorithm at BER 10^-2The SNR loss is about 1.5dB, and the calculation complexity is about 67% of the EPA algorithm; in contrast, the BD-NSA-EPA algorithm (L) proposed by the present invention_NSA＝3,L_EP3) at BER 10^-2The SNR loss at time is about 1.3dB, the computational complexity is about 40% of the EPA algorithm; BD-NSA-EPA algorithm (L) proposed by the present invention_NSA＝8，L_EP3) at BER 10^-2The SNR loss at time is approximately 0.2dB, close to the EPA algorithm, but the computational complexity is only 45% of the EPA algorithm. The SNR loss and the calculation complexity are combined, and the BD-NSA-EPA algorithm provided by the invention can realize the detection performance close to the EPA algorithm with lower calculation cost.

As shown in fig. 8, the antennas are arranged to be 128 × 32 m at the transmitting end and the receiving end_UE4, and the antenna correlation coefficient ζ at the transmitting end_t0.6, receiving end antenna correlation coefficient ζ_rAt 0.5, the conventional EP-NSA is not able to converge. Specifically, as shown in fig. 11, with the EP algorithm as a reference, the EPA algorithm is set to BER 10^-2The SNR loss is about 0.8 dB; MMSE algorithm at BER 10^-2The SNR loss continues to increase, approximately to 2.5dB, and the computational complexity is approximately 67% of the EPA algorithm; in contrast, the BD-NSA-EPA algorithm (L) proposed by the present invention_NSA＝8,L_EP3) at BER 10^-2The SNR of time is only about 0.8dB, close to the EPA algorithm, while the computational complexity is only 45% of EPA. The SNR loss and the calculation complexity are combined, and the BD-NSA-EPA algorithm provided by the invention can realize the detection performance close to the EPA algorithm with lower calculation cost.

As shown in fig. 6, 7 and 8, the correlation of the channel gradually increases, and the performance of the conventional EP-NSA algorithm is obviously degraded as the correlation of the channel increases; the BD-NSA-EPA algorithm provided by the invention can always maintain the performance close to that of the EPA algorithm, but the complexity is much lower than that of the EPA algorithm.

Example 3:

the present invention also discloses a large-scale MIMO detection apparatus, as shown in fig. 12, including:

an obtaining module, configured to obtain a received signal, a MIMO channel matrix, and a noise variance;

the Neumann iteration module is used for calculating an initialization parameter matrix which needs matrix inversion in an EPA algorithm according to a received signal, an MIMO channel matrix and noise variance, and decomposing the initialization parameter matrix into a block diagonal matrix and a non-block diagonal matrix; obtaining a mean value vector of approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed based on a Neumann iteration method according to the block diagonal matrix and the non-block diagonal matrix;

and the detection value iteration calculation module is used for calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean value vector of the approximate posterior joint probability distribution of the transmission signal after Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as the detection value of the transmission signal.

Further, the value of the mean vector μ of the approximated posterior joint probability distribution of the transmitted signal in the kth Neumann iteration is:

μ^(k)＝Ψμ^(k-1)+D^-1b,k＝2,3,…

wherein Ψ ═ D^-1E；D is a block diagonal matrix, E is a non-block diagonal matrix,is the noise variance, H is the MIMO channel matrix, y is the received signal, γIs a first setting parameter.

Further, the initialization parameter matrix is decomposed into a block diagonal matrix and a non-block diagonal matrix, a plurality of block sub-matrices are sequentially extracted along the main diagonal direction of the initialization parameter matrix, the block sub-matrices are sequentially taken as block diagonal matrices along the main diagonal, and the non-block diagonal matrices are obtained by subtracting the block diagonal matrices from the initialization parameter matrix.

Further, the block submatrices have m numbers, and the size of each block submatrix is m_UE×m_UEWhere m is the number of users at the transmitting end, m_UEThe number of antennas provided for each user.

Further, the calculating an initial mean value of the cavity distribution of the approximate posterior joint probability distribution according to the mean vector of the approximate posterior joint probability distribution of the transmission signal after the Neumann iteration is completed, calculating a mean value of the substitution distribution according to the initial mean value of the cavity distribution, updating the mean value of the cavity distribution according to the mean value of the substitution distribution, iteratively calculating the mean value of the substitution distribution, and taking the mean value of the substitution distribution reaching the maximum iteration number as the detection value of the transmission signal includes:

calculating an initial mean value of cavity distribution of the approximate posterior joint probability distribution according to a mean vector of the approximate posterior joint probability distribution of the transmission signals after Neumann iteration is completed and a block diagonal matrix;

calculating the mean value of the alternative distribution in the current iteration according to the initial mean value of the cavity distribution and the symbol set in the constellation diagram;

updating the mean value of the cavity distribution for the next iteration according to the noise variance, the MIMO channel matrix, the received signal, the mean value of the substitution distribution in the current iteration, the energy normalization factor and the weighting coefficient;

and if the maximum iteration times are reached, taking the mean value of the alternative distribution obtained by the last iteration as the detection value of the sending signal.

Further, the initial mean of the cavity distribution of the approximate posterior joint probability distribution is:

for the mean vector of the approximate a posteriori joint probability distribution of the transmitted signal after Neumann iteration is completed, L_NSAThe number of Neumann iterations; sigma_d＝diag(D^-1) (ii) a Λ is a second setting parameter; d is a block diagonal matrix;

the mean of the substitution distribution is:

wherein the content of the first and second substances,mean vector η representing the distribution of substitutions at the ith iteration^(l)The elements of the ith dimension of the group,mean value t representing the cavity distribution at the first iteration^(l)The element of the ith dimension in (i) represents a symbol set of a constellation diagram (theta)_aRepresents the a-th symbol in the constellation diagram, Na represents the number of symbols in the constellation diagram, and argmin represents the number of symbols in the constellation diagramTheta at minimum_aValue, mean vector of alternative distributions at the l-th iteration

The mean of the cavity distributions for the next iteration is: t is t^(l+1)＝β·t'^(l+1)+(1-β)·t^(l)；

Wherein: t'^(l+1)＝m^(l)./V+δ^(l)，m^(l)＝b-Aδ^(l)，δ^(l)＝E_norm×η^(l)；V＝diag(A)，Is a noise variance, H is an MIMO channel matrix, y is a received signal, and gamma is a first setting parameter; beta is a weighting coefficient; e_normIs an energy normalization factor.

Example 4:

the invention also discloses a large-scale MIMO detection device, which comprises a processor, a memory and a computer program which is stored on the memory and can run on the processor, wherein the processor executes the program to realize any one of the large-scale MIMO detection methods.

A computer-readable storage medium storing computer-executable instructions for performing any of the massive MIMO detection methods described above.

The above description is only of the preferred embodiments of the present invention, and it should be noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the invention and these are intended to be within the scope of the invention.