Communication method and device, storage medium and program product

Abstract

The invention provides a communication method and device, a storage medium and a program product, relates to the technical field of communication, and can solve the problem of poor service experience in related technologies. The method comprises the following steps of: enabling an upper-layer key data packet to correspond to k first-type TBs (Transport Blocks) of a TB set; the TB set comprises at least k TBs, the at least k TBs comprise k first-type TBs, data of the first-type TBs come from an upper layer, and k is an integer greater than 1; and mapping the plurality of TBs of the TB set on a physical channel, and sending the plurality of TBs of the TB set to a second network element. The method can improve the complete submission efficiency of the key data, and further improves the service experience.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a communication method, apparatus, storage medium, and program product. Background Technology

[0002] With the advancement of communication technology and the continuous enrichment of service types, related services have placed higher demands on communication performance. For example, services such as holographic communication and extended reality (XR) require communication performance to simultaneously meet the requirements of ultra-high throughput and ultra-low latency for reliable transmission.

[0003] Currently, wireless communication typically uses transport blocks (TBs) for physical layer scheduling and transmission. Each TB is mapped to an antenna for transmission after undergoing physical layer operations such as channel coding and modulation. When the size of a TB (TBsize, TBS) is too large, TB transmission failures can have serious consequences. In particular, errors in the physical layer transmission of critical upper-layer data packets can lead to poor service experience. Summary of the Invention

[0004] This disclosure provides a communication method, apparatus, storage medium, and program product that can solve the problem of poor service experience caused by the low efficiency of complete delivery of key data packets in related technologies.

[0005] On the one hand, a communication method is provided, applied to a first network element, including:

[0006] A key data packet from an upper layer is mapped to k first-type TBs in a transport block (TB) set; the TB set includes at least k TBs and k of the at least k TBs are first-type TBs, the data of the first-type TBs comes from the upper layer, and k is an integer greater than 1;

[0007] Multiple TBs of the TB set are mapped onto a physical channel, and the multiple TBs of the TB set are sent to the second network element.

[0008] Furthermore, another communication method is provided for application to the second network element, including:

[0009] Multiple transport blocks (TBs) from a transport block (TB) set are received on a physical channel from a first network element; the TB set includes at least k TBs and k of the at least k TBs are of type 1, the k type TBs of the TB set correspond to an upper-layer key data packet, the type TBs are TBs that need to be submitted to the upper layer, and k is an integer greater than 1;

[0010] The operation of submitting TBs to the upper layer is only performed if all k first-type TBs of the TB set are successfully obtained. The TBs submitted to the upper layer are the k first-type TBs of the TB set.

[0011] In another aspect, a communication device is provided, comprising: a processing unit and a communication unit;

[0012] The processing unit is used to map an upper-layer key data packet to k first-type TBs in a transport block TB set; the TB set includes at least k TBs and k of the at least k TBs are first-type TBs, the data of the first-type TBs comes from the upper layer, and k is an integer greater than 1;

[0013] The communication unit is used to map multiple TBs of the TB set onto a physical channel and send multiple TBs of the TB set to the second network element.

[0014] In another aspect, a communication device is provided, comprising: a processing unit and a communication unit;

[0015] The communication unit is used to receive multiple TBs from a transport block TB set from a first network element on a physical channel; the TB set includes at least k TBs and k of the at least k TBs are of type 1, the k type TBs of the TB set correspond to an upper-layer key data packet, the first type TB is the TB that needs to be submitted to the upper layer, and k is an integer greater than 1;

[0016] The processing unit is configured to perform the operation of submitting TBs to the upper layer only if all k first-type TBs of the TB set are successfully acquired. The TBs submitted to the upper layer are the k first-type TBs of the TB set.

[0017] In another aspect, a communication device is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store a computer program; and the processor, when executing the computer program, implements the method described in any of the above embodiments.

[0018] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored, which, when executed by a processor, implement the method described in any of the above embodiments.

[0019] In another aspect, a computer program product is provided, the computer program product including computer program instructions that, when executed by a processor, implement the method described in any of the above embodiments.

[0020] In this embodiment, a first network element maps a critical upper-layer data packet to k first-type TBs in a transport block TB set. Then, the first network element can map multiple TBs from the TB set onto a physical channel and send these multiple TBs to a second network element. In related technologies, the physical layer transmission of a critical data packet containing a large amount of data suffers from low efficiency due to difficulties in obtaining scheduling opportunities and low physical layer transmission efficiency. This disclosure addresses this issue by mapping a critical upper-layer data packet to a physical layer TB set, ensuring that the critical upper-layer data packet can be delivered completely and quickly during physical layer transmission. Mapping a critical upper-layer data packet to multiple smaller TBs in a TB set increases the scheduling opportunities for data transmission, and using TB set transmission facilitates the use of techniques that improve TB transmission success rates, such as retransmitting only erroneous TBs or recovering erroneous TBs through packet encoding and decoding. Therefore, this disclosure improves the efficiency of successful and complete transmission of a critical upper-layer data packet at the physical layer, enabling the physical layer data corresponding to a critical upper-layer data packet to be delivered completely to the upper layer as quickly as possible, thereby improving the service experience. Attached Figure Description

[0021] To more clearly illustrate the technical solutions in this disclosure, the accompanying drawings used in some embodiments of this disclosure will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings.

[0022] Figure 1 This is a structural diagram of a data packet mapping provided in some embodiments of this disclosure;

[0023] Figure 2 This is a structural diagram of yet another data packet mapping provided in some embodiments of the present disclosure;

[0024] Figure 3 This is a structural diagram of yet another data packet mapping provided in some embodiments of the present disclosure;

[0025] Figure 4 This is a structural diagram of yet another data packet mapping provided in some embodiments of the present disclosure;

[0026] Figure 5 An architecture diagram of a communication system provided for some embodiments of this disclosure;

[0027] Figure 6 A flowchart illustrating a communication method provided for some embodiments of this disclosure;

[0028] Figure 7 This is a structural diagram of a TB collection transmission provided by some embodiments of the present disclosure;

[0029] Figure 8 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0030] Figure 9 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0031] Figure 10 A structural diagram of a TB collection transmitted in the frequency domain is provided for some embodiments of this disclosure;

[0032] Figure 11 A structural diagram of a TB collection transmitted in the time domain, provided for some embodiments of this disclosure;

[0033] Figure 12 A structural diagram of a TB collection transmitted in the time-frequency domain is provided for some embodiments of this disclosure;

[0034] Figure 13 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0035] Figure 14 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0036] Figure 15 A flowchart illustrating a communication method provided for some embodiments of this disclosure;

[0037] Figure 16 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0038] Figure 17 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0039] Figure 18 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0040] Figure 19 A flowchart illustrating yet another communication method provided in some embodiments of this disclosure;

[0041] Figure 20 A structural diagram of a first network element provided in some embodiments of this disclosure;

[0042] Figure 21 A structural diagram of a second network element provided in some embodiments of this disclosure;

[0043] Figure 22 This is a structural diagram of a communication device provided for some embodiments of this disclosure. Detailed Implementation

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

[0045] It should be noted that, in this disclosure, the terms "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in this disclosure should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0046] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature.

[0047] In the description of this disclosure, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "more than one" means two or more.

[0048] With the advancement of communication technologies and the continuous enrichment of service types, related services are placing higher demands on communication performance. For example, holographic communication and XR services require communication performance to simultaneously meet ultra-high throughput and ultra-low latency requirements. These services combine the characteristics of both enhanced mobile broadband (eMBB) and ultra-reliable and low-latency communication (URLLC) scenarios, demanding not only extremely high throughput but also very high latency. For future-oriented communication systems, the application of artificial intelligence (AI), sensing, and big data will also bring about the need for transmitting large amounts of information.

[0049] Due to various factors such as path loss, channel fading, interference, and noise, wireless communication systems are prone to data transmission failures. For critical data such as I-frames (intra-coded frames, also known as keyframes, coded keyframes, or intra-coded frames) in XR video streams and parameter files in AI models, the integrity of data packets directly impacts user experience and system performance. If individual data points in a critical data packet fail during physical layer transmission, the entire critical data packet will fail, directly leading to a poor service experience (e.g., unclear video images, failure to acquire AI models, etc.).

[0050] Currently, in wireless communication, the transmission time interval (TTI) is typically used as the basic time-domain scheduling unit to schedule the transmission of each TB. Each hybrid automatic repeat request (HARQ) process handles only one TB per TTI, and each TB is mapped onto the antenna and transmitted after undergoing physical layer processes such as channel coding and modulation.

[0051] Each data block (TB) has a cyclic redundancy check (CRC) code. If a TB forms multiple coding blocks (CBs) after channel coding, each CB will also have a CRC. Only when the CRCs of all CBs and the entire TB pass the check can the TB be successfully acquired and submitted to the media access control (MAC) layer. When the size of a TB is too large, a failure of any CRC check will cause the transmission of the entire TB to fail.

[0052] For example, when critical data is mapped to one TB and transmitted over one TTI, such as Figure 1 As shown, a critical upper-layer data packet is transmitted to TB0 on ​​TTI0. At this time, even if only a small portion of the data fails to be transmitted due to local interference, the sending end still needs to retransmit the entire TB0 data.

[0053] For example, when critical data is mapped to multiple TTIs for transmission, such as Figure 2 As shown, a single upper-layer critical data packet P0 is mapped to TB0 transmitted on TTI0 and TB1 transmitted on TTI1, which can lead to excessive transmission latency. For example, for cell edge users, transmitting a large critical data packet in related technologies requires allocation across multiple TTIs, and the waiting time for allocation and scheduling opportunities to transmit the critical data packet is also relatively long. Moreover, the retransmission time after a TB transmission fails is also relatively long.

[0054] For example, when multiple key data points are mapped to one TB and transmitted over one TTI, such as... Figure 3 As shown, one upper-layer critical data packet P0 and a portion of another upper-layer critical data packet P1 are mapped to TB0 transmitted on TTI0. When TB0 transmission fails due to local interference, the transmission of both critical data packets P0 and P1 will also fail.

[0055] In summary, the relevant technologies are insufficient to meet the need for rapid and complete delivery of critical data packets, resulting in a poor user experience for related services.

[0056] Therefore, in the technical solution provided in this disclosure, the first network element maps an upper-layer key data packet to k first-type TBs in a transport block TB set. Then, the first network element can map multiple TBs of the TB set onto a physical channel and send the multiple TBs of the TB set to the second network element. For example, as shown... Figure 4 As shown, one upper-layer critical data packet P0 is mapped to a TB set, and the TB set is transmitted on TTI0. That is, multiple TBs of a TB set are transmitted on one TTI, and the TB set corresponds to one upper-layer critical data packet. In related technologies, one upper-layer critical data packet P0 transmits one TB on one TTI. Due to limited transmission resources, poor channel conditions, interference, and other factors, the amount of data that can be carried and the scheduling opportunities are not great. It is difficult for the physical layer TB data corresponding to one upper-layer critical data packet to be transmitted successfully in a short period of time. If a critical data packet cannot be successfully obtained in time, it will seriously affect the service experience.

[0057] The network architecture of the mobile communication network (including but not limited to 3G, 4G, 5G, and future mobile communication networks) in this disclosure embodiment may include at least a first network element and a second network element. It should be understood that, in this example, in the downlink, the first network element may be a network-side device (e.g., including but not limited to a base station), and the second network element may be a terminal-side device (e.g., including but not limited to a terminal). Of course, in the uplink, the first network element may also be a terminal-side device, and the second network element may also be a network-side device. Furthermore, the first and second network elements may also be modules of a device in a communication system, or protocol layers in a communication system (e.g., including but not limited to the MAC layer). This module may be implemented as a software module, a hardware module, or a combination of software and hardware modules.

[0058] For example, such as Figure 5 As shown, a communication system provided in this embodiment of the present disclosure includes a base station 501 and a terminal 502. There may be one or more base stations 501 and terminals 502, and the number is not limited.

