CN105634541A - Full-duplex simultaneous wireless information and power transfer method and nodes - Google Patents

Abstract

The present invention provides a full-duplex energy-carrying communication method and a node, the method comprising: the second transmitter of the second node sends the first signal to the first receiver of the first node, and simultaneously under the same frequency, the second node's The second receiver receives the second signal sent by the first transmitter of the first node, and the second node performs power allocation processing on energy corresponding to the second signal after the second receiver receives the second signal. In this process, both the first node and the second node have been working in full-duplex mode, that is, the signal is discovered and received in the same frequency band at the same time, and the second node receives the second signal after the second receiver receives the second signal The corresponding energy is processed for power allocation, and by combining CCFD technology with SWIPT technology, it can realize energy-carrying communication while improving spectrum utilization.

Description

Full-duplex energy-carrying communication method and node

technical field

The invention relates to communication technology, in particular to a full-duplex energy-carrying communication method and a node.

Background technique

In view of the scarcity of wireless spectrum resources, in order to improve the utilization of wireless spectrum, simultaneous co-frequency full duplex (Co-frequency Co-time Full Duplex, CCFD) has become one of the core technologies of wireless communication technology. In this communication mode, the nodes in the communication system use the same time and the same frequency to transmit and receive wireless signals at the same time, which improves the utilization rate of the wireless spectrum to a certain extent.

Wireless energy carrying communication specifically refers to the technology of wireless information and energy simultaneous transmission (Simultaneous Information and Power Transfer, SWIPT). In SWIPT technology, the nodes in the communication system can collect energy from radio frequency signals when the energy is limited, instead of simply relying on the energy supplied by the battery of the node. In this way, while ensuring normal communication, the communication quality is further improved.

However, the above-mentioned CCFD technology can only improve the spectrum utilization rate, but cannot realize the simultaneous transmission of wireless information and energy; while the SWIPT technology can only realize the simultaneous transmission of wireless information and energy, and cannot improve the spectrum utilization rate. Therefore, how to combine CCFD technology with SWIPT technology is an urgent problem to be solved in the industry.

Contents of the invention

The present invention provides a full-duplex energy-carrying communication method and a node. By combining the CCFD technology and the SWIPT technology, the energy-carrying communication can be realized while improving spectrum utilization.

In the first aspect, the embodiment of the present invention provides a full-duplex energy-carrying communication method, including:

The second transmitter of the second node sends the first signal to the first receiver of the first node; and, the second receiver of the second node receives the signal sent by the first transmitter of the first node at the same time and at the same frequency second signal;

The second node performs power allocation processing on energy corresponding to the second signal.

Optionally, the second node performs power allocation processing on energy corresponding to the second signal, including:

The second node divides the energy corresponding to the second signal into a first part of energy and a second part of energy;

The second node uses the first part of energy to decode information, and uses the second part of energy to collect energy.

Optionally, the size of the second part of energy is greater than the minimum value for charging the second node.

Optionally, the method also includes:

The second node cancels the interference of the first signal on the second signal.

Optionally, the second transmitter of the second node sending the first signal to the first receiver of the first node includes:

The second transmitter of the second node transmits the first signal to the first receiver of the first node within a transmit power threshold.

In a second aspect, an embodiment of the present invention provides a node, where the node is a second node, and the second node includes:

a second transmitter for sending the first signal to the first receiver of the first node;

The second receiver is configured to receive the second signal sent by the first transmitter of the first node at the same time and at the same frequency;

A power allocator, configured to perform power allocation processing on the energy corresponding to the second signal.

Optionally, the power divider is specifically configured to divide the energy corresponding to the second signal into a first part of energy and a second part of energy, use the first part of energy to decode information, and use the second part of energy For energy harvesting.

Optionally, the size of the second part of energy is greater than the minimum value for charging the second node.

Optionally, the node also includes:

A processor, configured to eliminate interference from the first signal to the second signal.

Optionally, the second transmitter is specifically configured to send the first signal to the first receiver of the first node within a transmit power threshold.

In the full-duplex energy-carrying communication method and node provided by the embodiments of the present invention, the second transmitter of the second node sends the first signal to the first receiver of the first node, and at the same time, the second receiver of the second node The receiver receives the second signal sent by the first transmitter of the first node, and the second node performs power allocation processing on the energy corresponding to the second signal after the second receiver receives the second signal. In this process, both the first node and the second node have been working in full-duplex mode, that is, the signal is discovered and received in the same frequency band at the same time, and the second node receives the second signal after the second receiver receives the second signal The corresponding energy is processed for power allocation, and by combining CCFD technology with SWIPT technology, it can realize energy-carrying communication while improving spectrum utilization.

