Retransmission data processing method and device, electronic equipment, storage medium and program product

Abstract

The invention provides a retransmission data processing method and device, electronic equipment, a storage medium and a program product, and relates to the technical field of communication. According to the method, the CB which fails to be decoded in the last transmission is accurately positioned, only the CB which fails to be decoded in the last transmission is subjected to physical layer processing, and symbol-level and bit-level processing of the CB which succeeds to be decoded is skipped, so that the processing flow of the base station on the retransmitted data is optimized, unnecessary operation overhead and resource waste are reduced, and the transmission efficiency of the base station is improved. And the processing overhead of the base station is reduced.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method, device, electronic device, storage medium and program product for processing retransmitted data. Background Art

[0002] In 5G New Radio (NR) communication systems and low-orbit satellite communication systems, base stations primarily rely on the Hybrid Automatic Repeat reQuest (HARQ) mechanism to process retransmitted data on uplink data channels, such as the Physical Uplink Shared Channel (PUSCH). This mechanism combines ARQ (Automatic Repeat reQuest) and Forward Error Correction (FEC) to correct transmission errors and ensure reliable data transmission.

[0003] When processing retransmitted data, the base station can use IR-HARQ (Incremental Redundancy HARQ) technology to combine the redundant information in the retransmitted data with the initially transmitted data for decoding. This method gradually improves the decoding success rate by adding new information with each retransmission. However, regardless of the success of the previous transmission, the base station must process all data blocks. This includes re-rate matching and combining decoding for successfully decoded data blocks. In some cases, even if most data blocks are transmitted correctly, the entire transmission block must still be retransmitted, increasing the processing burden on the base station. Summary of the Invention

[0004] The purpose of the embodiments of the present application is to provide a retransmission data processing method, device, electronic device, storage medium and program product to improve the problem of heavy processing burden when the base station processes retransmission data in the existing method.

[0005] In a first aspect, an embodiment of the present application provides a method for processing retransmission data, which is applied to a base station. The method includes: Receive the i-th retransmitted coded data, where i is a positive integer; Determine data block n from the coded data i , wherein the data block n i Refers to the data block n that failed to be decoded in the coded data received for the i-1th time i-1 , the data block n i With the data block n i-1 correspond; The data block n i The derate-matched bit stream is the same as the data block n i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

[0006] In the above implementation process, by accurately locating the CB blocks that failed to be decoded in the last transmission, physical layer processing is performed only on the CB blocks that failed to be decoded in the last transmission, and symbol-level and bit-level processing of the successfully decoded CB blocks is skipped. This processing optimizes the base station's processing flow for retransmitted data, thereby reducing unnecessary computing overhead and resource waste, and reducing the processing overhead of the base station.

[0007] Optionally, before receiving the i-th retransmitted coded data, the method further includes: The data block n that failed to be decoded in the coded data received for the i-1th time i-1 storing the rate-matched bit stream of the decoded data block in the first cache, and storing the decoded bit streams of other successfully decoded data blocks in the second cache; The data block n i The derate-matched bit stream is the same as the data block n i-1 After combining the de-rate-matched bit streams and decoding the combined bit streams, the method further includes: If decoding of the combined bit stream fails, storing the combined bit stream in the first buffer; If the combined bit stream is decoded successfully, the decoded bit stream is stored in the second buffer.

[0008] In the above implementation process, the introduction of two cache mechanisms enables efficient management and processing of retransmitted data. Before receiving the i-th retransmitted data, data blocks in the i-1th received data that failed decoding are stored in the first cache, while data blocks that successfully decoded are stored in the second cache. This separate storage method enables the base station to quickly distinguish and process data blocks in different states, avoiding repeated processing of successfully decoded data and significantly improving processing efficiency. After combined decoding, the data blocks are stored in the corresponding cache based on the decoding results, further optimizing resource utilization. If decoding fails, the combined bit stream is stored in the first cache for subsequent retransmission processing; if successful, it is stored in the second cache for subsequent data reassembly and transmission. This mechanism not only reduces unnecessary processing steps but also improves the overall performance and reliability of the system. In particular, it can effectively reduce the system burden in scenarios with high retransmission rates.

[0009] Optionally, after storing the decoded bit stream in the second cache, the method further includes: bit-concatenating the decoded bit streams of all data blocks in the second buffer to obtain a concatenated bit stream; A CRC check is performed on the concatenated bit stream.

[0010] In the above implementation, after the decoded bitstream is stored in the second buffer, all successfully decoded data blocks are bit-concatenated to form a complete concatenated bitstream, which is then verified. This process ensures the integrity and accuracy of all successfully decoded data blocks before final transmission. This verification process allows for the timely detection and correction of potential errors, thereby improving the reliability of the entire transmission process.

[0011] Optionally, when i is 1, the coded data received for the (i-1)th time is the initially transmitted coded data. The rate-matched bitstreams of data blocks that failed decoding during the initial transmission are stored in the first buffer, while successfully decoded data blocks are stored in the second buffer. This mechanism enables the base station to accurately locate and specifically process data blocks that failed the initial transmission, avoiding repeated processing of the entire transmission block and significantly improving processing efficiency.

[0012] Optionally, if decoding of the merged bit stream fails, after storing the merged bit stream in the first cache, the method further includes: After the number of retransmissions reaches the maximum number of retransmissions, if the data block n i-1 If the corresponding combined bit stream still fails to be decoded, it is determined that the coded data has a check error and the terminal is instructed to stop retransmitting the coded data.

[0013] In the above implementation process, by setting the maximum number of retransmissions, if the data block n is i-1 If the corresponding combined bit stream still fails to be decoded, the encoded data is directly determined to be a checksum error and the terminal is instructed to stop retransmission. This mechanism effectively avoids the terminal's resource waste on ineffective retransmissions and reduces unnecessary processing burden on the system.

[0014] Optionally, the maximum number of retransmissions is less than or equal to the number of redundancy versions (RVs). By limiting the number of retransmissions, excessive retransmission attempts are avoided, thereby reducing waste of system resources and improving resource utilization efficiency. Furthermore, utilizing a limited number of retransmissions in combination with different RVs can more effectively correct errors and enhance data transmission reliability.