[0059] Base station 501 is a device located on the access network side of the aforementioned communication system, possessing wireless transceiver capabilities, or a chip or chip system that can be installed on such device. Base station 501 includes, but is not limited to: access points (APs) in WiFi systems, such as home gateways, routers, servers, switches, bridges, etc.; evolved NodeBs (eNBs), radio network controllers (RNCs), NodeBs (NBs), basestation controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved NodeBs, or home NodeBs, HNBs), base band units (BBUs), wireless relay nodes, wireless backhaul nodes (e.g., integrated access and backhaul (IAB) nodes), transmission and reception points (TRPs or transmission points, TPs), etc., and can also be 5G base stations, such as new radio (NR) stations. In a 5G radio (NR) system, a gNB, or a transmission point (TRP or TP), can be a gNB or a group of antenna panels (including multiple antenna panels) in a base station in a 5G system. Alternatively, it can be a network node constituting a gNB or transmission point, such as a baseband unit (BBU), a distributed unit (DU), a roadside unit (RSU) with base station functionality, or NG radio access network (NG-Ran) equipment. Base station 501 also includes base stations in different networking modes, such as a master evolved NodeB (MeNB) and a secondary eNB (SeNB, or secondary gNB, SgNB). Base station 501 also includes different types, such as terrestrial base stations, airborne base stations, and satellite base stations.

[0060] Terminal 502 is a device with wireless communication capabilities that can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted. It can also be deployed on water (such as on ships) and in the air (e.g., on airplanes, balloons, and satellites). Terminal 502 is also known as user equipment (UE), mobile station (MS), mobile terminal (MT), and terminal equipment, and is a device that provides voice and / or data connectivity to users. For example, terminal 502 includes handheld devices and vehicle-mounted devices with wireless connectivity. Currently, terminal 502 can be: mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), wearable device (e.g., smartwatch, smart bracelet, pedometer, etc.), in-vehicle device (e.g., car, bicycle, electric vehicle, airplane, ship, train, high-speed rail, etc.), virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, smart home device (e.g., refrigerator, television, air conditioner, electricity meter, etc.), smart robot, workshop equipment, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, or wireless terminal in smart home, flying device (e.g., smart robot, hot air balloon, drone, airplane), etc. In one possible application scenario disclosed in this disclosure, the terminal is a terminal that frequently operates on the ground, such as in-vehicle device. In this disclosure, for ease of description, the chip deployed in the above-mentioned device, such as a system-on-a-chip (SOC), a baseband chip, or other chip with communication functions, may also be referred to as a terminal.

[0061] In some embodiments, for downlink transmission, base station 501 can map an upper-layer key data packet to k first-type TBs in a TB set. Then, base station 501 can map multiple TBs in the TB set onto a physical channel and send the multiple TBs of the TB set to terminal 502. Correspondingly, terminal 502 can receive multiple TBs from base station 501 on a physical channel. The validity of a key data packet is guaranteed only if all data in the key data packet is received completely at the physical layer. If any data in a key data packet is not successfully received, the key data packet is incomplete, and an incomplete key data packet cannot be used at the upper layer. Therefore, terminal 502 only performs the operation of submitting TBs to the upper layer, i.e., submitting the k first-type TBs of the TB set to the upper layer, if all k first-type TBs of the TB set are successfully acquired. In this way, the upper layer can obtain a complete upper-layer key data packet based on the k first-type TBs.

[0062] In some embodiments, for uplink transmission, terminal 502 can map an upper-layer key data packet to k first-type TBs in a TB set. Then, terminal 502 can map multiple TBs in the TB set onto a physical channel and send the multiple TBs of the TB set to base station 501. Correspondingly, base station 501 can receive multiple TBs from terminal 502 in a TB set on a physical channel. The validity of a key data packet is guaranteed only if all data in the key data packet is received completely at the physical layer. If any data in a key data packet is not successfully received, the key data packet is incomplete, and an incomplete key data packet cannot be used at the upper layer. Therefore, base station 501 only performs the operation of submitting TBs to the upper layer, i.e., submitting the k first-type TBs of the TB set to the upper layer, if all k first-type TBs of the TB set are successfully acquired. In this way, the upper layer can obtain a complete upper-layer key data packet based on the k first-type TBs.

[0063] The TB set sent may include a first type of TB (also known as TB raw packet, TB source packet or TB system packet) for carrying upper layer data, and may also include a second type of TB (also known as TB redundancy packet or TB check packet) for error recovery of TB raw packet.

[0064] In some embodiments, base station 501 or terminal 502 can generate a second type TB (also called a TB redundancy packet or TB check packet) for error recovery of the original TB packet using packet encoding. Packet encoding, also known as network encoding, is a technique to improve network throughput and data reliability. This encoding technique is typically called network encoding. Because it encodes multiple independent data packets, network encoding is also called packet encoding. This disclosure does not specifically distinguish between the two. Packet encoding aims to integrate data before transmission, allowing the receiving end to recover the data based on this integration method.

[0065] Packet encoding types include linear packet encoding and non-linear packet encoding. Taking linear packet encoding as an example, a new transport block TB3 (also called a TB redundancy packet or TB check packet) can be obtained by performing an AND-OR operation on transport blocks TB1 and TB2 (which can also be called the TB original packet, TB source packet, or TB system packet). The sending end sends these three transport blocks, and the receiving end only needs to successfully receive any two transport blocks to recover the other failed transport block (e.g., recovering TB2 from TB1 and TB3, or recovering TB1 from TB2 and TB3).

[0066] For example, the encoding algorithm used in packet encoding can be fountain code. The characteristic of fountain code is that it can send packets indefinitely without a bit rate limit. As long as the receiving end receives a sufficient number of encoded packets, it can recover all the original packets with a high probability. For instance, for k TB original packets to be transmitted, after packet encoding, k+m encoded TBs are obtained (including k TB original packets and m TB check packets). The receiving end only needs to successfully receive any k TBs from these k+m encoded TBs to recover all the original TB packets with the target probability.

[0067] It should be noted that the various embodiments of this disclosure can be referenced or learned from each other. For example, the same or similar steps, method embodiments, system embodiments and device embodiments can be referenced from each other without limitation.

[0068] The following is combined with Figure 5 The communication system shown herein uses the interaction between a first network element and a second network element as an example to describe the communication method provided in the embodiments of this disclosure. It should be noted that in the following embodiments of this disclosure, the first network element is the data sender, and the second network element is the data receiver. The first network element and the second network element can be devices, modules of the devices, or protocol layers in the communication system. This disclosure uses the first network element and the second network element as the execution entities for the interaction illustration, but this disclosure does not limit the execution entities for the interaction illustration.

[0069] Figure 6A flowchart illustrating a communication method provided in an embodiment of this disclosure. Figure 6 As shown, the method includes the following steps:

[0070] Step 601: Map an upper-layer key data packet to k first-type TBs in a TB set.

[0071] The TB set includes at least k TBs, and among the at least k TBs, k are of type 1. The data of the type 1 TBs comes from the upper layer, and k is an integer greater than 1.

[0072] In some embodiments, the k first-type TBs are of equal size.

[0073] In some embodiments, the at least k TBs further include m second-type TBs, where the first-type TBs are the original TB packets without packet encoding, and the second-type TBs are TB check packets generated by packet encoding the k first-type TBs; the TB check packets are used to perform error recovery on the original TB packets, and m is a positive integer.

[0074] For example, a TB set is used for the physical transmission of a critical upper-layer data packet. The original TB packet before packet encoding, also called the TB system packet or TB source packet, is the data transmitted from the upper layer of the sending end to the physical layer or the data that the receiving end needs the physical layer to deliver to the upper layer. For example, each Type I TB corresponds to one MAC Protocol Data Unit (PDU). Furthermore, the TB system packet and TB source packet after packet encoding are identical to the original TB packet before packet encoding.

[0075] A TB check packet, also known as a TB redundancy packet, is a TB-encoded packet after packet encoding. In some packet encoding algorithms, the TB check packet contains partial information from the first type of TB before packet encoding, obtained through finite field multiplication. The data in the TB check packet is generated by the physical layer and is used for error recovery of the original TB packet; the receiving end does not need to submit the TB check packet to the upper layer. At the receiving end, the TB check packet can be used for packet encoding decoding to recover the original TB packet that failed to transmit. Each TB check packet requires packet encoding and decoding using a corresponding encoding matrix vector.

[0076] In some embodiments, upper-layer critical data packets include data that is crucial to the business experience. That is to say, when the device fails to successfully obtain upper-layer critical data packets, it can lead to a severe deterioration in the business experience or the failure of the entire business.

[0077] For example, upper-layer critical data packets include, but are not limited to, one of the following: data packets corresponding to a PDU set, video-coded keyframes, video-coded frames, AI model data files, parameter files in AI models, software update packages, medical image data packages, geographic information system (GIS) update files, financial transaction sensitive information packets, and emergency communication critical information packets. For instance, an upper-layer critical data packet might be an I-frame (intra-coded frame) in an XR service; a failed I-frame would degrade the XR service experience. Similarly, an upper-layer critical data packet might correspond to a software update package; any missing data in the software update package would render it invalid. Finally, an upper-layer critical data packet might correspond to a complete AI model parameter file; any missing data in the AI ​​model parameter file would affect the accuracy of the AI ​​model.

[0078] In one possible implementation, the first network element can segment a critical upper-layer data packet to obtain k MACPDUs.

[0079] Among them, k MAC PDUs correspond to k Type I TBs, and one MAC PDU corresponds to one Type I TB.

[0080] In some embodiments, the first network element can segment an upper-layer key data packet at the MAC layer to obtain k MAC PDUs.

[0081] For example, the first network element can determine the size of each MAC PDU based on the first information, and segment an upper-layer key data packet according to the size of each MAC PDU to obtain k MAC PDUs.

[0082] The first information includes at least one of the following: channel quality indication, channel state information, available transmission resources, UE capability, scheduling request (SR), service requirements, service type, scenario information, number k of the first type of TB, scheduling information, and the physical layer transmittable TB size.

[0083] In one example, a TB set identifier corresponds to an identifier of an upper-layer critical data packet. The TB set identifier indicates whether the corresponding data packet is an upper-layer critical data packet and, if so, which upper-layer critical data packet.

[0084] Step 602: Map multiple TBs of a TB set onto a physical channel and send multiple TBs of the TB set to the second network element.

[0085] In one possible implementation, the first network element sends multiple TBs of the TB set to the second network element over a transmission unit.

[0086] The transmission unit includes at least one of the following: TTI, slot, minislot, or HARQ process.

[0087] For example, for downlink transmission, the physical channel can be a downlink data transmission channel, such as a physical downlink shared channel (PDSCH). In this case, multiple TBs transmitted are carried on a single PDSCH and transmitted using a single TTI.

[0088] For uplink transmission, the physical channel can be an uplink data transmission channel, such as a physical uplink shared channel (PUSCH). In this case, multiple TBs are transmitted on a single PUSCH using a single TTI.

[0089] In one possible implementation, the multiple TBs sent by the TB set are mapped to the same codeword and sent to the second network element.

[0090] Among them, the multiple TBs sent by the first network element can be either the first transmission or a retransmission.

[0091] For example, such as Figure 7 As shown, during the initial transmission, the first network element can send TB0, TB1, TB2, and TB3 from the TB set on one TTI, where TB0, TB1, TB2, and TB3 are all first-type TBs. The TB set corresponds to one upper-layer key data packet P0. Assuming that TB0 and TB2 fail to transmit, but TB1 and TB3 succeed, during retransmission, the first network element can send TB0, TB4, TB2, and TB5 from the TB set on one TTI, where TB0 and TB2 are first-type TBs, and TB4 and TB5 are second-type TBs.

[0092] In some embodiments, multiple TBs are selected from the TB set by at least one of the following:

[0093] The TB set contains the current number of transmissions;

[0094] Available transmission resources corresponding to a TB set;

[0095] Feedback information from the second network element.

[0096] For example, when the TB set is being transmitted for the first time, the first network element can select multiple TBs of the first type from the TB set. When the TB set is being retransmitted, the first network element can select multiple TBs of the first type and / or TBs of the second type from the TB set.

[0097] Based on the above technical solution, the first network element maps an upper-layer key data packet to k first-type TBs in a transport block TB set. Then, the first network element can map multiple TBs from the TB set onto a physical channel and send these multiple TBs to the second network element. In related technologies, when channel conditions are poor and the amount of data to be transmitted is large, the transmission of the upper-layer key data packet struggles to obtain sufficient scheduling opportunities, as this consumes significant transmission resources and impacts overall system performance. Furthermore, even after obtaining scheduling opportunities, the size of the TB that can be transmitted is limited due to poor channel conditions. In particular, interference can cause the entire TB transmission to fail. These factors all contribute to low transmission efficiency of a key data packet at the physical layer, making it difficult to guarantee reliable transmission of a key data packet with low latency and large data volume, ultimately resulting in a poor service experience. This disclosure, by mapping an upper-layer key data packet to a physical layer TB set, ensures that an upper-layer key data packet can be successfully transmitted and completely delivered as quickly as possible during physical layer transmission. Mapping a critical upper-layer data packet to multiple smaller TBs within a TB set increases the scheduling opportunities for data transmission. Furthermore, using TB sets facilitates the use of techniques that improve TB transmission success rates, such as retransmitting only erroneous smaller TBs or recovering erroneous TBs through packet encoding / decoding. Therefore, this disclosure can improve the completeness of a critical upper-layer data packet's successful transmission at the physical layer, enabling the physical layer data corresponding to a critical upper-layer data packet to be delivered to the upper layer as quickly and completely as possible, thereby enhancing the service experience.

