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 method comprises: mapping n transport blocks (TBs) onto one physical channel, wherein the n TBs are from one TB set, and the n TBs comprise at least one second-type TB, the at least one second-type TB being obtained by means of performing packet encoding on k first-type TBs, each of the k first-type TBs corresponding to an upper-layer protocol data unit (PDU), and both n and k being integers greater than 1; and sending the n TBs to a second network element.

Description

Communication method, apparatus, storage medium and program product

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

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

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

[0004] In one aspect, a communication method is provided, performed by a first network element, comprising:

[0005] mapping n transport blocks (TBs) onto one physical channel, the n TBs being from a TB set and including at least one second type TB, the at least one second type TB being obtained by packet encoding k first type TBs, each of the k first type TBs corresponding to one upper layer protocol data unit (PDU), and the n and the k being integers greater than 1.

[0006] sending the n TBs to a second network element.

[0007] In another aspect, another communication method is provided, performed by a second network element, comprising:

[0008] receiving n transport blocks (TBs) from a first network element on one physical channel, the n TBs being from a TB set and including at least one second type TB, the at least one second type TB being obtained by packet encoding k first type TBs, each of the k first type TBs corresponding to one upper layer protocol data unit (PDU), and the n and the k being integers greater than 1.

[0009] In yet another aspect, a communication apparatus is provided, comprising a processing unit and a communication unit.

[0010] The processing unit is configured to map n transport blocks (TBs) onto one physical channel, wherein the n TBs are from a TB set and the n TBs include at least one second type TB, the at least one second type TB is obtained by packet encoding k first type TBs, each of the k first type TBs corresponds to one upper layer protocol data unit (PDU), and n and k are integers greater than 1.

[0011] The communication unit is configured to send the n TBs to a second network element.

[0012] In another aspect, a communication apparatus is provided, which includes a processing unit and a communication unit.

[0013] The communication unit is configured to receive n transport blocks (TBs) from a first network element on one physical channel, wherein the n TBs are from a TB set and the n TBs include at least one second type TB, the at least one second type TB is obtained by packet encoding k first type TBs, each of the k first type TBs corresponds to one upper layer protocol data unit (PDU), and n and k are integers greater than 1.

[0014] In another aspect, a communication apparatus is provided, which includes a memory and a processor; the memory and the processor are coupled; the memory is configured to store a computer program; and the processor is configured to implement any of the above methods when executing the computer program.

[0015] In another aspect, a computer readable storage medium is provided, which stores computer program instructions, and the computer program instructions are configured to implement any of the above methods when executed by a processor.

[0016] In another aspect, a computer program product is provided, which includes computer program instructions, and the computer program instructions are configured to implement any of the above methods when executed by a processor. BRIEF DESCRIPTION OF DRAWINGS

[0017] 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 description are only some drawings of the present disclosure, and other drawings can also be obtained by those skilled in the art based on these drawings.

[0018] FIG. 1 is a structure diagram of a TB transmission according to some embodiments of the present disclosure.

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

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

[0021] FIG. 4 is a structure diagram of a TB set according to some embodiments of the present disclosure.

[0022] FIG. 5 is a structure diagram of a TB set transmission according to some embodiments of the present disclosure.

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

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

[0025] FIG. 8 is a structure diagram of a TB set transmission in frequency domain according to some embodiments of the present disclosure.

[0026] FIG. 9 is a structure diagram of a TB set transmission in time domain according to some embodiments of the present disclosure.

[0027] FIG. 10 is a structure diagram of a TB set transmission in time-frequency domain according to some embodiments of the present disclosure.

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

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

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

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

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

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

[0034] FIG. 17 is a structure diagram of a TB set transmission in dual-codeword stream according to some embodiments of the present disclosure.

[0035] FIG. 18 is a structure diagram of a first network element according to some embodiments of the present disclosure.

[0036] FIG. 19 is a structure diagram of a second network element according to some embodiments of the present disclosure.

[0037] FIG. 20 is a structure diagram of a communication apparatus according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0038] In the following, the technical solutions in the present disclosure will be described clearly and completely with reference to the drawings in the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all the other embodiments obtained by those of ordinary skill in the art without creative work fall within the protection scope of the present disclosure.

[0039] It should be noted that in the present disclosure, the words "exemplary" or "for example" are used to mean "an example of" or "an example, only. Any embodiment or design solution described as "exemplary" or "for example" in the present disclosure should not be interpreted as being more preferred or having any advantage over other embodiments or design solutions. In fact, the use of the words "exemplary" or "for example" is intended to present the relevant concept in an exemplary manner.

[0040] Hereinafter, the terms "first", "second", and the like are used only for the purpose of description, and should not be understood as indicating or implying relative importance or implicitly indicating the number of the technical features indicated. Therefore, the features defined with "first", "second", and the like can explicitly or implicitly include one or more of the features.

[0041] 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 a description of 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.

[0042] It can be understood that, without conflict, the functions, steps, etc. shown in the present disclosure can occur in an order different from that shown in the present disclosure, and there can be other functions, steps, etc. between any two adjacent functions, steps, etc. shown in the present disclosure.

[0043] With the improvement of communication technology and the continuous enrichment of service types, related services have higher requirements for the performance of communication, such as holographic communication, extended reality (XR) and other services requiring communication performance to simultaneously meet ultra-high throughput and ultra-low latency. Such services combine the characteristics of two scenarios of enhanced mobile broadband (eMBB) and ultra-reliable and low latency communication (URLLC), not only having extremely high requirements for throughput, but also having very high requirements for latency. For future-oriented communication systems, the application of artificial intelligence (AI), perception and big data will also bring large data volume information transmission requirements.

[0044] 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, the probability of transmission failure and transmission delay will also increase accordingly, resulting in low data transmission efficiency.

[0045] Exemplarily, as shown in FIG. 1, for each code word, each hybrid automatic repeat request (HARQ) process only processes one TB in one transmission time interval (TTI), and each TB is mapped to an antenna for transmission after channel coding, modulation and other physical layer operations.

[0046] Each TB has a cyclic redundancy check (CRC), and 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 TB size (TBS) is too large, any CRC check failure will cause the entire TB to fail, making it difficult to meet the demand for large throughput, low latency and high reliability. At the same time, each retransmission of the TB will occupy more air interface resources and larger cache, and cause larger transmission delay, thus resulting in low data transmission efficiency.

[0047] In view of this, in the technical solution provided in the present disclosure, the first network element maps n TBs onto one physical channel and sends the n TBs to the second network element. In this way, the present disclosure can improve transmission efficiency by transmitting n TBs at a time, and if there is a TB that fails to be transmitted among the n TBs, the TB that fails to be transmitted does not affect other TBs that are successfully transmitted among the n TBs. Since the TBs that are successfully transmitted do not need to be retransmitted, the amount of data that needs to be retransmitted is reduced. Furthermore, the first type of TB among the TBs that are successfully transmitted can be independently submitted to the upper layer at the receiving end. In addition, the n TBs come from a TB set and include at least one second type of TB among the n TBs, and the second type of TB is obtained by packet encoding k first type of TBs, each first type of TB corresponds to one upper layer protocol data unit (PDU), and n and k are integers greater than 1. That is, the first type of TB can carry the data of the upper layer PDU (for example, one first type of TB corresponds to one MAC PDU), and the second type of TB can be used to recover the first type of TB. Therefore, after receiving the n TBs, the second network element can perform corresponding decoding operations based on the second type of TB to recover the failed first type of TB, further improving the reliability of data transmission, thereby improving the data transmission efficiency.

[0048] The network architecture of the mobile communication network (including but not limited to 3G, 4G, 5G and future mobile communication networks) in the embodiments of the present disclosure can at least include a first network element and a second network element. It should be understood that in the present example, the first network element can be a network side device (including but not limited to a base station, for example) in the downlink, and the second network element can be a terminal side device (including but not limited to a terminal, for example). 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 (including but not limited to a MAC layer, for example) 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.

[0049] Exemplarily, as shown in FIG. 2, a communication system provided in the embodiments of the present disclosure includes a base station 201 and a terminal 202. The base station 201 and the terminal 202 can be one or more, and the number is not limited.

