Method and device for generating pre-coded signal and related equipment

Abstract

The invention provides a precoding signal generation method and device and related equipment, and relates to the technical field of communication. According to the technical scheme, after a channel condition between a base station and a terminal is determined, multiple pieces of short packet data transmitted between the base station and the terminal are grouped; and performing minimum transmission rate calculation on the obtained N short packet data groups and M long packet data to obtain S transmission rates, calculating the S transmission rates according to a precoding algorithm, determining a transmitter matrix, completing coding of a to-be-coded signal according to the transmitter matrix, generating a precoding signal, and sending the precoding signal to the transmitter matrix. Therefore, the transmission condition of the short packet data is fully considered, and the resource utilization rate is improved in the pre-coding signal generation process.

Description

Technical Field

[0001] This application relates to the field of communication technology, specifically to a method, apparatus, and related equipment for generating precoded signals. Background Technology

[0002] Multiple Input Multiple Output (MIMO) is an important technology in communication systems. By suppressing interference between users, it can significantly increase system capacity without increasing bandwidth. It also improves spectrum utilization by utilizing spatial division multiple access, while increasing the signal-to-interference-plus-noise ratio at the user end and ensuring communication reliability.

[0003] In existing technologies, MIMO precoding is generally performed using deep reinforcement learning or nonlinear coding methods. However, neither of these methods takes into account the special transmission conditions of short packet services, resulting in low resource utilization during the generation of precoded signals. Summary of the Invention

[0004] This application provides a method, apparatus, and related equipment for generating precoded signals, which solves the problem of low resource utilization in the precoded signal generation process in the prior art.

[0005] To solve the above problems, this application is implemented as follows:

[0006] In a first aspect, embodiments of this application provide a method for generating a precoded signal, the method comprising:

[0007] Based on the channel conditions between the base station and the terminal, multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer.

[0008] Calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M. The M long packet data groups are the data transmitted between the base station and the terminal. The S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group. M is a positive integer, and S is a positive integer.

[0009] The transmitter matrix is ​​obtained by calculating the S transmission rates according to the precoding algorithm;

[0010] The signal to be encoded is encoded based on the transmitter matrix to generate a precoded signal.

[0011] Optionally, based on the channel conditions between the base station and the terminal, the multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups, including:

[0012] Determine the channel matrix corresponding to the signal between the base station and the terminal, and determine the detection matrix corresponding to the terminal, wherein the channel is used to transmit the short packet data or the long packet data;

[0013] Based on the channel matrix, calculate the channel noise between the base station and the terminal;

[0014] The channel conditions are generated based on the detection matrix and the channel noise.

[0015] Based on the channel conditions, the multiple short packet data are grouped to obtain N short packet data groups.

[0016] Optionally, the step of calculating the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates includes:

[0017] Determine the received signal, recovered signal, and signal-to-dryness ratio of the terminal corresponding to the first packet of data, wherein the first packet of data is any one of the N short packet data groups, or the first packet of data is any one of the M long packet data groups;

[0018] The initial transmission rate is determined based on the received signal, the recovered signal, and the signal-to-dryness ratio;

[0019] The initial transmission rate is updated based on constraints to obtain the transmission rate corresponding to the first packet data. The constraints include at least one of the following: the maximum transmission power of the base station and the upper limit of the bit error rate corresponding to the short packet data group.

[0020] Optionally, the step of calculating the S transmission rates according to the precoding algorithm to obtain the transmitter matrix includes:

[0021] Determine the transmission strategy between the base station and the terminal, and determine the precoding algorithm based on the transmission strategy;

[0022] When the transmission strategy indicates that the average value of multiple signal-to-interference-plus-noise ratios needs to be greater than or equal to the first signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a precoding algorithm based on minimum mean square error. The S transmission rates are calculated according to the precoding algorithm based on minimum mean square error to obtain the transmitter matrix.

[0023] When the transmission strategy indicates that the minimum of the plurality of signal-to-interference-plus-noise ratios needs to be greater than or equal to the second signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a binary search-based precoding algorithm, and the S transmission rates are calculated according to the binary search-based precoding algorithm to obtain the transmitter matrix.

[0024] Optionally, the step of calculating the transmitter matrix based on the S transmission rates using the precoding algorithm based on minimum mean square error includes:

[0025] If the communication performance of the base station is greater than or equal to a preset threshold, the precoding matrix and the mean square error of the terminal received signal are calculated based on the S transmission rates.

[0026] The first receiver matrix is ​​determined based on the mean square error.

[0027] A first optimization function is generated based on the precoding matrix, the first receiver matrix, and preset variables, wherein the preset variables are used to indicate the correspondence between the precoding matrix and the first receiver matrix;

[0028] The transmitter matrix is ​​obtained by solving the first optimization function.

[0029] Optionally, the step of calculating the S transmission rates according to the binary search-based precoding algorithm to obtain the transmitter matrix includes:

[0030] If the communication performance of the base station is less than a preset threshold, a precoding matrix is ​​calculated based on the S transmission rates;

[0031] The pre-acquired second receiver matrix is ​​normalized to obtain the target receiver matrix;

[0032] Singular value decomposition is performed on the channel between the base station and the terminal to obtain the singular value decomposition result, and the feature vector corresponding to the singular value decomposition result is determined.

[0033] A second optimization function is generated based on the singular value decomposition result, the eigenvector, the target receiver matrix, and the precoding matrix.

[0034] The transmitter matrix is ​​obtained by solving the second optimization function.

