Method, device and system for data transmission

Abstract

A method is provided. The method comprises: transmitting one or more bit sets of a first codeword on a first resource; transmitting one or more bit sets of a second codeword on a first portion of a second resource; transmitting one or more bit sets of the first codeword on a second portion of the second resource; receiving feedback indicating that the first codeword is successfully decoded; in response to the feedback, transmission of the one or more bit sets of the first codeword is terminated.

Description

[0001] This application claims priority to U.S. Provisional Patent Application No. 63 / 513,043, filed July 11, 2023, and U.S. Provisional Patent Application No. 63 / 513,040, filed July 11, 2023, the entire contents of each of which are incorporated herein by reference. Technical Field

[0002] This invention relates generally to the field of wireless communication, and more particularly to a method, apparatus, and system for data transmission, as well as a computer-readable storage medium. Background Technology

[0003] Looking towards 6G, two trends have been observed: one is the increasing congestion of spectrum in the sub-3 GHz band, and the other is the growing demand for energy conservation.

[0004] Previous generations of mobile communication (4G and 5G) have utilized higher frequency spectrum to achieve greater bandwidth. However, due to channel propagation characteristics, their coverage is significantly smaller than that of lower frequency bands (e.g., below 3 GHz). Power efficiency is also much lower. Therefore, operators prefer to prioritize lower frequency bands for greater coverage and energy savings. Consequently, the sub-3 GHz band will become increasingly congested.

[0005] A key goal of 6G is to reduce the global carbon footprint, at least without increasing the net energy consumption of 5G. However, the deployment of wireless devices is expected to be more dense, which will naturally increase interference between cells and between devices. Reducing transmission power would offer the dual benefits of energy saving and interference suppression, but at the cost of a lower signal-to-interference-plus-noise ratio (SINR). This presents a dilemma.

[0006] With current technology, several solutions exist to save transmission energy, improve spectral efficiency, and enhance SINR. The first solution is link adaptation and hybrid automatic repeat request (ARQ or HARQ), and the second is power adaptation. Link adaptation and HARQ methods suffer from low spectral efficiency and excessive latency. Power adaptation suffers from both low spectral efficiency and low power efficiency.

[0007] The purpose of describing this background information is to disclose information that the applicant believes may be relevant to the present invention, and it is not intended to acknowledge, nor should it be construed as, any of the foregoing information constituting prior art in relation to the present invention. Summary of the Invention

[0008] According to a first aspect, a method for data transmission is provided. The method can be implemented by a transmitting device or a module (such as a circuit, chip, or chip system) within the transmitting device, or a logic node, logic module, or software capable of performing all or part of the functions of the transmitting device. In an example where the method is applied to a transmitting device, the method includes: transmitting one or more bit sets of a first codeword on a first resource; transmitting one or more bit sets of a second codeword on a first portion of a second resource; transmitting one or more bit sets of the first codeword on a second portion of the second resource; receiving feedback indicating that the first codeword has been successfully decoded; and terminating the transmission of one or more bit sets of the first codeword in response to the feedback.

[0009] At this point, the transmission of the first codeword can occupy a portion of both the first and second resources. The transmission of the second codeword can be punctured by the transmission of the first codeword. Therefore, if the first codeword is not successfully decoded at the end of the first resource, it will be transmitted opportunistically on other resources, and its transmission will not be restricted to the first resource. Consequently, there will be more opportunities to transmit the first codeword, and the probability of successfully decoding it at the receiving device will also increase.

[0010] In some embodiments, the method further includes: sending a first indication, wherein the first indication is used to indicate at least one of the following: the proportion of the second portion of the second resource in the second resource, the quantity of the second portion of the second resource, or the distribution of the second portion of the second resource in the second resource.

[0011] Thus, the transmitting device can notify the receiving device of the information of the second part of the second resource, and the receiving device can know on which resource it will receive the first codeword.

[0012] In one implementation, the second portion of the second resource is evenly distributed throughout the second resource; or the second portion of the second resource is distributed at the beginning of the second resource, at the end of the second resource, or at both the beginning and the end of the second resource.

[0013] Thus, the transmitting device can notify the receiving device of the distribution of the second part of the second resource within the second resource.

[0014] In some embodiments, the second portion of the second resource is used to transmit parity bits.

[0015] At this point, the transmission of the parity check bit of the second codeword can be punctured by the transmission of the first codeword, while the information bits of the second codeword can remain unpunctured. Therefore, the impact of puncturing the transmission of the second codeword can be reduced.

[0016] In some embodiments, the method further includes: transmitting one or more bit sets of a third codeword on a first portion of the third resource; transmitting one or more bit sets of the first codeword on a second portion of the third resource; and transmitting one or more bit sets of the second codeword on a third portion of the third resource.

[0017] At this point, the transmission of the third codeword can be punctured by the transmission of the first and second codewords. Therefore, if the first codeword is not successfully decoded, it will be transmitted opportunistically on the third resource. Similarly, if the second codeword is not successfully decoded, it will be transmitted opportunistically on the third resource. Thus, there are more opportunities to transmit the first and second codewords, and the probability of successfully decoding the first and second codewords at one or more receiving devices also increases.

[0018] In some embodiments, the initial bit set of the first codeword is transmitted earlier than the initial bit set of the second codeword, and the initial bit set of the second codeword is transmitted earlier than the initial bit set of the third codeword; after the first one or more bit sets of the first codeword are transmitted on the second portion of the third resource, the second one or more bit sets of the second codeword are transmitted on the third portion of the third resource.

[0019] Therefore, earlier or older codewords will be transmitted first.

[0020] In some embodiments, the number of the second portion of the second resource is greater than the number of the second portion of the third resource.

[0021] As a result, more resources will be allocated to earlier or older code.

[0022] In some embodiments, the proportion of the second portion of the second resource in the second resource is greater than the proportion of the second portion of the third resource in the third resource.

[0023] As a result, more resources will be allocated to earlier or older code.

[0024] In some embodiments, the method further includes: sending first information, wherein the first information is used to indicate the length of the one or more bit sets of the first codeword, the starting position of the one or more bit sets of the first codeword on the time-frequency resource, or the length of the one or more bit sets of the first codeword and the starting position of the one or more bit sets of the first codeword on the time-frequency resource, wherein the length of the one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in the one or more bit sets of the first codeword, or the maximum transmission length of the one or more bit sets of the first codeword.

[0025] Therefore, the transmitting device can notify the receiving device of the resources used to transmit the first codeword or the limitations of the resources used to transmit the first codeword.

[0026] In one implementation, the length of the one or more bit sets of the first codeword is determined based on at least one of the following: a large-scale channel quality indicator (CQI), a prior feedback, or a modulation and coding scheme (MCS).

[0027] In one implementation, the maximum transmission length is an integer multiple of the minimum transmission length.

[0028] In some embodiments, transmitting the one or more bit sets of the first codeword includes transmitting the one or more bit sets of the first codeword over a plurality of first frequency domain resources.

[0029] In some embodiments, the method further includes: sending second information to a first terminal device, wherein the second information includes a second indication of the plurality of first frequency domain resources.

[0030] Thus, the transmitting device can notify the receiving device of information about multiple first frequency domain resources.

[0031] In one implementation, the second information includes one or more BWP indices or one or more carrier indices.

[0032] In some embodiments, the plurality of first frequency domain resources are obtained through carrier aggregation.

[0033] In some embodiments, receiving the feedback indicating that the first codeword has been successfully decoded includes receiving the feedback on a plurality of second frequency domain resources.

[0034] In some embodiments, multiple first frequency domain resources belong to the FDD downlink frequency band, and multiple second frequency domain resources belong to the FDD uplink frequency band.

[0035] At this time, multiple first-frequency domain resources belong to the FDD downlink frequency band, and multiple second-frequency domain resources belong to the FDD uplink frequency band.

[0036] In one implementation, the duration for transmitting the one or more bit sets on multiple first frequency domain resources is the same as the duration of the reporting window for feedback on multiple second frequency domain resources.

[0037] Therefore, each bit set in one or more bit sets can have a feedback opportunity, and the decoding result of the first codeword will be reported in a timely manner.

[0038] In some embodiments, the plurality of first frequency domain resources and the plurality of second frequency domain resources at least partially overlap.

[0039] In one implementation, at least a portion of time-domain resources, at least a portion of frequency-domain resources, or at least a portion of both time-domain and frequency-domain resources are reserved for receiving the feedback corresponding to the first codeword.

[0040] Therefore, each bit set in one or more bit sets can have a feedback opportunity, and the decoding result of the first codeword will be reported in a timely manner.

[0041] In some embodiments, the method further includes sending a third instruction to cause the receiving device to: receive the one or more bit sets of the first codeword on the first resource, receive the one or more bit sets of the second codeword on the first portion of the second resource, and receive the one or more bit sets of the first codeword on the second portion of the second resource.

[0042] In some embodiments, the method further includes: terminating the transmission of the one or more bit sets of the first codeword when the total length of one or more bit sets of the first codeword that have been transmitted reaches the maximum transmission length.

[0043] At this point, the transmission of the first codeword can be limited to the maximum transmission length, thereby avoiding the allocation of too many resources for the transmission of the first codeword.

[0044] In some embodiments, receiving the feedback indicating that the first codeword has been successfully decoded includes receiving the feedback at one or more feedback opportunities, wherein the one or more feedback opportunities are periodic.

[0045] In some embodiments, the first information is carried in Radio Resource Control (RRC) signaling or Downlink Control Information (DCI).

[0046] In some embodiments, the first codeword is sent to a first terminal device, or the second codeword is sent to a second terminal device, or the first codeword is sent to the first terminal device and the second codeword is sent to the second terminal device.

[0047] At this point, the first codeword and the second codeword can be transmitted to different receiving devices.

[0048] In some embodiments, the method further includes: receiving a second feedback corresponding to the second codeword from the second terminal device on a second frequency domain resource.

[0049] Therefore, the transmitting device can receive feedback corresponding to the first codeword and feedback corresponding to the second codeword on the shared uplink frequency band. This can improve resource utilization.

[0050] According to a second aspect, a method for data transmission is provided. The method can be implemented by a receiving device or a module (such as a circuit, chip, or chip system) within the receiving device, or by a logic node, logic module, or software capable of performing all or part of the functions of the receiving device. In an example where the method is applied to a receiving device, the method includes: receiving one or more bit sets of a first codeword on a first resource; receiving one or more bit sets of a second codeword on a first portion of a second resource; receiving one or more bit sets of the first codeword on a second portion of the second resource; and sending feedback indicating that the first codeword has been successfully decoded.

[0051] In some embodiments, the method further includes: receiving a first instruction, wherein the first instruction is used to indicate at least one of the following: the proportion of the second portion of the second resource in the second resource, the quantity of the second portion of the second resource, or the distribution of the second portion of the second resource in the second resource.

[0052] In one implementation, the second portion of the second resource is evenly distributed throughout the second resource; or the second portion of the second resource is distributed at the beginning of the second resource, at the end of the second resource, or at both the beginning and the end of the second resource.

[0053] In one implementation, the second portion of the second resource is used to transmit parity bits.

[0054] In some embodiments, the method further includes: receiving one or more bit sets of a third codeword on a first portion of the third resource; receiving one or more bit sets of the first codeword on a second portion of the third resource; and receiving one or more bit sets of the second codeword on a third portion of the third resource.

[0055] In some embodiments, the initial bit set of the first codeword is received earlier than the initial bit set of the second codeword, and the initial bit set of the second codeword is received earlier than the initial bit set of the third codeword; after the first one or more bit sets of the first codeword are received on the second portion of the third resource, the second one or more bit sets of the second codeword are received on the third portion of the third resource.

[0056] In some embodiments, the number of the second portion of the second resource is greater than the number of the second portion of the third resource.

[0057] In some embodiments, the proportion of the second portion of the second resource in the second resource is greater than the proportion of the second portion of the third resource in the third resource.

[0058] In some embodiments, the method further includes: receiving first information, wherein the first information is used to indicate the length of the one or more bit sets of the first codeword, the starting position of the one or more bit sets of the first codeword on the time-frequency resource, or the length of the one or more bit sets of the first codeword and the starting position of the one or more bit sets of the first codeword on the time-frequency resource, wherein the length of the one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in the one or more bit sets of the first codeword, or the maximum transmission length of the one or more bit sets of the first codeword.

[0059] In some embodiments, the length of the one or more bit sets of the first codeword is determined based on at least one of the following: a large-scale channel quality indicator (CQI), a prior feedback, or a modulation and coding scheme (MCS).

[0060] In some embodiments, the maximum transmission length is an integer multiple of the minimum transmission length.

[0061] In some embodiments, receiving the one or more bit sets of the first codeword includes receiving the one or more bit sets of the first codeword over a plurality of first frequency domain resources.

[0062] In some embodiments, the method further includes: receiving second information, wherein the second information includes a second indication of the plurality of first frequency domain resources.

[0063] In some embodiments, the second information includes one or more BWP indices and / or one or more carrier indices.

[0064] In some embodiments, the plurality of first frequency domain resources are obtained through carrier aggregation.

[0065] In some embodiments, sending the feedback corresponding to the first codeword includes sending the feedback corresponding to the first codeword on a plurality of second frequency domain resources.

[0066] In some embodiments, a plurality of first frequency domain resources belong to the FDD downlink frequency band, and a plurality of second frequency domain resources belong to the FDD uplink frequency band.

[0067] In some embodiments, the duration for receiving the one or more bit sets on a plurality of first frequency domain resources is the same as the duration of the reporting window for feedback on a plurality of second frequency domain resources.

[0068] In some embodiments, the plurality of first frequency domain resources at least partially overlap with the plurality of second frequency domain resources.

[0069] In some embodiments, at least a portion of time-domain resources, at least a portion of frequency-domain resources, or at least a portion of both time-domain and frequency-domain resources are reserved for sending the feedback corresponding to the first codeword.

[0070] In some embodiments, the method further includes receiving a third instruction, wherein the third instruction is configured to: receive one or more bit sets of the first codeword on the first resource, receive one or more bit sets of the second codeword on the first portion of the second resource, and receive one or more bit sets of the first codeword on the second portion of the second resource.

[0071] In some embodiments, sending the feedback indicating that the first codeword has been successfully decoded includes sending the feedback corresponding to the first codeword at one or more feedback opportunities, wherein the one or more feedback opportunities are periodic.

[0072] In some embodiments, the first information is carried in Radio Resource Control (RRC) signaling or Downlink Control Information (DCI).

[0073] In some embodiments, the method further includes: sending a second feedback corresponding to the second codeword on the second frequency domain resource.

[0074] According to a third aspect, a method for data transmission is provided. The method can be implemented by a receiving device or a module (such as a circuit, chip, or chip system) within the receiving device, or by a logic node, logic module, or software capable of performing all or part of the functions of the receiving device. In an example where the method is applied to a receiving device, the method includes: receiving one or more bit sets of a first codeword on a first resource; receiving one or more bit sets of the first codeword on a second portion of a second resource; and sending feedback indicating that the first codeword has been successfully decoded.

[0075] In some embodiments, the method further includes: receiving a first instruction, wherein the first instruction is used to indicate at least one of the following: the proportion of the second portion of the second resource in the second resource, the quantity of the second portion of the second resource, or the distribution of the second portion of the second resource in the second resource.

[0076] In some embodiments, the second portion of the second resource is uniformly distributed in the second resource; or the second portion of the second resource is distributed at the beginning of the second resource, at the end of the second resource, or at both the beginning and the end of the second resource.

[0077] In some embodiments, the second portion of the second resource is used to transmit parity bits.

[0078] In some embodiments, the method further includes receiving one or more bit sets of the first codeword on a second portion of a third resource.

[0079] In some embodiments, the number of the second portion of the second resource is greater than the number of the second portion of the third resource.

[0080] In some embodiments, the proportion of the second portion of the second resource in the second resource is greater than the proportion of the second portion of the third resource in the third resource.

[0081] In some embodiments, the method further includes: receiving first information, wherein the first information is used to indicate the length of the one or more bit sets of the first codeword, the starting position of the one or more bit sets of the first codeword on the time-frequency resource, or the length of the one or more bit sets of the first codeword and the starting position of the one or more bit sets of the first codeword on the time-frequency resource, wherein the length of the one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in the one or more bit sets of the first codeword, or the maximum transmission length of the one or more bit sets of the first codeword.

[0082] In some embodiments, the length of the one or more bit sets of the first codeword is determined based on at least one of the following: a large-scale channel quality indicator (CQI), prior feedback, or a modulation and coding scheme (MCS).

[0083] In some embodiments, the maximum transmission length is an integer multiple of the minimum transmission length.

[0084] In some embodiments, receiving the one or more bit sets of the first codeword includes receiving the one or more bit sets of the first codeword over a plurality of first frequency domain resources.

[0085] In some embodiments, the method further includes: receiving second information, wherein the second information includes a second indication of the plurality of first frequency domain resources.

[0086] In some embodiments, the second information includes one or more BWP indices or one or more carrier indices.

[0087] In some embodiments, the plurality of first frequency domain resources are obtained through carrier aggregation.

[0088] In some embodiments, sending the feedback indicating that the first codeword has been successfully decoded includes sending the corresponding feedback on a plurality of second frequency domain resources.

[0089] In some embodiments, a plurality of first frequency domain resources belong to the FDD downlink frequency band, and a plurality of second frequency domain resources belong to the FDD uplink frequency band.

[0090] In some embodiments, the duration for receiving the one or more bit sets on a plurality of first frequency domain resources is the same as the duration of the reporting window for feedback on a plurality of second frequency domain resources.

[0091] In some embodiments, the plurality of first frequency domain resources at least partially overlap with the plurality of second frequency domain resources.

[0092] In some embodiments, at least a portion of time-domain resources, at least a portion of frequency-domain resources, or at least a portion of both time-domain and frequency-domain resources are reserved for sending the feedback corresponding to the first codeword.

[0093] In some embodiments, the method further includes receiving a third instruction, wherein the third instruction is configured to receive one or more bit sets of the first codeword on the plurality of first resources, and to receive one or more bit sets of the first codeword on a second portion of the plurality of second resources.

[0094] In some embodiments, sending the feedback indicating that the first codeword has been successfully decoded includes sending the feedback corresponding to the first codeword at one or more feedback opportunities, wherein the one or more feedback opportunities are periodic.

[0095] In some embodiments, the first information is carried in Radio Resource Control (RRC) signaling or Downlink Control Information (DCI).

[0096] According to a fourth aspect, an apparatus is provided. The apparatus includes at least one processor configured to cause the apparatus to perform the methods for data transmission described in the first, second, or third aspect, or any possible implementation thereof.

[0097] According to a fifth aspect, a computer-readable medium is provided. The computer-readable storage medium stores computer program instructions that, when executed by processing circuitry in a computer, cause the computer to implement the methods for data transmission described in the first, second, or third aspects, or any possible implementations of the first, second, or third aspects.

[0098] According to a sixth aspect, a computer program product is provided. The computer program product has instructions that, when executed by a computer, cause the computer to implement the method for data transmission as described in the first, second, or third aspect, or any possible implementation thereof.

[0099] According to a seventh aspect, a system is provided. The system includes: a first apparatus for implementing the method for data transmission in the first aspect or any possible implementation thereof; and a second apparatus for implementing the method for data transmission in the second aspect or a third aspect or any possible implementation thereof.

[0100] The advantages of any of the designs in aspects two through seven can be found in aspect one or different designs of aspect one, and will not be elaborated here.

[0101] Based on the implementation methods provided in the above aspects, the present invention can provide more implementation methods through further combinations. Attached Figure Description

[0102] Figure 1 A communication system that can implement embodiments of the present invention is shown; Figure 2A and Figure 2B Each illustrates another communication system that can implement embodiments of the present invention; Figure 3 An apparatus for wirelessly communicating with at least one device in a communication system according to some embodiments of the present invention is shown; Figure 4A Block diagrams of electronic devices or apparatuses according to some embodiments of the present invention are shown; Figure 4B A block diagram of a perception management function entity according to some embodiments of the present invention is shown; Figure 5A A schematic diagram of different redundancy versions (RVs) in related technologies is shown; Figure 5B An exemplary feedback mechanism in the related art is shown; Figure 6 This is a schematic diagram of a method for data transmission according to some embodiments of the present invention; Figure 7 A signaling diagram of a method for data transmission according to some embodiments of the present invention is shown; Figure 8A and Figure 8B This is a schematic diagram of a method for data transmission according to some embodiments of the present invention; Figure 9 This is another schematic diagram of a method for data transmission according to some embodiments of the present invention; Figure 10 This is yet another schematic diagram of a method for data transmission according to some embodiments of the present invention; Figure 11This is yet another schematic diagram of a method for data transmission according to some embodiments of the present invention; Figure 12 An exemplary frame structure is shown according to some embodiments of the present invention; Figure 13 Another exemplary frame structure is shown according to some embodiments of the present invention; Figure 14 Another exemplary frame structure is shown according to some embodiments of the present invention; Figure 15 Simulation results of energy-saving effects according to some embodiments of the present invention are shown. Detailed Implementation

[0103] To address the aforementioned problems, this invention provides a method for data transmission, which includes multiple solutions. These solutions can be implemented in next-generation mobile and wireless network services, cloud and edge computing services, and sensing services. This method is particularly suitable for automated manufacturing systems in smart factories. It is also applicable to other smart vertical scenarios such as ports, distribution systems, and medical systems.

