WO2023240804A1

WO2023240804A1 - Data processing method and apparatus

Info

Publication number: WO2023240804A1
Application number: PCT/CN2022/116883
Authority: WO
Inventors: 付凯; 王键; 余展
Original assignee: 华为技术有限公司
Priority date: 2022-06-14
Filing date: 2022-09-02
Publication date: 2023-12-21

Abstract

The embodiments of the present application relates to the technical field of operating systems. Provided are a data processing method and apparatus. By means of the method, data to be coded can be segmented according to the actual code rates of code blocks, such that the number of segments is reduced, and reception performance for the code blocks can be improved.

Description

Data processing methods and devices

This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on June 14, 2022, with application number 202210669345.0 and the application title "Data Processing Method", the entire content of which is incorporated into this application by reference.

Technical field

The embodiments of the present application relate to the field of communication technology, and in particular, to a data processing method and device.

Background technique

Channel coding is one of the important technologies in communication systems to improve receiving sensitivity and anti-interference performance. Polar code is a coding method that has been theoretically proven to reach the Shannon limit, making polar code (also called Polar code) widely used in communication systems. For example, in the 5G standard, Polar code is used as the encoding method for the control channel; in other communication standards, Polar code is used as the encoding method for both control information (Header) and data information (Payload).

In order to take into account both performance and resource overhead, for any length of data to be transmitted (such as the above information bits to be encoded), the sending end can segmentally encode the data to be transmitted.

The current segmented coding scheme has a large number of segments, which affects the reception performance of the coding results.

Contents of the invention

In order to solve the above technical problems, this application provides a data processing method and device. When segmenting data in this method, the number of segmented segments of partial code lengths can be controlled to 2 or less to reduce the number of segments and improve the reception performance of the code block.

In a possible implementation, this application provides a data processing method. The method includes: obtaining first data; performing segmentation processing on the first data to obtain a target segmentation result, wherein the target segmentation result corresponds to n code lengths, and the n code lengths are divided into the largest code lengths. The number of segments corresponding to each code length other than the long code length and the minimum code length is less than or equal to 2, where n is an integer and n≥2.

Exemplarily, the method can be applied to a communication device. For example, the communication device is used as the sending end for illustration.

For example, the first data may be data to be encoded, and when the sending end performs polar code encoding on the first data, the data to be encoded may be segmented.

For example, when the sending end segments the first data, the system or the user can configure n code lengths.

For example, the system can be configured with a maximum code length of 2 ^b bits and a minimum code length of 2 ^a bits, where a and b are positive integers, and a<b. For example, the maximum value of n is (b-a+1).

For example, the target segmentation result may include multiple data segments obtained by dividing the first data, or may include multiple code blocks after zero-padding each data segment according to the corresponding code length. This application does not do this. limit. For example, the segmentation included in the target segmentation result is a code block.

For example, this application does not limit the number of segments corresponding to the largest code length among n code lengths.

In the embodiment of the present application, when segmenting data, the sending end can control the number of segments corresponding to code lengths other than the maximum code length and the minimum code length among the n code lengths, so that the segmentation results are The number of segments corresponding to each code length except the maximum code length and the minimum code length is 2 or less, thereby reducing the total number of data segments and reducing the Polar encoding result of the segmentation results at the receiving end. decoding error rate and optimize data reception performance.

In a possible implementation, performing segmentation processing on the first data to obtain the target segmentation result includes: in descending order of the n code lengths, based on the first data The remaining number of information bits to be segmented in the first data is segmented to obtain the target segmentation result.

In this embodiment of the present application, the sending end can combine the remaining number of information bits to be segmented in the first data to segment the first data in order of n code lengths from large to small; During the segmentation process, each time the first data is segmented based on a code length, the number of remaining information bits to be segmented in the first data can be updated, so that the data of each code length is segmented. When, the segmentation process is performed according to the latest remaining number of information bits to be segmented, so as to give priority to segmenting the first data with a larger code length, so as to maximize the reduction of the number of n code lengths corresponding to the smaller code length. Number of segments. In this way, while reducing the number of segments (also called the number of segments), the reception delay and decoding delay of the encoding result of the segmentation result of the present application can be reduced at the receiving end, and the data reception delay of the receiving end can be effectively reduced.

In a possible implementation, the first data is segmented based on the remaining number of information bits to be segmented in the first data in descending order of the n code lengths. Processing to obtain the target segmentation result, including: in descending order of the n code lengths, the number of first information bits required to be included in the segment corresponding to the i-th code length among the n code lengths , and the remaining number of information bits to be segmented K _m in the first data, determine the maximum number of segments j corresponding to the i-th code length; according to the maximum number of segments corresponding to the i-th code length The number of segments j is to perform segmentation processing on the first data to obtain the target segmentation result, where the number of segments corresponding to the i-th code length is j; where 1≤i≤n, i, j are both Positive integer.

For example, the preset code length may include: 1024bit, 512bit, 256bit, 128bit, and 64bit.

For example, the n code lengths corresponding to the target segmentation result may be all of the above preset code lengths, or may be part of the preset code lengths, which may be flexibly determined based on the number of information bits of the first data and/or application requirements. , this application does not limit this.

For example, the number of information bits required to be included in the segments corresponding to each preset code length are: K ₁₀₂₄ , K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , and K ₆₄ .

For example, K ₁₀₂₄ represents the number of information bits that a code block with a code length of 1024 bits needs to include.

For example, K ₅₁₂ represents the number of information bits that a code block with a code length of 512 bits needs to include.

For example, K ₂₅₆ represents the number of information bits that a code block with a code length of 256 bits needs to include.

For example, K ₁₂₈ represents the number of information bits that a code block with a code length of 128 bits needs to include.

For example, K ₆₄ represents the number of information bits that a code block with a code length of 64 bits needs to include.

For example, the method for determining the number of segments N ₁₀₂₄ corresponding to a code length of 1024 bits is used as an example to illustrate:

Exemplarily, in this implementation, N ₁₀₂₄ (corresponding to the maximum number of segments j of the i-th code length, where i=1, j=N ₁₀₂₄ ,) is determined by including but not limited to any one of the following formulas: Implementation method:

or,

wait.

Among them, p is the minimum number of information bits required to be included in the segment with the minimum code length.

For example, in this embodiment, after N ₁₀₂₄ is determined, K _m can be updated, and the updated K _m =K _m before the update -N ₁₀₂₄ *K ₁₀₂₄ .

Exemplarily, in this _embodiment , after N ₁₀₂₄ is determined, N ₅₁₂ (corresponding to the maximum number of segments j of the i-th code length, where i=2, j= The determination method of N ₅₁₂ ,) includes but is not limited to the implementation of any of the following formulas:

or,

wait.

The method for determining the number of segments corresponding to other code lengths is similar to the principle of the above example, and is based on the remaining information bits to be segmented in the first data, which will not be described again here.

In the embodiment of the present application, when segmenting the first data, priority can be given to segmenting code blocks with longer code lengths, and when determining the number of segments for each code length, all based on the first data The remaining information bits to be segmented and the number of information bits that need to be included in the segment corresponding to the code length are used to determine the maximum number of segments corresponding to the code length, and more information bits in the first data can be segmented into Corresponds to code blocks with larger code lengths, thereby reducing the number of segments corresponding to smaller code lengths to reduce the total number of segments.

In a possible implementation, the first information bits required to be included in the segment corresponding to the i-th code length among the n code lengths are determined in descending order of the n code lengths. number, and the remaining number of information bits to be segmented in the first data, determining the maximum number of segmented segments j corresponding to the i-th code length, including: in order from largest to smallest of the n code lengths, Based on the number of first information bits required to be included in the segment corresponding to the i-th code length among the n code lengths, and, the remainder of the first data to be allocated to the second bit of the i-th code length The number of information bits determines the maximum number of segments j corresponding to the i-th code length; wherein the second number of information bits is the number of remaining information bits to be segmented and the third number of information bits in the first data The difference; wherein, the third number of information bits is the sum of the number of information bits required to be included in the segment corresponding to each fourth code length; wherein, the fourth code length is The code length in is smaller than the i-th code length.

For example, combined with the above embodiments, N ₁₀₂₄ can be determined by the following formula:

or,

Exemplarily, in this _embodiment , after N ₁₀₂₄ is determined, N ₅₁₂ (corresponding to the maximum number of segments j of the i-th code length, where i=2, j= N ₅₁₂ ,), which can be achieved through the following formula:

or,

The method for determining the number of segments corresponding to other code lengths is similar to the principle of the above example, and will not be described again here.

In the embodiment of the present application, when segmenting the first data, priority can be given to segmenting code blocks with longer code lengths, and when determining the number of segments for the i-th code length, n can be ensured In a scenario where each fourth code length among the code lengths smaller than the i-th code length can be divided into at least one corresponding segment from the first data, the remainder of the first data can be allocated to The information bits of the i-th code length to be segmented are used to determine the maximum number of segments corresponding to the i-th code length, so that each preset code length corresponds to at least one segment, and the target segmentation result corresponds to The n code lengths can be gradually and continuously reduced from large to small to reduce the reception delay of the encoded data of the segmentation results, and to improve the reception performance by reducing the total number of segments.

In a possible implementation, performing segmentation processing on the first data to obtain a target segmentation result includes: obtaining an initial segmentation result corresponding to the first data; If the result includes a first segment with a segment number greater than or equal to 2, merge at least two of the first segments into at least one second segment with a second code length to obtain the target segmentation result, where The first segment corresponds to the same first code length, and the second code length is greater than the first code length.

For example, the sending end can combine the code blocks with the same first code length in the initial segmentation result to merge them into code blocks with a longer code length to obtain the target segmentation result.

For example, the sending end can combine two code blocks with a code length of 64 bits in the initial segmentation result into one code block with a code length of 128 bits.

Embodiments of the present application can obtain the initial segmentation results of the data to be encoded, and merge segments corresponding to code lengths with a number of segments greater than or equal to 2 in the initial segmentation results, thereby reducing the number of segments and optimizing reception performance.

In a possible implementation, merging at least two of the first segments into a second segment with a second code length includes: merging the initial segments in order of code length from small to large. At least two of the first segments in the result are merged into a second segment of a second code length.

In this embodiment of the present application, the sending end can merge at least two segments with the same code length in the initial segmentation result in ascending order of the code lengths corresponding to the initial segmentation result, thereby progressively Continuously reducing the number of segments with smaller code lengths can not only improve the merging efficiency of segments, but also improve the coding efficiency. Optionally, it can also be ensured that the merged segments are still sorted according to code length from large to small, thereby reducing the reception delay.

In a possible implementation, merging at least two of the first segments into a second segment of a second code length includes: combining at least two of the first segments and a target number of information bits, combined into a second segment of a second code length; wherein the target number of information bits comes from: a third segment of a third code length corresponding to the initial segmentation result, wherein the third The code length is smaller than the first code length.

In the embodiment of the present application, when merging the segments in the segmentation result, a target number of information bits can be taken from the segments with smaller code lengths to merge them with at least two first segments into a merged form. It is the second segment with a larger code length.

In a possible implementation, the initial segmentation results are arranged in descending order of code length.

In this embodiment of the present application, the segments corresponding to the initial segmentation result of the data to be encoded obtained by the sending end can be arranged in order from large to small in code length, thereby obtaining the initial segmentation in which the code length gradually decreases from large to small. segmentation in the segmentation result; then after merging the segments in the initial segmentation result, the segments corresponding to the obtained target segmentation result can also be arranged in the order of gradually decreasing code length from large to small, so that , which can reduce the reception delay of the encoded data of the target segmentation result.

In a possible implementation, the at least two first segments are arranged adjacently in the initial segmentation result.

In the embodiment of the present application, the sending end can merge at least two adjacent segments in the initial segmentation result, so that after the merging operation, the size of each code length corresponding to the target segmentation result obtained can be The order is consistent with the size order of each code length corresponding to the initial segmentation result. It can reduce the number of segments and optionally minimize the impact of decoding delay and transmission delay on the overall system time of the receiving end. The impact of delay can be minimized to reduce the system delay at the receiving end.

In a possible implementation, the second code length is twice the first code length.

In this embodiment of the present application, the sending end may merge at least two segments in the initial segmentation result into adjacent segments with a higher level code length. For example, the level adjacent to the 64-bit code length includes 128 bits and 32 bits, so that after the merging operation, the size order of n code lengths corresponding to the target segmentation results obtained gradually and continuously decreases from large to small, and can be merged step by step when merging segments. This can not only minimize the number of segments, but also minimize the impact of decoding delay and transmission delay on the overall system delay at the receiving end, thereby minimizing the system delay at the receiving end.

In a possible implementation, the first code length is a code length other than the maximum code length among the n code lengths.

For example, when merging the segments in the initial segmentation result, the sending end may detect each code length except the maximum code length in order of the code lengths corresponding to the initial segmentation result from small to large. The number of segments, thereby sequentially merging at least two segments with the same code length except the maximum code length, without changing the maximum code length of the segmentation results to improve reception performance.

In a possible implementation, the minimum code length among the n code lengths, and the number of information bits included in the corresponding segment in the target segmentation result is greater than or equal to p, where p is a positive integer, The number of segments corresponding to the minimum code length is less than or equal to 3.

For example, p can be a positive integer greater than or equal to 1. The specific value of p can be flexibly configured according to application requirements or actual scenarios, and this application does not limit this.

For example, the number of information bits required for the segment corresponding to the minimum code length in the target segmentation result is greater than or equal to p. Then, under the condition that this condition is restricted, in a possible implementation, the minimum code length The number of segments can be 3. In another possible implementation, if there is no condition that the number of information bits corresponding to the minimum code length is greater than or equal to p, the number of segments corresponding to the minimum code length may be less than or equal to 2.

For example, in the embodiment of Figure 5a, for example, a 64-bit code block requiring a minimum code length needs to include at least 13 bits (here p = 13) of information bits, and for example, K ₆₄ =20, then the division shown in Figure 5a (4) In the segment result corresponding to the target segmentation result, the code block 20 is changed into two code blocks with a code length of 64 bits. Then there are 3 64-bit code blocks with the minimum code length in the target segmentation result, and the last 64-bit code block includes 13 bits.

In a possible implementation, the target segmentation results are arranged in descending order of the n code lengths.

The embodiments of the present application segment the data to be encoded according to the actual code rate, which can reduce the number of segments and at the same time reduce the delay when the receiving end receives and decodes the encoding results corresponding to the segmented results of the present application, which can effectively reduce The delay at the receiving end.

In a possible implementation, the present application provides a data processing device. The data processing device includes: a first acquisition module, used to acquire first data; a segmentation module, used to segment the first data and obtain a target segmentation result, wherein the target segmentation result corresponds to There are n code lengths, and the number of segments corresponding to each code length except the maximum code length and the minimum code length among the n code lengths is less than or equal to 2, where n is an integer and n≥2.

In a possible implementation, the segmentation module is specifically configured to segment the n code lengths in descending order based on the remaining number of information bits to be segmented in the first data. Perform segmentation processing on the first data to obtain target segmentation results.

In a possible implementation, the segmentation module is specifically configured to: in descending order of the n code lengths, based on the segmentation corresponding to the i-th code length among the n code lengths The number of information bits required to be included, and the remaining number of information bits to be segmented in the first data, determine the maximum number of segmented segments j corresponding to the i-th code length; according to the above, the maximum number j corresponding to the i-th code length is determined The maximum number of segmented segments is j, perform segmentation processing on the first data, and obtain the target segmentation result, where the number of segmented segments corresponding to the i-th code length is j; where 1≤i≤n, i and j are both positive integers.

In a possible implementation, the segmentation module is specifically configured to perform segmentation based on the segment corresponding to the i-th code length among the n code lengths in order from large to small. The number of first information bits to be included, and the number of second information bits remaining in the first data to be allocated to the i-th code length, determine the maximum number of segments corresponding to the i-th code length. j; wherein the second number of information bits is the difference between the remaining number of information bits to be segmented in the first data and the number of third information bits; wherein the third number of information bits is each fourth The sum of the number of information bits required to be included in the segment corresponding to the code length; wherein, the fourth code length is a code length smaller than the i-th code length among the n code lengths.

In a possible implementation, the segmentation module is specifically configured to: obtain an initial segmentation result corresponding to the first data; where the initial segmentation result includes a first segmentation result with a segment number greater than or equal to 2. In the case of segments, merge at least two of the first segments into at least one second segment of the second code length to obtain the target segmentation result, wherein the first segments correspond to the same first code length , the second code length is longer than the first code length.

In a possible implementation, the segmentation module is specifically configured to merge at least two of the first segments in the initial segmentation results into a second code in order of code length from small to large. Long second segment.

In a possible implementation, the segmentation module is specifically configured to combine at least two of the first segments and a target number of information bits into a second segment of the second code length; wherein, The target number of information bits comes from: a third segment with a third code length corresponding to the initial segmentation result, wherein the third code length is smaller than the first code length.

The effects of the data processing apparatus in the above embodiments are similar to the effects of the data processing methods in the above embodiments, and will not be described again here.

In a possible implementation, the present application provides a data processing device. The data processing device includes one or more interface circuits and one or more processors; the interface circuit is used to receive signals from a memory and send the signals to the processor, where the signals include computer data stored in the memory. Instructions; when the processor executes the computer instructions, the processor can implement the data processing method in any of the above embodiments.

The effects of the data processing device of this embodiment are similar to the effects of the data processing methods of the above embodiments, and will not be described again here.

In a possible implementation, the present application provides a computer-readable storage medium. The computer-readable storage medium stores a computer program. When the computer program is run on a computer or processor, it causes the computer or processor to execute the data processing method in any of the above embodiments.

The effect of the computer-readable storage medium in this embodiment is similar to the effect of the data processing method in each of the above embodiments, and will not be described again here.

In a possible implementation manner, the present application provides a computer program product. The computer program product includes a software program. When the software program is executed by a computer or processor, the data processing method in any of the above embodiments is executed.

