An optimal rate segmentation method and system for short packet communication to improve reliability

Abstract

The application provides an optimal rate segmentation method for short packet communication to improve reliability, comprising the following steps: S1, establishing a communication model based on rate segmentation multiple access, containing various rate segmentation strategies, and using a limited code length domain theory to represent the error probability of user decoding a single flow; S2, constructing an optimization problem of minimizing the maximum user weighted decoding error rate based on the decoding error probability of the user end, with power allocation and code length allocation as optimization variables; S3, introducing a relaxation variable, a code length integer domain relaxation and a Taylor approximation method, converting the non-convex constraint in the optimization problem into a convex constraint, and constructing a convex constraint optimization problem; S4, solving the convex constraint optimization problem by using an iterative algorithm based on continuous convex approximation, and obtaining an optimal power allocation scheme, a code length allocation scheme and a rate segmentation strategy. The application aims to minimize the maximum user decoding error probability, thereby improving the reliability of a multi-user short packet communication scene.

Description

An optimal rate segmentation method and system for improving reliability in short packet communication Technical Field

[0001] This invention belongs to the field of wireless communication technology, and in particular relates to a rate segmentation method and system for improving the reliability of short packet communication. Background Technology

[0002] With the further development of wireless communication, research on next-generation mobile communication technologies has received widespread attention. In the IMT-2030 (Global 6G Vision) recommendation completed by the International Telecommunication Union (ITU), the application scenarios of 6G focus on Massive Communication and Hyper-Reliable and Low-Latency Communication.

[0003] Consider a typical 6G application scenario: the Industrial Internet of Things (IIoT). On one hand, traditional multiple access methods struggle to support massive access demands due to the requirements of large-scale communication. Rate-splitting multiple access (RSMA), by segmenting the rate at the message transmitter, bridges various interference management strategies such as orthogonalization, treating interference as noise, and decoding interference, improving spectrum and energy efficiency and flexibly responding to different user loads and interference levels. On the other hand, for ultra-reliable low-latency communication, the data packets in IIoT are generally small, and available code length and time domain resources are limited. Traditional Shannon domain analysis achieves error-free transmission with infinite code lengths, but this cannot accurately model the instantaneous reliability of wireless communication and is insufficient to meet low-latency requirements. Therefore, short-packet communication is used for analysis within a finite code length domain.

[0004] Thanks to the research on finite code length field theory by Polyanskiy et al., the decoding error probability in short packet communication can be modeled relatively well. Shortening the code length can reduce communication latency, but it also increases the probability of transmission errors. Meanwhile, increasing the transmit power can improve the signal-to-noise ratio, thus reducing the probability of transmission errors, but increasing the power of a particular stream can also increase the interference level of that stream on other streams. Therefore, how to balance code length and transmit power to select the optimal rate segmentation strategy in short packet communication is of research significance. Summary of the Invention

[0005] For downlink communication scenarios where a single base station serves two users, and addressing the lack of highly reliable low-latency transmission solutions between the base station and the user end, this invention patent designs an optimal rate segmentation method and system for improving weighted reliability in multi-user short packet communication. The aim is to minimize the maximum user end decoding error probability, thereby improving the reliability of multi-user short packet communication scenarios.

[0006] To solve the above-mentioned technical problems, the present invention provides the following technical solution:

[0007] An optimal rate segmentation method for improving reliability in short packet communication is characterized by the following steps:

[0008] Step S1: For the downlink communication scenario of a single base station serving two users, establish a communication model based on rate segmentation multiple access. The communication model includes multiple rate segmentation strategies and uses the finite code length field theory to characterize the error probability of a user decoding a single stream.

[0009] Step S2: Based on the decoding error probability of the user terminal, construct an optimization problem to minimize the maximum user-weighted decoding error rate, with power allocation and code length allocation as optimization variables;

[0010] Step S3: Introduce slack variables, code length integer field relaxation, and Taylor approximation method to transform the non-convex constraints in the optimization problem into convex constraints, and construct a convex constraint optimization problem;