[0015] Optionally, the maximum number of retransmissions is determined based on decoding statistics for the (i-1)th encoded data. By dynamically determining the maximum number of retransmissions based on decoding statistics for the (i-1)th encoded data, the retransmission strategy can be precisely adjusted to suit varying channel conditions and data transmission requirements. This statistically-based dynamic adjustment mechanism not only improves system flexibility and adaptability but also effectively avoids unnecessary retransmission attempts, thereby conserving system resources and improving overall transmission efficiency.

[0016] Optionally, the step of determining data block n from the coded data i ,include: Determine the redundant version RV(i) of the i-th retransmission; Determine data block n from the coded data according to the redundancy version RV(i) i .

[0017] In the above implementation process, extracting data blocks according to RV versions can make full use of redundant information provided by different RV versions, improve the success rate of decoding, and enhance the system's anti-interference ability and data transmission reliability.

[0018] Optionally, the data block n is determined from the coded data according to the redundancy version RV(i). i ,include: Determining a bit offset according to the redundancy version RV(i); According to the bit offset and data block n i-1 The index of the data block and the size of the data block are used to determine the data block n. i The bit position of The bit stream at the bit position is extracted from the coded data as the data block n i .

[0019] In the above implementation process, by accurately calculating the bit offset corresponding to the redundant version (RV) and combining the index and size of the data block, the specific data block n is accurately located and extracted. i This approach not only improves the accuracy of data extraction, but also optimizes processing efficiency and avoids blind processing of the entire encoded data.

[0020] In a second aspect, an embodiment of the present application provides a retransmission data processing device, which runs on a base station, and the device includes: A data receiving module, configured to receive the i-th retransmitted coded data, where i is a positive integer; A data block determination module, configured to determine data block n from the coded data i , wherein the data block n i Refers to the data block n that failed to be decoded in the coded data received for the i-1th time i-1 , the data block n i With the data block n i-1 correspond; The combined decoding module is used to convert the data block n i The derate-matched bit stream is the same as the data block n i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

[0021] In a third aspect, an embodiment of the present application provides an electronic device comprising a processor and a memory, wherein the memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the steps in the method provided in the first aspect above are executed.

[0022] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps in the method provided in the first aspect are executed.

[0023] In a fifth aspect, an embodiment of the present application provides a computer program product, comprising computer program instructions, which, when read and executed by a processor, execute the steps in the method provided in the first aspect above.

[0024] Other features and advantages of the present application will be described in the following description and, in part, will become apparent from the description or be understood by practicing the embodiments of the present application. The objectives and other advantages of the present application can be achieved and obtained through the structures particularly pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments of the present application. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without creative work.

[0026] Figure 1 A schematic diagram of a system architecture for an application solution provided in an embodiment of the present application; Figure 2 A flowchart of a method for processing retransmitted data provided in an embodiment of the present application; Figure 3 A structural block diagram of a retransmission data processing device provided in an embodiment of the present application; Figure 4 A schematic structural diagram of an electronic device for executing a retransmission data processing method provided in an embodiment of the present application. DETAILED DESCRIPTION

[0027] The technical solutions in the embodiments of the present application will be described clearly and completely below in conjunction with the accompanying drawings in the embodiments of the present application.

[0028] It should be noted that the terms "system" and "network" in the embodiments of the present invention are used interchangeably. "Multiple" refers to two or more. In view of this, in the embodiments of the present invention, "multiple" can also be understood as "at least two." "And / or" describes the association relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / ", unless otherwise specified, generally indicates that the related objects are in an "or" relationship.

[0029] It should also be noted that all actions of obtaining signals, information or data in this application are carried out in compliance with the relevant data protection laws and policies of the country where they are located and with the authorization given by the owner of the corresponding device.

[0030] The technical solution of the present application can be applied to non-terrestrial network (NTN) systems such as satellite communication systems, high altitude platform station (HAPS) communications, for example, integrated communication and navigation (ICaN) systems, global navigation satellite systems (GNSS), etc.

[0031] The technical solution of the present application can also be applied to traditional mobile communication systems, for example: the mobile communication system can be a fifth generation (5G) communication system (for example, a new radio (NR) system), as well as future mobile communication systems.

[0032] The system architecture or scenario of this application is mainly used as follows Figure 1 As shown, it includes a base station and a terminal. The base station can be a base station in a New Radio (NR) system, for example, a new generation Node B (gNodeB).

[0033] The terminals mentioned in the embodiments of the present application include various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem with wireless communication functions, and may specifically refer to user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device. The terminal may also be a satellite phone, a cellular phone, a smart phone, a wireless data card, a wireless modem, a machine type communication device, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device or a wearable device, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, a terminal device in a 5G network or a future communication network, etc.

[0034] The downlink service channel of the 5G communication system uses the LDPC (Low-density parity-check) coding scheme. LDPC code is a block code based on a parity check matrix. According to the 3GPP protocol standard, initially transmitted data is generally encoded using part of the parity check matrix, while retransmitted data can be encoded using an extended parity check matrix. Information at different locations is then sent based on the configuration of the Redundancy Version (RV).

[0035] To facilitate understanding, the following first introduces the implementation process of IR-HARQ involved in this solution. Taking PUSCH data transmission as an example, the base station processes the initially transmitted coded data as follows: (1) The base station receives the PUSCH signal initially sent by the terminal. This signal is an encoded signal, also known as coded data. Before sending the data, the terminal will divide the data to be sent into CBs (Code Blocks), and then perform channel coding on each data block, such as using Turbo codes, LDPC codes, or Polar codes, to increase redundant information and improve the reliability of data transmission. (2) Equalization of the PUSCH signal. Equalization refers to processing the signal received after channel transmission to offset the distortion caused by the channel and restore the signal to a state close to the original state at the transmitter. Equalization usually includes channel estimation and equalization algorithm application. Common equalization algorithms include minimum mean square error equalization and zero-force equalization. (3) The base station performs symbol demodulation on the processed PUSCH signal to obtain demodulated symbol data; (4) The base station descrambles the demodulated symbol data to obtain the descrambled bit stream data; (5) The base station divides the descrambled bit stream into rate-matched bit streams of multiple CB blocks based on the bit stream corresponding to each CB block calculated in advance; (6) Deinterleave the rate-matched bit stream of each CB block; (7) Derate-match the deinterleaved data according to the redundancy version RV to obtain the derate-matched bit stream of each CB block; (8) Input the initially transmitted rate-matched bit stream into the decoding module and decode each CB block; (9) Combine the decoded bit streams of all CB blocks and perform CRC (Cyclic Redundancy Check) check on the transmission block. If some CB blocks fail to be decoded, the CRC check of the entire TB block will fail. If the check succeeds, the base station sends the PUSCH scheduling information for new transmission to the terminal, instructing the terminal to perform new transmission. If the check fails, the base station sends the PUSCH scheduling information for retransmission to the terminal, instructing the terminal to perform retransmission.