The effects of the computer program product of this embodiment are similar to the effects of the data processing methods of the above embodiments, and will not be described again here.

Description of the drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the drawings needed to be used in the description of the embodiments of the present application will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application. , for those of ordinary skill in the art, other drawings can also be obtained based on these drawings without exerting creative labor.

Figure 1 is a schematic diagram of an exemplary Polar code encoding process;

Figure 2 is an exemplary system interaction diagram of the present application;

Figure 3 is an exemplary timing diagram of the receiving end receiving data;

Figure 4 is a schematic process diagram illustrating the segmentation method of the present application;

Figure 5a is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 5b is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 5c is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 5d is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 5e is an exemplary segmented schematic diagram of the segmented method of the present application;

Figure 5f is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 5g is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 5h is an exemplary segmented schematic diagram of the segmented method of the present application;

Figure 6 is a segmented schematic diagram illustrating the segmentation method of the present application;

Figure 7a is a schematic diagram illustrating segmentation results of a segmentation method in the prior art;

Figure 7b is a schematic diagram illustrating the segmentation results of the segmentation method of the present application;

Figure 8 is an exemplary schematic diagram illustrating the optimization of the segmentation results of the segmentation method of the present application compared with the segmentation method in the prior art;

Figure 9a is a schematic diagram illustrating the optimization of the segmentation results of the segmentation method of the present application compared with the segmentation method in the prior art;

Figure 9b is a schematic diagram illustrating the packet loss of the segmentation results of the segmentation method of the present application and the segmentation results of the segmentation method in the prior art;

Figure 10 is a schematic structural diagram of a device provided by an embodiment of the present application;

Figure 11 is a schematic structural diagram of a chip provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the scope of protection of this application.

The term "and/or" in this article is just an association relationship that describes related objects, indicating that three relationships can exist. For example, A and/or B can mean: A exists alone, A and B exist simultaneously, and they exist alone. B these three situations.

The terms “first” and “second” in the description and claims of the embodiments of this application are used to distinguish different objects, rather than to describe a specific order of objects. For example, the first target object, the second target object, etc. are used to distinguish different target objects, rather than to describe a specific order of the target objects.

In the embodiments of this application, words such as "exemplary" or "for example" are used to represent examples, illustrations or explanations. Any embodiment or design described as "exemplary" or "such as" in the embodiments of the present application is not to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the words "exemplary" or "such as" is intended to present the concept in a concrete manner.

In the description of the embodiments of this application, unless otherwise specified, the meaning of “plurality” refers to two or more. For example, multiple processing units refer to two or more processing units; multiple systems refer to two or more systems.

Polar codes are linear block codes, and the length of the mother code (such as y in Formula 1) is an integer power of 2. The encoding process of Polar code can be expressed by formula 1:

y＝x·F _N , formula 1;

Among them, in Formula 1, F _N is a generating matrix of NxN, where the order of F _N is N; x is a one-dimensional vector after zero padding of the information bits to be encoded, and the length of x is N. y is the code obtained after encoding x, with length N.

Exemplarily, FIG. 1 is a schematic diagram illustrating the encoding process of Polar code.

Illustratively, as shown in Figure 1, {u1, u2, u3, u4} are information bits to be encoded with a length of 4, where each ui in u1, u2, u3, u4 is 0 or 1, where, 1≤i≤4, i is an integer.

For example, the length of the mother code is 8, and N in Formula 1 is 8.

For example, as shown in Figure 1, the process of encoding a Polar code with a mother code length of 8 may include: complementing the information bits to be encoded {u1, u2, u3, u4} with a length of 4 with 4 bits of 0, Obtain a vector x={x1,x2,x3,x4,x5,x6,x7,x8} with a length of 8; perform Polar coding on the vector x={x1,x2,x3,x4,x5,x6,x7,x8} The encoding results in a code of length 8 y={y1, y2,...,y8}.

As an example, take the vector x={x1,x2,x3,x4,x5,x6,x7,x8} to be encoded with Polar code and generate y1 as an example:

As shown in Figure 1, the sending end performs an XOR operation on x1 and x2, and obtains the result 31; the sending end performs an XOR operation on x3 and x4, and obtains the result 32; The result is 33; the sending end performs an XOR operation on x5 and x6, and the result is 34; the sending end performs an XOR operation on x7 and x8, and obtains the result 35; the sending end performs an XOR operation on the result 34 and the result 35, and obtains the result 36; The sending end performs an XOR operation on the result 33 and the result 36 to obtain the result 37, where the result 37 is the above-mentioned y1 obtained by Polar encoding. At the sending end, the vector x = {x1, x2, x3, x4, x5, x6, x7, x8} is encoded with Polar code to generate y2 to y8. The principle of generating y1 is similar. Please refer to Figure 1 for details. Again.

The decoding process of Polar code can be understood as the inverse process of Polar code encoding process. The decoding process of Polar code can be expressed by formula 2:

Among them, in formula 2,

is the inverse matrix of the above F _N , where,

The degree of .

Exemplarily, FIG. 2 is an exemplary system interaction diagram of the present application.

For example, the system may include a sending end and a receiving end.

For example, the sending end may transmit Polar-encoded data to the receiving end.

For example, as shown in Figure 2, the transmitting end may include but is not limited to: a data link layer, a first segmentation unit, a coding unit, a combining unit, and a modulation unit.

For example, as shown in Figure 2, the receiving end may include but is not limited to: a demodulation unit, a second segmentation unit, a decoding unit, a transmission unit, and a data link layer.

In this field, the length of the mother code of Polar code is an integer power of 2, and the longer the length of the mother code, the better the performance. However, considering the resource overhead such as the area of the implemented hardware circuit, the length of the mother code cannot be increased without limit. The length of the mother code needs to be determined by taking both performance and resource overhead into consideration.

For example, as shown in Figure 2, the first segmentation unit can be used to segment the data to be transmitted from the data link layer of the sending end based on a certain segmentation method to obtain multiple code blocks.

For example, the data to be transmitted are information bits to be encoded. The first segmentation unit can segment the information bits to be encoded according to the mother code length and code rate to obtain multiple code blocks. For example, a code block includes multiple information bits.

As an example, the target code rate is 1/2, the information bits to be encoded include 896 bits, and the mother code lengths are 1024 bit, 512 bit, 128 bit, and 64 bit respectively:

The first segmentation unit can divide the information bits to be encoded into data segment 1 to data segment 5 according to the 1/2 code rate and the above-mentioned mother code lengths. The code lengths of data segment 1 to data segment 5 are 512bit, 256bit, 64bit, 32bit, 32bit.

For example, the first segmentation unit can perform zero padding on data segment 1 to data segment 5 according to the corresponding mother code length. For example, data segment 1 can be padded with 512 bits of 0 bits to obtain a code block with a code length of 1024 bits. 1. Among them, the pre-encoding code length of code block 1 is 512 bits; similarly, the first segmentation unit can perform zero padding on data segment 2 to data segment 5 according to the corresponding mother code lengths, so that the code lengths are respectively Code block 2 to code block 5 corresponding to the length of the mother code.

For example, the pre-encoding code length of code block 1 is 512 bits, and the post-encoding code length is 1024 bits;

For example, the pre-encoding code length of code block 2 is 256 bits, and the post-encoding code length is 512 bits;

For example, the pre-encoding code length of code block 3 is 64 bits, and the post-encoding code length is 128 bits;

For example, the pre-encoding code length of code block 4 is 32 bits, and the post-encoding code length is 64 bits;

For example, the pre-encoding code length of code block 5 is 32 bits, and the post-encoding code length is 64 bits.

For example, as shown in Figure 2, the encoding unit can be used to perform Polar encoding on each segmented code block to obtain multi-segment codes (also called multiple encoded code blocks).

For example, the encoding unit can perform Polar encoding on the code blocks 1 to 5 whose code lengths are 1024bit, 512bit, 128bit, 64bit, and 64bit respectively after zero padding, thereby obtaining code lengths of 1024bit, 512bit, and 128bit respectively. , 64bit, 64bit multi-segment codes.

It can be understood that the zero-filling operation on the segmented code blocks can also be performed by the encoding unit, and this application does not limit this.

It should be understood that after the sending end segments the information bits to be encoded, it obtains multiple code blocks, and each code block may correspond to a pre-encoding code length and a post-encoding code length. For example, the code length corresponding to the above code block 1 is 512 bits before encoding, and the code length after encoding is 1024 bits.

In addition, it should be understood that, given the length of the mother code, the smaller the code rate, the better the reception performance of the encoded code block. Then, when the sending end segments the information bits to be encoded, there may be at least one code block whose actual code rate is smaller than the above target code rate.

For example, the code length before encoding corresponding to the above code block 2 can be 255 bits, and the code block 2 is still encoded according to the mother code length of 512 bits. Then the sending end can complement the code block 2 with 257 bits of 0 bits. In this way, the code block 2 The actual code rate is the ratio of the code length before encoding and the code length after encoding, here it is (255/512) < (1/2).

For example, as shown in Figure 2, the combining unit can be used to combine multiple segments of codes into one frame of data.

For example, as shown in Figure 2, the modulation unit can be used to modulate a frame of data combined by the combination unit, for example, modulate a digital signal into an analog signal that can be transmitted on a channel.

For example, as shown in Figure 2, the transmitting end can transmit the analog signal modulated by the modulation unit to the receiving end through the channel.

For example, as shown in Figure 2, in the receiving end, the demodulation unit can be used to demodulate the analog signal from the transmitting end to obtain the digital signal to obtain the above-mentioned one frame of data.

For example, as shown in Figure 2, in the receiving end, the second segmentation unit can segment the one frame of data according to the same segmentation method as the first segmentation unit to restore the corresponding The multiple code segments of multiple code blocks.

For example, as shown in Figure 2, every time the receiving end completes receiving a segment of code, the decoding unit can be used to decode the received segment of code to obtain a data segment (here, information bits) corresponding to a code block; transmission The unit can be used to transmit the decoded information bits from the decoding unit to the data link layer to achieve upper layer transmission of data. Then, the decoding unit performs a similar decoding operation on the next code segment received by the receiving end, and the transmission unit performs a similar transmission operation on the information bits corresponding to the next code segment decoded by the decoding unit, until the above frame of data All reception is completed, so that the receiving end completes the decoding of the multi-segment codes corresponding to one frame of data and transmits the decoded data to the upper layer (such as the data link layer).

It should be understood that the various modules and communication connection relationships in the system of the present application shown in Figure 2 are only an example. The system of the present application may have more or fewer units or modules than those shown in the figure, and may be combined and combined. Two or more units or modules, or may have configurations of different units or modules. The various units shown in Figure 2 may be implemented in hardware, software, or a combination of hardware and software including one or more signal processing and/or application specific integrated circuits.

In low-power and low-latency wireless communication systems, the communication system has high requirements for reduced power consumption and ultra-low latency. In terms of hardware circuit implementation, in order to reduce overall power consumption, the system clock is generally relatively low.

Then, in the above-mentioned receiving end shown in Figure 2, the time required for the receiving end (such as the decoding unit shown in Figure 2) to decode each code segment can be called a decoding delay. The time it takes for the receiving end (such as the transmission unit shown in Figure 2) to transmit the decoded information bits to the upper layer (such as the data link layer) is called transmission delay. Since the system clock is relatively low, the decoding delay and transmission delay will be relatively large. If the decoding delay and/or transmission delay are large, it can seriously affect the overall delay of the system, causing the system delay to increase. .

In order to minimize the impact of decoding delay and transmission delay on the overall system delay, the sending end of this application can segment the data to be transmitted based on the low-latency segmentation principle.

Among them, the principle of low-latency segmentation is: segment the data to be transmitted to obtain multiple code blocks, and the code lengths of the multiple code blocks (here refers to the code length after encoding, that is, the mother code length corresponding to the code block) are divided into segments. The sequence (or the bit sequence of the data to be transmitted) gradually and continuously decreases from large to small, and the code block with the minimum mother code length is used as the last code block.

In other words, in the low-latency segmentation principle, among the multiple code blocks obtained by segmentation, the code length of the next-level code block (also called the next-level code block) (here refers to the code length after encoding) is the same as the code length of the previous level code block. The code length of the first-level code block (also called the upper-level code block) (here refers to the code length after encoding) is the same; or, the code length of the next-level code block (here refers to the code length after encoding) is the previous one. Half of the code length of the first-level code block (here refers to the code length after encoding). This allows the code block whose code length is the minimum mother code length to be the last code block. In this way, the data reception time, decoding delay and transmission delay can be parallelized as much as possible to minimize the overall transmission delay of the system. For example, the code block can be used to represent the data segment after segmentation of the data to be transmitted, and the information bits after zero padding according to the length of the corresponding mother code.

For example, among multiple code blocks obtained in segmented order, the previous level code block is adjacent to the next level code block, and the previous level code block is the previous code block of the next level code block, and the next level code block is the previous code block of the next level code block. The first-level code block is the next code block of the previous level code block.

Exemplarily, FIG. 3 is an exemplary timing diagram of the receiving end receiving data.

Exemplarily, in the scenario shown in Figure 2 where the sending end adopts the low-latency segmentation principle to segment the data to be transmitted, Figure 3(1) illustrates an example of how the receiving end receives data in this scenario. Timing diagram.

For example, in a scenario where the sending end shown in Figure 2 does not adopt the above-mentioned low-latency segmentation principle, but uses other segmentation methods to segment the transmission data, Figure 3(2) is an exemplary illustration. The timing diagram of the receiving end receiving data in this scenario.

Combined with Figure 2, Figure 3(1) and Figure 3(2) are described below:

For example, in conjunction with Figure 2, please refer to Figure 3(1). The transmitter uses the above-mentioned low-latency segmentation principle to segment the data to be transmitted to obtain multiple code blocks (code block 1 to code block 5), and The segmented code block rows are encoded to obtain the encoded code 1, code 2, code 3, code 4, and code 5.

For example, when the sender adopts the above-mentioned low-latency segmentation principle to segment the data to be transmitted to obtain multiple code blocks, the transmitter can treat the data to be transmitted based on the given maximum mother code code length and minimum mother code code length. Perform segmentation to obtain multiple data segments, and zero-pad the multiple data segments according to the corresponding mother code length to obtain multiple code blocks whose code lengths are the corresponding mother code lengths. For example, in Figure 3(1), the maximum mother code code length is 1024 bits, and the minimum mother code code length is 64 bits.

For example, as shown in Figure 3(1), code 1 is data with a code length of 1024 bits (the mother code length here is 1024 bits), code 2 is data with a code length of 512 bits, and code 3 is data with a code length of 256 bits. Bit data, code 4 is data with a code length of 128 bits, and code 5 is data with a code length of 64 bits.

Then when the sender segments the data to be transmitted based on the above-mentioned low-latency segmentation principle, given that the maximum mother code length is 1024 bits and the minimum mother-code length is 64 bits, then the sender segments the data to be transmitted based on the above-mentioned low-latency segmentation principle. By segmenting the data, we can obtain code blocks 1 to 5 arranged in bit order: code lengths of 1024 bits, 512 bits, 256 bits, 128 bits, and 64 bits.

For example, when the segmentation result is composed of code blocks 1 to 5 in sequence, the code length of code block 2 as the next level code block is half of the code length of code block 1 of the previous level code block; the same Logically speaking, the code length of code block 3 as the next level code block is half of the code length of code block 2 of the previous level code block, and the code length of code block 3 as the next level code block is the code length of the previous level code block. The code length of code block 2 is half of the code length. The code length of code block 4 as the next level code block is half the code length of code block 3 of the previous level code block; the code block 5 as the next level code block The code length of is half of the code length of code block 4 of the previous level code block. Moreover, in the above segmentation result, the last code block is code block 5 with the minimum mother code length (here, 64 bits).

For example, the sending end may perform Polar code encoding on code block 1 to code block 5 respectively, thereby obtaining corresponding codes 1 to 5.

For example, in conjunction with Figure 2, as shown in Figure 3(1), since the receiving end receives the analog signal corresponding to the data to be transmitted sent by the transmitting end through serial reception, the receiving end can receive code 1 in sequence. to code 5.

For example, as shown in Figure 3(1), the receiving end starts receiving code 1 at time t0 and completes receiving code 1 at time t1.

For example, as shown in Figure 3(1), at time t1, the receiving end not only completes receiving code 1, but also starts receiving code 2, and completes receiving code 2 at time t5.

For example, combined with Figure 2, as shown in Figure 3(1), the receiving end not only starts to receive code 2 from time t1, but also the decoding unit in the receiving end as shown in Figure 2 can start from time t1 to receive code 2. The completed code 1 is decoded, so that the decoding process of code 1 and the receiving process of code 2 can be performed simultaneously.

For example, combined with Figure 2, as shown in Figure 3(1), the decoding unit completes the decoding of code 1 from time t1 to time t3, so that the decoding delay of code 1 corresponds to the time period from t1 to t3.

Exemplarily, combined with Figure 2, as shown in Figure 3(1), every time the decoding unit completes decoding a piece of data (for example, 1 bit) of code 1, the transmission unit shown in Figure 2 can transfer the data that the decoding unit has The decoded 1 bit is transmitted to the data link layer (such as the Media Access Control layer (Medium Access Control, MAC)).

For example, as shown in Figure 3(1), the decoding unit completes the decoding of 1 bit of code 1 at time t2, so that the transmission unit can start from time t2 to transmit the information bits of code 1 decoded by the decoding unit to the MAC layer. transmission.

For example, as shown in Figure 3(1), the transmission unit completes the transmission of the decoded information bits of code 1 to the MAC from time t2 to time t4, so that the transmission delay of code 1 corresponds to the time period from t2 to t4.

Time t3 and time t4 are both before time t5, so that the receiving end can decode code 1 in parallel while receiving code 2 with a code length of 512 bits, and transmit the decoded code 1 data to the data in parallel. link layer. In this way, the data reception delay of code 2, the decoding delay of code 1 and the transmission delay of code 1 (here is the MAC transmission delay) are parallelized as much as possible.

