Transmission block segmentation method, apparatus and electronic device for wireless communication

Abstract

The application provides a transmission block segmentation method, device and electronic equipment for wireless communication. The method comprises the following steps: obtaining an original bit sequence of a packaged transmission block, wherein the original bit sequence comprises a data information sequence and a cyclic redundancy check sequence; calculating a segmentation number according to the original bit sequence to obtain a target segmentation number; in the case that the length of the original bit sequence is an integer multiple of the target segmentation number, segmenting the processed original bit sequence according to the target segmentation number; in the case that the length of the original bit sequence is not an integer multiple of the target segmentation number, expanding the original bit sequence to an integer multiple of the target segmentation number to obtain a target bit sequence, and segmenting the processed target bit sequence according to the target segmentation number. The method solves the problem that in the prior art, in the case that the length of the transmission block is not an integer multiple of the segmentation number, the transmission fails due to the mismatch of the segmentation of the transmitting and receiving parties.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and more specifically, to a method, apparatus, computer-readable storage medium, and electronic device for wireless communication transport block segmentation. Background Technology

[0002] In the StarBlink wireless communication SLB system, physical layer data information includes two types: Type I data information and Type II data information. Type I data information only supports pre-configured scheduled transmission and is mainly used for short data packet transmission. During data transmission, Type I data information needs to be encapsulated into transmission blocks, then these blocks are segmented before transmission.

[0003] In traditional methods, the number of segments is calculated based on parameters such as channel bits and code rate. However, since the transport block length is not necessarily an integer multiple of the number of segments, the segment length of each code block may not be uniform. In the case of inconsistent segment lengths, transmission failure may occur due to the mismatch of segments between the sender and receiver. Summary of the Invention

[0004] The main objective of this application is to provide a method, apparatus, computer-readable storage medium, and electronic device for segmenting transport blocks in wireless communication, so as to at least solve the problem in the prior art where transmission failure occurs due to segment mismatch between the sender and receiver when the transport block length is not an integer multiple of the number of segments.

[0005] To achieve the above objectives, according to one aspect of this application, a method for segmenting transport blocks in wireless communication is provided, comprising: obtaining an original bit sequence encapsulating a transport block, the original bit sequence including a data information sequence and a cyclic redundancy check sequence; calculating the number of segments based on the original bit sequence to obtain a target number of segments; segmenting the processed original bit sequence according to the target number of segments if the length of the original bit sequence is an integer multiple of the target number of segments; and expanding the original bit sequence to an integer multiple of the target number of segments if the length of the original bit sequence is not an integer multiple of the target number of segments to obtain a target bit sequence, and segmenting the processed target bit sequence according to the target number of segments.

[0006] Optionally, obtaining the original bit sequence of the encapsulated transport block includes: determining the number of encapsulations and the sampling bit width of the first type of data information; constructing a data information sequence based on the number of encapsulations and the sampling bit width, wherein the first type of data information is data information in the physical layer data information of the StarSpark system that only supports pre-configured transmission scheduling; calculating a cyclic redundancy check sequence based on the data information sequence, wherein the length of the cyclic redundancy check sequence is a preset length; and concatenating the data information sequence and the cyclic redundancy check sequence into the original bit sequence.

[0007] Optionally, the original bit sequence is expanded to an integer multiple of the target number of segments to obtain the target bit sequence, including: determining the estimated number of transmitted bits based on the target number of segments, wherein the formula for calculating the estimated number of transmitted bits is as follows: In the formula, A is the estimated number of transmitted bits, C is the target number of segments, N is the number of encapsulations, K is the sampling bit width, L is the length of the cyclic redundancy check sequence, and D is any positive integer. When the estimated number of transmitted bits is greater than the length of the original bit sequence, extension bits are added between the data information sequence and the cyclic redundancy check sequence until the length of the original bit sequence is equal to the estimated number of transmitted bits, thus obtaining the target bit sequence.

[0008] Optionally, the number of segments is calculated based on the original bit sequence to obtain the target number of segments, including: obtaining the code rate of the transmission channel; if the code rate is greater than or equal to the preset code rate, determining the target number of segments based on the total number of bits in the channel and the length of the mother code; if the code rate is less than the preset code rate, determining the target number of segments based on the length of the original bit sequence and the length of the mother code.

[0009] Optionally, determining the target number of segments based on the total number of channel bits and the mother code length includes: calculating the number of candidate segments based on the total number of channel bits and the mother code length, wherein the formula for calculating the number of candidate segments is as follows: In the formula, As alternative segment numbers, The total number of channel bits. The length of the parent code in the Polar encoding; subject to the first preset condition, the number of candidate segments is substituted into the formula. Calculate the target number of segments, where C is the target number of segments, and the first preset condition is... , and Here, mod is the modulo operation, R is the bitrate, and if R > 2 / 3, then T = 192. If R ≤ 2 / 3, then T = 384 / 4096. / 4096; If the first preset condition is not met, substitute the number of candidate segments into the formula. Calculate the target number of segments.

[0010] Optionally, determining the target number of segments based on the length of the original bit sequence and the mother code length includes: calculating the number of candidate segments based on the length of the original bit sequence and the mother code length, wherein the formula for calculating the number of candidate segments is as follows: In the formula, N is the number of packages, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence. The length of the parent code in Polar encoding. The number of candidate segments is used; under the condition that the second preset condition is met, the number of candidate segments is substituted into the formula. Calculate the target number of segments, where, satisfy , The maximum input length of the channel interleaver is denoted as 1. The second preset condition is that the number of transmission layers is greater than 1 or the modulation scheme is not QPSK. If the second preset condition is not met, the number of candidate segments is determined as the target number of segments.

[0011] Optionally, obtaining the code rate of the transmission channel includes: calculating the code rate based on the length of the original bit sequence and the total number of bits in the channel, wherein the code rate is calculated using the following formula: In the formula, R is the bit rate, N is the number of encapsulations, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence.

[0012] According to another aspect of this application, a transport block segmentation apparatus for wireless communication is provided. The apparatus includes: an acquisition unit for acquiring an original bit sequence encapsulating a transport block, the original bit sequence including a data information sequence and a cyclic redundancy check sequence; a calculation unit for calculating the number of segments based on the original bit sequence to obtain a target number of segments; a first processing unit for segmenting the processed original bit sequence according to the target number of segments when the length of the original bit sequence is an integer multiple of the target number of segments; and a second processing unit for expanding the original bit sequence to an integer multiple of the target number of segments to obtain a target bit sequence when the length of the original bit sequence is not an integer multiple of the target number of segments, and segmenting the processed target bit sequence according to the target number of segments.