[0011] Step S4: Solve the convex constraint optimization problem using an iterative algorithm based on continuous convex approximation to obtain the optimal power allocation scheme, code length allocation scheme, and rate segmentation strategy.

[0012] Furthermore, the rate segmentation strategy in step S1 includes:

[0013] Orthogonal Rate Segmentation Multiple Access Strategy (OMA-RS): User messages are segmented into public and private streams, and each stream uses orthogonal resource transmission. Multiple access is achieved by allocating different code lengths.

[0014] Non-orthogonal rate segmentation multiple access strategy (NOMA-RS): Each stream shares code length resources, non-orthogonal transmission is achieved by allocating different power levels, and continuous interference cancellation decoding is used;

[0015] Hybrid-RS (Hybrid Rate Segmentation Multiple Access) strategy: Public flows are allocated code length and power independently, while private flows share code length and are allocated power.

[0016] Furthermore, the error probability of the user decoding a single stream in step S1 is:

[0017]

[0018] in, The error probability of decoding a single stream for the user. It is the tail distribution function of the standard normal distribution, and its standard definition is... , The signal-to-interference-plus-noise ratio (SINR) or SNR of the data stream. The length of the encoded block used for the data stream, The coding rate corresponding to the data stream. Channel dispersion depends on the signal-to-noise ratio. This refers to the channel transmission capacity.

[0019] Furthermore, the optimization problem in step S2, which minimizes the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables, is as follows:

[0020]

[0021] in, It is a set of three rate-division multiple access strategies. It is one of the strategies; It is a set of optimization variables for three strategies. It is an optimization variable for one of the strategies; Represents a set of users. It is the index of the users; A set representing a stream, It is the index of the stream; Indicates user The weights, including the weight of user 1. Weight of User 2 ; Indicates a certain strategy Next user The decoding error rate, including the user 1 decoding error rate under the OMA-RS strategy. Decoding error rate of User 2 Decoding error rate of User 1 under NOMA-RS strategy Decoding error rate of User 2 Decoding error rate of 1 user under Hybrid-RS strategy Decoding error rate of User 2 ;

[0022] Indicates a certain strategy Next user Decoded stream Error rate, including user 1 decoding stream under OMA-RS strategy Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate User 2 decoding stream Error rate Including the user 1 decoding stream under the NOMA-RS strategy. Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate and User 2 decoding stream decoding stream Error rate User 2 decoding stream Error rate ; Including user 1 decoding stream under Hybrid-RS strategy Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate User 2 decoding stream Error rate ; This represents the threshold error probability.

[0023] Further, step S3 includes:

[0024] Step S3.1 The optimization problem of minimizing the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables is broken down into three sub-problems;

[0025] Step S3.2 introduces slack variables to transform the min max problem into a min problem;

[0026] Step S3.3 Based on the Taylor approximation method, the non-convex constraints in the optimization problem are transformed into convex constraints, and a convex constraint optimization problem is constructed.

[0027] Furthermore, the three sub-problems are as follows:

[0028]

[0029]

[0030]

[0031] in, It is the flow allocated under the OMA-RS strategy The length of the code, Represents their set, It is the maximum available code length; It is the flow allocated under the NOMA-RS strategy power, Represents their set, This is the maximum transmission power of the base station; It is the allocation of the stream under the Hybrid-RS strategy The length of the code, Represents their set, It is the Hybrid-RS strategy that allocates to the upper layer flow. and lower layer flow power, This represents their set.

[0032] Furthermore, by introducing slack variables, the min max problem is transformed into a min problem:

[0033]

[0034]

[0035]

[0036] in, The introduced slack variables transform the problem into a min problem; simultaneously, the code length variables in (ORS-P1) and (HRS-P1) are... Relax from the integer field to the real number field.

[0037] Furthermore, the convex constraint optimization problem is:

[0038]

[0039]

[0040]

[0041] in, It is a Taylor approximation of the error rate; for The result of relaxing from the integer field to the real field is obtained by comparing adjacent integer solutions. :

[0042]