[0098] In some embodiments, the first network element can receive feedback information from the second network element to obtain the transmission TB status.

[0099] As one embodiment of this disclosure, combined with Figure 6 The illustrated embodiments, such as Figure 8 As shown, the method further includes the following step 801.

[0100] Step 801: Receive feedback information from the second network element.

[0101] The feedback information includes at least one of the following:

[0102] Feedback information used to characterize the successful transmission of a TB set, wherein the successful transmission of the TB set means that the second network element has successfully acquired k first-type TBs of the TB set;

[0103] Feedback information used to characterize the transmission failure of a TB set, wherein the transmission failure of the TB set means that the second network element failed to successfully acquire at least one TB of the k first type TBs of the TB set;

[0104] Feedback information for each of the multiple TBs, the feedback information for each TB is used to characterize whether the second network element has successfully acquired the corresponding TB.

[0105] In other words, the feedback information can be information at the TB set granularity and / or TB granularity. This feedback information is a feedback indication from the second network element to the previous TB transmissions for this TB set, and can be set-level feedback for the entire TB set and / or feedback for each TB.

[0106] For example, the feedback information used to characterize the successful transmission of the TB set can be an ACK indicator, and the feedback information used to characterize the failed transmission of the TB set can be a NACK indicator. Both the ACK and NACK indicators can be represented by a single bit.

[0107] For example, the second network element can send an ACK (Backpacker) TB-level feedback indication to the first network element, which can be represented by a single bit. When the first network element receives the ACK TB-level feedback, it can determine that the TB set has been successfully transmitted.

[0108] For example, the second network element can send a NACK TB set-level feedback indication to the first network element, which can be represented by a single bit. After receiving the NACK indication, the first network element can determine, based on this indication, that there were instances in previous transmissions where not all first-type TBs were successfully acquired.

[0109] In some embodiments, sending this feedback information is not mandatory. For example, the second network element may send feedback information when all first-type TBs are successfully acquired. When there are first-type TBs that are not successfully acquired, the second network element may not send feedback information. When the first network element is sending data for each TB set, it may continue sending TB data until it receives feedback information indicating that all TB sets have been successfully transmitted, at which point it stops sending the TB set data.

[0110] For example, the feedback information can be HARQ feedback. The feedback information for each TB across multiple TBs can be represented by a bitmap, or each TB's feedback information can be indicated by a single bit. The first network element uses channel decoding to obtain the HARQ feedback information for the currently transmitted multiple TBs. For example, the second network element feeds back a 1-bit ACK / NACK indication for each of the currently transmitted multiple TBs. After receiving this, the first network element can determine which TBs have been successfully transmitted and which TBs need to be retransmitted. Alternatively, the second network element can use a bitmap to indicate the HARQ feedback for multiple TBs. The second network element channels-codes the HARQ feedback for the currently transmitted multiple TBs before sending it, thereby obtaining coding gain. The first network element, upon receiving this, performs channel decoding to obtain the HARQ feedback for the currently transmitted multiple TBs.

[0111] For example, this bitmap information can indicate whether a TB in this transmission was not successfully acquired, or whether a first-type TB was successfully acquired. For instance, "0010" can indicate that the third TB in this transmission failed to acquire, while the other three TBs were successfully acquired. As another example, "0010" can indicate that among the four first-type TBs in all transmitted TBs, the third first-type TB failed to acquire, while the other three first-type TBs were successfully acquired. When the first network element receives TB-level feedback, it can clearly know which TBs were successfully acquired, which TBs failed to acquire, and whether there are any first-type TBs that failed to acquire. When the first network element confirms that at least one first-type TB in the TB set has failed to acquire, the first network element can send at least one second-type TB. The second-type TB can be used by the receiving end to recover the failed first-type TB through packet encoding decoding.

[0112] In some embodiments, the first network element may also determine whether to terminate the transmission of the TB set based on feedback information.

[0113] As one embodiment of this disclosure, combined with Figure 6 The illustrated embodiments, such as Figure 8 As shown, the method further includes the following step 802.

[0114] Step 802: Determine whether to end the transmission of the TB set based on the feedback information.

[0115] In one possible implementation, upon receiving feedback information indicating successful transmission of the TB set, the first network element determines to terminate the transmission of the TB set.

[0116] In one example, when the first network element receives feedback information indicating that the TB set has been successfully transmitted, it can be considered that the upper-layer key data packet has been successfully sent, and at this time the first network element can end the transmission of the TB set.

[0117] In another possible implementation, when feedback information indicating a transmission failure of the TB set is received, and the maximum number of transmissions to the TB set has been reached, the first network element determines to terminate the transmission to the TB set.

[0118] Upon receiving feedback information indicating a transmission failure of the TB set, and if the number of transmissions of the TB set has not reached the maximum number of transmissions, the first network element determines to retransmit the TB set.

[0119] In one example, when the first network element receives feedback information indicating a transmission failure of the TB set, it can determine whether the maximum number of transmissions for the TB set has been reached. If the maximum number of transmissions has not been reached, it can be assumed that the upper-layer critical data packets need to be retransmitted at the physical layer, and the first network element can then decide to retransmit the TB set. If the maximum number of transmissions has been reached, it can be assumed that the upper-layer critical data packets have failed to be sent. Continuing to retransmit here may affect the normal communication of the first network element, and in this case, the first network element can decide to terminate the transmission of the TB set.

[0120] In some embodiments, in each retransmission, the retransmission packet can be exactly the same as the first transmitted TB, or it can be a different redundant version (RV) of the first transmitted TB. For example, TB0 is a first type TB, and the first network element can use different RV versions of TB0 as retransmission packets for TB0, enabling the receiver to perform soft information merging on the multiple transmissions of TB0 data, thereby improving the channel decoding success rate of TB0. As another example, TB4 is a second type TB, and using different RV versions of TB4 as retransmission packets for TB4 enables the receiver to perform soft information merging on the multiple transmissions of TB4 data, thereby improving the channel decoding success rate of TB4. A second type TB that has successfully undergone channel decoding can recover a first type TB that failed to transmit through packet encoding decoding. Using retransmission and packet encoding on a set of TBs allows for faster successful transmission of all first type TBs, that is, faster successful transmission and complete delivery of a complete critical data packet at the physical layer.

[0121] In some embodiments, when it is determined that the transmission of the TB set is to be terminated, the first network element may perform at least one of the following: clear all buffers of the TB set; reset all information of the TB set; or start the transmission of a new TB set, the new TB set corresponding to a new upper-layer key data packet.

[0122] Based on the above technical solution, in this embodiment of the present disclosure, the first network element can determine the transmission status of the TB in the TB set based on the feedback information from the second network element, thereby determining the subsequent transmission strategy. In this way, the first network element can reasonably evaluate whether to terminate the transmission of the TB set, thereby improving the efficiency of data transmission.

[0123] In some embodiments, the first network element can also allocate transmission resources to multiple TBs through different TB mapping rules.

[0124] As one embodiment of this disclosure, combined with Figure 6 The illustrated embodiments, such as Figure 9 As shown, the method further includes the following step 901.

[0125] Step 901: Allocate transmission resources to the TBs in a TB set according to the TB mapping rules.

[0126] In one possible implementation, the first network element allocates transmission resources for the first type of TB among the multiple TBs on the transmission resources corresponding to the TB set, based on the TB mapping rule that prioritizes the first type of TB. Then, it allocates transmission resources for the second type of TB among the multiple TBs.

[0127] And / or,

[0128] Based on the TB mapping rule of the first type of TB, the first network element allocates the first type of TB to the first type of TB in the time domain and allocates the second type of TB to the second type of TB in the time domain on the transmission resources corresponding to the TB set.

[0129] Transmission resources include one of the following: time-domain resources, frequency-domain resources, and time-frequency resources.

[0130] Taking frequency domain resources as an example, such as Figure 10 As shown, for the TB mapping rule that prioritizes the first type of TB, the first network element can prioritize selecting frequency domain resources for the first type of TB (e.g., Figure 10 TB0 and TB1 in the middle), and then select the remaining frequency domain resources for the second type TB (e.g., ...). Figure 10 The first network element allocates multiple TBs (TB2 and TB3) to frequency domain resource blocks of the TB set, enabling multiple TBs to be transmitted on a single physical channel. The first network element can allocate the first type of TBs to the optimal frequency domain resources, thereby improving the transmission success rate of the first type of TBs.

