Communication method and apparatus, and storage medium and program product

Abstract

Provided in the present disclosure are a communication method and apparatus, and a storage medium and a program product. The communication method comprises: enabling an upper-layer critical data packet to correspond to k first-type transport blocks (TBs) of a TB set, wherein the TB set comprises at least k TBs, there are k first-type TBs among the at least k TBs, data of the first-type TBs comes from an upper layer, and k is an integer greater than 1; and mapping a plurality of TBs of the TB set onto a physical channel, and sending the plurality of TBs of the TB set to a second network element.

Description

Communication method and apparatus, storage medium, and program product

[0001] This application claims priority to Chinese Patent Application No. 202411371348.1, filed on September 29, 2024, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0002] The present disclosure relates to the technical field of communication, and in particular, to a communication method and apparatus, a storage medium, and a program product. BACKGROUND

[0003] With the improvement of communication technology and the continuous enrichment of business types, related businesses have higher requirements for the performance of communication. For example, holographic communication, extended reality (XR) and other businesses require that the communication performance can simultaneously meet the reliable transmission of ultra-high throughput and ultra-low latency. SUMMARY

[0004] In one aspect, a communication method is provided, which is performed by a first network element. The communication method includes: corresponding an upper layer key data packet to k first type transport blocks (TBs) of a TB set, the TB set including at least k TBs and having the k first type TBs in the at least k TBs, data of the first type TBs coming from the upper layer, and k being an integer greater than 1; mapping a 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.

[0005] In another aspect, another communication method is provided, which is performed by a second network element. The communication method includes: receiving a plurality of transport blocks (TBs) of a TB set from a first network element on a physical channel, the TB set including at least k TBs and having the k first type TBs in the at least k TBs, the k first type TBs of the TB set corresponding to an upper layer key data packet, the first type TB being a TB that needs to be submitted to the upper layer, and k being an integer greater than 1; in a case where the k first type TBs of the TB set are all successfully acquired, performing an operation of submitting the TBs to the upper layer, the TBs submitted to the upper layer being the k first type TBs of the TB set.

[0006] In yet another aspect, a communication apparatus is provided. The communication apparatus includes: a processing unit and a communication unit. The processing unit is configured to: correspond an upper layer key data packet to k first type transport blocks (TBs) of a TB set. The TB set includes at least k TBs and has the k first type TBs in the at least k TBs, data of the first type TBs coming from the upper layer, and k being an integer greater than 1. The communication unit is configured to map a plurality of TBs of the TB set on a physical channel and send the plurality of TBs of the TB set to a second network element.

[0007] In yet another aspect, a communication apparatus is provided. The communication apparatus includes a processing unit and a communication unit. The communication unit is configured to receive a plurality of transport blocks (TBs) of a TB set from a first network element on a physical channel. The TB set includes at least k TBs, and among the at least k TBs, there are k first type TBs. The k first type TBs of the TB set correspond to an upper layer critical packet. The first type TBs are TBs that need to be submitted to the upper layer. k is an integer greater than 1. The processing unit is configured to perform a submission of the TBs to the upper layer if all the 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.

[0008] In yet another aspect, a communication apparatus is provided. The communication apparatus includes a memory and a processor. The memory is coupled to the processor. The memory is configured to store a computer program. The processor is configured to implement a method described above when executing the computer program.

[0009] In yet another aspect, a computer readable storage medium is provided. The computer readable storage medium stores computer program instructions. The computer program instructions, when executed by a processor, implement a method described above.

[0010] In yet another aspect, a computer program product is provided. The computer program product includes computer program instructions. The computer program instructions, when executed by a processor, implement a method described above. BRIEF DESCRIPTION OF DRAWINGS

[0011] In order to more clearly illustrate the technical solutions in the present disclosure, the following will briefly introduce the drawings needed to be used in some embodiments of the present disclosure. Obviously, the drawings described in the following are only some of the drawings of the present disclosure, and other drawings can also be obtained by those skilled in the art according to these drawings.

[0012] FIG. 1 is a schematic diagram of a data packet mapping according to some embodiments of the present disclosure.

[0013] FIG. 2 is a schematic diagram of another data packet mapping according to some embodiments of the present disclosure.

[0014] FIG. 3 is a schematic diagram of yet another data packet mapping according to some embodiments of the present disclosure.

[0015] FIG. 4 is a schematic diagram of yet another data packet mapping according to some embodiments of the present disclosure.

[0016] FIG. 5 is an architecture diagram of a communication system according to some embodiments of the present disclosure.

[0017] FIG. 6 is a flowchart of a communication method according to some embodiments of the present disclosure.

[0018] FIG. 7 is a schematic diagram of a TB set transmission according to some embodiments of the present disclosure.

[0019] FIG. 8 is a flowchart of another communication method according to some embodiments of the present disclosure.

[0020] FIG. 9 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0021] FIG. 10 is a schematic diagram of a TB set transmission in frequency domain according to some embodiments of the present disclosure.

[0022] FIG. 11 is a schematic diagram of a TB set transmission in time domain according to some embodiments of the present disclosure.

[0023] FIG. 12 is a schematic diagram of a TB set transmission in time-frequency domain according to some embodiments of the present disclosure.

[0024] FIG. 13 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0025] FIG. 14 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0026] FIG. 15 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0027] FIG. 16 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0028] FIG. 17 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0029] FIG. 18 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0030] FIG. 19 is a flowchart of yet another communication method according to some embodiments of the present disclosure.

[0031] FIG. 20 is a structural diagram of a first network element according to some embodiments of the present disclosure.

[0032] FIG. 21 is a structural diagram of a second network element according to some embodiments of the present disclosure.

[0033] FIG. 22 is a structural diagram of a communication apparatus according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0034] The technical solutions in the present disclosure will be described clearly and completely below with reference to the drawings in the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by a person of ordinary skill in the art without creative effort shall fall within the protective scope of the present disclosure.

[0035] It should be noted that in the present disclosure, the words "exemplary" or "for example" are used on an example, illustration, or description. Any embodiment or design solution described in the present disclosure by "exemplary" or "for example" should not be interpreted as more preferred or more advantageous than other embodiments or design solutions. Rather, the use of "exemplary" or "for example" is intended to present relevant concepts in a concrete manner.

[0036] Hereinafter, the terms "first", "second", and the like are used only for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined by the terms "first", "second", and the like can be explicitly or implicitly included one or more of the features.

[0037] In the description of the present disclosure, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this document is only used to describe the relationship between the associated objects, which means that there can be three relationships. For example, A and / or B can mean: only A, only B, and A and B. In addition, "at least one" means one or more, and "multiple" means two or more. With the improvement of communication technology and the continuous enrichment of business types, related businesses have higher requirements for the performance of communication, such as holographic communication, XR and other businesses, which require communication performance to simultaneously meet ultra-high throughput and ultra-low latency. This kind of business combines the characteristics of two scenarios of enhanced mobile broadband (eMBB) and ultra-reliable and low latency communication (URLLC), not only has very high requirements for throughput, but also has very high requirements for latency. For future-oriented communication systems, the application of artificial intelligence (AI), perception and big data will also bring the demand for large amount of information transmission.

[0038] In wireless communication, physical layer scheduling transmission is usually performed through transport blocks (TBs). Each TB is mapped to an antenna for transmission after channel coding, modulation and other physical layer operations. When the size of the TB (TBS) is too large, TB transmission failure will cause serious impact. Especially for upper layer key data packets, data transmission error at the physical layer will cause poor service experience.

[0039] In addition, due to the influence of various factors such as path loss, channel fading, interference and noise, the wireless communication system has the possibility of failure when transmitting data. For key data such as I frames (intra coded frames, also known as key frames, coded frames, coded key frames, intra coded frames) in XR video streams, parameter files in AI models, etc., the completeness of the data packet directly affects the user experience and system performance. If individual data in the key data packet fails in physical layer transmission, the entire key data packet will fail, directly leading to poor service experience (e.g., video images are not clear, AI model acquisition fails, etc.).

[0040] Currently, in wireless communication, the transmission time interval (TTI) is usually taken as the basic time domain scheduling unit, and each TB is scheduled for transmission. Each hybrid automatic repeat request (HARQ) process handles only one TB in one TTI. After channel coding, modulation and other physical layer processes, each TB is mapped to an antenna and sent out.

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

[0042] Exemplarily, when the key data is mapped to one TB and transmitted in one TTI, as shown in FIG. 1, 1 upper layer key data packet is transmitted in TTI0 TB0. At this time, even if only a small part of the data fails to be transmitted due to local interference, the sending end still needs to retransmit the data of the entire TB0.

[0043] Exemplarily, when the key data is mapped to multiple TTIs for transmission, as shown in FIG. 2, 1 upper layer key data packet P0 is mapped to TB0 transmitted in TTI0 and TB1 transmitted in TTI1. This will cause the problem of too long transmission delay. For example, for users at the edge of the cell, in the related art, a large key data packet needs to be allocated to multiple TTIs for transmission, and the time required to wait for the scheduling opportunity to transmit the key data packet is also relatively long. Moreover, when a TB transmission fails, the waiting time for retransmission will also be relatively long.

[0044] Exemplarily, when multiple key data are mapped to one TB and transmitted on one TTI, as shown in FIG. 3, one upper-layer key data packet P0 and part of data of another upper-layer key data packet P1 are mapped to TB0 transmitted on TTI0. When TB0 transmission fails due to local interference, P0 and P1 transmission will fail.

[0045] In summary, the related art is difficult to meet the requirement of fast and complete delivery of key data packets, resulting in poor experience of related services.

[0046] In view of this, in the technical solution provided in the present disclosure, the first network element maps one upper-layer key data packet to k first-type TBs of one TB set, and then the first network element can map multiple TBs of the TB set on one physical channel and send the multiple TBs of the TB set to the second network element. Exemplarily, as shown in FIG. 4, one upper-layer key data packet P0 is mapped to one TB set, and the TB set is transmitted on TTI0. That is, multiple TBs of one TB set are transmitted on one TTI, and the TB set corresponds to one upper-layer key data packet. In the related art, one upper-layer key data packet P0 is transmitted on 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 opportunity are not large, and the physical layer TB data corresponding to one upper-layer key data packet is difficult to be successfully transmitted in a short time. If one key data packet cannot be successfully obtained in time, the service experience will be seriously affected.

[0047] In the embodiment of the present disclosure, the network architecture of a mobile communication network (including but not limited to 3G, 4G, 5G and future mobile communication networks) can at least include a first network element and a second network element. It should be understood that in the present example, in the downlink, the first network element can be a network-side device (for example, including but not limited to a base station), and the second network element can be a terminal-side device (for example, including but not limited to a terminal). Of course, in the uplink, the first network element can also be a terminal-side device, and the second network element can also be a network-side device. In addition, the first network element and the second network element can also be a module of a device in a communication system, or a protocol layer (for example, including but not limited to a MAC layer) in a communication system. The module can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0048] Exemplarily, as shown in FIG. 5, a communication system according to an embodiment of the present disclosure includes a base station 501 and a terminal 502. The base station 501 and the terminal 502 can be one or more, and the number is not limited.