[0013] According to another aspect of this application, a computer-readable storage medium is provided, the computer-readable storage medium including a stored program, wherein, when the program is executed, it controls the device on which the computer-readable storage medium is located to perform any of the methods described.

[0014] According to another aspect of this application, an electronic device is provided, comprising: one or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including methods for performing any one of the methods described.

[0015] Applying the technical solution of this application, in the above-mentioned wireless communication transport block segmentation method, firstly, the original bit sequence encapsulating the transport block is obtained, the original bit sequence including a data information sequence and a cyclic redundancy check sequence; then, the number of segments is calculated based on the original bit sequence to obtain the target number of segments; subsequently, if the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments; finally, if the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments. This application, by adjusting the transport block length and the number of segments to an integer multiple relationship when they do not satisfy the relationship, ensures that the number of information bits in each segmented code block is the same, thereby guaranteeing that the segmentation method of the transmitting and receiving parties is the same, and solving the problem in the prior art where transmission failure occurs due to segmentation mismatch between the transmitting and receiving parties when the transport block length is not an integer multiple of the number of segments. Attached Figure Description

[0016] Figure 1 A hardware structure block diagram of a mobile terminal for a wireless communication transport block segmentation method provided in an embodiment of this application is shown.

[0017] Figure 2 A flowchart illustrating a transport block segmentation method for wireless communication according to an embodiment of this application is shown.

[0018] Figure 3 A schematic diagram of a segmented structure of an original bit sequence according to an embodiment of this application is shown;

[0019] Figure 4 A schematic diagram of a segmented structure of a target bit sequence according to an embodiment of this application is shown;

[0020] Figure 5 A structural block diagram of a wireless communication transport block segmentation device according to an embodiment of this application is shown. Detailed Implementation

[0021] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. This application will now be described in detail with reference to the accompanying drawings and embodiments.

[0022] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0023] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate for the embodiments of this application described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0024] As described in the background section, in existing technologies, the number of segments is calculated based on parameters such as channel bits and code rate. However, since the transmission block length is not necessarily an integer multiple of the number of segments, the segment length of each code block may not be uniform. In the case of inconsistent segment lengths, transmission failure may occur due to segment mismatch between the sender and receiver. To solve the problem of transmission failure caused by segment mismatch between the sender and receiver when the transmission block length is not an integer multiple of the number of segments in existing technologies, embodiments of this application provide a transmission block segmentation method, apparatus, computer-readable storage medium, and electronic device for wireless communication.

[0025] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.