[0036] (1) Process the retransmitted data according to steps (1)-(7) in the initial transmission process to obtain the rate-matched bit stream of each CB block; (2) The rate-matched bit stream of each CB block is combined with the rate-matched bit stream of the initial transmission and input into the decoding module to decode each combined CB block; (3) Combine the decoded bit streams of all merged CB blocks and perform CRC check on the transport block.

[0037] In short, when a base station receives a PUSCH signal from a terminal, it first demodulates and decodes the signal. If the decoding is successful, the base station instructs the terminal to perform the next initial data transmission through scheduling information; otherwise, the terminal is required to retransmit the data.

[0038] During retransmission, the base station uses Forward Error Correction (FEC) coding to process the retransmitted data. FEC coding adds redundant information to the data at the transmitting end, allowing the receiving end to use this redundant information to correct some transmission errors. Even if errors still exist in the retransmitted data, the base station can use this redundant information to correct them, thereby improving data transmission reliability. However, regardless of whether the previous transmission was successful, the base station must process all data blocks. This includes re-rate matching and combining decoding for successfully decoded data blocks. In some cases, even if most data blocks were transmitted correctly, the entire transmission block must still be retransmitted, increasing the processing burden on the base station.

[0039] In order to reduce the processing burden of the base station, the solution of the present application accurately locates the CB blocks that failed to be decoded in the last transmission, and only performs physical layer processing on the CB blocks that failed to be decoded in the last transmission (that is, accurately locates the corresponding equalized data according to the CB index, and performs soft demodulation, descrambling, rate matching, and combined decoding on the equalized data corresponding to the CB), skipping the symbol-level and bit-level processing of the successfully decoded CB blocks. This processing optimizes the base station's processing flow for retransmitted data, thereby reducing unnecessary computing overhead and resource waste, and reducing the processing overhead of the base station.

[0040] Please refer to Figure 2 , Figure 2 A flowchart of a retransmission data processing method provided in an embodiment of the present application, the method being applied to a base station, comprising the following steps: Step S110: Receive the i-th retransmitted coded data.

[0041] In this solution, the processing of the initially transmitted coded data can refer to the processing flow of the initially transmitted data in the above-mentioned traditional solution, which will not be repeated here. However, this solution has some changes to the initial transmission process, that is, two caches will be created after step (8), one cache is used to store the rate-matched bit stream of the CB block that failed to be decoded, and the other cache is used to store the decoded bit stream of the CB block that was successfully decoded. Here is a brief introduction, and for details, please refer to the relevant description in the subsequent embodiments.

[0042] When the base station fails to decode the initially transmitted coded data or the retransmitted coded data, resulting in a verification failure, it will send scheduling information to the terminal to instruct the terminal to retransmit the data.

[0043] Here, i is a positive integer. The coded data received by the base station for the first time is the initially transmitted coded data. If i is equal to 1, the base station receives the first retransmitted coded data.

[0044] The coded data may refer to PUSCH channel data, and may also refer to other data sent by the terminal to the base station, such as the Physical Uplink Control Channel (PUCCH).

[0045] Step S120: Determine data block n from the encoded data i .

[0046] Among them, data block n i (Subsequent data blocks are referred to as CB blocks for short) refers to the CB block n that failed to be decoded in the coded data received for the i-1th time. i-1 , CB block n i With CB block n i-1 Correspondence, here correspondence can be understood as the index correspondence of the CB block, that is, the index is the same.

[0047] For example, when i is 1, the coded data received for the i-1th time is the initially transmitted coded data. After decoding each CB block in the initially transmitted coded data, the decoding result is obtained. If the decoding result of a CB block fails, the CB block is CB block n. i-1 , and records the index of the CB block, for example, CB_2, indicating that the second CB block in the initially transmitted coded data failed to be decoded.

[0048] Since the number of CB blocks of the coded data in the initial transmission and retransmission of the terminal is the same, for example, the coded data in the initial transmission includes 10 CB blocks, the coded data in the retransmission also includes 10 CB blocks, so when determining the CB block n from the retransmitted coded data i When , the CB block with the same index is also obtained from the coded data, that is, the CB block with index CB_2 is obtained as CB block n i .

[0049] Specifically, after receiving the retransmitted coded data, the base station can first obtain the rate-matched bit stream of each CB block in the coded data according to step (1) in the process of the retransmitted data in the traditional scheme, and then determine the CB block n from it. i , at this time, CB block n can be obtained at the same time i The derate-matched bit stream.

[0050] In some other implementations, in order to reduce the overhead of the base station, the base station may also perform equalization processing on the retransmitted coded data and extract the CB block n i The corresponding balanced data (i.e. the data after equalization) is then processed for CB block n iThe corresponding equalized data is subsequently processed, including demodulation, descrambling and rate matching, so that CB block n can be obtained. i The derate-matched bit stream.

[0051] Step S130: CB block n i The derate-matched bitstream is equal to the CB block n i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

[0052] In the traditional scheme, the rate-matched bit streams of all CB blocks are merged with the rate-matched bit streams of all CB blocks in the previous time and then decoded. However, in this scheme, in order to reduce the computing overhead of the base station, only the CB blocks that failed to be decoded in the previous time are merged and decoded, and the CB blocks that were successfully decoded are no longer merged and decoded.

[0053] For example, CB block n i-1 It is the CB that failed to be decoded in the initially transmitted coded data. The identifier of the CB, such as CB_2, can be recorded during the initial transmission, and the bit stream after rate matching of CB_2 (recorded as bit stream 1) is recorded. For the first retransmitted coded data, the bit stream after rate matching of CB_2 is obtained (recorded as bit stream 2), and then bit stream 2 and bit stream 1 can be merged. The merged bit stream is then input into the decoding module for decoding.