[0049] The base station 501 is a device with wireless transceiving function or a chip or chip system that can be arranged on the device at the access network side of the above-mentioned communication system. The base station 501 includes but is not limited to: an access point (AP) (such as a home gateway, a router, a server, a switch, a bridge, etc.) in a WiFi system, an evolved NodeB (eNB), a radio network controller (RNC), a NodeB (NB), a base station controller (BSC), a base transceiver station (BTS), a home base station (such as a home evolved NodeB or a home NodeB, HNB), a base band unit (BBU), a wireless relay node, a wireless backhaul node (such as an integrated access and backhaul (IAB) node), a transmission and reception point (TRP), a transmission point (TP), etc., and can also be a 5G base station (such as a gNB in a new radio (NR) system, or a TRP or a TP, one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system, or a network node (such as a BBU, or a distributed unit (DU), a road side unit (RSU) with base station function, or a 5G access network (NG radio access network, NG-Ran) device, etc. that constitutes a gNB or a transmission point. The base station 501 also includes base stations in different networking modes, such as a master evolved NodeB (MeNB), a secondary eNB (SeNB, or secondary gNB, SgNB). The base station 501 also includes base stations of different types, such as a ground base station, an air base station, and a satellite base station, etc.

[0050] The terminal 502 is a device with wireless communication function, which can be deployed on land (including indoor or outdoor, handheld or vehicle-mounted), on water (such as ships, etc.), and in the air (for example, on airplanes, balloons and satellites, etc.). The terminal 502 is also called user equipment (UE), mobile station (MS), mobile terminal (MT), terminal device, etc., which is a device providing voice and / or data connectivity to users. For example, the terminal 502 includes handheld devices with wireless connection function, vehicle-mounted devices, etc. At present, the terminal 502 can be a mobile phone, a tablet computer, a notebook computer, a palm computer, a mobile internet device (MID), a wearable device (for example, a smart watch, a smart bracelet, a pedometer, etc.), a vehicle-mounted device (for example, a car, a bicycle, an electric vehicle, an airplane, a ship, a train, a high-speed rail, etc.), a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a smart home device (for example, a refrigerator, a television, an air conditioner, an electric meter, etc.), a smart robot, a workshop device, a wireless terminal in self driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, a flight device (for example, a smart robot, a hot air balloon, a drone, an airplane), etc. In a scenario where the present disclosure is applied, the terminal is a terminal often working on the ground, for example, a vehicle-mounted device. In the present disclosure, for the convenience of description, a chip deployed in the above device, for example, a system on a chip (SOC), a baseband chip, etc., or other chips with communication function can also be referred to as a terminal.

[0051] In some embodiments, for downlink transmission, the base station 501 can correspond one upper layer critical data packet to k first type TBs of one TB set. Then, the base station 501 can map the TBs of the TB set on one physical channel and transmit the TBs of the TB set to the terminal 502. Accordingly, the terminal 502 can receive the TBs of one TB set from the base station 501 on one physical channel. The data of one critical data packet is guaranteed to be valid only if the data of the critical data packet is completely received at the physical layer. If any data of one critical data packet is not successfully received, the critical data packet is incomplete and cannot be used at the upper layer. Therefore, the terminal 502 only performs the operation of delivering the TBs to the upper layer, i.e., delivering the k first type TBs of the TB set to the upper layer, when the k first type TBs of the TB set are all successfully obtained. In this way, the upper layer can obtain a complete upper layer critical data packet based on the k first type TBs.

[0052] In some embodiments, for uplink transmission, the terminal 502 can correspond one upper layer critical data packet to k first type TBs of one TB set. Then, the terminal 502 can map the TBs of the TB set on one physical channel and transmit the TBs of the TB set to the base station 501. Accordingly, the base station 501 can receive the TBs of one TB set from the terminal 502 on one physical channel. The data of one critical data packet is guaranteed to be valid only if the data of the critical data packet is completely received at the physical layer. If any data of one critical data packet is not successfully received, the critical data packet is incomplete and cannot be used at the upper layer. Therefore, the base station 501 only performs the operation of delivering the TBs to the upper layer, i.e., delivering the k first type TBs of the TB set to the upper layer, when the k first type TBs of the TB set are all successfully obtained. In this way, the upper layer can obtain a complete upper layer critical data packet based on the k first type TBs.

[0053] The TBs of the transmitted TB set can include first type TBs (also referred to as TB original packets, TB source packets or TB system packets) for carrying upper layer data and second type TBs (also referred to as TB redundant packets or TB check packets) for error recovery of the TB original packets.

[0054] In some embodiments, the base station 501 or the terminal 502 can generate a second type of TB (also referred to as a TB redundant packet or a TB check packet) for error recovery of a TB original packet through packet encoding. Packet encoding is also referred to as network encoding, which is a technology for improving network throughput and data reliability. Generally, such encoding technology is referred to as a network encoding technology. Since multiple independent data packets are encoded, network encoding is also referred to as packet encoding. The present disclosure does not specifically distinguish between the two. Packet encoding aims to integrate data before transmission, and the receiving end can recover the data based on the integration method.

[0055] The encoding type of packet encoding includes linear packet encoding and nonlinear packet encoding. Taking linear packet encoding as an example, a new transport block TB3 (which can also be referred to as a TB redundant packet or a TB check packet) can be obtained by performing an AND operation on transport blocks TB1 and TB2 (which can also be referred to as TB original packets, TB source packets, or TB system packets). The sending end sends the three transport blocks, and the receiving end can recover another transport block that fails to be received as long as any two transport blocks are successfully received (for example, TB1 and TB3 are used to recover TB2, and TB2 and TB3 are used to recover TB1).

[0056] Exemplarily, the encoding algorithm used by packet encoding can be a fountain code. The fountain code has the characteristic that it can unlimitedly send packets without limiting the code rate, and the receiving end can recover all original packets with a large probability as long as a sufficient amount of packet encoded packets are received. For example, for k TB original packets to be transmitted, k+m encoded TBs (including k TB original packets and m TB check packets) are obtained after packet encoding, and the receiving end can recover all TB original packets with a target probability as long as any k TBs of the k+m encoded TBs are successfully received.

[0057] It should be noted that the embodiments of the present disclosure can be mutually borrowed or referred to each other, for example, the same or similar steps, method embodiments, system embodiments, and device embodiments can be mutually referred to, without limitation.

[0058] The communication method provided by the embodiments of the present disclosure will be described below in combination with the communication system shown in FIG. 5, taking the interaction between the first network element and the second network element as an example. It should be noted that in the following embodiments of the present disclosure, the first network element is the sending end of the data, and the second network element is the receiving end of the data. The first network element and the second network element can be devices in the above communication system, modules of the devices, or protocol layers in the communication system. The present disclosure is illustrated by taking the first network element and the second network element as the execution subject of the interaction as an example, but the present disclosure does not limit the execution subject of the interaction.

[0059] FIG. 6 is a flow chart of a communication method according to an embodiment of the present disclosure. As shown in FIG. 6, the communication method includes 601 and 602.

[0060] In 601, one upper layer key data packet is mapped to k first type TBs of a TB set.

[0061] The TB set includes at least k TBs, and the at least k TBs include the k first type TBs, the data of the first type TBs is from the upper layer, and k is an integer greater than 1.

[0062] In some embodiments, the k first type TBs have equal sizes.

[0063] In some embodiments, the at least k TBs further include m second type TBs. The first type TBs are TB original packets that are not processed by packet encoding, and the second type TBs are TB check packets generated by packet encoding of the k first type TBs. The TB check packets are used for error recovery of the TB original packets, and m is a positive integer.

[0064] Exemplarily, one TB set is used for physical transmission of one upper layer key data packet. The TB original packet before packet encoding is also referred to as a TB system packet or a TB source packet, and is data transmitted from the upper layer of the sending end to the physical layer or data that needs to be delivered from the physical layer to the upper layer of the receiving end. For example, each first type TB corresponds to one MAC protocol data unit (PDU). In addition, the TB system packet or the TB source packet after packet encoding is the same as the TB original packet before packet encoding.

[0065] The TB check packet, also referred to as a TB redundancy packet, is a TB encoding packet after packet encoding. In some packet encoding algorithms, the TB check packet contains part of the information of the first type TB after multiplication operation in a finite field. The data of the TB check packet is data generated by the physical layer, and is used for error recovery of the TB original packet. The receiving end does not need to deliver the TB check packet to the upper layer. At the receiving end, the TB check packet can be used for decoding of packet encoding to recover the failed TB original packet. Each TB check packet needs to use a corresponding encoding matrix vector for decoding of packet encoding.

[0066] In some embodiments, the upper layer key data packet includes data that is crucial to service experience. That is, when the device fails to successfully obtain the upper layer key data packet, the service experience will be severely degraded or the overall service will fail.

[0067] Exemplarily, the upper-layer key data packet includes but is not limited to one of the following: a data packet corresponding to one PDU set, a video coding key frame, a video coding frame, an AI model data file, a parameter file in an AI model, a software update packet, a medical image data packet, a geographic information system (GIS) update file, a financial transaction sensitive information packet, and an emergency communication key information packet. For example, one upper-layer key data packet is an I frame in XR service, and failure of the I frame will cause degradation of XR service experience. For example, one upper-layer key data packet corresponds to a software update packet, and any missing data in the software update packet will make the software update packet invalid. For example, one upper-layer key data packet corresponds to a complete AI model parameter file, and any missing data in the AI model parameter file will affect the accuracy of the AI model.

[0068] In an implementation manner, the first network element can segment one upper-layer key data packet to obtain k MAC PDUs.

[0069] The k MAC PDUs correspond to k first-type TBs, and one MAC PDU corresponds to one first-type TB.

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

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

[0072] The first information includes at least one of the following: channel quality indication, channel state information, available transmission resource, terminal capability (UE capability), scheduling request (SR), service requirement, service type, scene information, number k of first-type TBs, scheduling information, and TB size that can be transmitted at the physical layer.

[0073] In one example, the TB set identifier of one TB set corresponds to the identifier of one upper-layer key data packet. Through the TB set identifier, it can be known whether the corresponding is an upper-layer key data packet and which upper-layer key data packet the corresponding is.

[0074] In 602, the plurality of TBs of one TB set are mapped on one physical channel, and the plurality of TBs of the TB set are sent to the second network element.

[0075] In an implementation, the first network element transmits the plurality of TBs of the TB set to the second network element in one transmission unit.

[0076] The transmission unit comprises at least one of: a TTI, a slot, a mini slot, a HARQ process.

[0077] Exemplarily, for downlink transmission, the physical channel can be a downlink data transmission channel, for example, a physical downlink shared channel (PDSCH). At this time, the plurality of TBs transmitted are all carried in one PDSCH and transmitted using one TTI.

[0078] For uplink transmission, the physical channel can be an uplink data transmission channel, for example, a physical uplink shared channel (PUSCH). At this time, the plurality of TBs transmitted are all carried in one PUSCH and transmitted using one TTI.

[0079] In an implementation, the plurality of TBs of the TB set are mapped to the same code word and transmitted to the second network element.

[0080] The plurality of TBs transmitted by the first network element can be initial transmission or retransmission.

[0081] Exemplarily, as shown in FIG. 7, in initial transmission, the first network element can transmit TB0, TB1, TB2 and TB3 in the TB set in 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 be transmitted and TB1 and TB3 are successfully transmitted, in retransmission, the first network element can transmit TB0, TB4, TB2 and TB5 in the TB set in one TTI. TB0 and TB2 are first type TBs, and TB4 and TB5 are second type TBs.

[0082] In some embodiments, the plurality of TBs are determined by selecting from the TB set according to at least one of: a current number of transmissions of the TB set; available transmission resources corresponding to the TB set; feedback information from the second network element.

[0083] Exemplarily, when the TB set is initial transmission, the first network element can select a plurality of first type TBs from the TB set. When the TB set is retransmission, the first network element can select a plurality of first type TBs and / or second type TBs from the TB set.

[0084] Based on the above technical solution, the first network element corresponds one upper layer key data packet to k first type TBs of one TB set, and then the first network element can map multiple TBs of the TB set on one physical channel and send the multiple TBs of the TB set to the second network element. In related technologies, when the channel condition is very poor and the amount of data to be transmitted is large, the transmission of the upper layer key data packet is difficult to obtain sufficient scheduling opportunities, because it will occupy more transmission resources and affect the overall performance of the system. Moreover, after obtaining the scheduling opportunity, due to the poor channel condition, the size of the TB that can be transmitted is also small. Especially, when interference is encountered, the entire TB transmission will also fail. These factors will result in very low transmission efficiency of one key data packet at the physical layer, and it is difficult to guarantee the reliable transmission of one key data packet with low latency and large data amount, and finally the service experience is poor. In the present disclosure, by corresponding one upper layer key data packet to one TB set at the physical layer, it is guaranteed that one upper layer key data packet can be transmitted successfully and delivered completely in the transmission at the physical layer. Corresponding one upper layer key data packet to multiple small TBs of one TB set can increase the scheduling opportunities of data transmission, and using the TB set for transmission facilitates the use of technologies for improving the success rate of TB transmission, such as retransmitting only the error small TB, recovering the error TB by packet encoding and decoding, etc. Therefore, the present disclosure can improve the completeness of the transmission success of one upper layer key data packet at the physical layer, so that the physical layer data corresponding to one upper layer key data packet can be delivered completely to the upper layer as soon as possible, and thus the service experience is improved.

[0085] In some embodiments, the first network element can receive feedback information from the second network element, so as to obtain the situation of the transmitted TB.

[0086] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 6, as shown in FIG. 8, the communication method further includes the following 801.

[0087] In 801, feedback information from the second network element is received.

[0088] The feedback information includes at least one of the following: feedback information for indicating that one TB set is successfully transmitted, the successful transmission of the TB set means that the second network element has successfully obtained k first type TBs of the TB set; feedback information for indicating that one TB set is unsuccessfully transmitted, the unsuccessful transmission of the TB set means that the second network element has not successfully obtained at least one TB of the k first type TBs of the TB set; and feedback information of each TB of the multiple TBs, the feedback information of each TB being used to indicate whether the second network element has successfully obtained the corresponding TB.

[0089] That is, the feedback information can be TB set granularity information and / or TB granularity information. The feedback information is a feedback indication of the second network element to the previous TB transmission of the TB set, which can be a set level feedback to the entire TB set and / or a feedback to each TB.

[0090] Exemplarily, the feedback information used to characterize the success of the TB set transmission can be an ACK (acknowledge) indication, and the feedback information used to characterize the failure of the TB set transmission can be a NACK (negative-acknowledge) indication, the ACK indication and the NACK indication can be represented by one bit.

[0091] For example, the second network element can send a TB set level feedback indication of ACK to the first network element, which can be represented by one bit. When the first network element receives the TB set level feedback of ACK, the first network element can determine that the TB set transmission is successful.

[0092] For another example, the second network element can send a TB set level feedback indication of NACK to the first network element, which can be represented by one bit. After the first network element receives the NACK indication, the first network element can determine that there is a case that the first type TB is not all successfully acquired in the previous transmission based on the indication.

[0093] In some embodiments, the feedback information is not necessarily sent. For example, the second network element can send the feedback information when the first type TB is all successfully acquired. When there is a first type TB that is not successfully acquired, the second network element can not send the feedback information. The first network element can always send the TB data until it receives the feedback information indicating that the TB set transmission is all successful.

[0094] Exemplarily, the feedback information can be HARQ feedback. The feedback information of each TB of the plurality of TBs can be represented in the form of a bitmap, or the feedback information of each TB can be indicated by one bit. The first network element uses channel decoding to obtain the HARQ feedback information of the plurality of TBs in the current transmission. For example, the second network element feeds back 1-bit ACK / NACK indication for each of the plurality of TBs in the current transmission. After the first network element receives the ACK / NACK indication, the first network element can know which TBs have been successfully transmitted and which TBs need to be retransmitted. For another example, the second network element can use a bitmap to indicate the HARQ feedback of the plurality of TBs, and the second network element sends the HARQ feedback of the plurality of TBs in the current transmission after channel encoding, so as to obtain coding gain. After the first network element receives the HARQ feedback, the first network element performs channel decoding on the HARQ feedback to obtain the HARQ feedback of the plurality of TBs in the current transmission.

[0095] Exemplarily, the bitmap information can represent whether the TBs of the current transmission are unsuccessfully acquired, or whether the first type TBs are successfully acquired. For example, "0010" can represent that the third TB of the four TBs of the current transmission is unsuccessfully acquired, and the other three TBs are successfully acquired. For another example, "0010" can represent that the third first type TB of the four first type TBs of all the transmitted TBs is unsuccessfully acquired, and the other three first type TBs are successfully acquired. When the first network element receives the TB-level feedback, it can clearly know which of the transmitted TBs are successfully acquired, which are unsuccessfully acquired, and whether there is a case of unsuccessfully acquired first type TB. When the first network element confirms that there is at least one first type TB transmission failure in the TB set, the first network element can transmit at least one second type TB. The second type TB can be used for the receiving end to recover the first type TB of the transmission failure through decoding of packet encoding.

[0096] In some embodiments, the first network element can further determine whether to end the transmission of the TB set based on the feedback information.

[0097] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 6, as shown in FIG. 8, the communication method further includes the following 802.

[0098] In 802, it is determined whether to end the transmission of the TB set based on the feedback information.

[0099] In an implementation manner, in a case where the feedback information representing the successful transmission of the TB set is received, the first network element determines to end the transmission of the TB set.

[0100] In one example, when the first network element receives the feedback information representing the successful transmission of the TB set, it can be considered that the upper-layer key data packet is successfully transmitted. At this time, the first network element can end the transmission of the TB set.

[0101] In another implementation manner, in a case where the feedback information representing the transmission failure of the TB set is received, and the number of transmissions of the TB set reaches the maximum number of transmissions, the first network element determines to end the transmission of the TB set.

[0102] In a case where the feedback information representing the transmission failure of the TB set is received, and the number of transmissions of the TB set does not reach the maximum number of transmissions, the first network element determines to retransmit the TB set.

[0103] In one example, when the first network element receives the feedback information indicating the TB set transmission failure, the first network element can determine whether the number of transmissions of the TB set reaches the maximum number of transmissions, and when the maximum number of transmissions is not reached, it can be considered that the upper layer key data packet needs to be retransmitted by the physical layer. At this time, the first network element can determine to retransmit the TB set. When the maximum number of transmissions is reached, it can be considered that the upper layer key data packet transmission fails. At this time, continuing to retransmit can affect the normal communication of the first network element, and therefore the first network element can determine to end the transmission of the TB set.

[0104] In some embodiments, in each retransmission, the retransmission packet can be the same as the first transmitted TB, or a different redundancy version (RV) of the first transmitted TB. For example, TB0 is a first type of TB, and the first network element can use different RV versions of TB0 as retransmission packets of TB0, so that the receiving end can perform soft information combination on the data of multiple transmissions of TB0 to improve the channel decoding success rate of TB0. For another example, TB4 is a second type of TB, and using different RV versions of TB4 as retransmission packets of TB4 enables the receiving end to perform soft information combination on the data of multiple transmissions of TB4 to improve the channel decoding success rate of TB4. The second type of TB that successfully decodes the channel can recover the first type of TB that fails to transmit. Using retransmission and packet encoding for a TB set can more quickly transmit all first type of TBs successfully, that is, more quickly transmit and complete the delivery of a complete key data packet at the physical layer.

[0105] In some embodiments, in the case of determining to end the transmission of the TB set, the first network element can perform at least one of the following: emptying all caches of the TB set; resetting all information of the TB set; starting transmission of a new TB set corresponding to a new upper layer key data packet.

[0106] Based on the above technical solutions, in the embodiments of the present disclosure, the first network element can determine the transmission of the TBs in the TB set based on the feedback information from the second network element, and determine the subsequent transmission strategy. In this way, the first network element can reasonably evaluate whether to end the transmission of the TB set, and improve the efficiency of data transmission.

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

[0108] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 6, as shown in FIG. 9, the communication method further includes the following 901.

[0109] In 901, a TB in the plurality of TBs of a TB set is allocated a transmission resource according to a TB mapping rule.

[0110] In an implementation, the first network element allocates transmission resources for the first type of TBs in the plurality of TBs first and then for the second type of TBs in the plurality of TBs on the transmission resources corresponding to the TB set based on the TB mapping rule of the first type of TBs being prioritized; and / or, the first network element allocates transmission resources for the first type of TBs in the plurality of TBs in time domain earlier and for the second type of TBs in the plurality of TBs in time domain later based on the TB mapping rule of the first type of TBs being earlier.

[0111] The transmission resource includes one of: a time domain resource, a frequency domain resource, and a time-frequency domain resource.

[0112] Taking the frequency domain resource as an example, as shown in FIG. 10, for the TB mapping rule of the first type of TBs being prioritized, the first network element can select the frequency domain resources (for example, TB0 and TB1 in FIG. 10) for the first type of TBs first and then select the remaining frequency domain resources (for example, TB2 and TB3 in FIG. 10) for the second type of TBs, so as to allocate the plurality of TBs to the frequency domain resource blocks of the TB set, so that the plurality of TBs are mapped to a physical channel for transmission. The first network element can allocate the first type of TBs on the optimal frequency domain resources, so as to improve the transmission success rate of the first type of TBs.

[0113] Taking the time domain resource as an example, as shown in FIG. 11, for the TB mapping rule of the first type of TBs being earlier, the first network element can allocate the time domain earlier positions (for example, TB0, TB1, and TB2 in FIG. 11) for the first type of TBs and the time domain later positions (for example, TB3 in FIG. 11) for the second type of TBs, so as to allocate the plurality of TBs to the time domain resource blocks of the TB set, so that the plurality of TBs are mapped to a physical channel for transmission. In this way, the first type of TBs can be guaranteed to be received first and to be decoded first.

[0114] Taking the time-frequency domain resource as an example, as shown in FIG. 12, for the TB mapping rule of the first type of TBs being prioritized and earlier, the first network element can select the optimal and earlier time-frequency domain resources (for example, TB0 and TB1 in FIG. 12) for the first type of TBs first and then select the remaining time-frequency domain resources (for example, TB2 and TB3 in FIG. 12) for the second type of TBs, so as to allocate the plurality of TBs to the time-frequency domain resource blocks of the TB set, so that the plurality of TBs are mapped to a physical channel for transmission. In this way, the first type of TBs can be guaranteed to be transmitted first and to have a higher transmission success rate. If the first type of TBs are all transmitted successfully, there is no need to decode the second type of TBs, and there is even less need to decode the plurality of TBs that are successfully obtained, so as to further improve the transmission efficiency.

[0115] In some embodiments, the first network element can also acquire scheduling information of the TB set to facilitate scheduling of the TB set. For example, the first network element can perform at least one of the following: acquiring scheduling information 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 transmitted by the TB set; determining the number of first type TBs currently transmitted by the TB set; determining the number of second type TBs currently transmitted by the TB set, the second type TB being a TB check packet obtained after using a packet encoding on k first type TBs, the TB check packet being used for error recovery of the first type TBs; determining a transmission resource space currently used by the TB set for transmission, the transmission resource space being a transmission resource available for transmission of the TB set; and determining transmission resources used by each TB currently transmitted by the TB set.

[0116] For the first network element to acquire the scheduling information, as an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 6, as shown in FIG. 13, the communication method further includes the following 1301.

[0117] In 1301, the scheduling information of the TB set is acquired.

[0118] The scheduling information of the TB set is used for scheduling transmission of the TB set. The scheduling information can include scheduling information corresponding to the TB set, or can include scheduling information corresponding to each TB in the TB set.

[0119] In some embodiments, the scheduling information comprises at least one of: a TB set identifier corresponding to the TB set; transmission resource location information corresponding to the TB set; a number of resource elements (REs) corresponding to the TB set; a common modulation and coding scheme (MCS) corresponding to the TB set, the common MCS being used to indicate that the TBs in the TB set are transmitted using a same MCS; a common number of spatial multiplexing layers corresponding to the TB set, the common number of spatial multiplexing layers being used to indicate that the TBs in the TB set are transmitted using a same number of spatial multiplexing layers; a code word index used by the TBs in the TB set; a TB mapping rule; transmission resource location information corresponding to each of the TBs currently transmitted in the TB set; a number of REs corresponding to each of the TBs currently transmitted in the TB set; an MCS used by each of the TBs currently transmitted in the TB set; a number of spatial multiplexing layers used by each of the TBs currently transmitted in the TB set; a packet encoding algorithm used by the TB set; a calculation method of a size of a first type of TB; the size of the first type of TB; a number k of the first type of TBs in the TB set; a number m of the second type of TBs in the TB set; a number of the TBs currently transmitted in the TB set; an index of each of the TBs currently transmitted in the TB set; a packet encoding vector index of each of the TBs currently transmitted in the TB set; and a type indication of each of the TBs currently transmitted in the TB set, the type indication being used to indicate the first type of TB or the second type of TB.

[0120] Exemplarily, the index of the TB represents a serial number of the TB in the TB set. The packet encoding vector of the TB can be indicated by the packet encoding vector index, or can be implicitly indicated by being associated with the index of the TB. That is, the packet encoding vector corresponding to the TB can be determined by the index of the TB. The type of the TB can be indicated by the type indication information, or can be indicated by the index of the TB. For example, a TB set includes k first type of TBs and m second type of TBs, the indexes of the first type of TBs can be arranged in front, for example, the TBs with indexes ranging from 0 to k-1 are the first type of TBs, and the TBs with indexes ranging from k to k+m-1 are the second type of TBs.

[0121] In some embodiments, the scheduling information is obtained by at least one of: channel state information (CSI), downlink control information (DCI), a radio resource control (RRC) message, and a MAC control element (MAC CE).

[0122] For CSI, the first network element can determine the scheduling information based on the CSI. For DCI, the first network element can obtain the scheduling information by receiving the DCI, which includes the first level DCI and / or the 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 message, the first network element can obtain the scheduling information by receiving the RRC message, which can include the scheduling information. For MAC CE, the first network element can obtain the scheduling information by receiving the MAC CE, which can include the scheduling information.

[0123] In one example, the size of each TB in a TB set, the MCS level used, and the number of spatial multiplexing layers can be the same. In this way, the time-frequency domain position, time-frequency domain resource, MCS, number of spatial multiplexing layers, etc. of each TB can not be included in the scheduling information, thereby reducing the overhead of control signaling. If the transmission scheme is to transmit k TBs each time, the number of TBs currently transmitted by the TB set does not need to be included in the scheduling information, thereby further reducing the overhead.

[0124] In another example, the scheduling information can be obtained in multiple ways. For example, the number k of the first type of TB in a TB set is usually constant, and therefore, when transmitting the TB set, the number k of the first type of TB in the TB set can be carried by the RRC message, thereby achieving semi-static indication of the number of the first type of TB in the TB set. In addition, it can be indicated that the transmission scheme is to transmit k TBs each time, and therefore, the MCS, number of spatial multiplexing layers, total number of REs, and TB mapping rule of the TB set can be dynamically indicated by the DCI each time, thereby reducing the signaling overhead.

[0125] Exemplarily, when the first network element is responsible for scheduling the TB set, the first network element can generate the scheduling information and send the scheduling information to the second network element, thereby instructing the second network element to receive the TB set. The first network element can transmit the TB set through the scheduling information. When the second network element is responsible for scheduling the TB set, the second network element can generate the scheduling information and send the scheduling information to the first network element, thereby instructing the first network element to transmit the TB set. The second network element can receive the TB set through the scheduling information. Taking the transmission process between a base station and a terminal as an example, the base station is responsible for generating the scheduling information and sending the scheduling information of uplink transmission and downlink transmission to the terminal.

[0126] In some embodiments, after obtaining the scheduling information, the first network element can further 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 of the transmission of the TB set through CSI, and sends the scheduling information of the TB set to the terminal, so that the terminal can receive the data of the n TBs of the TB set based on the scheduling information.

[0127] Exemplarily, after receiving the scheduling information, the second network element can determine the transmission resource corresponding to the data of the TB set received in one time domain transmission unit, the MCS level, the number of spatial multiplexing layers, the size of the TB set, the size of each TB, and other information corresponding to the transmission resource of each TB, so as to decode each independent TB. If it is detected based on the scheduling information that the TB encoding packet (for example, the second type of TB) and the current first type of TB is not all successfully acquired, the decoding of the packet encoding can also be performed to recover the first type of TB.

[0128] In some embodiments, the first network element can further determine the size of the first type of TB to facilitate the allocation of resources to the TBs of the TB set.

[0129] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 6, as shown in FIG. 14, the communication method further includes the following 1401.

[0130] In 1401, the size of the first type of TB is determined.

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

[0132] The second information includes the number of REs corresponding to a TB set, the common MCS corresponding to the TB set, the common number of spatial multiplexing layers corresponding to the TB set, and the number of the first type of TBs in the TB set.

[0133] Exemplarily, the second type of TB can be equal to the size of the first type of TB, and after the size of the first type of TB is determined, the size of the second type of TB is also determined.

[0134] In an implementation manner, the first network element can determine the total size of 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) based on the number of REs corresponding to the TB set, the common MCS corresponding to the TB set, and the common number of spatial multiplexing layers corresponding to the TB set. Then, the first network element determines the size of the first type of TB based on the total size of the TB set and the number of the first type of TBs in the TB set.

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

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

[0137] wherein t TB represents the size of the first-type TB, t represents the total size of the TB set, and k represents the number of the first-type TBs.

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

[0139] wherein t TB represents the size of the first-type TB, t represents the total size of the TB set, and k represents the number of the first-type TBs. represents a ceiling operator.

[0140] Exemplarily, when all TBs in 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 regarded as a virtual large TB) according to the transmission resource allocated to the TB set, the common MCS, and the number of spatial multiplexing layers, and then determine the size of the first-type TB by equally dividing the total size of the TB set. For example, when the total size of the TB set can be evenly divided by the number of the first-type TBs, the size of the first-type TB can be calculated by ; when the total size of the TB set cannot be evenly divided by the number of the first-type TBs, the size of the first-type TB can be calculated by rounding up the calculation result.

