Communication method and apparatus, storage medium, and program product

By multiplexing UCI into the protocol data unit of the MAC layer and carrying it with PUSCH in future mobile communication systems, the problem of UCI transmission difficulties caused by excessive propagation delay between satellites and terminals is solved, enabling flexible UCI transmission and reducing the complexity of blind detection.

WO2026237689A1PCT designated stage Publication Date: 2026-11-19ZTE CORP
0 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2026/092563
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-05-15
Filing Date
2026-04-23
Publication Date
2026-11-19

AI Technical Summary

Technical Problem

In future mobile communication systems, the propagation delay between satellites and terminals will be much greater than that of normal terrestrial networks, making it impossible for existing technical solutions to effectively transmit uplink control information, especially UCI. Furthermore, the constraints on the timeline are too tight, making it difficult to adapt to the communication needs of non-terrestrial networks.

Method used

Uplink control information (UCI) is multiplexed into the protocol data unit of the media access control layer and carried by the physical uplink shared channel (PUSCH). It is then processed by the MAC layer to reduce timeline constraints and achieve more flexible transmission.

Benefits of technology

By processing UCI through the MAC layer, the strict constraints on the timeline are reduced, the flexibility and adaptability of UCI transmission are improved, the communication delay characteristics of non-terrestrial networks are adapted, and the complexity of blind detection is reduced.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2026092563_19112026_PF_FP_ABST
    Figure CN2026092563_19112026_PF_FP_ABST
Patent Text Reader

Abstract

A communication method and apparatus, a storage medium, and a program product. The method is applied to a first node, and comprises: sending a first message to a second node, the first message comprising uplink control information, the uplink control information being multiplexed into a protocol data unit of a media access control layer, and the protocol data unit of the media access control layer being carried in a physical uplink shared channel.
Need to check novelty before this filing date? Find Prior Art

Description

Communication methods, devices, storage media and software products

[0001] This disclosure claims priority to Chinese patent application No. 202510631847.8, filed on May 15, 2025, the entire contents of which are incorporated herein by reference. Technical Field

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

[0003] With the development of communication technology, the most important technical guarantee for future mobile communication systems is the convergence and interoperability of terrestrial networks (TN) and non-terrestrial networks (NTN). This involves maintaining connections in areas where terrestrial networks cannot cover through spacecraft, aircraft, and satellites, and organically integrating with terrestrial networks. However, the distance between satellites and terminals is much greater than the distance between terrestrial base stations and terminals. This results in propagation delays between satellites and terminals that far exceed the transmission delays of normal terrestrial networks, posing a significant challenge to signal transmission and rendering conventional terrestrial network communication technologies unsuitable for non-terrestrial networks. Summary of the Invention

[0004] On the one hand, a communication method is provided, which is applied to a first node and includes: sending a first message to a second node, the first message including uplink control information, the uplink control information being multiplexed into a protocol data unit of the media access control layer, the protocol data unit of the media access control layer being carried in a physical uplink shared channel.

[0005] On the other hand, a communication method is provided, which is applied to a second node, comprising: receiving a first message from a first node, the first message including uplink control information, the uplink control information being multiplexed into a protocol data unit of the media access control layer, the protocol data unit of the media access control layer being carried in a physical uplink shared channel.

[0006] In another aspect, a communication device is provided, applied to a first node, the device comprising: a transmitting module. The transmitting module is configured to transmit a first message to a second node, the first message including uplink control information, the uplink control information being multiplexed into a protocol data unit of the media access control layer, the protocol data unit of the media access control layer being carried in a physical uplink shared channel.

[0007] In another aspect, a communication device is provided, which is applied to a second node. The device includes a receiving module. The receiving module is configured to receive a first message from a first node, the first message including uplink control information, the uplink control information being multiplexed into a protocol data unit of the media access control layer, the protocol data unit of the media access control layer being carried in a physical uplink shared channel.

[0008] 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. When the processor executes the computer program, it implements the communication method of any of the above embodiments.

[0009] 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 communication method of any of the above embodiments.

[0010] In another aspect, a computer program product is provided, which includes computer program instructions that, when executed, implement the communication method of any of the above embodiments. Attached Figure Description

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

[0012] Figure 1 is a schematic diagram of a communication system according to some embodiments of the present disclosure.

[0013] Figure 2 is a flowchart illustrating a communication method according to some embodiments of the present disclosure.

[0014] Figure 3 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0015] Figure 4 is a schematic diagram of a PUSCH timeline definition for transmitting HARQ UCI according to some embodiments of the present disclosure.

[0016] Figure 5 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0017] Figure 6 is a schematic diagram of a PUSCH timeline definition for transmitting CSI reports based on a periodic reference signal according to some embodiments of the present disclosure.

[0018] Figure 7 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0019] Figure 8 is a schematic diagram of a PUSCH timeline definition for transmitting CSI reports based on an aperiodic reference signal according to some embodiments of the present disclosure.

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

[0021] Figure 10 is a schematic diagram of another PUSCH timeline definition for transmitting HARQ UCI according to some embodiments of the present disclosure;

[0022] Figure 11 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0023] Figure 12 is a schematic diagram of another PUSCH timeline definition for transmitting HARQ UCI according to some embodiments of the present disclosure;

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

[0025] Figure 14 is a schematic diagram of a single-bit indicator PUSCH that can carry UCI in a DCI according to some embodiments of the present disclosure.

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

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

[0028] Figure 17 is a schematic diagram of a HARQ codebook and auxiliary information cascading method according to some embodiments of the present disclosure.

[0029] Figure 18 is a schematic diagram of another HARQ codebook and auxiliary information cascading method according to some embodiments of the present disclosure.

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

[0031] Figure 20 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0032] Figure 21 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0033] Figure 22 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0034] Figure 23 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0035] Figure 24 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0036] Figure 25 is a flowchart illustrating another communication method according to some embodiments of the present disclosure.

[0037] Figure 26 is a block diagram of a communication device according to some embodiments of the present disclosure.

[0038] Figure 27 is a block diagram of another communication device according to some embodiments of the present disclosure.

[0039] Figure 28 is a block diagram of another communication device according to some embodiments of the present 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 words "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplarily" 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 the words "exemplarily" or "for example" is intended to present the relevant concepts in a specific 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. Furthermore, "at least one" means one or more, and "multiple" means two or more.

[0044] With the accelerated commercialization of 5G, 6G is gradually becoming a focus of global deployment. The vision, requirements, technical specifications, and research directions of 6G are becoming increasingly clear.

[0045] Regarding 6G, relevant organizations have released a series of frameworks and target documents for future 6G deployment. The goal is to build an endogenous information society through 6G to achieve sustainable development strategies. Objectives include: inclusivity, ubiquitous connectivity, sustainability, innovation, enhanced privacy and security, standardization, and interoperability. Trends are reflected in: ubiquitous artificial intelligence, ubiquitous computing power, immersive multimedia and multi-sensory interaction, digital twins and virtual worlds, smart industry, digital health, ubiquitous connectivity, converged sensing communications, and sustainable development.

[0046] Ubiquitous connectivity, a key goal and development trend of 6G, relies heavily on the convergence and interoperability of terrestrial and non-terrestrial networks. This involves maintaining connectivity in areas inaccessible to terrestrial networks through spacecraft, aircraft, and satellites, seamlessly integrating with terrestrial networks. Non-terrestrial networks primarily involve communication with ground terminals via satellites and spacecraft, either transparently or non-transparently. Regardless of whether the satellite is in high-orbit, medium-orbit, or low-orbit orbit, the distance to the ground terminal is significantly greater than the distance between a terrestrial base station and the terminal. This results in propagation delays between the satellite and the terminal far exceeding those of normal terrestrial networks, posing a significant challenge to signal transmission and rendering conventional terrestrial network communication technologies unsuitable for non-terrestrial networks.

[0047] Currently, terrestrial network communication systems primarily transmit control information, especially uplink physical layer or lower layer control information (i.e., UCI), through the physical uplink control channel (PUCCH) or the physical uplink shared channel (PUSCH).

[0048] PUCCH is suitable for transmitting acknowledgement (ACK) / negative acknowledgement (NACK), scheduling request (SR), and channel state information (CSI) reported based on periodic or semi-persistent scheduling reference signals, but the size of this information cannot be too large. PUSCH is also suitable for transmitting ACK / NACK, SR, and CSI information reported based on aperiodic or semi-persistent scheduling reference signals, and the size of this information can be relatively large. The corresponding uplink control information (UCI) is directly multiplexed onto PUSCH without processing by other layers, such as Packet Data Convergence Protocol (PDCP), Radio Link Control (RLC), or Media Access Control (MAC). Whether PUCCH or PUSCH carries UCI, their common characteristic is that the uplink control information is essentially highly synchronized reporting information, with strong scheduling coupling between the physical downlink control channel (PDSCH), downlink reference signals, and PUSCH / PUCCH. Specifically, these UCIs are transmitted on PUCCH or PUSCH, and there are clear and strong timing constraints between them and their corresponding PDSCH and downlink reference signals. Moreover, the timelines are relatively compact, which ensures the timeliness of feedback or information reporting.

[0049] However, future mobile communication systems (such as 6G) will introduce non-terrestrial networks, characterized by propagation delays between satellites and terminals that far exceed those of normal terrestrial networks. This poses a significant challenge to existing UCI transmissions, which are constrained by relatively tight timing relationships. Considering that channel states are relatively stable during satellite-to-ground communication due to atmospheric vacuum and direct sunlight, relaxing the timing requirements for UCI transmission is reasonable. UCI transmission does not need to maintain overly strong timing constraints with PDSCH and downlink reference signals; quasi-synchronous or asynchronous control information reporting is acceptable. Therefore, optimizing or redesigning UCI transmission for non-terrestrial network scenarios could involve moving UCI transmission from the physical layer's PUCCH or PUSCH to the MAC layer. Relevant UCI information would be formed or multiplexed at the MAC layer, with the PUSCH carrying the transmission channel containing this MAC layer.

[0050] Similarly, future mobile communication systems may encounter scenarios where some terminals are slow terminals with a low probability of prolonged changes in the channel environment. For example, the terminal may remain stationary for extended periods, or the channel statistical characteristics may be very stable. Communication between such terminals and the network, similar to communication between NTN terminals and the NTN network, can tolerate longer and more flexible air interface delays. Related UCI information can also be formed or multiplexed into MAC protocol data units (PDUs), and the PUSCH will carry the transmission channel containing this MAC PDU.