[0054] In the above implementation process, by accurately locating the CB blocks that failed to be decoded in the last transmission, physical layer processing is performed only on the CB blocks that failed to be decoded in the last transmission, and symbol-level and bit-level processing of the successfully decoded CB blocks is skipped. This processing optimizes the base station's processing flow for retransmitted data, thereby reducing unnecessary computing overhead and resource waste, and reducing the processing overhead of the base station.

[0055] On the basis of the above embodiment, before receiving the coded data retransmitted for the i-th time, the CB block n that failed to be decoded in the coded data received for the i-1th time may be further i-1 The bit stream after rate matching is stored in the first buffer, and the decoded bit streams of other CB blocks that are successfully decoded are stored in the second buffer. i The derate-matched bitstream is equal to the CB block n i-1 After the de-rate-matched bit streams are combined and decoded, if the decoding of the combined bit stream fails, the combined bit stream is stored in the first cache; if the decoding of the combined bit stream is successful, the decoded bit stream is stored in the second cache.

[0056] After the base station receives the encoded data for the i-1th time and determines the CB block that fails to be decoded, it can create two buffers, including buffer0 (first cache) and buffer1 (second cache). Buffer0 is used to store the rate-matched bit stream of the CB block that fails to be decoded, and buffer1 is used to store the decoded bit stream of the CB block that is successfully decoded.

[0057] For the coded data received for the i-1th time, the base station first decodes each CB block. If CB block n i-1 If decoding fails, CB block n i-1 The de-rate-matched bit stream is stored in buffer0, and relevant information such as the index of the CB block is recorded. If the CB block is decoded successfully, the decoded bit stream is stored in buffer1, and relevant information such as the index of the CB block is recorded.

[0058] The base station determines the CB block n from the coded data received for the i-th time. i-1 The index corresponding to the CB block n i , and CB block n i The coded data is deinterleaved, and then the deinterleaved data is derate matched according to RV to obtain CB block n i Then the CB block n i The derate-matched bitstream is the same as the CB block n stored in buffer0. i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

[0059] If the combined bitstream fails to be decoded, the combined bitstream is stored in buffer0, replacing the previous CB block n. i-1 After decompression rate matching, the index of the CB block is still CB block n i-1 If the combined bit stream is decoded successfully, the decoded bit stream is stored in buffer1 and related information, such as the index of the CB block, is updated.

[0060] It can be understood that each CB block that fails to be decoded can be processed in the same way, that is, for the CB block that fails to be decoded, the rate-matched bit stream of the CB block is obtained from the retransmitted encoded data, and then merged with the previous rate-matched bit stream and decoded again, and the decoding result is processed again.

[0061] In some implementations, the first buffer and the second buffer are released when the retransmission process ends.

[0062] In the above implementation, the introduction of two buffering mechanisms enables efficient management and processing of retransmitted data. Before receiving the i-th retransmitted data, CB blocks that failed decoding in the i-1th received data are stored in the first buffer, while CB blocks that successfully decoded are stored in the second buffer. This separate storage method enables the base station to quickly distinguish and process CB blocks in different states, isolate correctly decoded CB blocks, and prevent data contamination caused by retransmission errors. After combined decoding, CB blocks are stored in the corresponding buffer based on the decoding results, further optimizing resource utilization. If decoding fails, the combined bit stream is stored in the first buffer for subsequent retransmission processing; if successful, it is stored in the second buffer for subsequent data reassembly and transmission. This mechanism not only reduces unnecessary processing steps but also improves overall system performance and reliability, effectively reducing system burden in scenarios with high retransmission rates.

[0063] Based on the above embodiment, after the decoded bit stream is stored in the second cache, the decoded bit streams of all CB blocks in the second cache may be bit concatenated to obtain a concatenated bit stream, and a CRC check may be performed on the concatenated bit stream.

[0064] If all CB blocks that previously failed to be decoded are successfully decoded by combining the retransmitted coded data, the decoded bit streams of all CB blocks in the second buffer are bit-concatenated.

[0065] The base station can create a concatenated buffer area to store the concatenated bit stream, i.e., the concatenated bit stream. The base station then traverses the decoded bit streams of all CB blocks stored in the second buffer in the order of the CB block indices, writes the decoded bit stream of each CB block sequentially into the concatenated buffer area to form a continuous bit sequence, and records information such as the length and starting position of the concatenated bit stream for subsequent processing and verification. For example, if the decoded bit stream of CB block CB_1 is 1010 and the decoded bit stream of CB block CB_2 is 1100, the concatenated bit sequence is 10101100.

[0066] During verification, the base station can select an appropriate verification algorithm, such as a cyclic redundancy check (CRC). A check value is then calculated for the concatenated bit stream based on the selected verification algorithm. For example, if the CRC-24 algorithm is used, the concatenated bit stream is input and a 24-bit CRC check value is calculated. A predefined verification standard or expected check value is then obtained and compared with the calculated check value. If the two match, the verification is successful, indicating that the concatenated bit stream is complete and correct. If they do not match, the verification fails, indicating that an error may have occurred during data transmission or processing.

[0067] In some implementations, if the base station ultimately fails verification, the base station may record relevant information regarding this verification failure, including the time of the verification failure and the identifier of the transport block involved. The base station may determine, based on a policy, whether to send a retransmission request to the terminal, instructing the terminal to resend the data of the entire transport block. If the data received by the base station after retransmission is considered the initially transmitted data, it may then be processed again according to the above process.

[0068] In the above implementation, after the decoded bitstream is stored in the second buffer, all successfully decoded CB blocks are bit-concatenated to form a complete concatenated bitstream, which is then verified. This process ensures the integrity and accuracy of all successfully decoded CB blocks before final transmission. This verification process allows for the timely detection and correction of potential errors, thereby improving the reliability of the entire transmission process.

[0069] On the basis of the above embodiment, when i is 1, the coded data received for the (i-1)th time is the initially transmitted coded data.