[0035] Secondly, embodiments of this application provide a precoded signal generation apparatus, the apparatus comprising:

[0036] The grouping module is used to group multiple short packet data transmitted between the base station and the terminal based on the channel conditions between the base station and the terminal to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer.

[0037] The first calculation module is used to calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M, the M long packet data groups are the data transmitted between the base station and the terminal, and the S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group, where M is a positive integer and S is a positive integer.

[0038] The second calculation module is used to calculate the S transmission rates according to the precoding algorithm to obtain the transmitter matrix;

[0039] The encoding module is used to encode the signal to be encoded based on the transmitter matrix to generate a pre-coded signal.

[0040] Thirdly, this application also provides an electronic device, including a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the method described in the first aspect above.

[0041] Fourthly, this application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the method described in the first aspect above.

[0042] Fifthly, this application also provides a computer program product, including computer instructions that, when executed by a processor, implement the steps of the method described in the first aspect above.

[0043] This application provides a method, apparatus, and related equipment for generating precoded signals, relating to the field of communication technology. The method includes: based on channel conditions between a base station and a terminal, grouping multiple short packet data transmitted between the base station and the terminal into N short packet data groups, each short packet data group including at least two short packet data items. The channel conditions include a target frame length, and the sum of the frame lengths corresponding to the at least two short packet data items in each short packet data group is less than or equal to the target frame length, where N is a positive integer; calculating the required transmission rate corresponding to the N short packet data groups and M long packet data items, obtaining... There are S transmission rates, where S is the sum of N and M. The M long packet data are the data transmitted between the base station and the terminal. The S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data. M is a positive integer, and S is a positive integer. The S transmission rates are calculated according to the precoding algorithm to obtain the transmitter matrix. The signal to be encoded is encoded based on the transmitter matrix to generate a precoded signal. The technical solution of this application, after determining the channel conditions between the base station and the terminal, groups the multiple short packet data transmitted between the base station and the terminal into groups, calculates the minimum transmission rate for the obtained N short packet data groups and M long packet data, thereby obtaining S transmission rates. Then, the S transmission rates are calculated according to the precoding algorithm to determine the transmitter matrix, and the encoding of the signal to be encoded is completed according to the transmitter matrix to generate the precoded signal. This fully considers the transmission situation of short packet data and improves resource utilization in the process of generating the precoded signal. Attached Figure Description

[0044] To more clearly illustrate the technical solution of this application, the drawings used in the description of this application will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0045] Figure 1 A flowchart illustrating a method for generating a precoded signal according to an embodiment of this application;

[0046] Figure 2 This is a schematic diagram of the data processing flow provided in the embodiments of this application;

[0047] Figure 3 A schematic diagram of frame length provided for an embodiment of this application;

[0048] Figure 4This is one of the schematic diagrams of the precoding algorithm provided in the embodiments of this application;

[0049] Figure 5 This is one of the schematic diagrams of the precoding algorithm provided in the embodiments of this application;

[0050] Figure 6 A schematic diagram of a precoded signal generation device provided in an embodiment of this application;

[0051] Figure 7 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0052] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0053] The terms "first," "second," etc., used in the embodiments of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to these processes, methods, products, or devices. Additionally, the use of "and / or" in this application indicates at least one of the connected objects, such as A and / or B and / or C, representing seven possibilities: including A alone, B alone, C alone, and the presence of both A and B, both B and C, both A and C, and the presence of A, B, and C.

[0054] See Figure 1 , Figure 1 This is a schematic flowchart illustrating the method for generating precoded signals provided in an embodiment of this application. Figure 1 As shown, the method for generating a precoded signal may include the following steps:

[0055] Step 101: Based on the channel conditions between the base station and the terminal, group the multiple short packet data transmitted between the base station and the terminal to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer.

[0056] In this embodiment, as Figure 2 As shown, Figure 2 This is a schematic diagram of the data processing flow in this embodiment. Specifically, the initial signal is modulated and then precoded (transmitter), transmitted through the channel to the equalizer (receiver) for demodulation, and then the recovered information is obtained. In this application, the precoding process performed by the transmitter is mainly described. Specifically, there are two variables that determine the precoding: beam direction and power allocation.

[0057] Data transmission between the base station and the terminal includes multiple short data packets and multiple long data packets. In this embodiment, the multiple short data packets are grouped according to the determined channel conditions. Specifically, a complete communication transmission system is used as an example for explanation, and its frame structure and other indicators should not be changed. In a downlink mobile communication system composed of long packet service users and short packet service users, B APs provide communication services to users, and the AP set is... Assume that any AP has N transmit antennas. t Assume the number of long packet users is K2, and the number of short packet users is U. These U users are divided into K1 groups based on channel state information and packet length. Each group has similar channel state information, and the sum of the short packet lengths in each group does not exceed the maximum packet length that a single RE can transmit. Let K = K1 + K2. A diagram illustrating short packet splicing and long / short frame lengths is shown below. Figure 3 As shown.

[0058] Assume the set of users with long and short packets is The number of receiving antennas for each user is N. r The system sends a single-stream signal s with normalized power to each user group k. k Let s = [s1, s2, ..., s K ] T Then there is

[0059]

[0060] Among them, I K This represents the K-order identity matrix.

[0061] This completes the grouping of multiple short packet data, resulting in N short packet data groups.

[0062] Step 102: Calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M. The M long packet data groups are the data transmitted between the base station and the terminal. The S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group. M is a positive integer and S is a positive integer.