[0051] In summary, this disclosure provides a communication method that multiplexes UCI into a MAC PDU, more specifically, into the MAC control element (CE) or MAC service data unit (SDU) within the MAC PDU, and then uses a PUSCH to carry the transmission channel containing this MAC PDU. That is, by carrying UCI processed by the MAC layer via the PUSCH, the constraints on the timing line are reduced, allowing for greater flexibility. This solves the problem of strong timing constraints when directly carrying UCI via PUCCH or PUSCH, ensuring that UCI transmission does not maintain an overly strong timing relationship constraint with the PDSCH and downlink reference signal.

[0052] As exemplarily shown in FIG1, which is a schematic diagram of a communication system according to an embodiment of the present disclosure, the communication system may include: a first node 101 and a second node 102. There may be one or more first nodes 101 and second nodes 102, and the number is not limited.

[0053] The first node 101 is used to send a first message including uplink control information to the second node 102. The uplink control information is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel to realize the transmission of uplink control information.

[0054] The second node 102 is used to receive a first message including uplink control information from the first node 101, and the uplink control information is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel to realize the transmission of uplink control information.

[0055] The first node 101 can be a terminal device with wireless transceiver capabilities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, wireless terminals in self-driving vehicles, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, etc. The embodiments of this disclosure do not limit the application scenarios of user equipment. Terminal devices may also be referred to as terminals, users, access terminals, user equipment (UE), UE units, UE stations, mobile stations, mobile stations, remote stations, transmitters, remote terminals, mobile devices, UE terminals, wireless communication equipment, UE agents, or UE devices, etc., and the embodiments of this disclosure do not limit these terms.

[0056] The second node 102 can be a base station. A base station can be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTEA), or an evolved Node B (eNB or eNodeB), a base station device in a 5G network (the next generation nod B, gNB), or a base station in a future communication system, etc. Base stations can include various macro base stations, micro base stations, home base stations, wireless remote extensions, reconfigurable intelligent surfaces (RISS), routers, relay stations, transmission and reception points (TRPs), receivers, access points, transmission points, wireless fidelity (WIFI) devices, spacecraft, aircraft, satellites, and other network-side equipment. A base station can sometimes also be referred to as a reader / writer for communicating with terminals; this disclosure does not limit this usage.

[0057] It should be noted that Figure 1 is only an exemplary framework diagram, and the number of devices included in Figure 1 and the names of each device are not limited.

[0058] The application scenarios of the embodiments disclosed herein are not limited. The system architecture and business scenarios described in the embodiments of this disclosure are for the purpose of more clearly illustrating the technical solutions of the embodiments of this disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of this disclosure. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this disclosure are also applicable to similar technical problems.

[0059] Figure 2 shows a flowchart of a communication method. As shown in Figure 2, this communication method is applied to the first node and includes S201:

[0060] S201. Send a first message to the second node. The first message includes uplink control information. The uplink control information is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel.

[0061] In other words, when the first node sends a UCI to the second node, the UCI can be formed or multiplexed into a MAC PDU, and the PUSCH carries the transmission channel containing this MAC PDU. Transmitting UCI by directly carrying it through the PUCCH or PUSCH imposes strong constraints on the timeline. Transmitting UCI via the PUSCH, after it has undergone PD processing by the MAC layer, reduces these constraints and offers greater flexibility. Specifically, the time constraint is strongest when UCI is directly multiplexed through the PUSCH because no third-party protocol layer is involved. If the MAC layer is introduced, its processing delay is greater than the physical layer delay, and the delay is more flexible, potentially larger or smaller depending on the first node's implementation, rather than having a fixed transmission location as in direct physical layer multiplexing. This ensures that UCI transmission is not subject to excessively strong timing constraints with the PDSCH and downlink reference signal.

[0062] In some embodiments, uplink control information is multiplexed into the service data unit included in the protocol data unit of the media access control layer. Alternatively, uplink control information is multiplexed into the control element included in the protocol data unit of the media access control layer.

[0063] The MAC PDU can be further subdivided into one or more MAC subPDUs. Each MAC subPDU contains one or a combination of the following possible information: MAC subheader, MAC SDU, MAC CE, and padding bits. In other words, UCI, as control information, can be further reused in the MAC CE of the MAC PDU (i.e., the MAC CE included in the MAC layer PDU) or the MAC SDU (i.e., the CE included in the MAC layer PDU).

[0064] In some embodiments, the uplink control information includes at least one of the following: feedback information for a hybrid automatic repeat request, channel state information, and a scheduling request. The feedback information is an acknowledgment or denial message. The channel state information is channel state information based on a periodic reference signal or channel state information based on an aperiodic reference signal.

[0065] In other words, common physical layer control information (i.e., uplink control information) includes HARQ ACK / NACK, SR, and CSI. This disclosure does not limit the specific type of uplink control information. CSI specifically refers to information related to channel measurement, such as Channel State Information Reference Signal Resource Indicator (CSI-RS resource indicator, CRI), Synchronization Signal Block Resource Indicator (SSB resource indicator, SSBRI), Rank Indicator (RI), Precoding Matrix Indicator (PMI), Channel Quality Indicator (CQI), Layer Indicator (LI), Layer 1 Reference Signal Receiving Power (L1-RSRP), and Layer 1 Signal to Interference plus Noise Ratio (L1-SINR). This disclosure does not limit the specific type of CSI. HARQ ACK / NACK can also be called HARQ ACK / NACK, HARQ feedback information, or HARQ feedback.

[0066] In this embodiment, the method of forming or multiplexing UCI to a MAC PDU and having the PUSCH carry the transmission channel containing this MAC PDU generally has lighter constraints on the timeline and greater flexibility. However, this does not mean that UCI reporting can be arbitrarily delayed; necessary timeline constraints are still required. Necessary timeline constraints help the first and second nodes reach a consensus on UCI transmission time, reducing the complexity of blind UCI detection for the second node. The timeline constraints for UCI transmission are described below when UCI is feedback information for hybrid automatic repeat request, channel state information based on periodic reference signals, and channel state information based on aperiodic reference signals.

[0067] Figure 3 shows a flowchart of another communication method. As shown in Figure 3, the uplink control information is feedback information of the hybrid automatic repeat request. Before "sending the first message to the second node" in step S201 above, the method also includes S301, and "sending the first message to the second node" in step S201 above, specifically including S302:

[0068] S301. Receive a second message from the second node. The second message is used as feedback information for the first node to generate a hybrid automatic repeat request.

[0069] S302. At the first moment, send the first message to the second node.

[0070] The first moment is equal to or later than the end of the first duration after the first node receives the second message from the second node.

[0071] In other words, when the physical downlink channel is PDSCH, as shown in Figure 4, when the UCI is the HARQ ACK / NACK of the PDSCH (i.e., the second message) carrying the Transport Block (TB), that is, the PDSCH needs to feed back HARQ ACK / NACK. One timeline definition is: the start of the PUSCH used to transmit the UCI (specifically HARQ ACK / NACK) is no earlier than T after the PDSCH. proc,HARQ The time (i.e., the first duration), that is, the moment when the PUSCH is sent (i.e., the first moment), is no earlier than T. proc,HARQ The end time. More specifically, the PUSCH used for transmitting UCI (specifically HARQ ACK / NACK) starts no earlier than symbol L. L is defined as the next uplink symbol whose cyclic prefix (CP) starts later than T after the end of the last symbol of the PDSCH. proc,HARQ Time. Based on this timeline, the UCI of the HARQ feedback of PDSCH should be no earlier than T after the end of PDSCH. proc,HARQ The time is carried on the PUSCH (such as PUSCH1, PUSCH2, PUSCH3, etc. in Figure 4) (by multiplexing it on the MAC layer PDU).

[0072] In this embodiment, the second node can verify the correctness of the transport block (TB) and generate ACK / NACK. Similarly, ACK / NACK can be generated to verify the correctness of code blocks (CB) and code block groups (CBG). Considering that TB, CB, and CBG are all transmitted via PDSCH, HARQ ACK / NACK can be uniformly defined as HARQ feedback of PDSCH, that is, acknowledging / responding to PDSCH generating HARQ feedback, encompassing all TB, CB, CBG, and other transmission units that may generate HARQ feedback.

[0073] In some embodiments, the second message is sent based on a physical downlink channel, which is either a physical downlink control channel of an unscheduled physical downlink shared channel or a physical downlink shared channel.

[0074] In other words, besides generating HARQ feedback in response to PDSCH as described above, HARQ feedback can also be generated in response to PDCCH in response to non-scheduling PDSCH. For example, this could be a PDCCH that releases a semi-persistent scheduling (SPS) PDSCH, such as a PDCCH indicating SCell dormancy, a PDCCH indicating UE-group common signaling, a PDCCH indicating a cancellation command, or a PDCCH indicating handover. In this case, the timeline is defined by replacing the last symbol of the PDSCH with the last symbol of the PDCCH.

[0075] In some embodiments, the first duration includes at least one of the following: decoding duration of the physical downlink shared channel, generation duration of uplink control information, preparation duration of the physical uplink shared channel, and processing duration of the artificial intelligence model.

[0076] In other words, T proc,HARQ The processing time should include at least one of the following: PDSCH decoding time, HARQ UCI generation time, or PUSCH preparation time. These processing times may vary depending on the UE's capabilities. In other words, the time required to determine T... proc,HARQ At least one of the following processing times should be considered: PDSCH decoding time, HARQ UCI generation time, or PUSCH preparation time. If artificial intelligence processing is additionally introduced into the relevant processing, then T proc,HARQ The processing time for artificial intelligence should be increased at least. The specific components of this processing time can be found in the following examples, and will not be elaborated upon here.

[0077] In this embodiment, the HARQ UCI generation time and the PUSCH preparation time have the same meaning, T proc,HARQ It only needs to include either the HARQ UCI generation time or the PUSCH preparation time.

[0078] For example, when T proc,HARQ When T includes the PDSCH decoding time and the HARQ UCI generation time, proc,HARQ It can be the sum of the PDSCH decoding time and the HARQ UCI generation time.

[0079] Figure 5 shows a flowchart of another communication method. As shown in Figure 5, the uplink control information is channel state information based on a periodic reference signal. Before "sending the first message to the second node" in step S201 above, the method also includes S401, and "sending the first message to the second node" in step S201 above, specifically including S402:

[0080] S401. Receive the third message sent by the second node. The third message is used to instruct the first node to provide feedback on the channel status information.

[0081] S402, at the second moment, send the first message to the second node.

[0082] The second time is equal to or later than the end of the second duration after the first node receives the third message from the second node.