[0043] in, The real code length solutions to problems (ORS-P2) and (HRS-P2) are... It is the lower bound integer of the corresponding real number solution. It is an integer upper bound of the corresponding real number solution. include and , which are the error rate slack variables for problems (ORS-P2) and (HRS-P2) when the code length is an integer, respectively.

[0044] Further, step S4 includes:

[0045] For each strategy, the required parameters are first initialized, and then iterative solutions are performed until the convergence tolerance is reached to obtain real solutions of the same code length. The final integer solution is obtained by comparing adjacent integers.

[0046] On the other hand, the present invention provides an optimal rate segmentation system for improving reliability in short packet communication, comprising:

[0047] Communication model construction module: It is used to establish a communication model based on rate segmentation multiple access for downlink communication scenarios where a single base station serves two users. The communication model includes multiple rate segmentation strategies and uses the finite code length field theory to characterize the error probability of a user decoding a single stream.

[0048] Optimization Problem Construction Module: It is used to construct an optimization problem based on the decoding error probability of the user terminal, which minimizes the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables;

[0049] Convex constraint optimization module: It is used to introduce relaxation variables, code length integer field relaxation and Taylor approximation method to transform the non-convex constraints in the optimization problem into convex constraints and construct the convex constraint optimization problem;

[0050] The solution module is used to solve the convex constraint optimization problem using an iterative algorithm based on continuous convex approximation, and obtain the optimal power allocation scheme, code length allocation scheme and rate segmentation strategy.

[0051] Compared with the prior art, the present invention has the following beneficial effects:

[0052] This invention provides an optimal rate segmentation method and system for improving weighted reliability in multi-user short packet communication, which satisfies the requirements of high reliability and low latency in communication. It also proposes an efficient method to reduce computational complexity and has extremely high scalability and a wide range of practical application scenarios. Attached Figure Description

[0053] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0054] Figure 1 illustrates a downlink short packet communication scenario for serving two users with a single antenna, as proposed in this invention.

[0055] Figure 2 is a schematic diagram of different rate segmentation multiple access strategies proposed in this invention for the communication scenario in Figure 1;

[0056] Figure 3 is a flowchart of the proposed efficient solution method for optimal power and code length allocation;

[0057] Figure 4 shows the convergence verification of the proposed algorithm;

[0058] Figure 5 is a schematic diagram of the optimal RSMA strategy under different channel conditions. Detailed Implementation

[0059] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0060] Example 1

[0061] The invention will now be further described with reference to the accompanying drawings.

[0062] Figure 1 illustrates the optimal rate segmentation method and system for improving weighted reliability in short packet communication proposed in this invention. The proposed downlink communication scenario includes one single-antenna base station and two single-antenna users, with the base station sending messages to both users. It is a public message that both users need. These are the private messages needed by each of the two users. The base station's transmit power is limited to 4.0W, and the maximum usable coded block length is 500 bits.

[0063] Figure 2 illustrates three RSMA strategies proposed in this invention for the scenario shown in Figure 1. The base station divides the messages from the two users into a common message stream. and private message stream Transmission is then performed. The first strategy is based on Orthogonal Multiple Access RSMA (OMA-RS), where all three streams use the maximum transmit power. Using code length respectively Transmission. The second strategy is based on non-orthogonal multiple access RSMA (NOMA-RS), where all three streams use the maximum code length. At different power levels Uplink transmission. The third strategy is based on hybrid orthogonal-nonorthogonal RSMA (Hybrid-RS). Power used in the upper layer and maximum code length transmission , Power is used in the lower layer. They share the same code length for transmission.

[0064] Figure 3 illustrates the efficient algorithm flow for code length and power allocation proposed in this invention. First, the three RSMA strategies shown in Figure 2 are modeled, and weighted reliability is characterized based on finite code length domain theory. Then, an optimal RSMA strategy selection problem is constructed with the goal of improving weighted reliability by allocating power / code length variables. Subsequently, through methods such as splitting the problem into subproblems, introducing relaxation variables to transform the min-max problem into a min problem, relaxing the code length from the integer domain to the real domain, and Taylor approximation, the problem is ultimately transformed into three convex subproblems, which are solved using an algorithm based on continuous convex approximation.