Description of drawings

Fig. 1 is a schematic diagram of the system architecture applicable to the full-duplex energy-carrying communication method of the present invention;

FIG. 2 is a flowchart of a full-duplex energy-carrying communication method provided by an embodiment of the present invention;

FIG. 3 is a relationship diagram between MMSE and SNR optimized by using different algorithms during the optimization process of the full-duplex energy-carrying communication method provided by an embodiment of the present invention;

Fig. 4 is a diagram of the relationship between the MMSE obtained by using different algorithms and the number of iterations during the optimization process of the full-duplex energy-carrying communication method provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a node provided by an embodiment of the present invention;

Fig. 6 is a schematic structural diagram of a node provided by another embodiment of the present invention.

detailed description

FIG. 1 is a schematic diagram of a system architecture applicable to the full-duplex energy-carrying communication method of the present invention. As shown in Figure 1, the system architecture applicable to the full-duplex energy-carrying communication method of this embodiment includes: a first node and a second node that communicate in a point-to-point communication manner, and the first transmitter of the first node has N The second receiver has N receiving antennas; similarly, the second transmitter of the second node has N transmitting antennas, and the second receiver has N receiving antennas. Both the first node and the second node are working in a full-duplex mode, that is, sending and receiving signals in the same frequency band at the same time. Among them, H represents the channel, G represents the self-interference channel, n represents the additive white Gaussian noise, and s represents the signal flow.

Referring to Fig. 1 again, in the system framework applicable to the full-duplex energy-carrying communication method of the present embodiment, the second receiver of the second node has a power distribution (PowerSplitting, PS) module, which can control the second node of the second node The energy corresponding to the second signal received by the second receiver is subjected to power allocation processing. Next, on the basis of the system architecture, the full-duplex energy-carrying communication method of the present invention will be described in detail.

Specifically, refer to FIG. 2, which is a flowchart of a full-duplex energy-carrying communication method provided by an embodiment of the present invention, including:

101. The second transmitter of the second node sends a first signal to the first receiver of the first node; and, the second receiver of the second node simultaneously receives the first transmitter of the first node at the same frequency The second signal sent.

In this step, both the first node and the second node are working in full-duplex mode, that is, they discover and receive signals in the same frequency band at the same time. Specifically, the second transmitter of the second node sends the first signal to the first receiver of the first node, and at the same time, under the same frequency, the second receiver of the second node receives the first signal sent by the first transmitter of the first node. Two signals.

102. The second node performs power allocation processing on energy corresponding to the second signal.

In this step, after the second receiver receives the second signal, the second node performs power allocation processing on the energy corresponding to the second signal.

In the full-duplex energy-carrying communication method provided by the embodiment of the present invention, the second transmitter of the second node sends the first signal to the first receiver of the first node, and at the same time, under the same frequency, the second receiver of the second node receives For the second signal sent by the first transmitter of the first node, the second node performs power allocation processing on energy corresponding to the second signal after the second receiver receives the second signal. In this process, both the first node and the second node have been working in full-duplex mode, that is, the signal is discovered and received in the same frequency band at the same time, and the second node receives the second signal after the second receiver receives the second signal The corresponding energy is processed for power allocation, and by combining CCFD technology with SWIPT technology, it can realize energy-carrying communication while improving spectrum utilization.

Optionally, in an embodiment of the present invention, the second node performs power allocation processing on the energy corresponding to the second signal, including: the second node divides the energy corresponding to the second signal into the first A part of energy and a second part of energy; the second node uses the first part of energy to decode information, and uses the second part of energy to collect energy.

Specifically, the PS module of the second node allocates the energy corresponding to the second signal received by the second receiver, assuming β∈(0,1), the first part of energy is β times the energy corresponding to the second signal, The energy of the second part is 1-β times of the energy corresponding to the second signal.

Optionally, in an embodiment of the present invention, the second node eliminates interference from the first signal to the second signal.