[0083] In other words, when the UCI is a CSI report based on a periodic reference signal, and the CSI report is multiplexed to the MAC and ultimately carried on the PUSCH, the timeline definition depends on the PDCCH (i.e., the third message) that triggers the CSI report. When the CSI request field of the downlink control information (DCI) in the PDCCH triggers a CSI report (a type of UCI) carried on the PUSCH, the first node should provide a valid CSI report.

[0084] As shown in Figure 6, when UCI is CSI based on a periodic reference signal, one definition of a timeline is: the start of the PUSCH or uplink symbol used to transmit UCI (specifically, CSI based on a periodic reference signal) is no earlier than T after the end of the PDCCH that triggers the CSI report. proc,CSI The time (i.e., the second duration), that is, the moment when the PUSCH is sent (i.e., the second time), is equal to or later than T. proc,CSIThe end time. More specifically, the start of the PUSCH carrying the CSI report (multiplexed via MAC) or the first uplink symbol carrying the CSI report should not be earlier than symbol Z, and Z is defined as the next uplink symbol whose CP starts after the end of the last symbol of the PDCCH that triggered the CSI report. proc,CSI Time. In short, a CSI report triggered by a PDCCH should be submitted no earlier than T after the PDCCH ends. proc,CSI The time PUSCH (such as PUSCH1, PUSCH2, PUSCH3, etc. in Figure 6) or uplink symbol is carried (CSI report is multiplexed on MAC layer PDU).

[0085] In some embodiments, the second message is transmitted based on the physical downlink control channel. The second duration includes at least one of the following: decoding duration of the physical downlink control channel, measurement duration of the reference signal, preparation duration of channel state information, preparation duration of the physical uplink shared channel, and processing duration of the artificial intelligence model.

[0086] In other words, T proc,CSI The processing time should include at least one of the following: PDSCH decoding time, reference signal measurement time, CSI preparation time, or PUSCH preparation time. These processing times may vary depending on the UE's capabilities. In other words, the time required to determine T... proc,CSI At least one of the following processing times should be considered: PDSCH decoding time, reference signal measurement time, CSI preparation time, or PUSCH preparation time. If artificial intelligence processing is additionally introduced into the relevant processing, then T proc,CSI The processing time for artificial intelligence should be increased at least. The specific components of this processing time can be found in the following examples, and will not be elaborated upon here.

[0087] In this embodiment, CSI preparation time and PUSCH preparation time have the same meaning, T proc,CSI It only needs to include either the CSI preparation time or the PUSCH preparation time.

[0088] For example, when T proc,CSI When T includes PDSCH decoding time, reference signal measurement time, and CSI preparation time, proc,CSI It can be the sum of the three items: PDSCH decoding time, reference signal measurement time, and CSI preparation time.

[0089] Figure 7 shows a flowchart of another communication method. As shown in Figure 7, the uplink control information is channel state information based on an aperiodic reference signal. Before "sending the first message to the second node" in step S201 above, the method also includes S501, and "sending the first message to the second node" in step S201 above, specifically including S502:

[0090] S501. Receive a third message and a fourth message from the second node. The third message is used to instruct the first node to feed back channel state information, and the fourth message is used to measure channel state information.

[0091] S502. At the third moment, send the first message to the second node.

[0092] The third time is equal to or later than the end of the third duration after the first node receives the fourth message from the second node.

[0093] In other words, when CSI measurements are based on aperiodic reference signals (i.e., the reference signals included in the fourth message are aperiodic reference signals), because the occurrence time of the reference signals is aperiodic, intermittent, or generated on demand, the timeline for completing the CSI report after the measurement is no longer suitable to be determined based on the PDCCH. Instead, the timeline for the CSI report needs to be determined based on the aperiodic reference signals. Aperiodic reference signals include, but are not limited to: aperiodic synchronization signals, Channel State Information Reference Signals (CSI-RS) used for channel measurements, CSI-RS used for interference measurements, or non-zero (NZP) CSI-RS, etc.

[0094] When the UCI is a CSI report based on an aperiodic reference signal, and the CSI report is multiplexed to the MAC and ultimately carried on the PUSCH, the timeline definition depends on the reference signal used to measure the CSI. When the CSI request field of the DCI in the PDCCH triggers a CSI report carried on the PUSCH, the first node should provide a valid CSI report.

[0095] As shown in Figure 8, when UCI is CSI based on an aperiodic reference signal, one definition of a timeline is: the start of the PUSCH or uplink symbol used to transmit UCI (specifically, CSI based on an aperiodic reference signal) is no earlier than T after the reference signal used for CSI measurement. ′ proc,CSI The time (i.e., the third duration), that is, the moment when PUSCH is sent (the third time), is equal to or later than T. ′ proc,CSIThe end time. More specifically, the start of the PUSCH carrying the CSI report (multiplexed via MAC) or the first uplink PUSCH symbol carrying the CSI report should not be earlier than symbol Z. ′ And Z ′ Defined as the next uplink symbol, its CP begins time T after the end of the last symbol of the reference signal. ′ proc,CSI In short, CSI reporting information based on aperiodic reference signals should be submitted no earlier than T after the end of the reference signal. ′ proc,CSI The time-based PUSCH (such as PUSCH1, PUSCH2, PUSCH3, etc. in Figure 8) carries (CSI reports are multiplexed on the MAC layer PDU).

[0096] In some embodiments, the third message is transmitted based on the physical downlink control channel, and the fourth message includes a reference signal. The third duration includes at least one of the following: the measurement duration of the reference signal, the preparation duration of the channel state information, the preparation duration of the physical uplink shared channel, and the processing duration of the artificial intelligence model.

[0097] In other words, T ′ proc,CSI The processing time should include at least one of the following: reference signal measurement time, CSI preparation time, or PUSCH preparation time. These processing times may vary depending on the capabilities of the UE. In other words, the time required to determine T... ′ proc,CSI At least one of the following processing times should be considered: reference signal measurement time, CSI preparation time, or PUSCH preparation time. If artificial intelligence processing is additionally introduced into the relevant processing, then T ′ proc,CSI The processing time for artificial intelligence should be increased at least.

[0098] In this embodiment, CSI preparation time and PUSCH preparation time have the same meaning, T ′ proc,CSI It only needs to include either the CSI preparation time or the PUSCH preparation time.

[0099] For example, when T ′ proc,CSI When T includes the reference signal measurement duration and CSI preparation time, ′ proc,CSI It can be the sum of the reference signal measurement duration and the CSI preparation duration.

[0100] The timeline in the above embodiment only stipulates that any PUSCH after a certain time can carry the HARQ feedback of the PDSCH, and the timeline has a relatively large flexibility. Therefore, the timeline can be further constrained, and the method for further constraining the timeline is introduced below.

[0101] Figure 9 shows a flowchart of another communication method. As shown in Figure 9, the number of first messages is at least one, and each first message includes one uplink control information. One uplink control information corresponds to one physical uplink shared channel. The step S201 above, "sending the first message to the second node", specifically includes S601:

[0102] S601. At a time no earlier than the first, second, and third time, and no later than the fourth time, send at least one first message to the second node.

[0103] The fourth moment is the moment when the Nth first message is sent after any one of the first, second, and third moments. The Nth first message is the last message in at least one first message, and N is an integer greater than or equal to 1.

[0104] In other words, when the physical downlink channel is PDSCH, as shown in Figure 10, when the UCI is the HARQ ACK / NACK of the PDSCH carrying TB, a further constrained timeline is defined as follows: the UCI of the HARQ feedback of the PDSCH should be no earlier than T after the end of the PDSCH. proc,HARQ The first N PUSCH messages are carried (multiplexed on the MAC layer PDU), meaning that N first messages are sent to the second node no earlier than the first time step and no later than the fourth time step. For example, when N is 2, the UCI of the HARQ feedback of the PDSCH can be carried on PUSCH1 and PUSCH2 in Figure 10. N can be predefined by the protocol or flexibly configured by higher-layer signaling.

[0105] More specifically, the PUSCH start point used for transmitting UCI (specifically HARQ ACK / NACK) is no earlier than symbol L. L is defined as the next uplink symbol, whose CP start point is later than the end of the last symbol of the PDSCH that requires HARQ feedback, followed by a T. proc,HARQ The timing is such that the PUSCH used to transmit the UCI (specifically HARQ ACK / NACK) is no later than the Nth PUSCH after symbol L. This further constraint, which allows HARQ UCI to be sent any N PUSCH before and after symbol L, can effectively reduce the number of blind detections at the second node.

[0106] In one example, similar to HARQ, a further constrained timeline is defined when UCI is a CSI based on a periodic reference signal: the CSI report triggered by the PDCCH should be no earlier than T after the end of the PDCCH. proc,CSI The first N PUSCHs of the time carry N first messages to the second node no earlier than the second time and no later than the fourth time. More specifically, the start of the PUSCH carrying the CSI report (multiplexed via MAC) or the first uplink PUSCH symbol carrying the CSI report should be no earlier than symbol Z, and Z is defined as the next uplink symbol, whose CP starts at time T after the end of the last symbol of the PDCCH that triggered the CSI report. proc,CSI Furthermore, the PUSCH used to transmit CSI reports is no later than the Nth PUSCH following symbol Z.

[0107] In another example, similar to HARQ's further timeline constraint, when UCI is CSI based on a periodic reference signal, a further timeline constraint is defined as follows: CSI reports based on a non-periodic reference signal should be submitted no earlier than T after the end of the reference signal. ′ proc,CSI The first N PUSCHs of the time are carried out, meaning that N first messages are sent to the second node no earlier than the third time and no later than the fourth time. More specifically, the start of the PUSCH carrying the CSI report (multiplexed via MAC) or the first uplink PUSCH symbol carrying the CSI report should not be earlier than symbol Z. ′ And Z ′ Defined as the next uplink symbol, its CP begins time T after the end of the last symbol of the reference signal. ′ proc,CSI And the PUSCH used to transmit CSI reports is no later than symbol Z. ′ The Nth PUSCH thereafter.

[0108] In addition to the method provided in the above embodiments for further constraining the timeline by specifying the first N PUSCHs, there are the following methods for further constraining the timeline.

[0109] Figure 11 shows a flowchart of another communication method. As shown in Figure 11, the number of first messages is at least one, and each first message includes one uplink control information. One uplink control information corresponds to one physical uplink shared channel. The step S201 above, "sending the first message to the second node", specifically includes S701:

[0110] S701. At no earlier than any of the first, second, and third moments, and no later than the fifth moment, send at least one first message to the second node.

[0111] The fifth moment is the end of a preset time period following any one of the first, second, and third moments.