[0026] The methods and embodiments provided in this application can be executed on a mobile terminal, computer terminal, or similar computing device. Taking running on a mobile terminal as an example, Figure 1 This is a hardware structure block diagram of a mobile terminal using a wireless communication transport block segmentation method according to an embodiment of the present invention. Figure 1 As shown, a mobile terminal may include one or more ( Figure 1 Only one is shown in the diagram. A processor 102 (which may include, but is not limited to, a microprocessor MCU or a programmable logic device FPGA, etc.) and a memory 104 for storing data are also shown. The mobile terminal may further include a transmission device 106 for communication functions and an input / output device 108. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the mobile terminal described above. For example, the mobile terminal may also include components that are more... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown.

[0027] The memory 104 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the wireless communication transport block segmentation method in this embodiment of the invention. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, thereby implementing the above-described method. The memory 104 may include high-speed random access memory and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to the mobile terminal via a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof. The transmission device 106 is used to receive or send data via a network. Specific examples of the aforementioned networks may include wireless networks provided by the mobile terminal's communication provider. In one example, the transmission device 106 includes a network interface controller (NIC), which can be connected to other network devices via a base station to communicate with the Internet. In one example, the transmission device 106 may be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0028] This embodiment provides a method for transmitting block segmentation in wireless communication that runs on a mobile terminal, computer terminal, or similar computing device. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0029] Figure 2 This is a flowchart of a wireless communication transport block segmentation method according to an embodiment of this application. Figure 2 As shown, the method includes the following steps:

[0030] Step S201: Obtain the original bit sequence of the encapsulated transport block. The original bit sequence includes the data information sequence and the cyclic redundancy check sequence.

[0031] Specifically, the original bit sequence of the encapsulated transport block is obtained, which consists of a bit sequence (data information sequence) of the encapsulated transport block containing the first type of data information to be transmitted and a cyclic redundancy check bit sequence (cyclic redundancy check sequence).

[0032] Step S202: Calculate the number of segments based on the original bit sequence to obtain the target number of segments;

[0033] Specifically, based on the number of encapsulations N in the transport block, the sampling bit width K, and the cyclic redundancy check bit length L, combined with the channel code rate R and the maximum number of encapsulations N, max The value relationship is used to determine the number of segments C through mathematical operations.

[0034] Step S203: If the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments.

[0035] Specifically, when the length of the original bit sequence is exactly an integer multiple of the target number of segments, the original bit sequence can be segmented into equal-length segments based on the target number of segments. This ensures that the number of bits contained in each segment is consistent, further guaranteeing the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver.

[0036] Step S204: If the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments.

[0037] Furthermore, when the length of the original bit sequence cannot be divided by the target number of segments, this application sets up an extension of the original bit sequence until the extended sequence is an integer multiple of the target number of segments. This also enables the original bit sequence to be segmented into equal-length segments according to the target number of segments, ensuring that each segment contains the same number of bits. This further guarantees the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver, thus avoiding transmission failures caused by segmentation inconsistencies due to non-integer multiples of length.

[0038] This embodiment first obtains the original bit sequence of the encapsulated transport block, which includes a data information sequence and a cyclic redundancy check (CRC) sequence. Then, it calculates the number of segments based on the original bit sequence to obtain the target number of segments. Next, if the length of the original bit sequence is an integer multiple of the target number of segments, it segments the processed original bit sequence according to the target number of segments. Finally, if the length of the original bit sequence is not an integer multiple of the target number of segments, it expands the original bit sequence to an integer multiple of the target number of segments to obtain the target bit sequence, which is then segmented according to the target number of segments. This application adjusts the transport block length and the number of segments to an integer multiple relationship when they are not, ensuring that the number of information bits in each segmented block is the same. This guarantees that the segmentation method is the same for both the sender and receiver, thus solving the problem in the prior art where transmission failure occurs due to segmentation mismatch between the sender and receiver when the transport block length is not an integer multiple of the number of segments.

[0039] To obtain the original bit sequence described above, in one optional implementation, step S201 includes:

[0040] Step S2011: Determine the number of encapsulations and sampling bit width of the first type of data information, and construct a data information sequence based on the number of encapsulations and sampling bit width. The first type of data information is the data information in the physical layer data information of the Star Flash system that only supports pre-configured transmission scheduling.

[0041] Specifically, the number N of encapsulated data items and the sampling bit width K of the first type of data information are determined. This allows us to determine the aforementioned data information sequence. .

[0042] In one specific embodiment, a schematic diagram of the structure of the original bit sequence described above is shown below. Figure 3 As shown, where, The above data information sequence, For the aforementioned cyclic redundancy check sequence, the traditional segmentation method will generate some redundancy, so that if the segments of the sender and receiver are inconsistent, it will lead to transmission failure.

[0043] Step S2012: Calculate the cyclic redundancy check sequence based on the data information sequence. The length of the cyclic redundancy check sequence is a preset length.

[0044] Specifically, the aforementioned cyclic redundancy check (CRC) sequence is used for CRC verification of the transmission result. Therefore, after determining the aforementioned data information sequence, the aforementioned cyclic redundancy check sequence can be calculated. .

[0045] Step S2013: Concatenate the data information sequence and the cyclic redundancy check sequence into the original bit sequence.

[0046] Specifically, by concatenating the above data information sequence and the cyclic redundancy check sequence, we obtain the following: Figure 3 The original bit sequence is shown.

[0047] To ensure that the transmitting and receiving sides consistently determine the segmentation boundaries of the encapsulated transmission block, in one optional implementation, step S203 includes:

[0048] Step S2031: Determine the estimated number of transmitted bits based on the target number of segments. The formula for calculating the estimated number of transmitted bits is as follows: In the formula, A is the estimated number of transmitted bits, C is the target number of segments, N is the number of encapsulations, K is the sampling bit width, L is the length of the cyclic redundancy check sequence, and D is any positive integer;

[0049] Specifically, after calculating the target number of segments C of the encapsulated transport block, the minimum number of bits required to ensure that the length of the encapsulated transport block is an integer multiple of the target number of segments and meets the transmission requirements of the first type of data information can be estimated based on the target number of segments. This is the estimated number of transmission bits A mentioned above, and its calculation formula is as follows: .

[0050] Step S2032: If the estimated number of transmitted bits is greater than the length of the original bit sequence, add extension bits between the data information sequence and the cyclic redundancy check sequence until the length of the original bit sequence is equal to the estimated number of transmitted bits, and obtain the target bit sequence.

[0051] Specifically, when the estimated number of transmitted bits is greater than the length of the original bit sequence, that is... In this case, it can be determined that the original bit sequence needs to be further expanded, that is, the bit sequence... Expand to Among them, the above It can be represented as follows:

[0052] .

[0053] It is understood that in the above embodiments, only the expansion position of the above data information sequence is described. In fact, after the data information sequence is expanded, the cyclic redundancy check sequence needs to be recalculated and updated.

[0054] In one specific embodiment, such as Figure 4 As shown, for memory read and write operations, the value of D can be set to D=8. That is, the formula for estimating the number of bits to be transmitted is updated as follows: Each segmented code block contains the same number of information bits. This facilitates memory reading and writing.

[0055] Through the above embodiments, by combining the encapsulation format, sampling bit width, cyclic redundancy check sequence length, and positive integer D, the number of transmitted bits is accurately calculated. Then, the original bit sequence is expanded according to the number of transmitted bits to form a target bit sequence with controllable structure and the shortest possible length. This ensures that the number of bits in each code block is the same during subsequent segmentation, and achieves segmentation matching of the encapsulated transmission block at both the transmitting and receiving ends.

[0056] To determine the target number of segments, in one optional implementation, step S202 includes:

[0057] Step S2021: Obtain the code rate of the transmission channel;

[0058] Specifically, the code rate R of the transmission channel is obtained, where the value of R should satisfy that R is less than the highest target code rate Rmax.

[0059] Step S2022: If the code rate is greater than or equal to the preset code rate, determine the target number of segments based on the total number of channel bits and the mother code length.

[0060] Specifically, the preset code rate is 5 / 32. When the code rate is greater than or equal to the preset code rate, the number of segments is calculated based on the total number of channel bits and the length of the mother code to meet the need to maximize the utilization of channel resources under high code rates.

[0061] Step S2023: If the code rate is less than the preset code rate, determine the target number of segments based on the length of the original bit sequence and the length of the mother code.

[0062] Specifically, when the code rate is less than the preset code rate, the number of segments is calculated based on the length of the original bit sequence and the length of the mother code to match the inherent size of the transport block structure under low code rate.

[0063] Through the above embodiments, based on the comparison results between the code rate and the preset code rate, two different target segment number calculation methods are dynamically selected, so that a target segment number that matches the physical layer transmission capability can be generated under different channel conditions.

[0064] In order to calculate the target number of segments when the bitrate is greater than or equal to a preset bitrate, in an optional implementation, step S2022 above includes:

[0065] Step S20221: Calculate the number of candidate segments based on the total number of channel bits and the mother code length. The formula for calculating the number of candidate segments is as follows: In the formula, As alternative segment numbers, The total number of channel bits. The length of the parent code in Polar encoding;

[0066] Specifically, The value is typically 4096 or 1024. The number of candidate segments is calculated based on the ratio of the total number of channel bits to the length of the Polar encoded mother code, ensuring that the number of segments is reasonably distributed within the theoretically feasible range, and providing an initial reference value for subsequent segmentation strategies.

[0067] Step S20222: If the first preset condition is met, substitute the number of candidate segments into the formula. Calculate the target number of segments, where C is the target number of segments, and the first preset condition is... , and Here, mod is the modulo operation, R is the bitrate, and if R > 2 / 3, then T = 192. If R ≤ 2 / 3, then T = 384 / 4096. / 4096;

[0068] In practice, when the total number of channel bits is not an integer multiple of the mother code length and the code rate is high (R > 5 / 32), a threshold T is introduced to adaptively adjust the number of candidate segments. This ensures that the length of each code block after segmentation is as close as possible to an integer multiple of 8 bits, meeting the requirements of memory alignment and hardware read / write optimization. At the same time, it avoids decoding failure caused by too few segments leading to excessively long single code blocks.

[0069] It is understandable that if the value of D is not 8, the values ​​of the relevant parameters can be further adjusted based on the value of D.

[0070] Step S20223: If the first preset condition is not met, substitute the number of candidate segments into the formula. Calculate the target number of segments.

[0071] In practical implementation, when the conditions of high bitrate and non-integer divisibility are not met, a relatively conservative strategy is adopted, that is, directly retaining the candidate segment number as the target segment number, thereby avoiding excessive correction that leads to an abnormal increase in the number of segments or redundant filling, thus reducing system overhead. Similarly, to avoid obtaining a meaningless target segment number... The constraint ensures that the final target number of segments is at least greater than 1.

[0072] In order to calculate the target number of segments when the bitrate is less than a preset bitrate, in an optional implementation, step S2023 above includes:

[0073] Step S20231: Calculate the number of candidate segments based on the length of the original bit sequence and the mother code length. The formula for calculating the number of candidate segments is as follows: In the formula, N is the number of packages, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence. The length of the parent code in Polar encoding. Number of segments to choose from;

[0074] Specifically, the total length of the original bit sequence is accurately calculated based on the number of encapsulations, the sampling bit width, and the cyclic redundancy check length. The number of candidate segments is then obtained by combining the length of the Polar encoded mother code, ensuring that the segmentation benchmark matches the actual data structure and guaranteeing the compatibility of the final target number of segments with the physical layer.

[0075] Step S20232: If the second preset condition is met, substitute the number of candidate segments into the formula. Calculate the target number of segments, where, satisfy , The maximum input length of the channel interleaver is 1, and the second preset condition is that the number of transmission layers is greater than 1 or the modulation method is not QPSK.

[0076] Specifically, when the number of transmission layers is greater than 1 or the modulation scheme is not QPSK, due to the need to meet more complex channel interleaving and coding mapping requirements, the target number of segments is adjusted by introducing the maximum input length constraint of the channel interleaver. This ensures that the length of each code block after segmentation does not exceed the upper limit of the interleaver's processing capacity, avoids interleaving failure or buffer overflow, and guarantees the data processing capability under the final high-order modulation and multi-layer transmission.

[0077] Step S20233: If the second preset condition is not met, the number of candidate segments is determined as the number of target segments.

[0078] Specifically, in a simple scenario where the transmission layer number is 1 and the modulation scheme and / or the modulation scheme is QPSK, no additional processing is required, and the reliability of the final target segment number can be guaranteed by using the original candidate segment number.

[0079] In order to calculate the code rate of the transmission channel, in one optional implementation, step S2021 above includes:

[0080] Step S20211: Calculate the code rate based on the length of the original bit sequence and the total number of channel bits. The formula for calculating the code rate is as follows: In the formula, R is the bit rate, N is the number of encapsulations, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence.

[0081] Specifically, by calculating the ratio of the original bit sequence length (determined by the number of encapsulations, the sampling bit width, and the cyclic redundancy check length) to the total number of channel bits, the actual transmission rate is accurately obtained, providing parameter basis for subsequent segmentation strategies.

[0082] It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although a logical order is shown in the flowchart, in some cases the steps shown or described may be executed in a different order than that shown here.

[0083] This application also provides a transport block segmentation apparatus for wireless communication. It should be noted that the transport block segmentation apparatus for wireless communication in this application can be used to execute the transport block segmentation method for wireless communication provided in this application. This apparatus is used to implement the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that implements a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0084] The following describes the wireless communication transport block segmentation device provided in the embodiments of this application.