[0063] In this embodiment, after determining N short data packets, the required transmission rates for the N short data packets and M long data packets are calculated respectively, resulting in S transmission rates, where S = N + M. It should be noted that the transmission rate is the minimum transmission rate corresponding to either the short data packets or the long data packets.

[0064] It should be noted that the transmission rate can be calculated using data such as received signal, recovered signal, and signal-to-dryness ratio. The specific calculation method will not be described in detail in this embodiment.

[0065] Step 103: Calculate the S transmission rates according to the precoding algorithm to obtain the transmitter matrix.

[0066] In this embodiment, the precoding algorithm can be determined based on the actual communication situation, such as the communication performance of the base station. When the base station's communication performance is good, a precoding algorithm based on minimum mean square error that can achieve the optimal solution for the system can be used. When the base station's communication performance is average, a precoding algorithm based on binary search, which has lower complexity and does not require a large amount of computational resources, can be used.

[0067] In this embodiment, the transmission rate is calculated based on the actual communication situation of the base station to obtain the transmitter matrix, thereby determining the precoding method.

[0068] Step 104: Encode the signal to be encoded based on the transmitter matrix to generate a precoded signal.

[0069] In this embodiment, the signal to be encoded is encoded according to the determined transmitter matrix to generate a precoded signal. It should be noted that the receiver matrix in this application is predetermined and can be a conventional receiver matrix. No specific limitation is made in this embodiment.

[0070] The technical solution of this application, after determining the channel conditions between the base station and the terminal, groups the multiple short packet data transmitted between the base station and the terminal into groups, calculates the minimum transmission rate for the obtained N short packet data groups and M long packet data, thereby obtaining S transmission rates. Then, the S transmission rates are calculated according to the precoding algorithm to determine the transmitter matrix, and the encoding of the signal to be encoded is completed according to the transmitter matrix to generate the precoded signal. This fully considers the transmission situation of short packet data and improves resource utilization in the process of generating the precoded signal.

[0071] In some feasible implementations, optionally, based on the channel conditions between the base station and the terminal, the multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups, including:

[0072] Determine the channel matrix corresponding to the signal between the base station and the terminal, and determine the detection matrix corresponding to the terminal, wherein the channel is used to transmit the short packet data or the long packet data;

[0073] Based on the channel matrix, calculate the channel noise between the base station and the terminal;

[0074] The channel conditions are generated based on the detection matrix and the channel noise.

[0075] Based on the channel conditions, the multiple short packet data are grouped to obtain N short packet data groups.

[0076] In this embodiment, the grouping of multiple short packets of data is completed by determining the channel conditions between the base station and the terminal. Specifically, when determining the channel conditions, the channel matrix between the base station and the terminal is first determined, and the channel noise is calculated based on the determined signal matrix. Finally, the channel conditions are generated based on the detection matrix and the channel noise.

[0077] For example, suppose the downlink precoding signal provided by the base station to user k is The channel matrix from the base station to user k is Pick This represents the channel noise received by user k at the receiving end. This noise follows an independent complex Gaussian distribution, i.e. The receiver detection matrix for user k is Received signal

[0078] Based on the determined signal conditions, multiple short packet data are grouped. The grouping algorithm can be K-means clustering, hierarchical clustering, DBSCAN clustering, or model clustering, and no specific limitation is made in this embodiment. This results in N short packet data groups. It should be noted that at least two short packets in each short packet data group are considered as a single unit, and the explanation is based on short packet data groups.

[0079] This application fully considers the current status of long packet transmission in the existing network and the characteristics of short packet services. In view of the situation where short packet service transmission fails to make full use of resource element (RE) resources, the algorithm proposed in this application can ensure that multiple finite block length (FBL) services can be transmitted on the same RE without making large-scale changes to the existing network structure. Through effective resource integration, time and frequency resources are greatly saved, which is conducive to improving spectrum utilization and enhancing the overall system efficiency.

[0080] Optionally, the step of calculating the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates includes:

[0081] Determine the received signal, recovered signal, and signal-to-dryness ratio of the terminal corresponding to the first packet of data, wherein the first packet of data is any one of the N short packet data groups, or the first packet of data is any one of the M long packet data groups;

[0082] The initial transmission rate is determined based on the received signal, the recovered signal, and the signal-to-dryness ratio;

[0083] The initial transmission rate is updated based on constraints to obtain the transmission rate corresponding to the first packet data. The constraints include at least one of the following: the maximum transmission power of the base station and the upper limit of the bit error rate corresponding to the short packet data group.

[0084] In this embodiment, the transmission rates corresponding to N short data packets and M long data packets are calculated respectively. Specifically, the initial transmission rate is determined based on the received signal, recovered signal, and signal-to-dryness ratio corresponding to the first data packet, and the initial transmission rate is updated according to preset conditions to obtain the transmission rate corresponding to the first data packet. The first data packet is any one of the M long data packets or any one of the N short data packets.

[0085] Specifically, user k receives the signal y k It can be represented as

[0086]

[0087] Recovery signal for user k for

[0088]

[0089] The signal-to-interference-plus-noise ratio (SIR) for user k is

[0090]

[0091] This application considers the problem of long and short packet transmission. For FBL rate, when this formula is used to calculate the rate of long packet service, a sufficiently large packet length N is required. k This significantly reduces the impact of the finite block length correction term in the FBL rate calculation; therefore, FBL can also be used to calculate the rate of long-packet services. The user k-rate is...

[0092]