[0112] In other words, as shown in Figure 12, this method of further constraining the timeline does not specify the first N PUSCHs, but rather the T values ​​after the first node receives the PDSCH, that is, after the end of the last symbol of the received PDSCH. proc,HARQ After a certain time, a timer (e.g., timer A) is started. When the physical downlink channel is PDSCH and the UCI is HARQ ACK / NACK for PDSCH carrying TB, this further constraint on the timeline is defined as follows: the HARQ UCI should be no earlier than T after the end of PDSCH. proc,HARQ The time, and before timer A times out, transmits the PUSCH carrying the HARQ feedback UCI, that is, the first node sends at least one first message to the second node no earlier than the first time and no later than the fifth time.

[0113] More specifically, the PUSCH used for transmitting HARQ starts no earlier than symbol L. L is defined as the next uplink symbol whose CP starts later than T after the end of the last symbol of the PDSCH that requires HARQ feedback. proc,HARQ The time, and the timeout period of the timer started after symbol L, for the PUSCH used to transmit HARQ.

[0114] The second node can also set a timer (such as timer B), which is set after the end of the last symbol of the PDSCH transmission, T. proc,HARQ The second node starts after timer B expires, expecting to receive the PUSCH carrying the HARQ UCI before timer B times out. Timer A and timer B may be equal or correlated. Considering the transmission time of the wireless signal in the air between the first and second nodes, i.e., the round trip time (RTT), timer B should be longer than timer A, and the time difference should at least include the RTT.

[0115] In one example, similar to HARQ, when UCI is CSI based on a periodic reference signal, this further constraint on the timeline is defined as follows: CSI reports should be submitted no earlier than T after the end of PDSCH. proc,HARQ The time frame is such that the PUSCH carrying the CSI report is transmitted before timer A expires; that is, the first node sends at least one first message to the second node no earlier than the second time and no later than the fifth time. Similar to HARQ, the second node expects to receive the PUSCH carrying the CSI report before timer B expires.

[0116] In another example, similar to HARQ, when UCI is CSI based on an aperiodic reference signal, this further constraint on the timeline is defined as follows: CSI reports should be submitted no earlier than T after the end of PDSCH. ′ proc,CSI The time frame is such that the first node transmits a PUSCH carrying a CSI report before timer A expires; that is, the first node sends at least one first message to the second node no earlier than the third time and no later than the fifth time. Similar to HARQ, the second node expects to receive a PUSCH carrying a CSI report before timer B expires.

[0117] In some embodiments, the physical uplink shared channel includes at least one of the following: a physical uplink shared channel scheduled by the physical downlink control channel, and a semi-persistently scheduled configuration-granted physical uplink shared channel.

[0118] In other words, the PUSCH mentioned in the above timeline definition includes not only the PUSCH scheduled by PDCCH in Figures 4, 6, 8, 9 and 12, but also the configuration grant (CG) PUSCH that is semi-persistently scheduled.

[0119] The timeline in the above embodiments specifies the earliest possible time for UCI transmission multiplexed in the MAC by the PUSCH bearer, or additionally specifies the latest possible time. This provides sufficient time flexibility for UCI transmission. The timeline rules are predefined rules that are known to both the first and second nodes, which can balance the capability differences and performance requirements between the first and second nodes.

[0120] From the perspective of the first node in network enhancement control, it's possible to consider having the second node indicate which PUSCHs or uplink symbols can carry UCI multiplexed in MAC. Indicating which PUSCHs or uplink symbols can carry UCI multiplexed in MAC can be based on RRC, MAC, or DCI. Among these, indicating via DCI is the most direct and fastest. The following section describes how to specifically indicate which PUSCHs or uplink symbols can carry UCI multiplexed in MAC based on DCI.

[0121] Figure 13 shows a flowchart of another communication method. As shown in Figure 13, before "sending the first message to the second node" in step S201 above, the method further includes S801-S802:

[0122] S801, Receive the fifth message from the second node, the fifth message includes downlink control information.

[0123] The fifth message is sent based on the physical downlink control channel, and the downlink control information is used to schedule the physical uplink shared channel.

[0124] S802. Based on downlink control information, send the first message to the second node.

[0125] In other words, the second node can send a DCI indicating to the first node that a PUSCH carrying a UCI multiplexed in the MAC can be transmitted, so that the first node can subsequently carry a UCI multiplexed in the MAC via the PUSCH. This indication of a PUSCH or uplink symbol carrying a UCI multiplexed in the MAC is more direct and faster.

[0126] The following section explains how to indicate which PUSCH or uplink symbols can carry UCI multiplexed in MAC based on DCI.

[0127] In some embodiments, the downlink control information includes an indicator field. The indicator field is used to indicate at least one of the following: whether the physical uplink shared channel is allowed to carry uplink control information, information related to determining the uplink control information, the type of uplink control information or a combination of uplink control information types, the position of the orthogonal frequency division multiplexing symbol of the uplink control information mapped by the physical uplink shared channel, and the uplink control information being carried by at least one physical uplink shared channel.

[0128] The relevant information includes at least one of the following: physical downlink shared channel, physical downlink control channel, and reference signal. The indication field included in the downlink control information can also be referred to as the UCI indication field in the DCI of the PDCCH that schedules the PUSCH.

[0129] In one example, when the bit width of the UCI indicator field in the DCI of the PDCCH scheduling PUSCH is 1, it can only be indicated by binary '1' or '0' whether the scheduled PUSCH can carry UCI multiplexed in the MAC. That is, the indicator field is used to indicate whether the PUSCH is allowed to carry UCI. By default, PDSCH-related HARQs, PDCCH-related CSI reports, or reference signal-related CSI reports in the above embodiments need to be multiplexed in the MAC. As shown in Figure 14, only the scheduled PUSCH3 with '1' in the corresponding DCI field can carry the HARQ feedback multiplexed by the MAC for the PDSCH. This example does not exclude the possibility that PUSCH3 can carry multiple PDSCH-related HARQs.

[0130] In another example, when the bit width of the UCI indicator field in the DCI of the PDCCH that schedules the PUSCH is multiple, the indicator field can also indicate other information, such as:

[0131] Certain bits (i.e., bit fields) in the indication field may indicate the relevant PDSCH, PDCCH or measurement reference signal (which may also be referred to as a reference signal or a downlink reference signal) for determining UCI, and these bits indicate which UCI related to the PDSCH, PDCCH or measurement reference signal should or may be included in the UCI carried by this PUSCH. When certain bits in the indication field specifically indicate that HARQ feedback is allowed for certain relevant PDSCH and PDCCH, only the HARQ bits generated by the allowed channels may be multiplexed into the MAC and carried by the PUSCH. Similarly, CSI reports generated based on PDCCH and measurement reference signals can only include the indicated relevant channels or reference signals that are allowed to be responded to.

[0132] Certain bits may indicate a UCI type (i.e., the type of UCI) or a type combination (i.e., a combination of UCI types). Certain bits may indicate the types included in the UCI, for example, including only HARQ, only CSI reports, only CSI reports in response to PDCCH, only CSI reports related to reference signals, or indications of more types of UCI. For example, using 3 bits to indicate the type of UCI may be as shown in Table 1. The combinations of UCI types are not limited to the combinations listed in Table 1, and the present disclosure does not limit this.

[0133] Certain bits may indicate the position of the Orthogonal Frequency Division Multiplexing (OFDM) symbols on which the PUSCH maps the UCI. For example, certain bits may indicate from which OFDM symbol of the PUSCH the transport channel formed by the MAC layer should start mapping. For example, the bit field indicates that S (0 < S < 13) is the starting point of the OFDM symbols for multiplexing UCI within the slot.

[0134] Table 1

[0135] Certain bits may indicate that the UCI is carried by at least one PUSCH. When 1 bit determines that the UCI is carried by multiple PUSCHs, in combination with the number of PUSCHs configured by higher layers, it may be determined that multiple PUSCHs after the scheduled PUSCH (including the scheduled PUSCH) may carry the UCI. Alternatively, the bits may indicate which PUSCHs among the multiple PUSCHs after its scheduled PUSCH (including the scheduled PUSCH) can carry the UCI.

[0136] The above indications can be used in combination, potentially saving even more bits. For example, indicating the type contained in a UCI implicitly indicates that the PUSCH can carry a UCI, indirectly saving one bit. For instance, a UCI type indication can be combined with indications of which channels and signals are associated with reusable UCIs, simultaneously indicating in one field the types of UCIs the PUSCH can carry, and the reusable UCIs corresponding to the selectable channels and signals.

[0137] In some embodiments, where the indication field is used to indicate uplink control information that allows the scheduled physical uplink shared channel bearer to be multiplexed into the protocol data unit of the media access control layer, the indication field is also used to indicate at least one of the following:

[0138] Feedback information from all or a first preset number of mixed automatic repeat requests that meet preset time conditions is allowed to be concatenated in sequence to generate a mixed automatic repeat request codebook, and the mixed automatic repeat request codebook is determined as uplink control information.

[0139] All or a first preset number of channel state information that meet the preset time conditions are allowed to be concatenated in sequence to generate a channel state information report, and the channel state information report is identified as uplink control information.

[0140] For any of the first, second, and third moments, the preset time condition can be any of the following: generated after that moment, generated after that moment and before the fourth moment, or generated after that moment and before the fifth moment.

[0141] In other words, when a single bit indicates that the scheduled PUSCH can carry UCI multiplexed in the MAC (i.e., when HARQs related to PDSCH / PDCCH, CSI reports related to PDCCH, or CSI reports related to reference signals that meet the timeline (i.e., preset time conditions) are allowed to be multiplexed in the MAC and transmitted through the PUSCH), multiple PDSCHs may generate HARQ feedback when the PUSCH scheduling frequency is low. Therefore, the indicator field can also be used to indicate that all HARQ feedbacks generated by PDSCHs that meet the timeline constraints are allowed to be concatenated sequentially (ascending or descending) according to the PDSCH transmission order to form a HARQ codebook, multiplexed in the MAC, and carried by a single PUSCH. Because some unscheduled PDCCHs also need to feed back HARQs, similar to PDSCHs participating in HARQ codebook generation. An exception is when the size of the HARQ codebook is limited, and it is not possible to include all HARQ feedback generated by PDSCH / PDCCH that meet the timeline constraints in the HARQ codebook. In such cases, the HARQ feedback of the K PDSCH / PDCCH before PUSCH can be selected based on the K value configured at the higher level (i.e., the first preset number).

[0142] The value of K does not exceed the size of the HARQ codebook. The value of K indicates the maximum number of PDSCH / PDCCHs allowed to generate HARQ feedback. The configuration of K is not limited to the above exceptions. If the higher layer configures a value of K, the second node expects the first node to always feed back HARQs with K PDSCHs.

