Optimization method for wireless energy-carrying rate split communication network assisted by dual IRS

Through the dual IRS-assisted wireless portable rate split communication network optimization method, the problem of insufficient resource utilization and coverage of RSMA system during IRS deployment is solved, and the user communication rate is maximized and fair, which is suitable for complex Multi-user system for scenarios.

CN115103375BActive Publication Date: 2024-11-22HENAN SUNSEA HENGLIAN COMM TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210396039.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-04-15
Publication Date
2024-11-22
Estimated Expiration
2042-04-15

AI Technical Summary

Technical Problem

When considering IRS deployment, the existing RSMA system performs poorly in terms of communication resource utilization and coverage, and fails to be effectively applied in complex scenarios, making it impossible to maximize and fair user communication rates.

Method used

It proposes a dual IRS-assisted wireless energy-carrying rate split communication network optimization method. By establishing a dual IRS-assisted system, an alternating optimization method is adopted to maximize the communication rate of the minimum user, and to achieve the maximum user communication rate under the user's energy acquisition requirements. and fairness.

Benefits of technology

In complex scenarios, the utilization rate and coverage of communication resources are improved, the communication rate is achieved, and it is suitable for a variety of communication application scenarios, and it shows better performance in multi-user systems.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115103375B_ABST
    Figure CN115103375B_ABST
Patent Text Reader

Abstract

The present invention provides an optimization method for a wireless energy carrying rate splitting communication network assisted by dual IRS, and relates to the field of wireless energy carrying communication technology. The method includes the following steps: S1, establishing a wireless energy carrying rate splitting communication network system assisted by dual IRS; S2, determining the original problem of the system optimization target; S3, simplifying the original problem into a number of sub-problems, and performing convex optimization on the unsolvable sub-problems, so that the sub-problems can be solved; S4, using an alternating optimization method to perform alternating iterations on all solvable sub-problems to obtain the system parameters that maximize the minimum user communication rate in the system under the condition that the system parameters meet the preset initial constraints; the technical solution combines dual IRS with a wireless energy carrying system based on rate splitting, establishes a wireless energy carrying rate splitting communication network system assisted by dual IRS, and considers maximizing the communication rate of the minimum user, thereby maximizing the user communication rate and taking fairness into consideration under the user energy collection requirements.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of wireless energy-carrying communication technology, and more specifically, to an optimization method for a dual IRS-assisted wireless energy-carrying rate splitting communication network. Background Art

[0002] Intelligent reflecting surface (IRS) is a revolutionary new technology that can effectively improve the resource utilization of wireless communication systems and expand communication coverage. It is composed of a large number of low-cost passive reflective elements. By adjusting the coefficients of the reflective elements at the software level, the phase shift of the reflected signal can be dynamically adjusted, thereby reconfiguring the wireless propagation channel and improving the performance of the communication system. Compared with traditional relay technology, using IRS for signal reflection transmission can avoid complicated signal amplification and regeneration, and has lower hardware and deployment costs.

[0003] The dual purpose of radio signals for wireless information and power transfer (Simultaneous wireless information and power transfer, SWIPT) has always been a hot topic in wireless communication research. A typical SWIPT working scenario is that the base station broadcasts radio signals with a certain power to heterogeneous user terminals located near the base station. These users can be mainly divided into three categories. One is the information receiving user who only requires decoding information from the received radio signal, the other is the energy receiving user who only requires converting the received radio signal into usable electric energy, and the last is the hybrid receiving user who requires both decoding information from the radio signal and converting the radio signal into electric energy. Hybrid receiving users are the most common type of users. There are mainly two special signal receivers. One is the time-splitting (TS) receiver, that is, within a given working time span, all the radio signals received in part of the time are used for information decoding, and all the radio signals received in the other part of the time are used for electric energy conversion; the other is the power-splitting (PS) receiver, that is, the received radio signal will be divided into two parts, one part of the signal is used for information decoding, and the other part of the signal is used for electric energy conversion, and the two processes are carried out simultaneously. In fact, the time division receiver is a special case of the power division receiver, which is more general in application.

[0004] Rate-splitting Multiple Access (RSMA) is a more flexible and powerful multiple access technology in multi-antenna multi-user downlink communication systems. The existing common space-division multiple access (SDMA) and non-orthogonal multiple access (NOMA) are both special cases. The characteristic of SDMA is that it uses multiple antennas at the transmitter to linearly precode the transmitted signal in the spatial domain to distinguish service users and reduce communication interference between users. For a specific user, all signals of other users will be regarded as interference noise when receiving the signal. The characteristic of NOMA is that it uses multiple antennas at the transmitter to linearly superimpose precode the transmitted signal in the power domain, and performs successive interference cancellation (SIC) on the user side to decode the information of other users, so as to eliminate the influence of the decoded user's signal in the received superimposed signal, thereby achieving the purpose of eliminating interference. SDMA and NOMA are two extreme cases of RSMA. SDMA "completely treats interference as noise", NOMA "completely decodes and eliminates interference", and RSMA is a compromise solution, that is, "only part of the interference is regarded as noise, and only part of the interference is decoded to eliminate it". Therefore, in different communication environments, RSMA can provide more flexible design space for improving communication rate and service quality, as well as reducing implementation complexity.

[0005] RSMA's unique public beam design and the requirement that SIC only needs to be performed once on the user side make it have superior performance in the SWIPT system than SDMA and NOMA. However, energy transmission is very dependent on a good communication environment, and an undesirable communication environment will greatly reduce the efficiency of energy transmission. Based on the above considerations, we hope to improve the information transmission efficiency and energy transmission efficiency of the system by combining IRS and the RSMA-based SWIPT system, and achieve both user communication rate maximization and user communication fairness while meeting the energy required by the user, that is, maximizing the communication rate of the smallest user. At present, there are still relatively few studies considering the deployment of IRS in the RSMA system. There is no relevant research on the model of IRS constructed by the present invention to assist the RSMA-based SWIPT system to maximize the user rate while ensuring communication fairness, and the present invention constructs a dual IRS model that is superior to the traditional single IRS model.

[0006] In the prior art, the document "Camana, MR, Tuan, PV, Garcia, CE et al. Joint power allocation and power splitting for MISO SWIPT RSMA systems with energy-constrained users. Wireless Netw 26, 2241–2254 (2020). https: / / doi.org / 10.1007 / s11276-019-02126-z" proposed a multi-user multi-input single-output SWIPT system model based on RSMA. The paper pointed out that under the same user communication rate and energy collection requirements, compared with the traditional NOMA technology, the SWIPT system using RSMA technology has better performance in minimizing the base station transmit power. However, the paper did not consider IRS-assisted communication, and performed poorly in terms of communication resource utilization and communication coverage.