[0131] Taking time-domain resources as an example, such as Figure 11 As shown, for the TB mapping rule of the first type of TB, the first network element can allocate the first position in the time domain to the first type of TB (e.g., Figure 11 In the context of TB0, TB1, and TB2, a later position in the time domain is assigned to the second type of TB (e.g., ...). Figure 11 In this way, multiple TBs are allocated to the time-domain resource block of the TB set (TB3), allowing multiple TBs to be mapped to a single physical channel for transmission. This ensures that the first type of TB is received first and channel decoding is performed first.

[0132] Taking time-frequency domain resources as an example, such as Figure 12 As shown, for the first type of TB priority and the TB mapping rule, the first network element can prioritize selecting the optimal and first-ranked time-frequency domain resources for the first type of TB (e.g., Figure 12 TB0 and TB1 in the middle), and then select the remaining time-frequency domain resources (e.g., TB0 and TB1 in the middle) for the second type of TB. Figure 12 The first type of TB (TB2 and TB3) is assigned to a time-frequency domain resource block of the TB set, allowing multiple TBs to be mapped to a single physical channel for transmission. This ensures that the first type of TBs are transmitted first and has a high success rate. If all first type TBs are transmitted successfully, there is no need to perform channel decoding on the second type of TBs, and therefore no need to decode the packet encoding of the successfully acquired TBs, further improving transmission efficiency.

[0133] In some embodiments, the first network element may also obtain scheduling information of the TB set to facilitate scheduling of the TB set. For example, the first network element may perform at least one of the following: obtain scheduling information of the TB set; determine the number of first-type TBs; determine the size of the first-type TBs; determine the number of TBs currently being transmitted by the TB set; determine the number of first-type TBs currently being transmitted by the TB set; determine the number of second-type TBs currently being transmitted by the TB set, wherein the second-type TBs are TB check packets obtained after packet encoding of k first-type TBs, and the TB check packets are used for error recovery of the first-type TBs; determine the transmission resource space currently used by the TB set for transmission, wherein the transmission resource space is the transmission resource available when the TB set is transmitted; and determine the transmission resource used by each TB currently being transmitted by the TB set.

[0134] In this embodiment of the present disclosure, the acquisition of scheduling information by the first network element is combined with... Figure 6 The illustrated embodiments, such as Figure 13 As shown, the method further includes the following step 1301.

[0135] Step 1301: Obtain the scheduling information of the TB set.

[0136] The scheduling information of the TB set is used to schedule the transmission of the TB set. This scheduling information may include scheduling information corresponding to the TB set, or scheduling information corresponding to each TB within the TB set.

[0137] In some embodiments, the scheduling information includes at least one of the following:

[0138] The TB set identifier corresponding to the TB set;

[0139] The location information of the transmission resources corresponding to the TB set;

[0140] The number of resource elements (REs) corresponding to the TB set;

[0141] The common modulation and coding scheme (MCS) corresponding to the TB set is used to indicate that TBs in the TB set use the same MCS for transmission.

[0142] The number of common space multiplexing layers corresponding to the TB set is used to indicate that TBs in the TB set use the same number of space multiplexing layers for transmission;

[0143] The codeword index used for TB transmission in the TB set;

[0144] The TB mapping rules;

[0145] The transmission resource location information corresponding to each TB currently being transmitted in the TB set;

[0146] The number of REs corresponding to each TB currently being transmitted in the TB set;

[0147] The MCS used by each TB transmission in the currently transmitted TB in the TB set;

[0148] The number of spatial multiplexing layers used by each TB transmission in the currently transmitted TB in the TB set;

[0149] The packet encoding algorithm used in the TB set;

[0150] The calculation method for the first type of TB size;

[0151] Size of the first type TB;

[0152] The number of TBs of the first type in the TB set is k;

[0153] The number of second-type TBs in the TB set is m;

[0154] The TB set represents the number of TBs currently being transmitted;

[0155] The index of each TB currently being transmitted in the TB set;

[0156] The packet encoding vector index of each TB currently being transmitted in the TB set;

[0157] The type indication of each TB currently transmitted in the TB set is used to indicate whether it is a first type TB or a second type TB.

[0158] For example, the index of a TB represents its sequence number within the TB set. The packet encoding vector of a TB can be indicated by its packet encoding vector index, or implicitly by association with its index. That is, the packet encoding vector corresponding to a TB can be determined by its index. The type of a TB can be indicated by type information or by its index. For example, a TB set may include k first-type TBs and m second-type TBs. The indices of the first-type TBs can be prioritized; for example, TBs with indices ranging from 0 to k-1 are first-type TBs, and TBs with indices ranging from k to k+m-1 are second-type TBs.

[0159] In some embodiments, scheduling information is obtained through at least one of the following: channel state information (CSI), downlink control information (DCI), radio resource control (RRC) messages, and media access control-control element (MAC CE).

[0160] For CSI, the first network element can determine scheduling information based on CSI. For DCI, the first network element can obtain scheduling information by receiving DCI, which includes a first-level DCI and / or a second-level DCI. The scheduling information corresponding to the TB set can be carried in the first-level DCI, and the scheduling information corresponding to the TB can be carried in the second-level DCI. For RRC messages, the first network element can obtain the scheduling information by receiving RRC messages, which may include the scheduling information. For MACCE, the first network element can obtain the scheduling information by receiving MAC CE, which may include the scheduling information.

[0161] In one example, the size, MCS level, and spatial multiplexing layer of each TB in a TB set can be the same. This way, the scheduling information does not need to include information such as the time-frequency domain location, time-frequency domain resources, MCS, and spatial multiplexing layer of each TB, thus reducing control signaling overhead. If the transmission scheme transmits k TBs in each transmission, the scheduling information does not need to include the number of TBs currently being transmitted in the TB set, further reducing overhead.

[0162] In another example, scheduling information can be obtained in several ways. For instance, the number k of the first type TBs in a TB set is usually constant. Therefore, when transmitting a TB set, the number k of the first type TBs in the TB set can be carried through an RRC message, thus achieving a semi-static indication of the number of first type TBs in the TB set. Furthermore, the transmission scheme can be indicated as transmitting k TBs each time. In this way, during each transmission, the MCS, spatial multiplexing layer, total REs, and TB mapping rules of the TB set can be dynamically indicated through DCI, thereby reducing signaling overhead.

[0163] For example, when the first network element is responsible for scheduling a TB set, it can generate scheduling information and send it to the second network element, thereby instructing the second network element to receive the TB set. The first network element can then send the TB set using this scheduling information. Similarly, when the second network element is responsible for scheduling a TB set, it can generate scheduling information and send it to the first network element, thereby instructing the first network element to send the TB set. The second network element can then receive the TB set using this scheduling information. Taking the transmission process between a base station and a terminal as an example, the base station is responsible for generating scheduling information and sending uplink and downlink transmission scheduling information to the terminal.

[0164] In some embodiments, after obtaining the scheduling information, the first network element can also send the scheduling information to the second network element. Taking the first network element as a base station and the second network element as a terminal as an example, the base station obtains the scheduling information for the downlink TB set transmission through CSI and sends the scheduling information for the TB set to the terminal, enabling the terminal to receive n TBs of data from the TB set based on the scheduling information.

[0165] For example, after receiving scheduling information, the second network element can determine the transmission resources corresponding to the data of the TB set received in a time-domain transmission unit, the transmission resources corresponding to each TB, the MCS level used, the spatial multiplexing layer information, the size of the TB set, the size of each TB, etc., based on the scheduling information, thereby enabling the decoding of each independent TB. If a TB encoded packet (e.g., a second type TB) is detected based on the scheduling information, and the first type TB has not been successfully acquired, packet encoding decoding can also be performed to recover the first type TB.

[0166] In some embodiments, the first network element may also determine the size of the first type of TB in order to allocate resources to the TBs in the TB set.

[0167] As one embodiment of this disclosure, combined with Figure 6 The illustrated embodiments, such as Figure 14 As shown, the method further includes the following step 1401.

[0168] Step 1401: Determine the size of the first type TB.

[0169] In some embodiments, the first network element can obtain second information and determine the size of the first type TB based on the second information.

[0170] The second information includes the number of REs corresponding to a TB set, the public MCS corresponding to the TB set, the number of public space reuse layers corresponding to the TB set, and the number of first type TBs in the TB set.

[0171] For example, the second type TB can be the same size as the first type TB, and the size of the second type TB is determined after the size of the first type TB is determined.

[0172] In one possible implementation, the first network element can determine the total size of the TB set based on the number of REs corresponding to the TB set, the common MCS corresponding to the TB set, and the number of common space multiplexing layers corresponding to the TB set (the total size of the TB set corresponds to the total number of TB bits that can be transmitted in the entire TB set, and the entire TB set can also be regarded as a virtual large TB). Then, the first network element determines the size of the first type TB based on the total size of the TB set and the number of first type TBs in the TB set.

[0173] In some embodiments, the total size of the TB set refers to the sum of the sizes of all first-type TBs in the TB set.

[0174] In some embodiments, the size of the first type TB satisfies the following formula:

[0175]

[0176] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs.

[0177] Alternatively, the size of the first type TB satisfies the following formula:

[0178]

[0179] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs; This represents the round-up operator.

[0180] For example, when all TBs within the TB set use the same MCS and the same number of spatial multiplexing layers, the first network element can calculate the total size of the TB set (i.e., the total number of TB bits that the entire TB set can transmit, which can also be considered a virtual large TB) based on the transmission resources allocated to the TB set, the common MCS, and the number of spatial multiplexing layers. Then, the size of the first type of TB is determined by equally dividing the total size of the TB set. For example, when the total size of the TB set is divisible by the number of first type TBs, it can be determined by... To calculate the size of the first type of TB, if the total size of the TB set cannot be divided by the number of first type TBs, the size of the first type TB can be calculated by rounding up the calculation result.

[0181] The total size of a TB set refers to the size calculated using the corresponding transmission resources, MCS, and the number of spatial multiplexing mapping layers. The total size of the TB set corresponds to the total number of TB bits that can be transmitted within the entire TB set; this entire TB set can also be considered a virtual large TB. Since directly sending large TB data can easily cause TB errors, this disclosure divides the total size of the TB set into multiple smaller TBs (i.e., first-type TBs), and transmits these multiple TBs as a single TB set. In other words, the virtual large TB is not a real TB; this is only for illustrative purposes.

[0182] In another possible implementation, the first network element can determine the number of REs allocated to each first-type TB based on the number of REs corresponding to a TB set and the number of first-type TBs in the TB set. Then, the first network element determines the size of the first-type TB based on the number of REs allocated to each first-type TB, the common MCS corresponding to the TB set, and the number of common space reuse layers corresponding to the TB set.

[0183] In some embodiments, the number of REs allocated to each first type TB satisfies the following formula:

[0184]

[0185] in, N represents the number of REs allocated to each first-type TB. RE This represents the number of REs corresponding to the TB set, and k represents the number of TBs of the first type.

[0186] Alternatively, the number of REs allocated to each Type I TB satisfies the following formula:

[0187]

[0188] in, N represents the number of REs allocated to each first-type TB. RE This represents the number of REs corresponding to the TB set, where k represents the number of TBs of the first type. This represents the floor operator.

[0189] For example, when all TBs in the TB set use the same MCS and the same number of spatial multiplexing layers, the first network element can first distribute the transmission resources allocated to the TB set equally to each first type TB as the transmission resources of each TB. Then, the size of each first type TB is calculated based on the transmission resources of each TB, the common MCS, and the number of spatial multiplexing layers.

[0190] In some embodiments, the number and / or size of the first type of TB is determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and TB mapping tables.

[0191] For example, the first network element can also obtain the size of each first type TB based on pre-configured information on the first network element side. For instance, the first network element locally configures the number k of first type TBs, obtains the total size t of the TB set and the number m of second type TBs in the TB set based on scheduling information, and obtains the size of each first type TB through the above-mentioned average division method. Alternatively, the scheduling information can directly include information on the size of each first type TB.

[0192] For example, the first network element can also obtain the size of each first type TB based on an RRC message, which contains the number k of the first type TBs.

[0193] For example, the first network element can also obtain the size of each first type TB by looking up a table. For instance, there is a TB mapping table with a one-to-one correspondence between the number k of the first type TBs and the size of the first type TBs. The first network element can obtain the size of the first type TB by looking up the value of k in the table.

[0194] For example, when the sizes of the first type TBs are not equal, the first network element can pad the first type TBs with padding bits before packet encoding to make the sizes of the first type TBs equal.

[0195] Figure 15 A flowchart illustrating a communication method provided in an embodiment of this disclosure. Figure 15 As shown, the method includes the following steps:

[0196] Step 1501: Receive multiple TBs from a TB set of the first network element on a physical channel.

[0197] The TB set includes at least k TBs, and among the at least k TBs, k are of type 1. The k type TBs in the TB set correspond to a key data packet of the upper layer. The type TB is the TB that needs to be submitted to the upper layer, and k is an integer greater than 1.

[0198] In some embodiments, the k first-type TBs are of equal size.

[0199] In some embodiments, at least k TBs further include m second-type TBs, where the first-type TBs are the original TB packets without packet encoding, and the second-type TBs are TB check packets generated by packet encoding the k first-type TBs; the TB check packets are used to perform error recovery on the original TB packets, and m is a positive integer.

[0200] In some embodiments, each first type TB corresponds to one MAC PDU.

[0201] In some embodiments, the upper-layer critical data packet includes, but is not limited to, one of the following: a data packet corresponding to a PDU set, a video-encoded keyframe, a video-encoded frame, an AI model data file, a parameter file in an AI model, a software update package, a medical image data package, a GIS update file, a financial transaction sensitive information package, or an emergency communication critical information package. For example, an upper-layer critical data packet is an I-frame in an XR service. For example, an upper-layer critical data packet corresponds to an important file. For example, an upper-layer critical data packet corresponds to a complete AI model data set.

[0202] In one possible implementation, the second network element receives multiple TBs from a TB set of the first network element on a transmission unit.

[0203] The transmission unit includes at least one of the following: TTI, time slot, micro-time slot, and HARQ process.

[0204] In one example, the TB set identifier of the TB set corresponds to the identifier of an upper-layer critical data packet.

[0205] For example, multiple TBs in the received TB set are mapped to the same codeword.

[0206] For relevant descriptions, please refer to steps 601 and 602 above, which will not be repeated here.

[0207] Step 1502: Only if all k first-type TBs in the TB set are successfully obtained will the operation of submitting TBs to the upper layer be performed.

[0208] Among them, the TB submitted to the upper layer are k first-type TBs in the TB set.

[0209] It should be understood that for critical upper-layer data packets in a business application, if individual data points within the critical upper-layer data packet fail during physical layer transmission, the entire critical data packet will fail, directly leading to business failure (e.g., video interruption, AI model failure, etc.). Even if other successful Type 1 TBs in a TB set are submitted to the upper layer, the upper layer will not receive a complete critical upper-layer data packet. Therefore, each successfully transmitted Type 1 TB is not immediately submitted to the upper layer; instead, it needs to be buffered at the physical layer until all Type 1 TBs in a TB set have been successfully transmitted before the entire TB set is submitted.

[0210] In one possible implementation, the second network element submits k first-type TBs to the upper layer and then reassembles them into a single data packet.

[0211] This data packet corresponds to a key data packet at the upper layer.

[0212] Based on the above technical solution, the second network element receives multiple TBs from a TB set of the first network element on a physical channel. In related technologies, when channel conditions are poor and the amount of data to be transmitted is large, the transmission of the upper-layer critical data packet is unlikely to obtain sufficient scheduling opportunities, as this will consume a lot of transmission resources and affect the overall system performance. Furthermore, even after obtaining scheduling opportunities, the size of the TB that can be transmitted is small due to poor channel conditions. In particular, interference can cause the entire TB transmission to fail. These factors all lead to low transmission efficiency of a critical data packet at the physical layer, making it difficult to guarantee reliable transmission of a large amount of data with low latency, resulting in a poor service experience. This disclosure, by mapping an upper-layer critical data packet to a TB set at the physical layer, ensures that an upper-layer critical data packet can be successfully transmitted and delivered completely as quickly as possible during physical layer transmission. Mapping an upper-layer critical data packet to multiple smaller TBs within a TB set increases the scheduling opportunities for data transmission, and using TB set transmission facilitates the use of techniques that improve the TB transmission success rate, such as retransmitting only erroneous TBs or recovering erroneous TBs through packet encoding and decoding. Therefore, this disclosure can improve the integrity of a critical upper-layer data packet being successfully transmitted at the physical layer, enabling the physical layer data corresponding to a critical upper-layer data packet to be delivered to the upper layer as quickly and completely as possible, thereby improving the business experience.

[0213] In addition, the second network element can also perform corresponding channel decoding and packet encoding decoding operations.

[0214] In some embodiments, the second network element may perform at least one of the following operations:

[0215] The second network element selects the first type of TB from the plurality of TBs for channel decoding;

[0216] The second network element selects the second type of TB from the plurality of TBs for channel decoding;

[0217] The second network element first performs channel decoding on the first type TB among the multiple TBs; if k first type TBs are not successfully acquired, then it performs channel decoding on the second type TB among the multiple TBs.

[0218] As one possible embodiment of this disclosure, combined with Figure 15 The illustrated embodiments, such as Figure 16 As shown, the method further includes steps 1601-1604.

[0219] Step 1601: Perform channel decoding on the first type TB among the plurality of TBs.

[0220] Channel coding / decoding refers to the encoding / decoding of data within a terabyte (TB). For example, at the transmitting end, a 100-bit TB is channel-coded at a 1 / 3 code rate to form a 300-bit encoded packet, which is then sent to the modulation module. At the receiving end, channel decoding of the demodulated data recovers the 100-bit source bit information of the TB.

[0221] In some embodiments, the second network element may select a first type of TB from the plurality of TBs for channel decoding.

[0222] The second network element can determine which of the multiple TBs are of the first type and which are of the second type by using certain information. For example, the second network element can obtain the transmission location of the first type TB based on the TB mapping rules within the TB set. These TB mapping rules can be included in the scheduling information or be default rules. Another example is that the second network element can obtain the type of the received TB based on the implicit indication of each TB's index.

[0223] The second network element can first select the first type of TB for channel decoding. When all the first type TBs in the TB set are successfully acquired, it means that all the data in the TB set has been successfully acquired, and there is no need to perform channel decoding on the second type of TB, thereby improving decoding efficiency.

[0224] Step 1602: Determine whether k first-type TBs have been successfully obtained.

[0225] In some embodiments, the second network element may determine whether k first-type TBs have been successfully acquired by combining the previous transmission results after performing channel decoding on the first type TB among the plurality of TBs.

[0226] In one possible implementation, the second network element determines whether it has successfully acquired k first-type TBs from the TB set based on the reception of the multiple TBs.

[0227] If the number of transmissions of the TB set reaches the maximum number of transmissions, and the second network element fails to successfully acquire at least one TB of k first type TBs, the second network element determines to terminate the transmission of the TB set.

[0228] If the second network element successfully acquires k first-type TBs, the second network element determines to terminate the transmission of the TB set;

[0229] If the number of transmissions of the TB set has not reached the maximum number of transmissions, and the second network element has not successfully acquired at least one TB of k first type TBs, the second network element determines to retransmit the TB set.

[0230] The retransmission of the TB set involves selecting multiple TBs from the TB set for transmission.

[0231] In some embodiments, when it is determined that the transmission of the TB set is to be terminated, the second network element may perform at least one of the following: clear all caches of the TB set; reset all information of the TB set; or start the transmission of a new TB set, the new TB set corresponding to a new upper-layer key data packet.

[0232] A TB set corresponds to a critical upper-layer data packet. If any one of the k first-type TBs fails to transmit, the entire critical upper-layer data packet is considered to have failed to transmit successfully. If the maximum number of transmissions is reached without successfully acquiring all first-type TBs in the TB set, it means that the transmission of the TB set has failed, i.e., the acquisition of the critical upper-layer data packet has failed.

[0233] Step 1603: If at least one TB among the k first-type TBs fails to acquire and there are second-type TBs among the multiple TBs, perform channel decoding on the second-type TBs among the multiple TBs.

[0234] If k first-type TBs are successfully acquired, the second network element no longer needs to perform channel decoding on the second-type TBs among the multiple TBs, nor does it need to perform decoding corresponding to packet encoding.

[0235] Step 1604: If at least one TB among the k first-type TBs is not successfully acquired and there is a second-type TB among the multiple TBs that has been successfully decoded by the channel, perform the decoding operation corresponding to the packet encoding based on the TBs successfully acquired among the k first-type TBs and the second-type TBs that have been successfully decoded by the channel among the multiple TBs, so as to obtain the TBs that were not successfully acquired among the k first-type TBs.

[0236] Packet encoding / decoding refers to the encoding / decoding between multiple TB data packets. For example, at the sending end, four 100-bit Type 1 TBs are packet encoded to generate six 100-bit Type 2 TBs. At the receiving end, if not all four Type 1 TBs are successfully acquired, the failed Type 1 TBs are recovered by jointly decoding the received Type 2 TBs and all successfully acquired Type 1 TBs according to the packet encoding.

[0237] If a second type TB is successfully acquired and the second network element still has a first type TB that has not been successfully acquired, then the second network element can decode all the successfully acquired TBs using packet encoding.

[0238] For example, the second network element can perform packet decoding on all successfully acquired packet vectors (TBs) from previous and current transmissions based on the packet encoding vector index. The encoding vector index corresponds to an encoding matrix, and can also be a packet index or the TB's sequence number within a TB group.

[0239] In addition, the second network element can also send feedback information to the first network element.

[0240] As one possible embodiment of this disclosure, combined with Figure 15 The illustrated embodiments, such as Figure 17 As shown, the method further includes the following step 1701.

[0241] Step 1701: Send feedback information to the first network element.

[0242] The feedback information includes at least one of the following:

[0243] Feedback information used to characterize the successful transmission of a TB set, wherein the successful transmission of the TB set means that the second network element has successfully acquired k TBs of the first type;

[0244] Feedback information used to characterize the failure of a TB set transmission, wherein the failure of a TB set transmission means that the second network element fails to acquire at least one TB of k first type TBs;

[0245] The feedback information for each of the multiple TBs is used to characterize whether the second network element has successfully acquired the corresponding TB.

[0246] For relevant details, please refer to step 701 above; they will not be repeated here.

[0247] In some embodiments, the second network element may also obtain scheduling information for a set of TBs to facilitate scheduling of the TB set. For example, the second network element may perform at least one of the following: obtain scheduling information for the TB set; determine the number of TBs of the first type; determine the size of the TBs of the first type.

[0248] In this embodiment of the present disclosure, the acquisition of scheduling information by the second network element is combined with... Figure 15 The illustrated embodiments, such as Figure 18 As shown, the method further includes the following step 1801.

[0249] Step 1801: Obtain the scheduling information of a TB set.

[0250] The scheduling information of the TB set is used to schedule the TBs transmitted within the TB set. This scheduling information may include scheduling information corresponding to the TB set, or scheduling information corresponding to each TB in the TB set.

[0251] Scheduling information includes at least one of the following:

[0252] The TB set identifier corresponding to the TB set;

[0253] The location information of the transmission resources corresponding to the TB set;

[0254] The number of REs corresponding to the TB set;

[0255] The common MCS corresponding to the TB set is used to indicate that TBs in the TB set use the same MCS for transmission.

[0256] The number of common space multiplexing layers corresponding to the TB set is used to indicate that TBs in the TB set use the same number of space multiplexing layers for transmission;

[0257] The codeword index used for TB transmission in the TB set;

[0258] The TB mapping rules;

[0259] The transmission resource location information corresponding to each TB currently being transmitted in the TB set;

[0260] The number of REs corresponding to each TB currently being transmitted in the TB set;

[0261] The MCS used by each TB transmission in the currently transmitted TB in the TB set;

[0262] The number of spatial multiplexing layers used by each TB transmission in the currently transmitted TB in the TB set;

[0263] The packet encoding algorithm used in the TB set;

[0264] The calculation method for the first type of TB size;

[0265] Size of the first type TB;

[0266] The number of TBs of the first type in the TB set is k;

[0267] The number of second-type TBs in the TB set is m;

[0268] The TB set represents the number of TBs currently being transmitted;

[0269] The index of each TB currently being transmitted in the TB set;

[0270] The packet encoding vector index of each TB currently being transmitted in the TB set;

[0271] The type indication of each TB currently transmitted in the TB set is used to indicate whether it is a first type TB or a second type TB.

[0272] For related explanations, please refer to the description of step 1301 above, which will not be repeated here.

[0273] In some embodiments, scheduling information is obtained through at least one of the following: CSI, DCI, RRC messages, and MACCE.

[0274] For CSI, the second network element can determine scheduling information based on CSI. For DCI, the second network element can obtain scheduling information by receiving DCI, which includes a first-level DCI and / or a second-level DCI. The scheduling information corresponding to the TB set can be carried in the first-level DCI, and the scheduling information corresponding to the TB can be carried in the second-level DCI. For RRC messages, the second network element can obtain the scheduling information by receiving RRC messages, which may include the scheduling information. For MACCE, the second network element can obtain the scheduling information by receiving MAC CE, which may include the scheduling information.

[0275] In some embodiments, after obtaining the scheduling information, the second network element can also send the scheduling information to the first network element. Taking the second network element as a base station and the first network element as a terminal as an example, the base station obtains the scheduling information for the uplink TB set transmission through CSI and sends the scheduling information for the TB set to the terminal, enabling the terminal to send multiple TBs of data in the TB set based on the scheduling information.

[0276] In some embodiments, the second network element may also determine the size of the first type of TB in order to determine the resources allocated to the TBs in a set of TBs.

[0277] As one embodiment of this disclosure, combined with Figure 15 The illustrated embodiments, such as Figure 19 As shown, the method further includes the following step 1901.

[0278] Step 1901: Determine the size of the first type TB.

[0279] In some embodiments, the second network element can acquire second information and determine the size of the first type TB based on the second information.

[0280] The second information includes the number of REs corresponding to the TB set, the public MCS corresponding to the TB set, the number of public space reuse layers corresponding to the TB set, and the number of TBs of the first type in the TB set.

[0281] In one possible implementation, the second network element can determine the total size of the TB set based on the number of REs corresponding to the TB set, the common MCS corresponding to the TB set, and the number of common space multiplexing layers corresponding to the TB set (the total size of the TB set corresponds to the total number of TB bits that can be transmitted in the entire TB set, which can also be regarded as a virtual large TB). Then, the second network element determines the size of the first type TB based on the total size of the TB set and the number of first type TBs in the TB set.

[0282] In some embodiments, the total size of the TB set refers to the sum of the sizes of all first-type TBs in the TB set.

[0283] In some embodiments, the size of the first type TB satisfies the following formula:

[0284]

[0285] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs.

[0286] Alternatively, the size of the first type TB satisfies the following formula:

[0287]

[0288] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs; This represents the round-up operator.

[0289] For example, when all TBs within the TB set use the same MCS and the same number of spatial multiplexing layers, the second network element can determine the size of the first type of TB by dividing the total size of the TB set into equal parts. For instance, when the total size of the TB set is divisible by the number of first type TBs, it can be determined by... To calculate the size of the first type of TB, if the total size of the TB set cannot be divided by the number of first type TBs, the size of the first type TB can be calculated by rounding up the calculation result.

[0290] Here, the total size of a TB set refers to the TB size calculated using the corresponding transmission resources, MCS, and spatial multiplexing mapping layers, corresponding to a virtual large TB. Since directly sending large TB data can easily cause TB errors, this disclosure divides the TB set into multiple smaller TBs (i.e., first-type TBs) based on its total size, and transmits these multiple TBs as a single TB set. In other words, the virtual large TB is not a real TB; this is only for illustrative purposes.

[0291] In another possible implementation, the second network element can determine the number of REs allocated to each first-type TB based on the number of REs corresponding to the TB set and the number of first-type TBs in the TB set. Then, the second network element determines the size of the first-type TB based on the number of REs allocated to each first-type TB, the common MCS corresponding to the TB set, and the number of common space reuse layers corresponding to the TB set.

[0292] In some embodiments, the number of REs allocated to each first type TB satisfies the following formula:

[0293]

[0294] in, N represents the number of REs allocated to each first-type TB. RE This represents the number of REs corresponding to the TB set, and k represents the number of TBs of the first type.

[0295] Alternatively, the number of REs allocated to each Type I TB satisfies the following formula:

[0296]

[0297] in, N represents the number of REs allocated to each first-type TB. RE This represents the number of REs corresponding to the TB set, where k represents the number of TBs of the first type. This represents the floor operator.

[0298] In some embodiments, the number and / or size of the first type of TB is determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and TB mapping tables.

[0299] For example, the second network element can determine the size of each first-type TB in the TB set based on scheduling information. For instance, if the second network element receives four TBs (TB0, TB1, TB2, TB3) from a TB set on a TTI, it can calculate the size of each TB and the time-frequency domain position of each TB's data mapping based on the scheduling information. The TB data at the corresponding position is then extracted, decoded, and it is determined whether the received TB is a first-type TB or a second-type TB (e.g., TB0 and TB1 are TB system packets, TB2 and TB3 are TB redundancy packets).

[0300] For example, the size of each TB within a TB set can be equal. If equal division is not possible, bit padding can be used to make all TBs equal. The second network element can also obtain the size of each first-type TB based on pre-configured information on the second network element side. For example, the second network element locally configures the number k of first-type TBs, obtains the total size t of the TB set and the number m of second-type TBs in the TB set based on scheduling information, and obtains the size of each first-type TB through the aforementioned average division method. Alternatively, the scheduling information can directly include information about the size of each first-type TB.

[0301] For example, the second network element can also obtain the size of each first type TB based on an RRC message, which contains the number k of the first type TBs.

[0302] For example, the second network element can also obtain the size of each first type TB by looking up a table. For instance, there is a TB mapping table with a one-to-one correspondence between the number k of the first type TBs and the size of the first type TBs. The second network element can obtain the size of the first type TB by looking up the value of k in the table.

[0303] It should be understood that the communication methods provided in this disclosure can be applied to various business scenarios.

[0304] For example, in XR service scenarios, video data transmission is typically performed using video-coded frames (I-frames), predicted frames (P-frames), and bi-directional frames (B-frames). An I-frame is a complete image frame, while P-frames and B-frames are differentially predicted frames. If an I-frame is lost or corrupted, all P-frames or B-frames that depend on it will fail to decode correctly. I-frames are key frames for video coding; due to their large size, they can correspond to a single MAC PDU at the MAC layer. When a single MAC PDU cannot hold the entire I-frame data, the I-frame is split into multiple MAC PDUs and transmitted over multiple time intervals (TTIs). Typically, an I-frame corresponds to an independent PDU set. A P-frame or a B-frame may correspond to another independent PDU set, or it may form a PDU set with other frames besides I-frames. When an I-frame corresponds to a MAC PDU, a MAC PDU corresponds to a large TB size (TBS). If the TB has individual data errors (such as local interference) during physical layer transmission, the probability of the TB failing CRC check at the receiving end is high. In other words, even a small number of data errors at the physical layer can cause the entire I-frame to fail. In related technologies, when multiple I-frames correspond to a single MAC PDU, an error in the physical layer's TB (Transmission Block) of that MAC PDU will lead to multiple I-frame errors, and the physical layer cannot distinguish which I-frame's data is corrupted. Similarly, when an I-frame corresponds to a MAC PDU with other types of frames, a physical layer TB error in that MAC PDU can also cause the aforementioned I-frame failure, and the physical layer cannot distinguish whether the error is in the I-frame's data or in the data of other frames transmitted with it. Furthermore, when an I-frame corresponds to multiple MAC PDUs, the I-frame data needs to be transmitted across multiple time slots at the physical layer. If even one MAC PDU's TB is corrupted, the entire I-frame will fail, and the corrupted TB needs to be transmitted in the next cycle of the same HARQ process. The above situations also occur with P-frames and B-frames. It can be seen that these technologies reduce the data rate and increase transmission latency for XR video frames. Moreover, it should be noted that because I-frames are crucial, failure to acquire them in a timely manner will severely impact the user experience.

[0305] In summary, related technologies suffer from the problem of difficulty in achieving low-latency, high-throughput, and highly reliable transmission of critical data, resulting in a poor service experience. In this embodiment, the data of the entire I-frame is mapped into k first-type TBs (also called TB system packets, TB source packets, or TB raw packets) of a TB set within a time slot. These k first-type TBs are then packet-encoded to generate second-type TBs (also called TB check packets or TB redundancy packets) capable of recovering from erroneous TB system packets. Thus, since multiple TBs can be carried on a single TTI, this disclosure ensures the transmission of the entire I-frame in a shorter time and improves the reliability of the TB system packets through packet encoding and decoding, thereby improving the transmission efficiency of critical data and ultimately enhancing the service experience. In some embodiments, a P-frame or B-frame can also be mapped to a TB set for transmission, thereby increasing the data throughput and reliability of the P-frame or B-frame and further improving the service experience.

[0306] For example, in coverage-constrained scenarios, edge users face very poor channel conditions and limited scheduling opportunities, making it difficult to transmit large terabytes (TBs) even with ample bandwidth resources. This results in a poor user experience for edge users transmitting large data volume services such as XR. Using the technical solution provided in this disclosure, a large upper-layer critical data packet is divided into multiple smaller TBs (TB source packets), and transmitted over a single time interval (TTI) using a TB set approach. After all TB source packets in a TB set are successfully transmitted, the entire TB set is delivered, thus achieving the upward delivery of physical layer data for an upper-layer critical data packet. Furthermore, edge users can generate TB check packets (TB redundancy packets) by packet encoding these smaller TBs. These TB check packets are used to recover the TB source packets when transmission errors occur. Further, edge users select the TBs to be transmitted from the TB set each time based on real-time information (such as channel status, available frequency resources, UE capabilities, etc.) to match the wireless environment and better utilize bandwidth resources. For example, the number of TBs selected for transmission varies depending on the available bandwidth resources during each TB set transmission. For example, a certain number of TB check packets can be sent during TB set retransmission to recover TB source packets that have been transmitted incorrectly. Alternatively, the scheduling opportunities for TB sets can be increased by controlling the TB size (e.g., using smaller TBs). For example, data transmission throughput can be improved by utilizing different MCSs for transmitted TBs within the TB set to fully leverage frequency selectivity. For example, the success rate of TB transmissions within the TB set can be increased by dynamically adjusting the MCS and the number of TBs transmitted for each transmission. The technical solutions provided in this disclosure can fully utilize transmission resources, increase the chances of edge users being scheduled for transmission and the data transmission success rate, improve transmission efficiency, and enhance the service experience for edge users.

[0307] The technical solutions provided in this disclosure can also be applied to various scenarios with high requirements for data throughput and / or integrity.

[0308] For example, in telemedicine diagnosis, remote medical image transmission is required. When transmitting high-resolution medical images, the loss or damage of any single pixel can lead to diagnostic errors. Using a TB (Through-Based) collection transmission and overall delivery scheme can ensure the complete recovery of image data. In particular, TB collection transmission uses TB checksum packets to recover the TB source packets, enhancing error recovery capabilities and increasing the probability of complete image data recovery. For example, in AI scenarios, a complete AI model file parameter transmission is required. The amount of AI data to be transmitted is very large; even a small number of data errors during transmission can lead to inaccurate or even invalid models. Therefore, the model parameter file can be considered a critical data packet that needs to be transmitted promptly and completely. For example, for large software update packages, it is necessary to ensure a one-time complete transmission to avoid multiple downloads. For example, in industrial automation control, there are extremely high requirements for the reliability and latency of command data. For example, in vehicle-to-everything (V2X) systems, timely, complete, and accurate transmission of high-precision map data is required. For example, in the financial sector, there are sensitive data packets, requiring the timely and complete transmission of highly secure and immediate financial transaction data packets. For example, in natural disasters or emergency rescue scenarios, critical instructions and information must be transmitted, ensuring that emergency communication data is delivered immediately and without errors. Based on the TB set overall delivery mechanism and retransmission enhancement measures in the technical solution provided in this disclosure, data transmission guarantee can be provided in business scenarios in different fields.

[0309] It is understood that, in order to achieve the above-mentioned functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments of this disclosure, this disclosure can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0310] This disclosure embodiment can divide the communication device into functional modules according to the above method embodiment. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one functional module. The integrated module can be implemented in hardware or software. It should be noted that the module division in this disclosure embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the example of dividing each functional module according to each function.