[0085] Figure 5 This is a structural block diagram of a wireless communication transport block segmentation device according to an embodiment of this application. Figure 5 As shown, the device includes:

[0086] The acquisition unit 10 is used to acquire the original bit sequence of the encapsulated transport block, the original bit sequence including the data information sequence and the cyclic redundancy check sequence;

[0087] Specifically, the original bit sequence of the encapsulated transport block is obtained, which consists of a bit sequence (data information sequence) of the encapsulated transport block containing the first type of data information to be transmitted and a cyclic redundancy check bit sequence (cyclic redundancy check sequence).

[0088] Calculation unit 20 is used to calculate the number of segments based on the original bit sequence to obtain the target number of segments;

[0089] Specifically, based on the number of encapsulations N in the transport block, the sampling bit width K, and the cyclic redundancy check bit length L, combined with the channel code rate R and the maximum number of encapsulations N, max The value relationship is used to determine the number of segments C through mathematical operations.

[0090] The first processing unit 30 is used to segment the processed original bit sequence according to the target number of segments, provided that the length of the original bit sequence is an integer multiple of the target number of segments.

[0091] Specifically, when the length of the original bit sequence is exactly an integer multiple of the target number of segments, the original bit sequence can be segmented into equal-length segments based on the target number of segments. This ensures that the number of bits contained in each segment is consistent, further guaranteeing the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver.

[0092] The second processing unit 40 is used to expand the original bit sequence to an integer multiple of the target number of segments when the length of the original bit sequence is not an integer multiple of the target number of segments, to obtain the target bit sequence, and to segment the processed target bit sequence according to the target number of segments.

[0093] Furthermore, when the length of the original bit sequence cannot be divided by the target number of segments, this application sets up an extension of the original bit sequence until the extended sequence is an integer multiple of the target number of segments. This also enables the original bit sequence to be segmented into equal-length segments according to the target number of segments, ensuring that each segment contains the same number of bits. This further guarantees the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver, thus avoiding transmission failures caused by segmentation inconsistencies due to non-integer multiples of length.

