Perceptual mutual information-based low-complexity MIMO (Multiple Input Multiple Output) sensing integrated beam forming method

By adopting low-complexity iterative algorithms in the MIMO synesthesia integrated system, using minimization maximization technology and Lagrangian multiplication method, the problem of maximization of perceived mutual information under the limits of base station power and multi-communication user rate is solved. Efficient beamforming is achieved, reducing system complexity and improving perceptual performance.

CN118944726APending Publication Date: 2024-11-12SOUTHEAST UNIV
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202410990463.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-23
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The existing MIMO synesthesia integrated system is difficult to maximize perceived mutual information under the conditions of base station power and multi-communication user rate limitations, and the existing algorithm is highly complex and difficult to meet the communication service needs.

Method used

A low-complexity iterative algorithm based on perceptual mutual information is adopted, and a closed beamforming scheme is constructed through minimization maximization technology, penalty function and Lagrangian multiplication method, which simplifies the solution process of the beamforming matrix at the base station.

Benefits of technology

While ensuring the communication service requirements, it significantly reduces complexity, improves perceptual performance, and significantly reduces CPU computing time and iteration times, improving the system's convergence performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118944726A_ABST
    Figure CN118944726A_ABST
Patent Text Reader

Abstract

The invention discloses a low-complexity MIMO (Multiple Input Multiple Output) sensing integrated beamforming method based on sensing mutual information. The method comprises the following steps: deploying a base station of a ULA antenna, and simultaneously completing multi-user communication and radar target sensing tasks; in addition, radar clutter interference is considered. The method aims at sensing mutual information to the maximum extent, and meanwhile multi-user communication constraints and base station power constraints are met. According to the method, the problem of low-complexity MIMO beam forming based on sensing mutual information can be solved, and the sensing mutual information is maximized while the communication requirement is ensured. Compared with an existing continuous convex approximation iterative algorithm based on a CVX solver, the method provided by the invention can obtain better perception mutual information and has lower complexity.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of wireless communication physical layer, and in particular relates to a low-complexity MIMO interaceptive integrated beamforming method based on perceptual mutual information. Background Art

[0002] As a very promising technology in 6G research, interawareness integration can effectively alleviate the current spectrum resource shortage caused by the rapid increase in the number of wireless devices. Compared with traditional independent radar or communication systems and radar communication coexistence systems, the joint deployment of communication and radar can further improve hardware efficiency and energy efficiency. The freedom brought by MIMO technology can further improve the performance of communication and radar in interawareness integration technology. In recent years, a large number of literatures have studied the precoding technology of MIMO ISAC. The performance of ISAC system is mainly measured from two aspects: communication and radar. For communication, researchers mainly aim to improve SINR. For radar, we measure its detection performance by detection probability, and improve estimation performance by indicators such as CRB, SINR, and beampattern. In addition, perceptual mutual information is generally used to measure the overall performance of radar. Summary of the invention

[0003] The purpose of the present invention is to provide a low-complexity MIMO synaesthesia integrated beamforming design method based on perceptual mutual information in view of the shortcomings of the prior art. On the one hand, the method can meet the transmission rate requirements of communication users, and on the other hand, maximize the perceptual mutual information, thereby improving the perceptual performance.

[0004] In order to solve the above technical problems, the specific technical solutions of the present invention are as follows:

[0005] A low-complexity MIMO interaceptive integrated beamforming method based on perceptual mutual information comprises the following steps:

[0006] Step 1: Initialize the base station beamforming matrix W (0) , the maximum number of iterations τ max and iterative error ∈, let the number of iterations τ = 0, let h(W) represent the objective function of the beamforming matrix at the base station;

[0007] Step 2: Given the kth auxiliary variable in vector form Where [K] represents the set {1, 2, L, K}, and K is the number of communication users. Construct the MIMO interaceptive integrated base station beamforming subproblem P1, and solve the subproblem P1 to obtain the base station beamforming matrix W (τ+1) ;