[0093] The unit of the above formula is bit / s, where log2(·) is the logarithmic function to base 2, and Q... -1 (·) is the right-tail function of the standard normal distribution. The inverse function of ε, where e is the natural constant and ε is the inverse function of ε. k This represents the user's bit error rate. The optimization problem to maximize system performance and speed is as follows:

[0094]

[0095] Let's denote the above optimization problem as a proposition. Where r k θ represents the transmission rate requirement of short packet users. k This represents the upper limit of the bit error rate for short packet users, and P represents the maximum transmission power of the base station.

[0096] for For short data packets with a signal-to-interference-plus-noise ratio (SIR) greater than 0.6905, under given packet length and block error rate constraints, their FBL rate is a concave function of the SIR and also a monotonically increasing function of the SIR. Based on current mobile communication performance indicators and service standards, the SIR of existing mobile communication services exceeds 1. Therefore, in this application, it is generally considered that f... r (Γ) is an increasing function of Γ. According to Proposition 1, for constraint R... k ≥r k Γ can be used k ≥γ k Equivalent representation, for the case where multiple short packets are transmitted on the same RE, γ k The maximum value that satisfies the transmission needs of short-packet users on the same RE can be chosen. As for the constraint ε... k ≤θ kObservations show that, with other conditions remaining constant, the FBL rate is an increasing function of the user's maximum bit error rate. To maximize the system and rate, ε must hold. k =θ k Therefore, the user k rate can be written as

[0097]

[0098] The proof of proposition 1 is as follows:

[0099] Proof: Constructor

[0100]

[0101] Pick Since the transmission rate is non-negative in a physical sense, f must hold. r (Γ)≥0, therefore b satisfies

[0102]

[0103] Where ln(·) denotes the logarithmic function with the natural constant e as the base, and the logarithmic function f r (Γ), the first derivative of Γ is

[0104]

[0105] The second derivative with respect to Γ is

[0106]

[0107] When the second derivative is not positive, f r (Γ) is a concave function of Γ, and f r The first derivative of (Γ) is monotonically decreasing with respect to Γ, and the corresponding range of b is...

[0108]

[0109] If set b≤g r (Γ) is a set b≤h r A subset of (Γ), i.e.

[0110] b≤g r (Γ)≤h r (Γ)

[0111] For any physically existing data packet transmission process, its transmission rate f r (Γ) must be a concave function of Γ. According to g r (Γ)≤h r (Γ), solving for Γ gives Γ ≥ 0.6905. At this point, g r(Γ) is a monotonically increasing function of Γ, therefore b ≤ min{g r (Γ)}=g r (0.6905) = 0.6512, at this time, the function f r The first derivative of (Γ) with respect to Γ is always positive, therefore, f r (Γ) is an increasing function of Γ. Proof complete.

[0112] Optionally, the step of calculating the S transmission rates according to the precoding algorithm to obtain the transmitter matrix includes:

[0113] Determine the transmission strategy between the base station and the terminal, and determine the precoding algorithm based on the transmission strategy;

[0114] When the transmission strategy indicates that the average value of multiple signal-to-interference-plus-noise ratios needs to be greater than or equal to the first signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a precoding algorithm based on minimum mean square error. The S transmission rates are calculated according to the precoding algorithm based on minimum mean square error to obtain the transmitter matrix.

[0115] When the transmission strategy indicates that the minimum of the plurality of signal-to-interference-plus-noise ratios needs to be greater than or equal to the second signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a binary search-based precoding algorithm, and the S transmission rates are calculated according to the binary search-based precoding algorithm to obtain the transmitter matrix.

[0116] In this embodiment, the proposition It can be simplified to

[0117]

[0118] Let the above optimization problem be denoted as... This application proposes two technical approaches to solve the problem. The specific approach is determined based on the transmission strategy between the base station and the terminal, and the precoding algorithm is determined according to the transmission strategy. The precoding algorithms include a minimum mean square error-based precoding algorithm and a binary search-based precoding algorithm.

[0119] Specifically, when the transmission strategy indicates that the average of multiple signal-to-interference-plus-noise ratios (SINRs) must be greater than or equal to a first SINR, a precoding algorithm based on minimum mean square error (MMSE) is selected to calculate the transmitter matrix. Alternatively, when the transmission strategy indicates that the average of multiple SINRs must be greater than or equal to a first SINR, a precoding algorithm based on binary search is selected to calculate the transmitter matrix. Thus, this proposal allows for flexible selection of a suitable precoding algorithm based on the available computing resources of the current base station. When computing resources are sufficient, a MMSE-based precoding algorithm that achieves the optimal solution but involves significant computational cost can be selected. When computing resources are insufficient, a low-complexity binary search-based precoding algorithm can be used.

[0120] Optionally, the step of calculating the transmitter matrix based on the S transmission rates using the precoding algorithm based on minimum mean square error includes:

[0121] If the communication performance of the base station is greater than or equal to a preset threshold, the precoding matrix and the mean square error of the terminal received signal are calculated based on the S transmission rates.

[0122] The first receiver matrix is ​​determined based on the mean square error.

[0123] A first optimization function is generated based on the precoding matrix, the first receiver matrix, and preset variables, wherein the preset variables are used to indicate the correspondence between the precoding matrix and the first receiver matrix;

[0124] The transmitter matrix is ​​obtained by deriving and solving the first optimization function.

[0125] In this embodiment, as Figure 4 As shown, when using the precoding algorithm based on minimum mean square error to calculate the S transmission rates, the mean square error of the signal received by user k at the receiving end is calculated as follows:

[0126]

[0127] To achieve the minimum mean square error, the system needs to match the optimal receiver w for each user. k Consider using E k For w k

[0128] According to Proposition 2, the user rate can be represented by the minimum mean square error.

[0129]

[0130] Due to interference between users, the optimization problem is non-convex. This application takes a different approach, proposing an optimization problem with the same optimal solution by constructing an equivalent optimization problem, and obtaining the optimal solution of the problem. Furthermore, this paper proves that the two problems have the same optimal solution. (Define function)

[0131]

[0132] The equivalent optimization problem of the construction is as follows:

[0133]

[0134] Let the above optimization problem be denoted as... Where ω k (x) represents the function f ω The inverse function of (x), This represents a set of intermediate variables. (Question) The solution consists of the following 3 steps.

[0135] Solution Step 1: Fix the variable t k and A k The optimal w is derived. k A k E k Regarding w k Take the derivative, set the result to zero, and you will obtain the optimal receiver matrix w. k It is an MMSE receiver.

[0136] Solution Step 2: Fix the variable t k and w k Derive the optimal A k Optimization objective regarding A k Take the derivative and set the result to zero to obtain...

[0137]

[0138] Therefore, the optimal A k satisfy

[0139]

[0140] Proposition 3: Problem The optimal t k and w k It is also a problem The optimal solution.

[0141] Solution step 3: Fix A k and w k Solve for the optimal t k Regarding t k optimization problem as follows

[0142]

[0143] question In the middle, E k Regarding t k It is a convex function. It is a convex set.

[0144] Proposition 4: Given w k At that time, constraint Γ k ≥γ k It's about t k The second-order cone constraint.

[0145] In summary, the problem is... It is a convex optimization problem, which can be solved using common convex optimization tools.

[0146] Specifically, the proof for Proposition 2 is as follows:

[0147] prove:

[0148]

[0149] When the receiving end uses an MMSE receiver, there is

[0150]

[0151] Simplify E k get

[0152]

[0153] therefore

[0154]

[0155] The proof is complete.

[0156] Specifically, the proof for Proposition 3 is as follows:

[0157] Proof: By E k =ω k (A k It can be seen that A k E k +c k (ω k (A k ))-A k ω k (A k ) = c k (E k ), and then the problem The optimization objective can be written as

[0158]

[0159] Seeking answers regarding w k The first-order optimal condition is obtained

[0160]

[0161] Optimal w k For MMSE receivers, therefore, the problem The optimization objective can be written as

[0162]

[0163] Taking the negative of the optimization objective and changing the minimization direction to the maximization direction, we can obtain...

[0164]

[0165] Therefore, the problem and the problem It's an equivalence problem. t in the optimal solution k and w k It's also a problem. The optimal solution is found. Proof complete.

[0166] Specifically, the proof for Proposition 4 is as follows:

[0167] Proof: Γ k ≥γ k It can be transformed into an algebraic expression as follows:

[0168]

[0169] For any It must exist satisfy definition

[0170]

[0171] η is an intermediate variable. It is all precoded vectors t k The optimization vector consisting of the intermediate variable η.

[0172] definition

[0173]

[0174] in, achievable

[0175]

[0176] definition

[0177]

[0178] in, It is a vector of all zeros. Let Γ represent a unit vector where the nth term is 1 and all other terms are 0. Set η = 1, Γ... k ≥γ k It can be represented as

[0179]

[0180] again ||Z k x||≥0, we get

[0181]

[0182] Therefore, given w k At that time, constraint Γ k ≥γ k It's about t k The second-order cone constraint. Proof complete.

[0183] Optionally, the step of calculating the S transmission rates according to the binary search-based precoding algorithm to obtain the transmitter matrix includes:

[0184] If the communication performance of the base station is less than a preset threshold, a precoding matrix is ​​calculated based on the S transmission rates;

[0185] The pre-acquired second receiver matrix is ​​normalized to obtain the target receiver matrix;

[0186] Singular value decomposition is performed on the channel between the base station and the terminal to obtain the singular value decomposition result, and the feature vector corresponding to the singular value decomposition result is determined.

[0187] A second optimization function is generated based on the singular value decomposition result, the eigenvector, the target receiver matrix, and the precoding matrix.

[0188] The transmitter matrix is ​​obtained by solving the second optimization function.

[0189] In this embodiment, as Figure 5 As shown, when using a binary search-based precoding algorithm to calculate the S transmission rates, the receiver matrix is ​​normalized. Consider channel H k Perform SVD decomposition Let matrix Λ k The maximum absolute value of all elements is μ. k V k The corresponding μ ink The feature vector is The corresponding μ in k The feature vector is This section uses the product of the maximum singular value of the channel matrix between the user and the base station and its corresponding eigenvector as the equivalent channel between the user and the base station. Pick but

[0190]

[0191] For optimization problems The main difficulty lies in t k The mutual coupling between them makes the entire optimization problem nonconvex; therefore, we take... T = [t1, t2, ..., t K To eliminate interference between users, this section employs the following zero-forcing method.

[0192]

[0193] in, It is a K-order diagonal matrix. Forcing zeros can essentially cancel out interference between users, reducing complexity. Although the precoding vector t is given k The value of , in fact, is maintained while keeping t k While keeping the normalized vector unchanged, the effect of eliminating interference between users can be achieved by adjusting the matrix. The values ​​of the elements on the diagonal change the amount of power the base station provides to users, thereby further improving the overall system efficiency. For ease of description, let's take... Indicates t k The normalized vector, P k =||t k || 2 This represents the transmit power provided by user k. at this time

[0194]

[0195] Optimization problem Can be written

[0196]

[0197] Let it be denoted as an optimization problem The optimal solution can be obtained by constructing the Lagrangian function and solving the KKT conditions. The optimal solution is

[0198]

[0199] ξ k(λ) represents the Lagrange factor λ and variable P that satisfy the following equation. k A one-to-one mapping between them.

[0200]

[0201] The right side of the above equation is related to P k It is monotonic and can be solved using a binary search. Finally, the value of λ should be adjusted to satisfy the following equation.

[0202]

[0203] It should be noted that the precoding matrix t is calculated according to the above scheme. k Receiver matrix w k The precoded signal is

[0204]

[0205] The technical solution of this application, after determining the channel conditions between the base station and the terminal, groups the multiple short packet data transmitted between the base station and the terminal into groups, calculates the minimum transmission rate for the obtained N short packet data groups and M long packet data, thereby obtaining S transmission rates. Then, the S transmission rates are calculated according to the precoding algorithm to determine the transmitter matrix, and the encoding of the signal to be encoded is completed according to the transmitter matrix to generate the precoded signal. This fully considers the transmission situation of short packet data and improves resource utilization in the process of generating the precoded signal.

[0206] See Figure 6 , Figure 6 This is a structural diagram of the precoded signal generation apparatus provided in an embodiment of this application. Figure 6 As shown, the precoded signal generation apparatus 600 includes:

[0207] The grouping module 610 is used to group multiple short packet data transmitted between the base station and the terminal based on the channel conditions between the base station and the terminal to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer.

[0208] The first calculation module 620 is used to calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M, the M long packet data groups are the data transmitted between the base station and the terminal, and the S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group, where M is a positive integer and S is a positive integer.

[0209] The second calculation module 630 is used to calculate the S transmission rates according to the precoding algorithm to obtain the transmitter matrix;

[0210] The encoding module 640 is used to encode the signal to be encoded based on the transmitter matrix to generate a pre-coded signal.

[0211] Optionally, the grouping module 610 includes:

[0212] The first determining submodule is used to determine the channel matrix corresponding to the signal between the base station and the terminal, and to determine the detection matrix corresponding to the terminal, wherein the channel is used to transmit the short packet data or the long packet data;

[0213] The calculation submodule is used to calculate the channel noise between the base station and the terminal based on the channel matrix;

[0214] A generation submodule is used to generate the channel conditions based on the detection matrix and the channel noise;

[0215] The grouping submodule is used to group the multiple short packet data based on the channel conditions to obtain N short packet data groups.

[0216] Optionally, the first computing module 620 includes:

[0217] The second determining submodule is used to determine the received signal, recovered signal and signal-to-dryness ratio of the terminal corresponding to the first packet data, wherein the first packet data is any one of the N short packet data groups, or the first packet data is any one of the M long packet data groups;

[0218] The third determining submodule is used to determine the initial transmission rate based on the received signal, the recovered signal, and the signal-to-dryness ratio;

[0219] The update submodule is used to update the initial transmission rate based on constraints to obtain the transmission rate corresponding to the first packet data. The constraints include at least one of the following: the maximum transmission power of the base station and the upper limit of the bit error rate corresponding to the short packet data group.

[0220] Optionally, the second computing module 630 includes:

[0221] The fourth determining submodule is used to determine the transmission strategy between the base station and the terminal, and to determine the precoding algorithm based on the transmission strategy;

[0222] The fifth determining submodule is used to determine the precoding algorithm as a minimum mean square error-based precoding algorithm when the transmission strategy indicates that the average value of multiple signal-to-interference-plus-noise ratios needs to be greater than or equal to the first signal-to-interference-plus-noise ratio, and to calculate the S transmission rates according to the minimum mean square error-based precoding algorithm to obtain the transmitter matrix.

[0223] The sixth determining submodule is used to determine the precoding algorithm as a binary search-based precoding algorithm when the transmission strategy indicates that the minimum value of the plurality of signal-to-interference-plus-noise ratios needs to be greater than or equal to the second signal-to-interference-plus-noise ratio, and to calculate the S transmission rates according to the binary search-based precoding algorithm to obtain the transmitter matrix.

[0224] Optionally, the fifth determination submodule includes:

[0225] The first calculation unit is used to calculate the precoding matrix and the mean square error of the terminal received signal based on the S transmission rates, provided that the communication performance of the base station is greater than or equal to a preset threshold.

[0226] A determining unit is configured to calculate and determine a first receiver matrix based on the mean square error;

[0227] The first generation unit is configured to generate a first optimization function based on the precoding matrix, the first receiver matrix, and preset variables, wherein the preset variables are used to indicate the correspondence between the precoding matrix and the first receiver matrix.

[0228] The first solution unit is used to solve the first optimization function to obtain the transmitter matrix.

[0229] Optionally, the sixth determining submodule includes:

[0230] The second calculation unit is used to calculate the precoding matrix according to the S transmission rates when the communication performance of the base station is less than a preset threshold.

[0231] The processing unit is used to normalize the pre-acquired second receiver matrix to obtain the target receiver matrix;

[0232] The decomposition unit is used to perform singular value decomposition on the channel between the base station and the terminal, obtain the singular value decomposition result, and determine the feature vector corresponding to the singular value decomposition result.

[0233] The second generation unit is used to generate a second optimization function based on the singular value decomposition result, the eigenvector, the target receiver matrix, and the precoding matrix.

[0234] The second solving unit is used to solve the second optimization function to obtain the transmitter matrix.

[0235] The technical solution of this application, after determining the channel conditions between the base station and the terminal, groups the multiple short packet data transmitted between the base station and the terminal into groups, calculates the minimum transmission rate for the obtained N short packet data groups and M long packet data, thereby obtaining S transmission rates. Then, the S transmission rates are calculated according to the precoding algorithm to determine the transmitter matrix, and the encoding of the signal to be encoded is completed according to the transmitter matrix to generate the precoded signal. This fully considers the transmission situation of short packet data and improves resource utilization in the process of generating the precoded signal.

[0236] This application also provides an electronic device. Please refer to [link to relevant documentation]. Figure 7 The electronic device may include a processor 701, a memory 702, and a program 7021 stored in the memory 702 and capable of running on the processor 701.

[0237] When program 7021 is executed by processor 701, it can achieve the following: Figure 1 Any step in the corresponding method embodiment:

[0238] Based on the channel conditions between the base station and the terminal, multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer.

[0239] Calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M. The M long packet data groups are the data transmitted between the base station and the terminal. The S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group. M is a positive integer, and S is a positive integer.

[0240] The transmitter matrix is ​​obtained by calculating the S transmission rates according to the precoding algorithm;

[0241] The signal to be encoded is encoded based on the transmitter matrix to generate a precoded signal.

[0242] Optionally, based on the channel conditions between the base station and the terminal, the multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups, including:

[0243] Determine the channel matrix corresponding to the signal between the base station and the terminal, and determine the detection matrix corresponding to the terminal, wherein the channel is used to transmit the short packet data or the long packet data;

[0244] Based on the channel matrix, calculate the channel noise between the base station and the terminal;

[0245] The channel conditions are generated based on the detection matrix and the channel noise.

[0246] Based on the channel conditions, the multiple short packet data are grouped to obtain N short packet data groups.

[0247] Optionally, the step of calculating the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates includes:

[0248] Determine the received signal, recovered signal, and signal-to-dryness ratio of the terminal corresponding to the first packet of data, wherein the first packet of data is any one of the N short packet data groups, or the first packet of data is any one of the M long packet data groups;

[0249] The initial transmission rate is determined based on the received signal, the recovered signal, and the signal-to-dryness ratio;

[0250] The initial transmission rate is updated based on constraints to obtain the transmission rate corresponding to the first packet data. The constraints include at least one of the following: the maximum transmission power of the base station and the upper limit of the bit error rate corresponding to the short packet data group.

[0251] Optionally, the step of calculating the S transmission rates according to the precoding algorithm to obtain the transmitter matrix includes:

[0252] Determine the transmission strategy between the base station and the terminal, and determine the precoding algorithm based on the transmission strategy;

[0253] When the transmission strategy indicates that the average value of multiple signal-to-interference-plus-noise ratios needs to be greater than or equal to the first signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a precoding algorithm based on minimum mean square error. The S transmission rates are calculated according to the precoding algorithm based on minimum mean square error to obtain the transmitter matrix.

[0254] When the transmission strategy indicates that the minimum of the plurality of signal-to-interference-plus-noise ratios needs to be greater than or equal to the second signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a binary search-based precoding algorithm, and the S transmission rates are calculated according to the binary search-based precoding algorithm to obtain the transmitter matrix.

[0255] Optionally, the step of calculating the transmitter matrix based on the S transmission rates using the precoding algorithm based on minimum mean square error includes:

[0256] If the communication performance of the base station is greater than or equal to a preset threshold, the precoding matrix and the mean square error of the terminal received signal are calculated based on the S transmission rates.

[0257] The first receiver matrix is ​​determined based on the mean square error.

[0258] A first optimization function is generated based on the precoding matrix, the first receiver matrix, and preset variables, wherein the preset variables are used to indicate the correspondence between the precoding matrix and the first receiver matrix;

[0259] The transmitter matrix is ​​obtained by solving the first optimization function.

[0260] Optionally, the step of calculating the S transmission rates according to the binary search-based precoding algorithm to obtain the transmitter matrix includes:

[0261] If the communication performance of the base station is less than a preset threshold, a precoding matrix is ​​calculated based on the S transmission rates;

[0262] The pre-acquired second receiver matrix is ​​normalized to obtain the target receiver matrix;

[0263] Singular value decomposition is performed on the channel between the base station and the terminal to obtain the singular value decomposition result, and the feature vector corresponding to the singular value decomposition result is determined.

[0264] A second optimization function is generated based on the singular value decomposition result, the eigenvector, the target receiver matrix, and the precoding matrix.

[0265] The transmitter matrix is ​​obtained by solving the second optimization function.

[0266] The technical solution of this application, after determining the channel conditions between the base station and the terminal, groups the multiple short packet data transmitted between the base station and the terminal into groups, calculates the minimum transmission rate for the obtained N short packet data groups and M long packet data, thereby obtaining S transmission rates. Then, the S transmission rates are calculated according to the precoding algorithm to determine the transmitter matrix, and the encoding of the signal to be encoded is completed according to the transmitter matrix to generate the precoded signal. This fully considers the transmission situation of short packet data and improves resource utilization in the process of generating the precoded signal.

[0267] This application also provides a computer-readable storage medium storing a computer program. When executed by a processor, this computer program implements the various processes of the above-described method for generating precoded signals and achieves the same technical effects. To avoid repetition, it will not be described again here. The computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0268] This application also provides a computer program product, which is stored in a storage medium and executed by at least one processor to implement the various processes of the above-described method for generating precoded signals, and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0269] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0270] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0271] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.