[0007] The paper "Z.Yang, J.Shi, Z.Li, M.Chen, W.Xu and M.Shikh-Bahaei,"EnergyEfficient Rate Splitting Multiple Access(RSMA)with Reconfigurable IntelligentSurface,"2020IEEE International Conference on Communications Workshops(ICCWorkshops), 2020, pp.1-6, doi:10.1109 / ICCWorkshops49005.2020.9145189." proposed a model for deploying IRS in RSMA, and demonstrated that the system can achieve better energy efficiency with the assistance of IRS. However, the IRS-assisted RSMA model does not consider the SWIPT system, and a single IRS is deployed, which will be hindered in some complex scenarios.

[0008] The paper "L. Dong, H.-M. Wang, J. Bai and H. Xiao,"Double Intelligent Reflecting Surface for Secure Transmission With Inter-Surface Signal Reflection," in IEEE Transactions on Vehicular Technology, vol. 70, no. 3, pp. 2912-2916, March 2021, doi: 10.1109 / TVT.2021.3062059." considers the problem of secure communication assisted by dual IRS and demonstrates the superiority of deploying dual IRS. However, the model is not based on the RSMA SWIPT system and cannot perform wireless energy communication. Summary of the invention

[0009] In order to overcome the above technical problems, the present invention provides an optimization method for a wireless energy-carrying rate splitting communication network assisted by a dual IRS which has high communication resource utilization and wide communication coverage and is suitable for complex scenarios.

[0010] The technical solution of the present invention is as follows:

[0011] The optimization method of the wireless energy carrying rate splitting communication network assisted by dual IRS comprises the following steps:

[0012] S1. Establish a dual-IRS-assisted wireless energy-carrying rate splitting communication network system, the wireless energy-carrying rate splitting communication network system includes: IRS1, IRS2, a wireless access point and a number of wireless users, the wireless access point transmits information and energy to the wireless users, and IRS1 and IRS2 are used to assist in improving the efficiency of information and energy transmission;

[0013] S2, determining the original problem P1 of the optimization target of the wireless energy carrying rate splitting communication network system, wherein the original problem P1 refers to maximizing the minimum user communication rate in the system under the condition that the system parameters of the wireless energy carrying rate splitting communication network system meet the preset initial constraints;

[0014] S3, simplifying the original problem P1 into several sub-problems, each of which needs to satisfy corresponding sub-constraint conditions, performing convex optimization processing on all unsolvable sub-problems, so that all non-convex constraints of the sub-constraint conditions are converted into convex constraints, thereby converting all unsolvable sub-problems into solvable sub-problems;

[0015] S4. Using an alternating optimization method to perform alternating iterations on all solvable sub-problems, and obtaining system parameters that maximize the minimum user communication rate in the system under the condition that the system parameters of the wireless energy carrying rate splitting communication network system meet the preset initial constraints;

[0016] Among them, the wireless energy carrying described in step S1 refers to the communication network system being used for both wireless information transmission and wireless energy transmission, and the rate splitting refers to the use of rate multiple access splitting technology as the multiple access technology of the communication network system; the minimum user described in step S2 refers to the user with the smallest communication rate in the wireless energy carrying rate splitting communication network system.

[0017] The technical scheme proposes an optimization method for a wireless energy carrying rate splitting communication network assisted by a dual IRS. Compared with the prior art, the beneficial effects of the technical scheme of the present invention are as follows: the technical scheme proposes an optimization method for a wireless energy carrying rate splitting communication network assisted by a dual IRS, combines the dual IRS and the wireless energy carrying system based on rate splitting, establishes a wireless energy carrying rate splitting communication network system assisted by a dual IRS, and further deepens the consideration of maximizing the communication rate of the minimum user, thereby maximizing the user communication rate and taking fairness into account under the user energy collection requirements; because the deployment strategy of the dual IRS is adopted, in some complex communication scenarios, it is possible to use the reflections between the intelligent reflection surfaces, between the intelligent reflection surfaces and the wireless access points, and between users to form a propagation link with less obstruction and less loss, thereby achieving a higher communication rate under limited available resources, improving the utilization rate of communication resources and the communication coverage; the application of the rate splitting multiple access strategy in a multi-user wireless energy carrying system has better performance than other strategies, and the technical scheme is applicable to any number of users and any energy collection requirements, and takes into account the communication fairness between multiple users, so the design of the present invention has practical applicability and flexibility, and is applicable to a variety of communication application scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 Schematic diagram of the steps of the optimization method of the present invention

[0019] Figure 2 It is a schematic diagram of a wireless energy carrying rate split communication network system;

[0020] Figure 3 This is a schematic diagram of the relationship between the system minimum user rate and the transmission power of the wireless access point;

[0021] Figure 4 This is a schematic diagram showing the relationship between the system minimum user rate and the user energy collection requirements;

[0022] Figure 5 Schematic diagram of the relationship between the system minimum user rate and the number of IRS reflection units. DETAILED DESCRIPTION

[0023] In order to clearly illustrate the optimization method of the dual IRS-assisted wireless energy-carrying rate split communication network of the present invention, the present invention is further described in conjunction with the embodiments and drawings, but this should not limit the protection scope of the present invention.

[0024] Example 1

[0025] This embodiment provides an optimization method for a dual IRS-assisted wireless energy-carrying rate split communication network, such as Figure 1 As shown, the following steps are included:

[0026] S1. Establish a wireless energy-carrying rate split communication network system assisted by dual IRS, such as Figure 2 As shown, the wireless energy carrying rate splitting communication network system includes: IRS1, IRS2, a wireless access point and a number of wireless users, the wireless access point transmits information and energy to the wireless users, and IRS1 and IRS2 are used to assist in improving the efficiency of information and energy transmission;

[0027] S2, determining the original problem P1 of the optimization target of the wireless energy carrying rate splitting communication network system, wherein the original problem P1 refers to maximizing the minimum user communication rate in the system under the condition that the system parameters of the wireless energy carrying rate splitting communication network system meet the preset initial constraints;