[0141] The total size of a TB set refers to the size calculated by the transmission resource, MCS, and the number of spatial multiplexing layers corresponding to the TB set. The total size of the TB set corresponds to the total number of TB bits that the entire TB set can transmit, which can also be regarded as a virtual large TB. Since directly sending large TB data can easily cause TB errors, the total size of the TB set can be divided to obtain a plurality of small TBs (i.e., first-type TBs) in the present disclosure, and the plurality of TBs obtained by the division are transmitted as a TB set. That is to say, the virtual large TB is not a real TB, which is only described for ease of understanding.

[0142] In yet another 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 the TB set and the number of first type TBs in the TB set. Then, the first network element can determine the size of each 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 spatial multiplexing layers corresponding to the TB set.

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

[0144] wherein, N allocated to each first type TB, N RE denotes the number of REs corresponding to the TB set, and k denotes the number of first type TBs.

[0145] Alternatively, the number of REs allocated to each first type TB satisfies the following equation:

[0146] wherein, N allocated to each first type TB, N RE denotes the number of REs corresponding to the TB set, and k denotes the number of first type TBs. denotes a floor operator.

[0147] Exemplarily, 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 allocate the transmission resources of the TB set to each first type TB equally as the transmission resources of each TB, and then calculate the size of each first type TB based on the transmission resources of each TB, the common MCS, and the number of spatial multiplexing layers.