[0065] Figure 4 shows the convergence performance of the proposed algorithm. As can be seen from the figure, the algorithms under the three RSMA strategies converge to a result close to the global search result within 10 iterations. This verifies the convergence and effectiveness of the proposed algorithm.

[0066] Figure 5 illustrates the optimal RSMA strategy selection under different channel conditions. As shown in the figure, When approaching the target, the OMA-RS strategy performs optimally; When the gap widens, the NOMA-RS strategy performs best; while in other regions, the Hybrid-RS strategy outperforms both OMA-RS and NOMA-RS.

[0067] Preferably, the two user indices in step S1 are The messages needed by users 1 and 2 are respectively .Will Divide as shown in the diagram, where It's a public message and needs to be decoded by two users. and These are private messages, decoded separately by users 1 and 2. The segmented messages are then encoded into three data streams. . Specifically, Includes public messages , Contains user 1's private message , Contains user 2's private message Consider three data streams, as shown in the diagram, with different resource allocation methods. The first method, OMA-RS, uses an orthogonal approach, with the three data streams using different code lengths and transmitting at the same power level. The second method, NOMA-RS, uses a non-orthogonal approach, with the three data streams sharing a code length but transmitting at different power levels. The third method, Hybrid-RS, uses a hybrid orthogonal-non-orthogonal approach. Transmission at the upper power level, stream and They share the same code length for transmission at the lower power level. The maximum transmit power of the base station is... The maximum usable code length is Base stations and users The channel between them is , The mean is 0 and the variance is Additive white Gaussian noise. The set of three strategies is defined as follows: ,index .

[0068] Consider the first strategy, OMA-RS. The code lengths allocated to the three streams are as follows: , and Receiver user Received signal for:

[0069]

[0070] user Simultaneously decode stream Signal-to-noise ratio (SNR) during decoding for:

[0071]

[0072] According to the finite code length field theory, the error probability of a user decoding a single stream can be expressed as:

[0073]

[0074] in, The error probability of decoding a single stream for the user. It is the tail distribution function of the standard normal distribution, and its standard definition is... , The signal-to-interference-plus-noise ratio (SINR) or SNR of the data stream. The length of the encoded block used for the data stream, The coding rate corresponding to the data stream. Channel dispersion depends on the signal-to-noise ratio. Let be the channel transmission capacity, and let be the capacity of the Shannon channel. .

[0075] Under the OMA-RS strategy, users All streams containing the user's message must be correctly decoded, so the user's decoding error rate can be expressed as:

[0076]

[0077] in, , These are the decoding error rates of User 1 under the OMA-RS strategy. Decoding error rate for User 2; User Decoded stream Error rate, This is the user 1 decoding stream under the OMA-RS strategy. Error rate, It is the user 2 decoding stream under the OMA-RS strategy. Error rate, , , , These represent the decoding error rate of User 1 under the OMA-RS strategy, the decoding error rate of User 2 under the OMA-RS strategy, and the decoding stream of User 1 under the OMA-RS strategy. Error rate, User 2 decoding stream under OMA-RS strategy Error rate.

[0078] Consider the second strategy, NOMA-RS. The power allocated to the three streams is as follows: , and Receiver user The received signal is :

[0079]

[0080] in, It is the base station and the user Channel coefficients between The mean is 0 and the variance is Additive white Gaussian noise, A set representing a stream, It is the index of the stream;

[0081] The user uses Continuous Interference Cancellation (SIC) for decoding. Since SIC generally prioritizes decoding the stronger signal, the signal strength order of the three streams is assumed to be... Therefore, the SIC decoding order is as follows: .

[0082] First, users Will All are considered interference, decode SINR is:

[0083]

[0084] decoding Then, the signal is removed from the received signal via SIC. Then... Treat it as interference, decode The signal-to-interference-plus-noise ratio (SINR) of the data stream is:

[0085]

[0086] decoding Afterwards, User 1 has obtained the necessary information. User 2 still needs to decode it. Removed from the remaining received signal via SIC. Finally, decode. The signal-to-interference-plus-noise ratio (SNR) is:

[0087]

[0088] Under the NOMA-RS strategy, decoding errors can be categorized into three possibilities: (1) decoding stream errors. Error; (2) Decoding stream Correct, but the decoded stream Error; (3) Decoding stream Correct, but the decoded stream Error. Due to user 1's message encoding in the stream. In the middle, only decoding is required. User 2's message encoding in the stream In the middle, decoding is required. The user's decoding error rate can be expressed as:

[0089]

[0090] in, , This represents the decoding error rate of user 1 and the decoding error rate of user 2 under the NOMA-RS strategy; User Decoded stream Error rate, User Decoded stream Error rate, It is a user 2 decoding stream Error rate. , This represents the user 1 decoding stream under the NOMA-RS strategy. Error rate and user 2 decoding stream Error rate; , This represents the user 1 decoding stream under the NOMA-RS strategy. Error rate and user 2 decoding stream decoding stream Error rate; This indicates the user 2 decoding stream under the NOMA-RS strategy. Error rate Consider the third strategy, Hybrid-RS. Assign it to the upper layer flow. The power is Assigned to the lower layer flow and The power is Meanwhile, the lower laminar flow and Shared code length, the allocated code lengths are as follows: and Receiver user The received signal is:

[0091]

[0092] The user uses SIC for decoding. Assume the signal strength order is as follows: Therefore, the SIC decoding order is as follows: .

[0093] First, users Will All are considered interference, decode The signal-to-interference-plus-noise ratio (SINR) of the data stream is:

[0094]

[0095] decoding Then, the signal is removed from the received signal via SIC. Decode simultaneously The signal-to-interference-plus-noise ratio (SNR) of the data stream is:

[0096]

[0097] Under the Hybrid-RS strategy, decoding errors can be categorized into two types: (1) decoding stream errors. Error; (2) Decoding stream Correct, but the decoded stream Error or decoded stream Error. Due to user 1's message encoding in the stream. In the stream, user 2's message encoding is... In this context, the user's decoding error rate can be expressed as:

[0098]

[0099] in, User Decoded stream Error rate, It is the user 1 decoding stream Error rate, It is a user 2 decoding stream Error rate. , These are the decoding error rates for user 1 and user 2 under the Hybrid-RS strategy, respectively. , These are the decoding streams for User 1 under the Hybrid-RS strategy. Error rate and user 2 decoding stream Error rate; , These are the decoding streams for User 1 under the Hybrid-RS strategy. Error rate and user 2 decoding stream Error rate.

[0100] Preferably, step S2 aims to achieve the optimal weighted reliability under a finite code length domain, meeting the requirements of high reliability and low latency. Specifically, it selects the optimal RSMA strategy to minimize the overall system error probability. To reflect the different service quality requirements of various users, a non-negative reliability weighting factor is introduced. and ,satisfy Accordingly, the user's weighted decoding error rate is characterized as follows: The reliability of a system can be measured by the maximum user-weighted decoding error rate, i.e. For each , Includes corresponding optimization variables and :

[0101]

[0102] express The feasible region. Then the corresponding optimization problem of finding the optimal strategy to minimize the maximum user-weighted decoding error rate of the system can be expressed as:

[0103]

[0104] Among these, constraints guarantee the quality of service for each stream. It is the set error rate threshold. It is a set of three rate-division multiple access strategies. It is one of the strategies; It is a set of optimization variables for three strategies. It is an optimization variable for one of the strategies; Represents a set of users. It is the index of the users; A set representing a stream, It is the index of the stream; Indicates user The weights, including the weight of user 1. Weight of User 2 ; Indicates a certain strategy Next user The decoding error rate, including the user 1 decoding error rate under the OMA-RS strategy. Decoding error rate of User 2 Decoding error rate of User 1 under NOMA-RS strategy Decoding error rate of User 2 Decoding error rate of 1 user under Hybrid-RS strategy Decoding error rate of User 2 ; Indicates a certain strategy Next user Decoded stream Error rate, including user 1 decoding stream under OMA-RS strategy Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate User 2 decoding stream Error rate Including the user 1 decoding stream under the NOMA-RS strategy. Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate and User 2 decoding stream decoding stream Error rate User 2 decoding stream Error rate ; Including user 1 decoding stream under Hybrid-RS strategy Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate User 2 decoding stream Error rate ; This represents the threshold error probability.