[0028] S3, simplifying the original problem P1 into several sub-problems, each of which needs to satisfy corresponding sub-constraint conditions, performing convex optimization processing on all unsolvable sub-problems, so that all non-convex constraints of the sub-constraint conditions are converted into convex constraints, thereby converting all unsolvable sub-problems into solvable sub-problems;

[0029] S4. Using an alternating optimization method to perform alternating iterations on all solvable sub-problems, and obtaining system parameters that maximize the minimum user communication rate in the system under the condition that the system parameters of the wireless energy carrying rate splitting communication network system meet the preset initial constraints;

[0030] Among them, the wireless energy carrying described in step S1 refers to the communication network system being used for both wireless information transmission and wireless energy transmission, and the rate splitting refers to the use of rate multiple access splitting technology as the multiple access technology of the communication network system; the minimum user described in step S2 refers to the user with the smallest communication rate in the wireless energy carrying rate splitting communication network system.

[0031] The technical scheme proposes an optimization method for a wireless energy-carrying rate-splitting communication network assisted by a dual IRS, combines the dual IRS with a wireless energy-carrying system based on rate splitting, establishes a wireless energy-carrying rate-splitting communication network system assisted by a dual IRS, and further deepens the consideration of maximizing the communication rate of the minimum user, thereby achieving the maximization of the user communication rate and taking fairness into consideration under the user energy collection requirements; because the deployment strategy of the dual IRS is adopted, in some complex communication scenarios, it is possible to utilize the reflections between smart reflective surfaces, between smart reflective surfaces and wireless access points, and between users to form a propagation link with less obstruction and less loss, thereby achieving a higher communication rate under limited available resources, improving the utilization rate of communication resources and the communication coverage; the application of the rate splitting multiple access strategy in a multi-user wireless energy-carrying system has better performance than other strategies, and the technical scheme is applicable to any number of users and any energy collection requirements, and takes into account the communication fairness among multiple users, so the design of the present invention has practical applicability and flexibility, and is applicable to a variety of communication application scenarios.

[0032] Example 2

[0033] Based on Example 1, the original question P1 in step S2 of this embodiment is:

[0034]

[0035]

[0036]

[0037]

[0038]

[0039]

[0040]

[0041]

[0042] In order to achieve rate splitting at the wireless access point, the uncoded information to be sent needs to be split, that is, the uncoded information u planned to be sent to user k is k will be divided into the public part u ck and the private part u pk The public part of the uncoded information of all users is packaged into a super public information. After the actual achievable super public information rate is obtained, the rate splitting is performed at the AP to split the super public information rate into K parts of public information rate, where the public information rate allocated to the kth user is ck ; There are K users in the communication network system, w c , {w k} is the beamforming vector transmitted by the wireless access point, {c k} refers to the set {c1,c2,…,c K}, which means the public information rate set of all users in the communication system, {ρ k} refers to the set {ρ1,ρ2,…,ρ K}, which means the power division coefficient set of all users in the communication system, Φ1 is the reflection phase shift matrix of IRS1, and Φ2 is the reflection phase shift matrix of IRS2; is the super public information rate that can be achieved by the kth user. The first constraint (12) indicates that all users can successfully decode the super public information and the RSMA mechanism can work properly. The second constraint (13) indicates that the rate split value allocated to each user should be a non-zero value that conforms to actual physics. The third constraint (14) indicates that the energy collected by each user should not be less than γ k The fourth constraint (15) indicates that the power division coefficient should conform to the actual energy conservation situation. The fifth constraint (16) and the sixth constraint (17) are the actual adjustable phase ranges of each reflector unit on IRS1 and IRS2 respectively. The seventh constraint (18) indicates that the maximum transmit power actually available to the wireless access point is P. max .

[0043] Step S3 simplifies the original problem P1 into several sub-problems as follows:

[0044] S31, introduce the slack variable t to transform the first objective function (11) of the original problem P1 into an equivalent and continuously differentiable concave function, and obtain the equivalent original problem P2:

[0045]

[0046]

[0047] The first constraint (12) to the seventh constraint (18);

[0048] S32, simplify the equivalent original problem P2 into four sub-problems, namely:

[0049] The first sub-problem P2.1: Given {ρ k}, Φ1 and Φ2, optimize w c , {w k} and {c k};

[0050] Second sub-problem P2.2: Given W, {c k}, Φ1 and Φ2, optimize {ρ k};

[0051] The third sub-problem P2.3: Given W, {c k}、{ρ k} and Φ2, optimize Φ1;

[0052] Fourth sub-problem P2.4: Given W, {c k}、{ρ k} and Φ1, optimize Φ2.

[0053] The first sub-problem P2.1 is:

[0054]

[0055]

[0056]

[0057]

[0058]

[0059]

[0060] in, is the private information rate of the communication network system; the private information rate refers to the rate of private information obtained by the wireless user after removing the super public information from the received information;

[0061] The third sub-problem P2.3 is:

[0062]

[0063]

[0064]

[0065]

[0066]

[0067] in, represents the phase of the m1th reflection unit of IRS1;

[0068] The fourth sub-problem P2.4 is:

[0069]

[0070]

[0071]

[0072]

[0073]

[0074] in, Represents the phase of the m2th reflection unit of IRS2.

[0075] The first sub-problem P2.1 is convexly optimized, and the first sub-problem P3.1 after convex optimization is obtained as follows:

[0076]

[0077]

[0078]

[0079]

[0080]

[0081]

[0082] rank(W m )=1,m∈{c,1,...,k,...,K} (47)

[0083] It means that every element in the set W is a semi-positive definite matrix, that is The eighteenth constraint (47) indicates that After deformation, W m The rank-one constraint, G k is a mixed channel; in the first subproblem P2.1, only the eighteenth constraint (47) is a non-convex constraint, and the eighteenth constraint (47) is removed to approximate the solution. Therefore, the first subproblem P2.1 is about W, {c k The joint convex optimization problem of} and t is solved by the interior point method; after obtaining the optimal solution of W, the standard Gaussian random method is used to restore the W matrix to the w vector.

[0084] The third subproblem P2.3 is convexly optimized, and the third subproblem P3.3 after convex optimization is obtained as follows:

[0085]

[0086]

[0087]

[0088]

[0089]

[0090]