[0311] For example, taking a communication device as the first network element in the above method embodiment as an example, Figure 20 This is a structural diagram of a first network element 200 provided in an embodiment of this disclosure. The first network element 200 can execute the communication method provided in the above-described method embodiment. Figure 20 As shown, the first network element 200 includes a processing unit 2001 and a communication unit 2002.

[0312] Processing unit 2001 is used to map an upper-layer key data packet to k first-type TBs in a transport block TB set; the TB set includes at least k TBs and at least k TBs contain k first-type TBs, the data of the first-type TBs comes from the upper layer, and k is an integer greater than 1;

[0313] The communication unit 2002 is used to map multiple TBs of the TB set onto a physical channel and send multiple TBs of the TB set to the second network element.

[0314] In some embodiments, the k first-type TBs are of equal size.

[0315] In some embodiments, at least k TBs further include m second-type TBs, where the first-type TBs are the original TB packets without packet encoding, and the second-type TBs are TB check packets generated by packet encoding the k first-type TBs; the TB check packets are used to perform error recovery on the original TB packets, and m is a positive integer.

[0316] In some embodiments, the processing unit 2001 is used to segment the upper-layer key data packet to obtain k Media Access Control (MAC) Protocol Data Units (PDUs); wherein, the k MAC PDUs correspond to k first-type TBs, and one MAC PDU corresponds to one first-type TB.