[0094] In this embodiment, the acquisition unit acquires the original bit sequence of the encapsulated transport block, which includes a data information sequence and a cyclic redundancy check sequence; the calculation unit calculates the number of segments based on the original bit sequence to obtain the target number of segments; the first processing unit segments the processed original bit sequence according to the target number of segments if the length of the original bit sequence is an integer multiple of the target number of segments; the second processing unit expands the original bit sequence to an integer multiple of the target number of segments if the length of the original bit sequence is not an integer multiple of the target number of segments to obtain the target bit sequence, and segments the processed target bit sequence according to the target number of segments. This application, by adjusting the transport block length and the number of segments to an integer multiple relationship when they are not, ensures that the number of information bits in each segmented block is the same, thus guaranteeing that the segmentation method is the same for both the sender and receiver. This solves the problem in the prior art where transmission failure occurs due to segmentation mismatch between the sender and receiver when the transport block length is not an integer multiple of the number of segments.

[0095] To obtain the original bit sequence described above, in one optional implementation, the obtaining unit includes:

[0096] The first determining module is used to determine the number of encapsulations and the sampling bit width of the first type of data information, and to construct a data information sequence based on the number of encapsulations and the sampling bit width. The first type of data information is the data information in the physical layer data information of the Star Flash system that only supports pre-configured transmission scheduling.

[0097] Specifically, the number N of encapsulated data items and the sampling bit width K of the first type of data information are determined. This allows us to determine the aforementioned data information sequence. .

[0098] In one specific embodiment, a schematic diagram of the structure of the original bit sequence described above is shown below. Figure 3 As shown, where, The above data information sequence, For the aforementioned cyclic redundancy check sequence, the traditional segmentation method will generate some redundancy, so that if the segments of the sender and receiver are inconsistent, it will lead to transmission failure.

[0099] The first calculation module is used to calculate the cyclic redundancy check sequence based on the data information sequence. The length of the cyclic redundancy check sequence is a preset length.

[0100] Specifically, the aforementioned cyclic redundancy check (CRC) sequence is used for CRC verification of the transmission result. Therefore, after determining the aforementioned data information sequence, the aforementioned cyclic redundancy check sequence can be calculated. .

[0101] The first processing module is used to concatenate the data information sequence and the cyclic redundancy check sequence into the original bit sequence.

[0102] Specifically, by concatenating the above data information sequence and the cyclic redundancy check sequence, we obtain the following: Figure 3 The original bit sequence is shown.

[0103] To ensure that the transmitting and receiving sides consistently determine the segmentation boundaries of the encapsulated transmission block, in one optional implementation, the first processing unit includes:

[0104] The second determining module is used to determine the estimated number of transmitted bits based on the target number of segments. The formula for calculating the estimated number of transmitted bits is as follows: In the formula, A is the estimated number of transmitted bits, C is the target number of segments, N is the number of encapsulations, K is the sampling bit width, L is the length of the cyclic redundancy check sequence, and D is any positive integer;

[0105] Specifically, after calculating the target number of segments C of the encapsulated transport block, the minimum number of bits required to ensure that the length of the encapsulated transport block is an integer multiple of the target number of segments and meets the transmission requirements of the first type of data information can be estimated based on the target number of segments. This is the estimated number of transmission bits A mentioned above, and its calculation formula is as follows: .

[0106] The second processing module is used to add extension bits between the data information sequence and the cyclic redundancy check sequence until the length of the original bit sequence equals the estimated number of transmitted bits, when the estimated number of transmitted bits is greater than the length of the original bit sequence, to obtain the target bit sequence.

[0107] Specifically, when the estimated number of transmitted bits is greater than the length of the original bit sequence, that is... In this case, it can be determined that the original bit sequence needs to be further expanded, that is, the bit sequence... Expand to Among them, the above It can be represented as follows:

[0108] .

[0109] It is understood that in the above embodiments, only the expansion position of the above data information sequence is described. In fact, after the data information sequence is expanded, the cyclic redundancy check sequence needs to be recalculated and updated.

[0110] In one specific embodiment, such as Figure 4 As shown, for memory read and write operations, the value of D can be set to D=8. That is, the formula for estimating the number of bits to be transmitted is updated as follows: Each segmented code block contains the same number of information bits. This facilitates memory reading and writing.

[0111] Through the above embodiments, by combining the encapsulation format, sampling bit width, cyclic redundancy check sequence length, and positive integer D, the number of transmitted bits is accurately calculated. Then, the original bit sequence is expanded according to the number of transmitted bits to form a target bit sequence with controllable structure and the shortest possible length. This ensures that the number of bits in each code block is the same during subsequent segmentation, and achieves segmentation matching of the encapsulated transmission block at both the transmitting and receiving ends.

[0112] To determine the target number of segments, in one optional implementation, the calculation unit includes:

[0113] The acquisition module is used to acquire the code rate of the transmission channel;

[0114] Specifically, the code rate R of the transmission channel is obtained, where the value of R should satisfy that R is less than the highest target code rate Rmax.

[0115] The third determining module is used to determine the target number of segments based on the total number of channel bits and the mother code length when the code rate is greater than or equal to the preset code rate.

[0116] Specifically, the preset code rate is 5 / 32. When the code rate is greater than or equal to the preset code rate, the number of segments is calculated based on the total number of channel bits and the length of the mother code to meet the need to maximize the utilization of channel resources under high code rates.

[0117] The fourth determining module is used to determine the target number of segments based on the length of the original bit sequence and the length of the mother code when the code rate is less than the preset code rate.

[0118] Specifically, when the code rate is less than the preset code rate, the number of segments is calculated based on the length of the original bit sequence and the length of the mother code to match the inherent size of the transport block structure under low code rate.

[0119] Through the above embodiments, based on the comparison results between the code rate and the preset code rate, two different target segment number calculation methods are dynamically selected, so that a target segment number that matches the physical layer transmission capability can be generated under different channel conditions.

[0120] In order to calculate the target number of segments when the bitrate is greater than or equal to a preset bitrate, in one optional implementation, the third determining module includes:

[0121] The first calculation submodule is used to calculate the number of candidate segments based on the total number of channel bits and the mother code length. The formula for calculating the number of candidate segments is as follows: In the formula, As alternative segment numbers, The total number of channel bits. The length of the parent code in Polar encoding;

[0122] Specifically, The value is typically 4096 or 1024. The number of candidate segments is calculated based on the ratio of the total number of channel bits to the length of the Polar encoded mother code, ensuring that the number of segments is reasonably distributed within the theoretically feasible range, and providing an initial reference value for subsequent segmentation strategies.