[0070] When i is 1, it indicates that the coded data received for the 0th time is the initially transmitted coded data, that is, after receiving the initially transmitted coded data, the base station first creates two caches, including the first cache and the second cache mentioned above. The first cache and the second cache are initialized to empty. The first cache is used to store the rate-matched bit stream of the CB block that failed to be decoded, and the second cache user stores the decoded bit stream of the CB block that was successfully decoded.

[0071] The base station receives the user's initial signal, demodulates and deinterleaves it to obtain the initially transmitted coded data, and then divides the initially transmitted coded data into multiple CB blocks according to the transport block size and CB block segmentation rule (of course, it can also be divided into multiple CB blocks after equalization), such as CB_1, CB_2, ..., CB_i. Each CB block is rate-matched to obtain the rate-matched bit stream of each CB block.

[0072] The base station then decodes the rate-matched bit stream of each CB block. If decoding fails, the rate-matched bit stream of the CB block is stored in the first buffer and information such as the CB block index is recorded. If decoding is successful, the decoded bit stream of the CB block is stored in the second buffer and information such as the CB block index is recorded. The base station concatenates the decoded bit streams of each CB block in the order of their indexes and performs verification. If the verification fails, the base station may send scheduling information for retransmitting the PUSCH to the terminal, instructing the terminal to retransmit, thereby triggering the first retransmission process.

[0073] In this implementation, the rate-matched bitstreams of CB blocks that failed decoding during initial transmission are stored in the first buffer, while successfully decoded CB blocks are stored in the second buffer. This mechanism enables the base station to accurately locate and specifically process CB blocks that failed initial transmission, avoiding repeated processing of the entire transmission block and significantly improving processing efficiency.

[0074] On the basis of the above embodiment, if the combined bit stream fails to be decoded, the combined bit stream is stored in the first buffer, and the base station instructs the terminal to retransmit. After the number of retransmissions reaches the set number of retransmissions, if the CB block n i-1 If the corresponding combined bit stream still fails to be decoded, it is determined that the coded data has a checksum error and the terminal is instructed to stop retransmitting the coded data.

[0075] During initial transmission, the base station can set a retransmission counter with an initial value of 0. A maximum number of retransmissions can be set based on system requirements and service type. For example, consider a satellite communication system that supports three types of services: real-time services (such as video conferencing and voice calls), high-reliability services (such as financial transaction data and critical system instructions), and standard data services (such as file downloads and email).

[0076] Real-time services are sensitive to latency but have a certain tolerance for small amounts of data loss. Small amounts of data loss can be handled through forward error correction or other mechanisms. Therefore, excessive retransmissions can increase latency and affect service quality. For this type of service, the maximum delay can be set to 1, meaning the base station allows a maximum of one retransmission. If the CB block is still not successfully decoded after one retransmission, the base station can perform other processing, such as notifying the upper-layer application to handle it and instructing the terminal to stop retransmissions.

[0077] High-reliability services require high data integrity and moderate latency. To ensure data reliability, a relatively high latency can be tolerated. Therefore, for this service type, the maximum latency can be set to 2 or 3 times, meaning the base station can allow a maximum of 2 or 3 retransmissions. If the CB block is still not successfully decoded after 2 or 3 retransmissions, the base station can perform other processing, such as notifying the upper-layer application to handle the issue and instructing the terminal to stop retransmissions.

[0078] Ordinary data services are relatively insensitive to latency but require ultimately reliable data transmission. These services can typically tolerate multiple retransmissions to ensure data integrity. Therefore, the maximum number of retransmissions for this type of service can be set to a higher value, such as 3 or 4. If a CB block is still not successfully decoded after 3 or 4 retransmissions, the base station can perform other processing, such as notifying upper-layer applications to handle the issue and instructing the terminal to stop retransmissions. Alternatively, the base station can temporarily store the CB block information and retry transmission at a later time (e.g., when channel conditions improve).

[0079] When identifying the service type, the base station can identify different types of services based on service identification information in high-layer signaling data or data packets, and classify the data packets into corresponding service queues for processing.

[0080] In some implementations, the base station can dynamically adjust the maximum number of retransmissions for each service based on real-time channel conditions and system load. For example, when channel conditions deteriorate, the maximum number of retransmissions for real-time services can be appropriately reduced to avoid excessive delays. When the system load is light, the maximum number of retransmissions for general data services can be appropriately increased to improve data transmission reliability.

[0081] In some implementations, the base station may periodically count the number of retransmissions for each service type when verification is successful. Based on this data, the configuration of the maximum number of retransmissions for each service type may be regularly evaluated and optimized to adapt to the ever-changing network environment and service requirements.

[0082] Each time the base station receives the retransmitted coded data, it adds 1 to the retransmission counter and determines whether the retransmission counter has reached the maximum number of retransmissions. After reaching the maximum number of retransmissions, the CB block n i-1 If the corresponding combined bit stream still fails to be decoded, it is determined that the encoded data has a checksum error and the terminal is instructed to stop retransmission.

[0083] In the above implementation process, by setting the maximum number of retransmissions, if the CB block n is reached after the number is reached, i-1 If the corresponding combined bit stream still fails to be decoded, the encoded data is directly determined to be a checksum error and the terminal is instructed to stop retransmission. This mechanism effectively avoids the terminal's resource waste on ineffective retransmissions and reduces unnecessary processing burden on the system.

[0084] Based on the above embodiment, the maximum number of retransmissions may be less than or equal to the number of RVs.

[0085] The base station can determine the number of RVs based on the RV versions supported by the system. For example, in a 5G NR system, there are typically four RV versions (RV0, RV1, RV2, and RV3). In this case, the maximum number of retransmissions is less than or equal to 4.

[0086] It is understandable that in a 3G scenario, the maximum number of retransmissions may be 8. If RV is not involved in this scenario, the maximum number of retransmissions may be less than or equal to 8.

[0087] In some implementations, after the RV sequence is used up, if the maximum number of retransmissions has not been reached, it may be recycled again.

[0088] In the above implementation, limiting the number of retransmissions avoids excessive retransmission attempts, thereby reducing system resource waste and improving resource utilization efficiency. Furthermore, utilizing limited retransmissions in combination with different RV versions can more effectively correct errors and enhance data transmission reliability.

[0089] In some other implementations, the maximum number of retransmissions is determined based on decoding statistics of the (i-1)th encoded data.