[0317] In some embodiments, the processing unit 2001 is configured to determine the size of each MAC PDU based on first information; the first information includes at least one of the following: channel quality indication, channel state information, available transmission resources, terminal capabilities, scheduling request, service requirements, service type, scenario information, the number k of the first type of TB, scheduling information, and the physical layer transmittable TB size; the processing unit 2001 is configured to segment the upper-layer key data packet according to the size of each MAC PDU to obtain k MAC PDUs.

[0318] In some embodiments, the communication unit 2002 is configured to receive feedback information from a second network element, the feedback information including at least one of the following: feedback information indicating successful transmission of a TB set, wherein successful transmission of the TB set means that the second network element has successfully acquired k first-type TBs; feedback information indicating failed transmission of a TB set, wherein failed transmission of the TB set means that the second network element has not successfully acquired at least one TB of the k first-type TBs; and feedback information for each of the multiple TBs, wherein the feedback information for each TB is used to indicate whether the second network element has successfully acquired the corresponding TB.

[0319] In some embodiments, the processing unit 2001 is configured to: upon receiving feedback information indicating successful transmission of a TB set; upon receiving feedback information indicating failed transmission of a TB set and the number of transmissions of the TB set has reached the maximum number of transmissions; and upon receiving feedback information indicating failed transmission of the TB set and the number of transmissions of the TB set has not reached the maximum number of transmissions, determine to retransmit the TB set.

[0320] In some embodiments, the processing unit 2001 is configured to perform at least one of the following: clear all caches of the TB set; reset all information of the TB set; and start transmission of a new TB set, the new TB set corresponding to a new upper-layer key data packet.

[0321] In some embodiments, the processing unit 2001 is configured to perform at least one of the following: obtaining scheduling information of the TB set, wherein the scheduling information of the TB set is used to schedule the transmission of the TB set; determining the number of first type TBs; determining the size of the first type TBs; determining the number of TBs currently being transmitted by the TB set; determining the number of first type TBs currently being transmitted by the TB set; determining the number of second type TBs currently being transmitted by the TB set, wherein the second type TBs are TB check packets obtained after using packet encoding of k first type TBs, and the TB check packets are used for error recovery of the first type TBs; determining the transmission resource space used by the TB set for the current transmission, wherein the transmission resource space is the transmission resource available when the TB set is transmitted; and determining the transmission resource used by each TB currently being transmitted by the TB set.

[0322] In some embodiments, the scheduling information includes at least one of the following:

[0323] The TB set identifier corresponding to the TB set;

[0324] The location information of the transmission resources corresponding to the TB set;

[0325] The number of resource elements (REs) corresponding to the TB set;

[0326] The common modulation and coding scheme (MCS) corresponding to the TB set is used to indicate that TBs in the TB set use the same MCS for transmission.

[0327] The number of common space multiplexing layers corresponding to the TB set is used to indicate that TBs in the TB set use the same number of space multiplexing layers for transmission;

[0328] The codeword index used for TB transmission in the TB set;

[0329] The TB mapping rules;

[0330] The transmission resource location information corresponding to each TB currently being transmitted in the TB set;

[0331] The number of REs corresponding to each TB currently being transmitted in the TB set;