Similarly, as shown in Figure 3(1), the receiving end can receive code 3 in the time period from t5 to t9, and while receiving code 3, it can also process the received code 2 in the time period from t5 to t7 in parallel. Decoding is performed, and in parallel, the decoded information bits of code 2 are transmitted to the data link layer in the time period from t6 to t8. In order to make the data reception delay of code 3, the decoding delay of code 2 and the transmission delay of code 2 parallel as much as possible.

In the same way, as shown in Figure 3(1), the receiving end can receive code 4 in the time period t9 to t11, and while receiving code 4, it can perform processing on the received code 3 in the time period t9 to t11 in parallel. Decoding, and in parallel, transmitting the decoded information bits of code 3 to the data link layer in the time period from t10 to t11. In order to make the data reception delay of code 4, the decoding delay of code 3 and the transmission delay of code 3 parallel as much as possible.

Similarly, as shown in Figure 3(1), the receiving end can receive code 5 in the time period t11 to t12, and while receiving code 5, it can process the received code 4 in parallel in the time period t11 to t12. decoding, and transmitting the decoded information bits of code 4 to the data link layer in parallel within the time period from t11 to t12. In order to make the data reception delay of code 5, the decoding delay of code 4 and the transmission delay of code 4 parallel as much as possible.

For example, as shown in Figure 3(1), after the receiving end completes receiving the 64-bit code 5 at time t12, it can start decoding code 5 at time t12, such as code 5 shown in Figure 3(1). The decoding delay is the decoding time period of code 5 at the receiving end. In the same way, every time the receiving end decodes 1 bit of code 5, it can transmit the decoded information bit to the data link layer. For example, the transmission delay of code 5 shown in Figure 3(1) is The time period during which the information bits of code 5 are transmitted to the data link layer. So that the decoding delay of code 5 and the transmission delay of code 5 are parallel.

In this way, the transmitting end segments the data to be transmitted according to the low-latency segmentation principle and performs Polar code encoding on multiple code blocks after segmentation, so that the receiving end side can determine the data reception time of the code (or code block). , decoding delay and transmission delay are parallelized as much as possible to reduce the overall transmission delay of the system.

For example, in conjunction with Figure 2, please refer to Figure 3(2). The transmitter does not adopt the above-mentioned low-latency segmentation principle, but uses other segmentation principles to segment the data to be transmitted and perform segmentation on the segmented code blocks. Encode to obtain code 1' and code 2'.

For example, as shown in Figure 3(2), code 1' is data with a code length of 1024 bits, and code 2' is data with a code length of 64 bits. The code block sizes after segmentation at the sending end are 1024 bits and 64 bits respectively. Of course, the code blocks segmented and encoded by the sending end can also include other codes received by the receiving end in the time period from t0 to t16. There are no restrictions here. . The following uses code 1’ and code 2’ as examples to explain the data reception and decoding processes at the receiving end.

For example, combined with Figure 2, as shown in Figure 3(2), since the receiving end receives the analog signal corresponding to the data to be transmitted sent by the transmitting end through serial reception, then the receiving end can receive code 1 in sequence 'To code 2'.

For example, as shown in Figure 3(2), the receiving end starts receiving code 1' at time t16, and completes receiving code 1' at time t11.

For example, as shown in Figure 3(2), at time t11, the receiving end not only completes receiving code 1', but also starts receiving code 2', and completes receiving code 2' at time t12.

For example, combined with Figure 2, as shown in Figure 3(2), the receiving end not only starts to receive code 2' from time t11, but also the decoding unit in the receiving end as shown in Figure 2 can start from time t11. The completed code 1' is received and decoded, so that the decoding process of code 1' and the reception process of code 2' can be performed simultaneously.

For example, combined with Figure 2, as shown in Figure 3(2), the decoding unit completes the decoding of code 1' from time t11 to time t14, so that the decoding delay of code 1' corresponds to the time period from t11 to t14.

Exemplarily, combined with Figure 2, as shown in Figure 3(2), every time the decoding unit completes decoding a piece of data (for example, 1 bit (bit)) for code 1', the transmission unit shown in Figure 2 can transfer the decoding unit The decoded 1 bit is transmitted to the data link layer (MAC).

Illustratively, as shown in Figure 3(2), the decoding unit completes the decoding of 1 bit of code 1' at time t13, so that the transmission unit can start decoding the information bits of code 1' decoded by the decoding unit from time t13 to MAC layer transmission.

For example, as shown in Figure 3(2), the transmission unit completes the transmission of the decoded code 1' to the MAC from time t13 to time t15, so that the transmission delay of code 1' corresponds to the time period from t13 to t15.

Since the longer the code length is, the longer the decoding delay of the corresponding code length is. As shown in Figure 3(2), the code length of code 1' is 1024 bits, which is much larger than the 64 bits of code 2', making code 1' The decoding delay and the transmission delay of code 1' both exceed the reception delay (t11 to t12 time period) when the receiving end receives code 2', resulting in the t12 to t12 time period as shown in Figure 3(2). Additional delay overhead in the t15 time period. In other words, after the receiving end completes receiving code 2' at time t12, it still needs to wait for the corresponding time period from t12 to t15 before it can receive the next code. As a result, there is a time difference between the data reception delay of the current code and the decoding delay of the previous received code and the transmission delay of the previous received code, making it impossible to maximize parallel execution.

For example, as shown in Figure 3(2), after the receiving end completes transmitting code 1' to the MAC at time t15, code 2' can be decoded starting from time t15, and the decoded code 2' can be The information bits are transmitted to the MAC, such as the decoding delay of code 2' and the transmission delay of code 2' shown in Figure 3(2).

Comparing Figure 3(1) and Figure 3(2), we can see that since the code length of code 5 and code 2' are the same, both are 64 bits, so the decoding delay of code 5 shown in Figure 3(1) is the same as The decoding delay of code 2' shown in Figure 3(2) is the same, and the transmission delay of code 5 shown in Figure 3(1) is the same as the transmission delay of code 2' shown in Figure 3(2) .

In the scenario where the sender uses other segmentation principles to segment the data to be transmitted and performs Polar encoding as shown in Figure 3(2), compared with the scenario where the sender uses low-latency segmentation as shown in Figure 3(1) In principle, in the scenario where the data to be transmitted is segmented and encoded with Polar codes, the data receiving process at the receiving end shown in Figure 3(2) may generate additional delay overhead in the time period from t12 to t15.

Currently, in the existing technology, a segmentation method based on Polar codes and following the principle of gradually and continuously decreasing from large to small can be implemented based on the target code rate R.

By way of example, the method of segmenting the data part of wireless frame format 2 in the prior art will be described as an example.

The input bit sequence (for example, the information bits to be encoded) is represented by b ₀ , b ₁ , b ₂ , b ₃ ,...b _B-1 .

Among them, b _i is 0 or 1, 0≤i≤B-1, i is an integer, and the bit sequence includes B bits in total, where B>0, B=K+L, K is the total number of information bits, and L is Cyclic redundancy check bit length; target code rate R.

K ₁₀₂₄ , K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , and K ₆₄ are used to represent the number of information bits included in each code block of code length j corresponding to the target code rate R, where j=1024,512,256,128,64. K ₁₀₂₄ , K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , and K ₆₄ are known data.

For example, taking the target code rate R as 1/2 as an example, in this prior art, the number of information bits included in a code block with a code length of 1024 bits is 512 bits among the above-mentioned B bits, that is, K ₁₀₂₄ = 512bit.

Given a given code length, the smaller the code rate (the code rate is the ratio of the information bits included in the code block to the code length), the better the reception performance of the code block. So in the above-mentioned prior art, in order to improve the reception performance of small code blocks (here are code blocks with code lengths of 512, 256, 128, and 64 respectively), the value of the above K ₅₁₂ is less than 256 bit, for example, K ₅₁₂ =255 bit, The value of K ₁₂₈ is also less than 64bit, and the value of K ₆₄ is also less than 32bit.

In other words, the actual code rates corresponding to the above values of K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , and K ₆₄ given by the system are all smaller than the target code rate R, not the target code rate R.

N ₁₀₂₄ , N ₅₁₂ , N ₂₅₆ , N ₁₂₈ , and N ₆₄ are respectively used to represent the number of segments with different code lengths (here, the code length after encoding, that is, the mother code length), that is, the number of code blocks with different code lengths. N ₁₀₂₄ , N ₅₁₂ , N ₂₅₆ , N ₁₂₈ , and N ₆₄ are the parameters that need to be solved respectively.

Here, N ₁₀₂₄ is used to represent the number of code blocks with a code length of 1024 bits, N ₅₁₂ is used to represent the number of code blocks with a code length of 512 bits, N ₂₅₆ is used to represent the number of code blocks with a code length of 256 bits, and N ₁₂₈ is used to represent the number of code blocks with a code length of 512 bits. N 64 is used to represent the number of code blocks with a code length of 128 bits, and N ₆₄ is used to represent the number of code blocks with a code length of 64 bits.

K _m is used to represent the number of remaining bits to be encoded after allocating the information bits to be encoded to the code block with a code length of 1024 in the bit sequence b ₀ , b ₁ , b ₂ , b ₃ ,... _b B-1 .

symbol

Indicates rounding down, symbol

Indicates rounding up.

The number of code blocks C _total (that is, the total number of segments that segment the input bit sequence) is achieved through the first to fourth steps:

The first step is to determine the number N ₁₀₂₄ of code blocks with a code length of 1024 bits through the following code logic;

In the second step, determine the index according to formula 3, look up table 1 based on the index, and determine N ₅₁₂ , N ₂₅₆ , and N ₁₂₈ ;

index index	11	22	33	44	55	66	77	88	99	1010	1111	1212	1313	1414
N ₅₁₂ _N512	00	00	00	00	00	00	11	11	11	11	22	22	22	22
N ₂₅₆ N ₂₅₆	00	00	11	11	22	22	11	11	22	22	11	11	22	22
N ₁₂₈ N ₁₂₈	11	22	11	22	11	22	11	22	11	22	11	22	11	22

Table 1

The third step is to calculate N ₆₄ according to Formula 4.

The fourth step is to determine the total number of segments C _total according to Formula 5.

C _total =N ₁₀₂₄ +N ₅₁₂ +N ₂₅₆ +N ₁₂₈ +N ₆₄ , formula 5;

Table 2 illustrates the segmentation results obtained by the above-mentioned segmentation method in the prior art under the conditions of different information bit lengths K (K is the total number of information bits) with the target code rate R being 6/8. , among which, CRC24 in Table 2 is used to indicate that the above L is 24 bits, and the information bit K+CRC24 indicates the value of B.

Table 2

As shown in Table 2, it can be seen that K+CRC24=96bit, that is, when K is 72bit, the number N ₆₄ of code blocks with a code length of 64bit is 3; when K+CRC24=184bit, that is, when K is 160bit, The number N ₆₄ of code blocks with a code length of 64 bits is 3; when K + CRC24 = 192 bit, that is, when K is 168 bit, the number of code blocks N ₆₄ with a code length of 64 bits is 3; when K + CRC24 = 272 bit, that is, K When K is 248 bit, the number N ₆₄ of code blocks with a code length of 64 bit is 3; K + CRC24 = 280 bit, that is, when K is 256 bit, the number N ₆₄ of code blocks with a code length of 64 bit is 3; K + CRC24 = 288 bit, That is, when K is 264 bits, the number N ₆₄ of code blocks with a code length of 64 bits is 3.

Under the above-mentioned information bit length K, the segmentation method in the above-mentioned prior art can obtain three code blocks with a code length of 64 bits. In the above scenario, the code blocks with a code length of 64 bits belong to small code blocks. , the segmentation method in the prior art has the problem of a large number of small code blocks.

In addition, it can be understood that by adjusting the allocation of information bits, the probability of decoding errors of code blocks with different code lengths (ie, length) is basically the same. Then, given the number of bits of data to be transmitted, the greater the number of code blocks obtained by segmentation, the greater the probability of decoding errors of the code blocks, and the worse the reception performance.

In this prior art, when the information bits to be encoded are divided into segments to calculate the number of code blocks of each code length, as shown in Equation 3, the prior art divides the information bits to be encoded based on the target code rate R. segments, for example, determine N ₅₁₂ , N ₂₅₆ , N ₁₂₈ instead of segmenting the information bits to be encoded based on the actual code rate of the code block of each code length. For example, the actual code rate R' of the code block with a code length of 512 is K ₅₁₂ /512, where R'<R. For example, as shown in Table 2, the segmentation method in the prior art not only results in a larger number of code blocks C _total , but also the number of segmented small code blocks can reach 3 or more. The number of code blocks is also too high, affecting reception performance.

Among them, the small code block defined in this application is used to represent the code block in the segmented code block whose code length is less than the maximum code length, where the maximum code length is the longest code length in the segmented code block. .

To this end, the present application provides a segmentation method. Compared with the segmentation method in the above-mentioned prior art, the total number of segments of the data to be transmitted can be reduced when the data to be transmitted is encoded with Polar codes (for example, The number of code blocks after the segment), especially the number of small code blocks can be reduced. For example, in the code blocks obtained by segmenting the data to be transmitted in this application, the number of small code blocks of the same length can be less than 3, thereby optimizing the reception performance of the code blocks.

In a possible implementation, FIG. 4 is an exemplary process diagram of the segmentation method.

For example, as shown in Figure 4, the method may include S101 and S102.

S101. The sending end segments the data to be transmitted according to the preset algorithm and the preset mother code length, and obtains multiple first code blocks corresponding to different code lengths.

For example, the data to be transmitted may be information bits to be encoded.

Optionally, the data to be transmitted may also include information bits of cyclic redundancy check.

For example, the code length of each first code block is an integer power of 2.

For example, the code length of a first code block is a mother code length.

For example, each mother code length may correspond to at least one first code block. In other words, the code lengths of different first code blocks may be the same, and there may be multiple code blocks whose code lengths are the same mother code length.

For example, the segmentation result of segmenting the data to be transmitted can be multiple data segments, or it can be the first code block after zero-padding each data segment according to the corresponding preset mother code length. In this embodiment, The segmentation result is a code block as an example for illustration.

For example, when the segmentation result is multiple data segments, each data segment also corresponds to a corresponding preset mother code length. When the sending end performs a merge (can be understood as a connection) operation on adjacent data segments, Merging can still be performed based on the preset mother code length corresponding to each data segment (that is, the encoded code length). The specific implementation principle is similar to the merging operation of multiple first code blocks introduced in various embodiments of this application. This will be explained later.

S102: The sending end performs a merging operation on the plurality of first code blocks, and the number of first code blocks after merging is smaller than the number of first code blocks before merging.

In a possible implementation, when performing the above merging operation, the sending end may merge at least two adjacent first code blocks with the same code length into at least one second code block, wherein the first code block before merging The code length of one code block is smaller than the code length of the corresponding second code block to reduce delay.

In a possible implementation, when performing the above merging operation, the transmitting end can merge code blocks with the same code length, and the merged code blocks are not limited to adjacent code blocks, for example, in Figure 5a(2) , the sending end can also combine code block 15 and code block 20.

It should be understood that before and after the sending end performs the above combining operation, the code length of the first code block is an integer power of 2.

In a possible implementation, the code lengths corresponding to the plurality of first code blocks before merging may include the code length of the second code block.

For example, the code lengths corresponding to the code blocks segmented in S101 include 1024 bits and 512 bits. After the merging operation of S102, two code blocks with a code length of 512 bits can be merged into one code block with a code length of 1024 bits. , thereby reducing the number of small code blocks. The code lengths of the combined code blocks include 1024 bits and 512 bits, but the number of code blocks with a code length of 512 bits is reduced, thereby reducing the number of small code blocks.

In this way, the merging operation of the code blocks by the sending end will not increase or decrease the code length corresponding to the multiple first code blocks obtained after segmentation in S101.

In another possible implementation, the code lengths corresponding to the plurality of first code blocks before merging do not include the code length of the second code block.

For example, the code lengths corresponding to the code blocks segmented in S101 include 1024 bits, 512 bits, and 64 bits. After the merging operation of S102, the two 64-bit code blocks can be merged into one code block with a code length of 128 bits. , then the code length of the code block after the combined operation can include 1024 bits, 512 bits, 128 bits, and optionally 64 bits, which can also reduce the number of small code blocks.

In this way, on the basis of reducing the number of small code blocks, the sending end's merging operation of code blocks can increase or decrease the code length corresponding to the multiple first code blocks obtained after segmentation in S101.

The implementation of Figure 4 is explained below with different examples:

Example 1

In a possible implementation, the information bits that need to be included in the code block given the maximum code length (such as the maximum mother code length) and the minimum code length (such as the minimum mother code length) and each preset mother code length are In the case of several, when executing S101, the sending end can segment the data to be transmitted based on the above-mentioned low-latency segmentation principle to obtain a plurality of first code blocks with code lengths gradually decreasing from large to small. In this way, the impact of decoding delay and transmission delay on the overall system delay can be minimized.

For example, the information bits contained in each first code block may be composed of partial information bits after segmentation of the data to be transmitted (for example, the data segments described in the embodiment of FIG. 2 above).

For example, if the minimum code length is 2 ^a bits and the maximum code length is 2 ^b bits, then based on the above low-delay segmentation principle, code blocks with (b-a+1) types of code lengths can be obtained, where a , b is a positive integer, and a<b.

For example, among the multiple first code blocks after segmenting the data to be transmitted at the sending end, the code length of any first code block can be expressed as 2 ^x bits, where a≤x≤b. And the sending end can express the number of information bits (the information bits are information bits from the data to be transmitted) contained in the first code block with a code length of 2 ^x bits as K _x .

In a possible implementation, the sending end can also obtain the value of parameter p set by the system or the user.