[0050] The base station 201 is an access network side device in the above communication system, and has a wireless transceiver function or a chip or chip system that can be arranged in the device. The base station 201 includes but is not limited to: an access point (AP) in a WiFi system, such as a home gateway, a router, a server, a switch, a bridge, and the like; 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 (for example, a home evolved NodeB, or a home NodeB, HNB); a baseband unit (BBU); a wireless relay node; a wireless backhaul node (for example, an integrated access and backhaul (IAB) node); a transmission and reception point (TRP) or a transmission point (TP); and the like. The base station 201 can also be a 5G base station, such as a gNB in a new radio (NR) system, or a transmission point (TRP or TP), one or a group of (including multiple antenna panels) antenna panels of a base station in a 5G system, or a network node constituting a gNB or a transmission point, such as a baseband unit (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, and the like. The base station 201 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 201 also includes different types, such as ground base stations, air base stations, and satellite base stations, and the like.

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

[0052] In some embodiments, for downlink transmission, the base station 201 can send multiple TBs of a TB set to the terminal 202, and correspondingly, the terminal 202 receives multiple TBs of the TB set from the base station 201. For uplink transmission, the terminal 202 can send multiple TBs of a TB set to the base station 201, and correspondingly, the base station 201 receives multiple TBs of the TB set from the terminal 202. In a cellular network, whether it is uplink transmission data or downlink transmission data, the scheduling decision of the TB is made by the base station 201. The base station 201 sends scheduling information to the terminal 202, thereby instructing the terminal 202 to send data or receive data.

[0053] The multiple TBs can include TB original packets for carrying upper layer data, and can also include TB redundant packets (also referred to as TB check packets) for error recovery of the TB original packets.

[0054] In some embodiments, the base station 201 or the terminal 202 can generate TBs for error recovery through packet encoding. Packet encoding, also known as network encoding, is a technology for improving network throughput and data reliability. Generally, this type of encoding technology is referred to as network encoding. 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 data based on the integration method.

[0055] The encoding types of packet encoding include linear packet encoding and nonlinear packet encoding. Taking linear packet encoding as an example, a new transmission 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 transmission 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 transmission blocks, and the receiving end can recover another failed transmission block as long as any two transmission blocks are successfully received (e.g., 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 characteristic of the fountain code is 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 are obtained after packet encoding (including k TB original packets and m check packets), 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 referred to or referenced, for example, the same or similar steps, method embodiments, system embodiments and device embodiments can be mutually referenced, and are not limited.

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

[0059] FIG. 3 is a flowchart of a communication method according to an embodiment of the present disclosure. As shown in FIG. 3, the method includes the following S301 to S302:

[0060] S301, mapping n transport blocks (TBs) on a physical channel.

[0061] The n TBs are from a TB set and include at least one second type TB, the at least one second type TB is obtained by packet encoding k first type TBs, each of the k first type TBs corresponds to one upper layer PDU, and n and k are integers greater than 1.

[0062] For example, the n TBs can include one first type TB and one second type TB. Alternatively, the n TBs can include multiple first type TBs and one second type TB. Alternatively, the n TBs can include multiple first type TBs and multiple second type TBs. Alternatively, the n TBs can include only n second type TBs and no first type TB.

[0063] In some embodiments, the TB set includes k first type TBs and m second type TBs, and m is a positive integer.

[0064] Exemplarily, data is transmitted by TBs, and when the transmitted data is too large, there are problems of high transmission failure probability and large retransmission overhead. As shown in FIG. 4, in the embodiment of the present disclosure, data can be transmitted by a TB set, the transmitted data is carried by k first type TBs in the TB set, thereby achieving the effect of cutting data, that is, k first type TBs are constructed by cutting a virtual "large TB". A second type TB can be obtained by packet encoding the k first type TBs (for example, a plurality of first type TBs are multiplied by an encoding vector under a finite field), and the present disclosure can generate k+m TB encoding packets for transmission by packet encoding the k first type TBs, the k+m TB encoding packets include k first type TBs and m second type TBs, and the k+m TB encoding packets correspond to data scheduling transmission of a TB set. The TB set can also be referred to as a TB group (TBG).

[0065] In some embodiments, the first type TB is a TB original packet before packet encoding, and the second type TB is a TB check packet after packet encoding, and the TB check packet is used for error recovery of the TB original packet.

[0066] Exemplarily, 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 an upper layer of a sending end to a physical layer or data that needs to be delivered to an upper layer by a physical layer of a receiving end. The TB system packet or the TB source packet after packet encoding is the same as the TB original packet before packet encoding.

[0067] The TB check packet is also referred to as a TB redundancy packet, and is a TB encoding packet after packet encoding. In some packet encoding algorithms, the TB check packet contains part of information after multiplication operation of the first type TB in a finite field before packet encoding. The data of the TB check packet is data generated in the physical layer, and is used for error recovery of the TB original packet, and the receiving end does not need to deliver the TB check packet to the upper layer. When the TB is transmitted, whether the transmitted TB is a TB check packet and how to obtain a decoding matrix of packet encoding for decoding of packet encoding can be implicitly indicated by a packet index or a packet encoding vector index.

[0068] In some embodiments, the first network element can map upper layer data to each first type TB. Then, the first network element can generate a second type TB by packet encoding using the first type TB. For example, each MAC PDU is referred to as a first type TB in the physical layer.

[0069] S302, sending n TBs to the second network element.

[0070] In some embodiments, the first network element can send the n TBs on the physical channel.

[0071] Exemplarily, for downlink transmission, the physical channel can be a downlink data transmission channel, e.g., a physical downlink shared channel (PDSCH). At this time, the first network element can carry multiple TB data on one PDSCH in one TTI, and transmit the multiple TB data in one downlink HARQ process.

[0072] For uplink transmission, the physical channel can be an uplink data transmission channel, e.g., a physical uplink shared channel (PUSCH). At this time, the first network element can carry multiple TB data on one PUSCH in one TTI, and transmit the multiple TB data in one uplink HARQ process.

[0073] In an implementation manner, the n TBs are mapped to one same code word and transmitted to the second network element.

[0074] In an implementation manner, the first network element transmits the n TBs to the second network element in one time domain transmission unit.

[0075] The time domain transmission unit includes at least one of the following: a TTI, a slot, a minislot, and a HARQ process.

[0076] Exemplarily, as shown in FIG. 5, the first network element transmits TB0, TB1, TB2, and TB3 in TTI1, wherein TB0 and TB1 are the first type of TB, and TB2 and TB3 are the second type of TB.

[0077] Based on the above technical solution, the first network element maps the n TBs to one physical channel and sends the n TBs to the second network element. In this way, the disclosure can improve transmission efficiency by transmitting n TBs at a time. If there is a TB that fails to be transmitted in the n TBs, the failed TB does not affect other successfully transmitted TBs in the n TBs. Since the successfully transmitted TBs do not need to be retransmitted, the amount of data that needs to be retransmitted is reduced. Furthermore, the n TBs come from a TB set and include at least one second type TB in the n TBs, and the second type TB is obtained by packet encoding k first type TBs, each first type TB corresponding to one upper layer protocol data unit (PDU), and n and k are integers greater than 1. That is, the first type TB can carry data on the upper layer PDU (for example, one first type TB corresponds to one MAC PDU), and the second type TB can be used to recover the first type TB. Therefore, after receiving the n TBs, the second network element can perform corresponding decoding operations based on the second type TB to recover the failed first type TB, further improving the reliability of data transmission, thereby improving the data transmission efficiency.

[0078] In some embodiments, the first network element can make a TB transmission decision based on the feedback information of the second network element.

[0079] As an embodiment of the disclosure, as shown in FIG. 6, in combination with the embodiment shown in FIG. 3, the method further includes the following S601-S602.

[0080] S601, receiving feedback information from the second network element.

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

[0082] The feedback information for indicating that the TB set is successfully transmitted, and the TB set is successfully transmitted means that the second network element has successfully obtained k first type TBs;

[0083] The feedback information for indicating that the TB set is unsuccessfully transmitted, and the TB set is unsuccessfully transmitted means that the second network element has not successfully obtained at least one first type TB in the k first type TBs;

[0084] The feedback information of each TB of the n TBs, and the feedback information of each TB is used to indicate whether the second network element has successfully obtained the corresponding TB.

[0085] 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 whole TB set and / or a feedback to each TB.

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

[0087] 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.

[0088] 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.

[0089] 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 when sending each TB set data, and stop sending the TB set data until receiving the feedback information indicating that the TB set is all successfully transmitted.

[0090] Exemplarily, the feedback information of each TB of the n TBs of a TB set transmission can be represented in the form of a bitmap. For example, the second network element sends a TB level feedback indication bitmap to the first network element, and the first network element can learn which TB is transmitted unsuccessfully in the previous transmission after receiving the bitmap, so as to selectively send the n TBs and include the second type TB in the n TBs. For another example, the second network element can use the bitmap to indicate the HARQ feedback of the n TBs, and the second network element sends the HARQ feedback of the n TBs of the current transmission after channel coding, so as to obtain coding gain. The first network element obtains the HARQ feedback of the k TBs of the current transmission after channel decoding after receiving.

[0091] Exemplarily, the bitmap information can represent whether the TBs of this transmission are unsuccessfully acquired, or whether the first type of TBs are successfully acquired. For example, "0010" can represent that the third TB of the four TBs of this transmission is unsuccessfully acquired, and the other three TBs are successfully acquired. For another example, "0010" can represent that the third TB of the four TBs of all the transmissions is unsuccessfully acquired, and the other three TBs are successfully acquired. After 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 unsuccessful acquisition of the first type of TBs.

[0092] In some embodiments, the feedback information can be HARQ feedback.

[0093] S602, based on the feedback information from the second network element, taking out n TBs from the TB set.

[0094] In combination with the above example, the first network element can determine, according to the feedback information, whether there is a case of unsuccessful acquisition of all the first type of TBs in the previous transmission, or determine the unsuccessfully acquired TBs of the k first type of TBs in the previous transmission, so as to take out n TBs from the TB set for transmission and contain the second type of TBs in the n TBs. Or the first network element can determine, according to the feedback information, that the TB set is successfully transmitted. Then, the first network element can transmit new TB set data. The transmission of the second type of TBs enables the receiving end to recover the first type of TBs that are unsuccessfully acquired through decoding of packet coding, thereby improving the transmission success rate of the TBs.

[0095] Based on the above technical solution, the first network element in the embodiment of the present disclosure can determine the transmission situation of the TBs in the TB set based on the feedback information from the second network element, so as to select appropriate TBs for the next transmission. In this way, the first network element can retransmit the error data in a targeted manner to reduce the number of retransmissions and improve the efficiency and reliability of data transmission.

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

[0097] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 3, as shown in FIG. 7, the method further includes the following S701.

[0098] S701, allocating transmission resources for the TBs in the n TBs according to a TB mapping rule.

[0099] In an implementation manner, the first network element allocates transmission resources for the first type of TBs in the n TBs on the transmission resources corresponding to the TB set first, and then allocates transmission resources for the second type of TBs in the n TBs.

[0100] and / or,

[0101] The first network element allocates time-domain earlier transmission resources for the first type of TBs and time-domain later transmission resources for the second type of TBs in the n TBs on the transmission resources corresponding to the TB set based on the TB mapping rule of the first type of TBs being earlier.

[0102] The transmission resources include one of the following: time-domain resources, frequency-domain resources, time-frequency resources.

[0103] For example, in the frequency-domain resources, as shown in FIG. 8, for the TB mapping rule of the first type of TBs being preferred, the first network element can preferentially select the frequency-domain resources (for example, TB0 and TB1 in FIG. 8) for the first type of TBs, and then select the remaining frequency-domain resources (for example, TB2 and TB3 in FIG. 8) for the second type of TBs, so as to allocate the n TBs to the frequency-domain resource blocks of the TB set, so that the n TBs are mapped to be transmitted on a physical channel. 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.

[0104] For example, in the time-domain resources, as shown in FIG. 9, 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. 9) for the first type of TBs, and the time-domain later positions (for example, TB3 in FIG. 9) for the second type of TBs, so as to allocate the n TBs to the time-domain resource blocks of the TB set, so that the n TBs are mapped to be transmitted on a physical channel. In this way, the first type of TBs can be guaranteed to be received first and to be decoded first.

[0105] For example, in the time-frequency resources, as shown in FIG. 10, for the TB mapping rule of the first type of TBs being preferred and earlier, the first network element can preferentially select the optimal and earlier time-frequency resources (for example, TB0 and TB1 in FIG. 10) for the first type of TBs, and then select the remaining time-frequency resources (for example, TB2 and TB3 in FIG. 10) for the second type of TBs, so as to allocate the n TBs to the time-frequency resource blocks of the TB set, so that the n TBs are mapped to be transmitted on a physical channel. In this way, the first type of TBs can be guaranteed to be preferentially transmitted, and the transmission success rate is high. If the first type of TBs are all transmitted successfully, there is no need to decode the second type of TBs, and there is also no need to decode the successfully obtained multiple TBs for packet encoding, so as to further improve the transmission efficiency.

[0106] In some embodiments, the first network element can also obtain the scheduling information of the TB set, so as to facilitate the scheduling of the TB set.

[0107] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 3, as shown in FIG. 11, the method further includes the following S1101.

[0108] S1101, obtain scheduling information of the TB set.

[0109] The scheduling information of the TB set is used to schedule the TBs transmitted in 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.

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

[0111] a TB set identifier corresponding to the TB set;

[0112] transmission resource location information corresponding to the TB set;

[0113] a number of resource elements (REs) corresponding to the TB set;

[0114] 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 the same MCS;

[0115] 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 the same number of spatial multiplexing layers;

[0116] a code word index used by the TBs in the TB set for transmission;

[0117] a TB mapping rule;

[0118] transmission resource location information corresponding to each of n TBs currently transmitted in the TB set;

[0119] a number of REs corresponding to each of the n TBs currently transmitted in the TB set;

[0120] an MCS used by each of the n TBs currently transmitted in the TB set for transmission;

[0121] a number of spatial multiplexing layers used by each of the n TBs currently transmitted in the TB set for transmission;

[0122] a packet encoding algorithm used by the TB set;

[0123] a calculation method of the first type TB size;

[0124] a number k of first type TBs in the TB set;

[0125] a number m of the second type of TBs in the TB set;

[0126] a number n of TBs currently transmitted in the TB set;

[0127] an index of each TB currently transmitted in the TB set;

[0128] a packet encoding vector index of each TB currently transmitted in the TB set;

[0129] a type indication of each TB currently transmitted in the TB set, the type indication indicating the first type of TB or the second type of TB.

[0130] Exemplarily, the index of a TB indicates a serial number of the TB in the TB set. The packet encoding vector of a TB can be indicated by the packet encoding vector index or 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 a TB can be indicated by the type indication information or 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 in a range of 0 to k-1 are the first type of TBs, and the TBs with indexes in a range of k to k+m-1 are the second type of TBs.

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

[0132] For the CSI, the first network element can determine the scheduling information based on the CSI. For the DCI, the first network element can obtain the scheduling information by receiving the DCI, the DCI including a first level DCI and / or a second level DCI, wherein 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 the RRC message, the first network element can obtain the scheduling information by receiving the RRC message, and the scheduling information can be included in the RRC message. For the MAC CE, the first network element can obtain the scheduling information by receiving the MAC CE, and the scheduling information can be included in the MAC CE.

[0133] In one example, the size of each TB in the TB set, the used MCS level, and the number of spatial multiplexing layers can be the same, so that the time-frequency domain position, time-frequency domain resource, MCS, number of spatial multiplexing layers, and the like 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 n of TBs currently transmitted by the TB set does not need to be included in the scheduling information, thereby further reducing the overhead.

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

[0135] Exemplarily, when the first network element is responsible for scheduling of 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 send the TB set according to the scheduling information. When the second network element is responsible for scheduling of 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 send the TB set. The second network element can receive the TB set according to the scheduling information. Taking a 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.

[0136] In some embodiments, after obtaining the scheduling information, the first network element can also send the scheduling information to the second network element. Taking a base station as the first network element and a terminal as the second network element as an example, the base station determines the scheduling information of downlink TB set transmission and sends the scheduling information of the TB set to the terminal, so that the terminal can receive data of n TBs of the TB set based on the scheduling information.

[0137] Exemplarily, after receiving the scheduling information, the second network element can determine, according to the scheduling information, the transmission resource corresponding to the data of the TB set received in one time domain transmission unit, the transmission resource corresponding to the data of each TB, the used MCS level, the number of spatial multiplexing layers, the size of the TB set, the size of each TB, and the like, thereby being able to decode each independent TB. If a TB check packet (for example, a second-type TB) is detected based on the scheduling information and the first-type TBs are not all successfully acquired, the decoding of packet encoding can also be performed to recover the first-type TBs.

[0138] In some embodiments, the first network element can also determine the size of the first type of TBs to facilitate allocating resources to the TBs of the TB set.

[0139] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 3, as shown in FIG. 12, the method further includes the following S1201.

[0140] S1201, determining the size of the first type of TBs.

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

[0142] The first 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.

[0143] 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 by 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 number of common spatial multiplexing layers corresponding to the TB set. Then, the first 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.

[0144] 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.

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

[0146] t TB denotes the size of the first type of TBs, t denotes the total size of the TB set, and k denotes the number of the first type of TBs.

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

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

[0149] Exemplarily, when all the TBs in the TB set use the same MCS and the same number of spatial multiplexing layers, the first 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 result of the division.

[0150] The total size of a TB set refers to the size of a TB calculated by the transmission resource corresponding to the TB set, the MCS, and the number of spatial multiplexing layers. 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. Since directly transmitting 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., the first type of TBs) in the present disclosure, and the plurality of TBs obtained by the division are transmitted as a TB set. That is, the virtual large TB is not a real TB, which is only described for the convenience of understanding.