Referring to Fig. 1 again, H ₁ is the channel through which the first transmitter of the first node transmits the second signal to the second receiver of the second node, and H ₂ is the channel for the second transmitter of the second node to the second receiver of the first node A channel on which the receiver transmits the first signal. Wherein, H ₁ and H ₂ are, for example, Gaussian random channels, and the channel information is known. G ₁ is the self-interference channel generated when the first node performs full-duplex communication, and G ₂ is the self-interference channel generated when the second node performs full-duplex communication. G ₁ and G ₂ have an impact on communication quality, and they need to be Eliminate. The channel formula is as follows:

${\mathrm{<span\; class="notranslate">\; G</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; G</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&Delta;G</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

In formula (1), Represents the estimated channel, G _i represents the real channel, ΔG _i is the estimation error caused by channel estimation, its mean value is 0, and its variance is

Please refer to Fig. 1 again, n _i represents additive white Gaussian noise (AdditiveWhiteGaussianNoise, AWGN), and its covariance matrix is in, Represents the variance of additive Gaussian white noise n _i , and I _N represents an N-dimensional identity matrix. It can be seen that the first node is node 1, the second node is node 2, and the signal received by node i∈{1, 2} can be expressed as:

${\stackrel{<span\; class="notranslate">\; ^</span>}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; G</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span>$

Assuming that the first signal and the second signal are single-stream data, then s _i ∈ C ^N×1 , F _i ∈ C ^N×N represent the beamforming transmission matrix normalized by complex signal power, which is the main optimization in the simulation process one of the goals. In formula (2), i≠j, that is, j=2 when i=1, and j=1 when i=2. Please refer to FIG. 1 again, since the first node does not have a PS device. Therefore, the first node only performs information decoding, and the second node also performs energy collection while performing information decoding. So for the first node:

${\stackrel{<span\; class="notranslate">\; ^</span>}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; G</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 3</span>}<span\; class="notranslate">\; )</span>$

Combined with formula (1), to eliminate the interference caused by full-duplex communication, that is, the interference of the second signal to the first signal, we can get:

${\stackrel{<span\; class="notranslate">\; ^</span>}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; G</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; -</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; G</span>}}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 4</span>}<span\; class="notranslate">\; )</span>$

make $Z_1=G_1{f}_1{\mathrm{the\; s}}_1-{\stackrel{\&OverBar;}{G}}_1{f}_1{\mathrm{the\; s}}_1={\mathrm{\&Delta;G}}_1{f}_1{\mathrm{the\; s}}_1,$ Then according to the formula (4), we can get:

${\stackrel{<span\; class="notranslate">\; ^</span>}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 5</span>}<span\; class="notranslate">\; )</span>$

For the second node, the information of the second node is decoded:

${\mathrm{<span\; class="notranslate">\; the\; y</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; =</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; G</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; -</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; G</span>}}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 6</span>}<span\; class="notranslate">\; )</span>$

In the same way, make $z_2=G_2{f}_2{\mathrm{the\; s}}_2-{\stackrel{\&OverBar;}{G}}_2{f}_2{\mathrm{the\; s}}_2={\mathrm{\&Delta;G}}_2{f}_2{\mathrm{the\; s}}_2,$ Then according to the formula (6), we can get:

${\mathrm{<span\; class="notranslate">\; the\; y</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; =</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 7</span>}<span\; class="notranslate">\; )</span>$

Capability collection of the second node:

$\begin{array}{c}\mathrm{<span\; class="notranslate">\; E.</span>}\mathrm{<span\; class="notranslate">\; h</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; |</span><span\; class="notranslate">\; |</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; |</span>{<span\; class="notranslate">\; |</span>}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\\ <span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}<span\; class="notranslate">\; )</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span>\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 8</span>}<span\; class="notranslate">\; )</span>$

In formula (8), Indicates the conjugate transpose of F _1. After the second signal is distributed through the power divider, the energy corresponding to the second signal is 1-β times the energy, that is, the second part of the energy is used for energy collection. It should be noted that the above energy harvesting process only considers the second signal sent by the first transmitter of the first node. However, in essence, the second node also uses full-duplex mode communication, and part of the second signal sent by the second transmitter A signal is also collected, the above does not consider the first signal collected in energy harvesting.

Next, optimize the above-mentioned full-duplex power-carrying communication method. Specifically, in this embodiment, a minimum mean square error (Minimizing Mean-Square-Error criterion, MMSE) is used to optimize the foregoing full-duplex energy-carrying communication method.

Specifically, assuming that the MMSE of the first node is J ₁ and the MMSE of the second node is J ₂ , then:

$\begin{array}{c}{\mathrm{<span\; class="notranslate">\; J</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; \{</span><span\; class="notranslate">\; |</span><span\; class="notranslate">\; |</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; |</span>{<span\; class="notranslate">\; |</span>}^{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; \{</span><span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&rsqb;</span>{<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&rsqb;</span>}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; S</span>}\\ <span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; e</span>}\mathrm{<span\; class="notranslate">\; r</span>}\mathrm{<span\; class="notranslate">\; r</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; S</span>}\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 9</span>}<span\; class="notranslate">\; )</span>$

$\begin{array}{c}{\mathrm{<span\; class="notranslate">\; J</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; \{</span><span\; class="notranslate">\; |</span><span\; class="notranslate">\; |</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; |</span>{<span\; class="notranslate">\; |</span>}^{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; \{</span><span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&lsqb;</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; \&rsqb;</span>{<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&lsqb;</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; \&rsqb;</span>}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>\\ <span\; class="notranslate">\; -</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; -</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; S</span>}\\ <span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; e</span>}\mathrm{<span\; class="notranslate">\; r</span>}\mathrm{<span\; class="notranslate">\; r</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span>\\ <span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; -</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; -</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; S</span>}\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 10</span>}<span\; class="notranslate">\; )</span>$

In the above formula (9) and formula (10), W ₁ and W ₂ represent the signal receiving matrices of the first node and the second node respectively, and S represents the number of data streams of the transmitted signal. It can be seen that, when the sum of the MMSE of the first node and the MMSE of the second node is the smallest, the communication quality of the above-mentioned full-duplex power-carrying communication method is optimal.

In addition, the following constraints also need to be considered:

First, transmit power constraints.

In an embodiment of the present invention, the second transmitter of the second node sends the first signal to the first receiver of the first node within a transmit power threshold.

Theoretically, to minimize the MMSE, the higher the transmission power, the better. However, considering the cost of communication on the one hand, too much transmission power will bring a huge energy burden; on the other hand, if the transmission power is too high, the radiation generated during the communication process will cause greater harm to the human body. Therefore, the transmit power of the first node and the second node needs to meet a certain transmit power threshold, that is, it cannot exceed the maximum limit of their transmit power. Assume that the transmit power threshold of the first node is p ₁ , and the transmit power threshold of the second node is p ₂ . therefore:

$\begin{array}{c}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&le;</span>{\mathrm{<span\; class="notranslate">\; p</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\\ \mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&le;</span>{\mathrm{<span\; class="notranslate">\; p</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 11</span>}<span\; class="notranslate">\; )</span>$

Second, the constraints of the second part of the energy.

The system architecture applicable to the full-duplex energy-carrying communication method described in the embodiment of the present invention has the following characteristics: first, the first node and the second node adopt a full-duplex communication mode; second, full-duplex and wireless energy-carrying Combination of communication. Therefore, in order to enable the first node to charge the second node while sending the first signal, the power allocator of the second node allocates the energy corresponding to the second signal received by the second receiver with The second part of energy for energy collection must meet the minimum value for charging the second node, the minimum value is e for example. Therefore:

$<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}<span\; class="notranslate">\; )</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; \&Greater\; Equal;</span>\mathrm{<span\; class="notranslate">\; e</span>}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 12</span>}<span\; class="notranslate">\; )</span>$

Based on the above, it can be seen that in the process of optimizing the full-duplex energy-carrying communication method described above, the problems that need to be optimized are:

$\begin{array}{c}\begin{array}{cc}& \underset{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}{\mathrm{<span\; class="notranslate">\; min</span>}}{\mathrm{<span\; class="notranslate">\; J</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; J</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\\ \mathrm{<span\; class="notranslate">\; the\; s</span>}<span\; class="notranslate">\; .</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; .</span>& \mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&le;</span>{\mathrm{<span\; class="notranslate">\; p</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\\ & \mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&le;</span>{\mathrm{<span\; class="notranslate">\; p</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\end{array}\\ <span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}<span\; class="notranslate">\; )</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; \&Greater\; Equal;</span>\mathrm{<span\; class="notranslate">\; e</span>}\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 13</span>}<span\; class="notranslate">\; )</span>$

In formula (13), F _i and W _i are optimization variables, which represent the signal transmitting matrix and signal receiving matrix of the node. J ₁ +J ₂ is the optimization target, For constraint one, For the second constraint, is the third constraint.

Since the problem to be optimized in formula (13) is non-convex. Therefore, an iterative algorithm is introduced to split the problem to be optimized in formula (13) into three sub-problems:

Sub-problem 1. Determine the signal receiving matrix W _i of the first node and the second node.

Specifically, the signal transmission matrix F _i of the first node and the second node is fixed, and the Lagrangian is applied so that $\frac{\&part;J_i}{\&part;W_i^{*}}=0.$ Therefore:

$\begin{array}{c}{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; o</span>}\mathrm{<span\; class="notranslate">\; p</span>}\mathrm{<span\; class="notranslate">\; t</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; \&Delta;G</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; \&Delta;G</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span>{\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; N</span>}}<span\; class="notranslate">\; )</span>}^{<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}\\ {\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; o</span>}\mathrm{<span\; class="notranslate">\; p</span>}\mathrm{<span\; class="notranslate">\; t</span>}}<span\; class="notranslate">\; =</span>\sqrt{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; \&beta;H</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; h</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; \&beta;</span>}\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; \&lsqb;</span>{\mathrm{<span\; class="notranslate">\; \&Delta;G</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; \&Delta;G</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}<span\; class="notranslate">\; \&rsqb;</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span>{\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; N</span>}}<span\; class="notranslate">\; )</span>}^{<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 14</span>}<span\; class="notranslate">\; )</span>$

Substitute formula (14) into formulas (9), (10) to get:

$\mathrm{<span\; class="notranslate">\; T</span>}\mathrm{<span\; class="notranslate">\; r</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; A</span>}\mathrm{<span\; class="notranslate">\; B</span>}\mathrm{<span\; class="notranslate">\; C</span>}\mathrm{<span\; class="notranslate">\; D.</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; v</span>}\mathrm{<span\; class="notranslate">\; e</span>}\mathrm{<span\; class="notranslate">\; c</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; D.</span>}}^{\mathrm{<span\; class="notranslate">\; T</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span>}^{\mathrm{<span\; class="notranslate">\; T</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; C</span>}}^{\mathrm{<span\; class="notranslate">\; T</span>}}<span\; class="notranslate">\; \&CircleTimes;</span>\mathrm{<span\; class="notranslate">\; A</span>}<span\; class="notranslate">\; )</span>\mathrm{<span\; class="notranslate">\; v</span>}\mathrm{<span\; class="notranslate">\; e</span>}\mathrm{<span\; class="notranslate">\; c</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; B</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 15</span>}<span\; class="notranslate">\; )</span>$

According to formula (15), we can get:

$\begin{array}{c}\underset{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}{\mathrm{<span\; class="notranslate">\; min</span>}}\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; 2</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; 0</span>}\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; q</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; q</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\\ \begin{array}{cc}\mathrm{<span\; class="notranslate">\; the\; s</span>}<span\; class="notranslate">\; .</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; .</span>& {\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; \&le;</span>{\mathrm{<span\; class="notranslate">\; p</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\\ & {\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \&le;</span>{\mathrm{<span\; class="notranslate">\; p</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\\ & {\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; \&Greater\; Equal;</span>\mathrm{<span\; class="notranslate">\; e</span>}\end{array}\end{array}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 16</span>}<span\; class="notranslate">\; )</span>$

In the above formula (16), f _i =vec(F _i ), $Q_1=I_N\&CircleTimes;\left({\mathrm{\&beta;H}}_1^h{W}_2^h{W}_2{h}_1\right),Q_2=I_N\&CircleTimes;\left(h_2^h{W}_1^h{W}_1{h}_2\right),$ P _0i =Q _i +w _i I _N , $q_1={\left(vec\right(\sqrt{\mathrm{\&beta;}}{h}_1^h{W}_2^h\left)\right)}^h,q_2={\left(vec\right(h_2^h{W}_1^h\left)\right)}^h,c_i={\mathrm{\&sigma;}}_{\mathrm{no}}^{2}Tr\left\{W_i{W}_i^h\right\}+N,$ c=c ₁ +c ₂ , $w_1={\mathrm{\&sigma;}}_{err}^{2}Tr\left\{W_1{W}_1^h\right\},w_2={\mathrm{\&sigma;}}_{err}^2\mathrm{\&beta;}Tr\left\{W_2{W}_2^h\right\},P_i=I_N\&CircleTimes;I_N,P_3=I_N\&CircleTimes;(1-\mathrm{\&beta;})h_1^h{h}_1.$

In this way, the above sub-problem 1 can be transformed into formula (16).

Sub-problem 2. Fix the signal receiving matrix W _i obtained from the solution in sub-problem 1, and fix the signal transmitting matrix F ₁ of the first node, and use Lagrange to determine the signal transmitting matrix F ₂ of the second node.

Sub-problem 3: fix W _i and F ₂ , and determine the signal transmission matrix F ₁ of the first node.

In the above process of optimizing formula (13), the following algorithms can be used for optimization: equal power algorithm, matlab toolkit solution (semi-definiterelaxation, SDR) algorithm, (successive convex approximation), (SCA) algorithm, suboptimal solution algorithm Sure.

Specifically, when using the above algorithm for optimization, the inequality constraints converted to Make the optimal solution set shrink. Substituting the transformed equation into Equation (16) Define a matrix U whose eigenvalues are all positive and whose eigenvectors are composed of P _{3 -τIN} . in, IN is an N-dimensional identity matrix. Let f ₁ =Ux, and put in constraints: x ^H U ^H (P ₃ -τI _N )Ux≥0. In this way, the optimization problem can be transformed into:

$\underset{\mathrm{<span\; class="notranslate">\; x</span>}}{\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; u</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; 01</span>}}\mathrm{<span\; class="notranslate">\; u</span>}\mathrm{<span\; class="notranslate">\; x</span>}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; x</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; u</span>}}^{\mathrm{<span\; class="notranslate">\; h</span>}}{\mathrm{<span\; class="notranslate">\; q</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; q</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\mathrm{<span\; class="notranslate">\; u</span>}\mathrm{<span\; class="notranslate">\; x</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 17</span>}<span\; class="notranslate">\; )</span>$

It can be solved by using the Lagrange algorithm, which greatly reduces the computational complexity.

Next, compare the optimization of formula (13) by the above four algorithms. Specifically, please refer to FIG. 3 and FIG. 4. FIG. 3 is a diagram of the relationship between MMSE and SNR optimized by using different algorithms during the optimization process of the full-duplex energy-carrying communication method provided by an embodiment of the present invention; FIG. In the optimization process of the full-duplex energy-carrying communication method provided by an embodiment, the relationship diagram between the MMSE obtained by using different algorithms and the number of iterations.

Please refer to FIG. 3 , the abscissa is the signal-to-noise ratio (SignalNoiseRatio, SNR), and the ordinate is the mean square error (Mean-Square-Errorcriterion, MSE). The curves in the figure include: 4 dashed lines and 4 solid lines, among which, with The curve of N=2, using equal power algorithm (Identity scheme); The curve of represents N=4, using equal power algorithm; The curve of represents N=2, adopts suboptimal algorithm (proposesuboptimalscheme); The curve indicates that N=4 and adopts the suboptimal algorithm; the curve with ○ indicates that N=2 and adopts the SDR algorithm (proposeSDR-basescheme); the curve with ● indicates that N=4 and adopts the SDR algorithm; the curve with △ indicates that N=2 , using the SCA algorithm (proposeSCA-basescheme); the curve with ▲ indicates that N=4, using the SCA algorithm. When the equal power algorithm is used for optimization, as long as each constraint condition is satisfied, no optimization is performed. According to the simulation results, it can be seen that the performance of the SDR algorithm is the best; the SCA algorithm is next, and there is little difference compared with the SDR algorithm; the performance of the sub-optimized algorithm is worse than that of the first two algorithms, but it is significantly better than the equal power algorithm.

Please refer to Figure 4, the abscissa is the number of iterations, and the ordinate is the MSE. The curves in the figure include: 4 dashed lines and 4 solid lines, among which, with The curve of means SNR=20, using equal power algorithm; The curve of means SNR=40, using equal power algorithm; The curve of means SNR=20, using equal power algorithm; The curve indicates SNR=40, using suboptimal algorithm; the curve with ○ indicates SNR=20, adopting SDR algorithm; the curve with ● indicates SNR=40, adopting SDR algorithm; the curve with △ indicates SNR=20, adopting SCA algorithm; The curve with ▲ indicates that SNR=40 and the SCA algorithm is used. It can be seen from the simulation results that the curve tends to converge through the iterative algorithm, which also ensures the correctness of the algorithm, and the convergence speed of the SCA algorithm is the fastest.

According to the above, it can be seen that the full-duplex energy-carrying communication method described in the embodiment of the present invention combines full-duplex with SWIPT, and since the entire optimization problem is non-convex, an iterative algorithm is introduced to make the problem locally convex; the introduction of low-complexity Compared with the existing algorithms in terms of performance, it greatly saves calculation time in terms of computational complexity.

FIG. 5 is a schematic structural diagram of a node provided by an embodiment of the present invention. The node provided in this embodiment is specifically a second node, which is a node embodiment corresponding to the embodiment in FIG. 2 of the present invention, and the specific implementation process is not repeated here. Specifically, the nodes provided in this embodiment include:

The second transmitter 11 is configured to send the first signal to the first receiver of the first node;

The second receiver 12 is configured to receive the second signal sent by the first transmitter of the first node at the same time and at the same frequency;

The power allocator 13 is configured to perform power allocation processing on the energy corresponding to the second signal.

In the second node provided by the example of the present invention, the second transmitter of the second node sends the first signal to the first receiver of the first node, and at the same time, under the same frequency, the second receiver of the second node receives the first signal of the first node A second signal sent by a transmitter, after the second receiver receives the second signal, the second node performs power allocation processing on energy corresponding to the second signal. In this process, both the first node and the second node have been working in full-duplex mode, that is, the signal is discovered and received in the same frequency band at the same time, and the second node receives the second signal after the second receiver receives the second signal The corresponding energy is processed for power allocation, and by combining CCFD technology with SWIPT technology, it can realize energy-carrying communication while improving spectrum utilization.

Optionally, in an embodiment of the present invention, the power splitter 13 is specifically configured to divide the energy corresponding to the second signal into a first part of energy and a second part of energy, and use the first part of energy for information Decoding, using the second part of energy to perform energy collection.

Optionally, in an embodiment of the present invention, the magnitude of the second part of energy is greater than a minimum value for charging the second node.

Fig. 6 is a schematic structural diagram of a node provided by another embodiment of the present invention. As shown in Fig. 6, the node described in this embodiment, on the basis of the structure shown in Fig. 5 above, further includes:

A processor 14, configured to eliminate interference from the first signal to the second signal.

Optionally, in an embodiment of the present invention, the second transmitter 11 is specifically configured to send the first signal to the first receiver of the first node within a transmit power threshold.

Those of ordinary skill in the art can understand that all or part of the steps for implementing the above method embodiments can be completed by program instructions and related hardware. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps including the above-mentioned method embodiments; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, rather than limiting them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: It is still possible to modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the technical solutions of the various embodiments of the present invention. scope.

Claims (10)

1. A full-duplex energy-carrying communication method is characterized by comprising the following steps of;

a second transmitter of the second node transmitting the first signal to a first receiver of the first node; and a second receiver of the second node receives a second signal sent by a first transmitter of the first node at the same time and at the same time;

and the second node performs power distribution processing on energy corresponding to the second signal.

2. The method of claim 1, wherein the second node performs power allocation processing on the energy corresponding to the second signal, and wherein the power allocation processing comprises:

the second node divides energy corresponding to the second signal into a first part of energy and a second part of energy;

and the second node decodes information by adopting the first part of energy and collects energy by adopting the second part of energy.

3. The method of claim 2, wherein the magnitude of the second portion of energy is greater than a minimum value for charging the second node.

4. The method of claim 1, further comprising:

the second node cancels interference of the first signal to the second signal.

5. The method according to any of claims 1 to 4, wherein the transmitting of the first signal by the second transmitter of the second node to the first receiver of the first node comprises:

a second transmitter of the second node transmits the first signal to a first receiver of the first node within a transmit power threshold.

6. A node, wherein the node is a second node, and wherein the second node comprises:

a second transmitter for transmitting the first signal to a first receiver of the first node;

a second receiver, configured to receive a second signal sent by the first transmitter of the first node at the same time by using the same frequency;

and the power divider is used for carrying out power distribution processing on the energy corresponding to the second signal.

7. The node of claim 6,

the power divider is specifically configured to divide energy corresponding to the second signal into a first part of energy and a second part of energy, perform information decoding using the first part of energy, and perform energy collection using the second part of energy.

8. The node of claim 7, wherein the magnitude of the second portion of energy is greater than a minimum value for charging the second node.

9. The node of claim 6, further comprising:

a processor configured to cancel interference of the first signal with the second signal.

10. The node according to any of claims 6 to 9,

the second transmitter is specifically configured to send the first signal to the first receiver of the first node within a transmit power threshold.