Claims

1. A method for generating a precoded signal, characterized in that, The method includes: Based on the channel conditions between the base station and the terminal, multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer. Calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M. The M long packet data groups are the data transmitted between the base station and the terminal. The S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group. M is a positive integer, and S is a positive integer. The transmitter matrix is ​​obtained by calculating the S transmission rates according to the precoding algorithm; The signal to be encoded is encoded based on the transmitter matrix to generate a precoded signal.

2. The method according to claim 1, characterized in that, Based on the channel conditions between the base station and the terminal, multiple short packet data transmitted between the base station and the terminal are grouped to obtain N short packet data groups, including: Determine the channel matrix corresponding to the signal between the base station and the terminal, and determine the detection matrix corresponding to the terminal, wherein the channel is used to transmit the short packet data or the long packet data; Based on the channel matrix, calculate the channel noise between the base station and the terminal; The channel conditions are generated based on the detection matrix and the channel noise. Based on the channel conditions, the multiple short packet data are grouped to obtain N short packet data groups.

3. The method according to claim 1, characterized in that, The calculation of the required transmission rates corresponding to the N short packet data groups and M long packet data groups, resulting in S transmission rates, includes: Determine the received signal, recovered signal, and signal-to-dryness ratio of the terminal corresponding to the first packet of data, wherein the first packet of data is any one of the N short packet data groups, or the first packet of data is any one of the M long packet data groups; The initial transmission rate is determined based on the received signal, the recovered signal, and the signal-to-dryness ratio; The initial transmission rate is updated based on constraints to obtain the transmission rate corresponding to the first packet data. The constraints include at least one of the following: the maximum transmission power of the base station and the upper limit of the bit error rate corresponding to the short packet data group.