[0143] Similarly, CSI reports generated based on PDCCH and measurement reference signals also need to be cascaded sequentially to form a complete or multiple-entry CSI report. A similar K-value configuration can also be applied to CSI reporting. Selecting the K PDCCHs preceding the PUSCH to trigger or determine the CSI report based on the reference signal. PDCCHs / reference signals exceeding K will not be reported for CSI.

[0144] Figure 15 shows a flowchart of another communication method. As shown in Figure 15, before "sending the first message to the second node" in step S201 above, the method further includes S901 or S902:

[0145] S901. If the number of feedback messages for the hybrid automatic repeat request that meets the preset time condition is less than the first preset number, fill the idle positions in the hybrid automatic repeat request codebook with bits.

[0146] In other words, even if the actual number of PDSCHs satisfying the timeline is less than K, the first node still needs to fill in the missing bits in the HARQ codebook. The filler bits are preferably NACK, which ensures that the HARQ codebook size remains fixed unless reconfigured at higher layers, reducing ambiguity for the second node when receiving and recognizing HARQs.

[0147] S902. If the number of channel state information that meets the preset time condition is less than the first preset number, fill bits in the idle positions of the channel state information report.

[0148] In other words, similarly, even if the actual number of PDSCHs that meet the timeline is less than K, the first node still needs to fill bits in the CSI report, and the preferred filling bits are NACK.

[0149] In some embodiments, the indication field is also used to indicate at least one of the following: the process index of the physical downlink shared channel, the bitmap of related information, the channel state information reference signal resource indication, the synchronization signal block resource indication, and a second preset number of related information prior to the time of sending the first message.

[0150] In other words, when certain bits in the indication field specifically indicate that certain related PDSCHs are allowed to feed back HARQs, taking the feeding back of HARQs in PDSCHs as an example, the indication field can indicate which PDSCH process IDs are allowed to feed back HARQs, or it can indicate which PDSCHs are allowed to feed back HARQs using a bitmap, or it can provide a value k (i.e., a second preset number) to indicate that the k PDSCHs preceding the PUSCH are allowed to feed back HARQs. Unlike the K configured in higher-layer signaling, k here is indicated by the DCI. Specifically, taking the CSI report generated by the measurement reference signal as an example, the indication field can indicate which CRIs and SSBRIs are allowed to report CSIs. The index can also be called a number.

[0151] In some embodiments, where the indication field is used to indicate that uplink control information is carried by at least one physical uplink shared channel, the indication field is further used to indicate at least one of the following: the at least one physical uplink shared channel is a physical uplink shared channel and a consecutive physical uplink shared channel following the physical uplink shared channel; the position of the at least one physical uplink shared channel following the physical uplink shared channel; the starting physical uplink shared channel among the at least one physical uplink shared channels and the number of at least one physical uplink shared channels; the starting physical uplink shared channel of the at least one physical uplink shared channel; the at least one physical uplink shared channel is a physical uplink shared channel and any physical uplink shared channel following the physical uplink shared channel; and uplink control information is repeatedly transmitted on the at least one physical uplink shared channel.

[0152] In other words, when certain bits indicate that the UCI is carried by at least one PUSCH, the indication field is also used to indicate at least one of the following:

[0153] A bitmap can be used to indicate the position of at least one PUSCH that can carry UCI, starting from the scheduled PUSCH.

[0154] The DCI indicates the number of PUSCHs that can carry UCI, starting from the scheduled PUSCH, i.e., at least one PUSCH is the scheduled PUSCH and the consecutive PUSCHs following the scheduled PUSCH.

[0155] The DCI indicates the starting point of the PUSCH carrying the UCI, i.e., the starting PUSCH of at least one PUSCH.

[0156] The DCI indicates that any one or more PUSCHs carry the UCI, that is, at least one PUSCH is the scheduled PUSCH and any physical PUSCH after the scheduled PUSCH.

[0157] The DCI instructs multiple indicated PUSCHs to repeatedly transmit the same UCI information, that is, to repeatedly transmit the UCI on at least one PUSCH.

[0158] Furthermore, after receiving this DCI instruction, the first node can arbitrarily select one or more of the indicated PUSCHs to carry the UCI. The first node can also transmit the same UCI information on all indicated PUSCHs, which can be interpreted as all other indicated PUSCHs repeatedly transmitting the UCI carried by the first PUSCH. This repeated transmission method can enhance the robustness of the UCI and improve uplink coverage.

[0159] Figure 16 shows a flowchart of another communication method. As shown in Figure 16, before "receiving the fifth message from the second node" in step S801 above, the method further includes step S1001:

[0160] S1001, Send the capability information of the first node to the second node.

[0161] The capability information is used to indicate the processing capability of the first node. The capability information includes at least one of the following: the decoding time of the first node for the physical downlink control channel, the decoding time of the first node for the physical downlink shared channel, the measurement time of the first node for the measurement reference signal, the time of the first node for preparing channel state information, the time of the first node for preparing the physical uplink shared channel, and the processing time of the artificial intelligence model in the first node.

[0162] In other words, under certain indication methods in the indication domain, the timeline in the above embodiments does not need to be defined. However, in order to understand the processing delay capability of the first node, the second node needs the first node to report its relevant processing capabilities to the second node, including but not limited to: PDSCH decoding time (i.e., the decoding time of the first node for the physical downlink control channel), PDCCH decoding time (i.e., the decoding time of the first node for the physical downlink shared channel), HARQ generation time, reference signal measurement time (i.e., the measurement time of the first node for measuring the reference signal), CSI preparation time (i.e., the time of the first node for preparing channel state information), PUSCH preparation time (i.e., the time of the first node for preparing the physical uplink shared channel), or the processing time of the artificial intelligence model (i.e., the processing time of the artificial intelligence model in the first node), etc., so as to avoid instructing the first node to report to the UCI in the DCI if it cannot process in time.

[0163] In some embodiments, the processing time of the artificial intelligence model includes at least one of the following: the processing time of the processing unit of the artificial intelligence model, the loading time of the artificial intelligence model, and the switching time of the artificial intelligence model.

[0164] The processing unit of the artificial intelligence model can be an artificial intelligence processing unit (APU).

[0165] The above embodiments include a HARQ codebook. The HARQ codebook is used when multiple PDSCH / PDCCH may need to feed back multiple HARQ bits, so that multiple single HARQ bits are concatenated into a HARQ information unit.

[0166] In non-ideal wireless transmission scenarios, due to poor downlink channel quality, the first node cannot correctly detect the PDCCH, thus failing to recognize that the second node has already sent the PDSCH and unable to generate a HARQ. This PDCCH loss causes a misalignment between the first and second nodes' understanding of the actual generated codebook, resulting in severe transmission obstacles. For example, before the PUSCH carrying the HARQ, if a timeline shows five PDCCHs scheduled for five PDSCHs, and the third PDCCH is lost by the first node, the second node understands it should receive five valid HARQ bits. However, the first node only sends four valid HARQ bits, leading to a misalignment. Furthermore, the second node cannot determine which PDSCH was incorrectly detected and must retransmit all five PDSCHs together, resulting in significant resource waste.

[0167] To address this issue, additional auxiliary information needs to be provided in the UCI to protect the HARQ codebook. This additional auxiliary information is described below.

[0168] In some embodiments, the hybrid automatic repeat request codebook is generated based on the concatenation of feedback information and auxiliary information from the hybrid automatic repeat request. The auxiliary information includes at least one of the following: hybrid automatic repeat request process number, carrier number, partial bandwidth number, transport block index, code block index, and code block group index.

[0169] In other words, considering that the DCI of the PDCCH that schedules the PDSCH has a HARQ process number, which identifies the process of the PDSCH it schedules, the PDSCH can be effectively distinguished within a complete process cycle. Therefore, adding the HARQ process number as auxiliary information to the generation of the HARQ codebook can solve the problem that the second node cannot identify which PDSCH generates HARQ.

[0170] Similarly, since the carrier and bandwidth part (BWP) of the PDSCH are different, it is necessary to add the carrier number and BWP number as auxiliary information when generating the HARQ codebook.

[0171] Since HARQ is designed for multiple data units such as TB, CB, and CBG carried in parallel in response to PDSCH, it is necessary to add carrier number and BWP number as auxiliary information when generating the HARQ codebook to distinguish between TB, CB, or CBG.

[0172] In some embodiments, the hybrid automatic repeat request codebook is generated based on the concatenation of feedback information and auxiliary information of the hybrid automatic repeat request as follows: for each feedback information of the hybrid automatic repeat request, the feedback information of the hybrid automatic repeat request is concatenated with the auxiliary information associated with the feedback information of the hybrid automatic repeat request to obtain the concatenated information of the feedback information of the hybrid automatic repeat request. Further, the concatenated information of the feedback information of each hybrid automatic repeat request is concatenated to obtain the hybrid automatic repeat request codebook.

[0173] In some embodiments, the hybrid automatic repeat request codebook is generated by concatenating the feedback information and auxiliary information of the hybrid automatic repeat request as follows: The feedback information of all hybrid automatic repeat requests is concatenated to obtain the target concatenated information. Further, the target concatenated information and the auxiliary information associated with the feedback information of each hybrid automatic repeat request are concatenated to obtain the hybrid automatic repeat request codebook.

[0174] In other words, there are two ways to cascade and generate HARQ codebooks:

[0175] Method 1: Each HARQ ACK / NACK is first concatenated with its associated auxiliary information. Then, the next HARQ ACK / NACK and its associated auxiliary information are concatenated together, until all HARQ ACK / NACKs and their associated auxiliary information are concatenated.

[0176] Method 2: First, concatenate each HARQ ACK / NACK. After concatenation is complete, concatenate the auxiliary information associated with the first HARQ ACK / NACK. Then, sequentially concatenate the auxiliary information associated with the next HARQ ACK / NACK until all HARQ ACK / NACK auxiliary information is concatenated.

[0177] For example, the HARQ codebook may allow a maximum of 8 HARQ ACK / NACKs. The HARQ process number is represented using 4 bits, which can be increased to 5 bits or more as the total number of processes increases. The carrier number is represented using a maximum of 3 bits. The BWP number is represented using a maximum of 3 bits. The TB index is represented using 1 bit. The CB / CBG index is represented using a maximum of 3 bits. The HARQ codebook can be expressed as a cascaded example as shown in Figure 17.

[0178] In the approach shown in Figure 17, each HARQ ACK / NACK is first concatenated with its associated HARQ process number, carrier number, BWP number, TB index, and CB / CBG index. Then, the next HARQ ACK / NACK and its associated auxiliary information are concatenated together, until all HARQ ACK / NACKs and auxiliary information are concatenated. The carrier number, BWP number, TB index, and CB / CBG index are optional depending on the actual situation, meaning the number of representation bits is 0. The concatenation order of the HARQ process number, carrier number, BWP number, TB index, and CB / CBG index within the associated auxiliary information is not limited to that shown in Figure 17 and can be freely adjusted.