[0123] The second calculation submodule is used to substitute the candidate segment numbers into the formula when the first preset condition is met. Calculate the target number of segments, where C is the target number of segments, and the first preset condition is... , and Here, mod is the modulo operation, R is the bitrate, and if R > 2 / 3, then T = 192. If R ≤ 2 / 3, then T = 384 / 4096. / 4096;

[0124] In practice, when the total number of channel bits is not an integer multiple of the mother code length and the code rate is high (R > 5 / 32), a threshold T is introduced to adaptively adjust the number of candidate segments. This ensures that the length of each code block after segmentation is as close as possible to an integer multiple of 8 bits, meeting the requirements of memory alignment and hardware read / write optimization. At the same time, it avoids decoding failure caused by too few segments leading to excessively long single code blocks.

[0125] It is understandable that if the value of D is not 8, the values ​​of the relevant parameters can be further adjusted based on the value of D.

[0126] The third calculation submodule is used to substitute the candidate segment numbers into the formula if the first preset condition is not met. Calculate the target number of segments.

[0127] In practical implementation, when the conditions of high bitrate and non-integer divisibility are not met, a relatively conservative strategy is adopted, that is, directly retaining the candidate segment number as the target segment number, thereby avoiding excessive correction that leads to an abnormal increase in the number of segments or redundant filling, thus reducing system overhead. Similarly, to avoid obtaining a meaningless target segment number... The constraint ensures that the final target number of segments is at least greater than 1.

[0128] In order to calculate the target number of segments when the bitrate is less than a preset bitrate, in one optional implementation, the fourth determining module includes:

[0129] The fourth calculation submodule is used to calculate the number of candidate segments based on the length of the original bit sequence and the mother code length. The formula for calculating the number of candidate segments is as follows: In the formula, N is the number of packages, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence. The length of the parent code in Polar encoding. Number of segments to choose from;

[0130] Specifically, the total length of the original bit sequence is accurately calculated based on the number of encapsulations, the sampling bit width, and the cyclic redundancy check length. The number of candidate segments is then obtained by combining the length of the Polar encoded mother code, ensuring that the segmentation benchmark matches the actual data structure and guaranteeing the compatibility of the final target number of segments with the physical layer.

[0131] The fifth calculation submodule is used to substitute the candidate segment numbers into the formula when the second preset condition is met. Calculate the target number of segments, where, satisfy , The maximum input length of the channel interleaver is 1, and the second preset condition is that the number of transmission layers is greater than 1 or the modulation method is not QPSK.

[0132] Specifically, when the number of transmission layers is greater than 1 or the modulation scheme is not QPSK, due to the need to meet more complex channel interleaving and coding mapping requirements, the target number of segments is adjusted by introducing the maximum input length constraint of the channel interleaver. This ensures that the length of each code block after segmentation does not exceed the upper limit of the interleaver's processing capacity, avoids interleaving failure or buffer overflow, and guarantees the data processing capability under the final high-order modulation and multi-layer transmission.

[0133] The determination submodule is used to determine the number of candidate segments as the target number of segments if the second preset condition is not met.

[0134] Specifically, in a simple scenario where the transmission layer number is 1 and the modulation scheme and / or the modulation scheme is QPSK, no additional processing is required, and the reliability of the final target segment number can be guaranteed by using the original candidate segment number.

[0135] In an optional implementation, to calculate the code rate of the transmission channel, the acquisition module includes:

[0136] The sixth calculation submodule is used to calculate the code rate based on the length of the original bit sequence and the total number of channel bits. The formula for calculating the code rate is as follows: In the formula, R is the bit rate, N is the number of encapsulations, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence.

[0137] Specifically, by calculating the ratio of the original bit sequence length (determined by the number of encapsulations, the sampling bit width, and the cyclic redundancy check length) to the total number of channel bits, the actual transmission rate is accurately obtained, providing parameter basis for subsequent segmentation strategies.

[0138] The aforementioned wireless communication transmission block segmentation device includes a processor and a memory. The acquisition unit, calculation unit, first processing unit, and second processing unit are all stored as program units in the memory. The processor executes these program units stored in the memory to implement the corresponding functions. All of the above modules reside in the same processor; alternatively, the modules may be located in different processors in any combination.

[0139] A processor contains a kernel, which retrieves the corresponding program units from memory. One or more kernels can be configured, and the success rate of data transfer can be ensured by adjusting kernel parameters.

[0140] The memory may include non-permanent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one memory chip.

[0141] This invention provides a computer-readable storage medium including a stored program, wherein, when the program is executed, it controls the device containing the computer-readable storage medium to perform the wireless communication transport block segmentation method.

[0142] Specifically, the methods for segmenting transport blocks in wireless communication include:

[0143] Step S201: Obtain the original bit sequence of the encapsulated transport block. The original bit sequence includes the data information sequence and the cyclic redundancy check sequence.

[0144] Specifically, the original bit sequence of the encapsulated transport block is obtained, which consists of a bit sequence (data information sequence) of the encapsulated transport block containing the first type of data information to be transmitted and a cyclic redundancy check bit sequence (cyclic redundancy check sequence).

[0145] Step S202: Calculate the number of segments based on the original bit sequence to obtain the target number of segments;

[0146] Specifically, based on the number of encapsulations N in the transport block, the sampling bit width K, and the cyclic redundancy check bit length L, combined with the channel code rate R and the maximum number of encapsulations N, max The value relationship is used to determine the number of segments C through mathematical operations.

[0147] Step S203: If the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments.

[0148] Specifically, when the length of the original bit sequence is exactly an integer multiple of the target number of segments, the original bit sequence can be segmented into equal-length segments based on the target number of segments. This ensures that the number of bits contained in each segment is consistent, further guaranteeing the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver.

[0149] Step S204: If the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments.

[0150] Furthermore, when the length of the original bit sequence cannot be divided by the target number of segments, this application sets up an extension of the original bit sequence until the extended sequence is an integer multiple of the target number of segments. This also enables the original bit sequence to be segmented into equal-length segments according to the target number of segments, ensuring that each segment contains the same number of bits. This further guarantees the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver, thus avoiding transmission failures caused by segmentation inconsistencies due to non-integer multiples of length.

[0151] This invention provides a processor for running a program, wherein the program executes the transport block segmentation method for wireless communication.