For example, the parameter p can be used to represent the number of information bits at least included in the last code block among multiple first code blocks corresponding to the segmentation result obtained after segmentation. Then when the sending end performs the above S101, it can further perform segmentation based on the parameter p, so that the number of information bits corresponding to the last code block in the segmentation result obtained by segmentation is greater than or equal to p. The information bits here refer to the information bits from the data to be transmitted, excluding the zero bits padded with zeros according to the preset mother code length.

For example, the value of p can be set by the system or the user, and can be flexibly set according to needs, and is not limited in this application.

For example, if p is set to 10 and the minimum code length is 64 bits, then the sending end can use the last 15 bits remaining at the end of the data to be transmitted when segmenting (it can be any value greater than or equal to 10, there is no limit here) ) is allocated to a code block with a code length of 64 bits, then the code block with a code length of 64 bits is the last code block after segmentation, and the number of information bits included in the last code block is 15 bits.

For example, in the segmentation results (eg, multiple first code blocks) of this embodiment, except for the last code block, multiple code blocks with the same code length each contain the same information bits.

In addition, after preliminary segmentation of the data to be transmitted in this embodiment, the number of code blocks of each code length can also be obtained. Among them, N _x can represent the number of code blocks with a code length of 2 ^x bits.

In this way, the sending end segments the data to be transmitted according to the above-mentioned low-delay segmentation principle, and can obtain multiple first code blocks. For example, after segmenting the above embodiments, the sending end can determine the values of the following parameters, 2 ^a , 2 ^b , K _x , a≤x≤b, a, b are both positive integers, and the value of p (For example, 10 in the above example), and the initial value of K _last , where K _last represents the number of information bits included in the last code block among the multiple first code blocks obtained by segmentation. For example, in the above example, K _last =15.

For example, if the maximum code length is 1024 bit and the minimum code length is 64 bit, then the code lengths of multiple first code blocks obtained based on the above-mentioned low-latency segmentation principle are 1024 bit, 512 bit, 256 bit, 128 bit, and 64 bit.

Figure 5a(1) is an exemplary illustration of multiple first code blocks obtained by the sending end segmenting the data to be transmitted according to the above-mentioned low-latency segmentation principle.

As shown in Figure 5a(1), the sender obtains 9 code blocks in segments, and the 9 code blocks are arranged in sequence according to the information bit order of the data to be transmitted, followed by code block 11 with a code length of 1024 bits, code block 11 with a code length of 512-bit code block 12, code block 13 with a code length of 256 bits, code block 14 with a code length of 256 bits, code block 15 with a code length of 128 bits, code block 16 with a code length of 128 bits, code length Code block 17 of 64 bits, code block 18 with a code length of 64 bits, code block 19 with a code length of 64 bits.

For example, the data to be transmitted includes 985 bits, and the preset mother code length includes 1024 bits, 512 bits, 256 bits, 128 bits, and 64 bits. The transmitting end segments the data to be transmitted according to the information bit sequence and the preset mother code length of the data to be transmitted (this includes zero-filling operations for each data segment, thereby obtaining code blocks 11 to 19), and obtains the above code Block 11 to Code Block 19. Among them, as shown by _K The number of information bits included in the blocks are 512 bits, 168 bits, 84 bits, 41 bits, and 20 bits respectively. The code length of the last code block 19 is 64 bits, but the number of information bits it includes is 15 (this value is greater than p, which has a value of 10).

In a possible implementation, when performing the above S102 to merge the code blocks, the sending end may sequentially detect code blocks of each code length in the plurality of first code blocks in order from small to large code lengths. quantity. Exemplarily, the plurality of first code blocks are sequentially sorted according to the order of information bits of the data to be transmitted (or segmentation order).

In a possible implementation, when the sending end detects that the number of code blocks of code blocks with the same code length is 3 or more, then at least two first code blocks with the same code length can be combined.

For example, the transmitting end may combine at least two first code blocks that are adjacently arranged and have the same code length among multiple first code blocks arranged in information bit order.

In other embodiments, when the number of code blocks to be combined is 2 or more, the code blocks can also be combined. The principles are similar and will not be described again here.

In a possible implementation, the transmitting end can combine at least two first code blocks that are arranged adjacently into at least one second code block, wherein the second code length of the second code block is longer than the combined code block. The first code length of the first code block, and the second code length of the second code block is twice the first code length of the merged first code block.

In this way, the merged first code block still complies with the above-mentioned low-latency segmentation principle, that is: the code length of the next-level code block is the same as the code length of the previous-level code block, or the code length of the next-level code block is Half the code length of the previous code block; and the code length of the last code block is the minimum mother code length.

In a possible implementation, after the sending end combines the at least two first code blocks, at least one first code block with the code length of the first code block can be left, so that after this process The code length of each code block after the merging process of S102 applied for is the same as the code length of multiple code blocks obtained from the initial segmentation (such as S101). The merging process will not be based on the code length corresponding to the original segmentation result. , add a new code length or reduce the code length.

In a possible implementation, if the sending end sets a condition that the code length of the last code block is greater than or equal to p, then the sending end can combine at least two first code blocks based on the merged at least The number of information bits included in the two first code blocks, and the number of information bits included in at least one second code block after merging, the number of information bits in the last code block is updated, and the number of information bits in the last updated code block is The included information bits are still greater than or equal to p.

For example, as described in the above embodiments, the sending end segments the data to be transmitted according to the above-mentioned low-latency segmentation principle to obtain multiple first code blocks. For example, the sending end can determine the values of the following parameters: the maximum code length 2 ^a in multiple first code blocks, the minimum code length 2 ^b , and the number of information bits K included in a code block with a code length of 2 ^x bits. _x , a≤x≤b, a, b are all positive integers, the number N _x of code blocks with a code length of 2 ^x , the value of p (such as 10 in the above example), and K _last . Wherein, K _last represents the number of information bits included in the last code block among the plurality of first code blocks. For example, in the above example, K _last =15.

For example, when the sending end combines multiple first code blocks through S102, it can be implemented through the following code:

In the above code implementation, the sending end can sequentially detect the number of code blocks of each code length except the maximum code length for multiple first code blocks in order from small to large code lengths. If the sending end traverses The number of the first code blocks with a first code length of 2 ^x bits is greater ^than or equal to 3, and K _last -(K _x+1 -2* _K When a code block is combined into a code block with a code length of 2 ^{x + 1} bits, it can still be ensured that the number of information bits included in the last updated code block is greater than or equal to p. Then the sender can reduce the number of code blocks with a code length of 2 ^x bits by 2, add 1 to the number of code blocks with a code length of 2 ^x+1 bits, and increase the number of information bits included in the _last code block K Updated to K _last -(K _x+1 -2*K _x ).

The merging process of the above embodiment will be described below with reference to Figure 5a:

As mentioned above, Figure 5a(1) exemplarily shows the segmentation result after segmenting the data to be transmitted based on the low-latency segmentation principle. The segmentation result may include code blocks 11 arranged in the order of information bits. Go to code block 19.

The initial value of K _last here is the number of information bits 15 included in the code block 19, for example, p=10.

For example, the sending end detects that the number of code blocks with a code length of 64 bits shown in Figure 5a(1) is 3 in order from small to large code lengths, and detects that code block 17 and code block 18 each Including 20 bits of data to be transmitted, and the number of information bits included in a code block with a code length of 128 bits is 41, then the sender combines code block 17 and code block 18 here into a code with a code length of 128 bits block, there is a lack of 1 (i.e. 41-20*2) bits of data to be transmitted, and the 1 bit of data to be transmitted can be supplemented from the last code block, that is, code block 19. In this way, as shown in Figure 5a(2), the sending end can use the code block 17 and the code block 18 shown in Figure 5a(1) and one of the 15 information bits included in the code block 19 (for example, the first bits (not limited here) are combined into a code block 20 with a code length of 128 bits as shown in Figure 5a(2), and the number of information bits included in the code block 19 is updated from 15 to 14.

In a possible implementation, when the transmitting end combines code blocks (for example, code block A and code block B) with the same code length (for example, code length 1), the missing target amount of information that needs to be supplemented is Bits, the sender obtains from other code blocks in the code block corresponding to the segmentation result except the current code block to be merged. It is not limited to obtaining from the last code block in the above example. The specific code block can be obtained from Determined according to the policy, there are no restrictions here.

For example, when the sending end combines code blocks (for example, code block A and code block B) with the same code length (for example, code length 1), for the missing target number of information bits that need to be supplemented, the sending end starts from Obtaining the last code block in the code block corresponding to the segmentation result can improve encoding and decoding efficiency compared to obtaining code blocks other than the last code block.

In a possible implementation, for the sending end's strategy when obtaining the target number of information bits from other code blocks (taking the last code block as an example, the same applies to other code blocks, there is no restriction here), the The strategy can be to obtain the information bits in sequence from front to back according to the last code block in the example here, or in reverse order (for example, from back to front), or from the i-th arrangement (for example, i =2, no limit) bits can be obtained, etc., and the specific strategy is not limited.

For example, in the above example, when the sending end merges code block 17 and code block 18, for the missing 1 bit that needs to be supplemented, the sending end obtains it from the last code block 19, and the strategy adopted is to start from the previous one in the order of arrangement. The latter strategy is used to obtain the first bit in code block 19 and merge it with code block 17 and code block 18 to obtain code block 20.

In a possible implementation, when the sending end combines different code blocks, regardless of whether the target number of information bits to be supplemented is included, when the sending end performs the combining operation, the data from the different code blocks that need to be combined The connection sequence between them can also be determined based on the preset strategy, and there is no restriction on the preset strategy here.

For example, the strategy can be to splice in sequence according to the arrangement order of the data in the code block. For example, in Figure 5a, 1 bit of code block 17, code block 18 and code block 19 are merged and spliced, then the sending end can combine code block 17 The last 1 bit of the 64 bits is connected to the first bit of the 64 bits of code block 18, and the first bit obtained from the 15 information bits of the data to be transmitted obtained from code block 19 is connected to the first bit of code block 18 The last bit of the 64 bits is connected to obtain the code block 20 shown in Figure 5a(2).

In a possible implementation, when the sending end combines different code blocks, if it needs to obtain a corresponding target number of information bits of data to be transmitted from other code blocks, the target number of information bits will be merged into the different code blocks. When it is in a block, its merging position is also not limited. The specific position of the target number of information bits in the combined code block can be determined according to the strategy, and this application does not impose restrictions on this.

Any strategy mentioned in the above embodiments can be a strategy pre-agreed between the sending end and the receiving end. In this way, the receiving end can segment and encode the codes of the sending end of this application and decode them according to the corresponding strategy to obtain The original data to be transferred.

For example, in Figure 5a(1), the code block 18 includes 20 bits of data to be transmitted. The sending end pads the 20 bits of data to be transmitted with zeros according to the preset mother code length of 64 bits to obtain the code. Code block 18 of length 64. Then in the process of changing from Figure 5a(1) to Figure 5(2), when the above-mentioned first bits in code block 17, code block 18, and code block 19 are combined (here connected), the first bit The bits can be connected to the target position in the bit sequence corresponding to code block 18 (here, the 64-bit bit sequence after zero padding). The target position can be the 20-bit position in the 64-bit bit sequence corresponding to code block 18. Any position after the data to be transmitted is not limited to the end of the code block 18. For example, if the target position is the end of code block 18, it can ensure that the bit order of the data to be transmitted corresponding to the combined code block remains unchanged, ensuring the accuracy of the data to be transmitted, and improving encoding and decoding efficiency.

In a possible implementation, the information bits corresponding to the segmentation results shown in Figure 5a(2) are still sorted according to the information bits of the data to be transmitted, so as to ensure that the adjustment of the segmentation results does not change the data to be transmitted. , thereby improving encoding and decoding efficiency.

Exemplarily, the sending end detects that the number of code blocks with a code length of 128 bits shown in Figure 5a(2) is 3, and detects a code block with a code length of 128 bits in order from small to large code lengths. Including 41 bits of data to be transmitted, and the number of information bits included in the adjacent code block 14 with a longer code length is 84, then the sending end combines two code blocks with a code length of 128 bits into one code block with a code length of When using a 256-bit code block, 2 (ie, 84-41*2) bits of data to be transmitted are missing, and the 2 bits of data to be transmitted can be filled from the last code block, that is, code block 19.

In a possible implementation, as shown in Figure 5a(2), code block 15, code block 16, and code block 20 are all code blocks with a code length of 128 bits. When merging two code blocks, The adjacent code block 15 and the code block 16 are merged, and the adjacent code block 16 and the code block 20 can also be merged.

In a possible implementation, as shown in Figure 5a(2), code block 15, code block 16, and code block 20 are all code blocks with a code length of 128 bits. Then when merging two code blocks, Non-adjacent code block 15 and code block 20 can be merged. The merged code block can be located at the arrangement position corresponding to code block 15 or code block 20, preferably at the arrangement position corresponding to code block 15, so as to reduce the reception time of the code block. extension.

In a possible implementation, in order to ensure that the code blocks after merging code blocks still meet the above-mentioned low-latency segmentation principle to reduce the reception delay of the code blocks, the transmitting end can perform the following steps as shown in Figure 5a(2) Code block 15 and code block 16 are combined into code block 21 with a code length of 256 bits as shown in Figure 5a(3).

In a possible implementation, for the 2 bits missing when code block 15 and code block 16 are combined into code block 21, the sending end can directly obtain it from code block 19 shown in Figure 5a(2) to supplement Go to code block 21.

In another possible implementation, the sending end can also indirectly obtain the 2 bits missing when code block 15 and code block 16 are combined into code block 21 from the last code block 19 .

For example, when updating from Figure 5a(2) to the segmentation result shown in Figure 5a(3), as shown in Figure 5a(2), the sending end can add code block 15, code block 16, and code block 2 bits of data to be transmitted among the 41 information bits included in the code block 20 (for example, the 2 information bits located at the starting position among the 41 information bits in the code block 20) are sequentially connected to merge into Figure 5a (3 ); and the sending end can supplement the 14 information bits included in the code block 19 shown in Figure 5a(2), for example, the 2-bit information located at the starting position as shown in Figure 5a(2) code block 20 (for example, the 2-bit information is padded at the end of the data corresponding to the zero-padded code block 20. The specific position is not limited and can be determined according to the strategy), so that the code block shown in Figure 5a(3) The number of information bits included in 20 is still 41, but the number of information bits included in code block 19, so 14 shown in Figure 5a(2) is updated to 12 shown in Figure 5a(3).

In a possible implementation, the information bits corresponding to the segmentation results shown in Figure 5a(3) can be sorted according to the order of the information bits of the data to be transmitted, so as to ensure that the adjustment of the segmentation results does not change the to-be-transmitted data. Transmit data to improve encoding and decoding efficiency.

Exemplarily, the sending end detects that the number of code blocks with a code length of 256 bits shown in Figure 5a(3) is 3, and detects a code block with a code length of 256 bits in order from small to large code lengths. Including 84 bits of data to be transmitted, and the number of information bits included in the adjacent code block 12 with a longer code length is 168, then the sending end can determine 84*2=168, so that the sending end can convert the two code lengths into The 256-bit code blocks are combined into a code block with a code length of 512 bits, without updating the number of information bits in the last code block (here, code block 19).

For example, as shown in Figure 5a(4), the sending end can combine the code block 13 and the code block 14 shown in Figure 5a(3) into the code block with a code length of 512 bits shown in Figure 5a(4). 22, wherein the code block 22 includes 168 bits of data to be transmitted.

In a possible implementation, the information bits corresponding to the segmentation results shown in Figure 5a(4) are still sorted according to the information bits of the data to be transmitted. They can be sorted according to the order of the information bits of the data to be transmitted, so as to This ensures that adjustments to segmentation results do not change the data to be transmitted, thereby improving encoding and decoding efficiency.

For example, as shown in Figure 5a(1), in the segmentation result obtained from the initial segmentation, the total number of code blocks is 9, and the number of small code blocks is 8, of which the code length is 64 bits. The number of is 3; after the sending end merges the small code blocks, as shown in Figure 5a(4), in the updated segmentation result, the total number of code blocks is 6, and the number of small code blocks is 5, And the number of small code blocks of any code length is less than 3. This "carry every 3 method" reduces the total number of segments and the number of small code blocks, thereby optimizing the reception performance.

Moreover, in the implementation of Figure 5a, the segmentation result shown in Figure 5a(1) obtained from the initial segmentation is in line with the principle of low-latency segmentation, and after optimizing the segmentation result through the method of this application, , in the segmented result shown in Figure 5a(4), the segmented result still complies with the principle of low-latency segmentation, so when the receiving end processes the Polar code encoding result of the segmented result, it can maximize Minimizing the impact of decoding delay and transmission delay on the overall system delay at the receiving end can minimize the system delay at the receiving end. This method can achieve the minimum number of segments of the data to be transmitted while the code blocks corresponding to the segmentation results satisfy the principle of gradually and continuously decreasing from large to small, so that the number of segments of the data to be transmitted, or The number of code blocks corresponding to the segmentation result of the data to be transmitted is the smallest.

In the above example 1, the merging process of each code block is explained by taking the segmentation result as a code block after zero padding according to the corresponding preset mother code length. Then, when the segmentation results are multiple data segments obtained by segmenting the data to be transmitted by the sending end, combined with the embodiment of Figure 5a, for example, in Figure 5a(1), the segmentation results may include sorting according to the order of information bits. of data segments 1 to 9 corresponding to code blocks 11 to 19.

Among them, data segment 1 to data segment 9 sequentially include 512 bits, 168 bits, 84 bits, 84 bits, 41 bits, 41 bits, 20 bits, 20 bits, and 15 bits in the data to be transmitted. The encoded code lengths corresponding to data segments 1 to 9 (i.e., the corresponding preset mother code lengths) are 1024 bits, 512 bits, 256 bits, 128 bits, 128 bits, and 64 bits as shown in Figure 5a(1) respectively. , 64 bit, 64 bit. Then when the sending end performs the corresponding merging operation on the above-mentioned data segments 1 to 9 to optimize the segmentation results, the data corresponding to the same preset mother code length can be combined according to the preset mother code length corresponding to each data segment. Segments (such as adjacent data segments, there are no restrictions here) are merged (connected here) to reduce the number of segments. The specific principle of the merging process is the same as the example in the embodiment of Figure 5a where the segmentation results are code blocks. The principles of the merging process introduced are similar and will not be described again here. The strategies used by the sending end when merging data segments corresponding to the same code length are all the same as the principles of the corresponding strategies described in Example 1 above, and will not be described again here.

Example 2

In a possible implementation, given a preset mother code length (here, multiple mother code lengths), when executing S101, the sending end can also follow any segmentation principle (not limited to the above-mentioned low According to the principle of delay segmentation), the data to be transmitted is segmented to obtain segmentation results, such as the multiple first code blocks mentioned above.

For example, for example, the minimum code length is 2 ^a bits and the maximum code length is 2 ^b bits. The number of preset mother code lengths is not limited to (b-a+1). The number of preset mother code lengths is not limited to (b-a+1). It can be less than (b-a+1), where a and b are positive integers, and a<b.

In a possible implementation, the minimum code length is set to 64 bits and the maximum code length is 1024 bits. In the segmentation results obtained from the initial segmentation, the code lengths corresponding to the multiple first code blocks obtained may include : 1024 bit, 64 bit. Optionally, the code length may also include at least one code length between 64 bits and 1024 bits and an integer power of 2.

Exemplarily, FIG. 5b(1) illustrates the initial segmentation result of this embodiment.

As shown in Figure 5a(1), the sending end segments the data to be transmitted including 985 bits based on the above minimum code length and maximum code length, and obtains 8 code blocks according to the segmentation of the data to be transmitted. The information bits are arranged in sequence, including code block 301 with a code length of 1024 bits, code block 302 with a code length of 512 bits, code block 303 with a code length of 256 bits, code block 304 with a code length of 256 bits, and code block 304 with a code length of 256 bits. The code block 305 is 256 bits long, the code block 306 is 64 bits long, the code block 307 is 64 bits long, and the code block 308 is 64 bits long.

For example, the default mother code length includes 1024 bits, 512 bits, 256 bits, and 64 bits. The sending end segments the data to be transmitted according to the information bit sequence and the preset mother code length of the data to be transmitted, and obtains the above-mentioned code blocks 301 to 309. Among them, as shown by _K The number of information bits included is 512 bits, 168 bits, 84 bits, and 20 bits. The code length of the last code block 308 is 64 bits, but the number of information bits it includes is 13 (this value is greater than p, which has a value of 10).

For example, the sending end can merge the segmentation results shown in Figure 5b(1) through S102. For example, the sending end detects the codes shown in Figure 5b(1) in order from small to large code lengths. The number of code blocks with a length of 64 bits is 3, and the code block 306 and the code block 307 can be combined into a code block 309 with a code length of 128 bits as shown in Figure 5b(2). Here, the initial segmentation result shown in Figure 5b(1) does not include the code block 309 with a code length of 128 bits shown in Figure 5b(2). In other embodiments, if the above-mentioned combining operation is performed based on the set number of information bits included in a code block with a code length of 128 bits (for example, a code block with a code length of 128 bits needs to include 41 information bits) ), when there is a lack of information bits corresponding to the target number (here 1), the sending end can, for example, select from other code blocks (such as the last code block) except code block 306 and code block 307 shown in Figure 5b(1) Block 308) is used to obtain the corresponding target number of information bits. The specific filling strategy is similar to the principle of the embodiment of FIG. 5a and will not be described again here.