[0148] In some embodiments, the number and / or size of the first type TBs are determined based on at least one of the following: scheduling information, pre-configuration information, an RRC message, and a TB mapping table.

[0149] Exemplarily, the first network element can also obtain the size of each first type TB based on pre-configuration information at the first network element side. For example, the first network element can be configured with the number k of first type TBs locally, obtain the total size t of the TB set and the number m of second type TBs in the TB set based on the scheduling information, and obtain the size of each first type TB by the above-mentioned equal division. Alternatively, the scheduling information can directly include information of the size of each first type TB.

[0150] Exemplarily, the first network element can also obtain the size of each first type TB based on an RRC message including the number k of first type TBs.

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

[0152] Exemplarily, when the sizes of the first type TBs are not equal, the first network element can use padding bits to pad before packet encoding, so that the sizes of the first type TBs are equal.

[0153] FIG. 15 is a flowchart of another communication method according to an embodiment of the present disclosure. As shown in FIG. 15, the communication method includes the following: 1501 and 1502.

[0154] In 1501, multiple TBs of a TB set from a first network element are received on one physical channel.

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

[0156] In some embodiments, the sizes of the k first type TBs are equal.

[0157] In some embodiments, the at least k TBs further include m second type TBs. The first type TB is a TB original packet that is not processed by packet encoding. The second type TB is a TB check packet generated by packet encoding processing on the k first type TBs. The TB check packet is used for error recovery of the TB original packet. m is a positive integer.

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

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

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

[0161] The transmission unit comprises at least one of the following: a TTI, a time slot, a mini-slot, and a HARQ process.

[0162] In one example, the TB set identification of the TB set corresponds to the identification of one upper layer critical data packet.

[0163] Exemplarily, the plurality of TBs of the received TB set are mapped onto the same codeword.

[0164] The related description can refer to 601 and 602 described above, and will not be repeated here.

[0165] In 1502, in the case that all the k first type TBs of the TB set are successfully acquired, the operation of submitting the TB to the upper layer is performed.

[0166] The TB submitted to the upper layer is the k first type TBs of the TB set.

[0167] It should be understood that, for the upper layer critical data packet in the service, if an individual data in the upper layer critical data packet fails in the physical layer transmission, the entire critical data packet will fail, thereby directly causing the service to fail (for example, video interruption, AI model running failure, etc.). Even if the other successful first type TBs in the TB set are submitted to the upper layer, the upper layer cannot obtain a complete upper layer critical data packet. Therefore, each successfully transmitted first type TB is not immediately submitted to the upper layer, but needs to be first buffered in the physical layer, and the overall submission of the TB set is performed after all the first type TBs of the TB set are successfully transmitted.

[0168] In one implementation manner, the second network element recombines the k first type TBs into one data packet after submitting the k first type TBs to the upper layer. The data packet corresponds to the upper layer critical data packet.

[0169] Based on the above technical solution, the second network element receives multiple TBs of a TB set from the first network element on one physical channel. In the related art, when the channel condition is poor and the amount of data to be transmitted is large, the transmission of the upper-layer key data packet is difficult to obtain sufficient scheduling opportunities, because it will occupy more transmission resources and affect the overall performance of the system. Moreover, after obtaining the scheduling opportunity, due to the poor channel condition, the size of the TB that can be transmitted is also small. Especially, when interference is encountered, the entire TB transmission will also fail. These factors will result in a very low transmission efficiency of a key data packet at the physical layer, and it is difficult to guarantee the low-latency and large-data-volume reliable transmission of a key data packet, resulting in a poor service experience. In the present disclosure, by corresponding one upper-layer key data packet to one TB set at the physical layer, it is ensured that one upper-layer key data packet can be transmitted successfully and delivered completely as soon as possible in the physical layer transmission. Corresponding one upper-layer key data packet to multiple small TBs of one TB set can increase the scheduling opportunities of data transmission, and using the TB set for transmission facilitates the use of technologies for improving the TB transmission success rate, such as retransmitting only the erroneous TB, decoding and coding the erroneous TB, and the like. Therefore, the present disclosure can improve the completeness of the successful transmission of one upper-layer key data packet at the physical layer, so that the physical layer data corresponding to one upper-layer key data packet can be delivered completely to the upper layer as soon as possible, thereby improving the service experience.

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