[0151] In another implementation manner, the first 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 first 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.

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

[0153] 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 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.

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

[0155] 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 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. represents a floor operator.

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

[0157] For example, the first network element can further obtain the size of each first type of TB based on pre-configuration information at the first network element side. For example, the first network element can be configured locally with the number k of first type of TBs, obtain the total size t of the TB set and the number m of second type of TBs in the TB set based on the scheduling information, and obtain the size of each first type of TB 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.

[0158] For example, the first network element can further obtain the size of each first type of TB based on a RRC message, which includes the number k of first type of TBs.

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

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

[0161] FIG. 13 is a flowchart of a communication method according to an embodiment of the present disclosure. As shown in FIG. 13, the method includes the following S1301:

[0162] S1301, receiving n transport blocks (TBs) from a first network element on one physical channel.

[0163] The n TBs come from a TB set and include at least one second type of TB, the at least one second type of TB being obtained by packet encoding k first type of TBs, each of the k first type of TBs corresponding to one upper layer protocol data unit (PDU), and n and k are integers greater than 1.

[0164] In some embodiments, the TB set includes k first type of TBs and m second type of TBs, and m is a positive integer.

[0165] For example, the n TBs can include one first type of TB and one second type of TB. Or, the n TBs can include multiple first type of TBs and one second type of TB. Or, the n TBs can include multiple first type of TBs and multiple second type of TBs. Or, the n TBs can include only n second type of TBs and no first type of TB.

[0166] In some embodiments, the first type of TB is a TB original packet before packet encoding, and the second type of TB is a TB check packet after packet encoding, the TB check packet being used for error recovery of the TB original packet.

[0167] Exemplarily, 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 an upper layer of a sending end to a physical layer or data that needs to be delivered to an upper layer by the physical layer of a receiving end. The TB system packet or the TB source packet after packet encoding is the same as the TB original packet before packet encoding.