For example, the sending end detects that the number of code blocks with a code length of 256 bits shown in Figure 5b(2) is 3 in order from small to large code lengths, and can add code block 303 and code block 304, or , the code block 304 and the code block 306 are merged into a code block 310 with a code length of 512 bits as shown in Figure 5b(3) (the code block 310 here is composed of the code block 303 and the code block 304). In this way, the number of information bits included in the combined code block 310 is the same as the number of information bits included in the code block 302 shown in Figure 5b(3), which is 168.

In the embodiment of FIG. 5b , when the initial segmentation results are combined, code lengths not included in the initial segmentation results are combined, such as the code length of the above-mentioned code block 309 (128 bits). This implementation can achieve the addition of code lengths to the positive integer power of 2.

For example, as shown in Figure 5b(1), in the segmentation result obtained from the initial segmentation, the total number of code blocks is 8, and the number of small code blocks is 7, of which the code length is 64 bits. The number of small code blocks is 3, and the number of small code blocks with a code length of 256 bits is also 3; after the sending end merges the small code blocks, as shown in Figure 5b(3), in the updated segmentation result, the code The total number of blocks is 6, and the number of small code blocks is 5, and the number of small code blocks of any code length is less than 3. This "3-carry method" reduces the total number of segments and the number of small code blocks. quantity to optimize reception performance.

Example 3

In a possible implementation, for the sending end to obtain multiple first code blocks according to the information bits of the data to be transmitted through S101 segmentation, the code lengths corresponding to the multiple first code blocks according to the ordering can be from The ordering is gradually and continuously increasing, so that the code length of the next level code block is the same as the code length of the upper level code block, or the code length of the next level code block is two times the code length of the upper level code block. times.

Exemplarily, FIG. 5c(1) illustrates the initial segmentation result of this embodiment.

As shown in Figure 5c(1), the sending end segments the data to be transmitted including 985 bits based on the minimum code length (for example, 64 bits) and the maximum code length (for example, 1024 bits), and obtains 9 code blocks by segmenting , the 9 code blocks are arranged in order according to the information bit order of the data to be transmitted, followed by the code block 201 with a code length of 64 bits, the code block 202 with a code length of 64 bits, and the code block with a code length of 64 bits. 203. Code block 204 with a code length of 128 bits, code block 205 with a code length of 128 bits, code block 206 with a code length of 256 bits, code block 207 with a code length of 256 bits, and code block 207 with a code length of 512 bits. Code block 208 and code block 209 with a code length of 1024 bits.

As shown by _K The number of information bits included are 512 bits, 168 bits, 84 bits, 41 bits, and 20 bits. The number of information bits included in the first code block 201 with a code length of 64 bits is 15 (this value is greater than p, which has a value of 10).

Among them, the definition of Kx can refer to the relevant introduction in Example 1, and will not be repeated here.

Then when the transmitting end combines at least two code blocks with the same code length shown in Figure 5c(1), it can also detect each code in the above multiple first code blocks in sequence in order of code length from small to large. The number of long code blocks. When it is detected that the number of code blocks with the same code length is greater than or equal to 3, then at least two first code blocks with adjacent arrangement positions are merged. The specific strategy is similar to the above example 1. The principle of the specific merging process is the same as that in Figure 5a The merging process is similar and also belongs to the "carry every 3 method". For details, please refer to the relevant introduction in Example 1 and will not go into details here. In this way, after the sending end merges at least two code blocks with the same code length in the segmentation result shown in Figure 5c(1), the segmentation result shown in Figure 5c(2) is obtained. The segmentation result includes The code lengths sorted according to the information bits of the data to be transmitted are 64 bits, 128 bits, 256 bits, 512 bits, 512 bits, and 1024 bits. The above 6 code blocks sorted according to the information bits of the data to be transmitted are The numbers of information bits Kx included are 12, 41, 84, 168, 168, and 512 in order.

For example, as shown in Figure 5c(1), in the segmentation result obtained from the initial segmentation, the total number of code blocks is 9, and the number of small code blocks is 8, of which the code length is 64 bits. The number of is 3; after the sending end merges the small code blocks, as shown in Figure 5c(2), in the updated segmentation result, the total number of code blocks is 6, and the number of small code blocks is 5, And the number of small code blocks of any code length is less than 3. This "carry every 3 method" reduces the total number of segments and the number of small code blocks, thereby optimizing the reception performance.

Example 4

In a possible implementation, for the sending end to obtain a plurality of first code blocks according to the information bits of the data to be transmitted through S101 segmentation, the code lengths corresponding to the plurality of first code blocks according to the ordering may be different. Follow the sorting order from small to large, or not follow the sorting order from large to small.

Exemplarily, FIG. 5d(1) illustrates the initial segmentation result of this embodiment.

As shown in Figure 5d(1), the sending end segments the data to be transmitted including 985 bits based on the minimum code length (for example, 64 bits) and the maximum code length (for example, 1024 bits), and obtains 8 code blocks from the segments. , the 8 code blocks are arranged in sequence according to the order of the information bits of the data to be transmitted, followed by the code block 401 with a code length of 1024 bits, the code block 402 with a code length of 256 bits, the code block 403 with a code length of 256 bits, and the code block 403 with a code length of 256 bits. The code block 404 is 256 bits long, the code block 405 is 512 bits long, the code block 406 is 64 bits long, the code block 407 is 64 bits long, and the code block 408 is 64 bits long.

Illustratively, as shown by _K The number of information bits included are 512 bits, 168 bits, 84 bits, and 20 bits respectively. The code length of the last code block 308 is 64 bits, but the number of information bits it includes is 13 (this value is greater than p, which has a value of 10).

For example, the sending end can merge the segmentation results shown in Figure 5d(1) through S102. For example, when the sending end merges code blocks with the same code length, the sending end does not need to follow the code length from small to large. Merge in order, and you can search for at least two code blocks with the same code length in order from large to small, or directly according to the order of the code blocks in the segmentation result (for example, the arrangement positions are adjacent, there is no restriction here) Code blocks are merged.

For example, as shown in Figure 5d(2), the sending end detects that the number of code blocks with a code length of 256 bits shown in Figure 5d(1) is 3, and code block 402 and code block 403 can be used, or , the code block 403 and the code block 404 are merged into a code block 409 with a code length of 512 bits as shown in Figure 5d(3) (the code block 409 here is composed of the code block 402 and the code block 403). In this way, the number of information bits included in the combined code block 409 is the same as the number of information bits included in the code block 405 shown in Figure 5d(2), which is 168. Therefore, when merging the code blocks, there is no need to start from The number of information bits is supplemented at the last code block 408.

For example, as shown in Figure 5d(2), the sending end can detect that the number of code blocks with a code length of 64 bits is 3, and can merge

code blocks

406 and 407 into one, as shown in Figure 5d(3) The code block 410 with a code length of 128 bits is shown. Here, the initial segmentation result shown in Figure 5d(1) does not include the code block with a code length of 128 bits. The above merging operation can be directly performed here (such as As shown in Figure 5d(3), the number of information bits included in the code block 410 is 40), or the above-mentioned merging operation can also be performed based on the at least number of information bits included in the code block with a set code length of 128 bits. , when there is a lack of information bits, the gap can be filled from, for example, the last code block, such as code block 408 shown in Figure 5d(2). The specific gap filling strategy is similar to the principle of Example 1, and will not be described again here.

For example, as shown in Figure 5d(1), in the segmentation result obtained from the initial segmentation, the total number of code blocks is 8, and the number of small code blocks is 7, of which the code length is 64 bits. The number is 3, and the number of small code blocks with a code length of 256 bits is also 3; after the sending end merges the small code blocks, as shown in Figure 5d(3), in the updated segmentation result, the code The total number of blocks is 6, and the number of small code blocks is 5, and the number of small code blocks of any code length is less than 3. This "3-carry method" reduces the total number of segments and the number of small code blocks. quantity to optimize reception performance.

Example 5

Exemplarily, FIG. 5e(1) illustrates the initial segmentation results of this embodiment.

As shown in Figure 5e(1), the sending end segments the data to be transmitted including 985 bits based on the above-mentioned minimum code length (for example, 64 bits) and maximum code length (for example, 1024 bits), and obtains 10 code blocks by segmenting , the 10 code blocks are arranged in order according to the information bit order of the data to be transmitted, followed by the code block 501 with a code length of 1024 bits, the code block 502 with a code length of 512 bits, the code block 503 with a code length of 256 bits, and the code block 503 with a code length of 256 bits. The code block 504 is 256 bits long, the code block 505 is 128 bits long, the code blocks 506 to 509 are 64 bits long, and the code block 510 is 64 bits long.

Exemplarily, as shown by _K The number of information bits included in each code block is 512 bits, 168 bits, 84 bits, 41 bits, and 20 bits. The code length of the last code block 510 is 64 bits, but the number of information bits it includes is 16 (this value is greater than p, which has a value of 10).

In a possible implementation, the sending end can merge the code blocks with code lengths greater than or equal to 3 into adjacent code blocks in order from small to large code lengths for the segmentation results shown in Figure 5e(1). For code blocks with larger code length, the merging process is shown in Figure 5e(2) to Figure 5e(4).

For example, as shown in Figure 5e(2), the sending end can combine the code block 506 and the code block 507 shown in Figure 5e(1) into the code block with a code length of 128 bits shown in Figure 5e(2). 511, and merge the code block 508 and the code block 509 shown in Figure 5e(1) into the code block 512 with a code length of 128 bits shown in Figure 5e(2), and at the same time reduce the number of information bits in the code block 510 by 2 , so that the number of information bits included in the code block 510 is updated from 16 as shown in Figure 5e(1) to 14 as shown in Figure 5e(2).

For example, as shown in Figure 5e(3), the sending end can combine the code block 505 and the code block 511 shown in Figure 5e(2) into the code block with a code length of 256 bits shown in Figure 5e(3). 513, at the same time, the number of information bits in the code block 510 is reduced by 2, so that the number of information bits included in the code block 510 is updated from 14 shown in Figure 5e(2) to 12 shown in Figure 5e(2) (the number of information bits included in the code block 510 The number of information bits included is still greater than p, where p=10).

For example, as shown in Figure 5e(4), the sending end can combine the code block 503 and the code block 504 shown in Figure 5e(3) into the code block with a code length of 512 bits shown in Figure 5e(4). 514. Thus, the initial segmentation result shown in Figure 5e(1) is optimized to the segmentation result shown in Figure 5e(4).

In another possible implementation, the sending end can combine the segmentation results shown in Figure 5e(1) into more code blocks with code lengths greater than or equal to 3 in order from small to large. For code blocks with large code lengths, the merging process is shown in Figure 5e(5) to Figure 5e(6).

For example, as shown in Figure 5e(5), the sending end can combine the code blocks 506 to 509 shown in Figure 5e(1) into the code block shown in Figure 5e(5) with a code length of 256 bits. 515, and the number of information bits included in code block 515 is the same as the number of information bits included in code block 503 and code block 504 respectively, which are both 84. At the same time, the transmitting end can also reduce the number of information bits in the code block 510 by 4, so that the number of information bits included in the code block 510 is updated from 16 as shown in Figure 5e(1) to 12 as shown in Figure 5e(2) to satisfy The code length corresponding to the combined code block 515 is the required number of information bits included in 256 bits, which is 84 here.

For example, as shown in Figure 5e(6), the sending end can combine the code block 503 and the code block 504 shown in Figure 5e(5) into a code block with a code length of 512 bits shown in Figure 5e(6). 514. Thus, the initial segmentation result shown in Figure 5e(1) is optimized to the segmentation result shown in Figure 5e(6).

In this example, when multiple code blocks with the same code length can be merged into adjacent code blocks with a larger code length (for example, in Figure 5e, a code block with a code length of 64 can be merged into an adjacent code block with a code length of 128-bit code block), or a code block with a larger code length than the adjacent code block (for example, in Figure 5e, a code block with a code length of 64 can be merged into an adjacent code block with a larger code length of 128 bits) (code blocks with a code length of 256 bits), both the number of small code blocks and the number of overall code blocks can be reduced.

Example 6

Exemplarily, FIG. 5f(1) illustrates the initial segmentation result of this embodiment.

As shown in Figure 5f(1), the sending end segments the data to be transmitted including 945 bits based on the above-mentioned minimum code length (for example, 64 bits) and maximum code length (for example, 1024 bits), and obtains 8 code blocks by segmenting , the 8 code blocks are arranged in order according to the information bit order of the data to be transmitted, followed by the code block 601 with a code length of 1024 bits, the code block 602 with a code length of 512 bits, the code block 603 with a code length of 256 bits, and the code block 603 with a code length of 256 bits. The code blocks 604 to 607 are 128 bits long, and the code block 608 is 64 bits long.

Exemplarily, as shown by _K 168 bits, 84 bits, 41 bits, 17 bits. The number of information bits included in the last code block 608 is set to be greater than or equal to p, where p=10.

In a possible implementation, the sending end can combine the segmentation results shown in Figure 5f(1) and the code blocks with a code length greater than or equal to 3 into code blocks with a larger code length.

For example, as shown in Figure 5f(2), the sending end can change the number of information bits (here 168) included in the code block 602 with a code length of 512 bits as shown in Figure 5f(1) to Figure 5f(1). The code blocks 604 to 607 shown in 1) are combined into the code block 609 with a code length of 512 bits shown in Figure 5f(2), and the number of information bits in the code block 608 is reduced by 4, so that the code block 608 includes The number of information bits is updated from 17 as shown in Figure 5f(1) to 13 as shown in Figure 5f(2), and the number of information bits included in the combined code block 609 is the same as the number of information bits included in the code block 602 , Regarding the specific merging strategy of information bits, it is similar to the related embodiment of Figure 5a, and the merging strategy of information bits will not be described in detail here.

In this way, in this embodiment, multiple first code blocks with the same code length can be merged into a code block with a longer code length, and the code length corresponding to the merged first code block is equal to the code length of the merged code block. , that is, in this embodiment, when optimizing the segmentation results, when merging code blocks with the same code length, it is not necessary to retain at least one code length for multiple first code blocks with the same code length. Code blocks are not merged, so the optimization efficiency of segmentation results can be improved, thereby improving segmentation efficiency. Then the segmentation result optimization method of this embodiment can reduce the code length in the initial segmentation result.

Example 7

Exemplarily, Figure 5g(1) illustrates the initial segmentation results of this embodiment.