[0152] Specifically, the methods for segmenting transport blocks in wireless communication include:

[0153] Step S201: Obtain the original bit sequence of the encapsulated transport block. The original bit sequence includes the data information sequence and the cyclic redundancy check sequence.

[0154] Specifically, the original bit sequence of the encapsulated transport block is obtained, which consists of a bit sequence (data information sequence) of the encapsulated transport block containing the first type of data information to be transmitted and a cyclic redundancy check bit sequence (cyclic redundancy check sequence).

[0155] Step S202: Calculate the number of segments based on the original bit sequence to obtain the target number of segments;

[0156] Specifically, based on the number of encapsulations N in the transport block, the sampling bit width K, and the cyclic redundancy check bit length L, combined with the channel code rate R and the maximum number of encapsulations N, max The value relationship is used to determine the number of segments C through mathematical operations.

[0157] Step S203: If the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments.

[0158] Specifically, when the length of the original bit sequence is exactly an integer multiple of the target number of segments, the original bit sequence can be segmented into equal-length segments based on the target number of segments. This ensures that the number of bits contained in each segment is consistent, further guaranteeing the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver.

[0159] Step S204: If the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments.

[0160] Furthermore, when the length of the original bit sequence cannot be divided by the target number of segments, this application sets up an extension of the original bit sequence until the extended sequence is an integer multiple of the target number of segments. This also enables the original bit sequence to be segmented into equal-length segments according to the target number of segments, ensuring that each segment contains the same number of bits. This further guarantees the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver, thus avoiding transmission failures caused by segmentation inconsistencies due to non-integer multiples of length.

[0161] This invention provides an electronic device, which includes a processor, a memory, and a program stored in the memory and executable on the processor. When the processor executes the program, it performs at least the following steps:

[0162] Step S201: Obtain the original bit sequence of the encapsulated transport block. The original bit sequence includes the data information sequence and the cyclic redundancy check sequence.

[0163] Specifically, the original bit sequence of the encapsulated transport block is obtained, which consists of a bit sequence (data information sequence) of the encapsulated transport block containing the first type of data information to be transmitted and a cyclic redundancy check bit sequence (cyclic redundancy check sequence).

[0164] Step S202: Calculate the number of segments based on the original bit sequence to obtain the target number of segments;

[0165] Specifically, based on the number of encapsulations N in the transport block, the sampling bit width K, and the cyclic redundancy check bit length L, combined with the channel code rate R and the maximum number of encapsulations N, max The value relationship is used to determine the number of segments C through mathematical operations.

[0166] Step S203: If the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments.

[0167] Specifically, when the length of the original bit sequence is exactly an integer multiple of the target number of segments, the original bit sequence can be segmented into equal-length segments based on the target number of segments. This ensures that the number of bits contained in each segment is consistent, further guaranteeing the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver.

[0168] Step S204: If the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments.

[0169] Furthermore, when the length of the original bit sequence cannot be divided by the target number of segments, this application sets up an extension of the original bit sequence until the extended sequence is an integer multiple of the target number of segments. This also enables the original bit sequence to be segmented into equal-length segments according to the target number of segments, ensuring that each segment contains the same number of bits. This further guarantees the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver, thus avoiding transmission failures caused by segmentation inconsistencies due to non-integer multiples of length.

[0170] This application also provides a computer program product, which, when executed on a data processing device, is suitable for executing an initialization program having at least the following method steps:

[0171] Step S201: Obtain the original bit sequence of the encapsulated transport block. The original bit sequence includes the data information sequence and the cyclic redundancy check sequence.

[0172] Specifically, the original bit sequence of the encapsulated transport block is obtained, which consists of a bit sequence (data information sequence) of the encapsulated transport block containing the first type of data information to be transmitted and a cyclic redundancy check bit sequence (cyclic redundancy check sequence).

[0173] Step S202: Calculate the number of segments based on the original bit sequence to obtain the target number of segments;

[0174] Specifically, based on the number of encapsulations N in the transport block, the sampling bit width K, and the cyclic redundancy check bit length L, combined with the channel code rate R and the maximum number of encapsulations N, max The value relationship is used to determine the number of segments C through mathematical operations.

[0175] Step S203: If the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments.

[0176] Specifically, when the length of the original bit sequence is exactly an integer multiple of the target number of segments, the original bit sequence can be segmented into equal-length segments based on the target number of segments. This ensures that the number of bits contained in each segment is consistent, further guaranteeing the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver.

[0177] Step S204: If the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments.

[0178] Furthermore, when the length of the original bit sequence cannot be divided by the target number of segments, this application sets up an extension of the original bit sequence until the extended sequence is an integer multiple of the target number of segments. This also enables the original bit sequence to be segmented into equal-length segments according to the target number of segments, ensuring that each segment contains the same number of bits. This further guarantees the consistency of the segmentation structure of the encapsulated transport block between the sender and receiver, thus avoiding transmission failures caused by segmentation inconsistencies due to non-integer multiples of length.

[0179] It is obvious to those skilled in the art that the modules or steps of the present invention described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those described herein, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, the present invention is not limited to any particular combination of hardware and software.

[0180] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0181] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0182] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0183] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0184] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0185] Memory may include non-persistent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0186] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information by any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic tape, disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0187] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

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

[0189] As can be seen from the above description, the embodiments of this application achieve the following technical effects:

[0190] 1) The wireless communication transport block segmentation method of this application first obtains the original bit sequence encapsulating the transport block, which includes a data information sequence and a cyclic redundancy check sequence; then, the number of segments is calculated based on the original bit sequence to obtain the target number of segments; next, if the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments; finally, if the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments. This application adjusts the transport block length and the number of segments to an integer multiple relationship when they do not satisfy the relationship, so that the length of the information bits in each segmented block is the same, thus ensuring that the segmentation method of the transmitting and receiving parties is the same. This solves the problem in the prior art where transmission failure occurs due to segmentation mismatch between the transmitting and receiving parties when the transport block length is not an integer multiple of the number of segments.