[0168] The TB check packet is also referred to as a TB redundant packet, and is a TB encoded packet after packet encoding, containing part of information after multiplication operation of the first type of TB in a finite field. The second type of TB is data generated by the physical layer itself, and is used for error recovery of the TB original packet, and the receiving end does not need to deliver the data to the upper layer. When the TB is transmitted, whether the transmitted TB is a TB redundant packet and how to obtain a code matrix for packet decoding can be implicitly indicated by a packet index or a packet encoding vector index.

[0169] Exemplarily, the received n TBs are mapped to the same code word.

[0170] Exemplarily, for downlink transmission, the physical channel can be a downlink data transmission channel, such as a PDSCH. At this time, one PDSCH in one TTI carries multiple TB data, and the second network element can receive multiple TB data on one downlink HARQ process.

[0171] For uplink transmission, the physical channel can be an uplink data transmission channel, such as a PUSCH. At this time, one PUSCH in one TTI carries multiple TB data, and the second network element can receive multiple TB data on one uplink HARQ process.

[0172] In an implementation manner, the second network element receives n TBs on one time domain transmission unit.

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

[0174] In addition, the second network element can further perform corresponding channel decoding and decoding operation corresponding to packet encoding.

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

[0176] The second network element selects the first type of TB in the n TBs for channel decoding;

[0177] The second network element selects the second type of TB in the n TBs for channel decoding;

[0178] The second network element first performs channel decoding on the first type TBs in the n TBs; and if the k first type TBs are not successfully obtained, the second network element performs channel decoding on the second type TBs in the n TBs.

[0179] When all the first type TBs in the TB group are successfully obtained, the second network element submits all the first type TBs to an upper layer.

[0180] When there is one successfully obtained first type TB in the TB group, the second network element submits the successfully obtained first type TB to the upper layer.

[0181] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 13, as shown in FIG. 14, the method further includes the following S1401-S1404.

[0182] S1401, performing channel decoding on the first type TBs in the n TBs.

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

[0184] In some embodiments, the second network element can select the first type TBs in the n TBs for channel decoding.

[0185] The second network element can know which are the first type TBs and which are the second type TBs in the n 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 in the TB set, which can be included in scheduling information or a default rule. For another example, the second network element can obtain the types of received TBs according to the implicit indication of the index of each TB.

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

[0187] In some embodiments, the second network element can submit all the first type TBs to an upper layer when all the first type TBs in the TB set are successfully obtained, or the second network element can submit the successfully obtained first type TB to the upper layer when there is one successfully obtained first type TB in the TB set.

[0188] S1402, determining whether the k first type TBs have been successfully acquired.

[0189] In some embodiments, the second network element can determine whether the k first type TBs have been successfully acquired in combination with the previous transmission results after channel decoding the first type TBs in the n TBs.

[0190] S1403, in the case where there is at least one first type TB that has not been successfully acquired in the k first type TBs, channel decoding the second type TBs in the n TBs.

[0191] In the case where the k first type TBs have been successfully acquired, the second network element does not need to channel decode the second type TBs in the n TBs, nor perform the decoding corresponding to the packet encoding.

[0192] S1404, in the case where there is at least one first type TB that has not been successfully acquired in the k first type TBs and there is a second type TB that has been successfully channel decoded in the n TBs, performing the decoding operation corresponding to the packet encoding based on the successfully acquired first type TBs in the k first type TBs and the successfully channel decoded second type TB in the n TBs, to acquire the first type TB that has not been successfully acquired in the k first type TBs.

[0193] The packet encoding / decoding refers to the encoding / decoding between multiple TB data packets. For example, the sending end packet encodes 4 first type TBs of 100 bits 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 decoding corresponding to the packet encoding is performed by combining the received second type TBs and all the successfully acquired first type TBs to recover the failed first type TBs.

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

[0195] For example, the second network element can perform the packet encoding decoding (packet decoding) operation of 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.

[0196] In addition, the second network element can also feed back to the first network element based on the decoding situation.

[0197] As an embodiment of the present disclosure, in combination with the embodiment shown in FIG. 13, as shown in FIG. 14, the method further includes the following S1405.

[0198] S1405, sending the feedback information to the first network element.

[0199] The feedback information comprises at least one of the following:

[0200] The feedback information for indicating the success of the TB set transmission, the success of the TB set transmission refers to that the second network element has successfully acquired the k first type TBs;

[0201] The feedback information for indicating the failure of the TB set transmission, the failure of the TB set transmission refers to that the second network element has not successfully acquired at least one first type TB of the k first type TBs;

[0202] The feedback information of each TB of the n TBs, the feedback information of each TB is used to indicate whether the second network element has successfully acquired the corresponding TB.

[0203] The related description can refer to S601, which will not be repeated here.

[0204] In some embodiments, the second network element can also acquire the scheduling information of the TB set, so as to schedule the TB set.

[0205] As an embodiment of the present disclosure, as shown in FIG. 15, the method further comprises the following S1501 in combination with the embodiment shown in FIG. 13.

[0206] S1501, acquiring the scheduling information of the TB set.

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

[0208] In some embodiments, the scheduling information comprises at least one of the following:

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

[0210] The transmission resource position information corresponding to the TB set;

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

[0212] The common MCS corresponding to the TB set, the common MCS is used to indicate that the TBs in the TB set are transmitted using the same MCS;

[0213] The number of common spatial multiplexing layers corresponding to the TB set, the number of common spatial multiplexing layers is used to indicate that the TBs in the TB set are transmitted using the same number of spatial multiplexing layers;

[0214] The code word index used for TB transmission in the TB set;

[0215] The TB mapping rule;

[0216] transmission resource position information corresponding to each of the n TBs currently transmitted in the TB set;

[0217] a number of REs corresponding to each of the n TBs currently transmitted in the TB set;

[0218] an MCS used for transmission of each of the n TBs currently transmitted in the TB set;

[0219] a number of spatial multiplexing layers used for transmission of each of the n TBs currently transmitted in the TB set;

[0220] a packet encoding algorithm used by the TB set;

[0221] a calculation method of the first type TB size;

[0222] a number of first type TBs in the TB set;

[0223] a number of second type TBs in the TB set;

[0224] a number n of TBs currently transmitted in the TB set;

[0225] an index of each of the n TBs currently transmitted in the TB set;

[0226] a packet encoding vector index of each of the n TBs currently transmitted in the TB set;

[0227] a type indication of each of the n TBs currently transmitted in the TB set, the type indication being used to indicate a first type TB or a second type TB.

[0228] Exemplarily, the index of a TB represents a serial number of the TB in the TB set. The packet encoding vector of a TB can be indicated by the packet encoding vector index or 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 a TB can be indicated by the type indication information or be indicated by the index of the TB, for example, a TB set includes k first type TBs and m second type TBs, the indexes of the first type TBs can be arranged in front, for example, the TBs with indexes in a range of 0 to k-1 are first type TBs, and the TBs with indexes in a range of k to k+m-1 are second type TBs.

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

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

[0231] In one example, the size of each TB in the TB set, the used MCS level, and the number of spatial multiplexing layers can be the same, so that the scheduling information can include the MCS corresponding to the TB set, the total number of REs, the number of spatial multiplexing layers, the TB mapping rule, the number of first type TBs k in the TB set, and the number of currently transmitted TBs n in the TB set, and does not need to transmit the MCS, the number of spatial multiplexing layers, and the like of each TB, thereby reducing the overhead of control signaling. If the transmission scheme is to transmit k TBs each time, the scheduling information does not need to include the number of currently transmitted TBs n in the TB set, thereby further reducing the overhead.

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

[0233] Exemplarily, when the first network element is responsible for the scheduling of 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 the scheduling of 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 the base station and the terminal as an example, the base station is responsible for generating the scheduling information and sending the scheduling information of the uplink transmission and the downlink transmission to the terminal.

[0234] 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 transmission of the TB set through CSI, and sends the scheduling information of the TB set to the terminal, so that the terminal can send the data of the n TBs of the TB set based on the scheduling information.

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

[0236] In some embodiments, the second network element can further determine the size of the first type of TB, so as to determine the resource allocated to the TB in the TB set.

[0237] As an embodiment of the present disclosure, as shown in FIG. 16, the method further includes the following S1601 in combination with the embodiment shown in FIG. 13.

[0238] S1601, determining the size of the first type of TB.

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

[0240] The first information includes the number of REs corresponding to the 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 TB in the TB set.

[0241] 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.

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

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

[0244] t TBrepresents 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.

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

[0246] 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.

[0247] Exemplarily, when all the TBs in the TB set use the same MCS and the same number of spatial multiplexing layers, the second network element can determine the size of the first type of TB by 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 of TB, the size of the first type of TB can be calculated by calculating the size of the first type of TB, and when the total size of the TB set cannot be evenly divided by the number of the first type of TB, the size of the first type of TB can be calculated by rounding up the calculation result.

[0248] 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 can be transmitted by the entire TB set, which can also be regarded as a virtual large TB. Since directly transmitting 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., the first type of TB) 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 the convenience of understanding.

[0249] 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 TB in the TB set. Then, the second network element determines 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 common number of spatial multiplexing layers corresponding to the TB set.

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

[0251] 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.

[0252] or, the number of REs allocated for each first type TB satisfies the following formula:

[0253] denotes the number of REs allocated for each first type TB, N RE denotes the number of REs corresponding to the TB set, k denotes the number of first type TBs; denotes the floor operator.

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

[0255] Exemplarily, the second network element can determine the size of each first type 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 on 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 of the corresponding position is taken out and decoded, and it is determined whether the received TB is a first type TB or a second type TB (for example, TB0 and TB1 are TB system packets, and TB2 and TB3 are TB redundancy packets).

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

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