[0090] After receiving the retransmitted coded data, the base station can create a retransmission counter with an initial value of 0. After each retransmission of the coded data, the retransmission counter is incremented by 1. Before decoding, the base station checks whether the retransmission counter has reached the maximum number of retransmissions. If so, the retransmission operation is stopped.

[0091] For example, if decoding of a CB block CB_2 fails during initial transmission, after the first retransmission, the rate-matched bit stream of the retransmitted CB block CB_2 is combined with the rate-matched bit stream of the previously transmitted CB block CB_2 (the combined bit stream is denoted as CB_2 bit1), and decoding is performed after the combination. Assuming the maximum number of retransmissions is three, the combined bit stream is decoded for the first time. If decoding succeeds, the subsequent verification steps proceed directly. If decoding fails, the base station determines whether the maximum number of retransmissions has been reached. If not, the base station notifies the terminal to retransmit a second time until the maximum number of retransmissions has been reached or verification succeeds.

[0092] For the rate-matched bit stream of the CB block CB_2 obtained in the second retransmission, continue to merge it with the previously merged bit stream CB_2 bit1. The merged bit stream is recorded as CB_2 bit2. Then, the bit stream CB_2 bit2 is decoded and the same maximum retransmission number judgment is performed.

[0093] The maximum number of retransmissions may be determined based on the decoding statistics of the last encoded data. In some implementations, the decoding statistics may include the number or percentage of CB blocks that failed to be decoded in the (i-1)th encoded data, the number of CB blocks that failed to be decoded consecutively, etc.

[0094] In some implementations, the number or percentage of CB blocks that failed decoding, or the number of consecutive CB blocks that failed decoding, may be used as the maximum number of retransmissions. If the percentage is not an integer, it may be rounded up. In this case, a greater number or percentage of CB blocks that failed decoding increases the maximum number of retransmissions. Conversely, a smaller number or percentage decreases the maximum number of retransmissions.

[0095] In some other implementations, a target number of decoding attempts can be set based on the decoding capability of the decoding module. Exceeding this target number of decoding attempts would exceed the upper limit of the decoding capability allowed by the decoding module. In this case, the target number of decoding attempts can be divided by the number of CB blocks that failed to decode, or the number of consecutive CB blocks that failed to decode, to obtain the value that can be used as the maximum number of retransmissions. For the percentage, the target number of decoding attempts can be multiplied by the percentage, and the resulting value can be rounded up to obtain the maximum number of retransmissions.

[0096] In this implementation, by dynamically determining the maximum number of retransmissions based on the decoding statistics of the (i-1)th encoded data, the retransmission strategy can be precisely adjusted to suit varying channel conditions and data transmission requirements. This statistically-based dynamic adjustment mechanism not only improves system flexibility and adaptability but also effectively avoids unnecessary retransmission attempts, thereby conserving system resources and improving overall transmission efficiency.

[0097] Based on the above embodiment, the base station determines the CB block n from the coded data. i When , the redundant version RV(i) of the i-th retransmission can be determined first, and then the CB block n can be determined from the coded data according to RV(i) i .

[0098] When sending a retransmission instruction to a terminal, the base station determines the RV value based on the protocol or system design. For example, in the 5G NR system, RV values ​​are used in the order of RV0, RV2, RV3, and RV1, with RV0 being the RV value used for the initial transmission. Therefore, the base station selects the RV value for the current retransmission based on the number of retransmissions or a predefined RV cycling strategy and sends it to the terminal. The terminal then retransmits data based on this RV value.

[0099] After receiving the coded data retransmitted for the i-th time, the base station may determine the RV value of the retransmitted coded data according to the number of retransmissions or a defined RV cycle strategy.

[0100] The base station can obtain the size of the entire transport block and the size of each CB block from higher-layer signals, thereby determining the number of CB blocks of retransmitted coded data. The RV value determines the starting position of the coded bit stream. Each RV value corresponds to a different starting bit position. For example, RV0 starts at the beginning of the coded bit stream, RV1 starts at an intermediate position, usually 1 / 4 of the bit stream length, RV2 starts at 1 / 2 of the bit stream length, and RV3 starts at 3 / 4 of the bit stream length.

[0101] Therefore, the RV value can be used to find the value of the CB block n. i-1 CB block n with the same index i The bit position in the coded data, and then extract the CB block n i .

[0102] Specifically, the base station may first determine the bit offset according to the determined RV value, and then determine the bit offset according to the bit offset and the CB block n. i-1 Index, CB block size, determine CB block n i The bit position of the CB block n is then extracted from the coded data as the bit stream at the bit position n. i . Then CB block n can be extracted i The balanced data is then processed subsequently.

[0103] Among them, the bit offset of the corresponding starting position can be calculated according to the RV value. For example, if the bit stream length of the encoded data is N, the starting position corresponding to the RV value is: the offset of RV0 is 0, the offset of RV1 is N / 4, the offset of RV2 is N / 2, and the offset of RV3 is 3N / 4.

[0104] The base station can determine the starting position of the coded bit based on the bit offset, and then, starting from the starting position, divide the coded data into multiple CB blocks according to the number of CB blocks and the size of each CB block, and then find the CB block with the same index (for example, the index of the CB block that failed decoding is CB_2).

[0105] Alternatively, the base station can also calculate the starting and ending positions of the CB block in the encoded data based on the index and CB block size of the CB block that failed to be decoded, such as the starting position is the index of the CB block * CB block size + bit offset, and the ending position is (index of the CB block + 1) * CB block size + bit offset. In this way, the CB block n can be determined. i The bit position of the bit position is then found from the coded data and the bit stream of the bit position is extracted as CB block n i .

[0106] At this time, the CB block n extracted from the coded data i Or symbol data, after determining CB block n iAfter that, CB block n i Signal estimation and equalization are performed to offset channel effects and interference. The purpose of equalization is to restore the original transmitted signal and reduce inter-symbol interference. Common equalization algorithms include minimum mean square error equalization and zero-force equalization. Of course, it is also possible to extract CB block n after estimation and equalization. i The processed data is then subjected to subsequent descrambling, rate matching and other processing.

[0107] The base station then performs constellation point demodulation and descrambling on the equalized coded data to recover the original bit information. It then performs rate matching to obtain a rate-matched bit stream under the RV. This is then combined with the rate-matched bit stream of the previously decoded CB block for decoding.