[0008] Step 3: Given the base station beamforming matrix W (τ+1), construct auxiliary variable subproblem P2, solve subproblem P2 to obtain auxiliary variables

[0009] Step 4. Let τ=τ+1 and ρ=min(ζρ,ρ max ), where ζ is the multiplicative factor, ρ max is the maximum penalty coefficient, ρ is the penalty coefficient;

[0010] Step 5: If as well as At the same time, stop the iteration, where w j represents the jth column of the beamforming matrix at the base station, l kj Represents the auxiliary variable l in the form of the kth vector k The jth element in h k represents the channel between the base station and the kth user, and the conjugate transpose is H ; Otherwise, return to step 2.

[0011] Furthermore, subproblem P1 is constructed as:

[0012]

[0013] R k ≥r k ,k∈[K],

[0014] Where [K] represents the set {1,L,K}, det represents the matrix determinant, represents the square of the norm of the matrix F, Indicates dimension is KN R The identity matrix of represents the synaesthesia integrated beamforming matrix, N T Indicates the number of transmitting antennas equipped by the base station, N R represents the number of receiving antennas equipped by the base station, L represents the time slot length of the communication and the number of radar snapshots, is the radar noise power, and the communication rate of the kth user is r k is the minimum rate requirement of the kth user, P0 is the maximum transmission power of the base station, is the communication noise power, h k is the channel between the base station and the kth user, w k represents the kth column of the beamforming matrix at the base station; represents the Kronecker product of the matrix; the covariance matrix of the target response matrix is ​​expressed as Among them, M r is the number of scatterers, is the square of the reflection coefficient of the target scatterer, and its conjugate is* , is the arrival angle and departure angle of the i-th target scatterer relative to the base station, as well as are the transmission and reception steering vectors for the target scatterer base station respectively; the covariance matrix of the interference response matrix is ​​expressed as: Among them, M c is the number of scatterers, is the square of the reflection coefficient of the interfering scatterer, is the arrival angle and departure angle of the ith interfering scatterer relative to the base station, as well as are the transmitting and receiving steering vectors of the interfering scatterer base station, R RC =R R +R C .

[0015] Furthermore, the minimization and maximization, auxiliary variables and penalty function techniques are used to transform the subproblem P1. The specific steps include:

[0016] Step 2.1: Given auxiliary variables Sub-problem P1 is transformed into the MIMO synaesthesia-integrated base station-side beamforming approximate sub-problem P3:

[0017]

[0018] Among them, vec represents matrix vectorization operation, Re represents taking the real part of the complex number, is a permutation matrix, transposed to T , is the basic matrix where The first element is 1 and the rest are 0. mod means modulus operation. Indicates rounding up operation.

[0019]

[0020] where i j is the unit matrix I K The jth column of -1 It is the matrix inversion operation;

[0021] Step 2.2: Using the Lagrange multiplier method, we have in, Find the pseudoinverse of the matrix, λ represents the Lagrange multiplier corresponding to the power constraint and λ ≥ 0, let If f(0)≤P0, the optimal λ1=0; otherwise, the binary search method is used. Search for the optimal λ1 between N=U H mm H U,N [i,i] represents the (i,i)th element of the matrix, the matrix The eigenvalue decomposition of U is the feature matrix.

[0022] Furthermore, the auxiliary variable subproblem P2 is constructed as:

[0023]

[0024] in l kk for l k The kth element of ;

[0025] Using the Lagrange multiplier method, we have where μ k is the Lagrange multiplier corresponding to the constraint; let and μ k The optimal value is Where g(μ k ) is about μ k If g(0)≤0, then the optimal Otherwise, use binary search to search for the best value between (0,1)

[0026] The low-complexity MIMO synaesthesia integrated beamforming method based on perceptual mutual information of the present invention has the following advantages: the present invention solves the perceptual mutual information maximization problem of the MIMO synaesthesia integrated system based on perceptual mutual information under the conditions of base station power and multi-communication user rate constraints, and proposes a novel low-complexity closed beamforming scheme with simple method and accurate result. Compared with the existing MIMO synaesthesia integrated beamforming algorithm based on perceptual mutual information that calls the CVX solver, the beamforming scheme of the present invention can greatly reduce the complexity, and further improve the perception performance while ensuring the demand for communication services. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 is a diagram of the MIMO synaesthesia integration system of the present invention;