[0258] Exemplarily, the second 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 TB. The second network element can obtain the size of the first type TB by looking up the table with the value of k.

[0259] It should be understood that the communication method provided in the present disclosure can be applied to various TB transmission scenarios, for example, can be applied to downlink TB set transmission, can be applied to uplink TB set transmission, can be applied to TB set transmission of different transmission schemes, can be applied to TB set transmission under single / dual code word stream, and can be applied to first transmission or retransmission of TB set.

[0260] For downlink TB set transmission, taking a first network element as a base station and a second network element as a terminal as an example, the base station is the sending end and the terminal is the receiving end. The base station determines the scheduling information of the downlink TB set, determines the downlink first type TB, and performs packet encoding on the downlink first type TB. Based on the scheduling information of the downlink TB set, the base station sends the TB data packet of the packet encoded TB set to the terminal. Each time of TB data packet sending is performed in a time unit. For example, there are 4 first type TBs in a TB set, and the base station sends 2 first type TBs and 2 second type TBs in a TTI. After receiving, the terminal finds that there is a first type TB that has not been successfully acquired, and then performs packet encoding decoding on all the successfully acquired TBs on the terminal side.

[0261] The base station can send DCI to the terminal, and indicate the scheduling information of the TB set to the terminal through the DCI, so as to indicate how the terminal receives the TB set data. For example, the base station indicates the terminal that the entire TB set uses common scheduling information to send TBs, and the common information includes the MCS of the TB set, the transmission resource of the TB set, the spatial multiplexing mode of the TB set, the number of first type TBs, the packet encoding mode, the calculation rule of the TB size, and the mapping rule of each TB to the transmission resource in the TB set. After receiving the indication of the DCI, the terminal determines the size of the received TB according to the calculation rule of the TB size, determines the transmission resource position of each TB data according to the TB size, the MCS, the number of layers, and the mapping rule, and receives each complete TB data from the corresponding transmission resource position. The terminal can send HARQ feedback to the base station after receiving and decoding the TB. The base station can determine whether there is a first type TB transmission failure according to the HARQ feedback, and if there is a first type TB failure, the base station can send a second type TB to make the terminal perform packet encoding decoding operation to restore the first type TB.

[0262] For the uplink TB set transmission, taking the first network element as the terminal and the second network element as the base station as an example, the terminal is the sending end and the base station is the receiving end. The base station can send a DCI to the terminal, and the DCI indicates the scheduling information of the TB set of the terminal, so as to indicate how the terminal transmits the TB set data. For example, the base station instructs the terminal to transmit the TBs in the entire TB set using common scheduling information, and the common information includes the MCS of the TB set, the transmission resource of the TB set, the spatial multiplexing mode of the TB set, the number k of the first type of TBs, the packet encoding mode, the calculation rule of the TB size, and the mapping rule of each TB to the transmission resource in the TB set. After receiving the DCI, the terminal calculates the size of the TB to be transmitted according to the calculation rule of the TB size, obtains the transmission resource position of each TB data according to the TB size, the MCS, the number of layers, and the mapping rule, and maps and transmits each TB data to be transmitted to the corresponding transmission resource position. The terminal can also generate k first type of TBs according to the TB size and the number k of the first type of TBs, and generate a second type of TB using the packet encoding mode in the DCI indication. When the terminal receives a NACK feedback for the TB set, the terminal transmits at least one second type of TB in the retransmission. After receiving the TB data transmitted by the terminal, the base station can obtain each TB based on the scheduling information and perform decoding. When there is a successfully obtained second type of TB and the first type of TB is not all successfully obtained, the base station can perform packet encoding decoding together with other successfully obtained TBs stored locally to recover the first type of TB.

[0263] In some embodiments, the transmission of the TB set includes multiple transmission schemes. For example, the first network element can only transmit the first type of TB, only transmit the second type of TB, or simultaneously transmit the first type of TB and the second type of TB.

[0264] In one example, the first network element can only transmit the first type of TB in the first transmission of the TB set. When any first type of TB is not successfully transmitted, the second type of TB and the retransmission packet of the first type of TB that fails to transmit are transmitted in the retransmission of the TB set. For example, the first network element transmits TB0, TB1, TB2, and TB3 in the first transmission (first transmission). TB0 and TB3 are successfully transmitted, and TB1 and TB2 fail to transmit. The first network element can transmit the retransmission packets of TB1 and TB2 and TB4 and TB5 in a certain retransmission, and TB4 and TB5 are the second type of TB.

[0265] In one example, the first network element can send only the first type of TBs in the first transmission of the TB set. When any of the first type of TBs fails to be transmitted successfully, only the second type of TBs are sent in the retransmission of the TB set. For example, the first network element sends TB0, TB1, TB2 and TB3 in the first transmission. TB0 and TB3 are transmitted successfully, and TB1 and TB2 fail to be transmitted. The first network element can send TB4, TB5, TB6 and TB7 in a retransmission, where TB4, TB5, TB6 and TB7 are the second type of TBs.

[0266] In the above scheme, when all the first type of TBs in the first transmission are transmitted successfully, the receiving end does not need to perform the decoding operation of the packet encoding, thereby reducing the processing complexity of the receiving end. Only when the first type of TBs in the first transmission fail, the second type of TBs after the packet encoding are sent through the retransmission to recover the first type of TBs.

[0267] In one example, the first network element can send both the second type of TBs and the first type of TBs in the first transmission of the TB set. For example, the first network element can send all the first type of TBs and one or more second type of TBs. For example, the first network element sends 5 first type of TBs (TB0, TB1, TB2, TB3, TB4) and 1 second type of TB (TB5) in the first transmission, so that the receiving end can use the second type of TBs after the packet encoding to recover the first type of TBs that are not successfully decoded. This scheme can recover the first type of TBs through the second type of TBs when the first type of TBs in the first transmission fail, thereby improving the reliability of the first transmission. For another example, the first network element sends part of the first type of TBs and one or more second type of TBs in the first transmission. This scheme can use the second type of TBs to recover the problem of interference failure for part of the TBs.

[0268] In one example, the first network element can send only the second type of TBs. This scheme can use the second type of TBs to recover all the first type of TBs.

[0269] That is, the TB transmission of the TB set can be one of the following: only the first type of TBs, only the second type of TBs, only the retransmission packets of the first type of TBs, only the retransmission packets of the second type of TBs, simultaneous transmission of the first type of TBs and the second type of TBs, simultaneous transmission of the retransmission packets of the first type of TBs and the second type of TBs, and simultaneous transmission of the retransmission packets of the first type of TBs and the retransmission packets of the second type of TBs.

[0270] The first network element can send the TBs of the TB set without the ACK / NACK feedback (also referred to as HARQ feedback or HARQ ACK feedback) from the second network element, or send the TBs of the TB set based on the feedback.

[0271] In one example, the receiving end does not send HARQ feedback until all the first type TBs are successfully acquired. Only when all the first type TBs are successfully acquired, an ACK feedback is sent. The transmitting end sends TB redundancy packets in each transmission of the TB set when no ACK feedback is received.

[0272] In one example, the first network element can know whether the TBs sent before the TB set are successfully acquired by the second network element through the feedback of the second network element, and then decide whether retransmission is needed and how to retransmit the TBs.

[0273] For example, the second network element only sends one NACK feedback regardless of how many TBs are received until all the first type TBs are successfully acquired. Only when all the first type TBs are successfully acquired, an ACK feedback is sent. When receiving the feedback of any first type TB transmission failure, the first network element retransmits the second type TB and the retransmission packet of the first type TB together, or only sends TB redundancy packets; when receiving the feedback of all the first type TB transmission success, the first network element considers that the entire TB set transmission is successful, and stops sending the TB set.

[0274] For TB set transmission under single / dual code word stream, the TB after channel coding processing is called code word. In spatial multiplexing transmission, there can be two code words, which are called first code word and second code word according to layer mapping configuration. In 4G and 5G, after using spatial multiplexing technology, the terminal can be allowed to send one TB on one carrier and one HARQ process in response to single code word transmission and / or the terminal can be allowed to send two TBs on one carrier and one HARQ process at the same time in response to two code word transmission.

[0275] For the transmission of TB set (TBG), each codeword stream can correspond to the transmission of a TB set, and different codewords can use different MCS and be mapped to different layers. In the present disclosure, if single codeword stream transmission is used, the TB data of the single codeword stream can be mapped to correspond to a separate TB set, that is, the TB data of a TB set is only mapped to the first codeword transmission. In the present disclosure, if double codeword stream is used, the TB data of the double codeword stream can be mapped to correspond to two separate TB sets, that is, the TB data of a TB set TBG1 is mapped to the first codeword transmission, and the TB data of another TB set TBG2 is mapped to the second codeword transmission. Each TB set is only packet encoded within the set to generate TB encoded packets within each TB set. When transmitting, the first codeword (mapping the TB data of TBG1) and the second codeword (mapping the TB data of TBG2) use the same time-frequency domain resources. However, the number of TBs, the size of TBs, the MCS, and the number of spatial multiplexing layers mapped by TBG1 and TBG2 can be different. In order to reduce overhead, the number of TB system packets transmitted by TBG1 and the number of TB system packets transmitted by TBG2 can be configured to be the same.