[0105] Preferably, the optimization problem in step S2 is not convex. First, the overall problem (OP) is broken down into three sub-problems:

[0106]

[0107]

[0108]

[0109] in, It is the flow allocated under the OMA-RS strategy The length of the code, Represents their set, It is the maximum available code length; It is the flow allocated under the NOMA-RS strategy power, Represents their set, This is the maximum transmission power of the base station; It is the allocation of the stream under the Hybrid-RS strategy The length of the code, Represents their set, It is the Hybrid-RS strategy that allocates to the upper layer flow. and lower layer flow power, This represents their set.

[0110] Introducing slack variables The min max problem is transformed into a min problem. Meanwhile, since the code length is an integer, it is relaxed to the real number domain:

[0111]

[0112]

[0113]

[0114] Existing technologies and research have proven the following theorem:

[0115] Theorem 1: In short code transmission, the error rate is jointly convex with respect to both code length and transmit power, i.e. right Convex, if signal-to-noise ratio .

[0116] Theorem 1 shows that the transmission error rate of a single stream is jointly convex with respect to code length and transmit power. Observe the constraints in the transformed subproblem. This item actually contains the error rate of a single data stream. The product of . Therefore, it is not convex. To address this, a first-order Taylor approximation is performed in the nth iteration:

[0117]

[0118] thus, It can be represented as:

[0119]

[0120] Through these approximations, the non-convex terms in the constraints are transformed into convex ones. The final optimization problem is:

[0121]

[0122]

[0123]

[0124] in, It is a Taylor approximation of the error rate, and the specific approximation is as follows:

[0125]

[0126]

[0127] Therefore, the subproblem is already a convex problem, which can be solved using convex optimization tools.

[0128] Corollary 1: Problems (ORS-P2), (NRS-P2), and (HRS-P2) are all convex.

[0129] Proof: Taking problem (ORS-P2) as an example, according to Taylor approximation,

[0130]

[0131] Among them, if but ,like but According to Theorem 1, It is convex. Due to the weights , It is convex, meaning the objective function is convex. It's easy to further deduce that all constraints are also convex. Therefore, problem (ORS-P2) is convex. The analysis of problems (NRS-P2) and (HRS-P2) is similar to that of (ORS-P2), and convexity can also be derived.

[0132] It can be deduced that the three subproblems constructed in the end are all convex and can be solved using standard convex optimization tools. For each strategy, the required parameters are first initialized, and then iterative solutions are performed. Taking problem (ORS-P2) as an example, in the nth iteration, the variable results of the (n-1)th iteration are used for solving until convergence tolerance is reached. Simultaneously, the code length variable in problems (ORS-P2) and (HRS-P2) is relaxed from integers to the real number domain. After obtaining the real number solution for the code length, the final integer solution is obtained by comparing adjacent integers.

[0133] in, The real code length solutions to problems (ORS-P2) and (HRS-P2) are... It is the lower bound integer of the corresponding real number solution. It is an integer upper bound of the corresponding real number solution. include and , which are the error rate slack variables for problems (ORS-P2) and (HRS-P2) when the code length is an integer, respectively.

[0134] The specific algorithm is as follows:

[0135] Step 1: Traverse all strategies: For each predefined resource allocation strategy (such as ORS / NRS, etc.), execute the following optimization process.

[0136] Step 2 Initialize parameters: Initialize the number of iterations, slack variables, code length, power, and convergence tolerance: Set the initial state:

[0137] Step 3: Begin the iterative loop and repeat the following sub-steps until convergence:

[0138] Solving the ORS-P2 subproblem: using Solve problem ORS-P2 to obtain Update the slack variables and power based on the solution of ORS-P2.

[0139] Solving the NRS-P2 subproblem: using Solve problem NRS-P2 to obtain .