[0104] refer to Figure 1 A simplified schematic diagram of a communication system is provided as an illustrative, not limiting, example. Communication system 100 includes a radio access network 120. Radio access network 120 may be a next-generation (e.g., sixth-generation, 6G, or later) radio access network, or a traditional (e.g., 5G, 4G, 3G, or 2G) radio access network. In radio access network 120, one or more communication electronic devices 110a to 120j (generally referred to as 110) may be interconnected with each other or connected to one or more network nodes (170a, 170b, generally referred to as 170). Core network 130 may be part of the communication system and may depend on or be independent of the radio access technology used in communication system 100. Furthermore, communication system 100 includes a public switched telephone network (PSTN) 140, the Internet 150, and other networks 160.

[0105] Figure 2AAn exemplary communication system 100 is illustrated. Generally, the communication system 100 enables multiple wireless or wired components to transmit data and other content. The purpose of the communication system 100 may be to provide content such as voice, data, video, and / or text via broadcast, multicast, and unicast. The communication system 100 can operate by sharing resources such as carrier spectrum bandwidth among its constituent components. The communication system 100 may include terrestrial communication systems and / or non-terrestrial communication systems. The communication system 100 can provide a wide range of communication services and applications (e.g., earth monitoring, remote sensing, passive sensing and positioning, navigation and tracking, autonomous delivery, and mobility). The communication system 100 can provide high availability and robustness through the joint operation of terrestrial and non-terrestrial communication systems. For example, integrating a non-terrestrial communication system (or components thereof) into a terrestrial communication system can create a heterogeneous network that can be considered as comprising multiple layers. Compared to traditional communication networks, heterogeneous networks can achieve better overall performance through efficient multi-link joint operation, more flexible function sharing, and faster physical layer link switching between terrestrial and non-terrestrial networks.

[0106] Terrestrial and non-terrestrial communication systems can be considered as subsystems of a communication system. In the example shown, communication system 100 includes electronic devices (EDs) 110a to 110d (generally referred to as ED 110), radio access networks (RANs) 120a and 120b, a non-terrestrial communication network 120c, a core network 130, a public switched telephone network (PSTN) 140, the Internet 150, and other networks 160. RANs 120a and 120b include corresponding base stations (BSs) 170a and 170b, which can generally be referred to as terrestrial transmit and receive points (T-TRPs) 170a and 170b. The non-terrestrial communication network 120c includes access nodes 120c, which can generally be referred to as non-terrestrial transmit and receive points (NT-TRPs) 172.

[0107] Any ED 110 can alternatively or additionally be used to connect to, access, or communicate with any other T-TRP 170a and 170b, NT-TRP 172, Internet 150, core network 130, PSTN 140, other network 160, or any combination thereof. In some examples, ED 110a can communicate uplink and / or downlink with T-TRP 170a via interface 190a. In some examples, ED 110a, 110b, and 110d can also communicate directly with each other via one or more sidelink air interfaces 190b. In some examples, ED 110d can communicate uplink and / or downlink with NT-TRP 172 via interface 190c.

[0108] Air interfaces 190a and 190b can use similar communication technologies, such as any suitable wireless access technology. For example, communication system 100 can implement one or more channel access methods in air interfaces 190a and 190b, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or single-carrier FDMA (SC-FDMA). Air interfaces 190a and 190b can utilize other higher-dimensional signal spaces, which may involve combinations of orthogonal and / or non-orthogonal dimensions.

[0109] The 190c air interface enables communication between the ED 110d and one or more NT-TRP172s via a wireless link or simply via a link. In some examples, the link is a dedicated connection for unicast transmission, a connection for broadcast transmission, or a connection between a group of EDs and one or more NT-TRPs for multicast transmission.

[0110] RANs 120a and 120b communicate with core network 130 to provide various services, such as voice, data, and other services, to EDs 110a, 110b, and 110c. RANs 120a and 120b and / or core network 130 may communicate directly or indirectly with one or more other RANs (not shown), which may or may not be directly served by core network 130, and may or may not use the same radio access technology as RANs 120a, RAN 120b, or both. Core network 130 may also serve as a gateway access between (i) RANs 120a and 120b and / or EDs 110a, 110b, and 110c, and (ii) other networks (e.g., PSTN 140, Internet 150, and other networks 160). Additionally, some or all of the EDs in EDs 110a, 110b, and 110c may include the ability to communicate with different wireless networks via different radio links using different radio technologies and / or protocols. ED 110a, 110b, and 110c can communicate with a service provider or exchange (not shown) via a wired communication channel and with the Internet 150, but not wirelessly (or also wirelessly). PSTN 140 may include a circuit-switched telephone network for providing plain old telephone service (POTS). The Internet 150 may include a network of computers and / or subnets (intranets) and incorporate protocols such as Internet Protocol (IP), Transmission Control Protocol (TCP), and User Datagram Protocol (UDP). ED 110a, 110b, and 110c may be multimode devices capable of operating under various wireless access technologies and may include multiple transceivers required to support such operation.

[0111] Figure 3Another example of the ED 110 and base stations 170a, 170b, and / or 170c is shown. The ED 110 is used to connect people, objects, machines, etc. The ED 110 can be widely used in various scenarios, such as cellular communication, device-to-device (D2D), vehicle-to-everything (V2X), peer-to-peer (P2P), machine-to-machine (M2M), machine-type communications (MTC), Internet of Things (IoT), virtual reality (VR), augmented reality (AR), industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery, and mobility.

[0112] Each ED 110 represents any suitable end-user equipment for wireless operation and may include (or be referred to as): user equipment / device (UE), wireless transmit / receive unit (WTRU), mobile station, fixed or mobile subscriber unit, cellular phone, station (STA), machine-type communication (MTC) device, personal digital assistant (PDA), smartphone, laptop, computer, tablet, wireless sensor, consumer electronics device, smart book, vehicle, automobile, truck, bus, train, IoT device, or industrial equipment or apparatus of the above (e.g., communication module, modem, or chip), etc. Next-generation ED 110 may be referred to using other terms. Base stations 170a and 170b are T-TRPs, referred to below as T-TRP 170. Alternatively... Figure 3 As shown, NT-TRP is referred to as NT-TRP 172 below. Each ED 110 connected to T-TRP 170 and / or NT-TRP 172 can be dynamically or semi-statically turned on (i.e., established, activated, or enabled), turned off (i.e., released, deactivated, or disabled), and / or configured in response to one or more of connectivity availability and connectivity necessity.

[0113] ED 110 includes a transmitter 201 and a receiver 203 coupled to one or more antennas 204. Only one antenna 204 is shown in the figure. One, part, or all of these antennas may also be panels. The transmitter 201 and receiver 203 may be integrated as a transceiver, etc. The transceiver is used to modulate data or other content for transmission through at least one antenna 204 or a network interface controller (NIC). The transceiver is also used to demodulate data or other content received through at least one antenna 204. Each transceiver includes any suitable structure for generating signals for wireless or wired transmission and / or for processing signals received wirelessly or wiredly. Each antenna 204 includes any suitable structure for transmitting and / or receiving wireless or wired signals.

[0114] ED 110 includes at least one memory 208. Memory 208 stores instructions and data used, generated, or collected by ED 110. For example, memory 208 may store software instructions or modules for implementing some or all of the functions and / or embodiments described herein, and executed by one or more processing units 210. Each memory 208 includes any suitable one or more volatile and / or non-volatile storage and retrieval devices. Any suitable type of memory can be used, such as random access memory (RAM), read-only memory (ROM), hard disk, optical disk, subscriber identity module (SIM) card, memory stick, secure digital (SD) memory card, processor cache, etc.

[0115] ED 110 may also include one or more input / output devices (not shown) or interfaces (e.g., Figure 1 (A wired interface to the Internet 150). Input / output devices support interaction with the user or other devices on the network. Each input / output device includes any suitable structure for providing or receiving information from the user, such as a speaker, microphone, keypad, keyboard, display, or touchscreen, including network interface communication.

[0116] ED 110 also includes a processor 210 for performing operations related to: operations related to preparing uplink transmissions to NT-TRP 172 and / or T-TRP 170; operations related to processing downlink transmissions received from NT-TRP 172 and / or T-TRP 170; and operations related to processing sidelink transmissions to and from another ED 110. Processing operations related to preparing uplink transmissions may include operations such as encoding, modulation, transmit beamforming, and generating symbols for transmission. Processing operations related to processing downlink transmissions may include operations such as receive beamforming, demodulation, and decoding of received symbols. According to an embodiment, the downlink transmissions may be received by receiver 203 (possibly using receive beamforming), and processor 210 may extract signaling from the downlink transmissions (e.g., by detecting and / or decoding signaling). Examples of signaling may be reference signals transmitted by NT-TRP 172 and / or T-TRP 170. In some embodiments, processor 276 performs transmit beamforming and / or receive beamforming based on beam direction indications (e.g., beam angle information (BAI)) received from T-TRP 170. In some embodiments, processor 210 may perform operations related to network access (e.g., initial access) and / or downlink synchronization, such as operations related to detecting synchronization sequences, decoding, and acquiring system information. In some embodiments, for example, processor 210 may use reference signals received from NT-TRP 172 and / or T-TRP 170 to perform channel estimation.

[0117] Although not shown, processor 210 may be part of transmitter 201 and / or receiver 203. Although not shown, memory 208 may be part of processor 210.

[0118] The processor 210 and the processing components of the transmitter 201 and receiver 203 may each be implemented by the same or different one or more processors for executing instructions stored in memory (e.g., memory 208). Alternatively, some or all of the processing components in the processor 210 and the transmitter 201 and receiver 203 may be implemented using dedicated circuitry, such as a programmable field-programmable gate array (FPGA), a graphics processing unit (GPU), or an application-specific integrated circuit (ASIC).

[0119] In some implementations, T-TRP 170 may be referred to by other names, such as base station, base transceiver station (BTS), wireless base station, network node, network device, network-side device, transmit / receive node, NodeB, evolved NodeB (eNodeB or eNB), home eNodeB, generation NodeB (gNB), transmission point (TP), site controller, access point (AP) or wireless router, relay station, remote radio head, ground node, ground network device or ground base station, base band unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), location node, etc. T-TRP 170 can be a macro BS, pico BS, relay node, host node, or a combination thereof. T-TRP 170 may refer to the aforementioned equipment or to a component within the aforementioned equipment (e.g., a communication module, modem, or chip).

[0120] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in the ORAN system, CU can also be called open CU (O-CU), DU can also be called open DU (O-DU), CU-CP can also be called open CU-CP (O-CU-CP), CU-UP can also be called open CU-UP (O-CU-UP), and RU can also be called open RU (O-RU).

[0121] Any one of CU (or CU-CP, CU-UP), DU and RU can be implemented through software modules, hardware modules or a combination of software modules and hardware modules.

[0122] In some embodiments, the various parts of T-TRP 170 may be distributed. For example, some modules in T-TRP 170 may be located remotely from the device housing the antenna of T-TRP 170 and may be coupled to the device housing the antenna via a communication link (not shown) sometimes referred to as the fronthaul (e.g., a common public radio interface (CPRI)). Therefore, in some embodiments, the term "T-TRP 170" may also refer to modules on the network side that perform processing operations such as ED 110 location determination, resource allocation (scheduling), message generation, and encoding / decoding, which are not necessarily part of the device housing the antenna of T-TRP 170. These modules may also be coupled to other T-TRPs. In some embodiments, T-TRP 170 may actually be multiple T-TRPs operating together to serve ED 110 through cooperative multicast or similar methods.

