Communication method and device, storage medium and program product

Abstract

The invention provides a communication method and device, a storage medium and a program product, relates to the technical field of communication, and can solve the problem of low data transmission efficiency in related technologies. The method comprises the following steps: mapping n transport blocks (TBs) to a physical channel; the n TBs come from a TB set and comprise at least one TB of a second type, the TB of the second type is obtained by performing packet coding on k TBs of a first type, each TB of the first type corresponds to an upper layer protocol data unit (PDU), and n and k are integers greater than 1; and sending the n TBs to a second network element. The data transmission efficiency can be improved.

Description

Technical Field

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

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

[0003] Currently, wireless communication typically uses transport blocks (TBs) for physical layer scheduling and transmission. Each TB is mapped onto an antenna for transmission after undergoing physical layer operations such as channel coding and modulation. When the size of a TB (TBsize, TBS) is too large, the probability of transmission failure and transmission latency also increase accordingly, leading to low data transmission efficiency. Summary of the Invention

[0004] This disclosure provides a communication method, apparatus, storage medium, and program product that can solve the problem of low data transmission efficiency in related technologies.

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

[0006] n transport blocks (TBs) are mapped to a physical channel; the n TBs come from a TB set and include at least one second type TB, the second type TB is obtained by packet encoding k first type TBs, each first type TB corresponds to an upper layer protocol data unit (PDU), and n and k are both integers greater than 1;

[0007] Send the n TBs to the second network element.

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

[0009] On a physical channel, n transport blocks (TBs) are received from a first network element. The n TBs come from a TB set and include at least one second type TB. The second type TB is obtained by packet encoding k first type TBs. Each first type TB corresponds to an upper-layer protocol data unit (PDU). The n and k are both integers greater than 1.

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

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

[0012] The communication unit is used to send the n TBs to the second network element.

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

[0014] The communication unit is used to receive n transport blocks (TBs) from a first network element on a physical channel. The n TBs come from a TB set and include at least one second type TB. The second type TB is obtained by packet encoding k first type TBs. Each first type TB corresponds to an upper-layer protocol data unit (PDU). The n and k are both integers greater than 1.

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

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

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