[0179] In the simplest case, a HARQ ACK / NACK only requires 1 bit of ACK / NAACK plus 4 bits of HARQ process number.

[0180] If backward compatibility with the traditional HARQ codebook is required, a cascading example similar to that shown in Figure 18 can also be used.

[0181] In the method shown in Figure 18, each HARQ ACK / NACK is first concatenated. After concatenation, the HARQ process number, carrier number, BWP number, TB index, CB / CBG index, etc., associated with the first HARQ ACK / NACK are then concatenated. Next, the auxiliary information associated with the next HARQ ACK / NACK is sequentially concatenated until all HARQ ACK / NACK auxiliary information is concatenated. Similarly, the carrier number, BWP number, TB index, and CB / CBG index are optional depending on the actual situation, meaning the number of representation bits is 0. The concatenation order of the HARQ process number, carrier number, BWP number, TB index, and CB / CBG index within the relevant auxiliary information is not limited to that shown in Figure 18 and can be freely adjusted.

[0182] The main types of UCIs mentioned above include HARQ, CSI, and SR. When these UCIs are multiplexed through MAC to form a transmission channel and transmitted via the same PUSCH or multiple overlapping PUSCHs, the multiplexing rules for these various types of UCIs need to be defined. The definition of UCI multiplexing rules is introduced below.

[0183] In some embodiments, uplink control information is multiplexed into the protocol data unit of the media access control layer in at least one of the following ways:

[0184] Uplink control information of the same type is reused as a service data unit, and service data units corresponding to uplink control information of different types are concatenated into the same protocol data unit.

[0185] Uplink control information of the same type is reused as a single control element, and control elements corresponding to uplink control information of different types are concatenated into the same protocol data unit.

[0186] Uplink control information of different types with the same priority is reused to obtain reused information, and uplink control information of different priorities is reused to obtain reused information.

[0187] In other words, different types of UCIs can be reused as separate SDUs and assembled into the same PDU. Or they can be reused as separate MAC CEs and assembled into the same PDU. Or they can be reused into a single SDU.

[0188] UCIs of different priorities are reused separately. High-priority UCIs are reused with each other first, then low-priority UCIs are reused with each other, and then the high-priority reused UCIs and the low-priority reused UCIs are reused together.

[0189] Figure 19 shows a flowchart of another communication method. As shown in Figure 19, this communication method is applied to the second node, including S1101:

[0190] S1101. Receive a first message from the first node. The first message includes uplink control information. The uplink control information is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel.

[0191] For details regarding the first message, please refer to the above embodiments; they will not be repeated here.

[0192] Figure 20 shows a flowchart of another communication method. As shown in Figure 20, the uplink control information is feedback information of the hybrid automatic repeat request. Before "receiving the first message from the first node" in step S1101 above, the method also includes S1201:

[0193] S1201. Send a second message to the first node. The second message is used as feedback information for the first node to generate a hybrid automatic repeat request.

[0194] The first message is sent at the first moment. The first moment is equal to or later than the end of the first duration after the first node receives the second message from the second node.

[0195] For details regarding the second message and the first moment, please refer to the above embodiments; they will not be repeated here.

[0196] Figure 21 shows a flowchart of another communication method. As shown in Figure 21, the uplink control information is channel state information based on a periodic reference signal. Before "receiving the first message from the first node" in step S1101 above, the method further includes S1301:

[0197] S1301. Send a third message to the first node. The third message is used to instruct the first node to provide feedback on channel status information.

[0198] The first message is sent at the second moment, which is equal to or later than the end of the second duration after the first node receives the third message from the second node.

[0199] For details regarding the third message and the second moment, please refer to the above embodiments; they will not be repeated here.

[0200] Figure 22 shows a flowchart of another communication method. As shown in Figure 22, the uplink control information is channel state information based on an aperiodic reference signal. Before "receiving the first message from the first node" in step S1101 above, the method further includes S1401:

[0201] S1401. Send a third message and a fourth message to the first node. The third message is used to instruct the first node to feed back channel state information, and the fourth message is used to measure channel state information.

[0202] The first message is sent at the third moment, which is equal to or later than the end of the third duration after the first node receives the fourth message from the second node.

[0203] For details regarding the third message and the second moment, please refer to the above embodiments; they will not be repeated here.

[0204] In some embodiments, the number of first messages is at least one, and each first message includes an uplink control message, with each uplink control message corresponding to a physical uplink shared channel. At least one first message is transmitted no earlier than any of the first, second, and third time points, and no later than the fourth time point.

[0205] The fourth moment is the moment when the Nth first message is sent after any one of the first, second, and third moments. The Nth first message is the last message in at least one first message, and N is an integer greater than or equal to 1.

[0206] For details regarding the fourth message and the third moment, please refer to the above embodiments; they will not be repeated here.

[0207] In some embodiments, the number of first messages is at least one, and each first message includes an uplink control message, with each uplink control message corresponding to a physical uplink shared channel. At least one first message is transmitted no earlier than any of the first, second, and third time points, and no later than the fifth time point.

[0208] The fifth moment is the end of a preset time period following any one of the first, second, and third moments.

[0209] Figure 23 shows a flowchart of another communication method. As shown in Figure 23, before "receiving the first message from the first node" in step S1101 above, the method further includes S1501:

[0210] S1501. Send the fifth message to the first node. The fifth message includes downlink control information, which is used to schedule the physical uplink shared channel.

[0211] The fifth message is sent via the physical downlink control channel.

[0212] For details regarding the fifth message, please refer to the above embodiments; they will not be repeated here.

[0213] Figure 24 shows a flowchart of another communication method. As shown in Figure 24, before "sending the fifth message to the first node" in step S1501 above, the method further includes step S1601:

[0214] S1601, Receive capability information from the first node.

[0215] The capability information is used to indicate the processing capability of the first node. The capability information includes at least one of the following: the decoding time of the first node for the physical downlink control channel, the decoding time of the first node for the physical downlink shared channel, the measurement time of the first node for the measurement reference signal, the time of the first node for preparing channel state information, the time of the first node for preparing the physical uplink shared channel, and the processing time of the artificial intelligence model in the first node.

[0216] For details regarding capability information, please refer to the above embodiments; they will not be repeated here.

[0217] The following describes the communication method provided in the above embodiment, taking the interaction between the first node and the second node as an example, as shown in Figure 25, including:

[0218] S2501, the first node sends a first message including uplink control information to the second node, and the uplink control information is multiplexed into a Protocol Data Unit (PDU) of the Media Access Control (MAC) layer, which is carried in the Physical Uplink Shared Channel (PUSCH). Correspondingly, the second node receives the first message including uplink control information from the first node, and the uplink control information is multiplexed into a PDU of the MAC layer, which is also carried in the PUSCH. This enables the transmission of UCI (User Information Code) processed by the MAC layer's PDU via the PUSCH.

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

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

[0221] Figure 26 is a block diagram of a communication device according to some embodiments of the present disclosure. The communication device 2600 can be applied to a first node and execute the communication method shown in Figure 2 above. As shown in Figure 26, the communication device 2600 includes: a transmitting module 2601, a receiving module 2602, and a processing module 2603.

[0222] The sending module 2601 is used to send a first message to the second node. The first message includes uplink control information, which is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel.

[0223] In some embodiments, the receiving module 2602 is configured to receive a second message from the second node, the second message being feedback information for the first node to generate a hybrid automatic repeat request. The sending module 2601 is further configured to send a first message to the second node at a first moment. The first moment is equal to or later than the end of a first duration after the first node receives the second message from the second node.

[0224] In some embodiments, the receiving module 2602 is further configured to receive a third message sent by the second node, the third message being used to instruct the first node to provide feedback on channel state information. The sending module 2601 is further configured to send a first message to the second node at a second time. The second time is equal to or later than the end of a second duration after the first node receives the third message from the second node.

[0225] In some embodiments, the receiving module 2602 is further configured to receive a third message and a fourth message from the second node, wherein the third message is used to instruct the first node to feed back channel state information, and the fourth message is used to measure the channel state information. The sending module 2601 is further configured to send a first message to the second node at a third time. The third time is equal to or later than the end time of a third duration after the first node receives the fourth message from the second node.

[0226] In some embodiments, the sending module 2601 is further configured to send at least one first message to the second node at a time no earlier than any of the first, second, and third moments, and no later than the fourth moment. The fourth moment is the time after any of the first, second, and third moments when the Nth first message is sent, and the Nth first message is the last message among the at least one first message, where N is an integer greater than or equal to 1.

[0227] In some embodiments, the sending module 2601 is further configured to send at least one first message to the second node at a time no earlier than any of the first, second, and third moments, and no later than a fifth moment. The fifth moment is the end time of a preset time period following any of the first, second, and third moments.

[0228] In some embodiments, the receiving module 2602 is further configured to receive a fifth message from the second node, the fifth message being transmitted based on the physical downlink control channel, the fifth message including downlink control information used to schedule the physical uplink shared channel. The sending module 2601 is further configured to send a first message to the second node based on the downlink control information.

[0229] In some embodiments, the processing module 2603 is further configured to fill bits in the idle positions of the hybrid automatic repeat request codebook when the number of feedback information of the hybrid automatic repeat request that meets the preset time condition is less than a first preset number. The processing module 2603 is further configured to fill bits in the idle positions of the channel state information report when the number of channel state information that meets the preset time condition is less than a first preset number.

[0230] In some embodiments, the sending module 2601 is further configured to send capability information of the first node to the second node, the capability information being used to indicate the processing capability of the first node. The capability information includes at least one of the following: the decoding time of the first node for the physical downlink control channel, the decoding time of the first node for the physical downlink shared channel, the measurement time of the first node for the measurement reference signal, the time of the first node for preparing channel state information, the time of the first node for preparing the physical uplink shared channel, and the processing time of the artificial intelligence model in the first node.

[0231] Figure 27 is a block diagram of another communication device according to some embodiments of the present disclosure. The communication device 2700 can be applied to a second node and execute the communication method shown in Figure 19 above. As shown in Figure 27, the communication device 2700 includes a receiving module 2701 and a transmitting module 2702.

[0232] The receiving module 2701 is used to receive a first message from the first node. The first message includes uplink control information, which is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel.

[0233] In some embodiments, the sending module 2702 is used to send a second message to the first node, the second message being used as feedback information for the first node to generate a hybrid automatic repeat request.