As shown in Figure 5g(1), the sending end segments the data to be transmitted including 944 bits based on the above-mentioned minimum code length (for example, 64 bits) and maximum code length (for example, 1024 bits), and obtains 8 code blocks by segmenting , the 8 code blocks are arranged in order according to the information bit order of the data to be transmitted, followed by the code block 701 with a code length of 1024 bits, the code block 702 with a code length of 512 bits, the code block 703 with a code length of 256 bits, and the code block 703 with a code length of 256 bits. Block 704, code block 705 with a code length of 128 bits, code blocks 706 to 708 with a code length of 64 bits.

Exemplarily, as shown by _K The number of information bits included in each code block is 512 bits, 168 bits, 84 bits, 41 bits, and 20 bits. The last code block, here code block 708, includes 15 information bits (this value is greater than p, which has a value of 10).

In a possible implementation, the sending end can determine the code blocks with a code length greater than or equal to 2 in order of code length from small to large based on the segmentation results shown in Figure 5g(1), and add the code blocks that are at least 2 Two code blocks are merged into a code block with a larger code length.

For example, as shown in Figure 5g(2), the sending end can change the number of information bits (here 41) included in the code block 705 with a code length of 128 bits as shown in Figure 5g(1) to Figure 5g( The code blocks 706 and 707 shown in 1) are merged into the code block 709 with a code length of 512 bits shown in Figure 5g(2), and the number of information bits in the code block 708 is reduced by 1, so that the combined code block The number of information bits included in 709 is the same as the number of information bits included in code block 705. The specific merging strategy of the information bits is similar to the relevant embodiment of Figure 5a, and the merging strategy of the information bits will not be described again here.

For example, as shown in Figure 5g(2), the sending end can detect that the number of code blocks with a code length of 128 bits is 2, and the sending end can merge the code block 705 and the code block 709 into one as shown in Figure 5g( 3) The code block 710 with a code length of 256 bits is shown, and the number of information bits of the code block 708 is reduced by 2, so that the number of information bits included in the combined code block 710 is the same as that of the code block 704 with a code length of 256 bits. The number of information bits included is the same.

For example, as shown in Figure 5g(3), the sending end can detect that the number of code blocks with a code length of 256 bits is 3, because the combined code length of the three code blocks with a code length of 256 bits is 256 *3, so that the code length of the combined code block of three code blocks with a code length of 256 bits is not an integer power of 2, then the sender can combine two code blocks with a code length of 256 bits (here is Figure 5g (4)), so that the code length of the combined code block 711 shown in (4) in Figure 5g is 512 (which is a positive integer power of 2). And the number of information bits included in the combined code block 711 is the same as the number of information bits included in the code block 702 with a code length of 5126 bits, both of which are 168 bits here.

For example, as shown in Figure 5g(4), the number of code blocks that the transmitting end can code with a code length of 512 bits is 2, here are code blocks 702 and code blocks 711. However, the code block 701 with a code length of 1024 bits It needs to contain 512 bits of data to be transmitted, so when the sender combines code block 702 and code block 711, it lacks w (here w=512-168*2=176) information bits, and the last code block, here Because the code block 708 only includes 12 bits of data to be transmitted, even if the sender does not set the restriction that the last code block includes at least p information bits, in Figure 5g(4), all code blocks with a code length less than 512 bits The sum of the information bits included in each (here is the 84 bits included in the code block 710, and the sum of the 12 bits included in the code block 708, here is 96) is also less than w (here w=176), therefore, sending The end can no longer combine code block 702 and code block 711 into a code block with a code length of 1024 bits, and the optimization of the segmentation results ends.

For example, as shown in Figure 5g(1), in the segmentation result obtained from the initial segmentation, the total number of code blocks is 8, and the number of small code blocks is 7, among which the small code blocks with a code length of 64 bits The number is 3; after the sending end merges the small code blocks, as shown in Figure 5g(4), in the updated segmentation result, the total number of code blocks is 5, and the number of small code blocks is 4, Moreover, the number of small code blocks of any code length is less than 3, which reduces the number of small code blocks and thus optimizes the reception performance.

Example 8

Exemplarily, Figure 5h(1) is an exemplary illustration of the initial segmentation result of this embodiment, or it may be an intermediate result generated in the process of merging the code blocks in the segmentation result in S102 of the present application. result.

As shown in Figure 5h(1), the sending end segments the data to be transmitted including 1032 bits based on the above-mentioned minimum code length (for example, 64 bits) and maximum code length (for example, 1024 bits), and obtains 6 code blocks by segmenting , the six code blocks are arranged in order according to the information bit order of the data to be transmitted, followed by code block 801 with a code length of 1024 bits, code block 802 and code block 803 with a code length of 512 bits, and code block 803 with a code length of 256 bits. Block 804, code block 805 with a code length of 128 bits, and code block 806 with a code length of 64 bits.

Exemplarily, as shown by _K 168 bit, 84 bit, 70 bit, 30 bit. The number of information bits included in the last code block, here code block 806, is 30 (for example, it is required that K _last ≥ p, where p = 5). Among them, K _last represents the information bits included in the last code block in the segmentation result (which can be the initial segmentation result, the segmentation result in the S102 optimization process, or the optimized segmentation result). number.

In a possible implementation, the sending end can determine the code blocks with a code length greater than or equal to 2 based on the segmentation results shown in Figure 5h(1) in order from small to large code lengths, and add the code blocks that are at least 2 Two code blocks are merged into a code block with a larger code length.

For example, as shown in Figure 5h(2), the sending end can combine the code block 802 and the code block 803 shown in Figure 5h(1) into the code block with a code length of 1024 bits shown in Figure 5h(2). 807. At the same time, all the information bits included in the code block 802 to the code block 805 shown in Figure 5h(1) are allocated to the code block 807, and the information bits included in the code block 806 are reduced by 22 bits to allocate them to the code block. 807, so that the number of information bits included in the code block 806 is updated from 30 as shown in Figure 5h(1) to 8 as shown in Figure 5h(2) (the number of information bits included in the code block 806 is still greater than p, where p= 5). And the number of information bits included in the combined code block 807 is the same as the number of information bits included in the code block 801. Regarding the specific combining strategy of the information bits, it is similar to the relevant embodiment of Figure 5a, and the information bits are no longer combined here. The strategy will be discussed in detail.

In this way, in this embodiment, multiple first code blocks with the same code length can be merged into code blocks with a longer code length, so as to reduce the number of small code blocks and improve the reception performance of the code blocks.

It should be understood that the above-mentioned Examples 1 to 8 are not used to limit the segmentation method of the present application. The segmentation method of the present application may also include other examples not listed. In addition, any implementation between the above-mentioned Examples 1 to 8 may be They are combined with each other to form an embodiment of the present application. The principles are similar and will not be described again here.

For each drawing in Figures 5a to 5h, the same reference numerals and graphical content in the same drawing are not repeated, and reference can be made to the explanation of a single sub-figure in the same drawing. In addition, between the above-mentioned Figures 5a to 5h, the same reference signs and illustrations in different figures have the same meaning, and will not be repeated here. You can refer to the corresponding reference signs in the already explained figures or Explanation of the content of the illustration.

It should be understood that the number of information bits included in the code blocks and the code length of the code blocks mentioned in the relevant embodiments in Figures 5a to 5h are only used as examples to facilitate readers to understand the segmentation method of the present application. It is not used to limit the segmentation method of this application.

It should be understood that the various embodiments and examples in the above Examples 1 to 8 can be combined with each other to form new embodiments, and the above Examples 1 to 8 can be freely combined without creative effort; in addition, this The applied segmentation method for secondary modification of the initial segmentation result is not limited to the above examples, and may also include other unmentioned embodiments, which will not be described again here.

In the above-mentioned embodiments such as Figure 4 and Figures 5a to 5h (including the above-mentioned "3-carry method"), the sending end first needs to segment the information bits of the data to be transmitted according to a certain algorithm (not limited here), Then the segmentation result is modified twice to achieve the segmentation result with the minimum number of segments.

In another possible implementation, this application also provides a segmentation method that does not require secondary modification of the initial segmentation result, but directly segments the information bits of the data to be transmitted. , compared with the above-mentioned segmentation method in the prior art, the number of segments can be reduced, or in other words, the number of code blocks corresponding to the segmentation results can be reduced; in addition, this segmentation method can also reduce the number of small code blocks.

It should be understood that this application does not require a segmentation method that requires secondary adjustment of the segmentation results. Under the same prerequisites, for example, the preset mother code length, the number of information bits included in the code block corresponding to each mother code length (such as Based on the above Kx) and other prerequisites, the segmentation result of the data to be transmitted by this segmentation method is the same as the segmentation result of any one of the embodiments such as Figure 4 or Figure 5a to Figure 5h.

The following is an explanation of the segmentation method of this application that does not require secondary modification of the initial segmentation result, but directly segments the information bits of the data to be transmitted.

In a possible implementation, in the segmentation method of the embodiment of the present application, the system or the user can give a preset mother code length.

For example, the preset mother code length may include a maximum code length (eg, a maximum mother code length) and a minimum code length (eg, a minimum mother code length).

For example, the minimum code length is 2 ^a bits, and the maximum code length is 2 ^b bits, where a and b are positive integers, and a<b.

In a possible implementation, when the transmitting end segments the data to be transmitted based on the above-mentioned preset mother code length, it can segment the data to obtain code blocks with at most (b-a+1) code lengths.

For example, the preset mother code length may also include multiple code lengths whose value is a positive integer power of 2, without limiting whether different preset mother code lengths are continuous.

For example, the discontinuous preset mother code lengths may include code lengths of 1024 bits, 512 bits, 128 bits, 64 bits and 32 bits.

For example, the continuous preset mother code length may include code lengths of 1024 bits, 512 bits, 256 bits, 128 bits, 64 bits and 32 bits.

For example, among the multiple third code blocks corresponding to the segmentation results obtained by segmenting the data to be transmitted at the sending end, the code length of any third code block can be expressed as 2 ^x bits, where, a ≤x≤b.

For example, the system or the user can specify the number of information bits included in the code block whose code length is the above-mentioned preset mother code length.

For example, the sending end can express the number of information bits (the information bits are information bits from the data to be transmitted) contained in the third code block with a code length of 2 ^x bits as K _x , or

For example, the above-mentioned preset mother code length and the value of _K changes due to changes in data.

For example, the sending end can obtain the number of information bits included in the data to be transmitted.

For example, the sending end may obtain the remaining number of information bits to be encoded in the data to be transmitted (or, in other words, the remaining number of information bits to be segmented).

For example, the transmitting end can express the remaining number of information bits to be encoded in the data to be transmitted as K _m .

For example, the initial value of K _m is the number of information bits included in the data to be transmitted, and as the sending end updates the segmentation progress of the data to be transmitted, the value of K _m can also be updated.

For example, the parameter p can be used to represent the number of information bits at least included in the last code block among multiple third code blocks corresponding to the segmentation result obtained after segmentation. The information bits here refer to the information bits from the data to be transmitted, excluding the zero bits padded with zeros according to the preset mother code length.

For example, the value of p can be set by the system or the user, and can be flexibly set according to needs, and is not limited in this application. For example, the system sets the plurality of third code blocks obtained by segmenting the data to be transmitted, and the last code block includes at least 10 bits of data to be transmitted, so the value of p here is 10.

Illustratively, in the segmentation result of this embodiment (for example, multiple third code blocks), except for the last third code block, multiple third code blocks with the same code length each contain the same information bits. .

In a possible implementation, the transmitting end may be based on the above-mentioned preset mother code length, the number of information bits that need to be included in a code block with a code length of each preset mother code length (for example, the above-mentioned K _x ), and the data to be transmitted. The total number of information bits is optionally further based on the condition that the last code block needs to include at least p information bits to segment the data to be transmitted to obtain the segmentation result.

For example, the segmentation result can be multiple data segments as shown in the embodiment of Figure 2, or multiple third code blocks after zero-padding multiple data segments according to the preset mother code length. This application applies There is no restriction on this.

In a possible implementation, when the sending end segments the data to be transmitted, the sending end can follow the order from large to small of the preset mother code length, based on the information that needs to be included in the code block corresponding to the length of each mother code 2 ^x The number of bits K _x (or

) and the remaining number of information bits to be segmented K _m corresponding to the data to be transmitted, to segment the data to be transmitted. The data segments corresponding to the code blocks with longer code lengths are obtained by priority segmentation, thereby reducing the number of small code blocks and thereby reducing the amount of data segmentation. The code block with a longer code length has better reception performance, which can improve the reception performance of the coding result of the code block corresponding to the segmentation result. Moreover, segmenting the mother codes in descending order of length can also reduce the delay at the receiving end when receiving and decoding codes segmented and encoded in this application, and can effectively reduce the delay at the receiving end.

For example, the preset mother code length includes 1024 bits, 512 bits, and 128 bits.

For example, the sending end may segment the data to be transmitted into code blocks with a code length of 1024 bits based on K ₁₀₂₄ and K _m . Then, the sending end may segment the data to be transmitted into code blocks with a code length of 1024 bits based on the information allocated to the code blocks with a code length of 1024 bits. number of bits to update K _m ; then, the sending end can segment the data to be transmitted into code blocks with a code length of 512 bits based on K ₅₁₂ and the latest updated K _m , and then the sending end can based on K 512 and the latest updated K m The number of information bits allocated to the code block with a code length of 512 bits is used to update K _m ; finally, the sender can segment the transmitted data into segments with code lengths based on K ₁₂₈ and the latest updated K _m The 128-bit code block has now completed the segmentation of the data to be transmitted.

For example, the sending end can be based on the preset mother code length, the number of information bits that need to be included in the code blocks corresponding to each code length (here, the preset mother code length), and the remaining information to be segmented in the data to be transmitted. The number of bits (optionally, the data to be transmitted can be directly segmented based on the value of p mentioned above), and the segmentation result can be obtained. The segmentation result corresponds to the number of code blocks with a code length of 2 ^x bits. It can be expressed as N _x , a≤x≤b.

For example, the sending end can determine the values of the following parameters, 2 ^a , 2 ^b , K _x , a≤x≤b, a, b are both positive integers, and the value of p (such as 10 in the above example), and the initial value of K _m . For the explanation and definition of the above parameters, please refer to the relevant description of the direct segmentation method above, and will not be repeated here.

For example, the sending end can use the following code to directly segment the data to be transmitted to obtain the segmentation result, thereby determining N _x , a≤x≤b, where the symbols in the following code

Indicates rounding down *, symbol

Indicates rounding * up:

In the above code implementation, the sender can use the above for loop to segment the transmitted data into code blocks with a code length of 2 ^b to a code length of 2 ^a+2 in order from large to small code lengths; The sender can segment the data to be transmitted to obtain code blocks with a code length of 2 ^b to a code length of 2 ^a+2 , and then segment the remaining information bits to be encoded into a code block with a code length of 2 ^{a+ 1} code block, and finally, the sender segments the remaining information bits to be encoded to be transmitted into code blocks with a code length of 2 ^a , and this ends the segmentation of the data to be transmitted.

For example, in the above for loop, formula 6 and formula 7 are included;

K _m =K _m -K _x *N _x , formula 7;

The sender can use Formula 6 to subtract the number of code blocks whose code length is less than 2 ^x (here a+2≤x≤b, and x is a positive integer) from the remaining number of information bits to be encoded in the data to be transmitted. The number of information bits that need to be included is obtained to obtain the number of information bits that can be used for segmentation (K _m -K _x-1 -...-K _a+1 -p);

The sending end then calculates based on the number of information bits K _x that _a _code block with a code length _of ² The number of code blocks N _x with code length 2 ^x , where, in equation 6, the transmitter

with 0, finding the maximum value as N _x , is to solve

is a negative number.

For example, in the above for loop, after the transmitter determines the number N _x of code blocks with a code length _of ² Make an update.

Through the above for loop, the sender can segment the data to be transmitted in sequence to obtain code blocks with a code length of 2 ^b to a code length of 2 ^a+2 , and determine the number N _x of code blocks corresponding to each code length, where a+2 ≤x≤b, and x is a positive integer.

Then, as shown in the above code, the sender can use Formula 8 to segment the remaining information bits to be encoded in the data to be transmitted into code blocks with a code length of 2 ^a+1 , thereby calculating the code length to be 2 ^a+ The number of code blocks of ¹ _Na+1 .

In the above formula 8, since the code length is 2 ^{a + 1} , which is the penultimate code length, the sender requires the last code block obtained after segmentation (here is the last code block with the minimum code length 2 ^a ) includes at least p information bits, then the sender can subtract the number p of information bits required to be included in the last code block with a code length of 2 ^a from the remaining number of information bits to be encoded K _m of the data to be transmitted, Get the number of information bits available for segmentation (K _m -p);

The sending end then calculates the code block with a code length of 2 ^a+1 based on the number of information bits Ka ₊₂ that the code block with a code length of 2 ^a+1 needs to include and the above number of information bits (K _m -p). The quantity Na ₊₁ .

For example, after the transmitter determines the number Na ₊₁ of code blocks with a code length of 2 ^a+1 through Formula 8, it can update the remaining number of information bits K _m to be encoded in the data to be transmitted according to Formula 9 .

K _m =K _m -K _a+1 *N _a+1 , formula 9;

Finally, as shown in the above code, the sender can use Formula 10 to segment the remaining information bits K _m to be encoded in the data to be transmitted into code blocks with a minimum code length of 2 ^a . It should be noted that Formula 10 is rounded up, so that the last code block with a code length of 2 ^a can include at least p information bits, and K _a ≥ p, the sender can calculate the number N of code blocks with a code length of 2 ^a through Formula 10 _a .