[0091] express is a semi-positive definite matrix, the twenty-seventh constraint (76) means that The rank-one constraint on S1 after deformation; in the third subproblem P2.3, only the twenty-seventh constraint (76) is a non-convex constraint, so the twenty-seventh constraint (76) is removed to approximate the solution. Therefore, the third subproblem P2.3 is a joint convex optimization problem about S1 and t, and the interior point method is used to solve it; after obtaining the optimal solution of S1, the standard Gaussian random method is used to restore the S1 matrix to the s1 vector, and v1 is further extracted from s1 to obtain the optimized phase matrix Φ1.

[0092] Convex optimization is performed on the fourth sub-problem P2.4, and the fourth sub-problem P3.4 after convex optimization is obtained as follows:

[0093]

[0094]

[0095]

[0096]

[0097]

[0098]

[0099] express is a semi-positive definite matrix. The 36th constraint (96) indicates that The rank-one constraint on S2 after deformation; in the fourth subproblem P2.4, only the thirty-sixth constraint (96) is a non-convex constraint, so the thirty-sixth constraint (96) is removed to approximate the solution. Therefore, the fourth subproblem P2.4 is a joint convex optimization problem about S2 and t, and the interior point method is used to solve it; after obtaining the optimal solution of S2, the standard Gaussian random method is applied to restore the S2 matrix to the s2 vector, and v2 is further extracted from s2 to obtain the optimized phase matrix Φ2.

[0100] For the second sub-problem P2.2, a closed-form solution is obtained according to the communication network system optimization objective described in step S2 and the third constraint (14). Only when the closed-form solution holds, ρ k The optimal solution will be obtained. The expression of the closed-form solution is:

[0101]

[0102] The alternating optimization method described in step S4 specifically comprises the following steps:

[0103] S41, Initialization Set the alternating optimization objective function Iteration number n = 0, threshold ε0 = 1 × 10 -3 ;

[0104] S41, given By solving the first subproblem P3.1 after convex optimization, we obtain

[0105] S42, given The closed-form solution is obtained

[0106] S43, given By solving the third subproblem P3.3 after convex optimization, we obtain

[0107] S44, given By solving the fourth subproblem P3.4 after convex optimization, we obtain

[0108] S45, let n=n+1;

[0109] S46, when , the minimum rate among K users can be maximized, otherwise, the process returns to steps S42-S46.

[0110] Example 3

[0111] Based on Example 2, a dual IRS-assisted wireless energy carrying rate split communication network system, such as Figure 2 As shown, the wireless energy carrying rate split communication network system includes: IRS1, IRS2, a wireless access point (Access point, AP) and K (K>1) wireless users. The wireless access point transmits information and energy to the wireless users. IRS1 and IRS2 are used to assist in improving the efficiency of information and energy transmission. Furthermore, this embodiment considers that the AP is equipped with N T (N T >1) transmitting antennas, the wireless user is equipped with only one antenna, IRS1 has M1 reflection units, and IRS2 has M2 reflection units. In this embodiment, the channel between AP and IRS1 is defined as The channel between AP and IRS2 is The channel between AP and user k is The channel between IRS1 and IRS2 is The channel between IRS1 and user k is The channel from IRS2 to user k is Here represents a set of x×y dimensional complex valued matrices. In order to describe the performance limit of the model, all the above channel state information is known.

[0112] The reflection phase shift matrix of IRS1 can be expressed as (X H represents the conjugate transpose of the matrix X), where Here and denote the amplitude and phase of the m1th reflection unit, respectively, where m1∈{1,...,M1}. In order to achieve the maximum reflection power gain, let therefore satisfy Similarly, the reflection phase shift matrix of IRS2 can be expressed as in Here and denote the amplitude and phase of the m2th reflection unit, respectively, m2∈{1,...,M2}. Similarly, in order to achieve the maximum reflection power gain, let therefore satisfy

[0113] In order to achieve rate splitting (RS) at the AP, the uncoded information to be sent needs to be split, that is, the uncoded information u planned to be sent to user k is k Will be divided into two parts, namely the public part u ck and the private part u pk , the public parts of all users’ uncoded information are packaged into a super public information u c =(u c1 ,...,u cK ). When performing linear precoding, the super public information u c Encoded into a public symbol stream The private part u of each user pk Encoded separately into a private symbol stream Without loss of generality, we can let E[|s c | 2 ]=1 and E[|s pk | 2 ]=1, Therefore, the signal transmitted by the AP is expressed as in represents the private symbol stream s transmitted by AP to the kth user pk The corresponding beamforming vector, Represents the public symbol stream s transmitted by AP to all users c The corresponding beamforming vector.

[0114] Each user uses the power splitting method to harvest energy, that is, the receiver installed by the user divides the received signal into two parts, one for energy harvesting (EH) and the other for information decoding (ID). k represents the power splitting factor of user k performing power splitting, then the part of the signal received by user k that is actually used for information decoding is

[0115]

[0116] Here n k It means that the mean value received by the kth user is 0 and the variance is Each user needs to perform SIC once, that is, decode the super public information, extract the required public information from it, and then remove the super public information from the received information. In this way, when the user decodes the private information, there is no interference caused by the super public information, only interference caused by the private information of other users.

[0117] The signal-to-interference-noise ratio of the k-th user decoding super public information is expressed as:

[0118] When the kth user performs SIC to eliminate the influence of super public information, the signal-to-interference-noise ratio of the decoded private information is expressed as:

[0119] Therefore, the super public information rate that the kth user can achieve is

[0120] The achievable private information rate is

[0121] Because super public information needs to be decoded by all users, the achievable super public information rate in practical applications is limited by the minimum super public information rate that can be achieved among all K users, which is

[0122] After the actual achievable super public information rate is obtained, rate splitting is performed at the AP to split the super public information rate into K public information rates, where the public information rate allocated to the kth user is c k , a total of Therefore, the information communication rate that the kth user can actually achieve during the entire communication process is

[0123] Considering that the energy collection model at the user end is a linear model, the energy received by the kth user is:

[0124]

[0125] Here η k ∈(0,1] represents the energy harvesting efficiency of the kth user.

[0126] By jointly optimizing the beamforming vector w transmitted by the AP in the above system c , {w k}, public information rate {c k}, power division factor {ρ k}, the reflection phase shift matrix Φ1 of IRS1, the reflection phase shift matrix Φ2 of IRS2 to maximize the communication rate of the smallest user in the system. Therefore, the above optimization scheme can be expressed as the original problem P1 described in Example 2;