[0332] The MCS used by each TB transmission in the currently transmitted TB in the TB set;

[0333] The number of spatial multiplexing layers used by each TB transmission in the currently transmitted TB in the TB set;

[0334] The packet encoding algorithm used in the TB set;

[0335] The calculation method for the first type of TB size;

[0336] Size of the first type TB;

[0337] The number of TBs of the first type in the TB set is k;

[0338] The number of second-type TBs in the TB set is m;

[0339] The TB set represents the number of TBs currently being transmitted;

[0340] The index of each TB currently being transmitted in the TB set;

[0341] The packet encoding vector index of each TB currently being transmitted in the TB set;

[0342] The type indication of each TB currently transmitted in the TB set is used to indicate a first type TB or a second type TB;

[0343] Among them, the first type TB is the original TB packet without packet encoding, and the second type TB is the TB check packet generated by packet encoding k first type TB packets; the TB check packet is used to recover from errors in the original TB packet.

[0344] In some embodiments, scheduling information is obtained through at least one of the following: Channel State Information (CSI), Downlink Control Information (DCI), Radio Resource Control (RRC) message, and Media Access Control (MAC) CE.

[0345] In some embodiments, k TBs sent to the second network element correspond to the same codeword.

[0346] In some embodiments, the processing unit 2001 is used to obtain second information; the second information includes the number of REs corresponding to the TB set, the public MCS corresponding to the TB set, the number of public space reuse layers corresponding to the TB set, and the number of first type TBs in the TB set; and determines the size of the first type TB based on the second information.

[0347] In some embodiments, the processing unit 2001 is configured to determine the total size of the TB set based on the number of REs corresponding to the TB set, the common MCS corresponding to the TB set, and the number of common space reuse layers corresponding to the TB set; determine the size of a first type TB based on the total size of the TB set and the number of first type TBs in the TB set; or, determine the number of REs allocated to each first type TB based on the number of REs corresponding to the TB set and the number of first type TBs in the TB set; and determine the size of the first type TB based on the number of REs allocated to each first type TB, the common MCS corresponding to the TB set, and the number of common space reuse layers corresponding to the TB set.

[0348] In some embodiments, the size of the first type TB satisfies the following formula:

[0349]

[0350] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs.

[0351] Alternatively, the size of the first type TB satisfies the following formula:

[0352]

[0353] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs; This represents the round-up operator.

[0354] Alternatively, the number of REs allocated to each Type I TB satisfies the following formula:

[0355]

[0356] in, N represents the number of REs allocated to each first-type TB. RE The number of REs corresponding to the TB set is represented by k, and k represents the number of TBs of the first type.

[0357] Alternatively, the number of REs allocated to each Type I TB satisfies the following formula:

[0358]

[0359] in, N represents the number of REs allocated to each first-type TB. RE The number of REs corresponding to the TB set is represented by k, where k represents the number of TBs of the first type. This represents the floor operator.

[0360] In some embodiments, the number and / or size of the first type of TB is determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and TB mapping tables.

[0361] In some embodiments, the communication unit 2002 is used to send multiple TBs of the TB set to the second network element over a transmission unit; the transmission unit includes at least one of the following: transmission time interval (TTI), time slot, micro-time slot, hybrid automatic repeat request (HARQ) process.

[0362] In some embodiments, the upper-layer key data packets include, but are not limited to, one of the following: data packets corresponding to a PDU set, video encoding keyframes, video encoding frames, artificial intelligence (AI) model data files, parameter files in AI models, software update packages, medical image data packages, geographic information system (GIS) update files, financial transaction sensitive information packages, and emergency communication key information packages.

[0363] For example, taking a communication device as the second network element in the above method embodiment as an example, Figure 21 This is a structural diagram of a second network element 210 provided in an embodiment of this disclosure. The second network element 210 can execute the communication method provided in the above-described method embodiment. Figure 21 As shown, the second network element 210 includes a processing unit 2101 and a communication unit 2102.

[0364] The communication unit 2102 is used to receive multiple TBs from a transport block TB set from a first network element on a physical channel; the TB set includes at least k TBs and at least k TBs include k first type TBs, the k first type TBs of the TB set correspond to an upper-layer key data packet, the first type TBs are TBs that need to be submitted to the upper layer, and k is an integer greater than 1.

[0365] The processing unit 2101 is used to perform the operation of submitting TBs to the upper layer only when all k first-type TBs of the TB set are successfully acquired. The TBs submitted to the upper layer are the k first-type TBs of the TB set.

[0366] In some embodiments, the k first-type TBs are of equal size.

[0367] In some embodiments, at least k TBs further include m second-type TBs, where the first-type TBs are the original TB packets without packet encoding, and the second-type TBs are TB check packets generated by packet encoding the k first-type TBs; the TB check packets are used to perform error recovery on the original TB packets, and m is a positive integer.

[0368] In some embodiments, each first type TB corresponds to one Media Access Control (MAC) Protocol Data Unit (PDU).

[0369] In some embodiments, the processing unit 2101 is used to submit k first-type TBs to the upper layer and then reassemble them into a data packet; the data packet corresponds to the upper-layer key data packet.

[0370] In some embodiments, the communication unit 2102 is configured to send feedback information to the first network element. The feedback information includes at least one of the following: feedback information indicating successful transmission of a TB set, wherein successful transmission of the TB set means that the second network element has successfully acquired k TBs of the first type; feedback information indicating failed transmission of the TB set, wherein failed transmission of the TB set means that the second network element has not successfully acquired at least one TB of the k TBs of the first type; and feedback information for each of the multiple TBs, wherein the feedback information for each TB is used to indicate whether the second network element has successfully acquired the corresponding TB.

[0371] In some embodiments, processing unit 2101 is used to decode the channel of a first type TB among a plurality of TBs; processing unit 2101 is used to determine whether k first type TBs have been successfully acquired; processing unit 2101 is used to perform channel decoding on the second type TBs among the plurality of TBs when at least one TB among the k first type TBs has not been successfully acquired and there are second type TBs among the plurality of TBs; processing unit 2101 is used to obtain the TBs that have not been successfully acquired among the k first type TBs when at least one TB among the k first type TBs has not been successfully acquired and there are second type TBs among the plurality of TBs that have been successfully channel decoded, based on the decoding operation corresponding to the packet encoding of the successfully acquired TBs among the k first type TBs and the second type TBs that have been successfully channel decoded among the plurality of TBs; wherein, the first type TB is the original TB packet without packet encoding processing, and the second type TB is the TB check packet generated by packet encoding processing of the k first type TBs; the TB check packet is used for error recovery of the original TB packet.

[0372] In some embodiments, the processing unit 2101 is configured to perform at least one of the following: obtaining scheduling information of the TB set; the scheduling information of the TB set is used to schedule TBs transmitted in the TB set; determining the number of TBs of the first type; and determining the size of the TBs of the first type.

[0373] In some embodiments, the scheduling information includes at least one of the following:

[0374] The TB set identifier corresponding to the TB set;

[0375] The location information of the transmission resources corresponding to the TB set;

[0376] The number of resource elements (REs) corresponding to the TB set;

[0377] The common modulation and coding scheme (MCS) corresponding to the TB set is used to indicate that TBs in the TB set use the same MCS for transmission.

[0378] The number of common space multiplexing layers corresponding to the TB set is used to indicate that TBs in the TB set use the same number of space multiplexing layers for transmission;

[0379] The codeword index used for TB transmission in the TB set;

[0380] The TB mapping rules;

[0381] The transmission resource location information corresponding to each TB currently being transmitted in the TB set;

[0382] The number of REs corresponding to each TB currently being transmitted in the TB set;

[0383] The MCS used by each TB transmission in the currently transmitted TB in the TB set;

[0384] The number of spatial multiplexing layers used by each TB transmission in the currently transmitted TB in the TB set;

[0385] The packet encoding algorithm used in the TB set;

[0386] The calculation method for the first type of TB size;

[0387] Size of the first type TB;

[0388] The number of TBs of the first type in the TB set is k;

[0389] The number of second-type TBs in the TB set is m;

[0390] The TB set represents the number of TBs currently being transmitted;

[0391] The index of each TB currently being transmitted in the TB set;

[0392] The packet encoding vector index of each TB currently being transmitted in the TB set;

[0393] The type indication of each TB currently transmitted in the TB set is used to indicate a first type TB or a second type TB;

[0394] Among them, the first type TB is the original TB packet without packet encoding, and the second type TB is the TB check packet generated by packet encoding k first type TB packets; the TB check packet is used to recover from errors in the original TB packet.

[0395] In some embodiments, scheduling information is obtained through at least one of the following: Channel State Information (CSI), Downlink Control Information (DCI), Radio Resource Control (RRC) message, and Media Access Control (MAC) CE.

[0396] In some embodiments, the received k TBs correspond to the same codeword.

[0397] In some embodiments, the processing unit 2101 is used to obtain second information; the second information includes the number of REs corresponding to the TB set, the common MCS corresponding to the TB set, the number of common space reuse layers corresponding to the TB set, and the number of first type TBs in the TB set; and determines the size of the first type TB based on the second information.

[0398] In some embodiments, the processing unit 2101 is configured to determine the total size of the TB set based on the number of REs corresponding to the TB set, the common MCS corresponding to the TB set, and the number of common space reuse layers corresponding to the TB set; determine the size of the first type TB based on the total size of the TB set and the number of first type TBs in the TB set; or, determine the number of REs allocated to each first type TB based on the number of REs corresponding to the TB set and the number of first type TBs in the TB set; and determine the size of the first type TB based on the number of REs allocated to each first type TB, the common MCS corresponding to the TB set, and the number of common space reuse layers corresponding to the TB set.

[0399] In some embodiments, the total size of the TB set refers to the sum of the sizes of all first-type TBs in the TB set.

[0400] In some embodiments, the size of the first type TB satisfies the following formula:

[0401]

[0402] Among them, t TBLet t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs.

[0403] Alternatively, the size of the first type TB satisfies the following formula:

[0404]

[0405] Among them, t TB Let t represent the size of the first type TB, t represent the total size of the TB set, and k represent the number of first type TBs; This represents the round-up operator.

[0406] Alternatively, the number of REs allocated to each Type I TB satisfies the following formula:

[0407]

[0408] in, N represents the number of REs allocated to each first-type TB. RE This represents the number of REs corresponding to the TB set, and k represents the number of TBs of the first type.

[0409] Alternatively, the number of REs allocated to each Type I TB satisfies the following formula:

[0410]

[0411] in, N represents the number of REs allocated to each first-type TB. RE The number of REs corresponding to the TB set is represented by k, where k represents the number of TBs of the first type. This represents the floor operator.

[0412] In some embodiments, the number and / or size of the first type of TB is determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and TB mapping tables.

[0413] In some embodiments, the communication unit 2102 is configured to receive multiple TBs of the TB set from the first network element on a transmission unit; the transmission unit includes at least one of the following: transmission time interval (TTI), time slot, micro-time slot, hybrid automatic repeat request (HARQ) process.

[0414] In some embodiments, the upper-layer key data packets include, but are not limited to, one of the following: data packets corresponding to a PDU set, video encoding keyframes, video encoding frames, artificial intelligence (AI) model data files, parameter files in AI models, software update packages, medical image data packages, geographic information system (GIS) update files, financial transaction sensitive information packages, and emergency communication key information packages.

[0415] In implementing the functionality of the integrated modules described above using hardware, this disclosure provides another possible structure for the communication device involved in the above embodiments. For example... Figure 22 As shown, the communication device 220 includes a processor 2202 and a bus 2204. Optionally, the communication device 220 may also include a memory 2201; alternatively, the communication device 220 may also include a communication interface 2203.

[0416] Processor 2202 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 2202 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 2202 may also be a combination of functions implementing computation, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0417] The communication interface 2203 is used to connect to other devices via a communication network. This communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0418] The memory 2201 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), disk storage medium or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto.

[0419] As one possible implementation, the memory 2201 can exist independently of the processor 2202. The memory 2201 can be connected to the processor 2202 via a bus 2204 and is used to store instructions or program code. When the processor 2202 calls and executes the instructions or program code stored in the memory 2201, it can implement the method described in any embodiment of this disclosure.

[0420] In another possible implementation, the memory 2201 can also be integrated with the processor 2202.

[0421] The 2204 bus can be an extended industry standard architecture (EISA) bus, etc. The 2204 bus can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 22 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0422] Some embodiments of this disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium) storing computer program instructions that, when executed on a computer, cause the computer to perform the methods described in any of the above embodiments.