4. The method according to claim 1, characterized in that, The step of calculating the transmitter matrix based on the S transmission rates using a precoding algorithm includes: Determine the transmission strategy between the base station and the terminal, and determine the precoding algorithm based on the transmission strategy; When the transmission strategy indicates that the average value of multiple signal-to-interference-plus-noise ratios needs to be greater than or equal to the first signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a precoding algorithm based on minimum mean square error. The S transmission rates are calculated according to the precoding algorithm based on minimum mean square error to obtain the transmitter matrix. When the transmission strategy indicates that the minimum of the plurality of signal-to-interference-plus-noise ratios needs to be greater than or equal to the second signal-to-interference-plus-noise ratio, the precoding algorithm is determined to be a binary search-based precoding algorithm, and the S transmission rates are calculated according to the binary search-based precoding algorithm to obtain the transmitter matrix.

5. The method according to claim 4, characterized in that, The step of calculating the transmitter matrix based on the S transmission rates using the precoding algorithm based on minimum mean square error includes: If the communication performance of the base station is greater than or equal to a preset threshold, the precoding matrix and the mean square error of the terminal received signal are calculated based on the S transmission rates. The first receiver matrix is ​​determined based on the mean square error. A first optimization function is generated based on the precoding matrix, the first receiver matrix, and preset variables, wherein the preset variables are used to indicate the correspondence between the precoding matrix and the first receiver matrix; The transmitter matrix is ​​obtained by solving the first optimization function.

6. The method according to claim 4, characterized in that, The step of calculating the transmitter matrix based on the binary search-based precoding algorithm for the S transmission rates includes: If the communication performance of the base station is less than a preset threshold, a precoding matrix is ​​calculated based on the S transmission rates; The pre-acquired second receiver matrix is ​​normalized to obtain the target receiver matrix; Singular value decomposition is performed on the channel between the base station and the terminal to obtain the singular value decomposition result, and the feature vector corresponding to the singular value decomposition result is determined. A second optimization function is generated based on the singular value decomposition result, the eigenvector, the target receiver matrix, and the precoding matrix. The transmitter matrix is ​​obtained by solving the second optimization function.

7. A precoded signal generation apparatus, characterized in that, The device includes: The grouping module is used to group multiple short packet data transmitted between the base station and the terminal based on the channel conditions between the base station and the terminal to obtain N short packet data groups. Each short packet data group includes at least two short packet data. The channel conditions include the target frame length. The sum of the frame lengths corresponding to the at least two short packet data in each short packet data group is less than or equal to the target frame length. N is a positive integer. The first calculation module is used to calculate the required transmission rates corresponding to the N short packet data groups and M long packet data groups to obtain S transmission rates, where S is the sum of N and M, the M long packet data groups are the data transmitted between the base station and the terminal, and the S transmission rates include: N transmission rates corresponding one-to-one with the N short packet data groups, and M transmission rates corresponding one-to-one with the M long packet data groups. The transmission rates are used to indicate the minimum transmission rate of the corresponding short packet data group or long packet data group, where M is a positive integer and S is a positive integer. The second calculation module is used to calculate the S transmission rates according to the precoding algorithm to obtain the transmitter matrix; The encoding module is used to encode the signal to be encoded based on the transmitter matrix to generate a pre-coded signal.

8. An electronic device, characterized in that, include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements the steps of the method as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the method as described in any one of claims 1 to 6.

10. A computer program product, characterized in that, Includes computer instructions that, when executed by a processor, implement the steps of the method as described in any one of claims 1 to 6.

Images