[0108] In some implementations, if the protocol allows for dynamic RV changes, the base station can determine the retransmitted RV value based on current channel conditions, such as signal-to-noise ratio (SNR) and bit error rate (BER). If the channel conditions are poor (e.g., high BER, low SNR), a more informative RV version, such as RV2 or RV3, can be selected. These versions provide more redundant information, helping to improve decoding success rates. If the channel conditions are good, RV1 can be selected, which provides different system information and helps recover damaged information.

[0109] In the above implementation process, by accurately calculating the bit offset corresponding to the redundant version (RV) and combining the index and size of the CB block, the specific CB block n is accurately located and extracted. i This approach not only improves the accuracy of data extraction, but also optimizes processing efficiency and avoids blind processing of the entire encoded data.

[0110] The following is a detailed example to illustrate the implementation process of the above method.

[0111] 1) When processing the initial PUSCH signal (assuming RV=0), decode each CB block. If the CB block is decoded correctly, save the decoded bit stream of the current CB block to buffer0. For example, the current PUSCH TB (Transport Block) block can be divided into m CB blocks, namely cb_1, cb_2, .., cb_m. Assume that cb_i LDPC decoding failed, cb_k If LDPC decoding is successful, the CB block decoding result bit stream of cb_k is stored in buffer0, and the cb_k information is recorded, that is, the LDPC decoding is correct.

[0112] 2) Store the rate-matched bit stream of cb_i into buffer1 and record the LDPC decoding error information and index of cb_i.

[0113] 3) For the processing of retransmitted PUSCH data (RV={2, 3, 1}), based on the recorded LDPC decoding error information and index of the initial transmission cb_i, the PUSCH symbol data corresponding to cb_i during retransmission can be calculated.

[0114] 4) When processing the retransmitted PUSCH symbol, only the PUSCH symbol data corresponding to cb_i needs to be processed for equalization to obtain the equalized data of cb_i.

[0115] 5) Perform constellation point demodulation, descrambling, and rate matching on the equalized data of cb_i to obtain a rate-matched bit stream with RV=2 (or RV=3, RV=1).

[0116] 6) Combine the rate-matched bit stream of cb_i with RV=2 with the bit stream of cb_i in buffer1 from step 2) and then perform LDPC decoding.

[0117] 7) Place the bit stream after successful LDPC decoding of cb_i into buffer0 of the corresponding cb_i. If all cb_i are decoded successfully, concatenate the bit streams of all cb blocks in buffer0 and proceed to step 8). If there are still cb blocks in cb_i that are not correctly decoded, store the combined and rate-matched bit streams in cb_i into buffer1, directly determine the TB CRC error, perform demodulation for the next PUSCH retransmission, and return to step 3).

[0118] 8) Perform TB CRC check.

[0119] This solution effectively reduces the overhead of PUSCH symbol-level and bit-level processing when processing PUSCH retransmissions. For example, if the PUSCH signal has 14 symbols, 2 DMRS (Demodulation Reference Signal) symbols, 200 RBs, 27 MCS (Modulation and Coding Scheme), 64QAM (Quadrature Amplitude Modulation), and precoding, the TB size is 159,880 bits, and the number of CBs is 19. If decoding of the last two CBs fails during initial transmission, and the rate-matched bit streams corresponding to these two CBs are in the corresponding partial REs (i.e., the last two symbols), only the partial REs in the last two symbols need to be equalized, and constellation point demapping and descrambling performed on the retransmitted PUSCH data. Rate matching and HARQ combined decoding are performed on the last two CBs, reducing the overhead of PUSCH symbol-level and bit-level processing.

[0120] Since this solution only processes the data of the last CB block error and does not process the bit stream of the last CB block successfully decoded, it can effectively prevent the base station decoding error problem caused by the terminal retransmitting data error.

[0121] Please refer to Figure 3 , Figure 3 This is a block diagram of a retransmission data processing apparatus 200 provided in an embodiment of the present application. This apparatus 200 may be a module, program segment, or code on an electronic device (such as the aforementioned base station). It should be understood that this apparatus 200 corresponds to the aforementioned method embodiment and is capable of executing each step involved in the method embodiment. The specific functions of this apparatus 200 can be found in the description above; to avoid repetition, a detailed description is omitted here.

[0122] Optionally, the retransmission data processing device 200 includes: The data receiving module 210 is configured to receive the i-th retransmitted coded data, where i is a positive integer; The data block determination module 220 is configured to determine the data block n from the coded data. i , wherein the data block n i Refers to the data block n that failed to be decoded in the coded data received for the i-1th time i-1 , the data block n i With the data block n i-1 correspond; The combined decoding module 230 is used to convert the data block n i The derate-matched bit stream is the same as the data block ni-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

[0123] Optionally, the retransmission data processing device 200 further includes: The cache module is used to store the data block n that failed to be decoded in the coded data received for the i-1th time. i-1 The de-rate-matched bit stream is stored in the first cache, and the decoded bit streams of other successfully decoded data blocks are stored in the second cache; if the decoding of the merged bit stream fails, the merged bit stream is stored in the first cache; if the decoding of the merged bit stream is successful, the decoded bit stream is stored in the second cache.

[0124] Optionally, the retransmission data processing device 200 further includes: The check module is used to perform bit concatenation on the decoded bit streams of all data blocks in the second cache to obtain a concatenated bit stream; and perform CRC check on the concatenated bit stream.

[0125] Optionally, when i is 1, the coded data received for the (i-1)th time is the initially transmitted coded data.

[0126] Optionally, the retransmission data processing device 200 further includes: Retransmission module, used to retransmit data block n after the number of retransmissions reaches the maximum number of retransmissions. i-1 If the corresponding combined bit stream still fails to be decoded, it is determined that the coded data has a check error and the terminal is instructed to stop retransmitting the coded data.

[0127] Optionally, the maximum number of retransmissions is less than or equal to the number of redundant versions RVs.

[0128] Optionally, the maximum number of retransmissions is determined based on decoding statistics of the (i-1)th encoded data.

[0129] Optionally, the data block determination module 220 is configured to determine a redundant version RV(i) of the i-th retransmission; and determine data block n from the coded data according to the redundant version RV(i). i .