[0191] 2) The wireless communication transport block segmentation device of this application includes an acquisition unit acquiring the original bit sequence of the encapsulated transport block, the original bit sequence including a data information sequence and a cyclic redundancy check sequence; a calculation unit calculating the number of segments based on the original bit sequence to obtain a target number of segments; a first processing unit segmenting the processed original bit sequence according to the target number of segments if the length of the original bit sequence is an integer multiple of the target number of segments; and a second processing unit expanding the original bit sequence to an integer multiple of the target number of segments if the length of the original bit sequence is not an integer multiple of the target number of segments to obtain a target bit sequence, and segmenting the processed target bit sequence according to the target number of segments. This application, by adjusting the transport block length and the number of segments to an integer multiple relationship when they are not, ensures that the information bit length of each segmented block is the same, thus guaranteeing that the segmentation method is the same for both the transmitting and receiving parties. This solves the problem in the prior art where transmission failure occurs due to segmentation mismatch between the transmitting and receiving parties when the transport block length is not an integer multiple of the number of segments.

[0192] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A method for segmenting transport blocks in wireless communication, characterized in that, include: Obtain the original bit sequence of the encapsulated transport block, the original bit sequence including the data information sequence and the cyclic redundancy check sequence; The target number of segments is obtained by calculating the number of segments based on the original bit sequence. If the length of the original bit sequence is an integer multiple of the target number of segments, the processed original bit sequence is segmented according to the target number of segments; If the length of the original bit sequence is not an integer multiple of the target number of segments, the original bit sequence is extended to an integer multiple of the target number of segments to obtain the target bit sequence, and the processed target bit sequence is segmented according to the target number of segments. Obtain the raw bit sequence of the encapsulated transport block, including: The number of encapsulations and the sampling bit width of the first type of data information are determined, and the data information sequence is constructed according to the number of encapsulations and the sampling bit width. The first type of data information is the data information in the physical layer data information of the Starflash system that only supports pre-configured transmission scheduling. The cyclic redundancy check sequence is calculated based on the data information sequence, and the length of the cyclic redundancy check sequence is a preset length. The data information sequence and the cyclic redundancy check sequence are concatenated to form the original bit sequence.

2. The method according to claim 1, characterized in that, The original bit sequence is expanded to an integer multiple of the target number of segments to obtain the target bit sequence, including: The estimated number of transmitted bits is determined based on the target number of segments, and the formula for calculating the estimated number of transmitted bits is as follows: In the formula, A is the estimated number of transmitted bits, C is the target number of segments, N is the number of encapsulations, K is the sampling bit width, L is the length of the cyclic redundancy check sequence, and D is any positive integer; If the estimated number of transmitted bits is greater than the length of the original bit sequence, an extension bit is added between the data information sequence and the cyclic redundancy check sequence until the length of the original bit sequence is equal to the estimated number of transmitted bits, thus obtaining the target bit sequence.

3. The method according to claim 1, characterized in that, The number of segments is calculated based on the original bit sequence to obtain the target number of segments, including: Obtain the code rate of the transmission channel; When the code rate is greater than or equal to the preset code rate, the target number of segments is determined based on the total number of channel bits and the mother code length; If the code rate is less than the preset code rate, the target number of segments is determined based on the length of the original bit sequence and the length of the mother code.

4. The method according to claim 3, characterized in that, The target segment number is determined based on the total number of channel bits and the mother code length, including: The number of candidate segments is calculated based on the total number of channel bits and the mother code length. The formula for calculating the number of candidate segments is as follows: In the formula, The number of candidate segments, The total number of channel bits, The length of the parent code for Polar encoding; If the first preset condition is met, substitute the number of candidate segments into the formula. Calculate the target number of segments, where C is the target number of segments, and the first preset condition is... , and Where mod is the modulo operation, R is the bit rate, and R > 2 / 3, then T = 192. If R ≤ 2 / 3, then T = 384 / 4096. / 4096; If the first preset condition is not met, substitute the number of candidate segments into the formula. Calculate the target number of segments.

5. The method according to claim 3, characterized in that, Determining the target number of segments based on the length of the original bit sequence and the length of the mother code includes: The number of candidate segments is calculated based on the length of the original bit sequence and the length of the mother code. The formula for calculating the number of candidate segments is as follows: In the formula, N is the number of packages, K is the sampling bit width, and L is the length of the cyclic redundancy check sequence. The length of the mother code for Polar encoding. The number of candidate segments; If the second preset condition is met, substitute the number of candidate segments into the formula. Calculate the target segment number, where, satisfy , This is the maximum input length of the channel interleaver. The total number of channel bits is the second preset condition, where the number of transmission layers is greater than 1 or the modulation scheme is not QPSK. If the second preset condition is not met, the number of candidate segments will be determined as the target number of segments.

6. The method according to claim 4, characterized in that, Obtain the code rate of the transmission channel, including: The code rate is calculated based on the length of the original bit sequence and the total number of channel bits. The formula for calculating the code rate is as follows: In the formula, R is the bit rate, N is the number of encapsulations, and K is the sampling bit width. L represents the total number of channel bits, and L represents the length of the cyclic redundancy check sequence.

7. A transmission block segmentation device for wireless communication, characterized in that, The device includes: An acquisition unit is used to acquire the original bit sequence of the encapsulated transport block, wherein the original bit sequence includes a data information sequence and a cyclic redundancy check sequence; The calculation unit is used to calculate the number of segments based on the original bit sequence to obtain the target number of segments; The first processing unit is configured to segment the processed original bit sequence according to the target number of segments, provided that the length of the original bit sequence is an integer multiple of the target number of segments. The second processing unit is configured to, when the length of the original bit sequence is not an integer multiple of the target number of segments, expand the original bit sequence to an integer multiple of the target number of segments to obtain a target bit sequence, and segment the processed target bit sequence according to the target number of segments; The acquisition unit includes: The first determining module is used to determine the number of encapsulations and the sampling bit width of the first type of data information, and to construct the data information sequence according to the number of encapsulations and the sampling bit width. The first type of data information is the data information in the physical layer data information of the Starflash system that only supports pre-configured transmission scheduling. The first calculation module is used to calculate the cyclic redundancy check sequence based on the data information sequence, wherein the length of the cyclic redundancy check sequence is a preset length. The first processing module is used to concatenate the data information sequence and the cyclic redundancy check sequence into the original bit sequence.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored program, wherein, when the program is executed, it controls the device on which the computer-readable storage medium is located to perform the method according to any one of claims 1 to 6.

9. An electronic device, characterized in that, include: One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising methods for performing any one of claims 1 to 6.

Images