[0171] In some embodiments, the second network element can perform at least one of the following operations: the second network element selects a first type of TB in the multiple TBs for channel decoding; the second network element selects a second type of TB in the multiple TBs for channel decoding; the second network element first performs channel decoding on the first type of TB in the multiple TBs; and if k first type of TBs are not successfully obtained, the second network element performs channel decoding on the second type of TB in the multiple TBs.

[0172] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 15, as shown in FIG. 16, the communication method further includes 1601 to 1604.

[0173] In 1601, the first type of TB in the multiple TBs is subjected to channel decoding.

[0174] Channel encoding / decoding refers to the encoding / decoding of data in a TB. For example, at the sending end, a 100-bit TB is subjected to 1 / 3 code rate channel encoding to form a 300-bit encoded packet and sent to the modulation module. At the receiving end, the demodulated data information is subjected to channel decoding to recover the 100-bit TB source bit information.

[0175] In some embodiments, the second network element can select first type TBs from the plurality of TBs for channel decoding.

[0176] The second network element can learn which TBs in the plurality of TBs are first type TBs and which are second type TBs through some information. For example, the second network element can obtain the transmission positions of the first type TBs based on a TB mapping rule within the TB set. The TB mapping rule can be included in the scheduling information or be a default rule. For another example, the second network element can obtain the types of the received TBs according to the implicit indication of the index of each TB.

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

[0178] In 1602, it is determined whether k first type TBs have been successfully obtained.

[0179] In some embodiments, the second network element can determine whether k first type TBs have been successfully obtained after performing channel decoding on the first type TBs in the plurality of TBs in combination with the previous transmission results.

[0180] In an implementation manner, the second network element determines whether k first type TBs of the TB set have been successfully obtained based on the reception of the plurality of TBs.

[0181] In a case where the transmission times of the TB set reach the maximum transmission times and the second network element fails to successfully obtain at least one TB of the k first type TBs, the second network element determines to end the transmission of the TB set.

[0182] In a case where the second network element successfully obtains the k first type TBs, the second network element determines to end the transmission of the TB set.

[0183] In a case where the transmission times of the TB set do not reach the maximum transmission times and the second network element fails to successfully obtain at least one TB of the k first type TBs, the second network element determines to perform retransmission on the TB set.

[0184] The retransmission of the TB set is the transmission of the plurality of TBs in the TB set.

[0185] In some embodiments, in a case where it is determined to end the transmission of the TB set, the second network element can perform at least one of the following: empty all the caches of the TB set; reset all the information of the TB set; start the transmission of a new TB set, and the new TB set corresponds to a new upper layer key data packet.

[0186] One TB set corresponds to one upper layer key data packet. As long as any one of the k first type TBs is transmitted in error, the entire upper layer key data packet is considered to be transmitted unsuccessfully. When the maximum number of transmissions is reached and all the first type TBs of the TB set are not successfully acquired, it means that the TB set transmission fails, i.e., the upper layer key data packet acquisition fails.

[0187] In 1603, in the case that there is at least one TB in the k first type TBs that is not successfully acquired and there is a second type TB in the plurality of TBs, the second type TB in the plurality of TBs is channel decoded.

[0188] In the case that the k first type TBs are successfully acquired, the second network element does not need to perform channel decoding on the second type TB in the plurality of TBs, nor does it need to perform decoding corresponding to the packet encoding.

[0189] In 1604, in the case that there is at least one TB in the k first type TBs that is not successfully acquired and there is a second type TB in the plurality of TBs that is successfully channel decoded, decoding corresponding to the packet encoding is performed based on the successfully acquired TBs in the k first type TBs and the second type TB in the plurality of TBs that is successfully channel decoded, to acquire the TBs in the k first type TBs that are not successfully acquired.

[0190] Packet encoding / decoding refers to encoding / decoding between the plurality of TB data packets. For example, at the sending end, 4 first type TBs of 100 bits are packet encoded to generate 6 second type TBs of 100 bits. At the receiving end, if the 4 first type TBs are not all successfully acquired, the successfully acquired second type TBs and all the successfully acquired first type TBs are jointly packet encoded and decoded to recover the first type TBs that fail to be transmitted.

[0191] If there are successfully acquired second type TBs and the second network element still has first type TBs that are not successfully acquired, the second network element can perform packet encoding decoding on all the successfully acquired TBs.

[0192] For example, the second network element can perform packet encoding decoding (packet decoding) on all the successfully acquired TBs in the previous transmission and the current transmission according to the encoding vector index of the packet encoding. The encoding vector index corresponds to an encoding matrix, and the encoding vector index can also be a packet index or a sequence number of a TB in a TB group.

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

[0194] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 15, as shown in FIG. 17, the communication method further includes the following 1701.

[0195] In 1701, the feedback information is sent to the first network element.

[0196] The feedback information comprises at least one of: feedback information used to represent that a TB set transmission is successful, the TB set transmission being successful refers to that the second network element has successfully acquired k first type TBs; feedback information used to represent that a TB set transmission is unsuccessful, the TB set transmission being unsuccessful refers to that the second network element has not successfully acquired at least one TB of the k first type TBs; and feedback information of each TB of a plurality of TBs, the feedback information of each TB being used to represent whether the second network element has successfully acquired the corresponding TB.

[0197] The related description can refer to 701 described above, and will not be repeated here.

[0198] In some embodiments, the second network element can also acquire scheduling information of a TB set, so as to schedule the TB set. For example, the second network element can perform at least one of the following: acquiring scheduling information of the TB set; determining the number of first type TBs; and determining the size of the first type TBs.

[0199] For the second network element to acquire the scheduling information, as an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 15, as shown in FIG. 18, the communication method further comprises 1801.

[0200] In 1801, the scheduling information of a TB set is acquired.

[0201] The scheduling information of the TB set is used to schedule the TBs transmitted in the TB set. The scheduling information can comprise scheduling information corresponding to the TB set, or can comprise scheduling information corresponding to each TB in the TB set.

[0202] The scheduling information includes at least one of the following: a TB set identifier corresponding to the TB set; transmission resource position information corresponding to the TB set; a number of REs corresponding to the TB set; a common MCS corresponding to the TB set, the common MCS being used to indicate that the TBs in the TB set are transmitted using a same MCS; a number of common spatial multiplexing layers corresponding to the TB set, the number of common spatial multiplexing layers being used to indicate that the TBs in the TB set are transmitted using a same number of spatial multiplexing layers; a code word index used for transmission of the TBs in the TB set; a TB mapping rule; transmission resource position information corresponding to each of the TBs currently transmitted in the TB set; a number of REs corresponding to each of the TBs currently transmitted in the TB set; an MCS used for transmission of each of the TBs currently transmitted in the TB set; a number of spatial multiplexing layers used for transmission of each of the TBs currently transmitted in the TB set; a packet encoding algorithm used for the TB set; a calculation method of a size of the first type of TB; a size of the first type of TB; a number k of the first type of TBs in the TB set; a number m of the second type of TBs in the TB set; a number of TBs currently transmitted in the TB set; an index of each of the TBs currently transmitted in the TB set; a packet encoding vector index of each of the TBs currently transmitted in the TB set; and a type indication of each of the TBs currently transmitted in the TB set, the type indication being used to indicate the first type of TB or the second type of TB.

[0203] The related description can refer to the description of 1301, and details are not repeated here.

[0204] In some embodiments, the scheduling information is obtained by at least one of the following: CSI, DCI, an RRC message, and a MAC CE.

[0205] For the CSI, the second network element can determine the scheduling information based on the CSI. For the DCI, the second network element can obtain the scheduling information by receiving the DCI, the DCI including a first-level DCI and / or a second-level DCI, the scheduling information corresponding to the TB set being carried in the first-level DCI, and the scheduling information corresponding to the TB being carried in the second-level DCI. For the RRC message, the second network element can obtain the scheduling information by receiving the RRC message, the scheduling information being included in the RRC message. For the MAC CE, the second network element can obtain the scheduling information by receiving the MAC CE, the scheduling information being included in the MAC CE.

[0206] In some embodiments, after obtaining the scheduling information, the second network element can further 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 of the uplink TB set transmission through the CSI, and sends the scheduling information of the TB set to the terminal, so that the terminal can send data of multiple TBs of the TB set based on the scheduling information.

[0207] In some embodiments, the second network element can also determine the size of the first type of TBs to facilitate determining the resource allocated to the TBs in the TB set.

[0208] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 15, as shown in FIG. 19, the communication method further includes the following 1901.

[0209] In 1901, the size of the first type of TBs is determined.

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

[0211] 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 spatial multiplexing layers corresponding to the TB set, and the number of the first type of TBs in the TB set.

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

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

[0214] In some embodiments, the size of the first type of TBs satisfies the following formula:

[0215] wherein t TB represents the size of the first type of TBs, t represents the total size of the TB set, and k represents the number of the first type of TBs.

[0216] Alternatively, the size of the first type of TBs satisfies the following formula:

[0217] wherein t TB represents the size of the first type of TBs, t represents the total size of the TB set, and k represents the number of the first type of TBs. represents a rounding up operator.

[0218] Exemplarily, when all the 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 TBs by averaging the total size of the TB set. For example, when the total size of the TB set can be divided by the number of the first type of TBs, the size of the first type of TBs can be determined by dividing the total size of the TB set by the number of the first type of TBs. When the total size of the TB set cannot be divided by the number of the first type of TBs, the size of the first type of TBs can be determined by rounding up the calculation result.

[0219] The total size of a TB set refers to the TB size calculated by the transmission resource, MCS and the number of spatial multiplexing layers corresponding to the TB set, which corresponds to a virtual large TB. Since directly sending large TB data can easily cause TB errors, in the present disclosure, the total size of the TB set can be divided to obtain a plurality of small TBs (i.e., the first type of TBs), and the plurality of TBs obtained by the division are transmitted as a TB set. That is to say, the virtual large TB is not a real TB, which is only described for the convenience of understanding.

[0220] In another implementation manner, the second network element can determine the number of REs allocated to each first type of TB based on the number of REs corresponding to the TB set and the number of the first type of TBs in the TB set. Then, the second network element determines the size of the first type of TBs based on the number of REs allocated to each first type of TB, the common MCS corresponding to the TB set and the common number of spatial multiplexing layers corresponding to the TB set.

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

[0222] wherein, N represents the number of REs allocated to each first type of TB, N represents the number of REs corresponding to the TB set, and k represents the number of the first type of TBs. RE

[0223] Alternatively, the number of REs allocated to each first type of TB satisfies the following formula:

[0224] wherein, N represents the number of REs allocated to each first type of TB, N represents the number of REs corresponding to the TB set, and k represents the number of the first type of TBs. RE represents a down rounding operator.

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

[0226] For example, the second network element can determine the size of each first type of TB of the TB set based on the scheduling information. For example, the second network element receives 4 TBs (TB0, TB1, TB2, TB3) of a TB set in one TTI, and based on the scheduling information, the size of each TB and the time-frequency domain position of the data mapped by each TB can be calculated. The TB data at the corresponding position is decoded, and it is determined whether the received TB is a first type of TB or a second type of TB (for example, TB0 and TB1 are TB system packets, and TB2 and TB3 are TB redundancy packets).

[0227] For example, the size of each TB in a TB set can be equal, and in the case of uneven division, the size of all TBs can be made equal by padding bits. The second network element can also obtain the size of each first type of TB based on pre-configuration information at the second network element side. For example, the number of first type of TBs k is configured locally at the second network element, the total size t of the TB set and the number m of second type of TBs in the TB set are obtained based on the scheduling information, and the size of each first type of TB is obtained by the above-mentioned average division. For another example, the scheduling information can directly include information of the size of each first type of TB.

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