[0130] Optionally, the data block determination module 220 is configured to determine a bit offset according to the redundancy version RV(i); and determine the bit offset according to the bit offset and the data block n. i-1 The index of the data block and the size of the data block are used to determine the data block n. i Extract the bit stream at the bit position from the coded data as the data block n i .

[0131] It should be noted that those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the aforementioned method embodiment and will not be repeated here.

[0132] Please refer to Figure 4 , Figure 4 A structural diagram of an electronic device for executing a retransmission data processing method provided in an embodiment of the present application, wherein the electronic device may include: at least one processor 310, such as a CPU, at least one communication interface 320, at least one memory 330, and at least one communication bus 340. The communication bus 340 is used to realize connection and communication between these components. The communication interface 320 of the device in the embodiment of the present application is used to communicate signaling or data with other node devices. The memory 330 can be a high-speed RAM memory or a non-volatile memory, such as at least one disk storage. The memory 330 can optionally be at least one storage device located away from the aforementioned processor. The memory 330 stores computer-readable instructions. When the computer-readable instructions are executed by the processor 310, the electronic device performs the above-mentioned method process.

[0133] I understand. Figure 4 The structure shown is only for illustration, and the electronic device may also include Figure 4 More or fewer components than shown, or with Figure 4 Different configurations shown. Figure 4 Each component shown in the figure can be implemented by hardware, software or a combination thereof.

[0134] An embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the method process executed by the electronic device in the above method embodiment is executed.

[0135] This embodiment discloses a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium. The computer program includes program instructions. When the program instructions are executed by a computer, the computer can perform the methods provided in the above method embodiments, for example, including: Receive the i-th retransmitted coded data, where i is a positive integer; Determine data block n from the coded data i , wherein the data block n i Refers to the data block n that failed to be decoded in the coded data received for the i-1th time i-1 , the data block n i With the data block n i-1correspond; The data block n i The derate-matched bit stream is the same as the data block n i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

[0136] In summary, the embodiments of the present application provide a method, device, electronic device, storage medium and program product for processing retransmitted data. By accurately locating the CB block that failed to be decoded in the last transmission, physical layer processing is only performed on the CB block that failed to be decoded in the last transmission, and the symbol-level and bit-level processing of the successfully decoded CB block is skipped. This processing optimizes the base station's processing flow for retransmitted data, thereby reducing unnecessary computing overhead and resource waste, and reducing the processing overhead of the base station.

[0137] In the embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interface, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0138] In addition, the units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0139] Furthermore, the functional modules in each embodiment of the present application can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part.

[0140] In this document, relational terms such as first and second, etc. are used merely to distinguish one entity or operation from another entity or operation, but do not necessarily require or imply any actual relationship or order between these entities or operations.

[0141] The above description is merely an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, various modifications and variations of the present application are possible. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application shall be included in the scope of protection of the present application.

Claims

1. A method for processing retransmission data, characterized in that: Applied to a base station, the method includes: Receive the i-th retransmitted coded data, where i is a positive integer; Determine data block n from the coded data i , wherein the data block n i Refers to the data block n that failed to be decoded in the coded data received for the i-1th time i-1 , the data block n i With the data block n i-1 correspond; The data block n i The derate-matched bit stream is the same as the data block n i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

2. The method according to claim 1, characterized in that Before receiving the coded data retransmitted for the i-th time, the method further includes: The data block n that failed to be decoded in the coded data received for the i-1th time i-1 storing the rate-matched bit stream of the decoded data block in the first cache, and storing the decoded bit streams of other successfully decoded data blocks in the second cache; The data block n i The derate-matched bit stream is the same as the data block n i-1 After combining the de-rate-matched bit streams and decoding the combined bit streams, the method further includes: If decoding of the combined bit stream fails, storing the combined bit stream in the first buffer; If the combined bit stream is decoded successfully, the decoded bit stream is stored in the second buffer.

3. The method according to claim 2, characterized in that After storing the decoded bit stream into the second buffer, the method further includes: bit-concatenating the decoded bit streams of all data blocks in the second buffer to obtain a concatenated bit stream; A CRC check is performed on the concatenated bit stream.

4. The method according to claim 2, characterized in that When i is 1, the coded data received for the (i-1)th time is the initially transmitted coded data.

5. The method according to claim 2, characterized in that If decoding of the combined bit stream fails, after storing the combined bit stream in the first cache, the method further includes: After the number of retransmissions reaches the maximum number of retransmissions, if the data block n i-1 If the corresponding combined bit stream still fails to be decoded, it is determined that the coded data has a check error and the terminal is instructed to stop retransmitting the coded data.

6. The method according to claim 5, characterized in that The maximum number of retransmissions is less than or equal to the number of redundancy versions RVs.

7. The method according to claim 5, characterized in that The maximum number of retransmissions is determined based on the decoding statistics of the (i-1)th encoded data.

8. The method according to claim 1, characterized in that The data block n is determined from the coded data. i ,include: Determine the redundant version RV(i) of the i-th retransmission; Determine data block n from the coded data according to the redundancy version RV(i) i .

9. The method according to claim 8, characterized in that The data block n is determined from the coded data according to the redundancy version RV(i). i ,include: Determining a bit offset according to the redundancy version RV(i); According to the bit offset and data block n i-1 The index of the data block and the size of the data block are used to determine the data block n. i The bit position of The bit stream at the bit position is extracted from the coded data as the data block n i .

10. A retransmission data processing device, characterized in that: Running on a base station, the device includes: A data receiving module, configured to receive the i-th retransmitted coded data, where i is a positive integer; A data block determination module, configured to determine data block n from the coded data i , wherein the data block n i Refers to the data block n that failed to be decoded in the coded data received for the i-1th time i-1 , the data block n i With the data block n i-1 correspond; The combined decoding module is used to convert the data block n i The derate-matched bit stream is the same as the data block n i-1 The de-rate matched bit streams are merged and the merged bit stream is decoded.

11. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the method according to any one of claims 1 to 9 is executed.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 9 is executed.

13. A computer program product, characterized in that The method comprises computer program instructions, and when the computer program instructions are read and executed by a processor, the method according to any one of claims 1 to 9 is executed.

Images