[0127] The first objective function (11) of the original problem P1 indicates that the optimization goal is to ensure that the minimum communication rate among all users can be maximized and to maximize the fairness of communication between users. c , {w k}、{c k}、{ρ k}, Φ1, Φ2 are coupled to each other, and the first objective function (11) of the original problem P1 is obviously a non-concave function. In addition, due to the existence of the non-convex constraints: the first constraint (12) and the third constraint (14), the original problem P1 is not a convex problem, and is therefore difficult to solve. Before dealing with the variable coupling problem, a slack variable t is first introduced to convert the first objective function (11) of the original problem P1 into an equivalent and continuously differentiable concave function, thereby obtaining the equivalent original problem P2 described in Example 2.

[0128] Simplify the equivalent original problem P2 into four sub-problems for solution:

[0129] ① Given {ρ k}, Φ1 and Φ2, optimize w c , {w k} and {c k}

[0130] Given the optimization variable {ρ k}, Φ1 and Φ2, optimize w c , {w k The sub-problem of {ck} is the first sub-problem P2.1 of Example 2;

[0131] Next, the twelfth constraint (36) is transformed.

[0132] make Then the twelfth constraint (36) can be expressed as

[0133]

[0134] Next, the eleventh constraint (35) is transformed.

[0135] make Then there is

[0136]

[0137] Next, the eighth constraint (32) is modified.

[0138]

[0139]

[0140] Where W represents the set also

[0141]

[0142]

[0143] Then the eighth constraint (32) can be expressed as:

[0144]

[0145] because The left side of the inequality sign “≥” in the eighth constraint (32) should be a joint concave function according to the requirements of the convex constraint. Obviously, c k is an affine function, which is both a convex function and a concave function. F1(W) is a concave function about W, and F2(W) is a convex function about W. Therefore, the F2(W) function needs to be further processed. To this end, the continuous convex approximation method is used to solve the approximate solution that meets the eighth constraint (32) in an iterative manner. The lower bound of F2(W) is found by performing a first-order Taylor expansion on F2(W): as follows:

[0146]

[0147] in, Here W (t) represents the feasible point of the first-order Taylor expansion, and the superscript (t) represents the number of iterations of the optimization variable. Instead of F2(W), the eighth constraint (32) can be transformed into

[0148]

[0149] because is an affine function, so the above constraint is a convex constraint, and the solution W that satisfies the above constraint also satisfies the eighth constraint (32).

[0150] Next, the ninth constraint (33) is transformed.

[0151]

[0152]

[0153] in

[0154]

[0155] Then the ninth constraint (33) can be expressed as:

[0156]

[0157] Likewise, because The left side of the inequality sign “≥” in the ninth constraint (33) should be a joint concave function according to the requirements of the convex constraint, because F1(W) is a concave function about W, and F2(W) is a convex function about W, so the F2(W) function needs further processing. To this end, the continuous convex approximation method is also used to solve the approximate solution that meets the ninth constraint (33) through iteration. The lower bound of F4(W) is found by performing a first-order Taylor expansion on F4(W): as follows:

[0158]

[0159] in, Here W (t) represents the feasible point of the first-order Taylor expansion, and the superscript (t) represents the number of iterations of the optimization variable. Instead of F4(W), the ninth constraint (33) can be transformed into

[0160]

[0161] because is an affine function, so the above constraint is a convex constraint, and the solution W that satisfies the above constraint also satisfies the ninth constraint (33).

[0162] After the above convexification process, the first subproblem P2.1 can be transformed into the first subproblem P3.1 after convex optimization described in Example 2.

[0163] ② Given W, {c k}, Φ1 and Φ2, optimize {ρ k The sub-problem of} is the second sub-problem P2.2 of Example 2;

[0164] {ρ k The optimal solution of} can be obtained according to the optimization objective and the closed-form solution of the third constraint (14):

[0165]

[0166] This can be proved by contradiction. Taking the kth user as an example, if there is an optimal solution The third constraint (14) inequality is strictly established, that is, Then we can always find another feasible solution satisfy because and It is about ρ k is a strictly monotonically increasing function, so from the above assumptions we can know that From the thirty-seventh constraint (22) and the first constraint (12), we can know that the feasible solution is Able to achieve more feasible solutions A larger objective function value makes the communication rate of the smallest user in the system larger, so It is not the optimal solution to the problem, ρ k The optimal solution of must be the value that makes the third constraint (14) hold in the form of an equation, which is shown in formula (5). The proof is complete.

[0167] ③ Given W, {c k}、{ρ k} and Φ2, optimize Φ1

[0168] Given optimization variables W, {c k}、{ρ k} and Φ2, the sub-problem of optimizing Φ1 is the third sub-problem P2.3 described in Example 2;

[0169] Next, we transform the 21st constraint (64) into

[0170] First, the mixing channel can be reformulated as:

[0171]

[0172] in,

[0173]

[0174] Then the 21st constraint (64) can be written as:

[0175]

[0176] Among them are

[0177]

[0178]

[0179] in

[0180] The same can be said

[0181]

[0182] The 21st constraint (64) can therefore be rewritten as

[0183]

[0184] Next, the nineteenth constraint (62) is transformed into

[0185]

[0186] in

[0187]

[0188]

[0189] That is, the nineteenth constraint (62) can be expressed as

[0190]

[0191] Obviously D 1,k (S1) is a concave function with respect to S1 and D 2,k (S1) is a convex function with respect to S1, so in order to construct a convex constraint, the constraint needs to be further transformed.

[0192] Similarly, for D 2,k (S1) also uses the continuous convex approximation method to solve the approximate solution that meets the nineteenth constraint (62) through iteration. 2,k (S1) Perform a first-order Taylor expansion to find D 2,k The lower bound of (S1) as follows:

[0193]

[0194] in, Here represents the feasible point of the first-order Taylor expansion, and the superscript (t) represents the number of iterations of the optimization variable. Alternative D 2,k (S1), the nineteenth constraint (62) can be transformed into

[0195]

[0196] Due to D 1,k (S1) is a concave function and is an affine function, so the above constraint is a convex constraint, and the solution S1 that satisfies the above constraint also satisfies the nineteenth constraint (62).

[0197] Next, the twentieth constraint (63) is transformed.

[0198]

[0199] in

[0200]

[0201]

[0202] That is, the twentieth constraint (63) can be expressed as

[0203]

[0204] Obviously D 3,k (S1) is a concave function with respect to S1 and D 4,k (S1) is a convex function with respect to S1, so in order to construct a convex constraint, the constraint needs to be further transformed.

[0205] Similarly, for D 4,k (S1) also uses the continuous convex approximation method to solve the approximate solution that meets the twentieth constraint (63) through iteration. 4,k (S1) Perform a first-order Taylor expansion to find D 4,k The lower bound of (S1) as follows:

[0206]

[0207] in, Here represents the feasible point of the first-order Taylor expansion, and the superscript (t) represents the number of iterations of the optimization variable. Alternative D 4,k (S1), the twentieth constraint (63) can be transformed into

[0208]

[0209] Due to D 3,k (S1) is a concave function and is an affine function, so the above constraint is a convex constraint, and the solution S1 that satisfies the above constraint also satisfies the twentieth constraint (63).

[0210] Next, the twenty-second constraint (65) is transformed.

[0211] The 22nd constraint (65) indicates the adjustable range of the phase of each reflection unit on IRS1, which is given by It can be seen that the 22nd constraint (65) can be equivalently expressed as

[0212]

[0213] again Then the 22nd constraint (65) can be further equivalently expressed as

[0214]

[0215] It means that the value of all elements on the diagonal of matrix S1 is equal to the real number 1.

[0216] After the above convexification process, the convex optimization processing of the third sub-problem P2.3 is achieved, and the third sub-problem P3.3 after convex optimization of Example 2 is obtained.

[0217] ④ Given W, {c k}、{ρ k} and Φ1, optimize Φ2

[0218] Given W, {c k}、{ρ k} and Φ1, the process of optimizing Φ2 is mostly similar to the process of optimizing Φ1 in ③, so the differences will be emphasized here. The sub-problem of optimizing Φ2 is the fourth sub-problem P2.4 described in Example 2;

[0219] Next, the 30th constraint (84) is transformed

[0220] First, the mixing channel can be reformulated as:

[0221]

[0222] in,

[0223]

[0224] Then the 30th constraint (84) can be written as:

[0225]

[0226] Among them are

[0227]

[0228] in

[0229] The same can be said

[0230]

[0231]

[0232] The 30th constraint (84) can therefore be rewritten as

[0233]

[0234] Next, we transform the 28th constraint (82)

[0235]

[0236] in

[0237]

[0238]

[0239] That is, the 28th constraint (82) can be expressed as

[0240]

[0241] Obviously L 1,k (S2) is a concave function with respect to S2 and l 2,k (S2) is a convex function with respect to S2, so in order to construct a convex constraint, the constraint needs to be further transformed.

[0242] Similarly, for L 2,k (S2) also uses the continuous convex approximation method to iteratively solve the approximate solution that meets the twenty-eighth constraint (82). 2,k (S2) Perform a first-order Taylor expansion to find L 2,k The lower bound of (S2) as follows:

[0243]

[0244] in, Here represents the feasible point of the first-order Taylor expansion, and the superscript (t) represents the number of iterations of the optimization variable. Replace L2,k (S2), the twenty-eighth constraint (82) can be transformed into

[0245]

[0246] Due to L 1,k (S2) is a concave function and is an affine function, so the above constraint is a convex constraint, and the solution S2 that satisfies the above constraint also satisfies the twenty-eighth constraint (82).

[0247] Next, the twenty-ninth constraint (83) is transformed.

[0248]

[0249] in

[0250]

[0251]

[0252] That is, the twenty-ninth constraint (83) can be expressed as:

[0253]

[0254] Obviously L 3,k (S2) is a concave function with respect to S2 and L 4,k (S2) is a convex function with respect to S2, so in order to construct a convex constraint, the constraint needs to be further transformed.

[0255] Similarly, for L 4,k (S2) also uses the continuous convex approximation method to iteratively solve the approximate solution that meets the twenty-ninth constraint (83). 4,k (S2) Perform a first-order Taylor expansion to find L 4,k The lower bound of (S2) as follows:

[0256]

[0257] in, Here represents the feasible point of the first-order Taylor expansion, and the superscript (t) represents the number of iterations of the optimization variable. Replace L 4,k (S2), the twenty-ninth constraint (83) can be transformed into

[0258]

[0259] Due to L 3,k (S2) is a concave function and is an affine function, so the above constraint is a convex constraint, and the solution S2 that satisfies the above constraint also satisfies the twenty-ninth constraint (83).

[0260] Next, the thirty-first constraint (85) is transformed.

[0261] The thirty-first constraint (85) indicates the adjustable range of the phase of each reflection unit on IRS2, which is given by It can be seen that the thirty-first constraint (85) can be equivalently expressed as

[0262]

[0263] again Then the thirty-first constraint (85) can be further equivalently expressed as

[0264]

[0265] It means that the value of all elements on the diagonal of matrix S2 is equal to the real number 1.

[0266] After the above convexification process, the convex optimization processing of the fourth sub-problem P2.4 is achieved, and the fourth sub-problem P3.4 after convex optimization is obtained.

[0267] like Figure 3The figure shows the trend of the system minimum user rate achievable in each scheme as the AP transmit power increases. The following conclusions can be drawn from the figure. (1) From the overall curves, the system minimum user rate achievable by all schemes increases with the increase of AP transmit power, and the alternating optimization scheme proposed in the present invention, that is, the curve "alternating optimization", is higher than all other comparison schemes, which illustrates the superiority of the scheme proposed in the present invention and the effectiveness of the alternating optimization algorithm. (2) When the transmit power is relatively small, compared with the deployment of a single IRS, that is, the curve "only IRS1" and the curve "only IRS2", the performance improvement brought by the deployment of dual IRS is more significant. Although the improvement decreases with the increase of transmit power, it is still the optimal solution, which illustrates the superiority of the dual IRS deployment proposed in the present invention, and is particularly significant when the available resources are relatively small. (3) Although the curve "non-optimized power division coefficient" increases with the increase of transmission power and there is a dual IRS deployment, its performance is worse than that of the solution with two single IRS deployments, and the difference is increasing. This shows that the optimization algorithm proposed in the present invention can maximize the use of the limited resources of the system without causing resource waste through multi-variable and multi-angle optimization, thereby maximizing the minimum user rate of the system. (4) When the transmission power is small, the schemes applying the RSMA strategy, namely the curves "alternating optimization", "only IRS1", "only IRS2" and "no optimization of power division coefficient", are all greater than the schemes applying the NOMA strategy and the SDMA strategy. These two schemes also deploy dual IRS, as shown by the curves "non-orthogonal multiple access strategy NOMA" and "space division multiple access strategy SDMA", respectively. This shows the superiority of applying the RSMA strategy in the SWIPT system; and when the transmission power is large, the scheme applying the SDMA strategy will be able to exceed some schemes applying the RSMA strategy, but the achieved system minimum user rate is still smaller than that of the scheme proposed in the present invention. This not only shows the superiority of the alternating optimization scheme proposed in the present invention, but also shows that the deployment of dual IRS can provide more design space for improving the performance of various systems.

[0268] like Figure 4The figure shows the trend of the minimum user rate of the system that can be achieved in each scheme as the user's energy collection demand increases. The following conclusions can be drawn from the figure. (1) As the user's energy collection demand increases, the curve and the curve remain almost stable and unchanged. Because in the "non-optimized power division coefficient" scheme represented by the curve, in order to ensure that the system can cope with the various energy collection requirements that may appear in actual applications, the fixed power division coefficient is generally set to a relatively small value to ensure the normal operation of the system. Therefore, the energy actually collected by the user is always greater than the actual requirement, which will lead to a waste of resources to a certain extent, and thus lead to a stable change curve. In the "non-orthogonal multiple access strategy NOMA" scheme corresponding to the curve, the appearance of the stable curve is caused by the working mechanism of NOMA itself. Simply put, the energy actually collected by the user is always much greater than the actual requirement. Therefore, the increase in the user's energy collection demand will not lead to a significant change in the curve. (2) The curve "space division multiple access strategy SDMA" drops rapidly as the user's energy collection demand increases. This is because in the SWIPT system, when the user's energy collection demand increases, the resources that can actually be used for information transmission will become scarce, and the shortage of resources has a great impact on a SWIPT system based on the SDMA strategy, which leads to a rapid drop in the curve. This also reflects the superiority of the RSMA strategy from the side together with the NOMA strategy, and also reflects the importance of the SWIPT system based on the RSMA strategy considered in the present invention. (3) The three main schemes that apply the RSMA strategy, namely "alternating optimization", "only IRS1" and "only IRS2", although the minimum user rate that can be achieved in the system has decreased as the user's energy collection demand increases, they are still the three schemes with the highest rate when compared with all other schemes. Among them, the scheme of deploying dual IRS proposed in the present invention is always the best among all schemes, and the gap with the scheme of deploying single IRS also increases with the increase of user energy collection demand, which illustrates the superiority of deploying dual IRS proposed in the present invention.

[0269] like Figure 5The figure shows the trend of the change of the minimum system user rate that can be achieved in each scheme that applies the RSMA strategy as the number of IRS reflection units increases, where the number of reflection units of IRS1 and IRS2 is set to the same value, that is, M1=M2. As can be seen from the figure, the four schemes all increase with the increase of the number of reflection units, among which the curve "no optimization of power division coefficient" is the worst scheme. Although dual IRS is deployed, it is not as good as the other two single IRS schemes "only IRS1" and "only IRS2", which shows the importance of multi-variable joint optimization. The curve "alternating optimization" is the dual IRS auxiliary scheme proposed by the present invention, and considers the joint optimization of multiple key variables including the power division coefficient. It can be seen from the figure that the curve is the highest, and the gap with other schemes increases with the increase of the number of reflection units, which illustrates the feasibility of the dual IRS model considered by the present invention and the effectiveness of the submitted alternate optimization algorithm.

[0270] Obviously, the above embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the embodiments here. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the claims of the present invention.

Claims

1. Optimization method of wireless energy rate splitting communication network assisted by dual IRS, It is characterized in that The following steps are involved: S1. Establish a dual-IRS-assisted wireless energy-carrying rate splitting communication network system, the wireless energy-carrying rate splitting communication network system includes: IRS1, IRS2, a wireless access point and a number of wireless users, the wireless access point transmits information and energy to the wireless users, and IRS1 and IRS2 are used to assist in improving the efficiency of information and energy transmission; S2, determining the original problem P1 of the optimization target of the wireless energy carrying rate splitting communication network system, wherein the original problem P1 refers to maximizing the minimum user communication rate in the system under the condition that the system parameters of the wireless energy carrying rate splitting communication network system meet the preset initial constraints; S3, simplifying the original problem P1 into several sub-problems, each of which needs to satisfy corresponding sub-constraint conditions, performing convex optimization processing on all unsolvable sub-problems, so that all non-convex constraints of the sub-constraint conditions are converted into convex constraints, thereby converting all unsolvable sub-problems into solvable sub-problems; S4. Using an alternating optimization method to perform alternating iterations on all solvable sub-problems, and obtaining system parameters that maximize the minimum user communication rate in the system under the condition that the system parameters of the wireless energy carrying rate splitting communication network system meet the preset initial constraints; The minimum user in step S2 refers to the user with the minimum communication rate in the wireless energy-carrying rate splitting communication network system.

2. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 1, It is characterized in that The original problem P1 in step S2 is: In order to achieve rate splitting at the wireless access point, the uncoded information to be sent needs to be split, that is, the uncoded information u planned to be sent to user k is k will be divided into the public part u ck and the private part u pk The public part of all users' uncoded information is packaged into a super public information. After the actual achievable super public information rate is obtained, rate splitting is performed at the AP to split the super public information rate into K public information rates. is the private information rate of the communication network system, which refers to the rate of private information obtained by wireless users after removing super public information from received information; the public information rate allocated to the kth user is c k ; There are K users in the communication network system, w c Represents the public symbol stream s transmitted by AP to all users c The corresponding beamforming vector, w k represents the private symbol stream s transmitted by AP to the kth user pk The corresponding beamforming vector; {c k } refers to the set {c 1 ,c 2 ,…,c K }, which means the public information rate set of all users in the communication system, {ρ k } refers to the set {ρ 1 ,ρ 2 ,…,ρ K }, which means the power division coefficient set of all users in the communication system, Ф 1 is the reflection phase shift matrix of IRS1, Ф 2 is the reflection phase shift matrix of IRS2; is the super public information rate that can be achieved by the kth user. The first constraint (12) indicates that all users can successfully decode the super public information and the RSMA mechanism can work normally. The second constraint (13) indicates the public information rate c allocated to each user. k It should be a non-zero value that conforms to actual physics. The third constraint (14) represents the energy E collected by each user. k Should not be less than γ k , the fourth constraint (15) represents the power division factor ρ k It should be consistent with the actual energy conservation situation. The fifth constraint (16) and the sixth constraint (17) are the actual adjustable phase range of each reflection unit on IRS1 and IRS2, respectively. Indicates the mth 1 The seventh constraint (18) indicates that the maximum transmit power actually available to the wireless access point AP is P max , Indicates the mth 2 The phase of the reflection unit; M 1 、M 2 is the number of reflection units in IRS1 and IRS2.

3. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 2, It is characterized in that Step S3 simplifies the original problem P1 into several sub-problems as follows: S31, introduce the slack variable t to transform the first objective function (11) of the original problem P1 into an equivalent and continuously differentiable concave function, and obtain the equivalent original problem P2: The first constraint (12) to the seventh constraint (18); S32, simplify the equivalent original problem P2 into four sub-problems, namely: The first sub-problem P2.1: Given {ρ k }、φ 1 and φ 2 , optimize w c 、{w k } and {c k }; Second sub-problem P2.2: Given W, {c k }、Ф 1 and Φ 2 , optimize {ρ k }; The third sub-problem P2.3: Given W, {c k }、{ρ k } and Φ 2 , optimize Φ 1 ; Fourth sub-problem P2.4: Given W, {c k }、{ρ k } and Φ 1 , optimize Φ 2 ; Where W represents the set and 4. The optimization method of the dual IRS-assisted wireless energy carrying rate splitting communication network according to claim 3, It is characterized in that The first sub-problem P2.1 is: The third sub-problem P2.3 is: The fourth sub-problem P2.4 is:

5. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 4, It is characterized in that The first subproblem P2.1 is convexly optimized, and the first subproblem P3.1 after convex optimization is obtained as follows: rank(W m )=1,m∈{c,1,...,k,...,K} (47) Among them, F 1 (W) is a concave function with respect to W, F 2 (W) is a convex function with respect to W, To F 2 (W) Perform a first-order Taylor expansion to find F 2 The lower bound of (W); It means that every element in the set W is a semi-positive definite matrix, that is η k ∈(0,1] represents the energy collection efficiency of the kth user; the eighteenth constraint (47) represents the energy collection efficiency of the kth user. After deformation, W m The rank-one constraint, G k is a mixed channel; in the first subproblem P2.1, only the eighteenth constraint (47) is a non-convex constraint, and the eighteenth constraint (47) is removed to approximate the solution. Therefore, the first subproblem P2.1 is about W, {c k The joint convex optimization problem of} and t is solved by the interior point method; after obtaining the optimal solution of W, the standard Gaussian random method is used to restore the W matrix to the w vector.

6. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 5, It is characterized in that The third subproblem P2.3 is convexly optimized, and the third subproblem P3.3 after convex optimization is obtained as follows: in, express is a semi-positive definite matrix; D 1,k (S 1 ) is about S 1 The concave function D 2,k (S 1 ) is about S 1 The convex function of To D 2,k (S 1 ) Perform a first-order Taylor expansion to find D 2,k (S 1 ) is the lower bound of 3,k (S 1 ) is about S 1 The concave function D 4,k (S 1 ) is about S 1 The convex function of D 4,k (S 1 ) Perform a first-order Taylor expansion to find D 4,k (S 1 ) is the lower bound of; the twenty-seventh constraint (76) indicates that After deformation, S 1 rank-one constraint; in the third subproblem P2.3, only the 27th constraint (76) is a non-convex constraint, so the 27th constraint (76) is removed to approximate the solution. Therefore, the third subproblem P2.3 is about S 1 The joint convex optimization problem of and t is solved by the interior point method; S 1 After finding the optimal solution, the standard Gaussian random method is used to convert S 1 The matrix is ​​restored to s 1 vector, further from s 1 Extract v 1 , thus obtaining the optimized phase matrix Φ 1 ; in H ar1 is the channel between AP and IRS1, H ar2 is the channel between AP and IRS2, h ak is the channel between AP and user k, H rr is the channel between IRS1 and IRS2, h r1k is the channel between IRS1 and user k, h r2k is the channel between IRS2 and user k.

7. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 6, It is characterized in that Convex optimization is performed on the fourth sub-problem P2.4, and the fourth sub-problem P3.4 after convex optimization is obtained as follows: in, express is a semi-positive definite matrix; L 1,k (S 2 ) is about S 2 The concave function L 2,k (S 2 ) is about S 2 The convex function of To L 2,k (S 2 ) Perform a first-order Taylor expansion to find L 2,k (S 2 ) is the lower bound; L 3,k (S 2 ) is about S 2 The concave function L 4,k (S 2 ) is about S 2 The convex function of To L 4,k (S 2 ) Perform a first-order Taylor expansion to find L 4,k (S 2 ) is the lower bound of; the 36th constraint (96) indicates that After deformation, S 2 rank-one constraint; in the fourth subproblem P2.4, only the 36th constraint (96) is a non-convex constraint, so the 36th constraint (96) is removed to approximate the solution. Therefore, the fourth subproblem P2.4 is about S 2 The joint convex optimization problem of and t is solved by the interior point method; S 2 After finding the optimal solution, the standard Gaussian random method is used to convert S 2 The matrix is ​​restored to s 2 vector, further from s 2 Extract v 2 , thus obtaining the optimized phase matrix Φ 2 ; in 8. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 7, It is characterized in that For the second sub-problem P2.2, a closed-form solution is obtained according to the communication network system optimization objective described in step S2 and the third constraint (14). Only when the closed-form solution holds, ρ k Only then can the optimal solution be obtained.

9. The optimization method of the dual IRS-assisted wireless energy carrying rate splitting communication network according to claim 8, It is characterized in that The closed-form solution is expressed as:

10. The optimization method of the dual IRS-assisted wireless energy carrying rate split communication network according to claim 9, It is characterized in that The alternating optimization method described in step S4 specifically comprises the following steps: S41, Initialization Set the alternating optimization objective function Iteration number n = 0, threshold ε 0 =1×10 -3 ; S41, given By solving the first subproblem P3.1 after convex optimization, we obtain S42, given The closed-form solution is obtained S43, given By solving the third subproblem P3.3 after convex optimization, we obtain S44, given By solving the fourth subproblem P3.4 after convex optimization, we obtain S45, let n=n+1; S46, when , the minimum rate among K users can be maximized, otherwise, the process returns to steps S42-S46.