[0028] Figure 2 is a graph of CPU calculation time and the number of base station antennas of the method of the present invention;

[0029] Figure 3 It is a convergence performance diagram of the method of the present invention. DETAILED DESCRIPTION

[0030] In order to better understand the purpose, structure and function of the present invention, a low-complexity MIMO synaesthesia integrated beamforming method based on perceptual mutual information of the present invention is further described in detail below with reference to the accompanying drawings.

[0031] The present invention considers the base station end beamforming subproblem and the auxiliary variable subproblem respectively, specifically, given the base station end transmit power constraint, maximizing the perceived mutual information, and the downlink multi-communication users meet the transmission rate requirements. A low-complexity iterative algorithm based on the minimum maximization technique, penalty function and Lagrange multiplier is given, and the base station end beamforming matrix obtained by the algorithm is the final beamforming scheme.

[0032] The specific steps include:

[0033] Consider a MIMO interaceptive integrated system, where the DFRC base stations are equipped with N T transmit antennas and N R receive antennas. Assume that the base station serves K single-antenna communication users and completes the sensing task at the same time. represents a K-channel data stream of unit energy, with a length of L, which obeys an independent and identically distributed complex Gaussian distribution, that is, The base station's transmitted DFRC signal is X=WS, where the vector represents the synaesthesia integrated beamforming matrix.

[0034] The communication signal received by the kth user in the lth time slot is where h k is the channel between the base station and the kth user, x l is the lth column of the transmitted signal X, n k,c represents the additive Gaussian white noise of the kth user, which obeys an independent and identically distributed complex Gaussian distribution, that is, Therefore, the transmission rate of the kth user is expressed as

[0035] The echo signal received by the base station can be expressed as Y R =G R X+G C X+Z, where is an additive Gaussian white noise matrix, which follows the distribution as well as They represent the target response matrix and interference response matrix of the radar surface target respectively. as well as The distribution of Here, the covariance matrix of the target response matrix is ​​expressed as Among them, M r is the number of scatterers, is the square of the reflection coefficient of the target scatterer, is the arrival angle and departure angle of the i-th target scatterer relative to the base station, as well as are the transmission and reception steering vectors for the target scatterer base station respectively; the covariance matrix of the interference response matrix is ​​expressed as: Among them, M c is the number of scatterers, is the square of the reflection coefficient of the interfering scatterer, is the arrival angle and departure angle of the ith interfering scatterer relative to the base station, as well as They are the transmission and reception steering vectors of the interfering scatterer base station respectively. Definition z=vec(Z H ), have Assume that g R ,g C , z and S are independent of each other, and we can get y for a given transmitted signal R and g R The perceptual mutual information is

[0036] According to the law of large numbers, when L becomes asymptotically large,

[0037] Therefore, the overall optimization problem can be modeled as

[0038]

[0039] R k ≥r k ,k∈[K],

[0040] Among them, r k is the minimum rate requirement of the user, and P0 is the maximum transmission power of the base station. To solve the above overall optimization problem, the minimum maximization technique, penalty function and Lagrange multiplier are used, including the following steps:

[0041] (1) Initialize the base station beamforming matrix W (0) , the maximum number of iterations τ max and iterative error ∈, let the number of iterations τ = 0, let h(W) represent the objective function;

[0042] (2) Given auxiliary variables Construct the MIMO synaesthesia-integrated base station beamforming subproblem P1, and solve the subproblem P1 to obtain the base station beamforming vector W (τ+1) ;

[0043] (3) Given the base station beamforming matrix W (τ+1), construct auxiliary variable subproblem P2, solve subproblem P2 to obtain auxiliary variables

[0044] (4) Let τ=τ+1 and ρ=min(ζρ,ρ max ). where ζ is the multiplicative factor, ρ max is the maximum penalty coefficient.