[0234] In some embodiments, the sending module 2702 is further configured to send a third message to the first node, the third message being used to instruct the first node to provide feedback on channel status information.

[0235] In some embodiments, the sending module 2702 is further configured to send a third message and a fourth message to the first node, wherein the third message is used to instruct the first node to feed back channel state information, and the fourth message is used to measure the channel state information.

[0236] In some embodiments, the sending module 2702 is further configured to send a fifth message to the first node. The fifth message is sent based on the physical downlink control channel and includes downlink control information used to schedule the physical uplink shared channel.

[0237] In some embodiments, the receiving module 2701 is further configured to receive capability information of the first node from the first node, the capability information being used to indicate the processing capability of the first node. The capability information includes at least one of the following: the decoding time of the first node for the physical downlink control channel, the decoding time of the first node for the physical downlink shared channel, the measurement time of the first node for the measurement reference signal, the time of the first node for preparing channel state information, the time of the first node for preparing the physical uplink shared channel, and the processing time of the artificial intelligence model in the first node.

[0238] In implementing the functions of the integrated modules described above in hardware, this disclosure provides another possible structure for the communication device involved in the above embodiments. As shown in FIG28, the communication device 2800 includes a processor 2802 and a bus 2804. In some embodiments, the communication device may further include a memory 2801. In some embodiments, the communication device may further include a communication interface 2803.

[0239] Processor 2802 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 2802 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 2802 may also be a combination of functions implementing computing capabilities, such as a combination of one or more microprocessors, a digital signal processor (DSP), and a microprocessor.

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

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

[0242] In some embodiments, the memory 2801 may exist independently of the processor 2802. The memory 2801 may be connected to the processor 2802 via a bus 2804 and may be used to store instructions or program code. When the processor 2802 calls and executes the instructions or program code stored in the memory 2801, it can implement the communication method provided in the embodiments of this disclosure.

[0243] In other embodiments, the memory 2801 may also be integrated with the processor 2802.

[0244] The 2804 bus can be an extended industry standard architecture (EISA) bus, etc. The 2804 bus can be divided into address bus, data bus, control bus, etc. For ease of representation, only one thick line is used in Figure 28, but this does not indicate that there is only one bus or one type of bus.

[0245] 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 a communication method as described in any of the above embodiments.

[0246] Exemplary examples show that the aforementioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical discs (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 and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0247] This disclosure provides a computer program product containing instructions that, when run on a computer, cause the computer to perform the communication method of any of the above embodiments.

[0248] The above are merely specific embodiments 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, wherein, Applied to the first node, the method includes: A first message is sent to the second node. The first message includes uplink control information, which is multiplexed into the protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel.

2. The method according to claim 1, wherein, The uplink control information is multiplexed into the service data unit included in the protocol data unit of the media access control layer; or... The uplink control information is reused in the control elements included in the protocol data unit of the media access control layer.

3. The method according to claim 2, wherein, The uplink control information includes at least one of the following: feedback information of the hybrid automatic repeat request, channel state information, and scheduling request; The feedback information is either confirmation or denial. The channel state information is either channel state information based on a periodic reference signal or channel state information based on an aperiodic reference signal.

4. The method of claim 3, wherein, The uplink control information is the feedback information of the hybrid automatic repeat request; The method further includes: receiving a second message from the second node, the second message being used as feedback information for the first node to generate a hybrid automatic repeat request; Sending the first message to the second node includes: sending the first message to the second node at a first moment; Wherein, the first time is equal to or later than the end time of the first duration after the first node receives the second message from the second node.

5. The method of claim 4, wherein, The second message is sent based on a physical downlink channel, which is: The physical downlink control channel of the unscheduled physical downlink shared channel; or, Physical downlink shared channel.

6. The method according to claim 4, wherein, The first duration includes at least one of the following: decoding duration of the physical downlink shared channel, generation duration of uplink control information, preparation duration of the physical uplink shared channel, and processing duration of the artificial intelligence model.

7. The method of claim 3, wherein, The uplink control information is the channel state information based on the periodic reference signal; the method further includes: Receive a third message sent by the second node, the third message being used to instruct the first node to feed back channel status information; Sending the first message to the second node includes: At the second moment, the first message is sent to the second node; The second time is equal to or later than the end time of the second duration after the first node receives the third message from the second node.

8. The method of claim 7, wherein, The second message is sent via the physical downlink control channel; The second duration includes at least one of the following: the decoding duration of the physical downlink control channel, the measurement duration of the reference signal, the preparation duration of the channel state information, the preparation duration of the physical uplink shared channel, and the processing duration of the artificial intelligence model.

9. The method of claim 3, wherein, The uplink control information is the channel state information based on the aperiodic reference signal; The method further includes: receiving a third message and a fourth message from the second node, wherein the third message is used to instruct the first node to feed back channel state information, and the fourth message is used to measure the channel state information; Sending the first message to the second node includes: At the third moment, the first message is sent to the second node; The third time is equal to or later than the end time of the third duration after the first node receives the fourth message from the second node.

10. The method of claim 9, wherein, The third message is sent based on the physical downlink control channel, and the fourth message includes a reference signal; The third duration includes at least one of the following: the measurement duration of the reference signal, the preparation duration of the channel state information, the preparation duration of the physical uplink shared channel, and the processing duration of the artificial intelligence model.

11. The method of any one of claims 4, 7, and 9, wherein, The number of the first messages is at least one, and each first message includes one uplink control information, with each uplink control information corresponding to one physical uplink shared channel; Sending the first message to the second node includes: At least one first message shall be sent to the second node no earlier than any of the first, second, and third time points, and no later than the fourth time point; Wherein, the fourth moment is the moment after any one of the first moment, the second moment and the third moment when the Nth first message is sent, and the Nth first message is the last message among the at least one first message, where N is an integer greater than or equal to 1.

12. The method of any one of claims 4, 7, and 9, wherein, The number of the first messages is at least one, and each first message includes one uplink control information, with each uplink control information corresponding to one physical uplink shared channel; Sending the first message to the second node includes: At least one first message is sent to the second node no earlier than any of the first, second, and third moments, and no later than the fifth moment; wherein the fifth moment is the end time of a preset time period following any of the first, second, and third moments.

13. The method according to any one of claims 1, 6, 8, and 10, wherein, The physical uplink shared channel includes at least one of the following: Physical uplink shared channel scheduled by physical downlink control channel; Semi-persistent scheduling is configured to grant physical uplink shared channels.

14. The method of claim 3, wherein, Before sending the first message to the second node, the method further includes: A fifth message is received from the second node. The fifth message is sent based on the physical downlink control channel and includes downlink control information. The downlink control information is used to schedule the physical uplink shared channel. Based on the downlink control information, the first message is sent to the second node.

15. The method according to claim 14, wherein, The downlink control information includes an indication field; The indication field is used to indicate at least one of the following: whether the physical uplink shared channel is allowed to carry the uplink control information; Relevant information used to determine the uplink control information; The type of the uplink control information or a combination of the types of the uplink control information; The physical uplink shared channel maps the position of the orthogonal frequency division multiplexing symbols of the uplink control information; The uplink control information is carried by at least one physical uplink shared channel; The relevant information includes at least one of the following: physical downlink shared channel, physical downlink control channel, and reference signal.

16. The method according to claim 15, wherein, When the indication field is used to indicate uplink control information that allows the scheduled physical uplink shared channel bearer to be multiplexed into the protocol data unit of the media access control layer, the indication field is also used to indicate at least one of the following: Feedback information from all or a first preset number of mixed automatic repeat requests that meet preset time conditions is allowed to be concatenated in sequence to generate a mixed automatic repeat request codebook, and the mixed automatic repeat request codebook is determined as the uplink control information. All or a first preset number of channel state information that meet the preset time condition are allowed to be concatenated in sequence to generate a channel state information report, and the channel state information report is determined as the uplink control information.

17. The method of claim 16, wherein, The method further includes: If the number of feedback messages for a hybrid automatic repeat request that meets the preset time condition is less than the first preset number, bits are filled into the empty positions of the hybrid automatic repeat request codebook; or, If the number of channel state information that meets the preset time condition is less than the first preset number, bits are filled in the idle positions of the channel state information report.

18. The method according to claim 15, wherein, The indication field is also used to indicate at least one of the following: the process index of the physical downlink shared channel, the bit map of the relevant information, the channel state information reference signal resource indication, the synchronization signal block resource indication, and a second preset number of relevant information prior to the time of sending the first message.

19. The method according to claim 18, wherein, When the indication field is used to indicate that the uplink control information is carried by the at least one physical uplink shared channel, the indication field is also used to indicate at least one of the following: The at least one physical uplink shared channel is the physical uplink shared channel and the consecutive physical uplink shared channels following the physical uplink shared channel; The position of the at least one physical uplink shared channel after the physical uplink shared channel; The starting physical uplink shared channel in the at least one physical uplink shared channel and the number of the at least one physical uplink shared channels; The initial physical uplink shared channel of the at least one physical uplink shared channel; The at least one physical uplink shared channel is the physical uplink shared channel and any physical uplink shared channel after the physical uplink shared channel; The uplink control information is repeatedly transmitted on the at least one physical uplink shared channel.

20. The method of claim 14, wherein, Before receiving the fifth message from the second node, the method further includes: Send the capability information of the first node to the second node; the capability information is used to indicate the processing capability of the first node; the capability information includes at least one of the following: The decoding time of the first node for the physical downlink control channel; The decoding time of the first node for the physical downlink shared channel; The first node measures the measurement duration of the reference signal; The time it takes for the first node to prepare channel state information; The duration for the first node to prepare the physical uplink shared channel; The processing time of the artificial intelligence model in the first node.

21. The method according to any one of claims 6, 8, 10, and 20, wherein, The processing time of the artificial intelligence model includes at least one of the following: the processing time of the processing unit of the artificial intelligence model, the loading time of the artificial intelligence model, and the switching time of the artificial intelligence model.

22. The method according to claim 17, wherein, The hybrid automatic repeat request codebook is generated based on the cascaded feedback information and auxiliary information of the hybrid automatic repeat request; The auxiliary information includes at least one of the following: Hybrid Automatic Repeat Request process number, carrier number, partial bandwidth number, transport block index, code block index, and code block group index.

23. The method of claim 22, wherein, The hybrid automatic repeat request codebook is generated by concatenating feedback information and auxiliary information from the hybrid automatic repeat request in the following way: For each feedback information of a hybrid automatic repeat request, the feedback information of the hybrid automatic repeat request is concatenated with the auxiliary information associated with the feedback information of the hybrid automatic repeat request to obtain the concatenated information of the feedback information of the hybrid automatic repeat request. The concatenation information of the feedback information of each of the hybrid automatic repeat requests is concatenated to obtain the hybrid automatic repeat request codebook.