[0140] use Solving the optimization problem (HRS-P2), we obtain... ;

[0141] renew ;

[0142] like If the iteration ends, then repeat Step 3-9.

[0143] like ,but

[0144] The obtained real number Based on the integer optimization problem, the final integer solution is obtained. and the integer solutions corresponding to ;

[0145] To obtain the optimal strategy

[0146] Example 2

[0147] This embodiment provides an optimal rate segmentation system for improving weighted reliability in short packet communication, characterized by comprising:

[0148] Communication model construction module: It is used to establish a communication model based on rate segmentation multiple access for downlink communication scenarios where a single base station serves two users. The communication model includes multiple rate segmentation strategies and uses the finite code length field theory to characterize the error probability of a user decoding a single stream.

[0149] Optimization Problem Construction Module: It is used to construct an optimization problem based on the decoding error probability of the user terminal, which minimizes the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables;

[0150] Convex constraint optimization module: It is used to introduce relaxation variables, code length integer field relaxation and Taylor approximation method to transform the non-convex constraints in the optimization problem into convex constraints and construct the convex constraint optimization problem;

[0151] The solution module is used to solve the convex constraint optimization problem using an iterative algorithm based on continuous convex approximation, and obtain the optimal power allocation scheme, code length allocation scheme and rate segmentation strategy.

[0152] It should be understood that any parts not described in detail in this specification belong to the prior art.

[0153] It should be understood that the above description of the preferred embodiments is quite detailed, but this should not be construed as limiting the scope of protection of this invention. It is neither necessary nor possible to exhaustively describe all possible implementations. Those skilled in the art, guided by this invention, can make substitutions or modifications without departing from the scope of the claims, all of which fall within the scope of protection of this invention. The scope of protection of this invention should be determined by the appended claims.

Claims

1. An optimal rate segmentation method for improving reliability in short packet communication, characterized in that, The steps include: Step S1: For the downlink communication scenario of a single base station serving two users, a communication model based on rate segmentation multiple access is established. The communication model includes multiple rate segmentation strategies and uses the finite code length field theory to characterize the error probability of a user decoding a single stream. Rate segmentation strategies include: Orthogonal Rate Segmentation Multiple Access (OMA-RS): user messages are segmented into public and private streams, each stream uses orthogonal resource transmission, and multiple access is achieved by allocating different code lengths; Non-Orthogonal Rate Segmentation Multiple Access (NOMA-RS): each stream shares code length resources, non-orthogonal transmission is achieved by allocating different powers, and continuous interference cancellation decoding is used; Hybrid Rate Segmentation Multiple Access (Hybrid-RS): public streams are independently allocated code lengths and powers, while private streams share code lengths and are allocated power. Step S2: Based on the decoding error probability of the user terminal, an optimization problem is constructed to minimize the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables; the optimization problem to minimize the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables is: in, It is a set of three rate-division multiple access strategies. It is one of the strategies; It is a set of optimization variables for three strategies. It is an optimization variable for one of the strategies; Represents a set of users. It is the index of the users; A set representing a stream, It is the index of the stream; Indicates user The weights, including the weight of user 1. Weight of User 2 ； Indicates a certain strategy Next user The decoding error rate, including the user 1 decoding error rate under the OMA-RS strategy. Decoding error rate of User 2 Decoding error rate of User 1 under NOMA-RS strategy Decoding error rate of User 2 Decoding error rate of 1 user under Hybrid-RS strategy Decoding error rate of User 2 ； Indicates a certain strategy Next user Decoded stream Error rate, including user 1 decoding stream under OMA-RS strategy Error rate Decoding stream with user 2 error rate User 1 decoding stream Error rate User 2 decoding stream Error rate Including the user 1 decoding stream under the NOMA-RS strategy. Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate Decoding stream with user 2 Error rate User 2 decoding stream Error rate ; Including user 1 decoding stream under Hybrid-RS strategy Error rate Decoding stream with user 2 Error rate User 1 decoding stream Error rate User 2 decoding stream Error rate ； The threshold error probability is represented; Step S3: Introduce slack variables, code length integer field relaxation and Taylor approximation method to transform the non-convex constraints in the optimization problem into convex constraints and construct a convex constraint optimization problem; Step S4: Use an iterative algorithm based on continuous convex approximation to solve the convex constraint optimization problem and obtain the optimal power allocation scheme, code length allocation scheme and rate segmentation strategy.