[0045] (5) If as well as Stop the iteration; otherwise, return to step (2).

[0046] Subproblem P1 is constructed as:

[0047]

[0048] R k ≥r k ,k∈[K],

[0049] Where [K] represents the set {1,L,K}. represents the synaesthesia integrated beamforming matrix, N T represents the number of transmitting antennas equipped by the base station, and the communication rate of the kth user is r k is the minimum rate requirement of the kth user, P0 is the maximum transmission power of the base station, is the communication noise power, h k is the channel between the base station and the kth user. The covariance matrix of the target response matrix is ​​expressed as Among them, M r is the number of scatterers, is the square of the reflection coefficient of the target scatterer, is the arrival angle and departure angle of the i-th target scatterer relative to the base station, as well as are the transmission and reception steering vectors of the base station respectively; the covariance matrix of the interference response matrix is ​​expressed as: Among them, M c is the number of scatterers, is the square of the reflection coefficient of the interfering scatterer, is the arrival angle and departure angle of the ith interfering scatterer relative to the base station,

[0050] R RC =R R +R C ;

[0051] Use minimization and maximization, auxiliary variables and penalty function techniques to transform subproblem P1:

[0052] (2.1) Given auxiliary variables Sub-problem P1 is transformed into the MIMO synaesthesia-integrated base station-side beamforming approximate sub-problem P3:

[0053]

[0054] Among them, vec represents matrix vectorization operation, Re represents taking the real part of the complex number, is the permutation matrix, is the basic matrix where elements are 1 and the rest are 0.

[0055]

[0056] where i j is the unit matrix I K The jth column of . ρ is the penalty coefficient.

[0057] (2.2) Using the Lagrange multiplier method, we have where λ represents the Lagrange multiplier corresponding to the power constraint and λ ≥ 0. Let If f(0)≤P0, the optimal λ1=0; otherwise, the binary search method is used. Search for the optimal λ1 between N [i,i] represents the (i,i)th element of the matrix, the matrix The eigenvalue decomposition of U is the feature matrix.

[0058] The auxiliary variable subproblem P2 is constructed as:

[0059]

[0060] in

[0061] Using the Lagrange multiplier method, we have where μ k is the Lagrange multiplier corresponding to the constraint. If g(0)≤0, then the optimal Otherwise, use binary search to search for the best value between (0,1)

[0062] Figure 2 The graph of the CPU calculation time of the method and the number of base station antennas is shown. The method of the present invention is the red line. Compared with the existing method, although the increase in the number of antennas will increase the calculation complexity, the CPU calculation time required by the method of the present invention is always the lowest. Figure 3The convergence performance diagram of the method is shown. The method of the present invention is the red line. Compared with the existing method, the method of the present invention requires the least number of iterations, but the final convergence point can still obtain good perceptual mutual information. The above shows the superiority of the low-complexity closed beamforming method proposed by the present invention.

[0063] It is to be understood that the present invention is described by some embodiments, and it is known to those skilled in the art that various changes or equivalent substitutions may be made to these features and embodiments without departing from the spirit and scope of the present invention. In addition, under the teachings of the present invention, these features and embodiments may be modified to adapt to specific circumstances and materials without departing from the spirit and scope of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed herein, and all embodiments falling within the scope of the claims of this application are within the scope of protection of the present invention.

Claims

1. A low-complexity MIMO synaesthesia integrated beamforming method based on perceptual mutual information, characterized in that: The steps include: Step 1: Initialize the beamforming matrix W at the base station (0) , the maximum number of iterations τ max and iterative error ∈, let the number of iterations τ = 0, let h(W) represent the objective function of the beamforming matrix at the base station; Step 2: Given the kth auxiliary variable in vector form k∈[K], where [K] represents the set {1,2,L,K}, and K is the number of communication users; construct the MIMO interaceptive integrated base station beamforming subproblem P1, and solve the subproblem P1 to obtain the base station beamforming matrix W (τ+1) ; Step 3: Given the base station beamforming matrix W (τ+1) , construct auxiliary variable subproblem P2, solve subproblem P2 to obtain auxiliary variables k∈[K]; Step 4. Let τ=τ+1 and ρ=min(ζρ,ρ max ), where ζ is the multiplicative factor, ρ max is the maximum penalty coefficient, ρ is the penalty coefficient; Step 5: If as well as At the same time, stop the iteration, where w j represents the jth column of the beamforming matrix at the base station, l kj Represents the auxiliary variable l in the form of the kth vector k The jth element in h k represents the channel between the base station and the kth user, and the conjugate transpose is H ; Otherwise, return to step 2.