[0229] For example, the second network element can also obtain the size of each first type of TB by looking up a table. For example, there is a TB mapping table that one-to-one corresponds the number k of first type of TBs to the size of the first type of TBs. The second network element can look up the table by the value of k to obtain the size of the first type of TBs.

[0230] It should be understood that the communication method provided in the present disclosure can be applied to various business scenarios.

[0231] Exemplarily, in the XR service scenario, video data transmission is usually performed using video coding frames I frame, P frame and B frame. The I frame is a complete image frame, and the P frame and the B frame are differential prediction frames. If the I frame is lost or damaged, all P frames or B frames depending on it will not be correctly decoded. The I frame is a video coding key frame, and since the I frame is relatively large, it can correspond to a MAC PDU at the MAC layer. When a MAC PDU cannot accommodate the entire I frame data, the I frame is segmented into multiple MAC PDUs for transmission in multiple TTIs. Usually, the I frame corresponds to an independent PDU set. A P frame or a B frame can correspond to another independent PDU set, or can jointly form a PDU set with other frames other than the I frame. When an I frame corresponds to a MAC PDU, a MAC PDU corresponds to a TB with a large TB size (TBS). If there is an individual data error (such as local interference) in the TB during physical layer transmission, the probability that the TB cannot be checked by CRC at the receiving end is very high. That is, a small amount of data error at the physical layer will cause the entire I frame to be erroneous. In the related art, when multiple I frames correspond to a MAC PDU, as long as the TB of the MAC PDU at the physical layer is erroneous, multiple I frames will be erroneous, and the physical layer cannot distinguish which I frame data is erroneous. In the related art, when an I frame and other types of frames correspond to a MAC PDU, the problem that the physical layer TB of the MAC PDU is erroneous and causes the above-mentioned I frame to fail also occurs, and the physical layer cannot distinguish whether the I frame data is erroneous or the data of other types of frames sent together with the I frame is erroneous. In the related art, when an I frame corresponds to multiple MAC PDUs, the I frame data needs to be transmitted on multiple time slots at the physical layer, and if a TB corresponding to a MAC PDU is erroneous, the entire I frame is erroneous, and the erroneous TB needs to be transmitted at the next cycle time of the same HARQ process. The above-mentioned situation also occurs for P frames and B frames. It can be seen that the related art causes a decrease in data rate and an increase in transmission delay for XR video frames. Moreover, it needs to be seen that since the I frame is very important, if the I frame cannot be successfully acquired in time, the service experience will be seriously affected.

[0232] In summary, the related art has the problem that key data transmission is difficult to achieve low latency, large throughput, and high reliable transmission, resulting in poor service experience. In the embodiments of the present disclosure, the data of an entire I frame is mapped into k first type TBs (also referred to as TB system packets, TB source packets, or TB original packets) of a TB set on one time slot, and the k first type TBs are packet encoded to generate second type TBs (also referred to as TB check packets or TB redundant packets) that can recover error TB system packets. In this way, since multiple TBs can be carried on one TTI, the present disclosure ensures that the entire I frame can be transmitted in a shorter time, and the reliability of the TB system packets can be improved through packet encoding and decoding, thereby improving the transmission efficiency of the key data and further improving the service experience. In some embodiments, one P frame or B frame can also be transmitted corresponding to one TB set, thereby improving the data throughput and reliability of the P frame or B frame, and further improving the service experience.

[0233] Exemplarily, in a coverage limited scenario, since the channel condition of the edge user is very poor, the scheduling opportunity is less, and it is difficult to transmit a large TB even in the case of very sufficient bandwidth resources. This makes the edge user have poor service experience for large data volume service transmission such as XR. Using the technical solutions provided by the present disclosure, a large upper layer key data packet is divided into multiple small TBs (TB source packets), and transmitted in a TB set on one TTI, and the overall submission of the TB set is performed after the transmission of all TB source packets of the TB set is successful, thereby realizing the physical layer data of one upper layer key data packet to be submitted upward. Further, the edge user can generate TB check packets (TB redundant packets) by packet encoding the small TBs, and use the TB check packets to recover the TB source packets when the TB source packets are transmitted in error. Further, the edge user selects the TB to be transmitted each time in the TB set according to real-time information (such as channel state, available frequency resources, UE capability, etc.) to match the wireless environment and better utilize the bandwidth resources. For example, the number of TBs to be transmitted is different each time the TB set is transmitted according to the bandwidth resources that can be scheduled. For example, when the TB set is retransmitted, a certain number of TB check packets are transmitted to recover the TB source packets transmitted in error. For example, the scheduling opportunity of the TB set is increased by controlling the TB size (such as using a smaller TB). For example, the data transmission throughput is improved by fully utilizing frequency selectivity in the TB set and using different MCSs for the transmitted TBs. For example, the success rate of TB transmission in the TB set is increased by dynamically adjusting the MCS and the number of TBs transmitted each time. Through the technical solutions provided by the present disclosure, the transmission resources can be fully utilized, the scheduling opportunity and the data transmission success rate of the edge user are increased, the transmission efficiency is improved, and the service experience of the edge user is improved.

[0234] The technical solutions provided by the present disclosure can also be applied to various scenarios with high requirements for data throughput and / or integrity.

[0235] For example, in remote medical diagnosis, remote medical image transmission is required. When transmitting high-resolution medical images, the absence or damage of any one pixel can lead to diagnostic errors. The scheme of using TB set transmission and overall submission can ensure the complete recovery of image data. In particular, TB set transmission uses TB check packets to recover TB source packets, enhancing error recovery capability and improving the probability of complete recovery of image data. For example, in the AI scenario, a complete AI model file parameter transmission is required, and the amount of AI data to be transmitted is very large. If there is a small amount of data error during transmission, the model will be inaccurate or even invalid. Therefore, the model parameter file can be regarded as a key data packet that needs to be transmitted in a timely and complete manner. For example, for large software update package files, it is necessary to ensure one-time complete transmission to avoid multiple downloads. For example, in industrial automation control, there are very high requirements for the reliability and latency of instruction data. For example, in the Internet of Vehicles, high-precision map data needs to be transmitted in a timely, complete and accurate manner. For example, in the financial field, there are sensitive data packets that need to ensure the timely and complete transmission of highly secure and timely financial transaction data packets. For example, in the context of natural disasters or emergency rescue, key instructions and information are transmitted to ensure that emergency communication data are immediately delivered and accurately transmitted. Based on the TB set overall submission mechanism and retransmission enhancement measures in the technical solutions provided by the present disclosure, data transmission can be guaranteed in different business scenarios in different fields.

[0236] It can be understood that the communication device includes hardware structures and / or software modules corresponding to the implementation of each function in order to achieve the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in hardware or computer software driven hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present disclosure.

[0237] The embodiments of the present disclosure can divide the functional modules of the communication device according to the above-mentioned method embodiments. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one functional module. The integrated module can be realized in the form of hardware or software. It should be noted that the division of modules in the embodiments of the present disclosure is illustrative, and is only a logical functional division. Actual implementation can have another division manner. The following will be described taking the division of each functional module corresponding to each function as an example.

[0238] For example, taking the communication device as the first network element in the above method embodiment, FIG. 20 is a structural diagram of a first network element 200 according to an embodiment of the present disclosure. The first network element 200 can perform the communication method provided by the above method embodiment. As shown in FIG. 20, the first network element 200 includes a processing unit 2001 and a communication unit 2002.

[0239] The processing unit 2001 is configured to: correspond one upper layer key data packet to k first type TBs of a TB set, the TB set includes at least k TBs, and the at least k TBs include the k first type TBs, the data of the first type TBs comes from the upper layer, and k is an integer greater than 1.

[0240] The communication unit 2002 is configured to: map the plurality of TBs of the TB set on a physical channel, and send the plurality of TBs of the TB set to a second network element.

[0241] In some embodiments, the sizes of the k first type TBs are equal.

[0242] In some embodiments, the at least k TBs further include m second type TBs, the first type TBs are TB original packets without packet encoding processing, and the second type TBs are TB check packets generated by packet encoding processing on the k first type TBs. The TB check packets are used for error recovery on the TB original packets, and m is a positive integer.

[0243] In some embodiments, the processing unit 2001 is configured to segment the upper layer key data packet to obtain k MAC PDUs. The k MAC PDUs correspond to the k first type TBs, and one MAC PDU corresponds to one first type TB.

[0244] 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 resource, terminal capability, scheduling request, service requirement, service type, scene information, the number k of the first type TBs, scheduling information, and TB size that can be transmitted by the physical layer. The processing unit 2001 is configured to segment the upper layer key data packet to obtain the k MAC PDUs according to the size of each MAC PDU.

[0245] In some embodiments, the communication unit 2002 is configured to receive feedback information from the second network element. The feedback information comprises at least one of: feedback information indicating that a TB set transmission is successful, the TB set transmission being successful if the second network element has successfully obtained the k first type TBs; feedback information indicating that the TB set transmission is unsuccessful, the TB set transmission being unsuccessful if the second network element has not successfully obtained at least one of the k first type TBs; and feedback information for each TB of a plurality of TBs, the feedback information for each TB indicating whether the second network element has successfully obtained the corresponding TB.

[0246] In some embodiments, the processing unit 2001 is configured to: determine to end the transmission of the TB set if the feedback information indicating that the TB set transmission is successful is received; determine to end the transmission of the TB set if the feedback information indicating that the TB set transmission is unsuccessful is received and the number of times of transmission of the TB set reaches a maximum number of transmissions; and determine to retransmit the TB set if the feedback information indicating that the TB set transmission is unsuccessful is received and the number of times of transmission of the TB set does not reach the maximum number of transmissions.

[0247] In some embodiments, the processing unit 2001 is configured to perform at least one of: emptying all caches of the TB set; resetting all information of the TB set; and starting transmission of a new TB set, the new TB set corresponding to a new upper layer key data packet.

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

[0249] In some embodiments, the scheduling information comprises at least one of: a TB set identifier corresponding to the TB set; transmission resource location information corresponding to the TB set; a number of resource elements (REs) corresponding to the TB set; a common modulation and coding scheme (MCS) corresponding to the TB set, the common MCS being used to indicate that the TBs in the TB set are transmitted using a same MCS; a number of common spatial multiplexing layers corresponding to the TB set, the number of common spatial multiplexing layers being used to indicate that the TBs in the TB set are transmitted using a same number of spatial multiplexing layers; a code word index used by the TBs in the TB set; a TB mapping rule; transmission resource location information corresponding to each of the TBs currently transmitted in the TB set; a number of REs corresponding to each of the TBs currently transmitted in the TB set; an MCS used by each of the TBs currently transmitted in the TB set; a number of spatial multiplexing layers used by each of the TBs currently transmitted in the TB set; a packet encoding algorithm used by the TB set; a calculation method of a size of a first type of TB; the size of the first type of TB; a number k of the first type of TBs in the TB set; a number m of a second type of TBs in the TB set; a number of the TBs currently transmitted in the TB set; an index of each of the TBs currently transmitted in the TB set; a packet encoding vector index of each of the TBs currently transmitted in the TB set; and a type indication of each of the TBs currently transmitted in the TB set, the type indication being used to indicate the first type of TB or the second type of TB. The first type of TB is a TB original packet without packet encoding processing, and the second type of TB is a TB check packet generated by packet encoding processing of the k first type of TBs; the TB check packet is used for error recovery of the TB original packet.

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

[0251] In some embodiments, the k TBs sent to the second network element correspond to a same code word.

[0252] In some embodiments, the processing unit 2001 is configured to: obtain second information, the second information comprising a number of REs corresponding to the TB set, a common MCS corresponding to the TB set, a number of common spatial multiplexing layers corresponding to the TB set, and a number of the first type of TBs in the TB set; and determine the size of the first type of TB based on the second information.

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

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