[0276] Exemplarily, as shown in FIG. 17, it is a structure diagram of a TB set transmitted by double codeword stream according to an embodiment of the present disclosure. The number of TBs transmitted by TBG1 and TBG2 simultaneously is equal (that is, the value of n of each TB set is 4), and each codeword stream only transmits the TBs of the corresponding TB set. It should be noted that TBG1 and TBG2 are transmitted simultaneously, but the TBs transmitted by each of them have no corresponding relationship. For example, TBG1 can transmit 2 first type TBs and 2 second type TBs, and TBG2 can transmit 4 second type TBs at the same time.

[0277] For the retransmission scheme of TB transmission in the TB set, since the TB set may not be completely transmitted successfully at the first transmission, the transmission success rate can be improved by retransmission.

[0278] In an embodiment of the present disclosure, the first network element can retransmit without receiving feedback.

[0279] For example, before the first network element receives an indication that the transmission of the TB set is completely successful, the first network element does not need to know which first type TB transmission fails, but transmits the second type TB on the same HARQ process transmission time slot to help the second network element to correct the first type TB.

[0280] In some embodiments, the present disclosure can use the same way to transmit the TB set for each retransmission and the first transmission (also referred to as the first transmission, initial transmission, new transmission, first time transmission). For example, the same transmission resource space as the first transmission of the TB set, the same number of TBs as the first transmission, the same MCS as the first transmission, the same number of spatial multiplexing layers as the first transmission, the same number of REs as the first transmission, etc. can be used in the retransmission. This scheme enables the second network element to receive the TB data of the retransmission using the scheduling information of the first transmission, thereby reducing the control signaling overhead of the retransmission.

[0281] In some embodiments, the present disclosure can use different ways to transmit the TB set for each retransmission and the first transmission (also referred to as the first transmission, initial transmission, new transmission, first time transmission). For example, the same transmission resource space as the first transmission of the TB set, the same number of TBs as the first transmission, the same MCS as the first transmission, the same number of spatial multiplexing layers as the first transmission, the same number of REs as the first transmission, etc. can be used in the retransmission. This scheme enables the first network element to dynamically adapt to the channel conditions and the free transmission resources, thereby achieving efficient utilization of wireless resources and adaptation to changes in the wireless environment.

[0282] In one example, a TB set transmits 4 first type TBs in the transmission resource space A in the first transmission, and transmits 2 TB redundancy packets in the transmission resource space B in the retransmission. In one example, a TB set uses a same MCS level (such as 16QAM, 1 / 2 code rate) to transmit 4 first type TBs in the first transmission, and uses a reduced MCS level (such as 8PSK, 1 / 2 code rate) to transmit 2 TB redundancy packets in the retransmission.

[0283] With the spectrum re-farming and the development of high frequency and ultra-high frequency, the future frequency domain resources will be very rich, so a larger bandwidth can be used for data transmission. Under large bandwidth, there is a demand for large bandwidth and high throughput low latency with data transmission rate reaching 50 Gbps or even 100 Gbps. For example, XR service, holographic communication service, AI large model data transmission, etc. all need to transmit large amount of data reliably in a short time. However, the efficiency of data transmission is low for transmitting one large TB in one TTI. This is because using one large TB transmission will occupy a large bandwidth, and there is a different degree of frequency selectivity on each subcarrier of the allocated bandwidth. In order to ensure normal transmission, the worst subband of the channel condition needs to be used as the main basis for scheduling and selecting MCS level, which will result in low data transmission efficiency. Even so, when there is a burst interference in a certain bandwidth, the entire TB will fail to be decoded successfully due to the interference. For example, if only one TB is transmitted on a larger transmission resource space, the TB is limited by frequency selective fading and can only be transmitted using a lower MCS. This makes the TB size (TBS) not large, and the upper layer data amount that can be carried is not large. Even so, when there is strong interference in a certain transmission resource, the TB can be retransmitted, but since one TB occupies the entire large transmission resource space, the possibility of TB failure is still large. When the maximum number of retransmissions is reached, the TB is still not transmitted successfully and will be discarded, which will cause a huge consumption of transmission resources.

[0284] To this end, the method for TB set transmission is provided in the embodiments of the present disclosure to improve data transmission reliability and reduce transmission delay. Using the method for TB set transmission, the transmission resource space of an original large TB is divided into multiple TBs of a TB set, and each TB of the TB set transmission can be transmitted using a larger MCS. The larger the MCS is on the same transmission resource space, the larger the TB data amount that can be carried is. This makes the sum of TBS of all first type TBs greater than the TBS of transmitting only one TB on the transmission resource space, that is, the TB set can carry more upper layer data transmission. Moreover, even if a certain TB fails to be transmitted due to frequency selective fading or interference, retransmission and merging can be performed only for the failed TB, and / or a TB check packet is used to recover the failed TB, which improves the possibility that all first type TBs are successfully transmitted in a short time. It can be seen that using the present disclosure can improve data transmission efficiency. For example, one TB set is transmitted in one TTI, and if the TB set is transmitted as one TB, 8000 bits need to be transmitted. If part of the data in the large TB is interfered, the entire TB will be wrong, and the 8000 bits need to be retransmitted. However, if the TB set is divided into four first type TBs (TB0, TB1, TB2 and TB3) for transmission, each TB only needs 2000 bits. If the data of TB2 is severely interfered, and the other three TBs are not interfered, only TB2 needs to be retransmitted at the receiving end, and the other TBs are successfully decoded and do not need to be retransmitted. TB grouping and packet encoding can further improve data transmission efficiency. For example, when TB2 is retransmitted in the second transmission of the TB set and TB0, TB1, TB2 and TB3 are packet encoded to generate second type TBs: TB4, TB5 and TB6, and then TB2 and TB4, TB5 and TB6 are simultaneously transmitted. If the retransmission packet of TB2 in the second transmission is still not successfully decoded at the receiving end, as long as the decoding of the packet encoding of any four TBs of the successfully decoded second type TBs in the second transmission and the successfully decoded first type TBs (TB0, TB1, TB3) in the first transmission is performed, the data of TB2 can be recovered. In this way, even if TB2 fails in the second transmission, there is still a high probability that the correct TB2 data can be obtained at the receiving end.

[0285] In the present disclosure, the number of frequency domain resources REs allocated to a TB set, the number of common spatial multiplexing layers used by each TB in the TB set (which can be referred to as the number of set-level spatial multiplexing layers) and the common modulation and coding scheme MCS (which can be referred to as the set-level MCS) of the TB set can be determined based on channel measurement (e.g., by measuring CSI), so that the total size of the virtual TB corresponding to the TB set can be calculated. The virtual TB can be equally divided to obtain more than two first-type TBs, that is, the TB set contains more than two first-type TBs, so that the first-type TBs can be packet encoded. If only one first-type TB is unable to be packet encoded, the recovery of the first-type TBs can be performed using packet encoding and decoding when one of the more than two first-type TBs fails to be transmitted.

[0286] Due to the segmentation and packet encoding of the TBs in the TB set, the TB set is no longer limited to the worst channel condition in the allocated bandwidth, but can use a better MCS, thereby improving the reliability of data transmission.

[0287] In some embodiments, in order to reduce overhead, all TBs in the same TB set can use set-level common scheduling information such as the same MCS.

[0288] In some embodiments, the present disclosure can also be used in the case where the sizes of the first-type TBs are the same, and the scheduling information of each TB is different (e.g., the MCSs of the TBs in the TB set are different).

[0289] In summary, the above technical solutions provided by the present disclosure can reduce the number of retransmissions, retransmit error data in a targeted manner, and improve the efficiency and reliability of data transmission.

[0290] It can be understood that the communication device includes hardware structures and / or software modules corresponding to each function to implement the above functions. Those skilled in the art should easily realize that the algorithm steps of each example described in combination with the embodiments of the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is implemented 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.

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

[0292] For example, taking the communication device as the first network element in the method embodiments described above, FIG. 18 is a structure diagram of a first network element 180 according to an embodiment of the present disclosure. The first network element 180 can perform the communication method provided by the method embodiments described above. As shown in FIG. 18, the first network element 180 includes a processing unit 1801 and a communication unit 1802.

[0293] The processing unit 1801 is configured to map n transport blocks (TBs) on a physical channel; the n TBs are from a TB set and include at least one second type TB, the at least one second type TB is obtained by packet encoding k first type TBs, each of the k first type TBs corresponds to one upper layer protocol data unit (PDU), and n and k are integers greater than 1.

[0294] In some embodiments, the n TBs are mapped on the same code word.

[0295] The communication unit 1802 is configured to send the n TBs to a second network element.

[0296] In some embodiments, the TB set includes k first type TBs and m second type TBs, and m is a positive integer.

[0297] In some embodiments, the communication unit 1802 is configured to receive feedback information from the second network element, and the feedback information includes at least one of the following: feedback information for indicating that the TB set is successfully transmitted, the successfully transmitted TB set means that the second network element has successfully obtained the k first type TBs; feedback information for indicating that the TB set is unsuccessfully transmitted, the unsuccessfully transmitted TB set means that the second network element has not successfully obtained at least one of the k first type TBs; and feedback information of each TB of the n TBs, the feedback information of each TB is used to indicate whether the corresponding TB is successfully obtained by the second network element.

[0298] In some embodiments, the processing unit 1801 is configured to take the n TBs from the TB set based on the feedback information from the second network element.