In this way, the sending end segments the data to be transmitted according to the above code, and can segment it based on K _x , that is, the number of information bits actually included in the code block of each code length, so that the actual code rate of each code block can be Segmentation is performed on the basis of the target code rate, and the segmentation method in the prior art is segmented according to the target code rate and is not combined with the actual code blocks of each code block. In this way, the plurality of third code blocks corresponding to the segmentation results obtained by segmentation in this application can have the minimum number of segments, and can also reduce the number of small code blocks. At the same time, the plurality of third code blocks can comply with the low-latency segmentation principle mentioned above, thereby ensuring a minimum number of segments while also enabling the code length of the code block corresponding to the segmentation result to satisfy the maximum requirement. The principle of low-latency segmentation is gradually and continuously reduced, so that when the receiving end processes the Polar code encoding result of the segmented result, the decoding delay and transmission delay can be minimized and the impact on the receiving end system can be minimized. The impact of overall delay can minimize the system delay at the receiving end.

The following explains the implementation process of the segmentation method that does not require secondary adjustment of the segmentation results according to the embodiment of the present application with reference to Example 9:

This Example 9 may be an implementation example of the code in the above embodiment, and the method of this example may be called the "direct allocation method".

Example 9

For example, the sending end can obtain the number of information bits included in the data to be transmitted, and use the number of information bits included in the data to be transmitted as the remaining number of information bits to be encoded (or to be segmented) K _m .

For example, the sending end can also obtain the preset mother code length. For example, the preset mother code length here includes 1024 bits, 512 bits, 256 bits, 128 bits, and 64 bits.

For example, the sending end can obtain the number of information bits required to be included in the code block corresponding to each preset mother code length.

Here the sending end can obtain K ₁₀₂₄ , K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , and K ₆₄ .

For example, the sending end may obtain the number p of information bits that need to be included in the last code block in the segmented segmentation result.

For example, the sending end can first segment the data to be transmitted based on Formula 11 to obtain the number N ₁₀₂₄ of code blocks corresponding to a code length of 1024 bits in the segmentation result. Then, the sending end uses Formula 12 to segment the data to be transmitted. The number of information bits K _m to be segmented is updated.

K _m =K _m -K ₁₀₂₄ *N ₁₀₂₄ , formula 12;

For example, the sending end can then continue to segment the data to be transmitted based on Equation 13 to obtain the number N ₅₁₂ of code blocks corresponding to a code length of 512 bits in the segmentation result. Then, the sending end uses Equation 14 to obtain the number of code blocks to be transmitted. The number K _m of information bits to be segmented in the data is updated.

K _m =K _m -K ₅₁₂ *N ₅₁₂ , formula 14;

For example, the sending end can then continue to segment the data to be transmitted based on Formula 15 to obtain the number N ₂₅₆ of code blocks corresponding to a code length of 256 bits in the segmentation result. Then, the sending end uses Formula 16 to The number K _m of information bits to be segmented in the transmitted data is updated.

K _m =K _m -K ₂₅₆ *N ₂₅₆ , formula 16;

For example, the sending end can then continue to segment the data to be transmitted based on Formula 17 to obtain the number N ₁₂₈ of code blocks corresponding to a code length of 128 bits in the segmentation result. Then, the sending end uses Formula 18 to The number K _m of information bits to be segmented in the transmitted data is updated.

K _m =K _m -K ₁₂₈ *N ₁₂₈ , formula 18;

For example, finally, the sending end can continue to segment the data to be transmitted based on Formula 19 to obtain the number N ₆₄ of code blocks corresponding to a code length of 64 bits in the segmentation result.

Because in the

above formulas

11, 13, 15, and 17, when calculating the number of code blocks with corresponding code lengths, the sender can subtract K _m by the code length required for the remaining code blocks to be segmented. In this way, it can be ensured that in addition to the code block with the maximum code length, the remaining code blocks with the code length of the preset mother code length include at least one in the segmentation result.

In the segmentation process of the above embodiment, the sending end can segment the data to be transmitted according to the number of information bits required to be included in the code blocks of each code length, and obtain the code blocks whose code length is the preset mother code length. Quantity to achieve segmentation of data to be transmitted. In this way, when the sending end determines the number of code blocks of each code length, it can be based on the actual code rate of each code block instead of the target code rate, thereby reducing the number of data segments corresponding to the segmentation results, or reducing the number of segments. The number of code blocks corresponding to the result.

In addition, in this embodiment, the code length of each code block corresponding to the segmentation result is continuous and gradually decreases from large to small, so that the segmentation result complies with the above-mentioned low-latency segmentation principle, so that the code length at the receiving end is When the Polar code encoding result of the segmentation result is processed, the impact of decoding delay and transmission delay on the overall system delay of the receiving end can be minimized, and the system delay of the receiving end can be reduced to the greatest extent.

Example 10

In a possible implementation, if the preset mother code length only includes the above 1024 bits, 256 bits and 64 bits, and the sending end sets the last code block in the segmentation result to include at least p information bits, and the sending end can After obtaining K ₁₀₂₄ , K ₂₅₆ , K ₆₄ , and K _m , the sending end first uses the following formula 11' to determine N ₁₀₂₄ , and then updates K _m through the following formula 12; then, the sending end uses the following formula 15' Determine N ₂₅₆ , and then update K _m through Equation 16; finally, the sending end determines N ₆₄ through Equation 19 above.

In this way, the sender segments the data to be transmitted, and the code blocks corresponding to the segmentation results are still arranged in order from large to small code lengths, which not only reduces the number of segments, but also effectively reduces the packet loss rate and improves The receiving sensitivity, and the codes obtained by Polar encoding the segmented code blocks, improve the receiving performance.

Example 11

In a possible implementation, if the preset mother code length only includes the above-mentioned 1024 bits, 256 bits and 64 bits, and the sending end does not set the restriction that the last code block in the segmentation result includes at least p information bits, And the sending end can obtain K ₁₀₂₄ , K ₂₅₆ , K ₆₄ , and K _m , then the sending end first uses the following formula 11" to determine N ₁₀₂₄ , and then updates K _m through the following formula 12; then, the sending end uses the following formula Formula 15" is used to determine N ₂₅₆ , and then K _m is updated through Formula 16; finally, the sending end determines N ₆₄ through the above-mentioned Formula 19.

In a possible implementation, the code lengths of the code blocks corresponding to the segmentation results obtained by the sending end after segmenting the data to be transmitted may not be arranged in order from large to small. In the following, one code length is used Sorting is an example. The implementation principles of other code length sorting methods are similar and will not be described again here.

For example, the preset mother code lengths include 1024 bits, 512 bits, 256 bits, 128 bits, and 64 bits. The ordering of the code lengths corresponding to the segmentation results can be 512 bits, 256 bits, 1024 bits, 64 bits, and 128 bits. .

For example, the sending end can obtain K ₁₀₂₄ , K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , K ₆₄ , K _m and the number of information bits required to be included in the last code block (here, a code block with a code length of 128 bits). p.

Then during specific implementation, the sending end can sort according to the expected code length corresponding to the segmentation result: 512 bits, 256 bits, 1024 bits, 64 bits, 128 bits. First, the sending end can continue to segment the data to be transmitted based on Formula 20. segment to obtain the number N ₅₁₂ of code blocks corresponding to a code length of 512 bits in the segmentation result. Then, the sender updates the number of information bits K _m to be segmented in the data to be transmitted through the above formula 14.

For example, the sending end can then continue to segment the data to be transmitted based on Formula 21 to obtain the number N ₂₅₆ of code blocks corresponding to a code length of 256 bits in the segmentation result. Then, the sending end uses the above Formula 16, The number K _m of information bits to be segmented in the data to be transmitted is updated.

Illustratively, the data to be transmitted is then segmented based on Formula 22 to obtain the number N ₁₀₂₄ of code blocks corresponding to a code length of 1024 bits in the segmentation result. Then, the sending end uses the above Formula 12 to segment the data to be transmitted. The number of information bits K _m to be segmented is updated.

For example, the sending end can then continue to segment the data to be transmitted based on Formula 23 to obtain the number N ₆₄ of code blocks corresponding to a code length of 64 bits in the segmentation result. Then, the sending end uses Formula 24 to The number K _m of information bits to be segmented in the transmitted data is updated.

K _m =K _m -K ₆₄ *N ₆₄ , formula 24;

For example, finally, the sending end can continue to segment the data to be transmitted based on Formula 25 to obtain the number N ₁₂₈ of code blocks corresponding to a code length of 128 bits in the segmentation result.

In this way, without considering the reception delay of the Polar coding of the segmentation results, the direct allocation method of this embodiment uses the actual number of information bits of the code block of each code length for segmentation, compared with the existing technology , it is still possible to reduce the total number of segments and the number of small code blocks of the same code length.

It can be understood that the implementation manners in the above Examples 9 to 11 can be combined with each other to form more implementations, which will not be described again here. In addition, the implementation of the direct allocation method in this application is not limited to Examples 9 to 11, and may also include more implementations not listed. The principles are similar and will not be described again here.

The segmentation process of the above Example 9 is explained below with reference to Figure 6:

As shown in Figure 6, for example, referring to Figure 6(1), the data to be transmitted includes 985 bits, so the initial value of _Km is 985.

For example, as shown in Figure 6, K _x is used to represent the number of information bits that a code block with a code length of 2 ^x corresponding to the segmentation result obtained after segmenting the data to be transmitted needs to include.

For example, as shown in Figure 6, the sending end can obtain K ₁₀₂₄ , K ₅₁₂ , K ₂₅₆ , K ₁₂₈ , and K ₆₄ , where K ₁₀₂₄ =512, K ₅₁₂ =168, K ₂₅₆ =84, and K ₁₂₈ =64 , K ₆₄ =20; the sending end can also obtain the number p of information bits that need to be included in the last code block in the segmented segmentation result. For example, p=10.

In this implementation, as shown in Figure 6(2), the sending end calculates N ₁₀₂₄ = 1 according to the above formula 11, thereby dividing the remaining data to be transmitted into segments as shown in Figure 6(1). There are 985 information bits. According to the arrangement order of the information bits, the first 512 bits are divided into a data segment as shown in Figure 6(2).

For example, as shown in Figure 6(2), the transmitting end can pad the data segment including 512 information bits with zeros according to the code length of 1024 bits to obtain a code block 901 with a code length of 1024 bits. Or, for example, during the segmentation process, the sending end does not need to zero-pad the data segment including the 512 information to obtain the code block 901 with a code length of 1024 bits. The sending end can add the data segment including the 512 information. , marked as information bits corresponding to code block 901 (here, a code block with a code length of 1024 bits, and the first code block among multiple code blocks obtained by segmentation).

For example, as shown in Figure 6(2), after the sending end obtains the code block 901 from the segmented data to be transmitted, the value of K _m can be updated according to Formula 12. The updated value of K _m is 473, such that The remaining information bits to be segmented are 473 bits.

In this implementation, as shown in Figure 6(3), the sending end calculates N ₅₁₂ =2 according to the above formula 13, so that the remaining to-be-segmented data in the data to be transmitted shown in Figure 6(2) can be 473 information bits, according to the arrangement order of the information bits, continue to be segmented to obtain two data segments each including 168 information bits as shown in Figure 6(3). The two data segments can respectively correspond to the code length of 512 bits. Code block 902 and code block 903 with a code length of 512 bits.

The process of changing from Figure 6(2) to Figure 6(3) is similar to the process of changing from Figure 6(1) to Figure 6(2). The similarities will not be described again here.

For example, as shown in Figure 6(3), the sending end can segment the data to be transmitted and obtain the code block 902 and the code block 903, and then update the value of K _m according to Formula 14. The updated value of K _m is 137, so that the remaining information bits to be segmented are 137 bits.

In this implementation, as shown in Figure 6(4), the sending end calculates N ₂₅₆ =1 according to the above formula 15, so that the remaining data to be transmitted as shown in Figure 6(3) can be divided into segments. The 137 information bits are continued to be segmented according to the arrangement order of the information bits to obtain a data segment including 84 information bits as shown in Figure 6(4). This data segment corresponds to the code block 904 with a code length of 256 bits.

The process of changing from Figure 6(3) to Figure 6(4) is similar to the process of changing from Figure 6(2) to Figure 6(3). The similarities will not be described again here.

For example, as shown in Figure 6(4), the sending end can segment the data to be transmitted and obtain the code block 904, and then update the value of K _m according to Formula 16. The updated value of K _m is 53, such that The remaining information bits to be segmented are 53 bits.

In this implementation, as shown in Figure 6(5), the sending end calculates N ₁₂₈ =1 according to the above formula 17, so that the remaining data to be transmitted as shown in Figure 6(4) can be divided into segments. The 53 information bits are continued to be segmented according to the arrangement order of the information bits to obtain a data segment including 41 information bits as shown in Figure 6(5). This data segment corresponds to the code block 905 with a code length of 128 bits.

The process of changing from Figure 6(4) to Figure 6(5) is similar to the process of changing from Figure 6(3) to Figure 6(4). The similarities will not be described again here.

For example, as shown in Figure 6(5), the sending end can segment the data to be transmitted and obtain the code block 905, and then update the value of K _m according to Formula 18. The updated value of K _m is 12, so that The remaining information bits to be segmented are 12 bits.

In this implementation, as shown in Figure 6(6), the sending end calculates N ₆₄ =1 according to the above formula 19, so that the remaining data to be segmented in the data to be transmitted shown in Figure 6(5) can be 12 information bits, as a data segment including 12 information bits as shown in Figure 6 (6), this data segment corresponds to a code block 906 with a code length of 64 bits.

For example, the sending end calculates N ₆₄ according to Formula 19,

In this implementation, when segmenting a data segment with a code length of 64 bits, the remaining information bits to be segmented are only 12 bits, and K ₆₄ =20, then the remaining last 10 bits can correspond to a code length of 64 bits. the last code block.

The process of changing from Figure 6(5) to Figure 6(6) is similar to the process of changing from Figure 6(4) to Figure 6(5). The similarities will not be described again here.

In this way, in this embodiment, the sending end can segment the data to be transmitted to obtain 6 code blocks. The 6 code blocks are arranged in sequence according to the information bit order of the data to be transmitted, and are code blocks 901 with a code length of 1024 bits, followed by The code blocks 902 and 903 have a code length of 512 bits, the code block 904 has a code length of 256 bits, the code block 905 has a code length of 128 bits, and the code block 906 has a code length of 64 bits.

When the preset mother code length, the number of information bits included in the code blocks corresponding to each preset mother code length, and the number of information bits of the data to be transmitted are the same, this application performs a secondary adjustment on the initial segmentation result. The segmentation result of the segmentation method is the same as the segmentation result obtained by directly segmenting the data to be transmitted in this application. The direct segmentation method of this application does not require secondary modification of the segmentation results, and can directly obtain the segmentation results with the minimum total number of segments. For example, compared with the "3-carry method" shown in Figure 5a and the "direct segmentation method" shown in Figure 6, the segmentation result shown in Figure 5a(4) is different from the segmentation result shown in Figure 6(6) The segmentation results are the same.

It should be understood that the above-mentioned Examples 9 to 11 are not used to limit the segmentation method of the present application. The segmentation method of the present application may also include other examples not listed. In addition, any implementation between the above-mentioned Examples 9 to 11 may be They are combined with each other to form an embodiment of the present application. The principles are similar and will not be described again here.

The same reference signs in different sub-figures in Figure 6 have the same meaning. Each figure in Figure 6 is not explained one by one here. Please refer to the corresponding reference signs or diagram content that have been explained in Figure 6 explain.

It should be understood that the number of information bits included in the code blocks and the code length of the code blocks mentioned in the above-mentioned relevant embodiments are only used as examples to facilitate readers to understand the segmentation method of the present application, and are not used to limit the present application. Segmented approach to application.

In one possible implementation, taking the target code rate of 6/8 as an example, the segmentation results of the segmentation method in the prior art are compared with the segmentation results of the segmentation method provided by this application. .

Exemplarily, FIG. 7a is a schematic table diagram of the segmentation results of the segmentation method in the prior art, and FIG. 7b is a schematic table diagram of the segmentation results of the segmentation method provided by this application.

In the tables shown in Figure 7a and Figure 7b respectively, the meanings of the fields in the tables are the same as the meanings of the corresponding fields in the above-mentioned Table 2, and will not be described again here.

In Figure 7a and Figure 7b, N1024 has the same meaning as N ₁₀₂₄ above, N512 has the same meaning as N ₅₁₂ , N256 has the same meaning as N ₂₅₆ ; N128 has the same meaning as N ₁₂₈ ; N64 has the same meaning as N ₆₄ .

For example, N ₁₀₂₄ , N ₅₁₂ , N ₂₅₆ , N ₁₂₈ , and N ₆₄ are respectively used to represent the number of segments of the corresponding code length (here, the code length after encoding, that is, the mother code length), that is, code blocks of different code lengths quantity.

Comparing Figure 7a and Figure 7b, under the condition of some information bit length K, the segmentation method of the present application can reduce the number of data to be transmitted (here including the total information bits K and 24) compared with the segmentation method in the prior art. The total number of segments of the segmentation result is the check bit of the bit) to reduce the number of segments, and it can also avoid segmentation to obtain 3 code blocks of the same code length to reduce the number of small code blocks.

For example, comparing the dotted box 1001a in Figure 7a and the dotted box 1001b in Figure 7b, when the sum of the information bit K and the 24-bit CRC is 1240 bits, or 1248 bits, as shown in the dotted box 1001a, now In the segmentation results obtained by the segmentation method in the prior art, the number N64 corresponding to the code blocks with a code length of 64 bits is 3, and the total number of segments is 8. When the CRC of information bits K+24 is 1240 bits, or 1248 bits, as shown in the dotted box 1001b, in the segmentation results obtained by the segmentation method of this application, N64 is 1, and the total number of segments is 6. Obviously, when the sum of the information bit K and the 24-bit CRC is 1240 bits, or 1248 bits, the segmentation method of this application can reduce the number of small code blocks, reduce the total number of segments, and avoid three identical code lengths. small chunks of code.