2. The optimal rate segmentation method for improving reliability in short packet communication according to claim 1, characterized in that, The error probability of the user decoding a single stream in step S1 is: in, The error probability of decoding a single stream for the user. It is the tail distribution function of the standard normal distribution, and its standard definition is... ， The signal-to-interference-plus-noise ratio (SINR) or SNR of the data stream. The length of the encoded block used for the data stream, The coding rate corresponding to the data stream. Channel dispersion depends on the signal-to-noise ratio. This refers to the channel transmission capacity.

3. The optimal rate segmentation method for improving reliability in short packet communication according to claim 1, characterized in that, Step S3 includes: Step S3.1 Decomposing the optimization problem of minimizing the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables into three sub-problems; Step S3.2 Introducing slack variables to transform the min max problem into a min problem; Step S3.3 Transforming the non-convex constraints in the optimization problem into convex constraints based on the Taylor approximation method to construct a convex constraint optimization problem.

4. The optimal rate segmentation method for improving reliability in short packet communication according to claim 3, characterized in that, The three sub-problems are as follows: in, It is the flow allocated under the OMA-RS strategy The length of the code, Represents their set, It is the maximum available code length; It is the flow allocated under the NOMA-RS strategy power, Represents their set, This is the maximum transmission power of the base station; It is the allocation of the stream under the Hybrid-RS strategy The length of the code, Represents their set, It is the Hybrid-RS strategy that allocates to the upper layer flow. and lower layer flow power, This represents their set.

5. The optimal rate segmentation method for improving reliability in short packet communication according to claim 4, characterized in that, Introducing slack variables transforms the min max problem into a min problem: in, The introduced slack variables transform the problem into a min problem; simultaneously, the code length variables in (ORS-P1) and (HRS-P1) are... Relax from the integer field to the real number field.

6. The optimal rate segmentation method for improving reliability in short packet communication according to claim 4, characterized in that, The convex constraint optimization problem is: in, It is a Taylor approximation of the error rate; for The result of relaxing from the integer field to the real field is obtained by comparing adjacent integer solutions to arrive at the final solution. ： The real code length solutions to problems (ORS-P2) and (HRS-P2) are... It is the lower bound integer of the corresponding real number solution. It is the upper bound of the corresponding real number solution. include and , which are the error rate slack variables for problems (ORS-P2) and (HRS-P2) when the code length is an integer, respectively.

7. The optimal rate segmentation method for improving reliability in short packet communication according to claim 4, characterized in that, Step S4 includes: for each strategy, first initialize the required parameters, then perform iterative solution until convergence tolerance is reached, obtain real solutions with the same code length, and obtain the final integer solution by comparing adjacent integers.

8. An optimal rate segmentation system for improving reliability in short packet communication, characterized in that, include: The communication model construction module is used to establish a rate-segmented multiple access (RSMA) communication model for downlink communication scenarios where a single base station serves two users. This model includes multiple rate segmentation strategies and utilizes finite code length field theory to characterize the error probability of a user decoding a single stream. The optimization problem construction module is used to construct an optimization problem based on the user's decoding error probability, minimizing the maximum user-weighted decoding error rate with power allocation and code length allocation as optimization variables. The convex constraint optimization module introduces relaxation variables, code length integer field relaxation, and Taylor approximation to transform the non-convex constraints in the optimization problem into convex constraints, thus constructing a convex constraint optimization problem. The solution module uses an iterative algorithm based on continuous convex approximation to solve the convex constraint optimization problem, obtaining the optimal power allocation scheme, code length allocation scheme, and rate segmentation strategy. The optimal rate segmentation system for improving reliability in short packet communication is used to execute the steps in the optimal rate segmentation method for improving reliability in short packet communication as described in any one of claims 1-7.

Images