[0299] In some embodiments, the processing unit 1801 is configured to allocate, based on the first-type-TB-first TB mapping rule, transmission resources for the first-type TBs in the n TBs first and then for the second-type TBs in the n TBs on transmission resources corresponding to the TB set; and / or, the processing unit 1801 is configured to allocate, based on the first-type-TB-earlier TB mapping rule, time-domain-earlier transmission resources for the first-type TBs in the n TBs and time-domain-later transmission resources for the second-type TBs in the n TBs on the transmission resources corresponding to the TB set; wherein the transmission resources include one of the following: time-domain resources, frequency-domain resources, time-frequency resources.

[0300] In some embodiments, the processing unit 1801 is configured to obtain scheduling information of the TB set; the scheduling information of the TB set is used for scheduling TBs transmitted in the TB set; and the processing unit 1801 is configured to determine the size of the first-type TB.

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

[0302] a TB set identifier corresponding to the TB set;

[0303] transmission resource location information corresponding to the TB set;

[0304] a number of resource elements (REs) corresponding to the TB set;

[0305] 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;

[0306] 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;

[0307] a code word index used by the TBs in the TB set for transmission;

[0308] a TB mapping rule;

[0309] transmission resource location information corresponding to each of the n TBs currently transmitted in the TB set;

[0310] a number of REs corresponding to each of the n TBs currently transmitted in the TB set;

[0311] an MCS used by each of the n TBs currently transmitted in the TB set for transmission;

[0312] a number of spatial multiplexing layers used by each of the n TBs currently transmitted in the TB set for transmission;

[0313] a packet encoding algorithm used by the TB set;

[0314] A method for calculating a size of a first type of TB;

[0315] A number k of the first type of TBs in the TB set;

[0316] A number m of the second type of TBs in the TB set;

[0317] A number n of TBs currently transmitted in the TB set;

[0318] An index of each TB currently transmitted in the TB set;

[0319] A packet encoding vector index of each TB currently transmitted in the TB set;

[0320] A type indication of each TB currently transmitted in the TB set, the type indication being used to indicate the first type of TB or the second type of TB.

[0321] In some embodiments, the processing unit 1801 is configured to obtain first information, the first 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 first information.

[0322] In some embodiments, the processing unit 1801 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 common 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 TBs in the TB set; or, the processing unit 1801 is configured to 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 TBs in the TB set; 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.

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

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

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

[0326] t TB wherein 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.

[0327] or, the number of REs allocated for each first type of TB satisfies the following formula:

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

[0329] or, the number of REs allocated for each first type of TB satisfies the following formula:

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

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

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

[0333] In some embodiments, the n TBs sent by the communication unit 1802 to the second network element correspond to the same codeword.

[0334] In some embodiments, the communication unit 1802 is configured to send the n TBs to the second network element in one time domain transmission unit; the time domain transmission unit includes at least one of the following: a transmission time interval (TTI), a slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

[0335] In some embodiments, the first type of TB is a TB original packet before packet encoding, and the second type of TB is a TB check packet after packet encoding; the TB check packet is used for error recovery of the TB original packet.

[0336] For example, taking the communication apparatus as the second network element in the above method embodiments, FIG. 19 is a structural diagram of a second network element 190 according to an embodiment of the present disclosure, which can perform the communication method provided by the above method embodiments. As shown in FIG. 19, the second network element 190 includes a processing unit 1901 and a communication unit 1902.

[0337] The communication unit 1902 is configured to receive n transport blocks (TBs) from a first network element on a physical channel, the n TBs are from a TB set and the n TBs include at least one second type TB, the at least one second type TB is obtained by packet encoding k first type TBs, each of the k first type TBs corresponds to one upper layer protocol data unit (PDU), and n and k are integers greater than 1.

[0338] In some embodiments, the TB set includes k first type TBs and m second type TBs, and m is a positive integer.

[0339] In some embodiments, the n TBs received by the communication unit 1902 correspond to one code word.

[0340] In some embodiments, the processing unit 1901 is configured to perform channel decoding on the first type TBs in the n TBs; the processing unit 1901 is configured to determine whether the k first type TBs have been successfully obtained; the processing unit 1901 is configured to perform channel decoding on the second type TBs in the n TBs in a case where there is at least one first type TB in the k first type TBs that has not been successfully obtained; and the processing unit 1901 is configured to perform packet encoding corresponding decoding operation based on the successfully obtained first type TBs in the k first type TBs and the successfully channel decoded second type TBs in the n TBs to obtain the first type TBs in the k first type TBs that have not been successfully obtained, in a case where there is at least one first type TB in the k first type TBs that has not been successfully obtained and there is a successfully channel decoded second type TB in the n TBs.

[0341] In some embodiments, the communication unit 1902 is configured to send feedback information to the first network element, the feedback information includes at least one of the following: feedback information indicating that the TB set is successfully transmitted, the TB set being successfully transmitted means that the second network element has successfully obtained the k first type TBs; feedback information indicating that the TB set is unsuccessfully transmitted, the TB set being unsuccessfully transmitted means that the second network element has not successfully obtained at least one first type TB in the k first type TBs; and feedback information of each TB of the n TBs, the feedback information of each TB being used to indicate whether the second network element has successfully obtained the corresponding TB.

[0342] In some embodiments, the processing unit 1901 is configured to obtain scheduling information of the TB set, the scheduling information of the TB set being used to schedule the TBs in the TB set, and the processing unit 1901 is configured to determine the size of each first type TB in the TB set.

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

[0344] a TB set identifier corresponding to the TB set;

[0345] transmission resource position information corresponding to the TB set;

[0346] a number of resource elements (REs) corresponding to the TB set;

[0347] 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;

[0348] 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;

[0349] a code word index used by the TBs in the TB set for transmission;

[0350] a TB mapping rule;

[0351] transmission resource position information corresponding to each of n TBs currently transmitted in the TB set;

[0352] a number of REs corresponding to each of the n TBs currently transmitted in the TB set;

[0353] an MCS used by each of the n TBs currently transmitted in the TB set for transmission;

[0354] a number of spatial multiplexing layers used by each of the n TBs currently transmitted in the TB set for transmission;

[0355] a packet encoding algorithm used by the TB set;

[0356] a calculation method of a first type of TB size;

[0357] a number of first type of TBs in the TB set;

[0358] a number of second type of TBs in the TB set;

[0359] a number n of TBs currently transmitted in the TB set;

[0360] an index of each of the TBs currently transmitted in the TB set;

[0361] a packet encoding vector index of each of the TBs currently transmitted in the TB set;

[0362] a type indication of each of the TBs currently transmitted in the TB set, the type indication being used to indicate a first type of TB or a second type of TB.

[0363] In some embodiments, the processing unit 1901 is configured to obtain first information, the first 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 first type TBs in the TB set; and determine the size of the first type TB based on the first information.

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

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

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

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

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

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

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

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

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

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

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

[0375] In some embodiments, the communication unit 1902 is configured to receive n TBs in one time domain transmission unit; the time domain transmission unit includes at least one of the following: a transmission time interval (TTI), a slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

[0376] In some embodiments, the first type of TB is a TB original packet before packet encoding, and the second type of TB is a TB check packet after packet encoding; the TB check packet is used for error recovery of the TB original packet.

[0377] In the case where the functions of the above integrated modules are implemented in the form of hardware, the embodiments of the present disclosure provide another structure of the communication apparatus involved in the above embodiments. As shown in FIG. 20, the communication apparatus 200 includes a processor 2002 and a bus 2004. In some embodiments, the communication apparatus 200 can further include a memory 2001; in some embodiments, the communication apparatus 200 can further include a communication interface 2003.

[0378] The processor 2002 can implement or execute the various exemplary logical blocks, modules, and circuits described in connection with the embodiments of the present disclosure. The processor 2002 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, transistor logic device, hardware component, or any combination thereof, which can implement or execute the various exemplary logical blocks, modules, and circuits described in connection with the embodiments of the present disclosure. The processor 2002 can also be a combination of implementing computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0379] The communication interface 2003 is configured to connect with other devices through a communication network. The communication network can be an Ethernet, a radio access network, a wireless local area network (WLAN), and the like.

[0380] The memory 2001 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 capable of carrying or storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

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

[0382] In another implementation manner, the memory 2001 can also be integrated with the processor 2002.

[0383] The bus 2004 can be an extended industry standard architecture (EISA) bus or the like. The bus 2004 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. 20, but it does not mean that there is only one bus or only one type of bus.

[0384] 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.

[0385] 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.

[0386] 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.

[0387] The above merely provides the specific implementation of the present disclosure, but the protection scope of the present disclosure is not limited thereto, and any change or replacement within the technical scope disclosed by the present disclosure shall be covered within the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

1. A communication method performed by a first network element, wherein, The method comprises: mapping n transport blocks (TBs) onto a physical channel; the n TBs are from a TB set and the n TBs include at least one second type TB, the at least one second type TB is obtained by packet encoding k first type TBs, each of the k first type TBs corresponds to one upper layer protocol data unit (PDU), and the n and the k are integers greater than 1; sending the n TBs to a second network element.

2. The method of claim 1, wherein, The TB set includes the k first type TBs and m second type TBs, and the m is a positive integer.

3. The method of claim 1 or 2, further comprising: receiving feedback information from the second network element, the feedback information including at least one of: feedback information indicating that transmission of the TB set is successful, the transmission of the TB set being successful indicating that the second network element has successfully acquired the k first type TBs; feedback information indicating that transmission of the TB set is unsuccessful, the transmission of the TB set being unsuccessful indicating that the second network element has not successfully acquired at least one of the k first type TBs; feedback information for each of the n TBs, the feedback information for each of the n TBs indicating whether the corresponding TB has been successfully acquired by the second network element.