[0255] wherein t TB represents the size of the first type of TB, t represents the total size of the TB set, and k represents the number of the first type of TB.

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

[0257] wherein t TB represents the size of the first type of TB, t represents the total size of the TB set, and k represents the number of the first type of TB. represents a ceiling operator.

[0258] Alternatively, the number of REs allocated to each first type of TB satisfies the following formula:

[0259] wherein represents the number of REs allocated to each first type of TB, N RE represents the number of REs corresponding to the TB set, and k represents the number of the first type of TB.

[0260] Alternatively, the number of REs allocated to each first type of TB satisfies the following formula:

[0261] wherein represents the number of REs allocated to each first type of TB, N RE represents the number of REs corresponding to the TB set, and k represents the number of the first type of TB. represents a floor operator.

[0262] 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, an RRC message, and a TB mapping table.

[0263] In some embodiments, the communication unit 2002 is configured to transmit, to the second network element, a plurality of TBs of a TB set on one transmission unit. The transmission unit includes at least one of a transmission time interval (TTI), a slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

[0264] In some embodiments, the upper-layer key data packet includes, but is not limited to, one of a data packet corresponding to one PDU set, a video coding key frame, a video coding frame, an artificial intelligence (AI) model data file, a parameter file in an AI model, a software update package, a medical image data packet, a geographic information system (GIS) update file, a financial transaction sensitive information packet, and an emergency communication key information packet.

[0265] For example, the communication device is taken as the second network element in the above method embodiments. FIG. 21 is a structural diagram of a second network element 210 according to an embodiment of the present disclosure. The second network element 210 can perform the communication method provided by the above method embodiments. As shown in FIG. 21, the second network element 210 includes a processing unit 2101 and a communication unit 2102.

[0266] The communication unit 2102 is configured to receive, from the first network element, a plurality of TBs of a TB set on one physical channel. The TB set includes at least k TBs, and the at least k TBs include k first-type TBs. The k first-type TBs of the TB set correspond to one upper-layer key data packet. The first-type TB is a TB that needs to be submitted to the upper layer. k is an integer greater than 1.

[0267] The processing unit 2101 is configured to, in a case where the k first-type TBs of the TB set are all successfully acquired, perform a TB submission operation to the upper layer. The TB submitted to the upper layer is the k first-type TBs of the TB set.

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

[0269] In some embodiments, the at least k TBs further include m second-type TBs. The first-type TB is a TB original packet that is not subjected to packet encoding processing. The second-type TB is a TB check packet generated by packet encoding processing on the k first-type TBs. The TB check packet is used for error recovery on the TB original packet. m is a positive integer.

[0270] In some embodiments, each first-type TB corresponds to one media access control (MAC) protocol data unit (PDU).

[0271] In some embodiments, the processing unit 2101 is configured to, after submitting the k first-type TBs to the upper layer, recombine the k first-type TBs into one data packet. The data packet corresponds to the upper-layer key data packet.

[0272] In some embodiments, the communication unit 2102 is configured to send feedback information to the first network element. The feedback information comprises at least one of: feedback information indicating that the transmission of the TB set is successful, the transmission of the TB set being successful if the second network element has successfully obtained the k first type TBs; feedback information indicating that the transmission of the TB set is unsuccessful, the transmission of the TB set being unsuccessful if the second network element has not successfully obtained at least one of the k first type TBs; and feedback information for each of the plurality of TBs, the feedback information for each of the plurality of TBs indicating whether the corresponding TB is successfully obtained by the second network element.

[0273] In some embodiments, the processing unit 2101 is configured to: channel decode the first type TBs in the plurality of TBs. The processing unit 2101 is configured to determine whether the k first type TBs are successfully obtained. The processing unit 2101 is configured to, in a case that at least one of the k first type TBs is not successfully obtained and there is a second type TB in the plurality of TBs, channel decode the second type TB in the plurality of TBs. The processing unit 2101 is configured to, in a case that at least one of the k first type TBs is not successfully obtained and there is a second type TB in the plurality of TBs whose channel decoding is successful, obtain the TB that is not successfully obtained in the k first type TBs based on the successfully obtained TBs in the k first type TBs and the second type TB in the plurality of TBs whose channel decoding is successful, and perform a corresponding decoding operation on the successfully obtained TBs in the k first type TBs and the second type TB in the plurality of TBs whose channel decoding is successful to obtain the TB that is not successfully obtained in the k first type TBs. The first type TB is a TB original packet that is not processed by packet encoding, and the second type TB is a TB check packet generated by packet encoding processing on the k first type TBs; the TB check packet is used for error recovery of the TB original packet.

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

[0275] In some embodiments, the scheduling information comprises at least one of: a TB set identifier corresponding to the TB set; transmission resource location information corresponding to the TB set; a number of resource elements (REs) corresponding to the TB set; a common modulation and coding scheme (MCS) corresponding to the TB set, the common MCS being used to indicate that the TBs in the TB set are transmitted using a same MCS; a number of common spatial multiplexing layers corresponding to the TB set, the number of common spatial multiplexing layers being used to indicate that the TBs in the TB set are transmitted using a same number of spatial multiplexing layers; a code word index used by the TBs in the TB set; a TB mapping rule; transmission resource location information corresponding to each of the TBs currently transmitted in the TB set; a number of REs corresponding to each of the TBs currently transmitted in the TB set; an MCS used by each of the TBs currently transmitted in the TB set; a number of spatial multiplexing layers used by each of the TBs currently transmitted in the TB set; a packet encoding algorithm used by the TB set; a calculation method of a size of a first type of TB; the size of the first type of TB; a number k of the first type of TBs in the TB set; a number m of a second type of TBs in the TB set; a number of the TBs currently transmitted in the TB set; an index of each of the TBs currently transmitted in the TB set; a packet encoding vector index of each of the TBs currently transmitted in the TB set; and a type indication of each of the TBs currently transmitted in the TB set, the type indication being used to indicate the first type of TB or the second type of TB. The first type of TB is a TB original packet that is not processed by a packet encoding, and the second type of TB is a TB check packet generated by packet encoding of the k first type of TBs; the TB check packet is used for error recovery of the TB original packet.

[0276] In some embodiments, the scheduling information is obtained by at least one of: channel state information (CSI), downlink control information (DCI), a radio resource control (RRC) message, and a medium access control-control element (MAC CE).

[0277] In some embodiments, the k TBs received correspond to a same code word.

[0278] In some embodiments, the processing unit 2101 is configured to: obtain second information, the second information comprising a number of REs corresponding to the TB set, a common MCS corresponding to the TB set, a number of common spatial multiplexing layers corresponding to the TB set, and a number of the first type of TBs in the TB set; and determine the size of the first type of TB based on the second information.

[0279] In some embodiments, the processing unit 2101 is configured to: determine a 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 spatial multiplexing layers corresponding to the TB set; determine the size of the first type of TB based on the total size of the TB set and the number of the first type of TB in the TB set; or determine the number of REs allocated to each first type of TB based on the number of REs corresponding to the TB set and the number of the first type of TB in the TB set; and determine the size of the first type of TB based on the number of REs allocated to each first type of TB, the common MCS corresponding to the TB set, and the number of spatial multiplexing layers corresponding to the TB set.

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

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

[0282] wherein t TB represents the size of the first type of TB, t represents the total size of the TB set, and k represents the number of the first type of TB.

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

[0284] wherein t TB represents the size of the first type of TB, t represents the total size of the TB set, and k represents the number of the first type of TB. represents a rounding up operator.

[0285] Alternatively, the number of REs allocated to each first type of TB satisfies the following formula:

[0286] wherein represents the number of REs allocated to each first type of TB, N RE represents the number of REs corresponding to the TB set, and k represents the number of the first type of TB.

[0287] Alternatively, the number of REs allocated to each first type of TB satisfies the following formula:

[0288] wherein represents the number of REs allocated to each first type of TB, N RE represents the number of REs corresponding to the TB set, and k represents the number of the first type of TB. represents a rounding down operator.

[0289] In some embodiments, the number and / or size of the first type of TBs are determined by at least one of the following: scheduling information, pre-configuration information, RRC message, TB mapping table.

[0290] In some embodiments, the communication unit 2102 is configured to receive a plurality of TBs of a TB set from a first network element in one transmission unit. The transmission unit comprises at least one of the following: transmission time interval (TTI), time slot, mini-slot, hybrid automatic repeat request (HARQ) process.

[0291] In some embodiments, the upper layer critical data packet comprises but is not limited to one of the following: a packet corresponding to a PDU set, a video coding critical frame, a video coding frame, an artificial intelligence (AI) model data file, a parameter file in an AI model, a software update packet, a medical image data packet, a geographic information system (GIS) update file, a financial transaction sensitive information packet, an emergency communication critical information packet.

[0292] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiments of the present disclosure provide another structure of the communication device involved in the above-mentioned embodiments. As shown in FIG. 22, the communication device 220 comprises a processor 2202 and a bus 2204. In some embodiments, the communication device 220 can further comprise a memory 2201. In some embodiments, the communication device 220 can further comprise a communication interface 2203.

[0293] The processor 2202 can be an integrated logic circuit, a module or a circuit described in conjunction with the embodiments of the present disclosure. The processor 2202 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component or any combination thereof. It can implement or execute the various exemplary logic blocks, modules and circuits described in conjunction with the embodiments of the present disclosure. The processor 2202 can also be a combination of computing functions, such as a combination of one or more microprocessors, a combination of a digital signal processor (DSP) and a microprocessor, etc.

[0294] The communication interface 2203 is configured to connect with other devices through a communication network. The communication network can be an Ethernet, a wireless access network, a wireless local area network (WLAN), etc.

[0295] The memory 2201 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to this.

[0296] As an implementation manner, the memory 2201 can exist independently of the processor 2202, and the memory 2201 can be connected to the processor 2202 through the bus 2204, and used to store instructions or program codes. When the processor 2202 invokes and executes the instructions or program codes stored in the memory 2201, the method described in any of the embodiments of the present disclosure can be implemented.

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

[0298] The bus 2204 can be an extended industry standard architecture (EISA) bus or the like. The bus 2204 can be divided into an address bus, a data bus, a control bus, and the like. For the convenience of representation, only one thick line is shown in FIG. 22, but it does not mean that there is only one bus or only one type of bus.

[0299] Some embodiments of the present disclosure provide a computer-readable storage medium (for example, a non-transitory computer-readable storage medium) having computer program instructions stored therein, and the computer program instructions, when executed on a computer, cause the computer to execute the method described in any of the above embodiments.

[0300] By way of example, the computer-readable storage media described above can include, but is not limited to, magnetic storage devices (e.g., hard disk, floppy disk, or magnetic tape), optical storage devices (e.g., compact disk (CD), digital versatile disk (DVD), etc.), smart cards, and flash memory devices (e.g., EPROM, card, stick, or key drive). The various computer-readable storage media described above can represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" shall accordingly be taken to include a single medium or multiple media that store one or more sets of instructions that when executed by a machine cause the machine to perform any one of the methodologies described herein.

[0301] The embodiments of the present disclosure provide a computer program product containing instructions, which, when the computer program product is run on a computer, cause the computer to execute the method described in any one of the above embodiments.

[0302] The above description is merely illustrative of the disclosure and does not limit the scope of the disclosure. Any variations or replacements within the technical scope of the disclosure should be encompassed in the scope of the disclosure. Therefore, the disclosure should be limited only by the scope of the claims.

Claims

1. A communication method, performed by a first network element, comprising: corresponding upper layer critical data packets to k first type transport blocks (TBs) of a TB set; the TB set comprises at least k TBs and the at least k TBs include the k first type TBs, data of the first type TBs is from the upper layer, and the k is an integer greater than 1; mapping a plurality of TBs of the TB set on a physical channel and transmitting the plurality of TBs of the TB set to a second network element.