24. The method of claim 22, wherein, The hybrid automatic repeat request codebook is generated by concatenating feedback information and auxiliary information from the hybrid automatic repeat request in the following way: By cascading the feedback information of all mixed automatic repeat requests, the target cascading information is obtained; The target concatenation information and the auxiliary information associated with the feedback information of each of the hybrid automatic repeat requests are concatenated to obtain the hybrid automatic repeat request codebook.

25. The method according to claim 3, wherein, The uplink control information is multiplexed into the protocol data unit of the media access control layer in at least one of the following ways: Uplink control information of the same type is reused into a service data unit, and service data units corresponding to uplink control information of different types are concatenated into the same protocol data unit. Uplink control information of the same type is reused as a control element, and control elements corresponding to uplink control information of different types are concatenated into the same protocol data unit. Uplink control information of different types with the same priority is reused to obtain reused information, and uplink control information of different priorities is reused to obtain reused information.

26. A communication method, wherein, Applied to the second node, the method includes: A first message is received from a first node. The first message includes uplink control information, which is multiplexed into a protocol data unit of the media access control layer. The protocol data unit of the media access control layer is carried in the physical uplink shared channel.

27. The method according to claim 26, wherein, The uplink control information is multiplexed into the service data unit included in the protocol data unit of the media access control layer; or... The uplink control information is reused in the control elements included in the protocol data unit of the media access control layer.

28. The method according to claim 27, wherein, The uplink control information includes at least one of the following: feedback information of the hybrid automatic repeat request, channel state information, and scheduling request; The feedback information is either confirmation or denial. The channel state information is either channel state information based on a periodic reference signal or channel state information based on an aperiodic reference signal.

29. The method of claim 28, wherein, The uplink control information is the feedback information of the hybrid automatic repeat request; the method further includes: Send a second message to the first node, the second message being used as feedback information for the first node to generate a hybrid automatic repeat request; The first message is sent at a first moment; wherein the first moment is equal to or later than the end of a first duration after the first node receives the second message from the second node.

30. The method of claim 29, wherein, The second message is sent based on a physical downlink channel, which is: The physical downlink control channel of the unscheduled physical downlink shared channel; or, Physical downlink shared channel.

31. The method according to claim 29, wherein, The first duration includes at least one of the following: decoding duration of the physical downlink shared channel, generation duration of uplink control information, preparation duration of the physical uplink shared channel, and processing duration of the artificial intelligence model.

32. The method of claim 28, wherein, The uplink control information is the channel state information based on the periodic reference signal; the method further includes: Send a third message to the first node, the third message being used to instruct the first node to provide feedback on channel status information; The first message is sent at a second time; wherein the second time is equal to or later than the end of a second duration after the first node receives the third message from the second node.

33. The method of claim 32, wherein, The second message is sent via the physical downlink control channel; The second duration includes at least one of the following: the decoding duration of the physical downlink control channel, the measurement duration of the reference signal, the preparation duration of the channel state information, the preparation duration of the physical uplink shared channel, and the processing duration of the artificial intelligence model.

34. The method of claim 28, wherein, The uplink control information is the channel state information based on the aperiodic reference signal; the method further includes: Send a third message and a fourth message to the first node. The third message is used to instruct the first node to feed back channel state information, and the fourth message is used to measure the channel state information. The first message is sent at a third time; wherein the third time is equal to or later than the end time of a third duration after the first node receives the fourth message from the second node.

35. The method of claim 34, wherein, The third message is sent based on the physical downlink control channel, and the fourth message includes a reference signal; The third duration includes at least one of the following: the measurement duration of the reference signal, the preparation duration of the channel state information, the preparation duration of the physical uplink shared channel, and the processing duration of the artificial intelligence model.

36. The method of any one of claims 29, 32, and 34, wherein, The number of the first messages is at least one, and each first message includes one uplink control information, with each uplink control information corresponding to one physical uplink shared channel; At least one first message is sent no earlier than any of the first, second, and third time points, and no later than the fourth time point; Wherein, the fourth moment is the moment after any one of the first moment, the second moment and the third moment when the Nth first message is sent, and the Nth first message is the last message among the at least one first message, where N is an integer greater than or equal to 1.

37. The method of any one of claims 29, 32, and 34, wherein, The number of the first messages is at least one, and each first message includes one uplink control information, with each uplink control information corresponding to one physical uplink shared channel; At least one first message is sent no earlier than any of the first, second, and third moments, and no later than the fifth moment; wherein the fifth moment is the end time of a preset time period following any of the first, second, and third moments.

38. The method according to any one of claims 26, 31, 33, and 35, wherein, The physical uplink shared channel includes at least one of the following: Physical uplink shared channel scheduled by physical downlink control channel; Semi-persistent scheduling is configured to grant physical uplink shared channels.

39. The method of claim 28, wherein, Before receiving the first message from the first node, the method further includes: A fifth message is sent to the first node. The fifth message is sent based on the physical downlink control channel and includes downlink control information. The downlink control information is used to schedule the physical uplink shared channel.

40. The method according to claim 39, wherein, The downlink control information includes an indication field; The indication field is used to indicate at least one of the following: whether the physical uplink shared channel is allowed to carry the uplink control information; Relevant information used to determine the uplink control information; The type of the uplink control information or a combination of the types of the uplink control information; The physical uplink shared channel maps the position of the orthogonal frequency division multiplexing symbols of the uplink control information; The uplink control information is carried by at least one physical uplink shared channel; The relevant information includes at least one of the following: physical downlink shared channel, physical downlink control channel, and reference signal.

41. The method according to claim 40, wherein, When the indication field is used to indicate uplink control information that allows the scheduled physical uplink shared channel bearer to be multiplexed into the protocol data unit of the media access control layer, the indication field is also used to indicate at least one of the following: Feedback information from all or a first preset number of mixed automatic repeat requests that meet preset time conditions is allowed to be concatenated in sequence to generate a mixed automatic repeat request codebook, and the mixed automatic repeat request codebook is determined as the uplink control information. All or a first preset number of channel state information that meet the preset time condition are allowed to be concatenated in sequence to generate a channel state information report, and the channel state information report is determined as the uplink control information.

42. The method according to claim 41, wherein, If the number of feedback messages for the hybrid automatic repeat request that meets the preset time condition is less than the first preset number, the idle positions in the hybrid automatic repeat request codebook are filled with bits. or, If the number of channel state information that meets the preset time condition is less than the first preset number, bits are filled in the idle positions of the channel state information report.

43. The method according to claim 40, wherein, The indication field is also used to indicate at least one of the following: the process index of the physical downlink shared channel, the bit map of the relevant information, the channel state information reference signal resource indication, the synchronization signal block resource indication, and a second preset number of relevant information prior to the time of sending the first message.

44. The method according to claim 43, wherein, When the indication field is used to indicate that the uplink control information is carried by the at least one physical uplink shared channel, the indication field is also used to indicate at least one of the following: The at least one physical uplink shared channel is the physical uplink shared channel and the consecutive physical uplink shared channels following the physical uplink shared channel; The position of the at least one physical uplink shared channel after the physical uplink shared channel; The starting physical uplink shared channel in the at least one physical uplink shared channel and the number of the at least one physical uplink shared channels; The initial physical uplink shared channel of the at least one physical uplink shared channel; The at least one physical uplink shared channel is the physical uplink shared channel and any physical uplink shared channel after the physical uplink shared channel; The uplink control information is repeatedly transmitted on the at least one physical uplink shared channel.

45. The method according to claim 39, wherein, Before sending the fifth message to the first node, the method further includes: Receive capability information from the first node; the capability information is used to indicate the processing capability of the first node; the capability information includes at least one of the following: The decoding time of the first node for the physical downlink control channel; The decoding time of the first node for the physical downlink shared channel; The first node measures the measurement duration of the reference signal; The time it takes for the first node to prepare channel state information; The duration for the first node to prepare the physical uplink shared channel; The processing time of the artificial intelligence model in the first node.

46. ​​The method according to any one of claims 31, 33, 35, and 45, wherein, The processing time of the artificial intelligence model includes at least one of the following: the processing time of the processing unit of the artificial intelligence model, the loading time of the artificial intelligence model, and the switching time of the artificial intelligence model.

47. The method according to claim 42, wherein, The hybrid automatic repeat request codebook is generated based on the cascaded feedback information and auxiliary information of the hybrid automatic repeat request; The auxiliary information includes at least one of the following: Hybrid Automatic Repeat Request process number, carrier number, partial bandwidth number, transport block index, code block index, and code block group index.

48. The method of claim 47, wherein, The hybrid automatic repeat request codebook is generated by concatenating feedback information and auxiliary information from the hybrid automatic repeat request in the following way: For each feedback information of a hybrid automatic repeat request, the feedback information of the hybrid automatic repeat request is concatenated with the auxiliary information associated with the feedback information of the hybrid automatic repeat request to obtain the concatenated information of the feedback information of the hybrid automatic repeat request. The concatenation information of the feedback information of each of the hybrid automatic repeat requests is concatenated to obtain the hybrid automatic repeat request codebook.

49. The method of claim 47, wherein, The hybrid automatic repeat request codebook is generated by concatenating feedback information and auxiliary information from the hybrid automatic repeat request in the following way: By cascading the feedback information of all mixed automatic repeat requests, the target cascading information is obtained; The target concatenation information and the auxiliary information associated with the feedback information of each of the hybrid automatic repeat requests are concatenated to obtain the hybrid automatic repeat request codebook.

50. The method according to claim 28, wherein, The uplink control information is multiplexed into the protocol data unit of the media access control layer in at least one of the following ways: Uplink control information of the same type is reused into a service data unit, and service data units corresponding to uplink control information of different types are concatenated into the same protocol data unit. Uplink control information of the same type is reused as a control element, and control elements corresponding to uplink control information of different types are concatenated into the same protocol data unit. Uplink control information of different types with the same priority is reused to obtain reused information, and uplink control information of different priorities is reused to obtain reused information.

51. A communications device, wherein include: Memory and processor; The memory and the processor are coupled; The memory is used to store instructions that can be executed by the processor; When the processor executes the instructions, it performs the method as described in any one of claims 1-50.

52. A computer readable storage medium, wherein, The computer-readable storage medium includes a non-transitory computer-readable storage medium on which computer instructions are stored, which, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-50.

53. A computer program product, wherein, The computer program product includes computer program instructions that, when executed, implement the method as described in any one of claims 1-50.