Method, apparatus, and system for flexible scheduling
Flexible scheduling schemes with configurable SUs address inefficiencies in wireless communication systems by dynamically adapting resource allocation, reducing latency and improving throughput.
Patent Information
- Application Number
- PCT/CN2024/096314
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-03-28
- Filing Date
- 2024-05-30
- Publication Date
- 2025-10-02
AI Technical Summary
Existing wireless communication systems lack flexibility in scheduling, leading to inefficiencies in resource allocation and increased latency, particularly in systems with varying numerologies and service types.
Implementing flexible scheduling schemes with configurable scheduling units (SUs) that allow for variable and adaptable resource allocation based on application type, service type, or numerology, using techniques such as configurable scheduling granularity and dynamic signaling to reduce latency and improve system throughput.
The flexible scheduling schemes enhance resource utilization efficiency, reduce transmission latency, and improve overall system throughput by allowing for dynamic adaptation to different service types and numerologies.
Smart Images

Figure CN2024096314_02102025_PF_FP_ABST
Abstract
Description
Method, Apparatus, and System for Flexible Scheduling
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims the benefit of U.S. Provisional Application Serial No. 63 / 571,092 filed on March 28, 2024, the entire contents of which are hereby incorporated by reference in its entirety.TECHNICAL FIELD
[0003] The present disclosure relates generally to wireless communications. Particularly, it relates to a method, apparatus and system for flexible scheduling.BACKGROUND
[0004] Wireless communications system such as fourth generation (4G) system (for example, Long-Term Evolution (LTE) system) , fifth generation (5G) system (for example, New Radio (NR) system) have been deployed to provide various types of applications, such as message, voice, video and other data.
[0005] In wireless communication, for data channel, hybrid automatic repeat request (HARQ) process is implemented to allow re-transmission and hybrid combining of original and re-transmission of the same data to counterattack the channel impairment and improve the robustness of the system performance.
[0006] This background information is provided to reveal information believed by the applicant to be of possible relevance to the present disclosure. No admission is necessarily intended, nor should be construed, that any of the preceding information constitutes prior art against the present disclosure.
[0007] In the following specific example embodiments of this disclosure will now be explained.SUMMARY
[0008] One or more implementations of the present application provide communication methods and communication apparatuses. The techniques described in the application can improve scheduling flexibility.
[0009] According to a first aspect, a method is provided. The method may be performed at a user equipment (UE) side. The method includes receiving scheduling granularity information that indicates a number of symbols in at least one scheduling unit (SU) for resource scheduling for communications with a network device, and communicating with the network device based on the at least one SU.
[0010] With reference to the first aspect, in some implementations, the at least one SU comprises a plurality of SUs, and the scheduling granularity information indicates one of the plurality of SUs is a default SU.
[0011] With reference to the first aspect, in some implementations, the at least one SU comprises a plurality of SUs, each SU corresponding to one of a plurality of numerologies.
[0012] With reference to the first aspect, in some implementations, the scheduling granularity information indicates that a number of symbols in a first SU corresponding to a first numerology is the same as a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.
[0013] With reference to the first aspect, in some implementations, the scheduling granularity information indicates a number of symbols in a first SU corresponding to a first numerology is different from a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.
[0014] With reference to the first aspect, in some implementations, the scheduling granularity information is included in one or more of a radio resource control (RRC) message, media access control–control element (MAC-CE) , or downlink control information (DCI) .
[0015] With reference to the first aspect, in some implementations, the number of symbols in the at least one SU is 3, 6, 7, 12, 14, 24, 28, or 48.
[0016] With reference to the first aspect, in some implementations, the method further includes receiving information indicating a location of a physical downlink control channel (PDCCH) based on an alignment point or a subframe in a frame.
[0017] With reference to the first aspect, in some implementations, the alignment point is configured based on one or more of a frame, a subframe, a slot, or a symbol; and a time location of the alignment point is different from a starting time or a boundary of any of the frame, the subframe, or the slot.
[0018] With reference to the first aspect, in some implementations, the method further includes receiving downlink control information (DCI) in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the alignment point.
[0019] With reference to the first aspect, in some implementations, the method further includes receiving downlink control information (DCI) in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the location of the PDCCH.
[0020] With reference to the first aspect, in some implementations, the method further includes receiving downlink control information (DCI) , wherein the DCI comprises a start and length indicator value (SLIV) field for determining a location of a scheduled resource, wherein the SLIV field indicates a starting symbol index (S) and a number of consecutive symbols (L) within an SU, wherein the SU is one of the at least one SU.
[0021] With reference to the first aspect, in some implementations, the SLIV field comprises an index indicating one of a total number of (S, L) combinations.
[0022] With reference to the first aspect, in some implementations, the SLIV field comprises an index indicating one of a subset of a total number of (S, L) combinations.
[0023] With reference to the first aspect, in some implementations, the method further includes receiving downlink control information (DCI) , wherein the DCI comprises a time allocation index indicating one of a (k, S, L) combination, wherein k represents a time offset, S represents a starting symbol index, and L represents a number of consecutive symbols of a scheduled resource. Note that the S and L among the (k, S, L) combination refers to time resources with the SU; moreover, the DCI comprises resource scheduling on one or more (separate) time allocations. This note can also be applicable to the following paragraphs for related DCI and scheduling descriptions.
[0024] With reference to the first aspect, in some implementations, the method further includes receiving information that indicates one of the at least one SU for receiving a DCI in a PDCCH.
[0025] According to a second aspect, a method is provided. The method may be performed at a network device. The method includes transmitting scheduling granularity information that indicates a number of symbols in at least one scheduling unit (SU) for resource scheduling for communications with a user equipment (UE) ; and communicating with the UE based on the at least one SU.
[0026] With reference to the second aspect, in some implementations, the at least one SU comprises a plurality of SUs, and the scheduling granularity information indicates one of the plurality of SUs is a default SU.
[0027] With reference to the second aspect, in some implementations, the at least one SU comprises a plurality of Sus, each SU corresponding to one of a plurality of numerologies.
[0028] With reference to the second aspect, in some implementations, the scheduling granularity information indicates that a number of symbols in a first SU corresponding to a first numerology is the same as a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.
[0029] With reference to the second aspect, in some implementations, the scheduling granularity information indicates a number of symbols in a first SU corresponding to a first numerology is different from a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.
[0030] With reference to the second aspect, in some implementations, the scheduling granularity information is included in one or more of a radio resource control (RRC) message, media access control–control element (MAC-CE) , or downlink control information (DCI) .
[0031] With reference to the second aspect, in some implementations, the number of symbols in the at least one SU is 3, 6, 7, 12, 14, 24, 28, or 48.
[0032] With reference to the second aspect, in some implementations, the method further includes transmitting an alignment point information that indicates an alignment point for determining a location of a physical downlink control channel (PDCCH) in a subframe.
[0033] With reference to the second aspect, in some implementations, the alignment point is configured based on one or more of a frame, a subframe, a slot, or a symbol; and a time location of the alignment point is different from a starting time or a boundary of any of the frame, the subframe, or the slot.
[0034] With reference to the second aspect, in some implementations, the method further includes transmitting downlink control information (DCI) in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the alignment point.
[0035] With reference to the second aspect, in some implementations, the method further includes transmitting downlink control information (DCI) in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the location of the PDCCH
[0036] With reference to the second aspect, in some implementations, the method further includes transmitting downlink control information (DCI) , wherein the DCI comprises a start and length indicator value (SLIV) field for determining a location of a scheduled resource, wherein the SLIV field indicates a starting symbol index (S) and a number of consecutive symbols (L) within an SU, wherein the SU is one of the at least one SU.
[0037] With reference to the second aspect, in some implementations, the SLIV field comprises an index indicating one of a total number of (S, L) combinations.
[0038] With reference to the second aspect, in some implementations, the SLIV field comprises an index indicating one of a subset of a total number of (S, L) combinations.
[0039] With reference to the second aspect, in some implementations, the method further includes transmitting downlink control information (DCI) , wherein the DCI comprises a time allocation index indicating one of a (k, S, L) combination, wherein k represents a time offset, S represents a starting symbol index, and L represents a number of consecutive symbols of a scheduled resource.
[0040] With reference to the second aspect, in some implementations, the method further includes transmitting information that indicates one of the at least one SU for transmitting a DCI in a PDCCH.
[0041] According to a third aspect, a communication apparatus is provided. The communication apparatus is configured to perform the method according to the first aspect or one or more implementations of the first aspect, or the second aspect or one or more implementations of the second aspect.
[0042] With reference to the third aspect, in some implementations, the communication apparatus includes a receiving unit configured to receive scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between the communication apparatus and a network device; and a communicating unit configured to communicate with the network device based on the at least one SU.
[0043] With reference to the third aspect, in some implementations, the communication apparatus includes a transmitting unit configured to transmit scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between a user equipment (UE) and the communication apparatus; and a communicating unit configured to communicate with the UE based on the at least one SU.
[0044] With reference to the third aspect, in some implementations, the communication apparatus includes one or more processors; and an interface circuit configured to receive scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between the communication apparatus and a network device; and communicate with the network device based on the at least one SU.
[0045] With reference to the third aspect, in some implementations, the communication apparatus includes one or more processors; and an interface circuit configured to: transmit scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between a user equipment (UE) and the communication apparatus; and communicate with the UE based on the at least one SU.
[0046] With reference to the third aspect, in some implementations, the interface circuit comprises one or more transceivers.
[0047] According to a fourth aspect, an apparatus is provided. The apparatus includes one or more processors and one or more memories. The one or more memories store instructions which, when executed by the one or more processors, cause the apparatus to perform the method according to the first aspect or one or more implementations of the first aspect, or the second aspect or one or more implementations of the second aspect.
[0048] According to a fifth aspect, a communication system is provided. The communication system includes a first communication apparatus configured to perform the method according to the first aspect or one or more implementations of the first aspect. The communication system further includes a second communication apparatus configured to perform the method according to the second aspect or one or more implementations of the second aspect.
[0049] According to a sixth aspect, a non-transitory computer-readable storage medium is provided. The non-transitory computer-readable storage has instructions stored thereon which, when executed by an apparatus, cause the apparatus to perform the method according to the first aspect or one or more implementations of the first aspect, or the second aspect or one or more implementations of the second aspect.BRIEF DESCRIPTION OF THE DRAWINGS
[0050] FIG. 1 illustrates a schematic illustration of an example communication system.
[0051] FIG. 2 illustrates another example communication system.
[0052] FIG. 3 illustrates an example of an apparatus wirelessly communicating with at least one of two apparatuses in a communication system.
[0053] FIG. 4 illustrates an example of units or modules in a device or apparatus.
[0054] FIG. 5 illustrates an example flexible scheduling scheme.
[0055] FIG. 6 illustrates an example flexible scheduling scheme with a time domain resource allocation indication.
[0056] FIG. 7 illustrates an example table of a group of time resource allocation indications for normal cyclic prefix (NCP) .
[0057] FIG. 8 illustrates an example table of a group of time resource allocation indications for extended cyclic prefix (ECP) .
[0058] FIG. 9 illustrates another example flexible scheduling scheme with a time domain resource allocation indication.
[0059] FIG. 10 illustrates an example table of a group of physical downlink shared channel (PDSCH) time resource allocation indications for NCP.
[0060] FIG. 11 illustrates an example table of a group of physical uplink shared channel (PUSCH) time resource allocation indications for NCP.
[0061] FIG. 12 illustrates a flowchart of an example communication method for flexible scheduling.
[0062] FIG. 13 illustrates an example table of scheduling granularity indexes with multiple scheduling units (SUs) corresponding to multiple numerologies.DETAILED DESCRIPTION
[0063] Wireless communications systems such as fourth generation (4G) system (for example, Long-Term Evolution (LTE) system) , fifth generation (5G) system (for example, New Radio (NR) system) , and sixth generation (6G) system can provide various types of applications, such as message, voice, video, and other data, and various service types, use cases, or / and numerology options. Compared to a fixed, slot-based scheduling (wherein a scheduling granularity is a slot that has a fixed number (14) of scheduling symbols) , flexible scheduling schemes are described. The flexible scheduling schemes can facilitate flexible and efficient use of time-frequency resources for wireless communications, for example, by allowing scheduling a resource across the slot boundary.
[0064] In some implementations, the flexible scheduling schemes allow a variable, configurable scheduling granularity, for example, in terms of a scheduling unit (SU) . The SU can be represented or defined by a number of scheduled symbols (e.g., orthogonal frequency-division multiplexing (OFDM) symbols) . In some implementations, the SU can be represented in terms of another parameter or absolute time. In some implementations, rather than a fixed number of 14 symbols, multiple SUs with different numbers of symbols can be configured. In some implementations, one or more SUs can be selected to assign, allocate, or otherwise schedule one or more resources for a particular data transmission. In some implementations, the one or more SUs can be selected, for example, based on an application type, a service type, a use case, or / and a numerology to accommodate the requirement or fit the properties of the particular data transmission. In some implementations, the flexible scheduling schemes can reduce transmission latency and improve system throughput by using the one or more configurable SUs.
[0065] In some implementations, scheduling information or signaling (e.g., information that indicates a location of a scheduled resource) can be configured based on the configurable scheduling granularity. For example, the scheduling information can include a reference point (also referred to as an alignment point) and / or time-domain allocation of the scheduled resources. In some implementations, a format and size of the scheduling signaling can be designed, for example, based on the configurable scheduling granularity. In some implementations, techniques for reducing the number of bits required for the scheduling signaling are described, which can reduce signal overhead and improve communication efficiency.
[0066] Referring to FIG. 1, as an illustrative example without limitation, a simplified schematic illustration of a communication system is provided. The communication system 100 (which may be a wireless system) comprises a radio access network 120. The radio access network (RAN) 120 may be a next generation (e.g. sixth generation (6G) or later) radio access network, or a legacy (e.g. 5G, 4G, 3G or 2nd generation (2G) ) radio access network. One or more communication electronic device (ED) 110a, 110b, 110c, 110d, 110e, 110f, 110g, 110h, 110i, 110j (generically referred to as 110) may be interconnected to one another or connected to one or more network nodes (170a, 170b, generically referred to as 170) in the radio access network 120. A core network 130 may be a part of the communication system and may be dependent or independent of the radio access technology used in the communication system 100. The communication system 100 may also comprise a public switched telephone network (PSTN) 140, the internet 150, and other networks 160.
[0067] In general, the communication system 100 enables multiple wireless or wired elements to communicate data and other content. The communication system 100 may provide content, such as voice, data, video, and / or text, via broadcast, multicast, groupcast, unicast, etc. And the communication system 100 may provide a wide range of communication services and applications (such as earth monitoring, remote sensing, passive sensing and positioning, navigation and tracking, autonomous delivery and mobility, etc. ) The services and / or applications may be mobile broadband (MBB) services, ultra-reliable low-latency communication (URLLC) services, or machine type communication (MTC) services.
[0068] The communication system 100 may operate by sharing resources, such as carrier spectrum bandwidth, between its constituent elements.
[0069] FIG. 2 illustrates more detailed example for communication system 100. The communication system 100 may include a terrestrial communication system and / or a non-terrestrial communication system. The communication system 100 may provide a high degree of availability and robustness through a joint operation of a terrestrial communication system and a non-terrestrial communication system. For example, integrating a non-terrestrial communication system (or components thereof) into a terrestrial communication system can result in what may be considered a heterogeneous network comprising multiple layers. The heterogeneous network may achieve better overall performance through efficient multi-link joint operation, more flexible functionality sharing, and faster physical layer link switching between terrestrial networks and non-terrestrial networks.
[0070] The terrestrial communication system and the non-terrestrial communication system could be considered sub-systems of the communication system.
[0071] Same as in the example shown in FIG. 1, in the example shown in FIG. 2, the communication system 100 may include ED 110a, 110b, 110c, 110d (generically referred to as ED 110) , and RAN 120a, 120b. In addition, the communication system 100 may also include a non-terrestrial communication network 120c. The communication system 100 may also include one or more of a core network 130, a public switched telephone network (PSTN) 140, the Internet 150, and other networks 160. The RANs 120a, 120b include respective RAN nodes such as base stations (BSs) 170a, 170b, which may be generically referred to as terrestrial transmit and receive points (T-TRPs) 170a, 170b. In one implementation, the non-terrestrial communication network 120c includes a RAN node such as an access node (or base station) 172, which may be generically referred to as a non-terrestrial transmit and receive point (NT-TRP) 172. As may be surmised on the basis of similarity in reference numerals, the non-terrestrial communication network 120c may be considered to be a radio access network, with operational aspects in common with the RANs 120a, 120b. In another implementations, the non-terrestrial communication network 120c may include at least one non-terrestrial network (NTN) device and at least one corresponding terrestrial network device, wherein the at least one non-terrestrial network device works as a transport layer device and the at least one corresponding terrestrial network device works as a RAN node, which communicates with the ED via the non-terrestrial network device. In addition, there may be a NTN gateway in the ground (i.e., referred as a terrestrial network device) also as a transport layer device to communication with both the NTN device, and the RAN node communicates with the ED via the NTN device and the NTN gateway. In some implementations, the NTN gateway and the RAN node may be located in the same device.
[0072] Any ED 110 may be alternatively or additionally configured to interface, access, or communicate with any T-TRP 170a, 170b and NT-TRP 172, the Internet 150, the core network 130, the PSTN 140, the other networks 160, or any combination of the preceding. In some examples, ED 110a may communicate an uplink (UL) and / or downlink (DL) transmission over a terrestrial air interface 190a with T-TRP 170a. In some examples, the EDs 110a, 110b, 110c, and 110d may also communicate directly with one another via one or more sidelink (SL) air interfaces 190b. In some examples, ED 110d may communicate an uplink and / or downlink transmission over a non-terrestrial air interface 190c with NT-TRP 172.
[0073] The air interfaces 190a and 190b may use similar communication technology, such as any suitable radio access technology. For example, the communication system 100 may implement one or more channel access methods, such as code division multiple access (CDMA) , space division multiple access (SDMA) , time division multiple access (TDMA) , frequency division multiple access (FDMA) , orthogonal FDMA (OFDMA) , or single-carrier FDMA (SC-FDMA, also known as discrete Fourier transform spread OFDMA, DFT-s-OFDMA) in the air interfaces 190a and 190b. The air interfaces 190a and 190b may utilize other higher dimension signal spaces, which may involve a combination of orthogonal and / or non-orthogonal dimensions.
[0074] The non-terrestrial air interface 190c can enable communication between the ED 110d and one or multiple NT-TRPs 172 via a wireless link or simply a link. For some examples, the link is a dedicated connection for unicast transmission, a connection for broadcast transmission, or a connection between a group of EDs 110 and one or multiple NT-TRPs 172 for multicast transmission.
[0075] The RANs 120a and 120b are in communication with the core network 130 to provide the EDs 110a 110b, and 110c with various services such as voice, data, and other services. The RANs 120a and 120b and / or the core network 130 may be in direct or indirect communication 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 employ the same radio access technology as RAN 120a, RAN 120b or both. The core network 130 may also serve as a gateway access between (i) the RANs 120a and 120b or EDs 110a 110b, and 110c or both, and (ii) other networks (such as the PSTN 140, the Internet 150, and the other networks 160) . In addition, some or all of the EDs 110a 110b, and 110c may include functionality for communicating with different wireless networks over different wireless links using different wireless technologies and / or protocols. Instead of wireless communication (or in addition thereto) , the EDs 110a 110b, and 110c may communicate via wired communication channels to a service provider or switch (not shown) , and to the Internet 150. PSTN 140 may include circuit switched telephone networks for providing plain old telephone service (POTS) . Internet 150 may include a network of computers and subnets (intranets) or both, and incorporate protocols, such as Internet Protocol (IP) , Transmission Control Protocol (TCP) , User Datagram Protocol (UDP) . EDs 110a 110b, and 110c may be multimode devices capable of operation according to multiple radio access technologies, and incorporate multiple transceivers necessary to support such.
[0076] In addition, the communication system 100 may comprising a sensing agent (not shown in the figure) to manage the sensed data from ED110 and or the T-TRP 170 and / or NT-TRP 172. In one implementation, the sensing agent is located in the T-TRP 170 and / or NT-TRP 172. In another implementation, the sensing agent is a separate node which has interface to communicate with the core network 130 and / or the RAN 120 (e.g., the T-TRP 170 and / or NT-TRP 172) .
[0077] FIG. 3 illustrates example of an Apparatus 310 wirelessly communicating with at least one of two apparatuses (e.g., Apparatus 320a and Apparatus 320b, referred as Apparatus 320) in a communication system, e.g., the communication system 100, according to one embodiment. The Apparatus 310 may be a UE (e.g., ED 110 in FIG. 3) . The Apparatus 320a may be a terrestrial network device (e.g., T-TRP 170 as shown in FIG. 3) , and Apparatus 320b may be a non-terrestrial network device (e.g., NT-TRP 172 as shown in FIG. 3) . However, this is not necessary. For example, Apparatus 320a may be a NT-TRP, and 320b may be a T-TRP, both Apparatus 320a and 320b may be T-TRPs or NT-TRPs, according to present disclosure. In the following, the ED 110 as an example of the Apparatus 310 is described, and T-TRP 170 as an example of Apparatus 320a is described, and NT-TRP 172 as an example of Apparatus 320a is described. Although only one Apparatus 310, one Apparatus 320a and one Apparatus 320b Please note that the number of Apparatus 310 (e.g. ED 110) could be one or more, and the number of Apparatus 320a and / or 320b could be one or more. For example, one ED110 may be served by only one T-TRP 170 (or one NT-TRP172) , by more than one T-TRP 170, by more than one NT-TRP 172, or by one or more T-TRP 170 and one or more NT-TRP172.
[0078] The ED 110 is used to connect persons, objects, machines, etc. The ED 110 may be widely used in various scenarios including, for example, cellular communications, device-to-device (D2D) , vehicle to everything (V2X) , peer-to-peer (P2P) , machine-to-machine (M2M) , MTC, internet of things (IoT) , virtual reality (VR) , augmented reality (AR) , mixed reality (MR) , metaverse, digital twin, industrial control, self-driving, remote medical, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery and mobility, etc.
[0079] Each ED 110 represents any suitable end user device for wireless operation and may include such devices (or may be referred to but not limited to) as a user equipment / terminal device (UE) , a wireless transmit / receive unit (WTRU) , a mobile station, a fixed or mobile subscriber unit, a cellular telephone, a station (STA) , a MTC device, a personal digital assistant (PDA) , a smartphone, a laptop, a computer, a tablet, a wireless sensor, a consumer electronics device, a smart book, a vehicle, a car, a truck, a bus, a train, or an IoT device, wearable devices (such as a watch, a pair of glasses, head mounted equipment, etc. ) , an industrial device, or an apparatus in (e.g. communication module, modem, or chip) or comprising the forgoing devices, among other possibilities. Future generation EDs 110 may be referred to using other terms. The base station 170a and 170b is a T-TRP and will hereafter be referred to as T-TRP 170. Also shown in FIG. 3, a non-terrestrial (NT) device will hereafter be referred to as NT-TRP 172. 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 of more of: connection availability and connection necessity.
[0080] As shown in FIG. 3, the ED 110 include at least one processor 210. Only one processor 210 is illustrated to avoid congestion in the drawing. The ED 110 may further include a transmitter 201 and a receiver 203 coupled to one or more antennas 204. Only one antenna 204 is illustrated to avoid congestion in the drawing. One, some, or all of the antennas 204 may alternatively be panels. The transmitter 201 and the receiver 203 may be integrated, e.g. as a transceiver. The transceiver is configured to modulate data or other content for transmission by at least one antenna 204 or network interface controller (NIC) . The transceiver is also configured to demodulate data or other content received by the at least one antenna 204. Each transceiver includes any suitable structure for generating signals for wireless or wired transmission and / or processing signals received wirelessly or by wire. Each antenna 204 includes any suitable structure for transmitting and / or receiving wireless or wired signals. The ED 110 may include at least one memory 208. Only the transmitter 201, receiver 203, processor 210, memory 208, and antenna 204 is illustrated for simplicity, but the ED 110 may include one or more other components.
[0081] The memory 208 stores instructions. The memory 208 may also stores data used, generated, or collected by the ED 110. For example, the memory 208 could store software instructions or modules configured to implement some or all of the functionality and / or embodiments described herein and that are executed by one or more processing unit (s) (e.g., a processor 210) . Each memory 208 includes any suitable volatile and / or non-volatile storage and retrieval device (s) . Any suitable type of memory may be used, such as random access memory (RAM) , read only memory (ROM) , hard disk, optical disc, subscriber identity module (SIM) card, memory stick, secure digital (SD) memory card, on-processor cache, and the like.
[0082] The ED 110 may further include one or more input / output devices (not shown) or interfaces (such as a wired interface to the Internet 150 in FIG. 1) . The input / output devices or interfaces permit interaction with a user or other devices in the network. Each input / output device or interface includes any suitable structure for providing information to or receiving information from a user, and / or for network interface communications. Suitable structures include, for example, a speaker, microphone, keypad, keyboard, display, touch screen, etc.
[0083] The processor 210 performs (or controlling the ED110 to perform) operations described herein as being performed by the ED110. As illustrated below and elsewhere in the present disclosure. For example, the processor 210 performs or controls the ED110 to perform receiving transport blocks (TBs) , using a resource for decoding of one of the received TBs, releasing the resource for decoding of another of the received TBs, and / or receiving configuration information configuring a resource. In details, the operation may include those operations related to preparing a transmission for uplink transmission to the NT-TRP 172 and / or the T-TRP 170; those operations related to processing downlink transmissions received from the NT-TRP 172 and / or the T-TRP 170; and those operations related to processing sidelink transmission to and from another ED 110. Processing operations related to preparing a transmission for uplink transmission may include operations such as encoding, modulating, transmit beamforming, and generating symbols for transmission. Processing operations related to processing downlink transmissions may include operations such as receive beamforming, demodulating and decoding received symbols. Processing operations related to processing sidelink transmissions may include operations such as transmit / receive beamforming, modulating / demodulating and encoding / decoding symbols. Depending upon the embodiment, a downlink transmission may be received by the receiver 203, possibly using receive beamforming, and the processor 210 may extract signaling from the downlink transmission (e.g. by detecting and / or decoding the signaling) . An example of signaling may be a reference signal transmitted by the NT-TRP 172 and / or by the T-TRP 170. In some embodiments, the processor 210 implements the transmit beamforming and / or the receive beamforming based on the indication of beam direction, e.g. beam angle information (BAI) , received from the T-TRP 170. In some embodiments, the processor 210 may perform operations relating to network access (e.g. initial access) and / or downlink synchronization, such as operations relating to detecting a synchronization sequence, decoding and obtaining the system information, etc. In some embodiments, the processor 210 may perform channel estimation, e.g. using a reference signal received from the NT-TRP 172 and / or from the T-TRP 170.
[0084] Although not illustrated, the processor 210 may form part of the transmitter 201 and / or part of the receiver 203. Although not illustrated, the memory 208 may form part of the processor 210.
[0085] The processor 210, the processing components of the transmitter 201, and the processing components of the receiver 203 may each be implemented by the same or different one or more processors that are configured to execute instructions stored in a memory (e.g. in the memory 208) . Alternatively, some or all of the processor 210, the processing components of the transmitter 201, and the processing components of the receiver 203 may each be implemented using dedicated circuitry, such as a programmed field-programmable gate array (FPGA) , an application-specific integrated circuit (ASIC) , or a hardware accelerator such as a graphics processing unit (GPU) or an artificial intelligence (AI) accelerator.
[0086] In some implementations, the ED 110 may an apparatus (also called component) for example, communication module, modem, chip, or chipset, it includes at least one processor 210, and an interface or at least one pin. In this scenario, the transmitter 201 and receiver 203 may be replaced by the interface or at least one pin, wherein the interface or at least one pin is to connect the apparatus (e.g., chip) and other apparatus (e.g., chip, memory, or bus) . Accordingly, the transmitting information to the NT-TRP 172 and / or the T-TRP 170 and / or another ED 110 may be referred as transmitting information to the interface or at least one pin, or as transmitting information to the NT-TRP 172 and / or the T-TRP 170 and / or another ED 110 via the interface or at least one pin, and receiving information from the NT-TRP 172 and / or the T-TRP 170 and / or another ED 110 may be referred as receiving information from the interface or at least one pin, or as receiving information from the NT-TRP 172 and / or the T-TRP 170 and / or another ED 110 via the interface or at least one pin. The information may include control signaling and / or data.
[0087] As shown in FIG. 3, the T-TRP 170 include at least one processor 260. Only one processor 260 is illustrated to avoid congestion in the drawing. The T-TRP 170 may further include at least one transmitter 252 and at least one receiver 254 coupled to one or more antennas 256. Only one antenna 256 is illustrated to avoid congestion in the drawing. One, some, or all of the antennas 256 may alternatively be panels. The transmitter 252 and the receiver 254 may be integrated as a transceiver. The T-TRP 170 may further include at least one memory 258. The T-TRP 170 may further include scheduler 253. Only the transmitter 252, receiver 254, processor 260, memory 258, antenna 256 and scheduler 253 are illustrated for simplicity, but the T-TRP may include one or more other components.
[0088] The T-TRP 170 may be known by other names in some implementations, such as a base station, a base transceiver station (BTS) , a radio base station, a network node, a network device, a device on the network side, a transmit / receive node, a Node B, an evolved NodeB (eNodeB or eNB) , a Home eNodeB, a next Generation NodeB (gNB) , a transmission point (TP) , a site controller, an access point (AP) , a wireless router, a relay station, a terrestrial node, a terrestrial network device, a terrestrial base station, a base band unit (BBU) , a remote radio unit (RRU) , an active antenna unit (AAU) , a remote radio head (RRH) , a central unit (CU) , a distributed unit (DU) , a positioning node, among other possibilities. The T-TRP 170 may be a macro base station (BS) , a pico BS, a relay node, a donor node, or the like, or combinations thereof. The T-TRP 170 may refer to the forgoing devices or refer to apparatus (e.g. a communication module, a modem, or a chip) in the forgoing devices.
[0089] In some embodiments, the parts of the T-TRP 170 may be distributed. For example, some of the modules of the T-TRP 170 may be located remote from the equipment that houses the antennas 256 for the T-TRP 170, and may be coupled to the equipment that houses the antennas 256 over a communication link (not shown) sometimes known as front haul, such as 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 determining the location of the ED 110, resource allocation (scheduling) , message generation, and encoding / decoding, and that are not necessarily part of the equipment that houses the antennas 256 of the T-TRP 170. The modules may also be coupled to other T-TRPs. In some embodiments, the T-TRP 170 may actually be a plurality of T-TRPs that are operating together to serve the ED 110, e.g. through the use of coordinated multipoint transmissions.
[0090] The processor 260 performs operations including those related to: preparing a transmission for downlink transmission to the ED 110, processing an uplink transmission received from the ED 110, preparing a transmission for backhaul transmission to the T-TRP 170 and / or NT-TRP 172, and processing a transmission received over backhaul from the T-TRP 170 and / or NT-TRP 172. Processing operations related to preparing a transmission for downlink or backhaul transmission may include operations such as encoding, modulating, 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 over backhaul may include operations such as receive beamforming, demodulating received symbols, and decoding received symbols. The processor 260 may also perform operations relating to network access (e.g. initial access) and / or downlink synchronization, such as generating the content of synchronization signal blocks (SSBs) , generating the system information, etc. In some embodiments, the processor 260 also generates an indication of beam direction, e.g. BAI, which may be scheduled for transmission by a scheduler 253. The processor 260 performs other network-side processing operations described herein, such as determining the location of the ED 110, determining where to deploy the NT-TRP 172, etc. In some embodiments, the processor 260 may generate signaling, e.g. to configure one or more parameters of the ED 110 and / or one or more parameters of the NT-TRP 172. Any signaling generated by the processor 260 is sent by the transmitter 252.
[0091] The scheduler 253 may be coupled to the processor 260 or integrated in the processor 260. The scheduler 253 may be included within or operated separately from the T-TRP 170. The scheduler 253 may schedule uplink, downlink, sidelink, and / or backhaul transmissions, including issuing scheduling grants and / or configuring scheduling-free (e.g., “configured grant” ) resources.
[0092] The memory 258 is configured to store information, and optionally data. The memory 258 stores instructions and data used, generated, or collected by the T-TRP 170. For example, the memory 258 could store software instructions or modules configured to implement some or all of the functionality and / or embodiments described herein and that are executed by the processor 260.
[0093] Although not illustrated, the processor 260 may form part of the transmitter 252 and / or part of the receiver 254. Also, although not illustrated, the processor 260 may implement the scheduler 253. Although not illustrated, the memory 258 may form part of the processor 260.
[0094] The processor 260, the scheduler 253, the processing components of the transmitter 252, and the processing components of the receiver 254 may each be implemented by the same or different one or more processors that are configured to execute instructions stored in a memory, e.g. in the memory 258. Alternatively, some or all of the processor 260, the scheduler 253, the processing components of the transmitter 252, and the processing components of the receiver 254 may be implemented using dedicated circuitry, such as a programmed FPGA, a hardware accelerator (e.g., a GPU or AI accelerator) , or an ASIC.
[0095] When the T-TRP 170 is an apparatus (also called as component, for example, communication module, modem, chip, or chipset in a device, it includes at least one processor, and an interface or at least one pin. In this scenario, the transmitter 252 and receiver 254 may be replaced by the interface or at least one pin, wherein the interface or at least one pin is to connect the apparatus (e.g., chip) and other apparatus (e.g., chip, memory, or bus) . Accordingly, the transmitting information to the NT-TRP 172 and / or the T-TRP 170 and / or ED 110 may be referred as transmitting information to the interface or at least one pin, and receiving information from the NT-TRP 172 and / or the T-TRP 170 and / or ED 110 may be referred as receiving information from the interface or at least one pin. The information may include control signaling and / or data.
[0096] Although the NT-TRP 172 is illustrated as a drone only as an example, the NT-TRP 172 may be implemented in any suitable non-terrestrial form, such as satellites and high altitude platforms, including international mobile telecommunication base stations and unmanned aerial vehicles, for example. Also, the NT-TRP 172 may be known by other names in some implementations, such as a non-terrestrial node, a non-terrestrial network device, or a non-terrestrial base station.
[0097] As shown in FIG. 3, The T-TRP 170 may further include at least one transmitter 252 and at least one receiver 254 coupled to one or more antennas 256. Only one antenna 256 is illustrated to avoid congestion in the drawing. One, some, or all of the antennas 256 may alternatively be panels. The transmitter 252 and the receiver 254 may be integrated as a transceiver. The T-TRP 170 may further include at least one memory 258. The T-TRP 170 may further include scheduler 253. Only the transmitter 252, receiver 254, processor 260, memory 258, antenna 256 and scheduler 253 are illustrated for simplicity, but the T-TRP may include one or more other components.
[0098] As shown in FIG. 3, the NT-TRP 172 include at least one processor 276. Only one processor 276 is illustrated to avoid congestion in the drawing. The NT-TRP 172 may include a transmitter 272 and a receiver 274 coupled to one or more antennas 280. Only one antenna 280 is illustrated to avoid congestion in the drawing. One, some, or all of the antennas may alternatively be panels. The transmitter 272 and the receiver 274 may be integrated as a transceiver. The NT-TRP 172 may further include at least one memory 278. The NT-TRP 172 may further include scheduler. Only the transmitter 272, receiver 274, processor 276, memory 278, antenna 280 are illustrated for simplicity, but the NT-TRP may include one or more other components.
[0099] The NT-TRP 172 include a processor 276 for performing operations including those related to: preparing a transmission for downlink transmission to the ED 110, processing an uplink transmission received from the ED 110, preparing a transmission for backhaul transmission to T-TRP 170 and / or another NT-TRP 172, and processing a transmission received over backhaul from the T-TRP 170 and / or another NT-TRP 172. Processing operations related to preparing a transmission for downlink or backhaul transmission may include operations such as encoding, modulating, precoding (e.g. MIMO precoding) , transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or over backhaul may include operations such as receive beamforming, demodulating received symbols, and decoding received symbols. In some embodiments, the processor 276 implements the transmit beamforming and / or receive beamforming based on beam direction information (e.g. BAI) received from the T-TRP 170. In some embodiments, the processor 276 may generate signaling, e.g. to configure one or more parameters of the ED 110. In some embodiments, the NT-TRP 172 implements physical layer processing, but does not implement higher layer functions such as functions at the medium access control (MAC) or radio link control (RLC) layer. As this is only an example, more generally, the NT-TRP 172 may implement higher layer functions in addition to physical layer processing.
[0100] The memory 278 is configured to store information and optionally data. The memory 258 stores instructions and data used, generated, or collected by the NT-TRP 172. For example, the memory 278 could store software instructions or modules configured to implement some or all of the functionality and / or embodiments described herein and that are executed by the processor 276.
[0101] Although not illustrated, the processor 276 may form part of the transmitter 272 and / or part of the receiver 274. Although not illustrated, the memory 278 may form part of the processor 276.
[0102] The processor 276, the processing components of the transmitter 272, and the processing components of the receiver 274 may each be implemented by the same or different one or more processors that are configured to execute instructions stored in a memory, e.g. in the memory 278. Alternatively, some or all of the processor 276, the processing components of the transmitter 272, and the processing components of the receiver 274 may be implemented using dedicated circuitry, such as a programmed FPGA, a hardware accelerator (e.g., a GPU or AI accelerator) , or an ASIC. In some embodiments, the NT-TRP 172 may actually be a plurality of NT-TRPs that are operating together to serve the ED 110, e.g. through coordinated multipoint transmissions.
[0103] When the NT-TRP 172 is an apparatus (e.g. communication module, modem, chip, or chipset) in a device, it includes at least one processor, and an interface or at least one pin. In this scenario, the transmitter 272 and receiver 257 may be replaced by the interface or at least one pin, wherein the interface or at least one pin is to connect the apparatus (e.g., chip) and other apparatus (e.g., chip, memory, or bus) . Accordingly, the transmitting information to the T-TRP 170 and / or another NT-TRP 172 and / or ED 110 may be referred as transmitting information to the interface or at least one pin, and receiving information from the T-TRP 170 and / or another NT-TRP 172 and / or ED 110 may be referred as receiving information from the interface or at least one pin. The information may include control signaling and / or data.
[0104] Note that “transmit / receive point (TRP) ” , as used herein, may refer to a T-TRP or a NT-TRP. A T-TRP may alternatively be called a terrestrial network TRP ( “TN TRP” ) and a NT-TRP may alternatively be called a non-terrestrial network TRP ( “NTN TRP” ) . The T-TRP 170, the NT-TRP 172, and / or the ED 110 may include other components, but these have been omitted for the sake of clarity.
[0105] Note that “signaling” , as used herein, may alternatively be called control signaling, control message, control information, or message for simplicity. Signaling between a BS (e.g., the network node 170) and a terminal or sensing device (e.g., ED 110) , or signaling between different terminal or sensing device (e.g., between ED 110i and ED110j) may be carried in physical layer signaling (also called as dynamic signaling) , which is transmitted in a physical layer control channel. For downlink the physical layer signaling may be known as downlink control information (DCI) which is transmitted in a physical downlink control channel (PDCCH) . For uplink, the physical layer signaling may be known as uplink control information (UCI) which is transmitted in a physical uplink control channel (PUCCH) . For sidelink, signaling between different terminal or sensing device (e.g., between ED 110i and ED110j) may be known as sidelink control information (SCI) which is transmitted in a physical sidelink control channel (PSCCH) . Signaling may be carried in a higher-layer (e.g., higher than physical layer) signaling, which is transmitted in a physical layer data channel, e.g. in a physical downlink shared channel (PDSCH) for downlink signaling, in a physical uplink shared channel (PUSCH) for uplink signaling, and in a physical sidelink shared channel (PSSCH) for sidelink signaling. Higher-layer signaling may also called static signaling, or semi-static signaling. Higher-layer signaling may be radio resource control (RRC) protocol signaling or media access control –control element (MAC-CE) signaling. Signaling may be included in a combination of physical layer signaling and higher layer signaling.
[0106] It should be noted that in present disclosure, “information” , when different from “message” , may be carried in one single message, or be carried in more than one separate message.
[0107] One or more steps of the methods provided in this disclosure herein may be performed by corresponding units or modules, according to FIG. 4. FIG. 4 illustrates units or modules in a device or apparatus, such as in the ED 110, in the T-TRP 170, or in the NT-TRP 172. For example, a signal may be transmitted by a transmitting unit or by a transmitting module. A signal may be received by a receiving unit or by a receiving module. A signal may be processed by a processing unit or a processing module. Other steps may be performed by an artificial intelligence (AI) or machine learning (ML) module. The respective units or modules may be implemented using hardware, one or more components or devices that execute software, or a combination thereof. For instance, one or more of the units or modules may be a circuit such as an integrated circuit. Examples of an integrated circuit includes a programmed FPGA, a GPU, or an ASIC. For instance, one or more of the units or modules may be logical such as a logical function performed by a circuit, by a portion of an integrated circuit, or by software instructions executed by a processor. It will be appreciated that where the modules are implemented using software for execution by a processor for example, the modules may be retrieved by a processor, in whole or part as needed, individually or together for processing, in single or multiple instances, and that the modules themselves may include instructions for further deployment and instantiation.
[0108] Additional details regarding the EDs 110, the T-TRP 170, and the NT-TRP 172 are known to those of skill in the art. As such, these details are omitted here.
[0109] The present disclosure is aimed at devices such as UEs, IoT devices, cars, etc. The type of network scenarios envisioned may include terrestrial TRPs such as base-stations and / or non-terrestrial TRPs such as drones, balloons, high-altitude platform stations (HAPS) , satellites, and any such devices that support radio access technologies such as 5G NR, future 6G or other technologies.
[0110] For illustrative purposes, specific example embodiments will now be explained in greater detail in conjunction with the figures and above mentioned system, ED and TRP.
[0111] The embodiments set forth herein represent information sufficient to practice the claimed subject matter and illustrate ways of practicing such subject matter. Upon reading the following description in light of the accompanying figures, those of skill in the art will understand the concepts of the claimed subject matter and will recognize applications of these concepts not particularly addressed herein. It should be understood that these concepts and applications fall within the scope of the disclosure and the accompanying claims.
[0112] In 5G network, scheduling granularity is slot based, which has a fixed (14) number of scheduling symbols all the time for normal cyclic prefix (CP) , regardless of user service types, application scenarios, or frame structures with one or more numerologies. That is, the slot-based scheduling has a scheduling granularity of 14 symbols, which has a fixed scheduling number of symbols for any numerologies while the slot duration varies over different numerologies. The slot-based scheduling can schedule a mini-slot resource, i.e., a subset of 14 symbols in a slot as time domain resource, but it is not allowed to schedule a resource across the slot boundary. In addition, no matter the slot-based scheduling schedules all-slot symbols or schedules a mini-slot (a few symbols) , the scheduling granularity is a slot, the scheduling starts from a slot, i.e., the boundary of a slot, and no cross-slot boundary scheduling is allowed.
[0113] The above mentioned scheme is not flexible in the sense of on demand (e.g., latency) scheduling symbols. For example, in future wireless network such as 6G, a wider carrier bandwidth is expected, and thus the number of symbols required to carry traffic can be reduced (from 14 symbols) . On the other hand, some of the application or service types such as video services may have a big chunk of traffic to be transmitted such that the number of symbols to carry the traffic can be more than 14 symbols. As a result, scheduling granularity can be varying based on, e.g., application type, service type, use case, or / and numerology option.
[0114] Accordingly, a method is provided in the disclosure. In the method, flexible scheduling schemes by varying scheduling unit in terms of the number of scheduled symbols to accommodate the different application types, service types, use cases, or / and numerology options, are provided.
[0115] For example, flexible scheduling schemes are implemented by varying scheduling units in terms of the number of scheduled symbols for each scheduling on transmission or employing different scheduling granularities. The flexible scheduling schemes may not limit to the slot-based scheduling granularity (e.g., of 14 symbols) in order to accommodate different application types, service types, use cases, mobilities, or / and numerology options.
[0116] A reference point of the scheduling can be or based on any of a frame, a subframe, a slot, a pre-defined time reference point or / and a preconfigured time reference point (e.g., absolute time reference point, relative time reference point, etc. ) . The reference point may be configured via higher layer signalling such as RRC signaling, or via dynamic signaling. Based on a reference point, a scheduling on time-frequency resource (s) can be made, where the scheduling may allocate time (or / and frequency) resource (s) based on a scheduling granularity, for example, in a unit of a number of symbols; the scheduling granularity may be configurable in any of semi-static signaling or dynamic signaling. For multiple numerology options, a scheduling granularity or the unit for scheduling the number of symbols may be based on a base or reference numerology such as 15, 30, 60, 120, 240, 480 kHz subcarrier spacing (SCS) with either normal CP (NCP) or extended CP (ECP) . For example, the unit may be 7 symbols of 15kHz SCS with NCP, and 12 symbols of 60kHz with ECP.
[0117] Moreover, based on the reference point, control resource set (CORESET) allocations or PDCCH monitor occasions can be configured, wherein the CORESET allocations or PDCCH monitor occasions can be any of cell-common, group common or UE specific configuration. A configuration of the CORESET allocations or PDCCH monitor occasions can be decoupled from or independent of a configuration of any scheduling granularity.
[0118] In general, a scheduling granularity (e.g., 7, 14 or 28 symbols based on a reference numerology option) configuration may be applicable to any of application or service type, mobility type, or SCS usage in traffic transmission, etc. In some implementations, a scheduling granularity (e.g., 7, 14 or 28 symbols based on a reference numerology option) configuration may be based on, e.g., application or service type, mobility type, or SCS usage in traffic transmission, etc. Different scheduling granularities allow flexible scheduling units or scheduling time lengths, for example, to satisfy different requirements or demands from the application or service types, mobility types, or SCS options used in the traffic transmission. For example, an enhanced ultra-reliable low-latency communication (URLLC) service may need a quicker turn-around traffic to achieve low-latency and high reliability transmission, thus a shorter (than 14 symbols) scheduling granularity such as scheduling unit of 7 or 6 symbols can (optionally) be used to accommodate this latency requirement. On the other hand, for transmissions of high traffic loading or with high data rate such as enhanced mobile broadband (eMBB) service, a larger scheduling granularity such as scheduling unit of 28 or 56 symbols can be (optionally) used to accommodate this data rate requirement.
[0119] Furthermore or alternatively, a scheduling granularity based on a reference numerology may be associated with an actual scheduling granularity when applied to a specific numerology used in traffic transmission. For example, a scheduling granularity of 7 symbols based on a reference numerology of 15kHz SCS may be explicitly configured for a transmission of signal with numerology of 30kHz, or the scheduling granularity of 7 symbols based on a reference numerology of 15kHz SCS may implicitly indicate that an actual scheduling granularity of 14 symbols may be used for a transmission of signal with numerology of 30kHz, an actual scheduling granularity of 28 symbols may be used for a transmission of signal with numerology of 60kHz, and so forth.
[0120] For a (e.g., RRC configured) scheduling granularity, time domain resource allocation (s) can be indicated within the scheduling granularity by a scheduling signaling, e.g., dynamic signaling such as DCI, semi-static signaling (e.g., higher-layer signaling such as radio resource control (RRC) , medium access control-control element (MAC-CE) , etc. A time domain resource allocation may comprise (within the scheduling granularity) start-symbol (S) and how many consecutive symbols (L) , which can be denoted by a start and length indicator value (SLIV) value. Furthermore or alternatively, a time domain resource allocation may comprise an indication of time allocation resource index that is predefined or tabulated for a group of time domain resource allocations, each (row) comprising start-symbol and how many consecutive symbols in the table. Furthermore or alternatively, a scheduling signaling may also comprise a reference point (or a reference point index) based on which a time domain resource allocation is scheduled. The reference point can be indicated by a number of frames, subframes, slots, scheduling units, pre-defined time period or preconfigured time period.
[0121] In one possible implementation, for a scheduling granularity of unit in terms of Lz symbols (i.e., a scheduling unit with a granularity of Lz symbols) based on a base or reference numerology, a time domain resource allocation with S and L can be represented by a SLIV that is determined based on the following procedure.
[0122] if (L-1) <= Lz / 2 then
[0123] SLIV = Lz x (L-1) + S
[0124] else
[0125] SLIV = Lz x (Lz-L+1) + (Lz-1-S)
[0126] , where 0 < L <= Lz -S
[0127] S = Start Symbol Index (within Lz symbols)
[0128] L = Number of Consecutive Symbols
[0129] In some implementations, a UE may receive a signaling for scheduling granularity to configure or indicate a scheduling granularity, wherein the scheduling granularity is in unit of a number of symbols based on a reference numerology. The UE may also receive a scheduling signaling that comprises at least one time and frequency domain resource allocation for a downlink (DL) or uplink (UL) transmission; and a time domain resource allocation in the at least one time and frequency domain resource allocation is indicated by a SLIV or time resource allocation index from a predefined or pre-configured time resource table. Optionally, the scheduling signaling may also comprise a reference time based on which the time domain resource allocation is scheduled, wherein the reference time can be a reference point or a PDCCH monitoring occasion (described above) . The UE may transmit or receive the traffic based on the scheduling signaling; and the signaling for the scheduling granularity is a semi-static / higher-layer signaling such as RRC and the scheduling signaling is dynamic signaling such as DCI.
[0130] With the method of present disclosure, more flexiblity of data tranmission is achieved and accordingly, the transmission performance will be improved.
[0131] In the following, several possible implementations of solutions, which are described briefly above will be described with details. In one possible implementation, a flexible scheduling with alignment points scheme is described with details.
[0132] In this sheme, flexible scheduling schemes are proposed by employing different scheduling granularities, where a scheduling granularity means a basic scheduling unit in terms of a number of symbols based on a reference numerology. A scheduling signaling may comprise one or more time domain resource allocations (for example, each with a combination of start symbol and a number of consecutive symbols) within the scheduling granularity for DL or / and UL transmission (s) .
[0133] In this application, a scheduling unit may not limit to the slot-based scheduling granularity of 14 symbols. Instead, multiple scheduling granularities are proposed in order to accommodate different application types, service types, mobility types, use cases, or / and numerology options.
[0134] A scheduling signaling or message such as DCI can be transmitted via PDCCH monitoring occasion (to described in more details below) or can be transmitted at a time relative to a reference point. The reference point can be any of a frame, a subframe, a slot, a pre-defined time reference point or / and a preconfigured time reference point. A scheduling signaling may comprise one or more time-frequency resource allocations within a scheduling granularity or scheduling unit; where, for example, a scheduling unit may be in terms of a number of symbols, which may be configurable in any of semi-static signaling (e.g., RRC, MAC-CE) or dynamic signaling (e.g., DCI) . In some implementations, a different application or service type may be configured with a different scheduling granularity. For example, an URLLC service may need a quicker turn-around traffic to achieve low-latency and high reliability transmission, thus a shorter (than 14 symbols) scheduling granularity such as scheduling unit of 7 or 6 symbols can be configured to accommodate this latency requirement; on the other hand, for transmission of high traffic loading or with high data rate such as eMBB service, a larger scheduling granularity such as scheduling unit of 14 or 28 symbols can be configured to accommodate this data rate requirement.
[0135] For multiple numerology options, the unit of the number of symbols in a scheduling signaling may be based on a base or reference numerology such as 15 kHz, 30 kHz, 60 kHz, 120 kHz, 240 kHz, 480 kHz subcarrier spacing (SCS) with either NCP or ECP; for example, a unit of 7 symbols of 15kHz SCS with NCP, a unit of 12 symbols of 60kHz with ECP.
[0136] Moreover, a PDCCH monitoring occasion is for a PDCCH transmission (that carries out DCI, for example) in a CORESET, which consists of a number of resource element groups (REGs) within specific time and frequency domain resources. A PDCCH uses control channel elements (CCEs) for its structure. A CCE is a group of REGs, and the PDCCH can consist of one or more CCEs. The number of CCEs used by a PDCCH is referred to as its aggregation level. Higher aggregation levels mean lower coding rates or more robust coding, making them more suitable for UEs with poor channel conditions. The CORESET allocations or PDCCH monitor occasions can be configured as one of cell-common, group common or UE specific configuration; and moreover, a configuration of CORESET and / or PDCCH monitoring occasions may be decoupled from or independent of a configuration of a scheduling granularity.
[0137] A configuration of a scheduling granularity can be UE specific, of cell common or of group common. A configuration of a scheduling granularity can be application or service specific (such as URLLC, eMBB, etc) . A scheduling granularity may be configured or indicated in a semi-static signaling such as RRC, MAC-CE, or / and dynamic signaling such as DCI, or any combination thereof.
[0138] A scheduling signaling may comprise one or more time domain resource allocations within a scheduling granularity or scheduling unit, each time domain resource allocation may comprise (within the scheduling unit) start-symbol and how many consecutive symbols, which can be denoted by one SLIV.
[0139] The above procedure and description can be demonstrated in FIG. 5. As shown in FIG. 5, the 15kHz is used as a reference numerology, and an alignment or reference point 510a-e (generically referred to as 520) is defined / configured based on a frame, and a time duration 520a, 520b (generically referred to as 520) (e.g., in terms of a number of subframe or symbols) between two reference (or alignment) points 510; a scheduling granularity is also configured as shown in FIG. 5. Note that the time duration between two adjacent reference points may be configured as the scheduling granularity (for example, N symbols) in FIG. 5, where a time for transmitting a scheduling signaling may be referenced to the reference or alignment point. In one possible implementation, the time duration between two adjacent reference points and the scheduling granularity may be configured separately or independently, where a time for transmitting a scheduling signaling may be referenced to a PDCCH monitoring occasion 530a, 530b, 530 c (generically referred to as 530) . In FIG. 5, a scheduling signaling, or DCI, may comprise an indication of time domain resource allocation (s) in a DCI element field, where the indication may require one or more bits (e.g., 7 bits) to indicate time domain allocation (s) , as well as other information bits to indicate frequency domain resource allocation (s) . In some implementations, the frequency domain allocations can use the same indication techiniques as used in the NR.
[0140] In some possible implementations, given a reference numerology of 15kHz SCS, when a UE is configured with 30kHz, its symbol duration may be reduced one half of a symbol duration of 15kHz. Thus, if a scheduling granularity is N symbols in terms of 15kHz numerology, and applied to 30kHz numerology signal scheduling, the scheduling granularity is 2N symbols which is shown in FIG. 5, and this scalable rule may be applied to other numerology options in the 2k*15KHz numerology family, where k is a non-negative integer. In other possible implementations, N symbols applied for the reference numerology also applied to other numerologies, i.e., all the numerologies use the same N symbols, but beacause the symbol length for different numerologies are different, the time duration of the scheduling granularity for different numerologies are different in terms of the seconds. In other possible implementations, the scheduling granularity can be numerolgoy-specific configured, for example, in semi-static way such as RRC or MAC-CE, thus making the scheduling even more flexible due to separate or independent configurations on different numerology options.
[0141] In one possible implementation, a time domain resource allocation with SLIV scheme is described with details.
[0142] In this scheme, a time domain resource allocation provided by a scheduling signaling such as DCI may comprise (within a scheduling unit) start-symbol (S) and how many consecutive symbols (L) , which can be denoted by SLIV. The scheduling signaling may comprise an indication of a reference time as a reference for the time domain resource allocation, where the reference time is a starting time point relative to the time domain resource allocation, and the reference time may be in terms of a number of scheduling units, a number of subframes, a number of slots or a number of symbols from a reference point 510 or a PDCCH monitoring occasion 530 as described above. As a result, a scheduled time domain resource may be uniquely determined by the reference time and SLIV. For example, a scheduled time domain resource may be located within a scheduling unit at SLIV that is N scheduling units (N is a non-negative integer) away from the scheduling moment, a reference point 510 or a PDCCH monitoring occasion 530.
[0143] In FIG. 6, DCI indication option 1 is described where a SLIV for a time domain resource allocation is calculated. A scheduling unit with a granularity of Lz symbols based on a base or reference numerology such as 15kHz SCS (with NCP) , a SLIV (assuming scheduling a time resource with S and L) is determined based on the procedure mentioned above and also shown as 610 in FIG. 6.
[0144] For a given scheuling size Lz (a configured scheduling granularity) , the total number of (S, L) pairs or time domain allocations can be uniquely determined and an example table 620 is shown in FIG. 6. Thus, one or more indication bits are required to indicate each of these time domain allocations, where the one or more indication bits may be included in a scheduling signaling or message such as DCI.
[0145] The indication bits in the table 620 of FIG. 6 is obtained based on the calculation method 610 shown in FIG. 6. As a result of an example, as the table 620 shown in FIG. 6, a scheduling granularity with smaller number of symbols (Lz) such as 6 or 7 symbols (comparing with slot-based 14 symbols) may require fewer number of bits such as (up to) 5 bits, and these indication bits may be included in a DCI element field for an indication of time domain resource allocation. A scheduling granularity with 14 symbols (Lz) may require (up to) 7 bits, and these indication bits may be included in a DCI element field for an indication of time domain resource allocation. A scheduling granularity with larger number of symbols (Lz) such as 28 symbols (comparing with slot-based 14 symbols) may require more number of bits such as (up to) 9 bits, and these indication bits may be included in a DCI element field for an indication of time domain resource allocation.
[0146] A different scheduling granularity may be configured for a different UE, application or service type, mobility type or / and numerology usage, etc. Furthermore or alternatively, a different scheduling granularity may be configured based on a different requirements or demands in terms of latency, data rate, reliability or other performance key indicator, etc.
[0147] In one possible implementation, a time domain resource allocation with resource index is described with details.
[0148] In this scheme, a time domain resource allocation may comprise (within the scheduling unit) a start symbol and how many consecutive symbols, where the time domain resource allocation can be indicated by a time allocation resource index (or indices) , which is (or are) predefined or tabulated for a group of time resource allocations, each comprising start-symbol and how many consecutive symbols, as shown in FIG. 7 (for NCP) and FIG. 8 (for ECP) .
[0149] For a given Lz, the total number of (S, L) pairs or time domain allocations can be uniquely determined for a scheduling granularity (or unit) . Part or all of the total number of (S, L) pairs or time domain allocations can be tabulated such as shown in FIG. 7 and FIG. 8. If part of the total number of (S, L) pairs or time domain allocations within a scheduling granularity is tabulated, a reduced number of indication bits can be used for the time resource indication; in this way, the indication bits included in a scheduling signaling or DCI for time domain resource can be reduced.
[0150] As shown in FIG. 7 and FIG. 8, a time domain resource allocation for PDSCH or PUSCH (e.g., PDSCH or PUSCH 540a, 540b) can be indicated by (PDSCH or PUSCH) resource index for a configured scheduling granularity or scheduling unit Lz (for NCP) or Lz’ (for ECP) . The indication bits required to uniquely indicate each time domain resource allocation depend on the total number of time domain resource allocations in each table. In some implementation, part of the total time domain resource allocations is selected. For example, L values of 2, 4 or / and 7 are used, to form a resource allocation table, thus leading to less number of rows in the resource allocation table, where the number of the indication bits can be reduced to indicate a time domain resource allocation (in a row) .
[0151] A different scheduling granularity may be configured for a different UE, application or service type, mobility type or / and numerology usage, etc. Furthermore or alternatively, a different scheduling granularity may be configured based on a different requirements or demands in terms of latency, data rate, reliability or other performance key indicator, etc.
[0152] FIG. 9 illustrates another example flexible scheduling scheme with a time domain resource allocation indication. In this example, 15kHz is used as a reference numerology as shown on the top portion of FIG. 9, while 30kHz, its symbol duration may be reduced to one half of a symbol duration of 15kHz, is shown on the bottom portion of FIG. 9. FIG. 9 shows a scheduling granularity is of N=4 symbols in a scheduling unit for the 15kHz numerology.
[0153] As shown in FIG. 9, an alignment or reference point 910a, 910b, 910c (generically referred to as 910) is defined / configured within a frame; and a scheduling granularity in terms of a scheduling unit (SU) 950a or 950b (generically referred to as 950) is also configured. Unlike FIG. 5, the scheduling granularity in terms of the SU 950 can be different from a time duration 920 between two adjacent alignment points 910. For example, the SU 950 might include a smaller number of symbols than the number of symbols in the time duration 920 between two adjacent alignment points 910. In fact, in some implementations, one or more alignment points can be configured within a frame based on any one or more of a subframe, a slot, a symbol, a SU (or granularity) , etc. In some implementations, the subframe may be time stamped with absolute time, e.g., one of the frame boundaries may be provided with an absolute time by system information. For example, a frame duration is of e.g., 10ms and a subframe is of. e.g., 1ms. In some implementations, one or more alignment points can be configured within a frame based on an absolute time.
[0154] An alignment point may be located in a boundary of the frame, a subframe, a symbol, a slot, a SU; or can be located at any place within the frame. For example, FIGS. 5 and 9 show the first alignment points 510 and 910 are aligned with the boundary of the frame. In some implementations, the alignment points 510 and 910 can be offset (e.g., by a number of symbols, SUs, or an absolute time) from the boundary of the frame or a subframe.
[0155] In some implementations, pre-defined or default parameters such as numerology, e.g., 15kHz, CP type, and scheduling unit may be used for system information broadcast. Some parameters such as cell-common or group common scheduling unit, and alignment point may be updated by the system information.
[0156] In some implementations, upon the UE accesses into network, some of UE specific parameters such as numerology, PDCCH occasions, and scheduling unit may be configured in a semi-static way (e.g., by RRC and / or MAC-CE) , in a dynamic way (by DCI) , or a combination of thereof. The numerology can be represented by two parameters: subcarrier spacing and one type of CPs (normal CP or extended CP) .
[0157] The configured frame structure as shown in FIG. 5 or 9 may be used as a reference time framework for communication. For example, it can support time division duplex (TDD) or frequency division duplex (FDD) transmission / reception of OFDM signals with different numerologies (e.g., 15kHz, 30kHz, 60kHz, …) , for example, by using flexible, different scheduling units that are associated with different numerologies, for different UEs or for different data transmission occasions of a same UE.
[0158] In some implementations, a time for transmitting a scheduling signaling may be referenced to a PDCCH monitoring occasion (or a PDCCH occasion) . In some implementations, a PDCCH occasion can refer to a location of a PDCCH (e.g., 530 or 930) in a time and frequency domain resource. In some implementations, the PDCCH occasion can be configurated in different manners. As one example, a PDCCH occasion (e.g., a PDCCH occasion 530a, 530b, 930a or 930c) can be configurated from an alignment point (e.g., alignment point 510 or 910) , defining within the time duration 520 or 920 between two alignment points, and repeats periodically (e.g., over alignment points) . As another example, a PDCCH occasion (e.g., a PDCCH occasion 530c, 930b or 930d) can be configurated from an alignment point (e.g., alignment point 510 or 910) with an offset, defining within the time duration 520 or 920 between two alignment points, and repeats periodically (e.g., over alignment points) . As yet another example, a PDCCH occasion can be configurated using a bit map within the time duration 520 or 920 between two alignment points, and repeats periodically (e.g., over alignment points) . In some implementations, an applicable period (e.g., valid in 500ms) may be also included in the PDCCH occasion configuration.
[0159] In some implementations, a scheduling signaling, such as DCI, may comprise an indication of time domain resource allocation (s) (e.g., a SLIV filed) in a DCI element field, where the indication may include one or more bits (e.g., 7 bits) to indicate time domain allocation (s) . In some implementations, scheduling time reference can be a start boundary of one frame, a reference point or a scheduling unit that includes scheduling information / DCI (in a PDCCH occasion) . In some implementations, a relative time (stamp) can be indicated in reference to an alignment point. With an applicable SU, different scheduling time reference can be used to configure a time resource allocation for a scheduled resource in a PDSCH or PUSCH. As an example option 1 shown in FIG. 9, the scheduled resource in a PDSCH can be indicated relative to an alignment point the UE receives DCI (e.g., the alignment point 910a) , and the time domain location of the scheduled resource is 2 SU + SLIV. As an example option 2 shown in FIG. 9, the scheduled resource in a PDSCH can be indicated relative to the scheduling unit with PDCCH (e.g., the scheduling unit 950a) , and the time domain location of the scheduled resource is 1 SU + SLIV. These different time reference schemes can be similarly applied to tabulated rows or RRC configured time resource allocation entries for time allocations as discussed in connection with FIGS. 7-8 and 10-11.
[0160] In some implementations, one or more allocation tables can be used to map one or more (row) index to a time domain allocation / assignment represented by (k, S, L) , where k represents a time offset, S represents a starting symbol index, and L represents a number of consecutive symbols of a scheduled resource. The time offset can be with reference to, for example, a starting time or a boundary of one frame, an alignment point, or a scheduling unit that includes scheduling information / DCI (in a PDCCH occasion) . In some implementations, combinations of selected (k, S, L) may be predefined in the one or more allocation tables or RRC configured as multiple entries. The allocation table can include multiple rows of time resource allocation entries, where the number of rows or entries can be used to determine how many bits are required in DCI for an indication of one row / entry. In some implementations, the row index can be represented by a number of bits, for example, in a bit map or in another format.
[0161] FIG. 10 illustrates an example table of a group of physical downlink shared channel (PDSCH) time resource allocation indications for NCP. FIG. 11 illustrates an example table 1100 of a group of physical uplink shared channel (PUSCH) time resource allocation indications for NCP. Additional or different allocation tables can be configured to map multiple (row) indexes or a bit representation to multiple time domain allocations / assignments represented by multiple (k, S, L) combinations, for NCP and / or ECP or other numerology parameters. In some implementations, a subset of all (k, S, L) combinations can be selected to form a reduced table to reduce the number of bits needed to represent the indexes, thus reducing the signaling overhead.
[0162] In some implementations, for DL resource allocation in time domain, when the UE is scheduled to receive PDSCH by a DCI, the DCI can include a time domain resource assignment field with a value m representing a row index m + 1 as shown in an allocation table (e.g., the example allocation table 1000) . The indexed row defines a time offset K0, the start and length indicator SLIV, or directly the start symbol S and the allocation length L. These parameters can be configured based on a SU, for example, according to the techniques discussed in connection with FIGS. 6-8. In some implementations, the starting symbol S relative to the start of the slot, and the number of consecutive symbols L counting from the symbol S allocated for the PDSCH are determined from the start and length indicator SLIV. In some implementations, a total number of bits for indication of each row in DCI can be calculated based on candidate values of K0, S and L. In some implementations, a subset of all (K0, S, L) combinations can be selected to form a reduced table to reduce the number of bits needed to represent the indexes, thus reducing the signaling overhead.
[0163] In some implementations, for UL resource allocation in time domain, when the UE is scheduled to transmit data on PUSCH by a DCI, the DCI can include a time domain resource assignment field with a value m representing a row index m + 1 as shown in an allocation table (e.g., the example allocation table 1100) . The indexed row defines the time offset K2, the start and length indicator SLIV, or directly the start symbol S and the allocation length L. These parameters can be configured based on a SU, for example, according to the techniques discussed in connection with FIGS. 6-8. In some implementations, the starting symbol S relative to the start of the SU, and the number of consecutive symbols L counting from the symbol S allocated for the PUSCH are determined from the start and length indicator SLIV of the indexed row. In some implementations, a total number of bits for indication of each row in DCI can be calculated based on candidate values of K2, S and L. In some implementations, a subset of all (K2, S, L) combinations can be selected to form a reduced table to reduce the number of bits needed to represent the indexes, thus reducing the signaling overhead.
[0164] FIG. 12 illustrates a flow chart of an example communication method 1200 for flexible scheduling. The example communication method 1200 can be performed by a communication system that includes a base station 1205 (e.g., one of the network nodes or TRPs 170a-170b, 172) and a UE 1215 (e.g., the ED 110) . In summary, the signaling flow chart for the above possible scheme may include:
[0165] Step 1210, the base station 1205 transmits information indicating one or more of the above parameters, and accordingly, the UE 1215 recevies the information. The information may be carried via any one of RRC / MAC / DCI signaling or any combination thereof.
[0166] In some implementations, the information can include granuarlity information or scheduling granularity information. In some implementations, the scheduling granularity information indicates a number of symbols (e.g., Lz symbols) in at least one SU for resource scheduling for communications between the UE 1215 and the network device 1205.
[0167] In some implementations, the at least one SU comprises a plurality of SUs. In some implementations, the plurality of SUs correspond to different application types, service types, mobility types, use cases, or / and numerologies. In some implementations, the at least one SU comprises a plurality of SUs corresponding to a plurality of numerologies. The numerology can be represented by two parameters: subcarrier spacing (SCS) and one type of CPs (e.g., NCP or ECP) . In some implementations, the number of symbols in the at least one SU is an integer multiple of 3 (3*N) symbols for ECP and an integer multiple of 7 (7*M) for NCP. In some implementations, the number of symbols in a first SU for 15kHz SCS can be P, the number of symbols in a second SU for 30kHz SCS can be 2P, the number of symbols in a third SU for 60kHz SCS can be 4P, and so on. In some implementations, the number of symbols in the at least one SU is 3 symbols, 6 symbols, 7 symbols, 12 symbols, 14 symbols, 24 symbols, 28 symbols, 48 symbols, 56 symbols, etc.
[0168] In some implementations, the scheduling granularity information indicates that a number of symbols in a first SU corresponding to a first numerology is the same as or different from a number of symbols in a second SU corresponding to a second numerology. As one example, the first SU corresponding to a first numerology of 15kHz SCS and NCP and the second SU corresponding to a second numerology of 30kHz SCS and NCP can each include 7 symbols. As another example, the first SU corresponding to the first numerology of 15kHz SCS and NCP includes 7 symbols, while the second SU corresponding to the second numerology of 30kHz SCS and NCP can include 14, 28, or 56 symbols.
[0169] In some implementations, the scheduling granularity information includes a scheduling granularity index that represents a SU corresonding to a numerology among multiple candidate SUs corresonding to multiple numerologies. In some implementations, a mapping relationship can be eatblished between multiple scheduling granularity indexes and multiple SUs corresponding to multiple numerologies, for example, as shown in Table 1300 in FIG. 13.
[0170] In some implementations, the scheduling granularity information indicates one of the plurality of SUs is a default SU.For example, the default SU can be a preconfigured SU that the base station 1205 and the UE 1215 understands to use in the absence of any other signaling to inform, change, or update the SU choice. For example, the default SU can be an SU that is compatbile with a legacy standard (e.g., a slot-based SU of 14 symbols per SU) or another SU. In some implementations, the default SU is configured, for example, based on an application or service type of a current data transission between the base station 1205 and the UE 1215. RRC can be unicast, group-cast, or broadcast,
[0171] In some implementations, the information can include receiving information indicating a location of a physical downlink control channel (PDCCH) based on an alignment point or a subframe in a frame. For example, the information can be used by the UE to determine the location of the PDCCH based on an alignment point or a subframe in a frame. In some implementations, the information can include an alignment point information that indicates an alignment point (e.g., the alignment point 512 or 912) for determining the location of the PDCCH in the subframe. In some implementations, the alignment point is configured (e.g., by a RRC message or MAC-CE) based on one or more of a frame, a subframe, a slot, or a symbol. In some implementations, a time location of the alignment point is different from a starting time or a boundary of one or any of the frame, the subframe, the slot, or the symbol. For example, the time location of the alignment point is different from a starting time or a boundary of any of the frame, the subframe, or the slot. The time location of the alignment point can be aligned with a starting time or a boundary of a SU or a symbol.
[0172] In some implementations, the information can include information that indicates a granuality for a PDCCH resource, for example, in terms of a number of symbols in a SU for a resource for transmitting / receiving a PDCCH. For example, the information can indicate to the UE 1215 which one of the at least one SU to use for receiving a DCI in a PDCCH. In some implementations, the information can be initially transmitted by the base station 1205 to the UE 1215 in a system information. In some implementations, the information can be transmitted in an RRC message, MAC-CE or DCI to indicate a SU to use (or switching to a new SU to use) after the multiple SUs are configured (for example, by the RRC message) . In some implementations, a default SU to transmit DCI via PDCCH can be configured as discussed above.
[0173] In some implementations, the one or more of the above parameters or pieces of information (e.g., the granuarlity information, the information for determining a location of a PDCCH, and the information that indicates a granuality for a PDCCH resource) can be sent in one step (e.g., in a same data packet) or can be sent in multiple steps or in multiple occasions. For example, some of the parameters or information (e.g., default or intial parameters) can be sent in a system information message (e.g., system infromation block (SIB) ) at one time instance, while some other parameters or information can be sent in another message or signaling (e.g., RRC message, MAC-CE, or DCI) at another time instance. In some implementations, multiple flexible granuality and scheduling configurations can be pre-configured, and a DCI can include an index to activate one of the pre-configured configurations, without the need to transmit a RRC to indicate the granuality and scheduling parameters.
[0174] In some implementations, the step 1210 is optional, and when absent, the one or more of the above parmeters are pre-defined, for example, associating with above different scenarios (e.g., different application types, service types, mobility types, use cases, or / and numerologies) .
[0175] Step 1220, the base station 1205 transmits scheduling information to the UE for scheduling DL data or UL data, and accordingly, the UE 1215 receives the scheduling information.
[0176] The scheduling information may be DCI. The detailed information inlcuded in DCI is described above. For example, the DCI comprises time offset information indicating a time offset (e.g., K0 or K2) of a scheduled resource relative to the alignment point or relative to the location of the PDCCH (e.g., a PDCCH occasion as disccused in connection with FIGS. 5 and 9) . In some implementations, the DCI comprises a start and length indicator value (SLIV) field for determining a location of a scheduled resource, wherein the SLIV field indicates a starting symbol index (S) and a number of consecutive symbols (L) within an SU, wherein the SU belongs to or is one of the at least one SU. For example, the SU is either the default SU, or other activated / indicated SU. In some implementations, the SLIV field comprises an index indicating one of a total number of (S, L) combinations. Here, the total number of (S, L) combinations include all possible combinations with valid S and L.
[0177] In some implementations, the SLIV field comprises an index indicating one of a subset of a total number of (S, L) combinations, for example, to save the number of bits used to represent the index. In some implementations, a table or another data structure can be used to store the mapping between the index values and the (S, L) combinations, for example, as shown in one of the tables in FIGS. 7, 8, 10 and 11. In some implementations, the mapping can be pre-configured and pre-defined, for example, before step 1210. For example, the base station may transmit the table to the UE in system information or the UE may store, download, or otherwise receive the table. Here, the subset of the total number of (S, L) combinations includes a reduced number of possible combinations with valid S and L, to save the number of bits used for representing the combinations.
[0178] In some implementations, the DCI comprises a time allocation index indicating one of a (k, S, L) combination, wherein k represents a time offset (e.g., K0 or K2) , S represents a starting symbol index (S) , and L represents a number of consecutive symbols (L) of a scheduled resource. In some implementations, the S and L can together be repsrented by a SLIV value. The time resource allocation with combinations of selected (k, S, L) may be predefined in a table (e.g., table 1000 or 1100) or be configured by a RRC message as multiple entries, for example, as discussed above.
[0179] In some impelmentations, to save the DCI bits, a subset of the combinations can be selected and stored in one or more tables. The base station 1205 can select one of the one or more tables and select one of the index from the selected table to indicate the time allocation of the schedules resource to the UE 1215.
[0180] Step 1230, the UE 1215 and base station 1205 perform DL and / or UL data transmission according to the information and the scheduling information. For example, the UE 1215 and base station 1205 communicate with each other based on the at least one SU, for example, by transmitting / receiving DL and or UL data using the scheduled resource (e.g., in PDSCH or PUSCH) indicated by the DCI. In some implementations, the base station 1205 can determine, based on the at least one SU, the scheduled resource in PDSCH for the DL data transmission and / or the scheduled resource in PUSCH for the UL data transmission. The base station 1205 can include in the DCI the time allocation indication (e.g., (k, S, L) or the SLIV field) of the scheduled resource, and use the scheduled resource for the DL and / or UL data transmission. In some implementations, the UE 1215 can receive and decode DCI, for example, based on the information that indicates the granuality for the PDCCH resource. The UE 1215 can determine, based on the at least one SU and the time allocation index (e.g., (k, S, L) or the SLIV field) included in the DCI, the scheduled resource for the DL and / or UL data transmission. The UE 1215 can then use the scheduled resource for the DL and / or UL data transmission.
[0181] In some aspects of the present disclosure, there is provided an apparatus / chipset system comprising means (e.g., at least one processor) to implement a method implemented by (or at) a UE of the present disclosure. The apparatus / chipset system may be the UE (that is, a terminal device) or a module / component in the UE. In details, the at least one processor may execute instructions stored in a computer-readable medium to implement the method. For example, the apparatus / chipset system may include corresponding modules or units configured to implement methods and / or embodiments described herein. In some implementations, the apparatus / chipset system can include a processing unit, and a communication unit (including one or more of a transmitting unit and receiving unit) , as shown in FIG. 4. For example, the apparatus / chipset system includes a receiving unit configured to receive scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between a user equipment (UE) and a network device; and a communicating unit configured to communicate with the network device based on the at least one SU. In some implementations, the apparatus / chipset system may include one or more processors / processor cores, and an interface circuit. For example, the apparatus / chipset system includes one or more processors; and an interface circuit configured to: receive scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between a user equipment (UE) and a network device; and communicate with the network device based on the at least one SU. Optionally, the apparatus / chipset system includes may further include a storage unit configured to store apparatus program code (or instructions) and / or data.
[0182] In some aspects of the present disclosure, there is provided an apparatus / chipset system comprising means (e.g., at least one processor) to implement the method implemented by (or at) a network device (e.g., base station) of the present disclosure. The apparatus / chipset system may be the network device or a module / component in the network device. In details, the at least one processor may execute instructions stored in a computer-readable medium to implement the method. In some aspects of the present disclosure, there is provided a system comprising at least one of an apparatus in (or at) a UE of the present disclosure, or an apparatus in (or at) a network device of the present disclosure. For example, the apparatus / chipset system may include corresponding modules or units configured to implement methods and / or embodiments described herein. In some implementations, the apparatus / chipset system can include a processing unit, and a communication unit (including one or more of a transmitting unit and receiving unit) , as shown in FIG. 4. For example, the apparatus / chipset system includes a transmitting unit configured to transmit scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between a user equipment (UE) and a network device; and a communicating unit configured to communicate with the UE based on the at least one SU. In some implementations, the apparatus / chipset system may include one or more processors / processor cores, and an interface circuit. For example, the apparatus / chipset system includes one or more processors; and an interface circuit configured to: transmit scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications between a user equipment (UE) and a network device; and communicate with the UE based on the at least one SU. Optionally, the apparatus / chipset system includes may further include a storage unit configured to store apparatus program code (or instructions) and / or data.
[0183] In some aspects of the present disclosure, there is provided a method performed by a system comprising at least one of an apparatus in (or at) a UE of the present disclosure, and an apparatus in (or at) a network device of the present disclosure.
[0184] In some aspects of the present disclosure, there is provided a computer program comprising instructions. The instructions, when executed by a processor, may cause the processor to implement a method of the present disclosure.
[0185] In some aspects of the present disclosure, there is provided a non-transitory computer-readable medium storing instructions, the instructions, when executed by a processor, may cause the processor to implement a method of the present disclosure.
[0186] The solutions described in the disclosure is applicable to a next generation (e.g. sixth generation (6G) or later) network, or a legacy (e.g. 5G, 4G, 3G or 2G) network.
[0187] It will be appreciated that any module, component, or device disclosed herein that executes instructions may include, or otherwise have access to, a non-transitory computer / processor readable storage medium or media for storage of 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 cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, optical disks such as compact disc read-only memory (CD-ROM) , digital video discs or digital versatile discs (i.e., DVDs) , Blu-ray DiscTM, or other optical storage, 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 memory technology. Any such non-transitory computer / processor storage media may be part of a device / apparatus or accessible or connectable thereto. Computer / processor readable / executable instructions to implement a method, an application or a module described herein may be stored or otherwise held by such non-transitory computer / processor readable storage media.
[0188] It could be noted that the message in the disclosure could be replaced with information, which may be carried in one single message, or be carried in more than one separate message.
[0189] Without special noting, the terms “apparatus” and “device” are used exchangeable, and the terms “identity” and “identifier” are sued exchangeable.
[0190] In the disclosure, the word “a” or “an” when used in conjunction with the term “comprising” or “including” in the claims and / or the specification may mean “one” , but it is also consistent with the meaning of “one or more” , “at least one” , and “one or more than one” unless the content clearly dictates otherwise. Similarly, the word “another” may mean at least a second or more unless the content clearly dictates otherwise.
[0191] In the disclosure, the words “first” , “second” , etc., when used before a same term (e.g., ED, or an operating step) does not mean an order or a sequence of the term. For example, the “first ED” and the “second ED” , means two different EDs without specially indicated, and similarly, the “first step” and the “second step” means two different operating steps without specially indicated, but does not mean the first step have to happen before the second step. The real order depends on the logic of the two steps.
[0192] The terms “coupled” , “coupling” or “connected” as used herein can have several different meanings depending on the context in which these terms are used. For example, as used herein, the terms coupled, coupling, or connected can indicate that two elements or devices are directly connected to one another or connected to one another through one or more intermediate elements or devices via a mechanical element depending on the particular context.
[0193] Note that the expression “at least one of A or B” , as used herein, is interchangeable with the expression “A and / or B” . It refers to a list in which you may select A or B or both A and B. Similarly, “at least one of A, B, or C” , as used herein, is interchangeable with “A and / or B and / or C” or “A, B, and / or C” . It refers to a list in which you may select: A or B or C, or both A and B, or both A and C, or both B and C, or all of A, B and C. The same principle applies for longer lists having a same format.
[0194] The present disclosure encompasses various embodiments, including not only method embodiments, but also other embodiments such as apparatus embodiments and embodiments related to non-transitory computer readable storage media. Embodiments may incorporate, individually or in combinations, the features disclosed herein.
[0195] The term “receive” , “detect” and “decode” as used herein can have several different meanings depending on the context in which these terms are used. For example, without special note, the term “receive” may indicate that information (e.g., DCI, or MAC-CE, RRC signaling or TB) is received successfully by the receiving node, which means the receiving side correctly detect and decode it. In this scenario, “receive” may cover “detect” and “decode” or may indicates same thing, e.g., “receive paging” means decoding paging correctly and obtaining the paging successfully, accordingly, “the receiving side does not receive paging” means the receiving side does not detect and / or decoding the paging. “paging is not received” means the receiving side tries to detect and / or decoding the paging, but not obtain the paging successfully. The term “receive” may sometimes indicate that a signal arrives at the receiving side, but does not mean the information in the signal is detected and decoded correctly, then the receiving side need perform detecting and decoding on the signal to obtain the information carried in the signal. In this scenario, “receive” , “detect” and “decode” may indicate different procedure at receiving side to obtain the information.
[0196] Although this disclosure refers to illustrative embodiments, this is not intended to be construed in a limiting sense. Various modifications and combinations of the illustrative embodiments, as well as other embodiments of the disclosure, will be apparent to persons skilled in the art upon reference to the description. When combining two or more embodiments, not all the features in the embodiments to be combined are necessary for the combination.
[0197] Features disclosed herein in the context of any particular embodiments may also or instead be implemented in other embodiments. Method embodiments, for example, may also or instead be implemented in apparatus, system, and / or computer program product embodiments. In addition, although embodiments are described primarily in the context of methods and apparatus, other implementations are also contemplated, as instructions stored on one or more non-transitory computer-readable media, for example. Such media could store programming or instructions to perform any of various methods consistent with the present disclosure.
Claims
1.A method, comprising:receiving scheduling granularity information that indicates a number of symbols in at least one scheduling unit (SU) for resource scheduling for communications with a network device; andcommunicating with the network device based on the at least one SU.2.The method of claim 1, wherein the at least one SU comprises a plurality of SUs, and the scheduling granularity information indicates one of the plurality of SUs is a default SU.3.The method of claim 1 or 2, wherein the at least one SU comprises a plurality of SUs, each SU corresponding to one of a plurality of numerologies.4.The method of claim 3, wherein the scheduling granularity information indicates that a number of symbols in a first SU corresponding to a first numerology is the same as a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.5.The method of claim 3, wherein the scheduling granularity information indicates a number of symbols in a first SU corresponding to a first numerology is different from a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.6.The method of any one of claims 1 to 5, wherein the scheduling granularity information is included in one or more of a radio resource control (RRC) message, media access control–control element (MAC-CE) , or downlink control information (DCI) .7.The method of any one of claims 1 to 6, wherein the number of symbols in the at least one SU is 3, 6, 7, 12, 14, 24, 28, or 48.8.The method of any one of claims 1 to 7, further comprising receiving information indicating a location of a physical downlink control channel (PDCCH) based on an alignment point or a subframe in a frame.9.The method of claim 8, wherein the alignment point is configured based on one or more of a frame, a subframe, a slot, or a symbol; and a time location of the alignment point is different from a starting time or a boundary of any of the frame, the subframe, or the slot.10.The method of claim 8, further comprising:receiving DCI in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the alignment point.11.The method of claim 8, further comprising:receiving DCI in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the location of the PDCCH.12.The method of any one of claims 1 to 11, further comprising:receiving DCI, wherein the DCI comprises a start and length indicator value (SLIV) field, wherein the SLIV field indicates a starting symbol index (S) and a number of consecutive symbols (L) within an SU, wherein the SU is one of the at least one SU.13.The method of claim 12, wherein the SLIV field comprises an index indicating one of a total number of (S, L) combinations.14.The method of claim 12, wherein the SLIV field comprises an index indicating one of a subset of a total number of (S, L) combinations.15.The method of any one of claims 1 to 14, further comprising: receiving DCI, wherein the DCI comprises a time allocation index indicating one of a (k, S, L) combination, wherein k represents a time offset, S represents a starting symbol index, and L represents a number of consecutive symbols of a scheduled resource.16.The method of any one of claims 1 to 15, further comprising receiving information that indicates one of the at least one SU for receiving a DCI in a PDCCH.17.A method comprising:transmitting scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications with a user equipment (UE) ; andcommunicating with the UE based on the at least one SU.18.The method of claim 17, wherein the at least one SU comprises a plurality of SUs, and the scheduling granularity information indicates one of the plurality of SUs is a default SU.19.The method of claim 17 or 18, wherein the at least one SU comprises a plurality of Sus, each SU corresponding to one of a plurality of numerologies.20.The method of claim 19, wherein the scheduling granularity information indicates that a number of symbols in a first SU corresponding to a first numerology is the same as a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.21.The method of claim 19, wherein the scheduling granularity information indicates a number of symbols in a first SU corresponding to a first numerology is different from a number of symbols in a second SU corresponding to a second numerology, wherein the first SU and the second SU belong to the plurality of SUs, the first numerology and the second numerology belong to the plurality of numerologies.22.The method of any one of claims 17 to 21, wherein the scheduling granularity information is included in one or more of a radio resource control (RRC) message, media access control–control element (MAC-CE) , or downlink control information (DCI) .23.The method of any one of claims 17 to 22, wherein the number of symbols in the at least one SU is 3, 6, 7, 12, 14, 24, 28, or 48.24.The method of any one of claims 17 to 23, further comprising:transmitting information indicating a location of a physical downlink control channel (PDCCH) based on an alignment point or a subframe in a frame.25.The method of claim 24, wherein the alignment point is configured based on one or more of a frame, a subframe, a slot, or a symbol; and a time location of the alignment point is different from a starting time or a boundary of any of the frame, the subframe, or the slot.26.The method of claim 24, further comprising:transmitting downlink control information (DCI) in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the alignment point.27.The method of claim 24, further comprising:transmitting downlink control information (DCI) in the PDCCH, wherein the DCI comprises time offset information indicating a time offset of a scheduled resource relative to the location of the PDCCH.28.The method of any one of claims 17 to 27, further comprising:transmitting downlink control information (DCI) , wherein the DCI comprises a start and length indicator value (SLIV) field, wherein the SLIV field indicates a starting symbol index (S) and a number of consecutive symbols (L) within an SU, wherein the SU is one of the at least one SU.29.The method of claim 28, wherein the SLIV field comprises an index indicating one of a total number of (S, L) combinations.30.The method of claim 28, wherein the SLIV field comprises an index indicating one of a subset of a total number of (S, L) combinations.31.The method of any one of claims 17 to 30, further comprising:transmitting downlink control information (DCI) , wherein the DCI comprises a time allocation index indicating one of a (k, S, L) combination, wherein k represents a time offset, S represents a starting symbol index, and L represents a number of consecutive symbols of a scheduled resource.32.The method of any one of claims 17 to 31, further comprising transmitting information that indicates one of the at least one SU for transmitting a DCI in a PDCCH.33.A communication apparatus, configured to perform the method according to any one of claims 1 to 32.34.The communication apparatus of claim 33, comprising:a receiving unit configured to receive scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications with a network device; anda communicating unit configured to communicate with the network device based on the at least one SU.35.The communication apparatus of claim 33, comprising:a transmitting unit configured to transmit scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications with a user equipment (UE) ; anda communicating unit configured to communicate with the UE based on the at least one SU.36.The communication apparatus of claim 33, comprising:one or more processors; andan interface circuit configured to:receive scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications with a network device; andcommunicate with the network device based on the at least one SU.37.The communication apparatus of claim 33, comprising:one or more processors; andan interface circuit configured to:transmit scheduling granularity information that indicates a number of symbols in at least one SU for resource scheduling for communications with a user equipment (UE) ; andcommunicate with the UE based on the at least one SU.38.The communication apparatus of claim 36 or claim 37, wherein the interface circuit comprises one or more transceivers.39.An apparatus comprising:one or more processors; andone or more memories storing instructions which, when executed by the one or more processors, cause the apparatus to perform the method of any one of claims 1 to 32.40.A communication system, wherein the communication system comprises a first communication apparatus configured to perform the method of any one of claims 1 to 16 and a second communication apparatus configured to perform the method of any one of claims 17 to 32.41.A non-transitory computer-readable storage medium having instructions stored thereon which, when executed by an apparatus, cause the apparatus to perform the method of any one of claims 1 to 32.
Citation Information
Patent Citations
Scheduling request resource configuration
CN111602444A
Channel scheduling method and communication equipment
CN114696979A
Multi-granularity FlexE slice scheduling method in 5G energy internet and medium
CN116033564A
Method and device for supporting random access for low-capability terminal in wireless communication system
WO2021201611A1