[0018] In this embodiment, a first network element maps n data points (TBs) to a physical channel and sends these n TBs to a second network element. Thus, this disclosure improves transmission efficiency by transmitting n TBs concurrently at once. If any of the n TBs fails to transmit, the failed TB does not affect the other successfully transmitted TBs within the n TBs. Since successfully transmitted TBs do not require retransmission, this reduces the amount of data that needs to be retransmitted. Furthermore, the first-type TBs among the successfully transmitted TBs can be independently submitted to the upper layer at the receiving end. In addition, the n TBs come from a TB set, and the n TBs include at least one second-type TB. The second-type TB is obtained by packet encoding k first-type TBs, where each first-type TB corresponds to an upper-layer protocol data unit (PDU), and n and k are both integers greater than 1. That is, the first-type TB can carry upper-layer PDU data (e.g., 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 the corresponding decoding operation based on the second type of TB to recover the first type of TB that failed to be acquired, thereby further improving the reliability of data transmission and thus improving data transmission efficiency. Attached Figure Description

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

[0020] Figure 1 This is a structural diagram of a TB transmission provided in some embodiments of this disclosure;

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

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

[0023] Figure 4 A structural diagram of a TB set provided in some embodiments of this disclosure;

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

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

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

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

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

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

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

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

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

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

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

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

[0036] Figure 17 A structural diagram of a TB set transmitted in a dual-codeword stream, provided for some embodiments of this disclosure;

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

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

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

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

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

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

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

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

[0045] Currently, wireless communication typically schedules transmission using transport blocks (TBs). For example, ... Figure 1As shown, for each codeword, each hybrid automatic repeat request (HARQ) process processes only one TB in a transmission time interval (TTI). Each TB is mapped to the antenna for transmission after going through physical layer operations such as channel coding and modulation.

[0046] Each data block (TB) has a cyclic redundancy check (CRC). If a TB forms multiple coding blocks (CBs) after channel coding, each CB also has a CRC. Only when the CRCs of all CBs and the entire TB pass the check can the TB be successfully acquired and submitted to the media access control (MAC) layer. When the TB size (TBS) is too large, a failure of any CRC check will cause the transmission of the entire TB to fail, making it difficult to meet the requirements of high throughput, low latency, and high reliability. At the same time, each TB retransmission will consume a lot of air interface resources and a large buffer, and cause a large transmission delay, thus resulting in low data transmission efficiency.

[0047] Therefore, in the technical solution provided in this disclosure, the first network element maps n TBs to a physical channel and sends the n TBs to the second network element. Thus, this disclosure can improve transmission efficiency by transmitting n TBs concurrently at once. If any TB among the n TBs fails to transmit, the failed TB does not affect the other successfully transmitted TBs among the n TBs. Since successfully transmitted TBs do not need to be retransmitted, this reduces the amount of data that needs to be retransmitted. Furthermore, the first type TBs among the successfully transmitted TBs can be independently submitted to the upper layer at the receiving end. In addition, the n TBs come from a TB set, and the n TBs include at least one second type TB. The second type TB is obtained by packet encoding k first type TBs, where each first type TB corresponds to an upper-layer protocol data unit (PDU), and n and k are both integers greater than 1. That is to say, the first type TB can carry the data of the upper-layer PDU (e.g., 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 the corresponding decoding operation based on the second type of TB to recover the first type of TB that failed to be acquired, thereby further improving the reliability of data transmission and thus improving 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 this disclosure embodiment may include at least a first network element and a second network element. It should be understood that, in this example, in the downlink, the first network element may be a network-side device (e.g., including but not limited to a base station), and the second network element may be a terminal-side device (e.g., including but not limited to a terminal). Of course, in the uplink, the first network element may also be a terminal-side device, and the second network element may also be a network-side device. Furthermore, the first and second network elements may also be modules of a device in a communication system, or protocol layers in a communication system (e.g., including but not limited to the MAC layer). This module may be implemented as a software module, a hardware module, or a combination of software and hardware modules.

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

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

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

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

[0053] These multiple TBs may include original TB packets used to carry upper-layer data, or redundant TB packets (also known as TB check packets) used to perform error recovery on the original TB packets.

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

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

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

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

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

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

[0060] Step 301: Map n transport blocks TB onto a physical channel.

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

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

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

[0064] For example, in related technologies, data is transmitted via TB. When the transmitted data is too large, there are problems such as a high probability of transmission failure and high retransmission overhead. Figure 4As shown in this embodiment, data can be transmitted through a TB set. The transmitted data is carried by k first-type TBs in the TB set, thereby achieving the effect of data segmentation. That is, k first-type TBs are constructed by segmenting a virtual "large TB". Second-type TBs can be obtained by packet encoding the k first-type TBs (for example, multiple first-type TBs are multiplied by encoding vectors in a finite field). This disclosure can generate k+m TB encoded packets for transmission by packet encoding the k first-type TBs. The k+m TB encoded packets include k first-type TBs and m second-type TBs, and the k+m TB encoded packets correspond to the data scheduling and transmission of one TB set. This TB set can also be called a TB group (TBG).

[0065] In some embodiments, the first type TB is the original TB packet before packet encoding, and the second type TB is the TB check packet after packet encoding. The TB check packet is used to recover from errors in the original TB packet.

[0066] For example, the original TB packet before packet encoding is also called the TB system packet or TB source packet. It is the data transmitted from the upper layer of the sending end to the physical layer or the data that the receiving end needs the physical layer to deliver to the upper layer. The TB system packet or TB source packet after packet encoding is the same as the original TB packet before packet encoding.

[0067] A TB check packet, also known as a TB redundancy packet, is a TB encoded packet after packet encoding. In some packet encoding algorithms, the TB check packet contains partial information from the first type of TB before packet encoding, obtained through finite field multiplication. The TB check packet data is generated at the physical layer and is used for error recovery of the original TB packet; the receiving end does not need to submit the TB check packet to the upper layer. During TB transmission, whether the transmitted TB is a TB check packet can be implicitly indicated by the packet index or packet encoding vector index, and the packet encoding matrix can be obtained for decoding.

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

[0069] Step 302: Send n TBs to the second network element.

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

[0071] For example, for downlink transmission, the physical channel can be a downlink data transmission channel, such as a physical downlink shared channel (PDSCH). In this case, the first network element can carry multiple TB of data on one PDSCH in one TTI, and transmit multiple TB of data in one downlink HARQ process.

[0072] For uplink transmission, the physical channel can be an uplink data transmission channel, such as a physical uplink shared channel (PUSCH). In this case, the first network element can carry multiple TB of data on one PUSCH in one TTI, and transmit multiple TB of data in one uplink HARQ process.

[0073] In one possible implementation, the n TBs are mapped to the same codeword and sent to the second network element.

[0074] In one possible implementation, the first network element sends n TB to the second network element in one time-domain transmission unit.

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

[0076] For example, such as Figure 5 As shown, the first network element transmits TB0, TB1, TB2 and TB3 on TTI1, where TB0 and TB1 are first type TBs, and TB2 and TB3 are second type TBs.

[0077] Based on the above technical solution, the first network element maps n data points (TBs) to a physical channel and sends these n TBs to the second network element. Thus, this disclosure improves transmission efficiency by transmitting n TBs concurrently at once. If any TB among the n TBs fails to transmit, the failed TB does not affect the other successfully transmitted TBs among the n TBs. Since successfully transmitted TBs do not require retransmission, this reduces the amount of data that needs to be retransmitted. Furthermore, the first-type TBs among the successfully transmitted TBs can be independently submitted to the upper layer at the receiving end. In addition, the n TBs come from a TB set, and the n TBs include at least one second-type TB. The second-type TB is obtained by packet encoding k first-type TBs, where each first-type TB corresponds to an upper-layer protocol data unit (PDU), and n and k are both integers greater than 1. That is, the first-type TB can carry data on the upper-layer PDU (e.g., 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 the corresponding decoding operation based on the second type of TB to recover the first type of TB that failed to be acquired, thereby further improving the reliability of data transmission and thus improving data transmission efficiency.

[0078] In some embodiments, the first network element may make TB transmission decisions based on feedback information from the second network element.

[0079] As one embodiment of this disclosure, combined with Figure 3 The illustrated embodiments, such as Figure 6 As shown, the method further includes steps 601-602.

[0080] Step 601: Receive feedback information from the second network element.

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

[0082] Feedback information used to characterize the successful transmission of TB sets. Successful transmission of TB sets means that the second network element has successfully acquired k first-type TBs.

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

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

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

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

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

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

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

[0090] For example, the feedback information for each of the n TBs transmitted in a TB set can be represented in the form of a bitmap. For instance, a second network element sends a TB-level feedback indication bitmap to a first network element. Upon receiving this bitmap, the first network element can determine which TB in the previous transmission failed and thus selectively select n TBs to send, including the second type of TBs within those n TBs. Alternatively, the second network element can use a bitmap to indicate the HARQ feedback for the n TBs. The second network element channels-codes the HARQ feedback of the currently transmitted n TBs before sending it, thereby obtaining coding gain. The first network element, upon receiving the bitmap, performs channel decoding to obtain the HARQ feedback for the currently transmitted k TBs.

[0091] For example, this bitmap information can indicate whether a TB in this transmission was not successfully acquired, or whether a TB of the first type was successfully acquired. For instance, "0010" can indicate that the third TB in this transmission failed to acquire, while the other three TBs were successfully acquired. Or, "0010" can indicate that of all TBs transmitted so far, the third TB failed to acquire, while the other three TBs were successfully acquired. When the first network element receives TB-level feedback, it can clearly know which TBs were successfully acquired, which TBs failed to acquire, and whether there were any first-type TB acquisition failures.

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

[0093] Step 602: Based on the feedback information from the second network element, take out n TBs from the TB set.

[0094] Based on the above example, the first network element can determine, based on feedback information, whether there were instances in previous transmissions where not all first-type TBs were successfully acquired, or identify which TBs out of k first-type TBs were unacquired in previous transmissions. It can then selectively extract n TBs from the TB set for transmission, ensuring that these n TBs include second-type TBs. Alternatively, the first network element can determine, based on feedback information, that the TB set was successfully transmitted. Afterward, the first network element can send new TB set data. The transmission of second-type TBs allows the receiving end to recover the failed first-type TBs through packet encoding decoding, thereby improving the TB transmission success rate.

[0095] Based on the above technical solution, in this embodiment of the present disclosure, the first network element can determine the transmission status of the TB in the TB set based on the feedback information from the second network element, thereby selecting a suitable TB for the next transmission. In this way, the first network element can retransmit erroneous 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 to n TBs through different TB mapping rules.

[0097] As one embodiment of this disclosure, combined with Figure 3 The illustrated embodiments, such as Figure 7 As shown, the method further includes the following step 701.

[0098] Step 701: Allocate transmission resources to the TBs among the n TBs according to the TB mapping rules.

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

[0100] And / or,

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

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

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

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

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

[0106] In some embodiments, the first network element can also obtain scheduling information of the TB set in order to schedule the TB set.

[0107] As one embodiment of this disclosure, combined with Figure 3 The illustrated embodiments, such as Figure 11 As shown, the method further includes the following step 1101.

[0108] Step 1101: Obtain the scheduling information of the TB set.

[0109] The scheduling information for the TB set is used to schedule the TBs transmitted within the TB set. This scheduling information may include the scheduling information corresponding to the TB set, or it may include the scheduling information corresponding to each TB within the TB set.

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

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

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

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

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

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

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

[0117] TB mapping rules;

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

[0119] The number of REs for each of the n TBs currently being transmitted in the TB set;

[0120] The MCS used for each of the n TBs currently being transmitted in the TB set;

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

[0122] The packet encoding algorithm used in the TB collection;

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

[0124] The number of TBs of type 1 in the TB set, k;

[0125] The number of second-type TBs in the TB set, m;

[0126] The TB set contains the current number of TBs, n.

[0127] The TB set contains the index of each TB currently being transmitted;

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

[0129] The TB set contains a type indicator for each TB currently being transmitted, which indicates whether it is a first-type TB or a second-type TB.

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

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

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

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

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

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

[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 the first network element as a base station and the second network element as a terminal as an example, the base station determines the scheduling information for the downlink TB set transmission and sends the scheduling information for the TB set to the terminal, enabling the terminal to receive n TBs of data from the TB set based on the scheduling information.

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

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

[0139] As one embodiment of this disclosure, combined with Figure 3 The illustrated embodiments, such as Figure 12 As shown, the method further includes the following step 1201.

[0140] Step 1201: Determine the size of the first type TB.

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

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

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

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

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

[0146]

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

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

[0149]

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

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

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

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

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

[0155]

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

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

[0158]

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

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

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

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

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

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

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

[0166] Step 1301: Receive n transport blocks TB from the first network element on a physical channel.

[0167] Here, n TBs come from a TB set and include at least one second-type TB. The second-type TB is obtained by packet encoding k first-type TBs. Each first-type TB corresponds to an upper-layer protocol data unit (PDU). n and k are both integers greater than 1.

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

[0169] For example, n TBs can include one first-type TB and one second-type TB. Alternatively, n TBs can include multiple first-type TBs and one second-type TB. Alternatively, n TBs can include multiple first-type TBs and multiple second-type TBs. Alternatively, n TBs can include only n second-type TBs, excluding first-type TBs.

[0170] In some embodiments, the first type TB is the original TB packet before packet encoding, and the second type TB is the TB check packet after packet encoding. The TB check packet is used to recover from errors in the original TB packet.

[0171] For example, the original TB packet before packet encoding is also called the TB system packet or TB source packet. It is the data transmitted from the upper layer of the sending end to the physical layer or the data that the receiving end needs the physical layer to deliver to the upper layer. The TB system packet or TB source packet after packet encoding is the same as the original TB packet before packet encoding.

[0172] The TB check packet, also known as the TB redundancy packet, is a TB encoded packet after packet encoding. It contains partial information from the first type of TB before packet encoding, obtained through finite field multiplication. The second type of TB is data generated at the physical layer itself, used for error recovery of the original TB packet; the receiving end does not need to submit this data to the upper layer. During TB transmission, whether the transmitted TB is a TB redundancy packet can be implicitly indicated by the packet index or packet encoding vector index, and how to obtain the packet encoding matrix for decoding can be used.

[0173] For example, the received n TBs are mapped to the same codeword.

[0174] For example, for downlink transmission, the physical channel can be a downlink data transmission channel, such as a PDSCH. In this case, one PDSCH on one TTI carries multiple TB of data, and the first network element can receive multiple TB of data on one downlink HARQ process.

[0175] For uplink transmission, this physical channel can be an uplink data transmission channel, such as a PUSCH. In this case, one PUSCH on one TTI carries multiple TB of data, and the first network element can receive multiple TB of data in one uplink HARQ process.

[0176] In one possible implementation, the second network element receives n TB in one time-domain transmission unit.

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

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

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

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

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

[0182] The second network element first performs channel decoding on the first type TB among the n TBs; if it fails to acquire k first type TBs, then it performs channel decoding on the second type TB among the n TBs.

[0183] When all first-type TBs in the TB group are successfully acquired, the second network element submits all first-type TBs to the upper layer.

[0184] When a first-type TB is successfully acquired within the TB group, the second network element submits the successfully acquired first-type TB to the upper layer.

[0185] As one possible embodiment of this disclosure, combined with Figure 13 The illustrated embodiments, such as Figure 14 As shown, the method further includes steps 1401-1404.

[0186] Step 1401: Perform channel decoding on the first type of TB among the n TBs.

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

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

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

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

[0191] In some embodiments, the second network element may submit all first-type TBs to the upper layer when all first-type TBs in the TB set are successfully acquired, or the second network element may submit the successfully acquired first-type TB to the upper layer when there is one successfully acquired first-type TB in the TB set.

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

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

[0194] Step 1403: If at least one TB among the k first-type TBs fails to be acquired, perform channel decoding on the second-type TBs among the n TBs.

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

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

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

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

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

[0200] In addition, the second network element can also provide feedback to the first network element based on the decoding results.

[0201] As one possible embodiment of this disclosure, combined with Figure 13 The illustrated embodiments, such as Figure 14 As shown, the method also includes the following step 1405.

[0202] Step 1405: Send feedback information to the first network element.

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

[0204] Feedback information used to characterize the successful transmission of TB sets. Successful transmission of TB sets means that the second network element has successfully acquired k first-type TBs.

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

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

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

[0208] In some embodiments, the second network element can also obtain scheduling information of the TB set in order to schedule the TB set.

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

[0210] Step 1501: Obtain the scheduling information of the TB set.

[0211] The scheduling information for the TB set is used to schedule the TBs transmitted within the TB set. This scheduling information may include the scheduling information corresponding to the TB set, or it may include the scheduling information corresponding to each TB within the TB set.

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

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

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

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

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

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

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

[0219] TB mapping rules;

[0220] The location information of the transmission resources corresponding to each of the n TBs currently being transmitted in the TB set;

[0221] The number of REs for each of the n TBs currently being transmitted in the TB set;

[0222] The MCS used for each of the n TBs currently being transmitted in the TB set;

[0223] The number of spatial multiplexing layers used for each of the n TBs currently being transmitted in the TB set;

[0224] The packet encoding algorithm used in the TB collection;

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

[0226] The number of TBs of type 1 in the TB set, k;

[0227] The number of second-type TBs in the TB set, m;

[0228] The TB set contains the current number of TBs, n.

[0229] The TB set contains the index of each TB currently being transmitted;

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

[0231] The TB set contains a type indicator for each TB currently being transmitted, which indicates whether it is a first-type TB or a second-type TB.

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

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

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

[0235] In one example, the size, MCS level, and spatial multiplexing layer of each TB in the TB set can be the same. In this case, 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 rules, the number k of the first type TBs in the TB set, and the number n of TBs currently being transmitted in the TB set. It is unnecessary to transmit the MCS and spatial multiplexing layer information for each TB, thus reducing control signaling overhead. If the transmission scheme transmits k TBs in each transmission, the scheduling information does not need to include the number n of TBs currently being transmitted in the TB set, further reducing overhead.

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

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

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

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

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

[0241] As one embodiment of this disclosure, combined with Figure 13 The illustrated embodiments, such as Figure 16 As shown, the method further includes the following step 1601.

[0242] Step 1601: Determine the size of the first type TB.

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

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

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

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

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

[0248]

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

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

[0251]

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

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

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

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

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

[0257]

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

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

[0260]

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

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

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

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

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

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

[0267] It should be understood that the communication method provided in this disclosure can be applied to various TB transmission scenarios. For example, it can be applied to downlink TB set transmission, uplink TB set transmission, TB set transmission with different transmission schemes, TB set transmission under single / dual codeword streams, and the first transmission or retransmission of TB sets.

[0268] For downlink TB set transmission, taking the first network element as the base station and the second network element as the terminal as an example, the base station acts as the transmitter and the terminal as the receiver. The base station determines the scheduling information of the downlink TB set, identifies the downlink first type TB, and performs packet encoding of the downlink first type TB. Based on the scheduling information of the downlink TB set, the base station sends the packet-encoded TB data packets of the TB set to the terminal. Each TB data packet transmission occurs within a time unit. For example, if there are 4 first type TBs in a TB set, the base station sends 2 first type TBs and 2 second type TBs in one TTI. After receiving the data, the terminal finds that there are first type TBs that were not successfully acquired, and then decodes the packet encoding of all the TBs that were successfully acquired on the terminal side.

[0269] The base station can send a Data Interpretation Context (DCI) to the terminal, instructing the terminal on the scheduling information of the Data Tolerance (TB) set, and thus directing the terminal on how to receive TB data. For example, the base station might instruct the terminal to send TBs using common scheduling information, including the TB set's Multi-Segment Configuration (MCS), TB set transmission resources, TB set spatial multiplexing method, number of TBs of the first type, packet encoding method, TB size calculation rules, and mapping rules for each TB to transmission resources within the TB set. Upon receiving the DCI, the terminal determines the size of the received TB according to the TB size calculation rules. Based on the TB size, MCS, number of layers, and mapping rules, it can determine the transmission resource location of each TB and receive each complete TB from the corresponding transmission resource location. After receiving and decoding the TB, the terminal can send a HARQ feedback to the base station. Based on the HARQ feedback, the base station can determine if there are any first-type TB transmission failures. If so, the base station can send second-type TBs to enable the terminal to perform packet encoding decoding to recover the first-type TBs.

[0270] For 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 acts as the sender and the base station as the receiver. The base station can send a DCI to the terminal, which instructs the terminal on the scheduling information of the TB set, thereby instructing the terminal on how to send the TB set data. For example, the base station instructs the terminal to send the entire TB set using common scheduling information. This common information includes the TB set's MCS, TB set transmission resources, TB set spatial multiplexing method, the number k of first-type TBs, packet encoding method, TB size calculation rules, and mapping rules of each TB to the transmission resources within the TB set. After receiving the DCI, the terminal calculates the size of the TB to be sent according to the TB size calculation rules. Based on the TB size, MCS, layer number, and mapping rules, it can determine the transmission resource location of each TB data and map each TB data to be sent to the corresponding transmission resource location. The terminal can also generate k first-type TBs based on the TB size and the number k of first-type TBs, and generate second-type TBs using the packet encoding method indicated in the DCI. When the terminal receives a NACK response for this TB set, the terminal sends at least one second-type TB during retransmission. After receiving TB data from the terminal, the base station can acquire and decode each TB based on scheduling information. When a second type of TB is successfully acquired but not all first type of TBs are successfully acquired, the base station can decode the packet encoding along with other successfully acquired TBs stored locally to recover the first type of TBs.

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

[0272] In one example, the first network element may send only the first type of TB in the initial transmission of the TB set. If any first type TB fails to transmit, a second type TB and a retransmission packet of the failed first type TB are sent in the retransmission of the TB set. For example, the first network element sends TB0, TB1, TB2, and TB3 in the initial transmission. TB0 and TB3 are successfully transmitted, while TB1 and TB2 fail. In a subsequent retransmission, the first network element may send retransmission packets of TB1 and TB2, as well as TB4 and TB5, where TB4 and TB5 are second type TBs.

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

[0274] In the above scheme, when all first-type TBs are successfully transmitted in the initial transmission, the receiving end does not need to perform packet encoding decoding, thus reducing the processing complexity of the receiving end. Only when a first-type TB fails in the initial transmission will the packet-encoded second-type TB be retransmitted to recover the first-type TBs.

[0275] In one example, the first network element can simultaneously send both type 2 TBs and type 1 TBs in the initial transmission of the TB set. For instance, the first network element can send all type 1 TBs and one or more type 2 TBs. For example, the first network element could send five type 1 TBs (TB0, TB1, TB2, TB3, TB4) and one type 2 TB (TB5) in the initial transmission, allowing the receiving end to recover undecoded type 1 TBs using packet-encoded type 2 TBs during the initial transmission. This scheme can recover type 1 TBs from errors in the initial transmission using type 2 TBs, improving the reliability of the initial transmission. Another example is that the first network element can send some type 1 TBs and one or more type 2 TBs in the initial transmission. This scheme can address the problem of interference failures in some TBs, allowing recovery using type 2 TBs.

[0276] In one example, the first network element can send only the second type TB, and the scheme can use the second type TB to recover all the first type TB.

[0277] That is, the TB transmission of the TB set can be one of the following: transmitting only the first type of TB, transmitting only the second type of TB, transmitting only the retransmission packets of the first type of TB, transmitting only the retransmission packets of the second type of TB, transmitting both the first type of TB and the second type of TB simultaneously, transmitting both the retransmission packets of the first type of TB and the second type of TB simultaneously, and transmitting both the retransmission packets of the first type of TB and the retransmission packets of the second type of TB simultaneously.

[0278] The first network element can send the TB set without relying on the ACK / NACK feedback from the second network element (also known as HARQ feedback or HARQ ACK feedback), or it can send the TB set based on the feedback.

[0279] In one example, the receiver does not send a HARQ response until all Type 1 TBs have been successfully acquired. An ACK response is only sent once all Type 1 TBs have been successfully acquired. The sender, without receiving an ACK response, sends a TB redundancy packet in every transmission of the TB set.

[0280] In one example, through feedback from the second network element, the first network element can know whether the previously sent TB set has been successfully acquired by the second network element, and thus decide whether retransmission is necessary and how to retransmit the TB. For example,

[0281] Before successfully acquiring all Type 1 TBs, the second network element sends only a NACK feedback regardless of the number of TBs received. Only upon successfully acquiring all Type 1 TBs does it send an ACK feedback. When receiving feedback indicating a failure in the transmission of any Type 1 TB, the first network element retransmits both the Type 2 TB and the retransmitted Type 1 TB packets together, or sends only redundant TB packets. When receiving feedback indicating successful transmission of all Type 1 TBs, the first network element considers the entire TB set to have been successfully transmitted and stops sending packets to the TB set.

[0282] For TB set transmission under single / dual codeword streams, the TB is referred to as a codeword after channel coding processing. In spatially multiplexed transmission, two codewords can exist, referred to as the first codeword and the second codeword respectively, depending on the layer mapping configuration. In 4G and 5G, after using spatial multiplexing technology, the terminal may be allowed to transmit one TB on one carrier and one HARQ process in response to a single codeword transmission, and / or the terminal may be allowed to transmit two TBs simultaneously on one carrier and one HARQ process in response to two codeword transmissions.

[0283] For the transmission of a TB set (TBG), each codeword stream can correspond to the transmission of one TB set. Different codewords can use different MCS and be mapped to different layers. In this disclosure, if single codeword stream transmission is used, the TB data of a single codeword stream can be mapped to an independent TB set, that is, the TB data of a TB set is only mapped to the first codeword transmission. In this disclosure, if dual codeword streams are used, the TB data of dual codeword streams can be mapped to two independent TB sets, that is, the TB data of one 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 only performs packet encoding within the set to generate TB encoded packets within each TB set. During transmission, 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, TB size, MCS, and the number of spatial multiplexing layers of mapping can be different for TBG1 and TBG2. To reduce overhead, the number of TB system packets sent by TBG1 can be configured to be the same as the number of TB system packets sent by TBG2.

[0284] For example, such as Figure 17 The diagram shows a structure for transmitting TB sets in a dual-codeword stream, as provided in this disclosure. TBG1 and TBG2 transmit the same number of TBs simultaneously (i.e., n is 4 for each TB set), and each codeword stream transmits only the TBs corresponding to its TB set. It should be noted that although TBG1 and TBG2 transmit simultaneously, the TBs they transmit are not directly related. For example, TBG1 can transmit two Type 1 TBs and two Type 2 TBs, while TBG2 transmits four Type 2 TBs.

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

[0286] In one embodiment of this disclosure, the first network element can retransmit without receiving feedback.

[0287] For example, before the first network element receives an indication that the entire TB set has been successfully transmitted, the first network element does not need to know which first type TB transmission failed. Instead, it helps the second network element to correct the first type TB by sending a second type TB in the same HARQ process's transmission slot.

[0288] In some embodiments, this disclosure allows the same method to be used for transmitting the TB set in each retransmission as in the initial transmission (also referred to as the first transmission, initial upload, new transmission, or first transmission). For example, the retransmission may use the same transmission resource space, the same number of TBs, the same MCS, the same number of spatial multiplexing layers, and the same number of REs as in the initial transmission of the TB set. This scheme enables the second network element to receive the retransmitted TB data using the scheduling information of the initial transmission, thereby reducing the control signaling overhead of the retransmission.

[0289] In some embodiments, this disclosure allows the TB set to be transmitted in a manner different from the initial transmission (also known as the first transmission, initial retransmission, or first transmission) for each retransmission. For example, while keeping the TB size unchanged, the retransmission may use a different transmission resource space, a different number of TBs, a different MCS, a different number of spatial multiplexing layers, and a different number of REs than the initial transmission. This scheme allows the first network element to flexibly and dynamically adapt to channel conditions and available transmission resources, achieving efficient utilization of wireless resources and adaptability to changes in the wireless environment.

[0290] In one example, a TB set transmits four Type 1 TBs in transport resource space A during the initial transmission, and transmits two redundant TB packets in transport resource space B during retransmission. In another example, a TB set transmits four Type 1 TBs in the initial transmission using the same MCS level (e.g., 16QAM, 1 / 2 bit rate), and transmits two redundant TB packets in the retransmission using a reduced MCS level (e.g., 8PSK, 1 / 2 bit rate).

[0291] With spectrum refarming and the development of high-frequency and ultra-high-frequency frequencies, future frequency domain resources will be abundant, allowing for greater bandwidth for data transmission. Under this high bandwidth, there is a demand for high-throughput, low-latency data transmission rates of 50Gbps or even 100Gbps. For example, XR services, holographic communication services, and AI large-scale model data transmission all require reliable transmission of large amounts of data within a short time. However, currently, transmitting a large TB within a single TTI is inefficient. This is because using a large TB for transmission consumes significant bandwidth, and the subcarriers within that allocated bandwidth exhibit varying degrees of frequency selectivity. In related technologies, to ensure normal transmission, the subcarrier with the worst channel conditions is used as the primary basis for scheduling and selecting the MCS level, leading to low data transmission efficiency. Even so, when a burst of interference occurs in a certain bandwidth segment, the entire TB will fail to decode due to this interference. For example, if only one TB is transmitted in a large transmission resource space, this TB is limited by frequency-selective fading and can only be transmitted using a lower MCS. This results in a small TB size (TBS) and a limited amount of upper-layer data it can carry. Even so, if strong interference occurs in a certain segment of transmission resources, and the TB (Through-Tenth Byte) can be retransmitted, the probability of it failing is still high because a TB of data occupies a large amount of transmission resource space. If the TB is still not successfully transmitted after reaching the maximum number of retransmissions, it will be discarded, resulting in a huge consumption of transmission resources.

[0292] To address this, this disclosure provides a method for transmitting TB sets, thereby improving data transmission reliability and reducing transmission latency. Using this method, the original large TB transmission resource space is divided among multiple TBs within a TB set. Each TB transmitted within the TB set can utilize a larger MCS (Mean Cross Section). A larger MCS within the same transmission resource space corresponds to a larger amount of TB data that can be carried. This makes the sum of the TBS (Transmission Standards) of all first-type TBs greater than the TBS of transmitting only one TB within the same transmission resource space, meaning the TB set can carry more upper-layer data transmission. Furthermore, even if a TB fails to transmit due to frequency-selective fading or interference, only the failed TB can be retransmitted and merged, or a TB checksum packet can be used to recover the failed TB. These improvements increase the likelihood of all first-type TBs being successfully transmitted within a short time. It can be seen that this disclosure improves data transmission efficiency. For example, transmitting a TB set within a TTI (Time Interval) requires transmitting 8000 bits if the TB set is transmitted as a single TB. If some data in this large TB is interfered with, the entire TB will fail, requiring retransmission of these 8000 bits. However, dividing the TB set into four Type 1 TBs (TB0, TB1, TB2, and TB3) for transmission requires only 2000 bits per TB. If TB2's data is severely interfered with, while the other three TBs are not, only TB2's decoding fails at the receiving end, requiring retransmission of these 2000 bits; the other TBs are successfully decoded and do not need retransmission. Grouping TBs and adding packet encoding can further improve data transmission efficiency. For example, in the second transmission of the TB set, TB2 is retransmitted, and TB0, TB1, TB2, and TB3 are packet-encoded to generate Type 2 TBs: TB4, TB5, and TB6. Subsequently, TB2, TB4, TB5, and TB6 are transmitted simultaneously. At the receiving end, if the retransmitted packet of TB2 in the second transmission still fails to decode successfully, the data of TB2 can be recovered by decoding any four TBs from the Type 2 TBs that succeeded in the second transmission and the Type 1 TBs (TB0, TB1, and TB3) that succeeded in the first transmission. Thus, 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.

[0293] In this disclosure, the number of frequency domain resources (REs) allocated to a TB set on a TTI, the number of common spatial multiplexing layers (referred to as set-level spatial multiplexing layers) used by each TB within the TB set, and the common modulation and coding scheme (MCS, referred to as set-level MCS) can be determined based on channel measurements (such as CSI obtained through measurement). This allows the calculation of the total virtual TB size corresponding to the TB set. Dividing this virtual TB equally yields more than two first-type TBs, meaning the TB set contains more than two first-type TBs, enabling packet coding of these first-type TBs. Thus, even if only one first-type TB needs to be retransmitted during retransmission, packet coding can be used to recover the first-type TB.

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

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

[0296] In some embodiments, this disclosure may also cover situations where the scheduling information of each TB is different when the TBs of the first type are the same size (e.g., the MCS of each TB within the TB set is different).

[0297] In summary, the technical solutions provided in this disclosure can reduce the number of retransmissions, specifically retransmit erroneous data, and improve the efficiency and reliability of data transmission.

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

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

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

[0301] Processing unit 1801 is used to map n transport blocks TB to a physical channel; the n TBs come from a TB set and the n TBs include at least one second type TB, the second type TB is obtained by packet encoding k first type TBs, each first type TB corresponds to an upper layer protocol data unit PDU, and n and k are both integers greater than 1;

[0302] In some embodiments, the n TBs are mapped to the same codeword.

[0303] Communication unit 1802 is used to send n TB to the second network element.

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

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

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

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

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

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

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

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

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

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

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

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

[0316] TB mapping rules;

[0317] The location information of the transmission resources corresponding to each of the n TBs currently being transmitted in the TB set;

[0318] The number of REs for each of the n TBs currently being transmitted in the TB set;

[0319] The MCS used for each of the n TBs currently being transmitted in the TB set;

[0320] The number of spatial multiplexing layers used for each of the n TBs currently being transmitted in the TB set;

[0321] The packet encoding algorithm used in the TB collection;

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

[0323] The number of TBs of type 1 in the TB set, k;

[0324] The number of second-type TBs in the TB set, m;

[0325] The TB set contains the current number of TBs, n.

[0326] The TB set contains the index of each TB currently being transmitted;

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

[0328] The TB set contains a type indicator for each TB currently being transmitted, which indicates whether it is a first-type TB or a second-type TB.

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

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

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

[0332]

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

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

[0335]

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

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

[0338]

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

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

[0341]

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

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

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

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

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

[0347] In some embodiments, the first type TB is the original TB packet before packet encoding, and the second type TB is the TB verification packet after packet encoding; the TB verification packet is used to recover from errors in the original TB packet.

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

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

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

[0351] In some embodiments, the n TBs received by the communication unit 1902 correspond to the same codeword.

[0352] In some embodiments, the processing unit 1901 is configured to perform channel decoding on a first type TB among n TBs; the processing unit 1901 is configured to determine whether k first type TBs have been successfully acquired; the processing unit 1901 is configured to perform channel decoding on a second type TB among n TBs if at least one TB among the k first type TBs has not been successfully acquired; the processing unit 1901 is configured to perform a packet encoding-corresponding decoding operation on the successfully acquired TBs among the k first type TBs and the successfully channel-decoded second type TBs among the n TBs if at least one TB among the k first type TBs has not been successfully acquired and there are TBs among the n second type TBs that have been successfully channel-decoded, in order to acquire the TBs that have not been successfully acquired among the k first type TBs.

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

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

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

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

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

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

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

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

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

[0362] Mapping rules for TB transfers within a TB set;

[0363] The location information of the transmission resources corresponding to each TB currently being transmitted in the TB set;

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

[0365] The MCS used by each TB transfer currently being transferred in the TB set;

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

[0367] The packet encoding algorithm used in the TB collection;

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

[0369] The number of TBs of type 1 in the TB set, k;

[0370] The number of second-type TBs in the TB set, m;

[0371] The TB set contains the current number of TBs, n.

[0372] The TB set contains the index of each TB currently being transmitted;

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

[0374] The TB set contains a type indicator for each TB currently being transmitted, which indicates whether it is a first-type TB or a second-type TB.

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

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

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

[0378]

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

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

[0381]

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

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

[0384]

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

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

[0387]

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

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

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

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

[0392] In some embodiments, the first type TB is the original TB packet before packet encoding, and the second type TB is the TB verification packet after packet encoding; the TB verification packet is used to recover from errors in the original TB packet.

[0393] In implementing the functionality of the integrated modules described above using hardware, this disclosure provides another possible structure for the communication device involved in the above embodiments. For example... Figure 20 As shown, the communication device 200 includes a processor 2002 and a bus 2004. Optionally, the communication device 200 may also include a memory 2001; alternatively, the communication device 200 may also include a communication interface 2003.

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

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

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

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

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

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

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

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

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

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

Claims

1. A communication method characterized by comprising: The method applied to a first network element comprises: mapping n transport blocks (TBs) onto a physical channel, wherein the n TBs are from a TB set and at least one second type TB is included in the n TBs, the second type TB is obtained by packet encoding k first type TBs, each of the first type TBs corresponds to an upper layer protocol data unit (PDU), and n and 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 comprises the k first type TBs and m second type TBs, and m is a positive integer.

3. The method of claim 1, wherein, The method further comprises: receiving feedback information from the second network element, wherein the feedback information comprises at least one of the following: feedback information for indicating that the TB set is successfully transmitted, wherein the successfully transmitted TB set means that the second network element has successfully acquired the k first type TBs; feedback information for indicating that the TB set is unsuccessfully transmitted, wherein the unsuccessfully transmitted TB set means that the second network element has not successfully acquired at least one of the k first type TBs; feedback information of each TB of the n TBs, wherein the feedback information of each TB is used to indicate whether the corresponding TB is successfully acquired by the second network element.

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

5. The method of claim 1, wherein, Before the n TBs are mapped onto the physical channel, the method further comprises: based on a TB mapping rule that the first type TBs are given priority, allocating transmission resources for the first type TBs in the n TBs first and then allocating transmission resources for the second type TBs in the n TBs on the transmission resources corresponding to the TB set; and / or, based on a TB mapping rule that the first type TBs are given priority, allocating time-domain earlier transmission resources for the first type TBs in the n TBs and allocating 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 comprise one of the following: time-domain resources, frequency-domain resources, time-frequency resources.

6. The method of claim 1, wherein, Before the n TBs are mapped onto the physical channel, the method further comprises at least one of the following: obtaining scheduling information of the TB set, wherein the scheduling information of the TB set is used to schedule the TBs transmitted in the TB set; determining the size of the first type TBs.

7. The method of claim 6, wherein, The scheduling information comprises at least one of the following: 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, wherein the common MCS is used to indicate that the TBs in the TB set are transmitted using the same MCS; a number of common spatial multiplexing layers corresponding to the TB set, wherein 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; a code word index used by the TBs in the TB set for transmission; a TB mapping rule; transmission resource location information corresponding to each TB of the n TBs currently transmitted in the TB set; a quantity 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 quantity 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 quantity of first type of TBs in the TB set; a quantity of second type of TBs in the TB set; a quantity 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 a first type of TB or a second type of TB.

8. The method of claim 6, wherein, The determination of the size of the first type of TB comprises: obtaining first information, the first information comprising a quantity of REs corresponding to the TB set, a common MCS corresponding to the TB set, a common quantity of spatial multiplexing layers corresponding to the TB set, and a quantity of first type of TBs in the TB set; and determining the size of the first type of TB based on the first information.

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

10. The method of claim 9, wherein, 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; 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 quantity of REs allocated to each of the first type of 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 set of TBs, k denotes the number of the first type TBs; Alternatively, the quantity of REs allocated to each of the first type of 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 set of TBs, k denotes the number of the first type TBs; denotes a floor operator.

11. The method of claim 6, 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 claim 1, wherein, The quantity and / or size of the first type of TB is 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 claim 1, wherein, The sending of the n TBs to the second network element comprises: sending the n TBs to the second network element in one time domain transmission unit; the time domain transmission unit comprises 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 claim 1, wherein, 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.

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

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

17. The method of claim 15, wherein, The method further comprises: performing channel decoding on the first-type TBs in the n TBs; determining whether the k first-type TBs have been successfully acquired; in a case where there is at least one TB in the k first-type TBs that has not been successfully acquired, performing channel decoding on the second-type TBs in the n TBs; in a case where there is at least one TB in the k first-type TBs that has not been successfully acquired and there is a second-type TB in the n TBs that has been successfully channel decoded, performing corresponding decoding operations based on the successfully acquired TBs in the k first-type TBs and the second-type TB that has been successfully channel decoded, to acquire the TB in the k first-type TBs that has not been successfully acquired.

18. The method of claim 17, wherein, The method further comprises: sending feedback information to the first network element, wherein the feedback information includes at least one of the following: feedback information indicating that the TB set is successfully transmitted, wherein the TB set being successfully transmitted means that the second network element has successfully acquired the k first-type TBs; feedback information indicating that the TB set is unsuccessfully transmitted, wherein the TB set being unsuccessfully transmitted means that the second network element has not successfully acquired at least one TB in the k first-type TBs; feedback information of each TB in the n TBs, wherein the feedback information of each TB is used to indicate whether the corresponding TB has been successfully acquired by the second network element.

19. The method of claim 15, wherein, Before the receiving of the n TBs from the first network element on the physical channel, the method further comprises at least one of the following: acquiring scheduling information of the TB set, wherein the scheduling information of the TB set is used to schedule the transmission of the TBs in the TB set; determining the size of each first-type TB in the TB set.

20. The method of claim 19, wherein, The scheduling information includes at least one of the following: 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, wherein the common MCS is used to indicate that the TBs in the TB set are transmitted using the same MCS; a number of common spatial multiplexing layers corresponding to the TB set, wherein 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; a code word index used for the transmission of the TBs in the TB set; a mapping rule used for the transmission of the TBs in the TB set; transmission resource location information corresponding to each TB currently being transmitted in the TB set; a number of REs corresponding to each TB in the TB set; an MCS used for transmission of each TB in the TB set; a number of spatial multiplexing layers used for transmission of each TB in the TB set; a packet encoding algorithm used for the TB set; a calculation method of a size of a first type of TB; a number k of first type of TBs in the TB set; a number m of second type of TBs in the TB set; a number n of TBs currently transmitted in the TB set; an index of each TB currently transmitted in the TB set; a packet encoding vector index of each TB currently transmitted in the TB set; a type indication of each TB currently transmitted in the TB set, the type indication being used to indicate a first type of TB or a second type of TB.

21. The method of claim 19, wherein, The method further comprises: 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 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, The determining of 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 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 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, 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; or, 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; or, the number of REs allocated to each of the first type of 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 set of TBs, k denotes the number of the first type TBs; or, the number of REs allocated to each of the first type of 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 set of TBs, k denotes the number of the first type TBs; denotes a floor operator.

24. The method of claim 19, 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).

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

26. The method of claim 15, wherein, The receiving of 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 comprises at least one of the following: a transmission time interval (TTI), a slot, a mini-slot, and a hybrid automatic repeat request (HARQ) process.

27. The method of claim 15, wherein, The 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.

28. A communications device, characterized by The method further comprises: 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 is configured to execute the instructions to perform the method of any one of claims 1-14, or the method of any one of claims 15-27.

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

30. A computer program product, characterised in that, the computer program product comprises computer program instructions, which, when executed by a processor, implement the method of any one of claims 1-14, or the method of any one of claims 15-27.

Images