[0423] For example, the computer-readable storage media described above may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memory (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in this disclosure may represent one or more devices for storing information and / or other machine-readable storage media. The term "machine-readable storage media" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0424] This disclosure provides a computer program product containing instructions that, when run on a computer, cause the computer to perform the methods described in any of the above embodiments.

[0425] The above description is merely a specific embodiment of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. A communication method, characterized in that, Applied to the first network element, the method includes: A key data packet from an upper layer is mapped to k first-type TBs in a transport block (TB) set; the TB set includes at least k TBs and k of the at least k TBs are first-type TBs, the data of the first-type TBs comes from the upper layer, and k is an integer greater than 1; The multiple TBs of the TB set are mapped onto a physical channel, and the multiple TBs of the TB set are sent to the second network element.

2. The method according to claim 1, characterized in that, The k first-type TBs are of equal size.

3. The method according to claim 1, characterized in that, The at least k TBs also include m second-type TBs, where the first-type TBs are raw TB packets without packet encoding, and the second-type TBs are TB check packets generated by packet encoding of the k first-type TBs. The TB verification packet is used to perform error recovery on the original TB packet, where m is a positive integer.

4. The method according to claim 1, characterized in that, The step of mapping an upper-layer key data packet to k first-type TBs in a transport block TB set includes: The upper-layer key data packet is segmented to obtain k Media Access Control (MAC) Protocol Data Units (PDUs); wherein the k MAC PDUs correspond to the k first-type Data Units (TBs), and one MAC PDU corresponds to one first-type TB.

5. The method according to claim 4, characterized in that, The step of segmenting the upper-layer key data packet to obtain k Media Access Control (MAC) Protocol Data Units (PDUs) includes: The size of each MAC PDU is determined based on the first information; the first information includes at least one of the following: channel quality indication, channel state information, available transmission resources, terminal capabilities, scheduling request, service requirements, service type, scenario information, the number k of the first type of TB, scheduling information, and the TB size that the physical layer can transmit. The upper-layer critical data packet is segmented according to the size of each MAC PDU to obtain k MAC PDUs.

6. The method according to claim 1, characterized in that, The method further includes: Receive feedback information from the second network element, the feedback information including at least one of the following: Feedback information used to characterize the successful transmission of the TB set, wherein the successful transmission of the TB set means that the second network element has successfully acquired the k first type TBs; Feedback information used to characterize the failure of the transmission of a TB set, wherein the failure of the TB set transmission means that the second network element failed to successfully acquire at least one TB of the k first type TBs; The feedback information for each of the multiple TBs is used to characterize whether the second network element has successfully acquired the corresponding TB.

7. The method according to claim 6, characterized in that, The method also includes one of the following: Upon receiving feedback information indicating successful transmission of the TB set, it is determined to terminate the transmission of the TB set. If feedback information indicating a failure in the transmission of the TB set is received, and the maximum number of transmissions for the TB set has been reached, it is determined to terminate the transmission of the TB set. If feedback information indicating a transmission failure of the TB set is received, and the number of transmissions of the TB set has not reached the maximum number of transmissions, it is determined to retransmit the TB set.

8. The method according to claim 7, characterized in that, If it is determined that the transmission of the TB set is to be terminated, the method further includes at least one of the following: Clear all caches of the TB collection; Reset all information in the TB set; Transmission begins on a new TB set, which corresponds to a new upper-layer key data packet.

9. The method according to claim 1, characterized in that, The method further includes at least one of the following: Obtain the scheduling information of the TB set, wherein the scheduling information of the TB set is used to schedule the transmission of the TB set; Determine the number of TBs of the first type; Determine the size of the first type TB; Determine the number of TBs currently being transmitted in the TB set; Determine the number of first-type TBs currently being transmitted in the TB set; Determine the number of second-type TBs currently being transmitted in the TB set. The second-type TB is a TB check packet obtained after packet encoding of k first-type TBs. The TB check packet is used for error recovery of the first-type TBs. Determine the transmission resource space currently used for transmission of the TB set, where the transmission resource space is the transmission resource available when the TB set is transmitted; Determine the transmission resources used by each TB currently being transmitted in the TB set.

10. The method according to claim 9, characterized in that, The scheduling information includes at least one of the following: The TB set identifier corresponding to the TB set; The location information of the transmission resources corresponding to the TB set; The number of resource elements (REs) corresponding to the TB set; The common modulation and coding scheme (MCS) corresponding to the TB set is used to indicate that the TBs in the TB set use the same MCS for transmission. The number of common space multiplexing layers corresponding to the TB set, the number of common space multiplexing layers is used to indicate that TBs in the TB set use the same number of space multiplexing layers for transmission; The codeword index used for TB transmission in the TB set; TB mapping rules; The transmission resource location information corresponding to each TB currently being transmitted in the TB set; The number of REs corresponding to each TB currently being transmitted in the TB set; The MCS used by each TB transmission in the currently transmitted TB in the TB set; The number of spatial multiplexing layers used by each TB transmission in the currently transmitted TB in the TB set; The packet encoding algorithm used in the TB set; The calculation method for the first type of TB size; The size of the first type TB; The number of TBs of the first type in the TB set is k; The number of second-type TBs in the TB set is m; The TB set represents the number of TBs currently being transmitted; The index of each TB currently being transmitted in the TB set; The packet encoding vector index of each TB currently being transmitted in the TB set; The type indication of each TB currently transmitted in the TB set, the type indication being used to indicate a first type TB or a second type TB; Wherein, the first type TB is the original TB packet without packet encoding, and the second type TB is the TB check packet generated by packet encoding of the k first type TBs; The TB verification package is used for error recovery of the original TB package.

11. The method according to claim 9, characterized in that, The scheduling information is obtained through at least one of the following: Channel State Information (CSI), Downlink Control Information (DCI), Radio Resource Control (RRC) messages, and Media Access Control (MAC) CE messages.

12. The method according to claim 1, characterized in that, The number and / or size of the first type of TB is determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and TB mapping tables.

13. The method according to claim 1, characterized in that, Sending multiple TBs of the TB set to the second network element includes: Multiple TBs of the TB set are sent to the second network element on a transmission unit; the transmission unit includes at least one of the following: transmission time interval (TTI), time slot, micro-time slot, hybrid automatic repeat request (HARQ) process.

14. The method according to claim 1, characterized in that, The upper-layer key data packets include, but are not limited to, one of the following: data packets corresponding to a PDU set, video encoding keyframes, video encoding frames, artificial intelligence (AI) model data files, parameter files in AI models, software update packages, medical image data packages, geographic information system (GIS) update files, financial transaction sensitive information packages, and emergency communication key information packages.

15. A communication method, characterized in that, Applied to a second network element, the method includes: Multiple transport blocks (TBs) from a transport block (TB) set are received on a physical channel from a first network element; the TB set includes at least k TBs and k of the at least k TBs are of type 1, the k type TBs of the TB set correspond to an upper-layer key data packet, the type TBs are TBs that need to be submitted to the upper layer, and k is an integer greater than 1; The operation of submitting TBs to the upper layer is only performed if all k first-type TBs of the TB set are successfully obtained. The TBs submitted to the upper layer are the k first-type TBs of the TB set.

16. The method according to claim 15, characterized in that, The k first-type TBs are of equal size.

17. The method according to claim 15, characterized in that, The at least k TBs also include m second-type TBs, where the first-type TBs are raw TB packets without packet encoding, and the second-type TBs are TB check packets generated by packet encoding of the k first-type TBs. The TB verification packet is used to perform error recovery on the original TB packet, where m is a positive integer.

18. The method according to claim 15, characterized in that, Each Type I TB corresponds to one Media Access Control (MAC) Protocol Data Unit (PDU).

19. The method according to claim 15, characterized in that, The operation of submitting TB to the upper layer includes: The k first-type TBs are submitted to the upper layer and then reassembled into a single data packet; the data packet corresponds to the upper-layer key data packet.

20. The method according to claim 15, characterized in that, The method further includes: Send feedback information to the first network element, the feedback information including at least one of the following: Feedback information used to characterize the successful transmission of the TB set, wherein the successful transmission of the TB set means that the second network element has successfully acquired the k first type TBs; Feedback information used to characterize the failure of the transmission of a TB set, wherein the failure of the TB set transmission means that the second network element failed to successfully acquire at least one TB of the k first type TBs; The feedback information for each of the multiple TBs is used to characterize whether the second network element has successfully acquired the corresponding TB.

21. The method according to claim 15, characterized in that, The method further includes: Decoding the first type of TB channel among the plurality of TBs; Determine whether the k first-type TBs have been successfully acquired; If at least one TB among the k first-type TBs fails to be acquired and there is a second-type TB among the plurality of TBs, channel decoding is performed on the second-type TB among the plurality of TBs; If at least one TB among the k first-type TBs fails to be acquired and a second-type TB with successful channel decoding exists among the plurality of TBs, the TBs that failed to be acquired among the k first-type TBs are acquired based on the decoding operation corresponding to the packet encoding of the successfully acquired TB among the k first-type TBs and the second-type TB with successful channel decoding among the plurality of TBs. Wherein, the first type TB is the original TB packet without packet encoding, and the second type TB is the TB check packet generated by packet encoding the k first type TBs; the TB check packet is used to recover from errors in the original TB packet.

22. The method according to claim 15, characterized in that, The method further includes at least one of the following: Obtain the scheduling information of the TB set; the scheduling information of the TB set is used to schedule the TBs transmitted in the TB set; Determine the number of TBs of the first type; Determine the size of the first type TB.

23. The method according to claim 22, characterized in that, The scheduling information includes at least one of the following: The TB set identifier corresponding to the TB set; The location information of the transmission resources corresponding to the TB set; The number of resource elements (REs) corresponding to the TB set; The common modulation and coding scheme (MCS) corresponding to the TB set is used to indicate that the TBs in the TB set use the same MCS for transmission. The number of common space multiplexing layers corresponding to the TB set, the number of common space multiplexing layers is used to indicate that TBs in the TB set use the same number of space multiplexing layers for transmission; The codeword index used for TB transmission in the TB set; TB mapping rules; The transmission resource location information corresponding to each TB currently being transmitted in the TB set; The number of REs corresponding to each TB currently being transmitted in the TB set; The MCS used by each TB transmission in the currently transmitted TB in the TB set; The number of spatial multiplexing layers used by each TB transmission in the currently transmitted TB in the TB set; The packet encoding algorithm used in the TB set; The calculation method for the first type of TB size; The size of the first type TB; The number of TBs of the first type in the TB set is k; The number of second-type TBs in the TB set is m; The TB set represents the number of TBs currently being transmitted; The index of each TB currently being transmitted in the TB set; The packet encoding vector index of each TB currently being transmitted in the TB set; The type indication of each TB currently transmitted in the TB set, the type indication being used to indicate a first type TB or a second type TB; Wherein, the first type TB is the original TB packet without packet encoding, and the second type TB is the TB check packet generated by packet encoding of the k first type TBs; The TB verification package is used for error recovery of the original TB package.

24. The method according to claim 22, characterized in that, The scheduling information is obtained through at least one of the following: Channel State Information (CSI), Downlink Control Information (DCI), Radio Resource Control (RRC) messages, and Media Access Control (MAC) CE messages.

25. The method according to claim 15, characterized in that, The number and / or size of the first type of TB is determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and TB mapping tables.

26. The method according to claim 15, characterized in that, Receiving multiple TBs from a transport block TB set of a first network element on a physical channel includes: Multiple TBs from the TB set received from the first network element are received on a transmission unit; the transmission unit includes at least one of the following: Transmission Time Interval (TTI), time slot, micro-time slot, Hybrid Automatic Repeat Request (HARQ) process.

27. The method according to claim 15, characterized in that, The upper-layer key data packets include, but are not limited to, one of the following: data packets corresponding to a PDU set, video encoding keyframes, video encoding frames, artificial intelligence (AI) model data files, parameter files in AI models, software update packages, medical image data packages, geographic information system (GIS) update files, financial transaction sensitive information packages, and emergency communication key information packages.

28. A communication device, characterized in that, include: Memory and processor; Memory and processor are coupled; The memory is used to store instructions that can be executed by the processor; When the processor executes the instructions, it performs the method as described in any one of claims 1 to 14, or the method as described in any one of claims 15 to 27.

29. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 14, or the method as described in any one of claims 15 to 27.

30. A computer program product, characterized in that, The computer program product includes computer program instructions that, when executed by a processor, implement the method as described in any one of claims 1 to 14, or perform the method as described in any one of claims 15 to 27.

Images