4. The method of claim 3, further comprising: based on the feedback information from the second network element, removing n TBs from the TB set.

5. The method of any one of claims 1 to 4, wherein, Before mapping the n TBs onto a physical channel, the method further comprises: based on a first type TB priority TB mapping rule, first allocating transmission resources for first type TBs in the n TBs and then allocating transmission resources for second type TBs in the n TBs on transmission resources corresponding to the TB set; and / or, based on a first type TB front TB mapping rule, allocating time domain front transmission resources for first type TBs in the n TBs and time domain rear transmission resources for second type TBs in the n TBs on transmission resources corresponding to the TB set; wherein the transmission resources include one of: time domain resources, frequency domain resources, time-frequency resources.

6. The method of any one of claims 1 to 5, wherein, Before mapping the n TBs onto a physical channel, the method further comprises at least one of: obtaining scheduling information of the TB set, the scheduling information of the TB set being used to schedule TBs transmitted in the TB set; determining a size of the first type TB.

7. The method of claim 6, wherein, The scheduling information includes 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 the 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 TBs in the TB set are transmitted using the same number of spatial multiplexing layers; a code word index used by TB transmission in the TB set; a TB mapping rule; transmission resource position information corresponding to each of the n TBs currently transmitted in the TB set; a number of REs corresponding to each of the n TBs currently transmitted in the TB set; an MCS used for transmission of each of the n TBs currently transmitted in the TB set; a number of spatial multiplexing layers used for transmission of each of the n 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; 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 n 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; 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.

8. The method of claim 6, wherein, determining the size of the first type of TB, comprising: obtaining first information, the first information including 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; determining the size of the first type of TB based on the first information.

9. The method of claim 8, wherein, determining the size of the first type of TB based on the first information, comprising: determining 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 common spatial multiplexing layers corresponding to the TB set; and determining 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; or, determining a number of REs allocated to each of the first type of TBs based on the number of REs corresponding to the TB set and the number of the first type of TBs in the TB set; and determining the size of the first type of TB based on the number of REs allocated to each of the first type of TBs, the common MCS corresponding to the TB set, and the number of common spatial multiplexing layers corresponding to the TB set.

10. The method of claim 9, wherein, a size of the first type of TB satisfies the following formula: wherein t TB denotes the size of the first type of TB, t denotes the total size of the set of TBs, and k denotes the number of the first type of TBs; Alternatively, the size of the first type of TB satisfies the following formula: wherein t TB denotes the size of the first type of TB, t denotes the total size of the set of TBs, k denotes the number of the first type of TBs; denotes a ceiling operator; Alternatively, the number of REs allocated for each of the first type TBs satisfies the following formula: wherein denotes the number of REs allocated for each of the first type TBs, N RE denotes the number of REs corresponding to the TB set, k denotes the number of the first type TBs; Alternatively, the number of REs allocated for each of the first type TBs satisfies the following formula: wherein denotes the number of REs allocated for each of the first type TBs, N RE denotes the number of REs corresponding to the TB set, k denotes the number of the first type TBs; denotes a floor operator.

11. The method of any one of claims 6 to 10, wherein, the scheduling information is obtained through at least one of the following: channel state information (CSI), downlink control information (DCI), a radio resource control (RRC) message, and a medium access control-control element (MAC CE).

12. The method of any one of claims 1 to 7 and claim 11, wherein, the number and / or size of the first type of TBs are determined through at least one of the following: scheduling information, pre-configuration information, an RRC message, and a TB mapping table.

13. The method of any one of claims 1 to 12, wherein, sending the n TBs to a second network element, comprising: sending the n TBs to the second network element on one time domain transmission unit; the time domain transmission unit includes at least one of the following: a transmission time interval (TTI), a slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

14. The method of any one of claims 1 to 13, wherein, the first type of TB is a TB original packet before packet encoding, and each of the at least one second type of TB is a TB check packet after packet encoding; the TB check packet is used for error recovery of the TB original packet.

15. A communication method performed by a second network element, wherein, the method comprises: receiving n transport blocks (TBs) from a first network element on a physical channel, the n TBs being from a TB set and the n TBs including at least one second type TB, the at least one second type TB being obtained by packet encoding k first type TBs, each of the k first type TBs corresponding to one upper layer protocol data unit (PDU), and the n and the k being integers greater than 1.

16. The method of claim 15, wherein, the TB set including the k first type TBs and m second type TBs, the m being a positive integer.

17. The method of claim 15 or 16, further comprising: channel decoding first type TBs in the n TBs; determining whether the k first type TBs have been successfully obtained; in a case where there is at least one first type TB in the k first type TBs that has not been successfully obtained, channel decoding second type TBs in the n TBs; in a case where there is at least one first type TB in the k first type TBs that has not been successfully obtained and there is a second type TB in the n TBs that has been successfully channel decoded, performing packet encoding corresponding decoding operations based on successfully obtained first type TBs in the k first type TBs and the second type TB in the n TBs that has been successfully channel decoded to obtain the first type TB in the k first type TBs that has not been successfully obtained.

18. The method of claim 17, further comprising: sending feedback information to the first network element, the feedback information including at least one of: feedback information indicating that the TB set has been successfully transmitted, the TB set having been successfully transmitted meaning that the second network element has successfully obtained the k first type TBs; feedback information indicating that the TB set has failed to be transmitted, the TB set having failed to be transmitted meaning that the second network element has not successfully obtained at least one first type TB in the k first type TBs; feedback information for each TB of the n TBs, the feedback information for each TB indicating whether the second network element has successfully obtained the corresponding TB.

19. The method of any one of claims 15 to 18, wherein, Before receiving the n TBs from the first network element on the physical channel, the method further includes at least one of: obtaining scheduling information for the TB set, the scheduling information for the TB set being used to schedule the TBs in the TB set to be transmitted; determining a size of each first type TB in the TB set.

20. The method of claim 19, wherein, the scheduling information including 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 to be transmitted; a TB mapping rule; and a code word index used by the TBs in the TB set to be transmitted. transmission resource position information corresponding to each of the n TBs currently transmitted in the TB set; a number of REs corresponding to each of the n TBs currently transmitted in the TB set; an MCS used for transmission of each of the n TBs currently transmitted in the TB set; a number of spatial multiplexing layers used for transmission of each of the n 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; 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 n 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; 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.

21. The method of claim 19 or 20, further comprising: obtaining first information, the first information comprising a number of REs corresponding to the TB set, a common MCS corresponding to the TB set, a common number of spatial multiplexing layers corresponding to the TB set, and a number k of the first type of TBs in the TB set; determining a size of the first type of TB based on the first information.

22. The method of claim 21, wherein, determining the size of the first type of TB based on the first information comprises: determining 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 common number of spatial multiplexing layers corresponding to the TB set; and determining the size of the first type of TB based on the total size of the TB set and the number k of the first type of TBs in the TB set; or, determining a number of REs allocated to each of the first type of TBs based on the number of REs corresponding to the TB set and the number k of the first type of TBs in the TB set; and determining the size of the first type of TB based on the number of REs allocated to each of the first type of TBs, the common MCS corresponding to the TB set, and the common number of spatial multiplexing layers corresponding to the TB set.

23. The method of claim 22, wherein, a size of the first type of TB satisfies the following formula: wherein t TB denotes the size of the first type of TB, t denotes the total size of the set of TBs, and k denotes the number of the first type of TBs; Alternatively, the size of the first type of TB satisfies the following formula: wherein t TB denotes the size of the first type of TB, t denotes the total size of the set of TBs, and k denotes the number of the first type of TBs; denotes a ceiling operator; Alternatively, the number of REs allocated for each of the first type TBs satisfies the following formula: wherein denotes the number of REs allocated for each of the first type TBs, N RE denotes the number of REs corresponding to the TB set, k denotes the number of the first type TBs; Alternatively, the number of REs allocated for each of the first type TBs satisfies the following formula: wherein denotes the number of REs allocated for each of the first type TBs, N RE denotes the number of REs corresponding to the TB set, k denotes the number of the first type TBs; denotes a floor operator.

24. The method of any one of claims 19-23, wherein, the scheduling information is obtained based on at least one of the following: channel state information (CSI), downlink control information (DCI), a radio resource control (RRC) message, and a medium access control-control element (MAC CE).

25. The method of any one of claims 15-20 and 24, wherein, the number and / or size of the first type of TBs in the TB set is determined based on at least one of the following: scheduling information, pre-configuration information, an RRC message, and a TB mapping table.

26. The method of any one of claims 15 to 25, wherein, receiving the n TBs from the first network element on one physical channel comprises: receiving the n TBs on one time domain transmission unit, the time domain transmission unit comprising 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 any one of claims 15 to 26, wherein, the first type of TB is a TB original packet before packet encoding, and each of the at least one second type of TB is a TB check packet after packet encoding; the TB check packet is used for error recovery of the TB original packet.

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

29. A computer readable storage medium, wherein, The computer readable storage medium has stored thereon computer instructions which, when executed on a computer, cause the computer to perform the method according to any one of claims 1-14, or perform the method according to any one of claims 15-27.

30. A computer program product, wherein, The computer program product comprises computer program instructions which, when executed by a processor, implement the method according to any one of claims 1-14, or perform the method according to any one of claims 15-27.

Images