2. The method for low-complexity MIMO synaesthesia integrated beamforming based on perceptual mutual information according to claim 1, characterized in that: Subproblem P1 is constructed as: Where [K] represents the set {1,L,K}, det represents the matrix determinant, represents the square of the norm of the matrix F, Indicates dimension is KN R The identity matrix of represents the synaesthesia integrated beamforming matrix, N T Indicates the number of transmitting antennas equipped by the base station, N R represents the number of receiving antennas equipped by the base station, L represents the time slot length of the communication and the number of radar snapshots, is the radar noise power, and the communication rate of the kth user is r k is the minimum rate requirement of the kth user, P0 is the maximum transmission power of the base station, is the communication noise power, h k is the channel between the base station and the kth user, w k represents the kth column of the beamforming matrix at the base station; represents the Kronecker product of the matrix; the covariance matrix of the target response matrix is ​​expressed as Among them, M r is the number of scatterers, is the square of the reflection coefficient of the target scatterer, and its conjugate is * , is the arrival angle and departure angle of the i-th target scatterer relative to the base station, as well as are the transmission and reception steering vectors for the target scatterer base station respectively; the covariance matrix of the interference response matrix is ​​expressed as: Among them, M c is the number of scatterers, is the square of the reflection coefficient of the interfering scatterer, is the arrival angle and departure angle of the ith interfering scatterer relative to the base station, as well as are the transmitting and receiving steering vectors for the interfering scatterer base station, R RC =R R +R C .

3. The method for low-complexity MIMO synaesthesia integrated beamforming based on perceptual mutual information according to claim 2, characterized in that: The subproblem P1 is transformed using minimization and maximization, auxiliary variables and penalty function techniques. The specific steps include: Step 2.1: Given auxiliary variables Sub-problem P1 is transformed into the MIMO synaesthesia-integrated base station-side beamforming approximate sub-problem P3: Among them, vec represents matrix vectorization operation, Re represents taking the real part of the complex number, is a permutation matrix, transposed to T , is the basic matrix where The first element is 1 and the rest are 0. mod means modulus operation. Indicates rounding up operation. where i j is the unit matrix I K The jth column of -1 It is the matrix inversion operation; Step 2.2: Using the Lagrange multiplier method, we have in, Find the pseudoinverse of the matrix, λ represents the Lagrange multiplier corresponding to the power constraint and λ ≥ 0, let If f(0)≤P0, the optimal λ1=0; otherwise, the binary search method is used. Search for the optimal λ1 between N=U H mm H U,N [i,i] represents the (i,i)th element of the matrix, the matrix The eigenvalue decomposition of U is the feature matrix.

4. The method for low-complexity MIMO synaesthesia integrated beamforming based on perceptual mutual information according to claim 3, characterized in that: The auxiliary variable subproblem P2 is constructed as: in l kk for l k The kth element of ; Using the Lagrange multiplier method, we have where μ k is the Lagrange multiplier corresponding to the constraint; let and μ k The optimal value is Where g(μ k ) is about μ k If g(0)≤0, then the optimal Otherwise, use binary search to search for the best value between (0,1)

Citation Information

Cited By

  • Communication and perception integration method and system for base station and user cooperation

    CN119907099A

  • Reconfigurable intelligent surface auxiliary sensing integrated beam control method and device and medium

    CN120111539A

  • Sensitivity integrated beam forming method based on aperture allocation and saturation power amplification

    CN120342451A