For example, comparing the dotted box 1002a in Figure 7a and the dotted box 1002b in Figure 7b, when the sum of the information bit K and the 24-bit CRC is 1328 bits, or 1336 bits, or 1344 bits, as shown in the dotted box 1002a As shown in the figure, in the segmentation results obtained by the segmentation method in the prior art, the number N64 corresponding to the code blocks with a code length of 64 bits is 3, and the total number of segments is 8. When the sum of the information bit K and the 24-bit CRC is 1328 bits, or 1336 bits, or 1344 bits, as shown in the dotted box 1002b, in the segmentation result obtained by the segmentation method of this application, N64 is 1, and the total score The number of segments is 7. Obviously, when the CRC of information bits K+24 is 1328 bits, or 1336 bits, or 1344, the segmentation method of this application can reduce the number of small code blocks, reduce the total number of segments, and avoid the occurrence of three identical codes. Long small blocks of code.

For example, comparing the dotted box 1003a in Figure 7a and the dotted box 1003b in Figure 7b, when the sum of the information bit K and the 24-bit CRC is 1432 bits, or 1440 bits, as shown in the dotted box 1003a, now In the segmentation results obtained by the segmentation method in the prior art, the number N64 corresponding to the code blocks with a code length of 64 bits is 3, and the total number of segments is 9. When the sum of the information bit K and the 24-bit CRC is 1432 bits, or 1440 bits, as shown in the dotted box 1003b, in the segmentation results obtained by the segmentation method of this application, N64 is 1, and the total number of segments is 5. Obviously, when the CRC of information bits K + 24 bits is 1432 bits, or 1440 bits, the segmentation method of this application can reduce the number of small code blocks and the total number of segments, and avoid the occurrence of three small code blocks with the same code length. code block.

For example, comparing the dotted box 1004a in Figure 7a and the dotted box 1004b in Figure 7b, when the sum of the information bit K and the 24-bit CRC is 1520 bits, or 1528 bits, or 1536 bits, as shown in the dotted box 1004a As shown in the figure, in the segmentation results obtained by the segmentation method in the prior art, the number N64 corresponding to the code blocks with a code length of 64 bits is 3, and the total number of segments is 7. When the sum of the information bit K and the 24-bit CRC is 1520 bits, or 1528 bits, or 1536 bits, as shown in the dotted box 1004b, in the segmentation result obtained by the segmentation method of this application, N64 is 1, and the total score The number of segments is 6. Obviously, when the CRC of information bits K + 24 bits is 1520 bits, or 1528 bits, or 1536 bits, the segmentation method of this application can reduce the number of small code blocks and the total number of segments, avoiding the occurrence of three identical Small chunks of code length.

In this way, compared with the segmentation method in the prior art, this application can obtain a smaller number of segments under the condition of some information bit length K, and avoid the appearance of three identical code blocks in the segmentation results. Small chunks of code length.

It should be noted that the above-mentioned segmentation method of adjusting the initial segmentation result of this application has the same segmentation results as the segmentation method of directly performing segmentation. Compared with the segmentation method in the prior art, both can be This achieves the effect of reducing the total number of segments and the number of small code blocks.

In a possible implementation, for different code rates (here, target code rates) and different information bit lengths K, the sending end can calculate the total score corresponding to the segmentation results of the segmentation method in the prior art. The number of segments is compared with the total number of segments corresponding to the segmentation results of the segmentation method of this application.

Exemplarily, Figure 8 illustrates the conditions under different code rates (here including 5/8 code rate, 6/8 code rate, 7/8 code rate) and under different information bit lengths K. Below is the difference in the total number of segments corresponding to the segmentation method in the prior art and the segmentation method of the present application. That is, compared with the segmentation method in the prior art, the segmentation method of the present application can reduce the total number of segments.

In Figure 8, the horizontal axis is the information bit length K, and the vertical axis is the reduced number of segments. The vertical axis here represents the total number of segments corresponding to the segmentation method of this application. Compared with the segmentation method in the prior art, The corresponding reduction in the total number of segments.

For example, in Figure 8, the data to be transmitted can be the original total information bits K, or data composed of the total information bits K and the CRC check bits. There is no limitation here.

For example, it can be seen from Figure 8 that the total number of segments corresponding to the segmentation results of the segmentation method of the present application is less than or equal to the total number of segments corresponding to the segmentation results of the segmentation method in the prior art, and , compared with the total number of segments corresponding to the segmentation method in the prior art, the total number of segments corresponding to the segmentation method of this application can be reduced by up to 4 segments, that is, up to 4 code blocks can be reduced.

For example, as shown in Figure 8, under the condition of code rate 6/8 and different information bit length K, compared with the segmentation method in the prior art, the segmentation method of the present application achieves The total number of segments that can be reduced is shown separately in Figure 9a.

Among them, the meanings of the coordinate diagrams in Figure 9a and Figure 8 are the same and will not be described again here.

For example, as shown in Figure 9a, when the information bit length is K1, the segmentation method of the present application can reduce the number of segments indicated by the dotted circle 2001 compared to the segmentation method in the prior art. , here is 1, that is, one data segment (or one code block) is reduced.

For example, as shown in Figure 9a, when the information bit length is K2, the segmentation method of the present application can reduce the number of segments indicated by the dotted circle 2002 compared to the segmentation method in the prior art. , here is 2, that is, 2 data segments (or 2 code blocks) are reduced.

For example, as shown in Figure 9a, when the information bit length is K3, the segmentation method of the present application can reduce the number of segments indicated by the dotted circle 2003 compared to the segmentation method in the prior art. , here is 4, that is, 4 data segments (or 4 code blocks) are reduced.

For example, as shown in Figure 9a, for the 6/8 code rate, three different information bit lengths K1, K2, and K3 are selected. In Figure 9b, for the 3/4 code rate, the segmentation method in the prior art and the segmentation method of this application are compared under different conditions of information bit length K1, information bit length K2, and information bit length K3. , the received packet loss rate (PER) under different signal-to-noise ratios (SNR), and the probability of receiving errors.

For example, in Figure 9b(1), for the 3/4 code rate, under the condition of the information bit length K1, the segmentation method in the prior art and the segmentation method of the present application are compared, under different SNRs The curve of the receiving packet loss rate (PER), where the packet loss rate can also be the probability of receiving errors. Among them, in Figure 9b(1), curve 3001 represents the curve corresponding to the segmentation method in the prior art, and curve 3002 represents the curve corresponding to the segmentation method of the present application.

In Figure 9b(2), for the 3/4 code rate, under the condition of information bit length K2, the segmentation method in the prior art and the segmentation method of this application are compared. The receiving packet loss under different SNR The curve of packet loss rate (PER), where the packet loss rate can also be the probability of receiving errors. Among them, in Figure 9b(2), curve 4001 represents the curve corresponding to the segmentation method in the prior art, and curve 4002 represents the curve corresponding to the segmentation method of the present application.

In Figure 9b(3), for the 3/4 code rate, under the condition of information bit length K3, the segmentation method in the prior art and the segmentation method of this application are compared. The receiving packet loss under different SNR The curve of packet loss rate (PER), where the packet loss rate can also be the probability of receiving errors. Among them, in Figure 9b(3), curve 5001 represents the curve corresponding to the segmentation method in the prior art, and curve 5002 represents the curve corresponding to the segmentation method of the present application.

As can be seen from Figure 9b, compared with the segmentation method in the prior art, the segmentation method of this application can reduce the packet loss rate and improve the reception sensitivity by reducing the number of segments.

In summary, in any of the above embodiments, the segmentation method of the present application can reduce the total number of segments compared to the segmentation methods in the prior art, thereby reducing the number of segments corresponding to the segmentation results. Then by reducing the total number of segments and reducing the number of small code blocks of the same code length to less than 3, the packet loss rate can be reduced and the reception sensitivity of the encoding results of the segmented code blocks can be improved to improve the code block The receiving performance of performance.

In a possible implementation, FIG. 10 is a schematic structural diagram of a data processing device provided by an embodiment of the present application. As shown in Figure 10, the data processing device 500 may include: a processor 501, a transceiver 505, and optionally a memory 502.

The transceiver 505 may be called a transceiver unit, a transceiver, a transceiver circuit, etc., and is used to implement transceiver functions. The transceiver 505 may include a receiver and a transmitter. The receiver may be called a receiver or a receiving circuit, etc., used to implement the receiving function; the transmitter may be called a transmitter, a transmitting circuit, etc., used to implement the transmitting function.

Computer program or software code or instructions 504 may be stored in the memory 502, which may also be referred to as firmware. The processor 501 can implement the data processing method provided by each embodiment of the present application by running the computer program or software code or instructions 503 therein, or by calling the computer program or software code or instructions 504 stored in the memory 502 . The processor 501 may be a central processing unit (CPU), and the memory 502 may be a read-only memory (ROM) or a random access memory (RAM).

The processor 501 and transceiver 505 described in this application can be implemented in integrated circuits (ICs), analog ICs, radio frequency integrated circuits RFICs, mixed signal ICs, application specific integrated circuits (ASICs), printed circuits on printed circuit board (PCB), electronic equipment, etc.

The above-mentioned data processing device 500 may also include an antenna 506. Each module included in the data processing device 500 is only an example and is not limited by this application.

The structure of the data processing device may not be limited by FIG. 10 . The data processing apparatus may be a stand-alone device or may be part of a larger device. For example, the implementation form of the data processing device may be:

(1) An independent integrated circuit IC, or chip, or chip system or subsystem; (2) A collection of one or more ICs. Optionally, the IC collection may also include storage for storing data and instructions. Components; (3) Modules that can be embedded in other equipment; (4) Vehicle-mounted equipment, etc.; (5) Others, etc.

For the case where the data processing device is implemented in the form of a chip or a chip system, please refer to the schematic structural diagram of the chip shown in Figure 11 . The chip shown in Figure 11 includes a processor 601 and an interface 602. The number of processors 601 may be one or more, and the number of interfaces 602 may be multiple. Optionally, the chip or chip system may include memory 603 .

All relevant content of each step involved in the above method embodiments can be quoted from the functional description of the corresponding functional module, and will not be described again here.

Based on the same technical concept, embodiments of the present application also provide a computer-readable storage medium. The computer-readable storage medium stores a computer program. The computer program includes at least one section of code. The at least one section of code can be executed by a computer to control the computer. Used to implement the above data processing method embodiments.

Based on the same technical concept, embodiments of the present application also provide a computer program, which, when executed by a terminal device, is used to implement the above data processing method embodiments.

The program may be stored in whole or in part on a storage medium packaged with the processor, or in part or in whole on a memory that is not packaged with the processor.

Based on the same technical concept, embodiments of the present application also provide a chip including a processor. The processor can implement the above data processing method embodiments.

The steps of the methods or algorithms described in connection with the disclosure of the embodiments of this application can be implemented in hardware or by a processor executing software instructions. Software instructions can be composed of corresponding software modules. Software modules can be stored in random access memory (Random Access Memory, RAM), flash memory, read only memory (Read Only Memory, ROM), erasable programmable read only memory ( Erasable Programmable ROM (EPROM), electrically erasable programmable read-only memory (Electrically EPROM, EEPROM), register, hard disk, removable hard disk, compact disc (CD-ROM) or any other form of storage media well known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and storage media may be located in an ASIC.

Those skilled in the art should realize that in one or more of the above examples, the functions described in the embodiments of the present application can be implemented using hardware, software, firmware, or any combination thereof. When implemented using software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. Storage media can be any available media that can be accessed by a general purpose or special purpose computer.

The embodiments of the present application have been described above in conjunction with the accompanying drawings. However, the present application is not limited to the above-mentioned specific implementations. The above-mentioned specific implementations are only illustrative and not restrictive. Those of ordinary skill in the art will Inspired by this application, many forms can be made without departing from the purpose of this application and the scope protected by the claims, all of which fall within the protection of this application.

Claims

A data processing method, characterized in that the method includes:

Get the first data;

Perform segmentation processing on the first data to obtain a target segmentation result, where the target segmentation result corresponds to n code lengths, and each of the n code lengths except the maximum code length and the minimum code length The number of segments corresponding to a code length is less than or equal to 2, where n is an integer and n≥2.
The method according to claim 1, characterized in that, performing segmentation processing on the first data to obtain target segmentation results includes:

According to the order of the n code lengths from large to small, based on the remaining number of information bits to be segmented in the first data, the first data is segmented to obtain the target segmentation result.
The method according to claim 2, characterized in that, in order of the n code lengths from large to small, based on the remaining number of information bits to be segmented in the first data, the first The data is segmented to obtain target segmentation results, including:

In descending order of the n code lengths, the number of first information bits required to be included in the segment corresponding to the i-th code length among the n code lengths, and the remaining bits in the first data The number of information bits to be segmented determines the maximum number of segmented segments j corresponding to the i-th code length;

According to the maximum number of segments j corresponding to the i-th code length, perform segmentation processing on the first data to obtain the target segmentation result, wherein the number of segments corresponding to the i-th code length is j;

Among them, 1≤i≤n, i, j are all positive integers.
The method according to claim 3, characterized in that, in order of the n code lengths from large to small, the segment corresponding to the i-th code length among the n code lengths needs to include The first number of information bits, and the remaining number of information bits to be segmented in the first data, determine the maximum number of segmented segments j corresponding to the i-th code length, including:

According to the order of the n code lengths from large to small, the number of first information bits required to be included in the segment corresponding to the i-th code length among the n code lengths, and, the remaining number in the first data The number of second information bits to be allocated to the i-th code length is determined by determining the maximum number of segments j corresponding to the i-th code length;

Wherein, the second number of information bits is the difference between the number of remaining information bits to be segmented in the first data and the third number of information bits;

Wherein, the third number of information bits is the sum of the number of information bits required to be included in each segment corresponding to the fourth code length;

Wherein, the fourth code length is a code length smaller than the i-th code length among the n code lengths.
The method according to claim 1, characterized in that, performing segmentation processing on the first data to obtain target segmentation results includes:

Obtain the initial segmentation result corresponding to the first data;

In the case where the initial segmentation result includes a first segment with a segment number greater than or equal to 2, merge at least two of the first segments into at least one second segment with a second code length to obtain the target segment. Segment result, wherein the first segment corresponds to the same first code length, and the second code length is greater than the first code length.
The method of claim 5, wherein merging at least two first segments into a second segment with a second code length includes:

In order of code length from small to large, at least two first segments in the initial segmentation results are merged into second segments of the second code length.
The method according to claim 5 or 6, characterized in that merging at least two first segments into a second segment with a second code length includes:

Combine at least two of the first segments and a target number of information bits into a second segment of the second code length;

Wherein, the target number of information bits comes from: a third segment with a third code length corresponding to the initial segmentation result, wherein the third code length is smaller than the first code length.
The method according to any one of claims 5 to 7, characterized in that the initial segmentation results are arranged in order from large to small code lengths.
The method according to any one of claims 5 to 8, wherein the at least two first segments are arranged adjacently in the initial segmentation result.
The method according to any one of claims 5 to 9, characterized in that the second code length is twice the first code length.
The method according to any one of claims 5 to 10, characterized in that the first code length is a code length other than the maximum code length among the n code lengths.
The method according to any one of claims 1 to 11, characterized in that the minimum code length among the n code lengths, the number of information bits included in the corresponding segment in the target segmentation result is greater than or Equal to p, where p is a positive integer, and the number of segments corresponding to the minimum code length is less than or equal to 3.
The method according to any one of claims 1 to 12, characterized in that the target segmentation results are arranged in descending order of the n code lengths.
A data processing device, characterized in that the device includes:

The first acquisition module is used to acquire the first data;

A segmentation module is used to segment the first data and obtain a target segmentation result, where the target segmentation result corresponds to n code lengths, and the n code lengths are divided into the largest code length and the smallest code length. The number of segments corresponding to each code length other than the code length is less than or equal to 2, where n is an integer and n≥2.
The device according to claim 14, characterized in that:

The segmentation module is specifically configured to perform segmentation processing on the first data based on the remaining number of information bits to be segmented in the first data in descending order of the n code lengths, Get the target segmentation results.
The device according to claim 15, characterized in that the segmentation module is specifically used for:

In descending order of the n code lengths, the number of first information bits required to be included in the segment corresponding to the i-th code length among the n code lengths, and the remaining bits in the first data The number of information bits to be segmented determines the maximum number of segmented segments j corresponding to the i-th code length;

According to the maximum number of segments j corresponding to the i-th code length, perform segmentation processing on the first data to obtain the target segmentation result, wherein the number of segments corresponding to the i-th code length is j;

Among them, 1≤i≤n, i, j are all positive integers.
The device according to claim 16, characterized in that:

The segmentation module is specifically configured to, in descending order of the n code lengths, based on the first number of information bits required to be included in the segment corresponding to the i-th code length among the n code lengths, And, the remaining number of second information bits in the first data to be allocated to the i-th code length determines the maximum number of segments j corresponding to the i-th code length;

Wherein, the second number of information bits is the difference between the number of remaining information bits to be segmented in the first data and the third number of information bits;

Wherein, the third number of information bits is the sum of the number of information bits required to be included in each segment corresponding to the fourth code length;

Wherein, the fourth code length is a code length smaller than the i-th code length among the n code lengths.
The device according to claim 14, characterized in that the segmentation module is specifically used for:

Obtain the initial segmentation result corresponding to the first data;

In the case where the initial segmentation result includes a first segment with a segment number greater than or equal to 2, merge at least two of the first segments into at least one second segment with a second code length to obtain the target segment. Segment result, wherein the first segment corresponds to the same first code length, and the second code length is greater than the first code length.
A computer-readable storage medium, characterized by comprising a computer program, which when the computer program is run on a computer or processor, causes the computer or processor to execute any one of claims 1 to 13 the method described.
A data processing device, characterized in that it includes one or more interface circuits and one or more processors; the interface circuit is used to receive a signal from a memory and send the signal to the processor, and the signal Comprising computer instructions stored in a memory; when the processor executes the computer instructions, the processor is configured to perform the method according to any one of claims 1 to 13.
A computer program product, characterized in that the computer program product includes a software program that, when executed by a computer or processor, causes the steps of the method according to any one of claims 1 to 13 to be executed .