[0123] T-TRP 170 includes at least one transmitter 252 and at least one receiver 254 coupled to one or more antennas 256. Only one antenna 256 is shown in the figure. One, part or all of the antennas may also be panels. The transmitter 252 and receiver 254 may be integrated as a transceiver. T-TRP 170 also includes a processor 260 for performing operations related to: preparing downlink transmissions to be transmitted to ED 110, processing uplink transmissions received from ED 110, preparing backlink transmissions to be transmitted to NT-TRP 172, and processing transmissions received from NT-TRP 172 via backlink. Processing operations related to preparing downlink or backlink transmissions may include operations such as encoding, modulation, precoding (e.g., multiple-input multiple-output (MIMO) precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or backlink may include operations such as receive beamforming, demodulation, and decoding of received symbols. Processor 260 can also perform operations related to network access (e.g., initial access) and / or downlink synchronization, such as generating the contents of a synchronization signal block (SSB), generating system information, etc. In some embodiments, processor 260 also generates a beam direction indication, such as a BAI, which can be scheduled for transmission by scheduler 253. Processor 260 can perform other network-side processing operations described herein, such as determining the location of ED 110, determining the location for deploying NT-TRP 172, etc. In some embodiments, processor 260 can generate signaling to configure one or more parameters of ED 110 and / or one or more parameters of NT-TRP 172, etc. Any signaling generated by processor 260 is transmitted by transmitter 252. It should be noted that the term "signaling" as used herein can also be referred to as control signaling. Dynamic signaling can be transmitted in control channels such as the physical downlink control channel (PDCCH), while static or semi-static higher-layer signaling can be included in data packets that are transmitted in data channels such as the physical downlink shared channel (PDSCH).

[0124] Scheduler 253 may be coupled to processor 260. Scheduler 253 may be included within or operate separately from T-TRP 170. T-TRP 170 may schedule uplink, downlink, and / or backlink transmissions, including issuing scheduling authorizations and / or configuring schedule-free (“configuration authorization”) resources. T-TRP 170 also includes memory 258 for storing information and data. Memory 258 stores instructions and data used, generated, or collected by T-TRP 170. For example, memory 258 may store software instructions or modules for implementing some or all of the functions and / or embodiments described herein and executed by processor 260.

[0125] Although not shown, processor 260 may form part of transmitter 252 and / or receiver 254. Similarly, processor 260 may implement scheduler 253, but not shown in the figure. Although not shown, memory 258 may form part of processor 260.

[0126] The processor 260, scheduler 253, and processing components of transmitter 252 and receiver 254 may each be implemented by the same or different one or more processors for executing instructions stored in memory (e.g., memory 258). Alternatively, some or all of the processing components of processor 260, scheduler 253, and transmitter 252 and receiver 254 may be implemented using dedicated circuitry, such as FPGA, GPU, or ASIC.

[0127] Although the NT-TRP 172 is shown as a drone for example only, it can be implemented in any suitable non-terrestrial form. Furthermore, in some implementations, the NT-TRP 172 may have other names, such as a non-terrestrial node, a non-terrestrial network device, or a non-terrestrial base station. The NT-TRP 172 includes a transmitter 272 and a receiver 274 coupled to one or more antennas 280. Only one antenna 280 is shown in the figure. One, some, or all of the multiple antennas may also be panels. The transmitter 272 and receiver 274 may be integrated as a transceiver. The NT-TRP 172 also includes a processor 276 for performing operations related to: preparing downlink transmissions to be sent to ED 110, processing uplink transmissions received from ED 110, preparing backhaul transmissions to be sent to T-TRP 170, and processing transmissions received from T-TRP 170 via backhaul. Processing operations related to preparing downlink or backhaul transmissions may include operations such as encoding, modulation, precoding (e.g., MIMO precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or backhaul may include operations such as receive beamforming, demodulation, and decoding of received symbols. In some embodiments, processor 276 performs transmit beamforming and / or receive beamforming based on beam direction information (e.g., BAI) received from T-TRP 170. In some embodiments, processor 276 may generate signaling to configure one or more parameters of ED 110. In some embodiments, NT-TRP 172 implements physical layer processing but does not implement higher-level functions such as medium access control (MAC) or radio link control (RLC) layer functions. Since this is only an example, in general, NT-TRP 172 may implement higher-level functions in addition to physical layer processing.

[0128] The NT-TRP 172 also includes a memory 278 for storing information and data. Although not shown, a processor 276 may be part of the transmitter 272 and / or receiver 274. Although not shown, the memory 278 may be part of the processor 276.

[0129] The processor 276 and the processing components of the transmitter 272 and receiver 274 may each be implemented by the same or different one or more processors for executing instructions stored in memory (e.g., memory 278). Alternatively, some or all of the processing components of the processor 276 and the transmitter 272 and receiver 274 may be implemented using dedicated circuitry, such as a programmable FPGA, GPU, or ASIC. In some embodiments, the NT-TRP 172 may actually be multiple NT-TRPs operating together to serve ED 110 via cooperative multicast or similar methods.

[0130] T-TRP 170, NT-TRP 172 and / or ED 110 may include other components, but these components have been omitted for clarity.

[0131] One or more steps of the methods in the embodiments provided herein can be derived from... Figure 4A The corresponding unit or module provided will be executed. Figure 4A Units or modules in devices such as ED 110, T-TRP 170, or NT-TRP 172 are illustrated. For example, signals can be transmitted by a transmitting unit or transmitting module. Signals can be received by a receiving unit or receiving module. Signals can be processed by a processing unit or processing module. Other steps can be performed by an artificial intelligence (AI) module or a machine learning (ML) module. The corresponding units or modules can be implemented using hardware, one or more components or devices executing software, or a combination thereof. For example, one or more of these units or modules can be integrated circuits, such as a programmable FPGA, GPU, or ASIC. It should be understood that if these modules are implemented using software executed by a processor, etc., then these modules can be retrieved by the processor, wholly or partially, individually or collectively, for processing, or in one or more instances as needed, and these modules themselves can include instructions for further deployment and instantiation.

[0132] Further details regarding ED 110, T-TRP 170, and NT-TRP 172 are known to those skilled in the art. Therefore, these details are omitted herein.

[0133] 6G Smart Air Interface An air interface typically includes multiple components and associated parameters that collectively specify how transmissions are sent and / or received over a wireless communication link between two or more communication devices. For example, an air interface may include one or more components that define one or more waveforms, one or more frame structures, one or more multiple access schemes, one or more protocols, one or more coding schemes, and / or one or more modulation schemes for transmitting information (e.g., data) over the wireless communication link. The wireless communication link may support links between a radio access network and user equipment (e.g., a Uu link), and / or it may support links between devices, such as links between two user equipment (e.g., a sidelink), and / or it may support links between non-terrestrial (NT) communication networks and user equipment (UE). Below are some examples of the components mentioned above: Waveform components can specify the shape and form of the signal being transmitted. Waveform options can include orthogonal multiple access (OFDM) and non-orthogonal multiple access (NOA) waveforms. Non-limiting examples of such waveform options include orthogonal frequency division multiplexing (OFDM), filtered OFDM (f-OFDM), time-domain windowed OFDM, filter bank multicarrier (FBMC), universal filtered multicarrier (UFMC), generalized frequency division multiplexing (GFDM), wavelet packet modulation (WPM), faster than Nyquist (FTN) waveforms, and low peak-to-average power ratio (LPPR) waveforms (WF).

[0134] The frame structure component can specify the configuration of a frame or frame group. The frame structure component can indicate one or more of the following parameters: time, frequency, pilot signature, code, or other parameters for a frame or frame group. Further details about the frame structure will be discussed below.

[0135] Multiple access scheme components can specify multiple access technology options, including technologies that limit how communication devices share the common physical channel, such as: time division multiple access (TDMA), frequency division multiple access (FDMA), code division multiple access (CDMA), single carrier frequency division multiple access (SC-FDMA), low density signature multicarrier code division multiple access (LDS-MC-CDMA), non-orthogonal multiple access (NOMA), pattern division multiple access (PDMA), lattice partition multiple access (LPMA), resource spread multiple access (RSMA), and sparse code multiple access (SCMA). In addition, multiple access technology options may include: scheduled access and unscheduled access (also known as unlicensed access); non-orthogonal multiple access and orthogonal multiple access, such as via dedicated channel resources (e.g., not shared among multiple communication devices); contention-based shared channel resources and non-contention-based shared channel resources; and access based on sensing radio.

[0136] The Hybrid Automatic Repeat Request (HARQ) protocol component can specify how transmissions and / or retransmissions are performed. Non-limiting examples of transmission and / or retransmission mechanism options include mechanisms for specifying the size of the scheduled data pipeline, signaling mechanisms for transmission and / or retransmission, and retransmission mechanisms themselves.

[0137] Encoding and modulation components can specify how the information being transmitted can be encoded / decoded and modulated / demodulated for transmitting / receiving purposes. Encoding can refer to methods of error detection and forward error correction. Non-limiting examples of encoding options include turbo lattice codes, turbo product codes, fountain codes, low-density parity-check codes, and polar codes. Modulation can simply refer to constellations (e.g., including modulation techniques and orders), or more specifically to various types of advanced modulation methods, such as layered modulation and low PAPR modulation.

[0138] In some embodiments, the air interface can be a "one-size-fits-all" concept. For example, once the air interface is defined, the components within it cannot be changed or adapted. In some implementations, only a limited number of parameters or modes of the air interface can be configured, such as cyclic prefix (CP) length or multiple input multiple output (MIMO) mode. In some embodiments, the air interface design can provide a unified or flexible framework to support frequency bands below 6 GHz and frequency bands above 6 GHz (e.g., millimeter wave) for licensed and unlicensed access. For example, the flexibility of a configurable air interface provided by scalable parameter sets (numerology) and symbol durations can enable optimization of transmission parameters for different spectrum bands and different services / devices. As another example, a unified air interface can be self-contained in the frequency domain, and a frequency-domain self-contained design can support more flexible radio access network (RAN) slicing by sharing channel resources between different services in terms of frequency and time.

[0139] Frame structure The frame structure is a feature of the physical layer of wireless communication, defining the time-domain signal transmission structure to achieve timing reference and timing alignment of basic time-domain transmission units, etc. Wireless communication between communication devices can take place on time-frequency resources controlled by the frame structure. The frame structure can sometimes be alternatively referred to as the wireless frame structure.

[0140] Depending on the frame structure and / or the frame configuration within the frame structure, frequency division duplex (FDD) and / or time division duplex (TDD) and / or full duplex (FD) communication can be performed. FDD communication refers to transmissions in different directions (e.g., uplink and downlink) occurring on different frequency bands. TDD communication refers to transmissions in different directions (e.g., uplink and downlink) occurring within different time periods. FD communication refers to transmission and reception occurring on the same time-frequency resources; that is, the device can simultaneously send and receive on the same frequency resources in time.

[0141] An example of a frame structure is the one specified in Long-Term Evolution (LTE): each frame is 10 ms long; each frame has 10 subframes, each 1 ms long; each subframe includes two time slots, each 0.5 ms long; each time slot is used to transmit 7 OFDM symbols (assuming conventional CP); each OFDM symbol has a symbol duration and a specific bandwidth (or partial bandwidth or bandwidth partitioning) related to the number of subcarriers and subcarrier spacing; the frame structure is based on OFDM waveform parameters, such as subcarrier spacing and CP length (where CP has a fixed length or finite length option); the handover interval between uplink and downlink in TDD must be an integer multiple of the OFDM symbol duration.

[0142] Another example of a frame structure is the one in New Radio (NR) with the following specifications: support for multiple subcarrier intervals, each corresponding to a specific parameter set; the frame structure depends on the parameter set, but in all cases, the frame length is set to 10 ms and consists of 10 subframes, each 1 ms long; a time slot is limited to 14 OFDM symbols, with the slot length depending on the parameter set. For example, the NR frame structure for a standard CP 15 kHz subcarrier interval (parameter set 1) and the NR frame structure for a standard CP 30 kHz subcarrier interval (parameter set 2) are different. For the 15 kHz subcarrier interval, the slot length is 1 ms, and for the 30 kHz subcarrier interval, the slot length is 0.5 ms. The NR frame structure can be more flexible than the LTE frame structure.

[0143] Another example of a frame structure is the exemplary flexible frame structure, such as for 6G networks or later. In a flexible frame structure, symbol blocks can be defined with a minimum duration, which can be scheduled within the flexible frame structure. A symbol block can be a transmission unit with optional redundant portions (e.g., a CP portion) and information portions (e.g., data). An OFDM symbol is an example of a symbol block. A symbol block can also be referred to as a symbol. Embodiments of flexible frame structures include various configurable parameters, such as frame length, subframe length, symbol block length, etc. A non-exhaustive list of possible configurable parameters in some embodiments of flexible frame structures includes: (1) Frame: The frame length is not limited to 10 ms; the frame length can be configurable and vary over time. In some embodiments, each frame includes one or more downlink synchronization channels and / or one or more downlink broadcast channels, each of which can transmit in different directions through different beamforming. The frame length can have more than one possible value and is configured according to the application scenario. For example, autonomous vehicles may require relatively fast initial access, in which case the frame length corresponding to the autonomous vehicle application can be set to 5 ms. As another example, smart meters on a house may not require fast initial access, in which case the frame length corresponding to the smart meter application can be set to 20 ms.

[0144] (2) Subframe duration: Subframes may or may not be defined within a flexible frame structure, depending on the implementation. For example, a frame may be defined to include time slots but not subframes. In frames with defined subframes, the duration of the subframes may be configurable, for example, for temporal alignment. For example, the subframe length may be configured to 0.1 ms, 0.2 ms, 0.5 ms, 1 ms, 2 ms, or 5 ms, etc. In some embodiments, if subframes are not needed in a particular scenario, the subframe length may be defined to be the same as the frame length, or it may not be defined.

[0145] (3) Time Slot Configuration: Time slots may or may not be defined within a flexible frame structure, depending on the implementation. In frames that define time slots, the definition of the time slots (e.g., in terms of duration and / or number of symbol blocks) can be configurable. In one embodiment, the time slot configuration is common to all UEs or a group of UEs. In this case, the time slot configuration information can be sent to the UEs via a broadcast channel or one or more common control channels. In other embodiments, the time slot configuration can be UE-specific, in which case the time slot configuration information can be sent via a UE-specific control channel. In some embodiments, time slot configuration signaling can be sent together with frame configuration signaling and / or subframe configuration signaling. In other embodiments, time slot configuration can be sent independently of frame configuration signaling and / or subframe configuration signaling. Generally, time slot configuration can be system-common, base station-common, UE group-common, or UE-specific.

[0146] (4) Subcarrier spacing (SCS): SCS is a parameter in a scalable parameter set that allows the SCS to range from 15 kHz to 480 kHz. The SCS can vary with the spectral frequency and / or maximum UE velocity to minimize the effects of Doppler frequency offset and phase noise. In some examples, separate transmit and receive frames may exist, and the SCS of symbols in the receive frame structure can be configured independently of the SCS of symbols in the transmit frame structure. The SCS in the receive frame can differ from the SCS in the transmit frame. In some examples, the SCS of each transmit frame can be half the SCS of each receive frame. If the SCS differs between the receive and transmit frames, the difference does not necessarily need to be scaled by a factor of 2, for example, if the inverse discrete Fourier transform (IDFT) is used instead of the fast Fourier transform (FFT) to achieve more flexible symbol durations. Additional examples of frame structures can be used with different SCS.

[0147] (5) Flexible transmission duration of the basic transmission unit: The basic transmission unit can be a symbol block (also called a symbol), which typically includes a redundant portion (called CP) and an information portion (e.g., data), although in some embodiments, the CP can be omitted from the symbol block. The CP length can be flexible and configurable. The CP length can be fixed or flexible within a frame. The CP length may vary between one frame and another, or between one set of frames and another set of frames, or between one subframe and another subframe, or between one time slot and another time slot, or dynamically between one schedule and another schedule. The information portion (e.g., data) can be flexible and configurable. Another possible parameter that can be defined and is related to the symbol block is the ratio of the CP duration to the information (e.g., data) duration. In some embodiments, the symbol block length can be adjusted based on channel conditions (e.g., multipath delay, Doppler); and / or delay requirements; and / or available duration. For example, the symbol block length can be adjusted to accommodate the available duration in the frame.

[0148] (6) Flexible handover gap: A frame may include a downlink portion for downlink transmissions originating from the base station and an uplink portion for uplink transmissions originating from the UE. A gap may exist between each uplink and downlink portion; this gap is called a handover gap. The length (duration) of the handover gap can be configurable. The handover gap duration within a frame can be fixed or flexible. The handover gap duration may vary between one frame and another, or between one set of frames and another set of frames, or between one subframe and another subframe, or between one timeslot and another timeslot, or may change dynamically between one schedule and another.

[0149] Cell / Carrier / Bandwidth Part (BWP) / Occupied Bandwidth Base stations and other equipment can cover a cell. Wireless communication with the device can be conducted via one or more carrier frequencies. A carrier frequency is also called a carrier. A carrier can also be called a component carrier (CC). Characteristics of a carrier can include its bandwidth and reference frequency, such as the center frequency, minimum frequency, or maximum frequency. A carrier can be on licensed or unlicensed spectrum. Wireless communication with the device can also, or alternatively, be conducted on one or more bandwidth parts (BWPs). For example, a carrier can have one or more BWPs. More generally, wireless communication with the device can occur on a spectrum. A spectrum can include one or more carriers and / or one or more BWPs.

[0150] A cell may include one or more downlink resources and optional one or more uplink resources, or a cell may include one or more uplink resources and optional one or more downlink resources, or a cell may include one or more downlink resources and one or more uplink resources. For example, a cell may include only one downlink carrier / BWP, or only one uplink carrier / BWP, or multiple downlink carriers / BWP, or multiple uplink carriers / BWP, or one downlink carrier / BWP and one uplink carrier / BWP, or one downlink carrier / BWP and multiple uplink carriers / BWP, or multiple downlink carriers / BWP and one uplink carrier / BWP, or multiple downlink carriers / BWP and multiple uplink carriers / BWP. In some embodiments, a cell may alternatively or additionally include one or more sidelink resources, including sidelink transmit resources and receive resources.

[0151] A BWP is a set of continuous or discontinuous frequency subcarriers on a carrier, or a set of continuous or discontinuous frequency subcarriers on multiple carriers, or a set of discontinuous or continuous frequency subcarriers, which may have one or more carriers.

[0152] In some embodiments, a carrier may have one or more BWPs. For example, a carrier may have a bandwidth of 20 MHz and consist of one BWP, or a carrier may have a bandwidth of 80 MHz and consist of two adjacent consecutive BWPs, and so on. In other embodiments, a BWP may have one or more carriers. For example, a BWP may have a bandwidth of 40 MHz and consist of two adjacent consecutive carriers, where each carrier has a bandwidth of 20 MHz. In some embodiments, a BWP may include discontinuous spectrum resources consisting of discontinuous multiple carriers, wherein the first carrier in the discontinuous multiple carriers may be in the mmW band, the second carrier may be in a low-frequency band (e.g., the 2 GHz band), the third carrier (if present) may be in the THz band, and the fourth carrier (if present) may be in the visible light band. Resources within a carrier belonging to a BWP may be continuous or discontinuous. In some embodiments, a BWP has discontinuous spectrum resources on a single carrier.

[0153] Wireless communication can occur over occupied bandwidth. Occupied bandwidth can be defined as the width of a frequency band such that the average transmitted power below the lower frequency limit and above the upper frequency limit is equal to a specified percentage β / 2 of the total average transmitted power, for example, β / 2 is 0.5%.

[0154] The carrier, BWP, or occupied bandwidth can be transmitted dynamically by network devices (e.g., in physical layer control signaling such as DCI), semi-statically (e.g., in radio resource control (RRC) signaling or in the medium access control (MAC) layer), or predefined according to the application scenario, or determined by the UE as a function of other parameters known to the UE, or fixed by standards, etc.

[0155] Timed reference points In current networks, frame timing and synchronization are established based on synchronization signals such as the primary synchronization signal (PSS) and the secondary synchronization signal (SSS). It is worth noting that known frame timing and synchronization strategies involve adding timestamps (e.g., (xx0:yy0:zz)) to frame boundaries, where xx0, yy0, and zz can represent time formats such as hours, minutes, and seconds, respectively.

[0156] It is anticipated that different applications and use cases in future networks may involve using frames, time slots, and symbols with different periods to meet different requirements, functions, and quality of service (QoS) types. Therefore, using frames with different periods to meet these applications may pose challenges to frame timing alignment between different frame structures. For example, consider TDD configurations between adjacent carrier frequency bands or sub-bands (or portions) of a channel or carrier bandwidth that are frame timing aligned.

[0157] This invention generally relates to mobile wireless communication, and in certain embodiments, to frame timing alignment / realignment, wherein such frame timing alignment / realignment may include timing alignment / realignment with respect to the boundaries of a frame or a symbol, time slot, or subframe within a frame (therefore, frame timing alignment / realignment here is more general and not limited to the case where timing alignment / realignment comes only from frame boundaries). Furthermore, in this application, the relative timing of a frame or frame boundary should be interpreted in a more general sense, meaning that the frame boundary refers to the timing point of a frame element within a frame (such as the start or end of a frame or a symbol, time slot, or subframe within a frame). In the following, the phrases "(frame) timing alignment or timing realignment" and "relative timing of frame boundaries" are used in the above-described more general sense.

[0158] In summary, various aspects of this application relate to network devices, such as base station 170, hereinafter referred to as TRP 170, that transmit signaling carrying a timing realignment indication message. The timing realignment indication message includes information allowing receiving UE 110 (an example of ED 110) to determine a timing reference point. Based on the timing reference point, the frame transmissions of UE 110 can be aligned. In some aspects of this application, the aligned frames reside in different sub-bands of a carrier frequency band. In other aspects of this application, the aligned frames reside in adjacent carrier frequency bands.

[0159] On the TRP 170 side, aspects of this application relate to using one or more types of signaling to indicate timing realignment (or / and timing correction) messages. Two exemplary types of signaling are provided herein to illustrate these schemes. The first exemplary type of signaling may be referred to as cell-specific signaling, examples of which include group common signaling and broadcast signaling. The second exemplary type of signaling may be referred to as UE-specific signaling. One or a combination of these two types of signaling can be used to transmit timing realignment indication messages. Timing realignment indication messages can notify one or more UEs 110 of the configuration of a timing reference point. In the following, the reference to the term "UE 110" can be understood to refer to a broad category of general wireless communication devices (i.e., network receiving nodes, such as wireless devices, sensors, gateways, routers, etc.) within the cell, that is, devices served by the TRP 170. A timing reference point is a timing reference time point that can be represented by relative timing relative to timing points in a frame (such as the frame or symbols, time slots, or subframes (start or end boundaries)). For simplicity, the term "frame boundary" will be used below to refer to the boundary of a frame or any possible symbols, time slots, or subframes within a frame. Therefore, a timing reference point can be represented using relative timing, taking into account the current frame boundary (e.g., the start of the current frame). Alternatively, the timing reference point can be represented using absolute timing based on a specific standard timing reference (e.g., GNSS, GPS, Coordinated Universal Time, "UTC"), etc. In the absolute timing version of the timing reference point, the timing reference point can be explicitly specified.

[0160] A timing reference point allows timing adjustments to be implemented at UE 110. These adjustments can be made to improve clock accuracy at UE 110. Alternatively or additionally, the timing reference point can support adjustments in future transmissions originating from UE 110. These adjustments enable realignment of transmitted frames at the timing reference point. It should be noted that realigning transmitted frames at the timing reference point can include timing realignment for one or more UEs and one or more BSs (in a cell or a group of cells) starting from the beginning boundary of a frame or a symbol, time slot, or subframe at the timing reference point, which is applicable to the following applications.

[0161] On the UE 110 side, UE 110 can monitor timing realignment indication messages. In response to receiving a timing realignment indication message, UE 110 can obtain a timing reference point and take steps to perform frame realignment at the timing reference point. For example, these steps may include starting the transmission of subsequent frames at the timing reference point.

[0162] Alternatively, before monitoring the timing realignment indication message, UE 110 can send a timing realignment request (i.e., a timing realignment request message) to TRP 170, causing TRP 170 to send a timing realignment indication message. In response to receiving the timing realignment request message, TRP 170 can send a timing realignment indication message to UE 110 including information about the timing reference point, thereby allowing UE 110 to perform timing realignment (or / and timing adjustments including clock timing error correction), wherein the timing realignment is for the UE and one or more base stations in a cell (or a group of cells) regarding the symbols, time slots, or subframes (start boundaries, etc.) within a frame or within a frame.

[0163] According to various aspects of this application, the TRP 170 associated with a given cell can send a timing realignment indication message. The timing realignment indication message may include sufficient information to enable the message receiver to obtain a timing reference point. The timing reference point can be used by one or more UEs 110 in the given cell when performing timing realignment (or / and timing adjustments including clock timing error correction).

[0164] According to various aspects of this application, a timing reference point can be represented relative to a frame boundary within a timing realignment indication message (wherein, as previously stated and applicable hereinafter, a frame boundary can be the boundary of a frame or a symbol, time slot, or subframe within a frame). The timing realignment indication message may include a relative timing indication. Relative timing indication This indicates a specific duration after the frame boundary of a given frame that the timing reference point occurs (i.e., At this point. Since frame boundaries are crucial for UE 110 to determine its timing reference point, UE 110 must know the given frame with the frame boundary of interest. Accordingly, the timing realignment indication message may also include the system frame number (SFN) of the given frame.

[0165] In 5G NR, the value of SFN is known to be in the range of 0 to 1023 (inclusive). Accordingly, 10 bits can be used to represent SFN. When SFN is carried through SSB, 6 of the 10 bits of SFN can be carried through the master information block (MIB), while the remaining 4 bits of SFN can be carried through the physical broadcast channel (PBCH) payload.

[0166] Optionally, the timing realignment indication message may also include other parameters. These other parameters may include the minimum time offset, etc. The minimum time offset determines the duration prior to the timing reference point. UE 110 may rely on the minimum time offset as an indication, meaning that DL signaling including the timing realignment indication message will give UE 110 sufficient time to detect the timing realignment indication message and obtain information about the timing reference point.

[0167] 6G perception and communication integration universal background In cellular communication networks, user equipment (UE) location information is commonly used to improve various network performance metrics. These metrics can include capacity, agility, and efficiency. Improvements can be achieved when network elements utilize the UE's location, behavior, mobility patterns, etc., within the context of prior information describing the radio environment in which the UE operates.

[0168] Sensing systems can be used to help collect UE pose information, including the UE's position in the global coordinate system, its velocity and direction of movement in the global coordinate system, orientation information, and information about the wireless environment. "Location" is also called "position," and the two terms are used interchangeably in this document. Well-known examples of sensing systems include Radio Detection and Ranging (RADAR) and Light Detection and Ranging (LIDAR). While sensing systems can be separated from communication systems, it can be advantageous to collect information using an integrated system, reducing the hardware (and cost) in the system and the time, frequency, or spatial resources required to perform both functions. However, using communication system hardware to perform the sensing of UE pose and environmental information is extremely challenging and remains an open problem. The difficulty of this problem is related to factors such as the limited resolution of the communication system, the dynamic nature of the environment, and the large number of objects whose electromagnetic properties and positions need to be estimated.

[0169] Therefore, sensor-communication integration (also known as communication-sensing integration) is one of the ideal features in existing and future communication systems.

[0170] Sensing nodes and sensing management functions Any or both of ED 110 and BS 170 can be sensing nodes in system 100. A sensing node is a network entity that senses by sending and receiving sensing signals. Some sensing nodes are communication devices that simultaneously communicate and sense. However, some sensing nodes may not communicate but are dedicated solely to sensing. Sensing agent 174 is an example of a sensing node dedicated solely to sensing. Unlike ED 110 and BS 170, sensing agent 174 neither sends nor receives communication signals. However, sensing agent 174 can transmit configuration information, sensing information, signaling information, or other information within communication system 100. Sensing agent 174 can communicate with core network 130 to transmit information with the rest of communication system 100. For example, sensing agent 174 can determine the location of ED 110a and send that information to base station 170a via core network 130. Although... Figure 2B Only one sensing agent 174 is shown, but any number of sensing agents can be implemented in the communication system 100. In some embodiments, one or more sensing agents can be implemented at one or more RAN 120 locations within RAN 120.

[0171] Sensing nodes can combine sensing-based technologies with reference signal-based technologies to enhance UE pose determination. This type of sensing node can also be called a sensing management function (SMF). In some networks, the SMF can also be called a location management function (LMF). The SMF can be implemented as a physically independent entity located at core network 130, which is connected to multiple BSs 170. In other aspects of this application, the SMF can be implemented as a logical entity co-located within BS 170 by logic executed by processor 260.

[0172] like Figure 4BAs shown, when implemented as a physically independent entity, the SMF 176 includes at least one processor 290, at least one transmitter 282, at least one receiver 284, one or more antennas 286, and at least one memory 288. Transceivers (not shown) may be used in place of transmitters 282 and receivers 284. A scheduler 283 may be coupled to the processor 290. The scheduler 283 may be included within the SMF 176 or may operate separately from the SMF 176. The processor 290 implements various processing operations of the SMF 176, such as signal encoding, data processing, power control, input / output processing, or any other functions. The processor 290 may also be used to implement some or all of the functions and / or embodiments described in more detail above. Each processor 290 includes any suitable processing or computing device for performing one or more operations. For example, each processor 290 may include a microprocessor, microcontroller, digital signal processor, field-programmable gate array, or application-specific integrated circuit.

[0173] Reference signal-based pose determination techniques belong to the "active" pose estimation paradigm. In this paradigm, the user (UE) who requests pose information participates in the process of determining their pose. The user can send or receive (or both send and receive) signals specific to the pose determination process. Positioning techniques based on Global Navigation Satellite Systems (GNSS) (such as Global Positioning System (GPS)) are other examples of the active pose estimation paradigm.

[0174] In contrast, perception technologies based on radar and other similar methods can be considered a "passive" pose determination paradigm. In this paradigm, the target is completely unaware of the pose determination process.

[0175] By integrating sensing and communication into a single system, the system is no longer required to operate according to a single paradigm. Therefore, the combination of sensing-based techniques and reference signal-based techniques can lead to enhanced pose determination.

[0176] For example, enhanced pose determination can include acquiring UE channel subspace information, which is particularly useful for UE channel reconstruction at the sensing node, especially for beam-based operations and communications. The UE channel subspace is a subset of the entire algebraic space defined in the spatial domain, containing the entire channel from the TP to the UE. Therefore, the UE channel subspace can very accurately define the channel from the TP to the UE. Signals transmitted in other subspaces contribute negligibly to the UE channel. Understanding the UE channel subspace helps reduce the workload required for UE-side channel measurement and network-side channel reconstruction. Therefore, combining sensing-based techniques with reference signal-based techniques can significantly reduce the overhead of UE channel reconstruction compared to traditional methods. Subspace information can also facilitate subspace-based sensing to reduce sensing complexity and improve sensing accuracy.

[0177] Sensing Channel In some embodiments of integrated sensing and communication, sensing and communication use the same radioaccess technology (RAT). This avoids the need to multiplex two different RATs under a single carrier spectrum, or to provide two different carrier spectrums for two different RATs.

[0178] In embodiments that integrate sensing and communication into a single RAT, a first set of channels can be used to transmit sensing signals, while a second set of channels can be used to transmit communication signals. In some embodiments, each channel in the first set of channels and each channel in the second set of channels is a logical channel, a transport channel, or a physical channel.

[0179] At the physical layer, communication and sensing can be performed through separate physical channels. For example, a first physical downlink shared channel (PDSCH-C) can be designated for data communication, while a second physical downlink shared channel (PDSCH-S) can be designated for sensing. Similarly, separate physical uplink shared channels (PUSCH) PUSCH-C and PUSCH-S can be designated for uplink communication and sensing.

[0180] In another example, the same PDSCH and PUSCH can also be used for communication and sensing, where separate logical layer channels and / or transport layer channels are defined for communication and sensing. It should also be noted that one or more control channels and one or more data channels used for sensing can have the same or different channel structures (formats), occupying the same or different frequency bands or bandwidth portions.

[0181] In yet another example, the common physical downlink control channel (PDCCH) and the common physical uplink control channel (PUCCH) are used to carry control information for both sensing and communication. Alternatively, different physical layer control channels can be used to carry different control information for communication and sensing. For example, PUCCH-S and PUCCH-C can be used for uplink control for sensing and communication respectively, and PDCCH-S and PDCCH-C can be used for downlink control for sensing and communication respectively.

[0182] Sensing and communication can be performed using different combinations of shared channels and dedicated channels at the physical layer, transport layer, and logic layer.

[0183] radar The term "radar" originates from the phrase "radio detection and ranging"; however, expressions with different capitalizations (i.e., Radar and radar) are equally valid and are now more common. Radar is typically used to detect the presence and location of objects. A radar system radiates radio frequency energy and receives the echoes of energy reflected from one or more targets. The system determines the pose of a given target based on the echoes returning from that target. The radiated energy can be in the form of energy pulses or continuous waves, which can be represented or defined by specific waveforms. Examples of waveforms used in radar include frequency-modulated continuous wave (FMCW) waveforms and ultra-wideband (UWB) waveforms.

[0184] Radar systems can be monostatic, bistatic, or multistatic. In a monostatic radar system, the radar transmitter and receiver are located in the same location, for example, integrated into a single transceiver. In a bistatic radar system, the transmitter and receiver are spatially separated, and the separation distance is equal to or greater than the expected target distance (often referred to as range). In a multistatic radar system, two or more radar components are spatially distinct but share a common coverage area. Multistatic radar is also known as multistation or mesh radar.

[0185] Ground-based radar applications face challenges such as multipath propagation and shadowing interference. Another challenge is identifiability, as ground targets share similar physical properties. Integrating sensing into communication systems is likely to present similar, or even more, challenges.

[0186] Half-duplex and full-duplex Communication nodes can be half-duplex or full-duplex. Half-duplex nodes cannot use the same physical resources (time, frequency, etc.) to send and receive simultaneously; conversely, full-duplex nodes can use the same physical resources for both. Existing commercial wireless communication networks are all half-duplex. Even if full-duplex communication networks become a reality in the future, it is expected that at least some nodes in the network will still be half-duplex nodes because half-duplex devices are less complex, less expensive, and consume less power. Specifically, full-duplex implementations are more challenging at higher frequencies (e.g., in the millimeter-wave band) and are particularly challenging for small, low-cost devices (e.g., femtocell base stations and UEs).

[0187] The limitations of half-duplex nodes in communication networks pose further challenges to devices and systems that integrate sensing and communication into these networks. For example, both half-duplex and full-duplex nodes can perform bistatic or multistatic sensing, but monostatic sensing typically requires the sensing node to have full-duplex capability. Half-duplex nodes can perform monostatic sensing under certain constraints, such as in pulse radars with specific duty cycles and ranging capabilities.

[0188] Sensing signal waveform and frame structure The properties of a sensing signal, or a signal used for both sensing and communication, include the signal's waveform and frame structure. The frame structure defines the signal's time-domain boundaries. The waveform describes the shape of the signal as a function of time and frequency. Examples of waveforms that can be used for sensing signals include ultra-wideband (UWB) pulses, frequency-modulated continuous waves (FMCW) or "chirps," orthogonal frequency division multiplexing (OFDM), cyclic prefix (CP)-OFDM, and Discrete Fourier Transform spread (DFT-s)-OFDM.

[0189] In one embodiment, the sensing signal has a bandwidth of And the duration is The linear chirped signal. The use of this linear chirped signal in FMCW radar systems is well-known. The linear chirped signal is generated by the frequency changing from the initial time... initial frequency By the final time final frequency The definition of addition, where frequency ( ) and time ( The relationship between ) can be represented as a linear relationship. ,in, Defined as the chirp slope. The bandwidth of a linear chirped signal can be defined as... The duration of a linear chirped signal can be defined as follows: In baseband representation, this linear chirped signal can be expressed as... .

[0190] precoding As used in this document, precoding can refer to any one or more coding operations or modulations that transform an input signal into an output signal. Precoding can be performed in different domains and typically transforms an input signal in a first domain into an output signal in a second domain. Precoding can include linear operations.

[0191] 6G integrates TN and NTN Terrestrial communication systems can also be called land-based or ground-based communication systems, although they can also be implemented on or under water, either directly or indirectly. Non-terrestrial communication systems can use non-terrestrial nodes to extend the coverage of cellular networks and bridge coverage gaps in underserved areas, which is crucial for ensuring seamless global coverage and providing mobile broadband service to areas with no or insufficient service. At this point, it is virtually impossible to deploy ground access points / base station infrastructure in oceans, mountains, forests, or other remote areas.

[0192] Terrestrial communication systems can be wireless communication systems that use 5G technology and / or next-generation wireless technologies (e.g., 6G or higher). In some examples, terrestrial communication systems may also be compatible with some traditional wireless technologies (e.g., 3G or 4G wireless technologies). Non-terrestrial communication systems can be communication systems using the following satellite constellations: traditional geostationary orbit (GEO) satellites, which broadcast public / popular content to local servers; low earth orbit (LEO) satellites, which strike a better balance between large coverage areas and propagation path loss / latency; satellites stabilized in very low earth orbit (VLEO), which significantly reduce the cost of launching satellites into low orbit; high altitude platforms (HAPs), which provide low path loss air interfaces for users with limited power budgets; and unmanned aerial vehicles (UAVs) (or unmanned aerial systems (UAS)), which can be densely deployed because their coverage can be limited to local areas, such as airborne equipment, balloons, quadcopters, drones, etc. In some examples, GEO satellites, LEO satellites, UAVs, HAPs, and VLEOs can be horizontal and two-dimensional. In some examples, UAVs, HAPs, and VLEOs can be coupled to integrate satellite communications into cellular networks. Emerging 3D vertical networks consist of numerous mobile (excluding geostationary satellites) and high-altitude access points such as UAVs, HAPs, and VLEOs.

[0193] 6G MIMO Multiple-input multiple-output (MIMO) technology supports signal transmission and reception using antenna arrays composed of multiple antennas to meet high transmission rate requirements. The ED 110, T-TRP 170, and / or NT-TRP mentioned above use MIMO for communication over radio resource blocks. MIMO utilizes multiple antennas at the transmitter and / or receiver to transmit radio resource blocks via parallel radio signals. MIMO can beamform the parallel radio signals for reliable multipath transmission of radio resource blocks. MIMO can also bond parallel radio signals carrying different data to increase the data rate of radio resource blocks.

[0194] In recent years, MIMO (Massive MIMO) wireless communication systems with the aforementioned T-TRP 170 and / or NT-TRP 172, equipped with a large number of antennas, have attracted widespread attention from academia and industry. In massive MIMO systems, the T-TRP 170 and / or NT-TRP 172 are typically configured with more than ten antenna elements (e.g., 128 or 256), simultaneously serving dozens of ED110s (e.g., 40). The large number of antenna elements in the T-TRP 170 and NT-TRP 172 significantly increases the spatial freedom of wireless communication, greatly improving transmission rates, spectral efficiency, and power efficiency, and largely eliminating inter-cell interference. The increased number of antennas allows each antenna element to be manufactured in a smaller size and at a lower cost. Utilizing the spatial freedom provided by the large number of antenna elements, each cell's T-TRP 170 and NT-TRP 172 can simultaneously communicate with multiple ED110s in the cell on the same time-frequency resources, thereby significantly improving spectral efficiency. The numerous antenna elements of the T-TRP 170 and / or NT-TRP 172 also provide better spatial directivity for each user during uplink and downlink transmissions, significantly reducing the transmission power of the T-TRP 170 and / or NT-TRP 172 and ED 110, and greatly improving power efficiency. When the number of T-TRP 170 and / or NT-TRP 172 antennas is sufficiently large, the random channels between each ED 110 and T-TRP 170 and / or NT-TRP 172 can be nearly orthogonal, and the effects of interference and noise between the cell and the user can be eliminated. These advantages make massive MIMO a promising technology for widespread application.

[0195] A MIMO system may include a receiver connected to a receive (Rx) antenna, a transmitter connected to a transmit (Tx) antenna, and a signal processor connected to both the transmitter and receiver. Each of the Rx and Tx antennas may include multiple antennas. For example, an Rx antenna may have a ULA antenna array, in which multiple antennas are arranged in a straight line at uniform intervals. When a radio frequency (RF) signal is transmitted through a Tx antenna, the Rx antenna can receive signals reflected and returned from a forward target.

[0196] A non-exhaustive list of possible units or possible configurable parameters or MIMO systems in some embodiments includes: Panel: A unit of an antenna group, antenna array, or antenna subarray, which can independently control its Tx beam or Rx beam.

[0197] Beam: A beam is formed by performing amplitude and / or phase weighting on data transmitted or received at at least one antenna port, or it can be formed using another method, such as adjusting the relevant parameters of the antenna elements. A beam can include a Tx beam and / or an Rx beam. The transmit beam represents the distribution of signal strength in different directions in space after the signal has been transmitted through the antenna. The receive beam represents the distribution of signal strength in different directions in space of the wireless signal received from the antenna. Beam information can be a beam identifier, or one or more antenna port identifiers, or a CSI-RS resource identifier, or an SSB resource identifier, or an SRS resource identifier, or other reference signal resource identifier.

[0198] 6G AI / ML Artificial intelligence (AI) technologies can be applied to communications, including AI / ML-based communications at the physical layer and / or AI / ML-based communications at higher layers (e.g., the medium access control (MAC) layer). For example, at the physical layer, AI / ML-based communications can aim to optimize component design and / or improve algorithm performance. For the MAC layer, AI / ML-based communications can aim to leverage AI / ML capabilities to learn, predict, and / or make decisions to solve complex optimization problems using potentially better strategies and / or optimal solutions. This includes optimizing features in the MAC layer such as intelligent TRP management, intelligent beam management, intelligent channel resource allocation, intelligent power control, intelligent spectrum utilization, intelligent modulation and coding schemes (MCS), intelligent hybrid automatic repeat request (HARQ) strategies, and intelligent transmit / receive (Tx / Rx) mode adaptation.

[0199] Here are some terms used in the AI / ML field: Data collection Data is a crucial component of AI / ML technology. Data collection refers to the process by which network nodes, management entities, or user-defined users (UEs) collect data for AI / ML model training, data analysis, and inference purposes.

[0200] AI / ML model training AI / ML model training refers to the process of training an AI / ML model by learning the input / output relationship in a data-driven manner and then using the trained AI / ML model for inference.

[0201] AI / ML model inference The process of using a trained AI / ML model to produce a set of outputs based on a set of inputs.

[0202] AI / ML model validation As a sub-process of training, validation is used to evaluate the quality of the AI / ML model using a different dataset than the one used for model training. Validation can help in selecting model parameters that generalize well beyond the dataset used for model training. The model parameters after training can be further tuned through the validation process.

[0203] AI / ML model testing Similar to validation, testing is also a sub-process of training. It is used to evaluate the performance of the final AI / ML model using a different dataset than that used for model training and validation. Unlike AI / ML model validation, testing does not assume subsequent model tuning.

[0204] Online training Online training refers to an AI / ML training process in which the model used for inference is typically trained continuously (nearly in real time) as new training samples arrive.

[0205] Offline training An AI / ML training process in which a model is trained based on a collected dataset, and the trained model is then used for inference or transmitted for inference.

[0206] AI / ML model delivery / transfer The term "transferring AI / ML models from one entity to another in any way" is a general term. Transmitting AI / ML models over the air includes transferring parameters of the model structure known to the receiving end, as well as transferring new models with parameters. The transfer may include a complete model or a partial model.

[0207] Life cycle management (LCM) When training and / or inferring AI / ML models on a device, the entire AI / ML process needs to be monitored and managed to ensure the performance gains achieved through AI / ML technology. For example, due to the randomness of wireless channels and the mobility of UEs, the propagation environment of wireless signals changes frequently. However, it is difficult for AI / ML models to maintain optimal performance in all scenarios, and performance may even degrade sharply in some scenarios. Therefore, lifecycle management (LCM) of AI / ML models is crucial for the sustainable operation of AI / ML over the NR air interface.

[0208] Lifecycle management encompasses the entire process of applying AI / ML technologies across one or more nodes. Specifically, lifecycle management includes at least one of the following sub-processes: data collection, model training, model identification, model registration, model deployment, model configuration, model inference, model selection, model activation, deactivation, model switching, model rollback, model monitoring, model update, model transmission / transmission, and UE capability reporting.

[0209] Model monitoring can be based on inference accuracy (including metrics related to key performance indicators, KPIs) or system performance (including metrics related to system performance KPIs, such as accuracy and relevance, overhead, complexity (computational and memory costs), latency (timeliness of monitoring results, from model failure to recovery), and power consumption). Furthermore, data distribution may change after deployment due to environmental variations; therefore, models based on input or output data distribution should also be considered.

[0210] Supervised learning: The goal of supervised learning algorithms is to train a model that maps feature vectors (inputs) to labels (outputs) based on training data that includes exemplary feature-label pairs. Supervised learning can analyze the training data and generate an inferred function that can be used to map inference data.

[0211] Supervised learning can be further divided into two types: classification and regression. Classification is used when the output of the AI / ML model is categorical data (i.e., with two or more categories). Regression is used when the output of the AI / ML model is real numbers or continuous values.

[0212] Unsupervised learning: Unlike supervised learning, where AI / ML models learn to map inputs to target outputs, unsupervised methods learn concise representations of input data without labeled data. These representations can be used for data exploration, analysis, or the generation of new data. A typical example of unsupervised learning is clustering, which explores the hidden structure of the input data and provides classification results.

[0213] Reinforcement learning: Reinforcement learning is used to solve sequential decision-making problems. It's the process of training an agent's actions based on inputs (states) and feedback signals (rewards) from the environment. In reinforcement learning, the agent interacts with the environment by performing actions to maximize cumulative rewards. Each time the agent performs an action, the current state of the environment may transition to a new state, which in turn brings a corresponding reward. The agent can then perform the next action based on the received reward and the new state in the environment. During the training phase, the agent interacts with the environment to accumulate experience. Because direct interaction with real systems is costly, the environment is typically simulated by a simulator. During the inference phase, the agent can use the optimal decision rules learned from the training phase to achieve the maximum cumulative reward.

[0214] Federated Learning: Federated learning (FL) is a machine learning technique that uses a central node (e.g., a server) and multiple distributed edge nodes (e.g., UE, next-generation NodeB, "gNB") to train AI / ML models.

[0215] Based on wireless FL technology, the server can provide edge nodes with a set of model parameters (e.g., weights, biases, gradients) describing the global AI / ML model. Edge nodes can use these received global AI / ML model parameters to initialize a local AI / ML model. Subsequently, the edge nodes can use local data samples to train the local AI / ML model, resulting in a trained local AI / ML model. The edge nodes can then provide the server with a set of AI / ML model parameters describing the local AI / ML model.

[0216] Upon receiving multiple sets of AI / ML model parameters describing the corresponding local AI / ML models at multiple edge nodes, the server can aggregate the local AI / ML model parameters reported from multiple UEs and update the global AI / ML model based on this aggregation. Subsequent iterations proceed very similarly to the first iteration. The server can send the aggregated global model to multiple edge nodes. This process is repeated multiple times until the final global AI / ML model is determined, for example, when the AI / ML model converges or meets the training stopping condition.

[0217] It is worth noting that wireless FL technology does not involve the exchange of local data samples. In fact, local data samples are retained at the corresponding edge nodes.

[0218] AI technologies (including ML technologies) can be applied in communications, including AI-based communication at the physical layer and / or the MAC layer. For the physical layer, AI communication can aim to optimize component design and / or improve algorithm performance. For example, AI can be used to achieve: channel coding, channel modeling, channel estimation, channel decoding, modulation, demodulation, MIMO, waveform generation, multiple access, physical layer element parameter optimization and updating, beamforming, tracking, sensing and / or localization, etc. For the MAC layer, AI communication can aim to leverage AI capabilities for learning, prediction, and / or decision-making to solve complex optimization problems using better strategies and / or optimal solutions, such as optimizing functions within the MAC layer. For example, AI can be applied to achieve: intelligent TRP management, intelligent beam management, intelligent channel resource allocation, intelligent power control, intelligent spectrum utilization, intelligent MCS, intelligent HARQ strategies, and / or intelligent transmit / receive mode adaptation, etc.

[0219] AI architectures can include multiple nodes, which may be organized in either a centralized or distributed mode, both of which can be deployed in access networks, core networks, edge computing systems, or third-party networks. Centralized training and computing architectures are limited by potentially high communication overhead and strict user data privacy. Distributed training and computing architectures can include several frameworks, such as distributed machine learning and federated learning. In some embodiments, the AI ​​architecture may include an intelligent controller that can perform as a single agent or multiple agents based on joint optimization or individual optimization. New protocols and signaling mechanisms are needed to personalize the corresponding interface links using custom parameters to meet specific requirements, while minimizing signaling overhead and maximizing overall system spectral efficiency through personalized AI technologies.

[0220] The new protocols and signaling mechanisms are provided to operate within and switch between different operating modes (including switching between AI and non-AI modes), and also to provide measurement and feedback to accommodate different possible measurements and information that may require feedback, depending on the implementation.

[0221] An air interface that uses AI as part of its implementation (e.g., optimizing one or more components of the air interface) is referred to herein as an "AI-enabled air interface". In some embodiments, two types of AI operations may exist in an AI-enabled air interface: both the network and the UE learn; or only the network learns.

[0222] With current technology, there are several solutions to save transmission energy, improve spectral efficiency, and enhance SINR. The first solution is link adaptation and hybrid automatic repeat request (HARQ), and the second solution is power adaptation.

[0223] HARQ is a combination of high-rate forward error correction (FEC) and automatic repeat request (ARQ). If the initial transmission fails, a retransmission is automatically requested until the data packet is successfully decoded. Retransmissions are performed on request and scheduled by the base station (BS).

[0224] For the data channel, the BS schedules the modulation and coding scheme (MCS) to achieve a target block error rate (BLER) of approximately 0.1, meaning that one out of ten code blocks (CBs) will have a decoding error. If an error occurs, a retransmission request is sent via a negative acknowledgement (NACK) signal.

[0225] In 4G and 5G, the HARQ mechanism is also known as the "stop-and-go" paradigm. In this paradigm, the transmitter stops transmitting a data packet at a certain point and waits for ACK / NACK feedback. Based on the feedback, the transmitter can either retransmit a portion of the current data packet or transmit a new data packet. This portion of the data packet is called the redundancy version (RV). For 5G LDPC, there are four RVs (RV0, RV1, RV2, and RV3), defined by their starting position in the base graph, as shown below. Figure 5A As shown.

[0226] like Figure 5BAs shown, the transmitter sends RV0 of the Transport Block (TB), then stops transmitting and waits for the appropriate feedback (e.g., ACK / NACK). The receiver, upon receiving RV0, decodes it. If RV0 is not successfully decoded, the receiver sends a NACK to the transmitter. After receiving the NACK, the transmitter (e.g., the BS) finds the next available time-frequency resource block to transmit / retransmit a redundant version (e.g., RV2) corresponding to the initial transmission (e.g., TB). After sending RV2, the transmitter stops transmitting and waits for the appropriate feedback (e.g., ACK / NACK). After receiving RV2, the receiver (e.g., the UE) merges the two transmissions and re-decodes the data packet (e.g., RV0 and RV2), which typically results in a gain greater than 3 dB. If the data packet is successfully decoded, the receiver sends an ACK to the transmitter. After receiving the ACK, the transmitter stops transmitting the TB and begins transmitting RV0 of the next TB.

[0227] However, link adaptation and HARQ methods have two drawbacks.

[0228] The first drawback is that incorrect Channel Quality Indicator (CQI) estimation can lead to either an overly aggressive or overly conservative choice of modulation and coding scheme (MCS). The former (overly aggressive) results in more decoding errors and frequent retransmission requests, leading to excessive latency. The latter (overly conservative) wastes channel resources, resulting in low spectral efficiency and thus lower throughput.

[0229] The second drawback is that the "stop-and-go" paradigm introduces significant additional latency compared to a single transmission.

[0230] For power adaptation, the perceived SINR may be insufficient for reliable communication due to channel quality (CQI) estimation errors and unpredictable interference from neighboring cells and devices. In these cases, an effective approach is to increase the transmission power until the data packets are successfully decoded.

[0231] However, the power adaptive method has the following drawbacks.

[0232] Abuse of power boosting operations can lead to higher inter-cell / inter-UE interference, thereby reducing overall system energy efficiency. In cases of poor interference alignment, excessive interference can even cause a decrease in average perceived SINR.

[0233] The current link adaptation, HARQ and power adaptation methods have the following main drawbacks: (i) long latency; (ii) low spectral efficiency; and (iii) low power efficiency.

[0234] These problems cannot be solved within the current technological framework; instead, a fundamentally different transmission and link control strategy is required. In short, a solution needs to be developed that simultaneously addresses all three issues: reducing latency, improving spectral efficiency, and increasing power efficiency.

[0235] To address the aforementioned problems, this invention provides a method for data transmission. The proposed method is puncture and repeat without request (PROQ), a catch-up transmission framework. Unlike the stop-and-go paradigm, the catch-up paradigm does not wait for any ACK / NACK, but continues transmission until successful reception (decoding). In this case, the code block (CB) is further segmented into many smaller RVs (i.e., short RVs), which are transmitted discontinuously. Some parts of these RVs (i.e., some RVs within RVs) are transmitted in one time slot, while other parts can be transmitted in other time slots by puncturing other transmissions. Furthermore, the UE does not need to wait for scheduling, and there is no need for retransmission requests between these RVs. When transmitting multiple short RVs in a single scheduled transmission, no NACK feedback is required; instead, a 1-bit ACK is fed back upon successful decoding. If no ACK is received, the remaining parts of the RV will be transmitted opportunistically in subsequent time slots. If a data packet is not successfully decoded after one time slot, the remaining RVs will be automatically and opportunistically transmitted in subsequent time slots, where the first transmission is terminated early due to successful decoding.

[0236] Figure 6 This is a schematic diagram of a method for data transmission according to some embodiments of the present invention. CB1 is transmitted on time slot 1 and is constrained by the time slot boundary of time slot 1. Since CB1 is not successfully decoded after one time slot (e.g., time slot 1), the remaining RV of CB1 (in short, CB1) is automatically and opportunistically transmitted in subsequent time slots (time slot 2 and / or time slot 3). Figure 6 As shown, CB2 is transmitted in time slot 2 and punctured (e.g., reverse puncturing) by CB1 (e.g., CB1's RV). Furthermore, the transmission of CB1 in time slot 2 is also limited by the time slot boundaries of time slot 2. Since CB1 has not been successfully decoded at the end of time slot 2, the remaining RV of CB1 (in short, CB1) can be transmitted in time slot 3. Figure 6 As shown, CB3 is transmitted in time slot 3 and is punched by CB1 (e.g., uniform punching).

[0237] In another case, if Figure 6 If CB1 is successfully decoded before the end of time slot 1, the transmission of CB1 can be terminated early without occupying the entire time slot 1.

[0238] To support the PROQ scheme described above, modifications to the standards and protocols are required in several places: Supports multiple RVs and corresponding RV design channel codes; Cross-time slot CB to resource mapping; Drilling rate within time slots and discontinuous drilling patterns; Control signaling used to manage the new PROQ mode; The relationship between data packets and feedback.

[0239] This invention has four advantages: saving transmission energy; reducing interference between cells and between UEs; eliminating the need for precise CQI measurement and feedback; and reducing ACK / NACK feedback.

[0240] Real-time acknowledgement amid transmission (RAAT) provides a transmission framework that transmits immediately upon arrival. Unlike the stop-and-go paradigm, RAAT does not wait for any ACK / NACK, but continues transmitting until successful reception (decoding). In other words, the transmitting device using the RAAT paradigm does not wait for any feedback (e.g., ACK / NACK), but continues transmitting until the receiving device successfully decodes. At this point, the code block (CB) is further segmented into many smaller RVs (i.e., short RVs), which are transmitted consecutively. Many detailed design aspects are the same as the RAAT scheme and will not be repeated here. The main differences are: (i) undecoded TBs must stop at some point and release resources to the next TB; (ii) incremental redundant bits of undecoded TBs can be transmitted in subsequent time slots by punching in existing TBs.

[0241] Various embodiments of the present invention will now be described by way of example. The following embodiments will be illustrated using an example where the transmitting device is a BS and the receiving device is a UE. Reference is now made to... Figure 7 The diagram illustrates a signaling diagram of a method for data transmission according to some embodiments of the present invention. The signaling diagram relates to a BS and a UE.

[0242] Step 701: The BS sends one or more bit sets of the first codeword to the UE on the first resource. Accordingly, the UE receives one or more bit sets of the first codeword.

[0243] The bit set can also be referred to as the RV. In this case, step 701 is: the BS can send one or more RVs of the first codeword to the UE on the first resource. Correspondingly, the UE can receive one or more RVs of the first codeword. It should be noted that the one or more RVs are not necessarily aligned with channel resources (e.g., time slots, symbols).

[0244] The primary resource can be a time resource (e.g., a time slot, a mini-time slot, a virtual TTI, etc.), a frequency resource, or a time-frequency resource; this invention does not limit this. A virtual TTI can be shorter than a TTI in the prior art, and this is not limited here.

[0245] It should be noted that the codeword can be a TB, a code block group (CBG), or a code block (CB), and this invention does not limit it.

[0246] In some embodiments, such as Figure 8A As shown, this invention relates to downlink data channels and uplink control channels. Data transmission in the downlink data channel can be scheduled on a specific time slot (virtual TTI, a time unit for data transmission). After data is encoded, the encoder (e.g., BS) sends one or more RVs of the first codeword to the decoder (e.g., UE). The decoder can also be called a fast decoder. Once the UE begins receiving one or more RVs of the first codeword from the BS, the UE, acting as the decoder, performs decoding while receiving one or more RVs of the CB.

[0247] In one implementation, the UE can begin decoding the RV after receiving it from the BS.

[0248] In another implementation, prior to step 701, the BS may send first information to the UE in step 700. Accordingly, the UE can receive the first information from the BS. Step 700 is optional.

[0249] In step 700, the BS sends first information to the first terminal device, wherein the first information is used to indicate the length of one or more bit sets of the first codeword, and / or the starting position of one or more bit sets of the first codeword on the time-frequency resource. The length of one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in one or more bit sets of the first codeword, or the maximum transmission length of one or more bit sets of the first codeword.

[0250] In some embodiments, the first information may be configuration information. The configuration information may indicate the total length (e.g., minimum transmission length and / or maximum transmission length) of the codeword's RV (one or more bit sets) and / or the starting position of the codeword's initial RV (a bit set) on the time-frequency resource. This length can be represented by a number of bits, a number of symbols, or a duration (e.g., several seconds / milliseconds / nanoseconds). The starting position refers to the time or symbol at which transmission of the RV begins. The starting position can be a time slot or a symbol index.

[0251] At this point, the BS can schedule transmission by configuring the starting position of the first codeword, the minimum transmission length, and / or the maximum transmission length. Therefore, the UE can perform decoding based on the configuration information.

[0252] The minimum transmission length is designed to tell the UE at least this length before making the first decoding attempt. The minimum transmission length can be set to the length that achieves the highest decoding success rate. The minimum transmission length can also be called the minimum length, MinTx length, or initial length. For example, the minimum transmission length is 10 bits.

[0253] In one implementation, the length of one or more RVs of a codeword can be determined by the BS. The length of one or more RVs of a codeword can be determined based on at least one of the following: large-scale CQI, prior feedback, or modulation and coding scheme (MCS).

[0254] In some embodiments, a maximum transmission length can be set to ensure user latency. The maximum transmission length can be predictable jitter. For example, the maximum predictable jitter is 4 TTIs (e.g., a time resource is 1 TTI long), meaning the transmission of a codeword is limited to 4 consecutive time resources. In this case, the codeword needs to be transmitted within 4 consecutive time resources. If the codeword is not successfully decoded within 4 consecutive time resources, the BS will not transmit the remaining RV of that codeword.

[0255] In one implementation, the maximum transmission length is an integer multiple of the minimum transmission length.

[0256] According to the configuration information, the UE may not begin decoding an RV until it receives one or more RVs of a certain length (e.g., the minimum transmission length). For example, if the RV length is 10 bits and the minimum transmission length is 20 bits, the UE may not begin decoding an RV until it receives 20 bits (e.g., until it receives two RVs). Therefore, the UE can begin decoding an RV after receiving bits with a total length greater than the minimum transmission length, thereby increasing the probability of successfully decoding these bits. Furthermore, since the UE may not begin decoding an RV until it receives the minimum transmission length RV from the BS, the UE's power consumption can be reduced. The configuration information can be sent from the BS to the UE.

[0257] Step 702: The UE can send feedback to the BS corresponding to the first codeword.

[0258] After decoding, the UE can send feedback to the BS corresponding to the first codeword. For example, if the first codeword is successfully decoded, the UE can send positive feedback (e.g., ACK) to the BS. If the first codeword is not successfully decoded, the UE can choose not to send feedback to the BS to indicate decoding failure. Alternatively, if the first codeword is not successfully decoded, the UE can send negative feedback (e.g., NACK) to the BS to indicate decoding failure; this is optional.

[0259] like Figure 8A As shown, if the BS does not receive an ACK in time slot 1, the BS may stop transmitting one or more RVs of the current codeword at the end of time slot 1.

[0260] Step 703: The BS transmits one or more bit sets of the second codeword on the first part of the second resource, and transmits one or more bit sets of the first codeword on the second part of the second resource. Accordingly, the UE receives one or more bit sets of the second codeword on the first part of the second resource, and receives one or more bit sets of the first codeword on the second part of the second resource.

[0261] In some embodiments, the PDSCH may stop transmitting at the end of a time slot (or multiple time slots, or any allocated resource). If the PDSCH fails to decode in its own time slot (resource), it can use the time slots of other PDSCHs by punching certain symbols.

[0262] exist Figure 8A In the example shown, the first codeword is transmitted by the BS in time slot 1 (as an example of the first resource) and received by the UE in time slot 1. However, at the end of time slot 1, the UE fails to decode the first codeword. At this point, the UE may not send an ACK corresponding to the first codeword to the BS. The BS may stop transmitting the RV of the first codeword at the end of time slot 1 and may begin transmitting the RV of the second codeword in a time slot after time slot 1 (e.g., time slot 2, as an example of the second resource). Since the ACK corresponding to the first codeword was not received by the BS, the remaining RV of the first codeword will be transmitted opportunistically in time slots after time slot 1.

[0263] like Figure 8A As shown, the BS transmits one or more RVs of the second codeword on the first portion of the second resource. Specifically, the BS transmits one or more RVs of the second codeword on resources other than resources 801, 802, and 803 in time slot 2. Additionally, the BS transmits redundant bits (e.g., one or more RVs) of the first codeword on the second portion of the second resource. Specifically, the BS transmits one or more RVs of the first codeword on resources 801, 802, and 803.

[0264] As mentioned above, codeword transmission is constrained by time slot boundaries. Therefore, the transmission of the current codeword can proceed without affecting the start of transmission for the next codeword. Furthermore, if the first codeword is not successfully decoded in a time slot, the remaining RVs of the first codeword will be automatically transmitted opportunistically in subsequent time slots (e.g., time slot 2). Thus, the current codeword can be successfully decoded.

[0265] It should be noted that the first codeword and the second codeword can be transmitted to the same UE or to different UEs. For example, the first codeword can be sent to a first terminal device, and / or the second codeword can be sent to a second terminal device.

[0266] A PROQ process can be used instead of a HARQ processor to track different TBs / CBs. PROQ processes can be identified by their process IDs. HARQ (or PROQ) process IDs can be maintained, and undecoded TBs can be cached.

[0267] Furthermore, the PROQ scheme is backward compatible and can coexist with the traditional HARQ scheme. Therefore, signaling indicating HARQ mode, PROQ mode, or RAAT mode can exist. For example, the BS can indicate to the UE whether to use HARQ mode, RAAT mode, or PROQ mode via fields in RRC signaling or DCI signaling. If the BS indicates to use PROQ mode, the BS and UE can perform steps 701 to 706. If the BS indicates to use traditional HARQ mode, the BS and UE can perform the steps of the existing HARQ scheme.

[0268] In some embodiments, the UE may not begin decoding RV until it receives bits of the minimum transmission length. The minimum transmission length is intended to tell the UE to receive at least this length before making the first decoding attempt. The minimum transmission length can be set to the length that achieves the highest decoding success rate. The minimum transmission length may also be referred to as the minimum length, Min Tx length, or initial length. For example, the minimum length is 10 bits.

[0269] The minimum transmission length of one or more RVs of a codeword can be determined based on at least one of the following: large-scale CQI, prior feedback, or modulation and coding scheme (MCS).

[0270] In one implementation, the minimum transmission length can be determined based on a large-scale CQI. In this invention, since the length of one or more RVs of the CB is not fixed, it is not necessary to obtain a real-time accurate CQI to determine the transmission length. For example, the UE measures the CQI-RS and reports the CQI (e.g., a large-scale CQI) to the BS. After receiving the CQI, the BS determines the minimum transmission length based on the large-scale CQI and notifies the UE of the minimum transmission length. The large-scale CQI can also be called an open-loop CQI. For example, the large-scale CQI can be the average CQI over a certain time period.

[0271] In one implementation, the minimum transmission length can be determined based on one or more prior positive feedbacks. One or more prior positive feedbacks refer to one or more previously received ACKs, which can reflect the time or frequency at which the BS receives one or more ACKs. One or more prior positive feedbacks can also be referred to as one or more ACK instances.

[0272] In one implementation, the minimum transmission length can be determined based on the MCS.

[0273] In one implementation, the BS scheduling algorithm takes the open-loop CQI, ACK (i.e., ACK instance), and the current scheduling modulation and coding rate as input, and outputs the minimum transmission length.

[0274] Compared to traditional HARQ, this invention requires the extremely challenging selection of MCS based on limited or inaccurate CQI information.

[0275] In the example with codeword TB, such as Figure 8B As shown, the configuration is such that there is no feedback opportunity before transmitting the minimum Tx length of TB1 / TB2. Therefore, the UE will not begin decoding until it receives the minimum Tx length of bits in TB1 (e.g., 20 bits). Each RV of TB1 after the minimum Tx length (e.g., RV11, RV12, RV13, and RV14) corresponds to a feedback opportunity (e.g., stop 2, stop 3, stop 4, and stop 5). It should be noted that an RV of the minimum Tx length of TB1 can correspond to feedback opportunity stop 1.

[0276] After receiving the minimum Tx length of TB1 (e.g., 20 bits), the UE can send an ACK at the immediate follow-up feedback opportunity once TB1 is successfully decoded. (This is in contrast to time T...) trans The earliest time (e.g., T) of the feedback opportunity corresponding to the transmitted RV. feedback It can satisfy: T feedback =T trans +T prop +T proc , among which, Tprop T represents the air-to-air propagation time corresponding to the RV; proc This indicates the processing time for the UE to process and decode the RV.

[0277] like Figure 8B As shown, TB1 is still not successfully decoded after RV14 is transmitted and decoded. The UE can optionally send a NACK at stop 1, stop 2, stop 3, stop 4, or stop 5. Additionally, the transmission of TB1 needs to stop at the end of time slot 1. Since the decoding of TB1 fails in its own time slot (i.e., time slot 1), the remaining RVs of TB1 will be transmitted opportunistically in subsequent time slots (e.g., time slot 2).

[0278] like Figure 8B As shown, the BS begins transmitting TB2 at the start of time slot 2. Similarly, each RV of TB2 (e.g., RV21 or RV22) after the Min Tx length of TB2 corresponds to a feedback opportunity (stop 01 or stop 02). Once TB2 is successfully decoded, the UE can send an ACK at the immediately following feedback opportunity (stop 02).

[0279] The remaining RVs (RV15 and RV16) of TB1 are transmitted in time slot 2 by puncturing TB2. RV15 corresponds to feedback opportunity stop 6, and RV16 corresponds to feedback opportunity stop 7. Once TB1 is successfully decoded, the UE can send an ACK at the immediately following feedback opportunity (stop 7).

[0280] Compared to traditional HARQ, the time interval between PDSCH and ACK / NACK is almost zero; there is more frequent ACK / NACK after each symbol / mini-slot is received; and real-time / continuous ACK is used instead of asynchronous / synchronous HARQ. Furthermore, cross-slot CB-to-resource mapping helps the PROQ scheme achieve more flexible and efficient channel utilization.

[0281] Step 704: The UE sends feedback corresponding to the first codeword, indicating whether the first codeword has been successfully decoded. Correspondingly, the BS receives the feedback corresponding to the first codeword.

[0282] For example, when BS is Figure 8A When the UE transmits one or more RVs of the first codeword in time slot 2, it decodes the codeword simultaneously with receiving one or more RVs of the first codeword. If the UE successfully decodes the first codeword, it can send positive feedback to the BS.

[0283] In some embodiments, the UE may optionally send a NACK to the BS if the codeword is not successfully decoded.

[0284] As mentioned above, the UE can send an ACK, but not a NACK. In this case, the UE can determine or generate a codebook that includes ACK but not NACK, and the UE can send this codebook to the BS. For example, based on the proposed HARQ codebook (i.e., PROQ codebook), the UE can send an ACK only for each CB / CBG, but not a NACK.

[0285] This feedback can be sent by the UE based on a feedback opportunity. A feedback opportunity refers to the possible time / location of a UCI report transmitted on the PUCCH and PUSCH channels. For example, a feedback opportunity refers to the possible transmission time / location of a UE feedback (e.g., ACK / NACK). One or more feedback opportunities can be referred to as transmission granularity (i.e., Tx granularity) and / or feedback granularity (e.g., ACK / NACK granularity).

[0286] In some embodiments, one or more feedback opportunities can be periodic. In this case, the time interval between two consecutive feedback opportunities can be configured by the BS or pre-configured. The UE can periodically send feedback to the BS at each feedback opportunity. For example, as... Figure 8B As shown, the time intervals (e.g., time interval 1) between "Stop 1", "Stop 2", "Stop 3", "Stop 5" are the same. One or more feedback opportunities can be periodic. The location and number of one or more feedback opportunities can be the same in each period.

[0287] In one implementation, one or more feedback opportunities can be configured before the BS transmits the RV to the UE (e.g., configured as a whole rather than individually). For example, the BS can configure the periods for multiple feedback opportunities. In this case, when the UE wants to send feedback to the BS, since the periods for the feedback opportunities have already been configured, the UE does not need to wait for the scheduling of each feedback. Therefore, the UE can send feedback in a timely manner.

[0288] In some embodiments, one or more feedback opportunities can be non-periodic. For example, one or more feedback opportunities can be scheduled on demand by the BS, or they can be scheduled individually. In this case, the BS can schedule one or more feedback opportunities while simultaneously sending one or more RVs to the UE.

[0289] The initial information can be carried in Radio Resource Control (RRC) signaling. In this case, parameters (Tx / ACK / NACK granularity) can be carried in the RRC signaling. For example, the time interval between two feedbacks can be configured in the RRC configuration. In one implementation, the time interval between two feedbacks can be indicated by PUCCH-Config. In another implementation, the time interval between two feedbacks can be indicated by configured grant-uplink control information (CG-UCI).

[0290] In the RRC configuration, there can be a field that describes the time interval between two feedbacks. This field can be called: PUCCH-Config::{ multi-ACK-timeGap SEQUENCE (SIZE (1..maxNofGap)) OF PUCCH-multiACK-timeGap } or CG-UCI::{ multi-ACK-timeGap SEQUENCE (SIZE (1..maxNofGap)) OF multiACK-timeGap } In some embodiments, an indication (e.g., the "HARQ multi-ACK_NACK flag") can be used in the DCI configuration to indicate whether PROQ is enabled or disabled. In one implementation, one bit is used to indicate whether PROQ is enabled or disabled. For example, "0" (e.g., HARQ multi-ACK_NACK flag = 0) indicates that multi-ACK feedback is disabled, and "1" (e.g., HARQ multi-ACK_NACK flag = 1) indicates that multi-ACK feedback is enabled.

[0291] Upon receiving this indication, the UE can provide corresponding feedback. If the UE detects that the HARQ multi-ACK_NACK flag is 0, it can provide traditional HARQ feedback. If the UE detects that the HARQ multi-ACK_NACK flag is 1, it can provide feedback according to the PROQ scheme. In the latter case, the UE can obtain the time interval between the two feedbacks based on the RRC configuration and can report multiple feedbacks at multiple feedback opportunities (e.g., within allocated symbols / mini-slots).

[0292] In another implementation, multiple bits are used to indicate whether multi-ACK feedback is enabled or disabled. For example, four bits are used to indicate whether multi-ACK feedback is enabled or disabled. All zeros indicate disabled, and other values ​​indicate the number of additional feedbacks besides the one to be reported. "0000" indicates multi-ACK feedback is disabled, and there is one feedback opportunity corresponding to one RV; "0001" indicates multi-ACK feedback is enabled, and there are two feedback opportunities corresponding to one RV; "0010" indicates multi-ACK feedback is enabled, and there are three feedback opportunities corresponding to one RV; ... "1111" indicates multi-ACK feedback is enabled, and there are 16 feedback opportunities corresponding to one RV.

[0293] As an optional design, the BS can add a margin to the RV to determine the actual transmission length of the RV and the corresponding feedback opportunity. The margin can be the additional transmission length / duration / time of the RV. In one implementation, a simple example is to record the required transmission time in the history and add a margin as needed. For example, to transmit a 1000-bit RV (e.g., RV... 1000 Based on historical statistics, 1000 bits will result in a 10% error probability, so we can allocate RV... 1000 Add a 100-bit margin. At this point, RV 1000 The actual transmission length is 1100 bits, RV 1000 It became an RV containing 1100 bits. 1100 Correspondingly, this corresponds to RV. 1000 The feedback opportunity occurs when 1100 bits (i.e., RV) are transmitted. 1100 (1100 bits) of time.

[0294] For example, the margin can be determined by the transmission time and / or decoding time. Alternatively, the margin can be determined by other parameters. Or, the margin can be pre-configured.

[0295] For example, the BS can indicate the margin to the UE.

[0296] If the first codeword is successfully decoded, the BS may stop transmitting one or more bit sets of the first codeword. Upon receiving feedback indicating that the first codeword has been successfully decoded, the BS may, in response to the feedback, terminate transmitting one or more bit sets of the first codeword.

[0297] For example, once the BS receives an ACK indicating that the UE has successfully decoded the first codeword, the BS can stop transmitting one or more RVs of the first codeword.

[0298] In some embodiments, the first codeword can be successfully decoded within a relatively short time period. For example, the transmission of the first codeword occupies only a portion of a time slot, rather than the entire time slot. In this case, the transmission of the first codeword can be terminated early due to successful decoding, and the transmission of the first codeword does not need to occupy the entire time slot.

[0299] The punch-hole design provides a good way to mitigate and align interference between different UEs from different cells. In multi-cell, multi-user scenarios, early termination of transmissions not only saves energy and reduces cross-interference, but also provides time / frequency resources for other UEs to transmit the remaining RV. Figure 9 This illustrates such a scenario.

[0300] For reference Figure 9 This illustrates a multi-user scenario (each user refers to one UE). For example... Figure 9 As shown, once User 1 successfully decodes User 1's codeword, User 1 sends an ACK to the BS. Upon receiving User 1's ACK, the BS knows that User 1 has successfully decoded User 1's codeword. Accordingly, the BS stops sending User 1's codeword. At this time, the transmission of User 1's codeword occupies 0.7 TTIs. User 1's codeword was successfully decoded ahead of schedule. Upon receiving the ACK, the BS immediately stops sending the current TB / CB (e.g., User 1's codeword) and waits for the next time slot to schedule / send the next TB / CB (e.g., User 2's codeword). In other words, the transmission of the next TB / CB may need to wait for a new time slot.

[0301] Since User 1 does not need to wait until the end of time slot 1 to send the ACK, User 1 can send the ACK immediately after successfully decoding its codeword, which is of great benefit for reducing user latency. "Tx power off" means that once the codeword is successfully decoded, the BS stops sending the codeword, which is of great benefit for reducing power consumption and interference.

[0302] Similarly, once user 2 successfully decodes user 2's codeword, user 2 will send an ACK to BS, and the transmission of user 2's codeword occupies 0.5 TTIs; once user 6 successfully decodes user 6's codeword, user 6 will send an ACK to BS, and the transmission of user 6's codeword occupies 0.7 TTIs; once user 10 successfully decodes user 10's codeword, user 10 will send an ACK to BS, and the transmission of user 10's codeword does not occupy the entire TTI.

[0303] like Figure 9As shown, User 3's codeword is transmitted in time slot 3. The BS begins transmitting User 3's codeword at the beginning of time slot 3. User 3 decodes the codeword while receiving it. However, at the end of time slot 3, User 3's codeword is not successfully decoded. At this point, User 3 can send negative feedback (e.g., NACK or NAK) to the BS. It's important to note that User 3 may choose not to send feedback to the BS if its codeword is not successfully decoded.

[0304] The BS stops transmitting user 3's codeword at the end of time slot 3 and begins transmitting user 4's codeword at the beginning of time slot 4. Once user 4 successfully decodes user 4's codeword, user 4 sends an ACK to the BS. Upon receiving user 4's ACK, the BS knows that user 4 has successfully decoded user 4's codeword. Accordingly, the BS stops transmitting user 4's codeword. Figure 9 As shown, the transmission of user 4's codeword does not occupy the entire time slot 4. Since the transmission of user 4's codeword only occupies a portion of time slot 4, the remaining portion of time slot 4 can be used for the transmission of other codewords.

[0305] As described above, at the end of time slot 3, user 3's codeword was not successfully decoded. As long as the BS does not receive an ACK corresponding to user 3's codeword, the remaining RV of user 3's codeword can be transmitted opportunistically in subsequent time slots. Figure 9 As shown, the remaining RV of user 3's codeword is transmitted during the remainder of time slot 4. However, at the end of time slot 4, user 3's codeword is not successfully decoded. At this point, user 3 can send negative feedback (e.g., NACK or NAK) to the BS. It should be noted that user 3 may choose not to send feedback to the BS if its codeword is not successfully decoded.

[0306] The BS stops transmitting user 4's codeword at the end of time slot 4 and begins transmitting user 5's codeword at the beginning of time slot 5. As long as the BS does not receive an ACK corresponding to user 3's codeword, the remaining RV of user 3's codeword can be transmitted opportunistically in subsequent time slots. For example... Figure 9 As shown, the transmission of User 5's codeword is punctured. In other words, User 5's codeword is punctured. The remaining RV of User 3's codeword is transmitted on time slot 5 by puncturing User 5's codeword. If User 3 successfully decodes User 3's codeword, User 3 sends an ACK to the BS. Once the BS receives User 3's ACK, the BS stops transmitting User 3's codeword, and User 5's codeword is no longer punctured by User 3's codeword. If User 5 successfully decodes User 5's codeword, User 5 sends an ACK to the BS. Once the BS receives User 5's ACK, the BS stops transmitting User 5's codeword. Figure 9 As shown, due to the intermittent nature of the transmission, it takes 0.9 TTIs to transmit the entire codeword of user 5.

[0307] exist Figure 9 In another example shown, user 7's codeword is transmitted on time slot 7. The BS stops transmitting user 7's codeword at the end of time slot 7 and begins transmitting user 8's codeword at the beginning of time slot 8. However, at the end of time slot 7, user 7's codeword is not successfully decoded. At this point, user 7 can optionally send negative feedback (e.g., NACK or NAK) to the BS.

[0308] If the BS does not receive an ACK corresponding to the codeword of user 7, the remaining RV of user 7's codeword can be transmitted opportunistically in subsequent time slots. For example... Figure 9 As shown, the remaining RV of user 7's codeword is transmitted in time slot 8 by puncturing the transmission of user 8's codeword (i.e., by puncturing user 8's codeword). However, at the end of time slot 8, user 7 still has not successfully decoded user 7's codeword. At this point, user 7 may not send feedback, or may send negative feedback (e.g., NACK or NAK) to BS.

[0309] In some embodiments, TTI can be a time slot.

[0310] Optionally, the method may further include steps 705 and 706 as described below.

[0311] Step 705: The BS transmits one or more bit sets of the third codeword on the first part of the third resource. Additionally, the BS transmits one or more bit sets of the first codeword on the second part of the third resource, and one or more bit sets of the second codeword on the third part of the third resource.

[0312] In the following example, the third resource refers to Figure 9 Time slot 9 in the middle. Combined with... Figure 9 The transmission of codewords for users 7, 8, and 9 is shown. The BS starts sending the first codeword (e.g., user 7's codeword), the second codeword, and the third codeword at the beginning of time slots 7, 7, and 9, respectively. Users 7, 8, and 9 decode the codewords simultaneously.

[0313] The BS stops transmitting the codeword for user 8 at the end of time slot 8 and begins transmitting the codeword for user 9 at the beginning of time slot 9. The BS may transmit the RV of the codeword for user 9 in the first part of time slot 9.

[0314] As described above, user 7's codeword was not successfully decoded in time slots 7 and 8. In this case, user 7 may not send an ACK to the BS. If the BS does not receive an ACK corresponding to user 7's codeword, the remaining RV of user 7's codeword can be transmitted opportunistically in subsequent time slots. Figure 9As shown, the remaining RV of user 7's codeword is transmitted on a third resource (e.g., time slot 9) by punching the transmission of user 9's codeword, which occupies the second part of time slot 9.

[0315] Furthermore, within time slot 8, user 8 fails to decode its codeword. In this case, user 8 may choose not to send feedback, or may send negative feedback to the BS (e.g., NACK or NAK). If the BS does not receive an ACK corresponding to user 8's codeword, the remaining RV of user 8's codeword can be transmitted opportunistically in subsequent time slots. Figure 9 As shown, the remaining RV of user 8's codeword is transmitted in time slot 9 by punching the transmission of user 9's codeword (i.e. by punching the codeword of user 9), which occupies the third part of time slot 9.

[0316] Step 706: The UE sends feedback corresponding to the first codeword, indicating whether the first codeword has been successfully decoded. Correspondingly, the BS receives the feedback corresponding to the first codeword.

[0317] exist Figure 9 In the example shown, user 9's codeword is punctured by user 7's codeword. User 7 decodes its codeword while receiving it from the BS. When user 7's codeword is transmitted on time slot 9, if user 7 has successfully decoded its codeword, user 7 sends an ACK to the BS. Once the BS receives user 7's ACK, the BS stops transmitting user 7's codeword, and user 9's codeword is no longer punctured by user 7's codeword. Figure 9 As shown, transmitting the entire codeword of user 7 requires 2.2 TTIs.

[0318] Similarly, as long as the BS does not receive an ACK corresponding to the codeword of user 8, the remaining RV of user 8's codeword can be transmitted opportunistically in subsequent time slots. For example... Figure 9 As shown, the remaining RV of user 8's codeword is transmitted in time slot 9 by puncturing the transmission of user 9's codeword. If user 8 successfully decodes user 8's codeword, user 8 sends an ACK to the BS. Once the BS receives user 8's ACK, the BS stops transmitting user 8's codeword, and user 9's codeword is no longer punctured by user 7's codeword. Figure 9 As shown, transmitting the entire codeword of user 8 requires 1.8 TTIs.

[0319] If user 9 successfully decodes user 9's codeword, user 9 sends an ACK to BS. Once BS receives user 9's ACK, BS will stop sending user 9's codeword.

[0320] In some embodiments, rules are established to determine which TB is transmitted first at the punch location. For example, BS scheduling includes retransmitting which previous PDSCH TB in the current time slot.

[0321] If multiple previous PDSCH TBs (or CBG / CB) fail to decode, a priority rule is needed to determine which TB to retransmit first. The priority rule can be a deterministic rule (e.g., always retransmit the earliest undecoded TB) or dynamically scheduled by the BS.

[0322] In some embodiments, the initial bit set of the first codeword is transmitted earlier than the initial bit set of the second codeword, and the initial bit set of the second codeword is transmitted earlier than the initial bit set of the third codeword. In this case, after transmitting one or more bit sets of the first codeword on the second portion of the third resource, one or more bit sets of the second codeword are transmitted on the third portion of the third resource.

[0323] For example, such as Figure 9 As shown, the initial RV of user 7's codeword is transmitted at the beginning of time slot 7, the initial RV of user 8's codeword is transmitted at the beginning of time slot 8, and the initial RV of user 9's codeword is transmitted at the beginning of time slot 9. At this time, the transmission time of the initial RV of user 7's codeword is earlier than the transmission time of the initial RV of user 8's codeword, and the transmission time of the initial RV of user 8's codeword is earlier than the transmission time of the initial RV of user 9's codeword. Furthermore, the remaining RV of user 7's codeword is transmitted in time slot 9 by puncturing the transmission of user 9's codeword, and the remaining RV of user 8's codeword is also transmitted in time slot 9 by puncturing the transmission of user 9's codeword. Since the transmission time of the initial RV of user 7's codeword is earlier than the transmission time of the initial RV of user 8's codeword, the transmission of the remaining RV of user 7's codeword in time slot 9 will be earlier than the transmission of the remaining RV of user 8's codeword in time slot 9. In other words, after the remaining RV of user 7's codeword is transmitted in time slot 9, the remaining RV of user 8's codeword will be transmitted in time slot 9. Therefore, the remaining RV of the earliest / oldest codeword will be transmitted first.

[0324] In some embodiments, the number of second portions of the second resource is greater than the number of second portions of the third resource; and / or the proportion of the second portions of the second resource in the second resource is greater than the proportion of the second portions of the third resource in the third resource.

[0325] For example, such as Figure 9As shown, the transmission of one or more RVs of user 7's codeword punctures four mini-time slots in time slot 8, while the transmission of one or more RVs of user 7's codeword punctures two mini-time slots in time slot 9. At this time, the number of punctured symbols in time slot 9 used for transmitting one or more RVs of user 7's codeword is less than the number of punctured symbols in time slot 8 used for transmitting one or more RVs of user 7's codeword. In one implementation, the proportion of punctured symbols in time slot 9 used for transmitting one or more RVs of user 7's codeword is less than the proportion of punctured symbols in time slot 8 used for transmitting one or more RVs of user 7's codeword.

[0326] In some embodiments, constraints or thresholds can be set to ensure user latency. The constraint can be predictable jitter. For example, the maximum predictable jitter is 3 TTIs (e.g., a time resource is 1 TTI long), meaning the transmission of a codeword is limited to 3 consecutive time resources. In this case, user 7's codeword needs to be transmitted within 3 consecutive time resources. That is, if user 7 fails to decode its codeword at the end of time slot 9, the BS will not transmit the remaining RV of user 7's codeword.

[0327] To notify the UE of the punching ratio or punching pattern, the BS can send an indication to the UE, which indicates at least one of the following: the proportion of the second portion of the second resource in the second resource, the quantity of the second portion of the second resource, or the distribution of the second portion of the second resource in the second resource. Accordingly, the UE receives the indication. This proportion can also be referred to as the "punching ratio".

[0328] In one implementation, the BS is responsible for scheduling, encoding, and transmission. However, the BS does not need to explicitly indicate the transmission of the remaining RVs. The implicit allocation of time resources for transmitting the remaining RVs can be accomplished in two ways: predefined or dynamically scheduled. In other words, the punching ratio and pattern can be predefined (Option 1) or dynamically scheduled (Option 2).

[0329] In one implementation, the time resource allocation for transmitting the remaining RV can be predefined, and the predefined puncturing ratio and puncturing pattern can be specified by a standard. If the current transmission is not successfully decoded in the current time slot, the next time slot will automatically free up some symbols / sub-time slots for its remaining RV.

[0330] With a predefined puncturing ratio (Option 1), the puncturing ratio can be used to limit the minimum number of retransmissions in each subsequent time slot (transmission of the remaining RV), and / or limit the maximum number of symbols per retransmission.

[0331] The above-mentioned punching ratios can be pre-allocated in the table, as shown below.

[0332] Table 1

[0333] Table 2

[0334] Table 3

[0335] The following are some explanations of these tables: Each line represents a TB (or CBG / CB) for one user or different users – what percentage of symbols does the current TB occupy in subsequent time slots? Each row represents a time slot (or multiple time slots) – how do I assign REs to the current TB and other previous TBs? These tables are categorized according to the maximum number of time slots allowed for packet transmission. For example, if the worst-case scenario is 3 time slots, the BS will attempt to send packets in 3 time slots. If decoding still fails, a decoding failure and traditional HARQ can be triggered.

[0336] Table 1 shows an example of a worst-case scenario with 3 time slots. As shown in Table 1, in the first row, "1" indicates that TB1 accounts for 1% (i.e., 100%) of time slot 1; "0.5" indicates that TB1 accounts for 0.5% (i.e., 50%) of time slot 2; and "0.25" indicates that TB1 accounts for 0.25% (25%) of time slot 3. In other words, the entire time slot 1, 0.5% of time slot 2, and 0.25% of time slot 3 are allocated for transmitting TB1.

[0337] Referring to the second row of Table 1, 0.5 of time slot 2, 0.25 of time slot 3, and 0.25 of time slot 4 are allocated for the transmission of TB2.

[0338] Referring to the third row of Table 1, 0.5 of time slot 3, 0.25 of time slot 4, and 0.25 of time slot 5 are allocated for the transmission of TB3.

[0339] Referring to the fourth row of Table 1, 0.5 of time slot 4, 0.25 of time slot 5, and 0.25 of time slot 6 are allocated for the transmission of TB4.

[0340] It is important to note that if a previous TB has been successfully decoded, the pre-allocated resources for puncturing are not used. For example, referring to Table 1, if TB1 is successfully decoded in time slot 1 (before the start of time slot 2), TB1 does not need to be transmitted in subsequent time slots. In this case, the pre-allocated resources for puncturing (0.5 of time slot 2 used for transmitting TB1) will not be used to transmit TB1. These pre-allocated resources for puncturing can be idle or used to transmit one or more other TBs.

[0341] Similarly, Table 2 shows an example with a worst-case scenario of 4 time slots, and Table 3 shows an example with a worst-case scenario of 5 time slots.

[0342] The puncturing ratio and pattern can be indicated via signaling. In one implementation, the RRC / DCI indicator can be used to indicate: the puncturing pattern, and / or the proportion of punctured symbols in a time slot.

[0343] In another implementation, a retransmission resource (e.g., puncturing pattern) indicator can be used to indicate the puncturing pattern. For example, "index=0" indicates puncturing in the direction from the end of the second resource to the beginning of the second resource; "index=1" indicates puncturing in the direction from the beginning of the second resource to the end of the second resource; and "index=2" indicates uniform puncturing of the second resource in any direction. These indices can be represented using two bits.

[0344] UE behavior interprets the puncturing pattern according to RRC / DCI and only decodes its own TB. The UE can transmit or remain silent on certain symbols (or REs) according to the puncturing pattern predefined or indicated by the BS.

[0345] In some embodiments, the second portion of the second resource is uniformly distributed within the second resource; or the second portion of the second resource is distributed at the beginning and / or end of the second resource.

[0346] In one example, such as Figure 6 As shown, in CB3, the RV of CB1 is uniformly distributed. In another example, as... Figure 10 As shown, CB2 and CB3 are punched in reverse order. In other words, in Figure 10 In this example, CB2 and CB3 are punched from the end to the beginning. In another example, CB can be punched from its beginning to its end, or from both ends to the middle.

[0347] In some embodiments, a second portion of the second resource is used to transmit parity bits.

[0348] like Figure 10 As shown, a CB consists of system bits and parity bits. One or more RVs (e.g., additional redundancy) of CB1 are transmitted by puncturing CB2 and CB3. To reduce the impact of puncturing, the parity bits of CB can be punctured, while the system bits of CB can remain unpunctured. For example, the parity bits of CB2 and CB3 are punctured for transmitting CB1, with the puncturing order from the end of CB2 / CB3 to the beginning of CB2 / CB3. Thus, even if CB2 / CB3 is punctured, it will not affect the decoding of CB2 / CB3.

[0349] In another implementation, the resource allocation for transmitting remaining RVs can be dynamically scheduled. For example, an ACK signal automatically frees up all remaining symbols / sub-slots in the time slot for transmitting the remaining RVs of previous data packets. If the two transmissions (data packets) come from different UEs, any ACK should be broadcast to other UEs so that when a UE hears another UE's ACK, the UE that has not completed its transmission can continue to receive its remaining RVs in these freed symbols / sub-slots. To avoid conflicts between multiple UEs, some predefined rules can be specified to use these freed symbols / sub-slots.

[0350] With dynamic scheduling of the puncturing ratio (Option 2), there may be no limit or a certain limit on the minimum number of retransmitted symbols in subsequent time slots; and / or there may be no limit on the maximum number of time slots used for retransmission.

[0351] A schematic diagram of scheduling the primary CB and the secondary CB is shown below. Figure 11 As shown, there are three scheduling methods (taking CB as an example), as shown below.

[0352] One scheduling method (Schedule 2a: Basic) is: always prioritize scheduling the primary CB; once the primary CB is successfully decoded, share all remaining symbols with the earliest undecoded guest CB.

[0353] For example, refer to Figure 9 The primary codeword (e.g., user 4's codeword) is first scheduled on time slot 4. Once user 4's codeword is successfully decoded and has not occupied the entire time slot 4 (i.e., it does not occupy all symbols in time slot 4), the remaining portion of time slot 4 can be shared for transmitting other codewords. At this point, the remaining symbols in time slot 4 can be shared for transmitting previously undecoded guest codewords.

[0354] In one implementation, such as Figure 9 As shown, the remaining symbols in time slot 4 can be shared for transmitting the earliest undecoded codeword. For example, the transmission of user 2's codeword precedes user 3's codeword, and user 3's codeword precedes user 4's codeword. Furthermore, before transmitting user 4's codeword, neither user 2's nor user 3's codewords have been successfully decoded. At this point, user 2's codeword can be considered the earliest undecoded codeword. Once user 4's codeword is successfully decoded and has not occupied the entire time slot 4 (i.e., it does not occupy all symbols in time slot 4), the remaining portion of time slot 4 can be shared for transmitting user 2's codeword.

[0355] In another scheduling method (Schedule 2b: Infinite Buffer), a certain number of symbols or a certain percentage of time slots can be used to transmit the primary CB to guarantee its transmission. For example, the primary CB is always guaranteed to be within a dedicated symbol (e.g., time slot 9 / 12). In this method, once the primary CB is successfully decoded, all remaining symbols are shared with the earliest undecoded guest CB. If the primary CB fails to decode within a dedicated symbol (e.g., time slot 9 / 12), the earliest failed guest CB is scheduled within a shareable symbol (e.g., time slot 3 / 12); in other words, shareable symbols can be punctured. If the primary CB is not successfully decoded within a dedicated symbol, the remaining RVs of the primary CB can be transmitted in subsequent time slots by puncturing one or more other CBs.

[0356] In another scheduling method (scheduling 2c: finite buffer), the method is the same as / similar to 2b, except that undecoded CBs are discarded after X time slots (X=5); if a CB is not decoded after a certain number of time slots, it can be discarded.

[0357] This invention provides a method for channel coding design. Both polar codes and LDPC codes can be used in this scheme.

[0358] For polar codes: Length N max The master code is divided into multiple sub-blocks (e.g., 32 sub-blocks), and a decoding attempt is performed after each sub-block is received. Assume each sub-block has B bits. Besides 32 sub-blocks, it can also be divided into 4, 8, 16, and 64 sub-blocks (of length N). max The master code can be divided into 4, 8, 16, or 64 sub-blocks.

[0359] Transmission is performed according to the sub-block interleaver. If the resources allocated for a single transmission have M bits, then the transmission floor is M / B. B bits, and repeat the extra M-floor (M / B). B bits.

[0360] When M>K or M>M min Decoding begins at time (where M) min (where K is the minimum code length for decoding and K is the system bit length), and ACK / NACK is reported after each sub-block. It should be noted that NACK can be omitted.

[0361] LDPC codes can also be used for: Ensure the transmission system bits and core parity bits are secure, and punch holes only in the extended parity bits.

[0362] Redundant version design: No starting position is defined for each redundant version. The transmitter continues to send the next encoded bit in the circular buffer whenever possible, and the receiver assumes the same. Therefore, there is no need to specify redundant versions. Due to this new redundant version design (without a predefined starting position), better coding gain can be achieved.

[0363] Punching existing transmissions needs to be robust so that certain coded bits that are not easily punctured are mapped to REs reserved for potential puncturing.

[0364] This invention provides yet another method for data transmission. To support the aforementioned PROQ scheme, this invention proposes a new frame structure.

[0365] One possible scenario is FDD. PROQ-FDD is conveniently designed because it allows for timely transmission of potential feedback. This helps to benefit from early termination. NACK transmissions are typically unnecessary, saving UL power and reducing interference. An ACK is reported after successful decoding to stop DL transmission.

[0366] In FDD scenarios, for feedback designs, there can be an implicit UCI-to-PDSCH association. Furthermore, UL ACK / NACK and their corresponding PDSCH have a fixed delay. This fixed delay can be x symbols / mini-slots / slots. For example, x=1.

[0367] Figure 12 An example of frame structure in an FDD scene is shown. Figure 12 In this context, each block represents a time-frequency resource block. In an FDD scenario, downlink data transmission occurs on one bandwidth part (BWP), while uplink CQI / NACK / ACK occurs on another bandwidth part (BWP). For example, downlink data is transmitted on the DL BWP, and uplink CQI / NACK / ACK is transmitted on the UL BWP.

[0368] exist Figure 12In this configuration, resource 1201 is used to transmit CQI (e.g., open-loop CQI), and resource 1202 is used to transmit one or more RVs of minimum transmission length. After transmitting one or more RVs of minimum transmission length, there is a feedback opportunity corresponding to each RV (in other words, the resources used / reserved for transmitting feedback). Additionally, implicit UCI-to-PDSCH associations may exist. For example, feedback transmitted on resource 1205 corresponds to one or more RVs of TB / CBG / CB transmitted on resource 1204. Similarly, feedback transmitted on resources 1207, 1209, 1211, 1213, and 1215 corresponds to RVs of TB / CBG / CB transmitted on resources 1206, 1208, 1210, 1212, and 1214, respectively. For example, feedback transmitted on resource 1203 corresponds to one or more RVs of minimum transmission length transmitted on resource 1202. In this case, ULACK / NACK can have a fixed delay for the RVs transmitted on the corresponding PDSCH. For example, each resource 1203, 1204, 1205, 1206, 1207, ..., 1218 has a duration of one mini-slot, and the UL ACK / NACK transmitted on a resource (e.g., resource 1205) can have a fixed delay (e.g., one mini-slot) with its corresponding PDSCH (e.g., resource 1204). Furthermore, feedback may not be transmitted until one or more RVs of the minimum transmission length have been received.

[0369] exist Figure 12 In the example shown, the previous TB was not successfully decoded before the BS began transmitting the current TB. At this time, the current TB is perforated by the previous TB (e.g., incremental redundancy of the previous TB). Resources 1202, 1204, 1206, 1210, 1214, 1216, and 1218 are used to transmit one or more RVs of the current TB, while resources 1208 and 1212 are used to transmit one or more RVs of the previous TB.

[0370] exist Figure 12In the example shown, after receiving and decoding the RV of the previous TB transmitted on resource 1208 (or decoded together with the previous RV of the previous TB), the previous TB (or CBG, CB) has not yet been successfully decoded. The UE may or may not transmit a NACK on resource 1209 (because resource 1209 corresponds to one or more RVs of the previous TB transmitted on resource 1208). After receiving and decoding one or more RVs of the previous TB transmitted on resource 1212 (or decoded together with the previous RV of the previous TB), the previous TB is successfully decoded. At this time, an ACK is transmitted on resource 1213. Since the feedback transmitted on resource 1213 corresponds to one or more RVs of the previous TB transmitted on resource 1212, after receiving the ACK transmitted on resource 1213, the BS can know that one or more RVs of the previous TB transmitted on resource 1212 have been successfully decoded (or successfully decoded together with the previous RV of the previous TB). In other words, once an ACK corresponding to the previous TB is received, the BS knows that the previous TB has been successfully decoded, and then the BS can stop transmitting the RVs of the previous TB. The current TB will not be punched again for transmitting a previous TB that has been successfully decoded. For example, if a previous TB has not been successfully decoded, resource 1216 can be used to transmit one or more RVs of the previous TB. However, if the previous TB has been successfully decoded, resource 1216 will not be used to transmit one or more RVs of the previous TB; instead, resource 1216 will be used to transmit one or more RVs of the current TB.

[0371] exist Figure 12 In the example shown, after receiving and decoding one or more RVs of the previous TB transmitted on resource 1214 (or decoded together with the previous RVs of the current TB), the current TB is successfully decoded. At this time, an ACK is transmitted on resource 1215. Since the feedback transmitted on resource 1215 corresponds to one or more RVs of the current TB transmitted on resource 1214, after receiving the ACK transmitted on resource 1215, the BS knows that one or more RVs of the current TB transmitted on resource 1214 have been successfully decoded (or successfully decoded together with the previous RVs of the current TB). In other words, once the ACK corresponding to the current TB is received, the BS knows that the current TB has been successfully decoded, and the BS can stop sending RVs of the current TB.

[0372] exist Figure 12In this scenario, the BS receives the ACK transmitted on resource 1215 and simultaneously transmits one or more RVs of the current TB on resource 1216. Therefore, when the BS receives the ACK transmitted on resource 1215, one or more RVs of the current TB are still transmitted on resource 1216 and are accordingly received by the UE. However, since the current TB has been successfully decoded, the UE no longer needs to receive or decode the one or more RVs of the current TB transmitted on resource 1216. In one example, the RVs of the current TB transmitted on resource 1216 are not received by the UE. In another example, one or more RVs of the current TB transmitted on resource 1216 are received by the UE but not decoded.

[0373] Since the BS has received the ACK transmitted on resource 1215, it will stop transmitting the RV for the current TB. For example, the RV for the current TB will not be transmitted on any resource after resource 1216. After stopping the transmission of the RV for the current TB, the BS can begin transmitting the RV for the next TB. For example, resource 1218 can be used to transmit one or more RVs for the next TB.

[0374] Additionally, to ensure that each RV has a feedback opportunity, the duration of RV transmission on each resource block of the DL BWP can be the same as the duration of the feedback reporting window on the UL BWP. For example, resource 1205 and resource 1204 can have the same duration in the time domain.

[0375] It's important to note that previous and current TBs can be transmitted to the same UE or to different UEs. For example, the previous TB might be transmitted to UE1, and the current TB to UE2. In this case, once UE1 has successfully decoded the received TB (e.g., the previous TB), it can shut down one or more of its receive antennas. In other words, if UE1 has successfully received a TB and has no more TBs to transmit / receive, it can shut down the RF chain (including antennas). Whether UE1 will proceed with further transmission / reception may depend on the BS scheduling.

[0376] In FDD scenarios, the punching pattern can be predefined. Punching patterns include uniform distribution, reverse punching, or punching from one or both ends, etc.

[0377] In one implementation, the punching mode can be indicated via RRC / DCI.

[0378] In another implementation, the punching pattern can be predefined in the table and indicate specific options (indexes).

[0379] Another possible scenario is TDD. A special frame structure needs to be defined for TDD and designed in conjunction with SBFD.

[0380] Figure 13 An example of a frame structure in a TDD scenario is shown. Figure 13 In this context, each block represents a time-frequency resource block. In a TDD scenario, downlink data transmission and uplink CQI / NACK / ACK transmission exist on the same bandwidth part (BWP).

[0381] In TDD scenarios, downlink data and uplink CQI / NACK / ACK are transmitted on the same BWP (e.g., DL / UL BWP) with different durations. Some symbols / sub-slots are reserved for possible ACK transmissions and are inserted between DL transmissions. At this time, some resources can be reserved for transmitting UE feedback, thereby achieving fine-grained incremental redundancy with more feedback opportunities during data transmission. In some embodiments, some symbols / mini-slots can be reserved for uplink transmission, and uplink NACK / ACK can be transmitted on the reserved symbols / mini-slots.

[0382] In TDD scenarios, some symbols / sub-slots can be reserved for potential ACK transmissions and inserted between DL transmissions. The frame structure can be flexibly defined to adapt to various scenarios. For example, the ratio of UL symbols to DL symbols can be flexibly configured through several modes: |D|U|D|U|D|U| pattern; or |D|D|U|D|D|U| pattern ("D" represents DL, "U" represents UL).

[0383] exist Figure 13 In this example, resource 1301 is used to transmit CQI, and resource 1302 is used to transmit one or more RVs of the current TB with the minimum transmission length. In the example of the |D|U|D|U|D|U| mode, resource 1303 is used to transmit one or more RVs of the current TB; reserved resource 1304 is used to transmit UE feedback corresponding to the current TB; resource 1305 is used to transmit one or more RVs of the previous TB; reserved resource 1306 is used to transmit UE feedback corresponding to the previous TB; resource 1307 is used to transmit one or more RVs of the current TB; reserved resource 1308 is used to transmit UE feedback corresponding to the current TB; resource 1309 is used to transmit one or more RVs of the current TB; and reserved resource 1310 is used to transmit UE feedback corresponding to the current TB.

[0384] exist Figure 13In the example of the |D|U|D|U|D|U| pattern shown, after the UE receives and decodes one or more RVs of the previous TB transmitted on resource 1305, the previous TB is successfully decoded. Therefore, the UE transmits an ACK on resource 1306. Since the feedback transmitted on resource 1306 corresponds to the RV transmitted on resource 1305, once the BS receives the ACK transmitted on resource 1306, the BS knows that the RV transmitted on resource 1305 was successfully decoded (or successfully decoded together with the previous RV). In other words, the BS knows that the previous TB has been successfully decoded. At this point, the RV of the previous TB will no longer be transmitted after being successfully decoded.

[0385] exist Figure 13 In the example of the |D|U|D|U|D|U| pattern shown, after the UE receives and decodes one or more RVs of the current TB transmitted on resource 1309, the current TB is successfully decoded. Therefore, the UE transmits an ACK on resource 1310. Since the feedback transmitted on resource 1310 corresponds to the RV transmitted on resource 1309, once the BS receives the ACK transmitted on resource 1310, the BS knows that the RV transmitted on resource 1309 has been successfully decoded (or successfully decoded together with the previous RV). In other words, the BS knows that the current TB has been successfully decoded. At this time, the RV of the current TB will no longer be transmitted after being successfully decoded. At this time, resource 1311 will no longer be used to transmit the RV of the current TB. Furthermore, since the current TB has not yet been successfully decoded after the UE receives and decodes the RV of the current TB transmitted on resources 1303 and 1307, the UE can transmit a NACK or not transmit feedback on resources 1304 and / or 1308, which correspond to resources 1303 and 1307 respectively.

[0386] exist Figure 13 In the example of the |D|U|D|U|D|U| pattern shown, resources 1303' and 1304' are used to transmit the RV of the current TB; reserved resource 1305' is used to transmit the UE feedback corresponding to the current TB; resources 1306' and 1307' are used to transmit the RV of the previous TB; reserved resource 1308' is used to transmit the UE feedback corresponding to the previous TB; resources 1309' and 1310' are used to transmit the RV of the current TB; and reserved resource 1311' is used to transmit the UE feedback corresponding to the current TB.

[0387] exist Figure 13In the example of the |D|U|D|U|D|U| pattern shown, after the UE receives and decodes the RV of the current TB transmitted on resources 1303' and 1304', but the current TB has not yet been successfully decoded, the UE can correspondingly transmit NACK or not transmit feedback on resource 1305' corresponding to resources 1303' and 1304'. After the UE receives and decodes the RV of the previous TB transmitted on resources 1306' and 1307', and the previous TB is successfully decoded, the UE can correspondingly transmit ACK on resource 1308' corresponding to resources 1306' and 1307'. After the UE receives and decodes the RV of the current TB transmitted on resources 1309' and 1310', and the current TB is successfully decoded, the UE can correspondingly transmit ACK on resource 1311' corresponding to resources 1309' and 1310'.

[0388] It is important to note that the allocation of symbols / sub-slots between DL transmissions and UL ACKs can have various patterns. One approach is to allocate an ACK symbol after each DL transmission symbol. Alternatively, multiple consecutive data symbols can be followed by an ACK / NACK. The discontinuous puncturing pattern in this invention provides feedback (ACK) time. The puncturing ratio and cross-slot puncturing pattern make the PROQ scheme more compliant with standards.

[0389] TDD designs may have lower spectral efficiency, but they are suitable for a wider range of scenarios.

[0390] Another possible design is TDD with sub-band full-duplex (SBFD). This design can improve the spectral efficiency of pure TDD. The difference is that uplink NACK / ACK can be transmitted on reserved subbands and symbol / mini-slots.

[0391] In TDD-SBFD, one or more subbands can be reserved for UE feedback. In other words, one or more subbands are reserved so that the BS can listen for feedback from one or more UEs (when UL resources are multiplexed by multiple UEs).

[0392] exist Figure 14 In one example shown, resource 1401 is used to transmit CQI, and resource 1402 is used to transmit the RV of the current TB with a minimum Tx length. Resources 1403, 1404, 1405, 1406, 1407, and 1408 are used to transmit the RV of the current TB. Resources 1409 and 1410 are used to transmit the RV of the previous TB. Resources 1412, 1413, 1414, and 1415 are reserved subbands used by the BS to listen for feedback.

[0393] After decoding the RV of TB1 transmitted on resources 1402 and 1403, the current TB (e.g., TB1) is not successfully decoded. Accordingly, the UE can optionally send a NACK on resource 1412. After decoding the RV of TB1 transmitted on resources 1404 and 1405, TB1 is still not successfully decoded. Accordingly, the UE can optionally send a NACK on resource 1413. After decoding the RV of TB1 transmitted on resources 1406 and 1407, TB1 is finally successfully decoded. Accordingly, the UE can send an ACK on resource 1414. At this point, since TB1 has been successfully decoded, the RV of TB1 will not be transmitted on any resource after resource 1408. Additionally, the RV of TB1 sent by the BS on resource 1408 may not be received by the UE.

[0394] TB1 is punctured by a previous TB (e.g., TB0). The RV of TB0 (e.g., the remaining RV) is transmitted on resource 1409 by puncturing TB1. After receiving and decoding one or more RVs of TB0 transmitted on resource 1409, TB0 is successfully decoded. Accordingly, the UE sends an ACK on resource 1415. At this point, since TB0 has been successfully decoded, the RV of TB0 will not be transmitted on any resource after resource 1410. Additionally, the RV of TB0 transmitted by the BS on resource 1410 may not be received by the UE.

[0395] exist Figure 14 In another example shown, resources 1403', 1404', 1405', 1406', 1407', and 1408' are used to transmit the RV of the current TB. Resources 1409', 1410', and 1411' are used to transmit the RV of the previous TB. Resources 1412', 1413', and 1414' are reserved subbands used by the BS to listen for feedback.

[0396] After decoding the RV of TB1 transmitted on resources 1403' and 1404', the current TB (e.g., TB1) is not successfully decoded. Accordingly, the UE can optionally send a NACK on resource 1412'. After decoding the RV of TB1 transmitted on resources 1405', 1406', and 1407', TB1 is successfully decoded. Accordingly, the UE can send an ACK on resource 1413'. At this point, since TB1 has been successfully decoded, the RV of TB1 will not be transmitted on any resource after resource 1408'. Additionally, the RV of TB1 sent by the BS on resource 1408' may not be received by the UE.

[0397] TB1 is perforated by a previous TB (e.g., TB0). The RV of TB0 (e.g., the remaining RV) is transmitted on resources 1409', 1410', and 1411' by perforating TB1. After receiving and decoding one or more RVs of TB0 transmitted on resources 1409' and 1410', TB0 is successfully decoded. Accordingly, the UE sends an ACK on resource 1414'. At this point, since TB0 has been successfully decoded, the RV of TB0 will not be transmitted on any resource after resource 1411'. Additionally, the RV of TB0 transmitted by the BS on resource 1411' may not be received by the UE.

[0398] As mentioned above, in the design of TDD-SBFD, some sub-bands are reserved for UE feedback. Therefore, fewer resources are reserved compared to pure TDD. This improves spectrum efficiency.

[0399] This invention provides another method for data transmission.

[0400] In some embodiments, carrier aggregation is expected to occur when carriers from one or more bandwidth parts (BWPs) are used for transmission. Carrier aggregation can be referred to as "virtual full-duplex." In this case, dedicated uplink BWPs and / or uplink carriers may exist for low-latency uplink transmission feedback. For example, dedicated uplink BWPs and / or dedicated uplink carriers may exist for real-time feedback (e.g., ACK / NACK). Carrier aggregation avoids frequent switching between uplink and downlink transmissions, thereby improving spectral efficiency.

[0401] In one implementation, the BS can be configured to transmit feedback on the same BWP / carrier. In another implementation, the BS can be configured to transmit feedback on multiple BWP / carriers. For example, feedback for different codewords can be transmitted on different BWP / carriers.

[0402] The BS can notify the UE of the BWP / carrier used for transmitting feedback by sending a second message to the UE. This second message is also called resource information. For example, resource information may include a BWP configuration indicating one or more BWPs used for transmitting feedback. These one or more BWPs can be identified by one or more BWP indices / one or more IDs. As another example, resource information may include a carrier configuration indicating one or more carriers used for transmitting feedback. These one or more carriers can be identified by one or more carrier indices / one or more IDs. In this case, resource information can indicate one or more BWPs / one or more carriers used for multiple feedbacks. In other words, resource information can indicate resources used for multiple feedback opportunities. This allows for the timely transmission of one or more feedbacks and ensures the timely reporting of decoding results (CSI, etc.). This resource information can be carried in RRC or DCI. One or more feedbacks (e.g., multiple ACK / NACK) can be carried in Uplink Control Information (UCI), and real-time feedback can be called a real-time UCI report.

[0403] In one implementation, the RRC signaling may contain fields describing resource information used for transmitting feedback. One or more BWPs / carriers may be identified by one or more BWP IDs / carrier IDs.

[0404] For example, RRC signaling may contain fields indicating one or more BWPs used for transmission feedback (such as multi-ACK UCI reports).

[0405] BWP-Uplink ::=SEQUENCE { bwp-IdBWP-Id, bwp-CommonBWP-UplinkCommon bwp-DedicatedBWP-UplinkDedicated bwp-RealtimeBWP-UplinkRealTime ... } BWP- UplinkRealTime ::=SEQUENCE { pucch-rt-ConfigSetupRelease {PUCCH-rt-Config}OPTIONAL,--Need M ... } PUCCH-rt-Config::{ multi-ACK-carrierId SEQUENCE (SIZE (1..maxNofCarrier)) OF PUCCH-multiACK-carrierId } Once the UE receives the RRC signaling, the UE can know one or more carriers used for transmitting feedback based on the CarrierId, and the UE can transmit feedback on those one or more carriers.

[0406] For example, the DCI configuration may contain one or more fields indicating one or more BWPs and / or one or more carriers used for transmission feedback (such as multi-ACK UCI reports).

[0407] In the DCI configuration, specific BWP indexes and / or carrier indexes can also be left to the DCI for configuration.

[0408] For example, there may be modified fields in the frequency domain resource allocation, where a set of bits is defined to indicate the BWP index and / or carrier index configured in BWP-UplinkRealTime.

[0409] For example, in time-domain resource allocation, there may be modified fields that define bit sets to indicate the timing of UCI transmissions (including multiple ACK / NACKs) (e.g., time slot and / or symbol index, offset).

[0410] During UE processing, upon receiving resource information (e.g., BWP configuration and / or carrier configuration in the RRC, which may contain a set of available BWP indices and / or carrier indices), the UE can determine which resources (one or more BWPs and / or one or more carriers) are used to transmit real-time feedback. For example, if the UE receives a BWP-UplinkRealTime configuration carried in the RRC and indicates a specific index corresponding to the available configuration, the UE can obtain one or more BWP indices, one or more carrier indices, and one or more symbol indices for a new real-time UCI report.

[0411] For example, the energy-saving results under multi-cell, multi-user settings are as follows: Figure 15 As shown, the x-axis represents the number of UEs within the simulation area.

[0412] Some insights can be drawn from the above results: The first source of gain is that rateless coding has better rate adaptability compared to IR-HARQ.

[0413] Rateless coding stops earlier than IR-HARQ, which requires transmitting the entire RV every time.

[0414] The second source of gain is the reduction of interference caused by water-filled coding.

[0415] The stronger the interference, the more additional gain can be observed from the coded water injection.

[0416] Compared to traditional HARQ, its advantages include higher throughput, lower latency, power saving, reduced interference, and lower sensitivity to imperfect channel estimation.

[0417] Some embodiments of the present invention provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium). This computer-readable storage medium stores program instructions that, when executed on a network device / terminal device, cause the network device / terminal device to perform one or more steps of the beam management method as described in any of the above embodiments.

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

[0419] Some embodiments of the present invention also provide a computer program product. This computer program product includes program instructions carried on a non-transitory computer-readable storage medium. When executed on a network device / terminal device, the computer program instructions cause the network device / terminal device to perform one or more steps of the method for data transmission described in the above embodiments.

[0420] The beneficial effects of computer-readable storage media and computer program products are the same as those of the methods for data transmission described in the above embodiments, and will not be repeated here.

[0421] The above description is merely a specific implementation of the present invention, but the scope of protection of the present invention is not limited thereto. Any modifications or substitutions falling within the technical scope of the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

[0422] In some aspects of the invention, a computer program comprising instructions is provided. When executed by a processor, the instructions enable the processor to implement the method of the invention.

[0423] In some aspects of the present invention, an integrated circuit is provided. This integrated circuit includes one or more logic circuits for performing steps of the method for data transmission of the present invention.

[0424] In some aspects of the invention, an apparatus is provided that includes a module (e.g., at least one processor) for implementing the methods of the invention. This apparatus may be a device (i.e., a terminal device or a network device) or a module or component within a device. At least one processor can execute instructions stored in a computer-readable medium to implement the methods described above.

[0425] The device may be a communication device or a device implemented within a communication device. For example, a device implemented in a communication device may be an integrated circuit, which may have other names in some cases, such as chip, modem, modem chip, baseband chip, or baseband processor. In some implementations, one or more integrated circuits may be packaged as a system-on-a-chip, system-in-package, or multi-chip module. The device may include one or more integrated circuits, or it may include one or more integrated circuits and other discrete components.

[0426] The solutions described in this invention are applicable to next-generation (e.g., sixth-generation, 6G, or higher) networks, or traditional (e.g., 5G, 4G, 3G, or 2G) networks. The proposed methods are applicable to a wide range of communication networks, such as 5G+, 6G, Wi-Fi, NTN, and distributed or self-organizing networks.

[0427] It should be understood that any module, component, or device disclosing executable instructions herein may include or otherwise access one or more non-transitory computer / processor-readable storage media for storing information, such as computer / processor-readable instructions, data structures, program modules, and / or other data. A non-exhaustive list of examples of non-transitory computer / processor-readable storage media includes magnetic tape cassettes, magnetic tape, disk storage or other magnetic storage devices, compact disc read-only memory (CD-ROM), digital video disc or digital versatile disc (DVD), Blu-ray Disc™ and other optical discs, volatile and non-volatile, removable and non-removable media implemented in any method or technology, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other storage technologies. Any such non-transitory computer / processor storage medium may be part of a device or apparatus, or may be accessed or connected to a device or apparatus. Computer / processor-readable / executable instructions used to implement the methods, applications, or modules described herein may be stored by such non-transitory computer / processor-readable storage media or otherwise preserved.

[0428] It should be noted that the message in this invention can be replaced with information, which can be carried in a single message or in more than one single message.

[0429] The terms “device” and “equipment” are used interchangeably.

[0430] In this invention, when used in conjunction with the terms "comprising" or "including" in the claims and / or specification, the word "a" or "an" may refer to "one," but also has the same meaning as "one or more," "at least one," and "one or more," unless explicitly stated otherwise. Similarly, the word "another" may refer to at least a second or more, unless explicitly stated otherwise.

[0431] In this invention, the use of terms such as "first," "second," etc., before the same terms (e.g., UE or operation step) does not imply an order or sequence of these terms. For example, unless otherwise specified, "first UE" and "second UE" refer to two different UEs; similarly, unless otherwise specified, "first step" and "second step" refer to two different operation steps, but this does not mean that the first step must occur before the second step. The actual order depends on the logic of the two steps.

[0432] The terms “coupled to,” “coupled,” or “connected” as used herein may have several different meanings depending on the context in which they are used. For example, as used herein, the terms “coupled to,” “coupled,” or “connected” may indicate that two elements or devices are directly connected to each other, or are connected to each other by mechanical elements through one or more intermediate elements or devices, depending on the specific context.

[0433] It is important to note that the expression "at least one of A or B" used in this document is interchangeable with the expression "A and / or B". It refers to a list from which you can choose either A or B, or A and B. Similarly, the expression "at least one of A, B, or C" used in this document is interchangeable with "A and / or B and / or C" or "A, B, and / or C". It refers to a list from which you can choose: A or B or C, or A and B, or A and C, or B and C, or all of A, B, and C. The same principle applies to longer lists with the same format.

[0434] This invention includes various embodiments, not only method embodiments but also other embodiments, such as apparatus embodiments and embodiments related to non-transitory computer-readable storage media. Embodiments may be combined, alone or in combination, with the features disclosed herein.

[0435] The terms “receive,” “detect,” and “decode” used herein may have several different meanings depending on the context in which they are used. For example, without specific indication, the term “receive” may indicate that information (e.g., DCI or MAC-CE, RRC signaling, or TB) has been successfully received by the receiving node, meaning that the receiving side has correctly detected and decoded the information. In this scenario, “receive” may encompass both “detect” and “decode,” or may refer to the same thing; for example, “receive paging” means that the paging has been correctly decoded and successfully retrieved, and correspondingly, “the receiving side did not receive a paging” means that the receiving side did not detect and / or decode the paging. “Not received a paging” means that the receiving side attempted to detect and / or decode the paging but failed to retrieve it. The term “receive” may sometimes indicate that a signal has arrived at the receiving side, but this does not necessarily mean that the information in the signal has been correctly detected and decoded. In this case, the receiving side needs to detect and decode the signal to obtain the information carried in the signal. In this scenario, “receive,” “detect,” and “decode” may indicate different processes by which the receiving side obtains information. Although the invention has referenced illustrative embodiments, it is not intended to be interpreted in a limiting sense. Those skilled in the art will understand, upon referring to this description, various modifications and combinations of the illustrative embodiments and other embodiments of the invention. When two or more embodiments are combined, not all features of the combined embodiments are necessary for that combination.

[0436] Additionally or alternatively, features disclosed herein in the context of any particular embodiment may be implemented in other embodiments. For example, method embodiments may be implemented in apparatus, system, and / or computer program product embodiments. Furthermore, although embodiments are described primarily in the context of methods and apparatus, other implementations are contemplated as instructions stored in non-transitory computer-readable media, etc. These media may store programs or instructions to perform any of the various methods consistent with the present invention.

[0437] The following are acronyms, abbreviations, and key terms:

Claims

1. A method for data transmission, characterized in that, include: Send one or more bit sets of the first codeword on the first resource; Send one or more bit sets of the second codeword on the first part of the second resource; Send one or more bit sets of the first codeword on the second part of the second resource; Receive feedback indicating that the first codeword has been successfully decoded; In response to the feedback, the transmission of one or more bit sets of the first codeword is terminated.

2. The method according to claim 1, characterized in that, Also includes: Send a first instruction, wherein the first instruction is used to indicate at least one of the following: the proportion of the second part of the second resource in the second resource, the quantity of the second part of the second resource, or the distribution of the second part of the second resource in the second resource.

3. The method according to claim 2, characterized in that, The second portion of the second resource is uniformly distributed within the second resource; or The second portion of the second resource is distributed at the beginning of the second resource, at the end of the second resource, or at both the beginning and the end of the second resource.

4. The method according to claim 2 or 3, characterized in that, The second portion of the second resource is used to transmit parity bits.

5. The method according to any one of claims 1 to 4, characterized in that, Also includes: Send one or more bit sets of the third codeword on the first part of the third resource; One or more bit sets of the first codeword are transmitted on the second part of the third resource; One or more bit sets of the second codeword are transmitted on the third portion of the third resource.

6. The method according to claim 5, characterized in that, The initial bit set of the first codeword is sent earlier than the initial bit set of the second codeword, and the initial bit set of the second codeword is sent earlier than the initial bit set of the third codeword. After transmitting the one or more bit sets of the first codeword on the second portion of the third resource, the one or more bit sets of the second codeword are transmitted on the third portion of the third resource.

7. The method according to claim 5 or 6, characterized in that, The quantity of the second portion of the second resource is greater than the quantity of the second portion of the third resource.

8. The method according to any one of claims 5 to 7, characterized in that, The proportion of the second part of the second resource in the second resource is greater than the proportion of the second part of the third resource in the third resource.

9. The method according to any one of claims 1 to 8, characterized in that, Also includes: Send first information, wherein the first information is used to indicate the length of the one or more bit sets of the first codeword, the starting position of the one or more bit sets of the first codeword on the time-frequency resource, or the length of the one or more bit sets of the first codeword and the starting position of the one or more bit sets of the first codeword on the time-frequency resource, wherein... The length of the one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in the one or more bit sets of the first codeword, or the maximum transmission length of the one or more bit sets of the first codeword.

10. The method according to claim 9, characterized in that, The length of the one or more bit sets of the first codeword is determined based on at least one of the following: large-scale channel quality indicator (CQI), prior feedback, or modulation and coding scheme (MCS).

11. The method according to claim 9 or 10, characterized in that, The maximum transmission length is an integer multiple of the minimum transmission length.

12. The method according to any one of claims 1 to 11, characterized in that, The one or more bit sets for transmitting the first codeword include: Transmit the one or more bit sets of the first codeword on multiple first frequency domain resources.

13. The method according to any one of claims 1 to 12, characterized in that, Also includes: Send second information to the first terminal device, wherein the second information includes a second indication of the plurality of first frequency domain resources.

14. The method according to claim 13, characterized in that, The second information includes one or more BWP indices or one or more carrier indices.

15. The method according to any one of claims 11 to 14, characterized in that, The multiple first frequency domain resources are obtained through carrier aggregation.

16. The method according to any one of claims 1 to 15, characterized in that, The feedback indicating that the first codeword has been successfully decoded includes: The feedback is received on multiple second frequency domain resources.

17. The method according to claim 16, characterized in that, Multiple first frequency domain resources belong to the downlink frequency band of frequency division duplex (FDD), and the multiple second frequency domain resources belong to the uplink frequency band of FDD.

18. The method according to claim 16 or 17, characterized in that, The duration for transmitting the one or more bit sets on multiple first frequency domain resources is the same as the duration of the reporting window for feedback on multiple second frequency domain resources.

19. The method according to claim 16, characterized in that, The plurality of first frequency domain resources and the plurality of second frequency domain resources at least partially overlap.

20. The method according to claim 19, characterized in that, At least a portion of time-domain resources, at least a portion of frequency-domain resources, or at least a portion of both time-domain and frequency-domain resources are reserved for receiving the feedback corresponding to the first codeword.

21. The method according to any one of claims 1 to 20, characterized in that, Also includes: A third instruction is sent to cause the receiving device to: receive the one or more bit sets of the first codeword on the first resource, receive the one or more bit sets of the second codeword on the first portion of the second resource, and receive the one or more bit sets of the first codeword on the second portion of the second resource.

22. The method according to any one of claims 1 to 21, characterized in that, Also includes: When the total length of one or more bit sets of the first codeword that have been transmitted reaches the maximum transmission length, the transmission of one or more bit sets of the first codeword is terminated.

23. The method according to any one of claims 1 to 22, characterized in that, Receiving the feedback corresponding to the first codeword includes: The feedback corresponding to the first codeword is received at one or more feedback opportunities, wherein the one or more feedback opportunities are periodic.

24. The method according to any one of claims 8 to 23, characterized in that, The first information is carried in Radio Resource Control (RRC) signaling or Downlink Control Information (DCI).

25. The method according to any one of claims 1 to 24, characterized in that, Send the first codeword to the first terminal device, or send the second codeword to the second terminal device, or send the first codeword to the first terminal device and send the second codeword to the second terminal device.

26. The method according to claim 25, characterized in that, Also includes: Receive a second feedback corresponding to the second codeword from the second terminal device on the second frequency domain resources.

27. A method for data transmission, characterized in that, include: Receive one or more bit sets of the first codeword on the first resource; Receive one or more bit sets of the second codeword on the first part of the second resource; Receive one or more bit sets of the first codeword on the second portion of the second resource; Send feedback indicating that the first codeword has been successfully decoded.

28. The method according to claim 27, characterized in that, Also includes: Receive a first instruction, wherein the first instruction is used to indicate at least one of the following: the proportion of the second portion of the second resource in the second resource, the quantity of the second portion of the second resource, or the distribution of the second portion of the second resource in the second resource.

29. The method according to claim 28, characterized in that, The second portion of the second resource is uniformly distributed within the second resource; or The second portion of the second resource is distributed at the beginning of the second resource, at the end of the second resource, or at both the beginning and the end of the second resource.

30. The method according to claim 28 or 29, characterized in that, The second portion of the second resource is used to transmit parity bits.

31. The method according to any one of claims 27 to 30, characterized in that, Also includes: Receive one or more bit sets of the third codeword on the first part of the third resource; Receive one or more bit sets of the first codeword on the second part of the third resource; One or more bit sets of the second codeword are received on the third portion of the third resource.

32. The method according to claim 31, characterized in that, The initial bit set of the first codeword is received earlier than the initial bit set of the second codeword, and the initial bit set of the second codeword is received earlier than the initial bit set of the third codeword. After receiving the one or more bit sets of the first codeword on the second portion of the third resource, the one or more bit sets of the second codeword are received on the third portion of the third resource.

33. The method according to claim 31 or 32, characterized in that, The quantity of the second portion of the second resource is greater than the quantity of the second portion of the third resource.

34. The method according to any one of claims 31 to 33, characterized in that, The proportion of the second part of the second resource in the second resource is greater than the proportion of the second part of the third resource in the third resource.

35. The method according to any one of claims 27 to 34, characterized in that, Also includes: Receive first information, wherein the first information is used to indicate the length of the one or more bit sets of the first codeword, the starting position of the one or more bit sets of the first codeword on the time-frequency resource, or the length of the one or more bit sets of the first codeword and the starting position of the one or more bit sets of the first codeword on the time-frequency resource, wherein... The length of the one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in the one or more bit sets of the first codeword, or the maximum transmission length of the one or more bit sets of the first codeword.

36. The method according to claim 35, characterized in that, The length of the one or more bit sets of the first codeword is determined based on at least one of the following: large-scale channel quality indicator (CQI), prior feedback, or modulation and coding scheme (MCS).

37. The method according to claim 35 or 36, characterized in that, The maximum transmission length is an integer multiple of the minimum transmission length.

38. The method according to any one of claims 27 to 37, characterized in that, The one or more bit sets for receiving the first codeword include: Receive the one or more bit sets of the first codeword on a plurality of first frequency domain resources.

39. The method according to any one of claims 27 to 38, characterized in that, Also includes: Receive second information, wherein the second information includes a second indication of the plurality of first frequency domain resources.

40. The method according to claim 39, characterized in that, The second information includes one or more BWP indices or one or more carrier indices.

41. The method according to any one of claims 38 to 40, characterized in that, The multiple first frequency domain resources are obtained through carrier aggregation.

42. The method according to any one of claims 27 to 41, characterized in that, The feedback indicating that the first codeword has been successfully decoded includes: The feedback is sent on multiple second frequency domain resources.

43. The method according to claim 42, characterized in that, Multiple first frequency domain resources belong to the FDD downlink frequency band, and the multiple second frequency domain resources belong to the FDD uplink frequency band.

44. The method according to claim 42 or 43, characterized in that, The duration for receiving the one or more bit sets on multiple first frequency domain resources is the same as the duration of the reporting window for feedback on multiple second frequency domain resources.

45. The method according to claim 42, characterized in that, The plurality of first frequency domain resources and the plurality of second frequency domain resources at least partially overlap.

46. ​​The method according to claim 45, characterized in that, At least a portion of time-domain resources, at least a portion of frequency-domain resources, or at least a portion of both time-domain and frequency-domain resources are reserved for sending the feedback corresponding to the first codeword.

47. The method according to any one of claims 27 to 46, characterized in that, Also includes: Receive a third instruction, wherein the third instruction is configured to: receive the one or more bit sets of the first codeword on the first resource, receive the one or more bit sets of the second codeword on the first portion of the second resource, and receive the one or more bit sets of the first codeword on the second portion of the second resource.

48. The method according to any one of claims 27 to 47, characterized in that, The feedback indicating that the first codeword has been successfully decoded includes: The feedback corresponding to the first codeword is sent at one or more feedback opportunities, wherein the one or more feedback opportunities are periodic.

49. The method according to any one of claims 35 to 48, characterized in that, The first information is carried in Radio Resource Control (RRC) signaling or Downlink Control Information (DCI).

50. The method according to any one of claims 42 to 49, characterized in that, Also includes: A second feedback corresponding to the second codeword is transmitted on the plurality of second frequency domain resources.

51. A method for data transmission, characterized in that, include: Receive one or more bit sets of the first codeword on the first resource; Receive one or more bit sets of the first codeword on the second part of the second resource; Send feedback indicating that the first codeword has been successfully decoded.

52. The method according to claim 51, characterized in that, Also includes: Receive a first instruction, wherein the first instruction is used to indicate at least one of the following: the proportion of the second portion of the second resource in the second resource, the quantity of the second portion of the second resource, or the distribution of the second portion of the second resource in the second resource.

53. The method according to claim 52, characterized in that, The second portion of the second resource is uniformly distributed within the second resource; or The second portion of the second resource is distributed at the beginning of the second resource, at the end of the second resource, or at both the beginning and the end of the second resource.

54. The method according to claim 52 or 53, characterized in that, The second portion of the second resource is used to transmit parity bits.

55. The method according to any one of claims 51 to 54, characterized in that, Also includes: One or more bit sets of the first codeword are received on the second part of the third resource.

56. The method according to claim 55, characterized in that, The quantity of the second portion of the second resource is greater than the quantity of the second portion of the third resource.

57. The method according to claim 55 or 56, characterized in that, The proportion of the second part of the second resource in the second resource is greater than the proportion of the second part of the third resource in the third resource.

58. The method according to any one of claims 51 to 57, characterized in that, Also includes: Receive first information, wherein the first information is used to indicate the length of the one or more bit sets of the first codeword, the starting position of the one or more bit sets of the first codeword on the time-frequency resource, or the length of the one or more bit sets of the first codeword and the starting position of the one or more bit sets of the first codeword on the time-frequency resource, wherein... The length of the one or more bit sets of the first codeword includes at least one of the following: the minimum transmission length of each bit set in the one or more bit sets of the first codeword, or the maximum transmission length of the one or more bit sets of the first codeword.

59. The method according to claim 58, characterized in that, The length of the one or more bit sets of the first codeword is determined based on at least one of the following: large-scale channel quality indicator (CQI), prior feedback, or modulation and coding scheme (MCS).

60. The method according to claim 58 or 59, characterized in that, The maximum transmission length is an integer multiple of the minimum transmission length.

61. The method according to any one of claims 51 to 60, characterized in that, The one or more bit sets for receiving the first codeword include: Receive the one or more bit sets of the first codeword on a plurality of first frequency domain resources.

62. The method according to claim 61, characterized in that, Also includes: Receive second information, wherein the second information includes a second indication of the plurality of first frequency domain resources.

63. The method according to claim 62, characterized in that, The second information includes one or more BWP indices or one or more carrier indices.

64. The method according to any one of claims 61 to 63, characterized in that, The multiple first frequency domain resources are obtained through carrier aggregation.

65. The method according to any one of claims 51 to 64, characterized in that, The feedback indicating that the first codeword has been successfully decoded includes: The corresponding feedback is sent on multiple second frequency domain resources.

66. The method according to claim 65, characterized in that, Multiple first frequency domain resources belong to the FDD downlink frequency band, and the multiple second frequency domain resources belong to the FDD uplink frequency band.

67. The method according to claim 65 or 66, characterized in that, The duration for receiving the one or more bit sets on multiple first frequency domain resources is the same as the duration of the reporting window for feedback on multiple second frequency domain resources.

68. The method according to claim 65, characterized in that, The plurality of first frequency domain resources and the plurality of second frequency domain resources at least partially overlap.

69. The method according to claim 68, characterized in that, At least a portion of time-domain resources, at least a portion of frequency-domain resources, or at least a portion of both time-domain and frequency-domain resources are reserved for sending the feedback corresponding to the first codeword.

70. The method according to any one of claims 51 to 69, characterized in that, Also includes: Receive a third instruction, wherein the third instruction is configured to: receive the one or more bit sets of the first codeword on the first resource, and receive the one or more bit sets of the first codeword on the second portion of the second resource.

71. The method according to any one of claims 51 to 70, characterized in that, The sending of feedback indicating that the first codeword has been successfully decoded includes sending the feedback corresponding to the first codeword at one or more feedback opportunities, wherein the one or more feedback opportunities are periodic.

72. The method according to any one of claims 58 to 71, characterized in that, The first information is carried in Radio Resource Control (RRC) signaling or Downlink Control Information (DCI).

73. An apparatus, characterized in that, It includes at least one processor, said at least one processor being configured to cause the device to perform the method according to any one of claims 1 to 26, 27 to 50 or 51 to 72.

74. A computer-readable storage medium, characterized in that, It stores computer program instructions thereon, which, when executed by processing circuitry in a computer, cause the computer to implement the method according to any one of claims 1 to 26, 27 to 50, or 51 to 72.

75. A computer program product, characterized in that, It includes instructions that, when executed by a computer, cause the computer to perform the method according to any one of claims 1 to 26, 27 to 50, or 51 to 72.

76. A system, characterized in that, It includes: A first apparatus for implementing the method according to any one of claims 1 to 26; A second apparatus for implementing the method according to any one of claims 27 to 50 or 51 to 72.

Images