2. The method of claim 1, wherein, The k first type TBs are equal in size.

3. The method of claim 1, wherein, The at least k TBs further include m second type TBs, the first type TBs are TB original packets without packet encoding processing, and the second type TBs are TB check packets generated by packet encoding processing on the k first type TBs; The TB check packets are used for error recovery on the TB original packets, and the m is a positive integer.

4. The method of claim 1, wherein, The corresponding upper layer critical data packets to the k first type TBs of the TB set comprises: segmenting the upper layer critical data packets to obtain k media access control (MAC) protocol data units (PDUs), wherein the k MAC PDUs correspond to the k first type TBs, and one MAC PDU corresponds to one first type TB.

5. The method of claim 4, wherein, The segmenting the upper layer critical data packets to obtain the k MAC PDUs comprises: determining a size of each of the k MAC PDUs based on first information, wherein the first information comprises at least one of a channel quality indicator, channel state information, available transmission resources, terminal capability, a scheduling request, service demand, service type, scenario information, the number k of first type TBs, scheduling information, and a TB size that can be transmitted by a physical layer; segmenting the upper layer critical data packets according to the size of each of the k MAC PDUs to obtain the k MAC PDUs. 6.The method of claim 1, further comprising: receiving feedback information from the second network element, wherein the feedback information comprises at least one of: feedback information indicating that transmission of the TB set is successful, wherein the transmission of the TB set being successful means that the second network element has successfully obtained the k first type TBs; feedback information indicating that transmission of the TB set is unsuccessful, wherein the transmission of the TB set being unsuccessful means that the second network element has not successfully obtained at least one of the k first type TBs; feedback information of each of the plurality of TBs, wherein the feedback information of each of the TBs indicates whether the second network element has successfully obtained the corresponding TB. 7.The method of claim 6, further comprising one of: determining to end transmission of the TB set in a case where the feedback information indicating that the transmission of the TB set is successful is received; determining to end transmission of the TB set in a case where the feedback information indicating that the transmission of the TB set is unsuccessful is received and a number of times of transmission of the TB set has reached a maximum number of times of transmission. determining to retransmit the TB set upon receiving feedback information characterizing a failure of the TB set transmission and a number of transmissions of the TB set not reaching a maximum number of transmissions.

8. The method of claim 7, wherein, In a case where it is determined to end the transmission of the TB set, the method further comprises at least one of: emptying all buffers of the TB set; resetting all information of the TB set; starting transmission of a new TB set, the new TB set corresponding to a new upper layer key data packet.

9. The method of claim 1, further comprising at least one of: acquire scheduling information of the TB set, wherein, scheduling information of the TB set being used to schedule the transmission of the TB set; determining a number of the first type TBs; determining a size of the first type TBs; determining a number of TBs of the TB set being currently transmitted; determining a number of the first type TBs of the TB set being currently transmitted; determining a number of the second type TBs of the TB set being currently transmitted, the second type TBs being TB check packets obtained after using packet encoding on the k first type TBs, the TB check packets being used for error recovery of the first type TBs; determining a transmission resource space being currently used for the transmission of the TB set, the transmission resource space being a transmission resource available for the transmission of the TB set; determining a transmission resource used by each TB of the TB set being currently transmitted.

10. The method of claim 9, wherein, the scheduling information comprising at least one of: a TB set identifier corresponding to the TB set; transmission resource location information corresponding to the TB set; a number of resource elements (REs) corresponding to the TB set; a common modulation and coding scheme (MCS) corresponding to the TB set, the common MCS being used to indicate that the TBs in the TB set are transmitted using a same MCS; a common number of spatial multiplexing layers corresponding to the TB set, the common number of spatial multiplexing layers being used to indicate that the TBs in the TB set are transmitted using a same number of spatial multiplexing layers; a code word index used by the TBs in the TB set for transmission; a TB mapping rule; transmission resource location information corresponding to each of the TBs being currently transmitted in the TB set; a number of REs corresponding to each of the TBs being currently transmitted in the TB set; a MCS used by each of the TBs being currently transmitted in the TB set for transmission; a number of spatial multiplexing layers used by each of the TBs being currently transmitted in the TB set for transmission; a packet encoding algorithm used by the TB set; a calculation method of the size of the first type TBs; the size of the first type TBs; a number k of the first type TBs in the TB set; a number m of the second type TBs in the TB set; a number of TBs being currently transmitted in the TB set; an index of each of the TBs being currently transmitted in the TB set; a packet encoding vector index of each of the TBs being currently transmitted in the TB set; a type indication of each of the TBs being currently transmitted in the TB set, the type indication being used to indicate a first type TB or a second type TB. The first type of TB is a TB original packet without package encoding processing, and the second type of TB is a TB check packet generated by package encoding processing on the k first type of TBs. The TB check packet is used for error recovery of the TB original packet.

11. The method of claim 9, wherein, The scheduling information is obtained by at least one of the following: Channel state information (CSI), downlink control information (DCI), radio resource control (RRC) messages, and medium access control-control element (MAC CE).

12. The method of claim 1, wherein, The number and / or size of the first type of TBs are determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and a TB mapping table.

13. The method of claim 1, wherein, The sending of the plurality of TBs of the TB set to the second network element includes: The sending of the plurality of TBs of the TB set to the second network element on a transmission unit, wherein the transmission unit includes at least one of the following: a transmission time interval (TTI), a time slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

14. The method of claim 1, wherein, The upper layer key data packet includes one of the following: a data packet corresponding to a PDU set, a video encoding key frame, a video encoding frame, an artificial intelligence (AI) model data file, a parameter file in an AI model, a software update packet, a medical image data packet, a geographic information system (GIS) update file, a financial transaction sensitive information packet, and an emergency communication key information packet.

15. A communication method, performed by a second network element, comprising: receiving, on a physical channel, a plurality of TBs of a TB set from a first network element; The TB set includes at least k TBs, and the at least k TBs include k first type of TBs, the k first type of TBs of the TB set correspond to an upper layer key data packet, the first type of TB is a TB that needs to be submitted to the upper layer, and the k is an integer greater than 1; In the case where all the k first type of TBs of the TB set are successfully obtained, performing an operation of submitting TBs to the upper layer, and the TBs submitted to the upper layer are the k first type of TBs of the TB set.

16. The method of claim 15, wherein, The sizes of the k first type of TBs are equal.

17. The method of claim 15, wherein, The at least k TBs further include m second type of TBs, the first type of TB is a TB original packet without package encoding processing, and the second type of TB is a TB check packet generated by package encoding processing on the k first type of TBs. The TB check packet is used for error recovery of the TB original packet, and the m is a positive integer.

18. The method of claim 15, wherein, Each of the k first type of TBs corresponds to a medium access control (MAC) protocol data unit (PDU).

19. The method of claim 15, wherein, The operation of submitting TBs to the upper layer includes: After the k first type of TBs are submitted to the upper layer, the k first type of TBs are recombined into a data packet, and the data packet corresponds to the upper layer key data packet.

20. The method of claim 15, further comprising: sending feedback information to the first network element, wherein the feedback information includes at least one of the following: feedback information used to indicate that the transmission of the TB set is successful, wherein the transmission of the TB set is successful means that the second network element has successfully obtained the k first type of TBs; feedback information for characterizing a failure of the TB set transmission, the failure of the TB set transmission being that the second network element fails to successfully acquire at least one of the k first type TBs; feedback information for each of the plurality of TBs, the feedback information for each of the plurality of TBs being for characterizing whether the second network element successfully acquires the corresponding TB. 21.The method of claim 15, further comprising: channel decoding first type TBs in the plurality of TBs; determining whether the k first type TBs have been successfully acquired; in a case where there is at least one of the k first type TBs that has not been successfully acquired and there is a second type TB in the plurality of TBs, channel decoding the second type TB in the plurality of TBs; in a case where there is at least one of the k first type TBs that has not been successfully acquired and there is a second type TB in the plurality of TBs that has been successfully channel decoded, performing a corresponding decoding operation based on the successfully acquired TBs of the k first type TBs and the successfully channel decoded second type TB in the plurality of TBs to acquire the TB that has not been successfully acquired in the k first type TBs; wherein the first type TB is a TB original packet that has not been processed by a packet encoding, and the second type TB is a TB check packet generated by processing the k first type TBs by the packet encoding; the TB check packet is used for error recovery of the TB original packet. 22.The method of claim 15, further comprising at least one of: acquiring scheduling information of the TB set, the scheduling information of the TB set being used for scheduling TBs transmitted in the TB set; determining a number of the first type TBs; determining a size of the first type TBs.

23. The method of claim 22, wherein, the scheduling information comprises at least one of: a TB set identifier corresponding to the TB set; transmission resource location information corresponding to the TB set; a number of resource elements (REs) corresponding to the TB set; a common modulation and coding scheme (MCS) corresponding to the TB set, the common MCS being used to indicate that TBs in the TB set are transmitted using a same MCS; a number of common spatial multiplexing layers corresponding to the TB set, the number of common spatial multiplexing layers being used to indicate that TBs in the TB set are transmitted using a same number of spatial multiplexing layers; a code word index used by TBs in the TB set for transmission; a TB mapping rule; transmission resource location information corresponding to each of the TBs currently transmitted in the TB set; a number of REs corresponding to each of the TBs currently transmitted in the TB set; an MCS used by each of the TBs currently transmitted in the TB set for transmission; a number of spatial multiplexing layers used by each of the TBs currently transmitted in the TB set for transmission; a packet encoding algorithm used by the TB set; a calculation method of a size of the first type TBs; the size of the first type TBs; a number k of the first type TBs in the TB set; a number m of the second type TBs in the TB set; a number of TBs currently transmitted in the TB set; an index of each of the TBs currently transmitted in the TB set. a packet encoding vector index of each TB currently transmitted by the TB set; a type indication of each TB currently transmitted by 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 a TB original packet without packet encoding processing, and the second type TB is a TB check packet generated by packet encoding processing on the k first type TBs; the TB check packet is used for error recovery of the TB original packet.

24. The method of claim 22, wherein, the scheduling information is obtained by at least one of the following: channel state information (CSI), downlink control information (DCI), radio resource control (RRC) messages, and medium access control-control element (MAC CE).

25. The method of claim 15, wherein, the number and / or size of the first type TBs are determined by at least one of the following: scheduling information, pre-configuration information, RRC messages, and a TB mapping table.

26. The method of claim 15, wherein, the receiving, on the physical channel, the multiple TBs of the TB set from the first network element includes: receiving, on a transmission unit, the multiple TBs of the TB set from the first network element, the transmission unit including at least one of the following: a transmission time interval (TTI), a slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

27. The method of claim 15, wherein, the upper layer key data packet includes one of the following: a data packet corresponding to a PDU set, a video encoding key frame, a video encoding frame, an artificial intelligence (AI) model data file, a parameter file in an AI model, a software update packet, a medical image data packet, a geographic information system (GIS) update file, a financial transaction sensitive information packet, and an emergency communication key information packet.

28. A communications device comprising: a memory and a processor; wherein the memory is coupled to the processor; the memory is configured to store instructions executable by the processor; and the processor is configured to execute the instructions to perform the method according to any one of claims 1 to 14, or perform the method according to any one of claims 15 to 27.

29. A computer readable storage medium, wherein, The computer readable storage medium stores computer instructions, when the computer instructions are run on a computer, the computer is caused to execute the method according to any one of claims 1 to 14, or execute the method according to any one of claims 15 to 27.

30. A computer program product, wherein, The computer program product includes computer program instructions, when the computer program instructions are executed by a processor, the method according to any one of claims 1 to 14 is implemented, or the method according to any one of claims 15 to 27 is executed.

Images