Determination of common timing advance in non-terrestrial networks

By approximating feeder link delays with polynomials to minimize errors, the method enhances synchronization and resource utilization in non-terrestrial networks, addressing timing advance challenges in 5G NR systems.

JP2024542066AInactive Publication Date: 2024-11-13PANASONIC INTELLECTUAL PROPERTY CORP OF AMERICA
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2024525996
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2021-11-05
Filing Date
2022-10-24
Publication Date
2024-11-13
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In non-terrestrial networks, determining timing advances for uplink transmissions in 5G NR systems is challenging due to varying propagation delays caused by satellite movements, leading to significant approximation errors in timing advance calculations.

Method used

A network node adjusts timing advance components by approximating the feeder link delay using a polynomial with coefficients that minimize approximation errors over a valid interval, transmitted to user equipment to synchronize uplink transmissions.

Benefits of technology

This method reduces timing advance errors, enhances synchronization accuracy, and optimizes resource utilization in non-terrestrial networks, improving communication reliability and efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024542066000001_ABST
    Figure 2024542066000001_ABST
Patent Text Reader

Abstract

The present disclosure relates to a network node and a user device, and a method for executing in a network node, a user device, or an integrated circuit for determining a common timing advance component of a non-terrestrial based network. In particular, polynomial coefficients are determined for a validity interval that approximates a timing advance component between a network node and a satellite so as to minimize an approximation error, the approximation error being specified at a number of time instances of the validity interval relative to a reference time instance. The coefficients are provided from the network node to the user device and used to approximate the timing advance.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to determining a timing advance in a non-terrestrial based network, and more particularly to an apparatus and method for calculating, signaling and / or utilizing a determined timing advance. [Background technology]

[0002] Currently, the 3rd Generation Partnership Project (3GPP) is developing technical specifications for the next generation of mobile phone technology, also known as the fifth generation (5G).

[0003] One objective is to provide a single technical framework that addresses all usage scenarios, requirements, and deployment scenarios (see, for example, Section 6 of Non-Patent Document 1), including at least enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine type communication (mMTC). For example, deployment scenarios for eMBB include indoor hotspots, dense urban areas, rural areas, urban macro, and high-speed communications, deployment scenarios for URLLC include industrial control systems, mobile healthcare (remote monitoring, remote diagnosis, and remote treatment), real-time control of vehicles, wide-area monitoring, and smart grid control systems, and deployment scenarios for mMTC include scenarios using a large number of devices with non-time-critical data transfer, such as smart wearables and sensor networks. eMBB and URLLC services are similar in that both require very high bandwidth, but differ in that URLLC services preferably require ultra-low latency.

[0004] The second objective is to achieve forward compatibility: Backward compatibility with Long Term Evolution (LTE, LTE-A) cellular systems is not required, facilitating the introduction of entirely new system designs and / or new features.

[0005] One of the notable features of 5G is the introduction of a non-terrestrial network (NTN), including satellites, in the communication path between user devices and the network. [Prior art documents] [Non-patent literature]

[0006] [Non-Patent Document 1] 3GPP TR 38.913 version 16.0.0 [Non-Patent Document 2] 3GPP TS 38.300 v16.3.0 [Non-Patent Document 3] 3GPP TS 38.211 v16.3.0 [Non-Patent Document 4] ITU-R M.20183 [Non-Patent Document 5] TS 23.501 v16.6.0 [Non-Patent Document 6] 3GPP TR 38.811, Study on New Radio (NR) to support non-terrestrial networks, version 15.4.0 [Non-Patent Document 7] 3GPP TR 38.821, Solutions for NR to support non-terrestrial networks, version 16.0.0 [Non-Patent Document 8] TR 38.321 [Non-Patent Document 9] TS 38.401 [Non-Patent Document 10] 3GPP RP-201256, "WID: Solutions for NR to support non-terrestrial networks (NTN)" [Non-Patent Document 11] 3GPP TR 38.821, v.1.1.0 Summary of the Invention [Problem to be solved by the invention]

[0007] One non-limiting exemplary embodiment facilitates efficient computation of a common timing advance (a timing advance component between a satellite and a network node). [Means for solving the problem]

[0008] In one embodiment, the techniques disclosed herein provide a network node comprising: a processing circuit for determining, during operation, coefficients of a polynomial approximating a timing advance component between the network node and a satellite so as to minimize an approximation error for a validity interval, the approximation error being specified at a number of time instances of the validity interval relative to a reference time instance, the network node further comprising a transceiver for transmitting said coefficients during operation.

[0009] It should be noted that the general or specific embodiments may be implemented as a system, a method, an integrated circuit, a computer program, a storage medium, or any combination thereof.

[0010] Further benefits and advantages of the disclosed embodiments will become apparent from the specification and drawings, and these benefits and / or advantages may be obtained individually through the various embodiments and features of the specification and drawings, and it is not necessary for all of these features to be present in order to obtain one or more of such benefits and / or advantages.

[0011] Exemplary embodiments are explained in more detail below with reference to the accompanying figures and drawings. [Brief description of the drawings]

[0012] [Figure 1] FIG. 1 illustrates an example architecture of a 3GPP NR system. [Diagram 2] FIG. 1 is a schematic diagram showing the separation of functions between NG-RAN and 5GC. [Diagram 3] FIG. 1 is a sequence diagram of an RRC connection establishment / reconfiguration procedure. [Figure 4] A schematic diagram showing the usage scenarios of enhanced mobile broadband (eMBB), massive machine type communications (mMTC), and ultra-reliable low latency communications (URLLC). [Diagram 5] FIG. 1 is a block diagram illustrating an example 5G system architecture for a non-roaming scenario. [Figure 6] FIG. 1 illustrates an exemplary NG RAN architecture based on transparent relay satellites. [Figure 7] FIG. 1 illustrates an exemplary NG RAN architecture based on regenerative satellites. [Figure 8] FIG. 1 illustrates an example scenario in which several UEs are served by a satellite. [Figure 9A] FIG. 2 illustrates an exemplary approximation of a parabolic function by a first order polynomial obtained as a Taylor series according to one embodiment. [Figure 9B] FIG. 9B is a diagram showing the approximation error in the case of the approximation value of FIG. 9A. [Figure 10] FIG. 2 illustrates an exemplary and simplified structure of a UE and a network node. [Figure 11] FIG. 1 illustrates an example timing diagram for uplink and downlink including timing advance in an NTN network. [Figure 12] FIG. 2 is a schematic diagram illustrating determining a reference time instance based on system timing; [Figure 13]FIG. 1 is a flow diagram illustrating a processing chain in a user device for obtaining timing advance in an NTN network. [Figure 14] FIG. 1 is a schematic diagram illustrating an example of transmitting common TA approximation coefficients repeatedly and more frequently than updating these common TA approximation coefficients. [Figure 15] FIG. 13 is a schematic diagram illustrating an example of transmitting a common TA approximation coefficient at the same frequency as updating the common TA approximation coefficient. [Figure 16] FIG. 13 is a schematic diagram illustrating an example of transmitting common TA approximation coefficients more frequently than they are updated without repeatedly transmitting these common TA approximation coefficients. [Figure 17] FIG. 1 illustrates an exemplary scenario Case 1 in which a common TA decision is evaluated. [Figure 18] FIG. 1 illustrates an exemplary scenario Case 2 in which a common TA decision is evaluated. [Figure 19A] FIG. 13 shows results for approximation error of case 1 and a linear approximation polynomial. [Figure 19B] FIG. 13 shows the results for case 1 and the approximation error of the quadratic approximation polynomial. [Figure 19C] FIG. 13 shows results for case 2 and the approximation error of the linear approximation polynomial. [Figure 19D] FIG. 13 shows the results for case 2 and the approximation error of the quadratic approximation polynomial. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0013] <5G NR system architecture and protocol stack> 3GPP is working on the next release of fifth-generation cellular technology (known simply as 5G), which includes the development of a new radio access technology (NR) that will operate in frequencies up to 100 GHz. The first version of the 5G standard will be completed at the end of 2017, which will allow smartphones compliant with the 5G NR standard to proceed to testing and commercial deployment.

[0014] In particular, the overall system architecture envisages an NG-RAN (Next Generation - Radio Access Network) with gNBs terminating NG radio access user plane (SDAP / PDCP / RLC / MAC / PHY) and control plane (RRC) protocols towards the UEs. The gNBs are interconnected with each other by an Xn interface. The gNBs are further connected to the NGC (Next Generation Core) by a Next Generation (NG) interface, more specifically to the AMF (Access and Mobility Management Function) (e.g. a specific core entity running the AMF) by an NG-C interface and to the UPF (User Plane Function) (e.g. a specific core entity running the UPF) by an NG-U interface. Figure 1 shows the architecture of an NG-RAN (see Section 4 of Non-Patent Document 2).

[0015] The user plane protocol stack in NR (see, for example, section 4.4.1 of 3GPP) includes the PDCP (Packet Data Convergence Protocol, see section 6.4 of 3GPP), RLC (Radio Link Control, see section 6.3 of 3GPP), and MAC (Medium Access Control, see section 6.2 of 3GPP), which are terminated in the gNB on the network side. In addition, a new sublayer of the access stratum (AS), SDAP (Service Data Adaptation Protocol), is introduced on top of the PDCP (see, for example, section 6.5 of 3GPP). A control plane protocol stack is also defined in NR (see, for example, section 4.4.2 of 3GPP). An overview of the functions of Layer 2 is given in section 6 of 3GPP. The functions of the RRC layer are given in section 7 of 3GPP.

[0016] The Medium Access Control (MAC) layer handles, for example, multiplexing of logical channels, and scheduling and scheduling-related functions (including handling of various numerologies).

[0017] The physical layer (PHY) is responsible for, for example, coding, PHY HARQ processing, modulation, multi-antenna processing, mapping of signals to appropriate physical time-frequency resources. Furthermore, the physical layer (PHY) handles mapping of transport channels to physical channels. The physical layer (PHY) provides services to the MAC layer in the form of transport channels. A physical channel corresponds to a set of time-frequency resources used for the transmission of a particular transport channel, and each transport channel is mapped to a corresponding physical channel. For example, the physical channels are PRACH (Physical Random Access Channel), PUSCH (Physical Uplink Shared Channel), and PUCCH (Physical Uplink Control Channel) for the uplink, and PDSCH (Physical Downlink Shared Channel), PDCCH (Physical Downlink Control Channel), and PBCH (Physical Broadcast Channel) for the downlink.

[0018] NR use cases / deployment scenarios include enhanced Mobile Broadband (eMBB), ultra-reliable and low latency communications (URLLC), and massive machine type communications (mMTC), which have diverse requirements in terms of data rates, latency, and coverage. For example, eMBB is expected to support peak data rates (20 Gbps downlink and 10 Gbps uplink) and user-perceived data rates that are on the order of three times higher than those offered by IMT-Advanced. In contrast, URLLC has more stringent requirements, including extremely low latency (user plane latency of 0.5 ms for uplink and downlink, respectively) and high reliability (1-10 Mbps within 1 ms). -5) is imposed. In addition, mMTC requires high connection density (1 km 2 1,000,000 devices per second), wide coverage in harsh environments, and extremely long battery life (15 years) to lower device costs may be desirable.

[0019] Thus, an OFDM numerology (e.g., subcarrier spacing, OFDM symbol duration, cyclic prefix (CP) duration, number of symbols per scheduling interval) suitable for one use case may not work well for another use case. For example, low latency services may preferably require a shorter symbol duration (and therefore a larger subcarrier spacing) and / or fewer symbols per scheduling interval (also referred to as TTI) than mMTC services. Furthermore, deployment scenarios with large channel delay spreads may preferably require a longer cyclic prefix (CP) duration than scenarios with small delay spreads. To maintain a similar cyclic prefix (CP) overhead, the subcarrier spacing should be optimized depending on the delay spread. In NR, more than one value of subcarrier spacing may be supported. Thus, currently, subcarrier spacings of 15 kHz, 30 kHz, 60 kHz, ... are considered. Symbol duration T u and the subcarrier spacing Δf is expressed by the formula Δf=1 / T u As in LTE systems, the term "resource element" can be used to denote the smallest resource unit consisting of one subcarrier for the length of one OFDM / SC-FDMA symbol.

[0020] In the new radio system 5G NR, for each numerology and carrier, a resource grid of subcarriers and OFDM symbols is defined for each of the uplink and downlink. Each element in the resource grid is called a resource element and is identified based on the frequency index in the frequency domain and the symbol position in the time domain (see, for example, section 4 of Non-Patent Document 3). For example, uplink and downlink transmissions are organized into frames with a duration of 10 ms, and each frame is composed of 10 subframes with a duration of 1 ms each. In the implementation of 5G NR, the number of consecutive OFDM symbols per subframe depends on the setting of the subcarrier spacing. For example, when the subcarrier spacing is 15 kHz, one subframe has 14 OFDM symbols (similar to an LTE-compliant implementation assuming a normal cyclic prefix). On the other hand, when the subcarrier spacing is 30 kHz, the subframe has two slots, and each slot contains 14 OFDM symbols.

[0021] <Split of 5G NR Functions between NG-RAN and 5GC> Figure 2 shows the split of functions between NG-RAN and 5GC. The logical nodes of NG-RAN are gNB or ng-eNB. The logical nodes of 5GC are AMF, UPF, and SMF.

[0022] gNB and ng-eNB handle the following main functions in particular. - Functions of radio resource management such as radio bearer control, radio admission control, connection mobility control, and dynamic resource allocation (scheduling) to the UE in both the uplink and downlink directions - IP header compression, encryption, and data integrity protection - Selection of AMF at UE attach time when routing to AMF cannot be determined from information provided by the UE - Routing user plane data to the UPF - Routing control plane information to AMF - Establishing and releasing connections - Scheduling and sending paging messages - Scheduling and transmission of system broadcast information (from AMF or OAM) - Configuring measurements and measurement reporting for mobility and scheduling - Transport-level packet marking in the uplink - Session Management - Network slicing support - QoS flow management and mapping to data radio bearers - Support for UEs in RRC_INACTIVE state - NAS message delivery function - Wireless Access Network Sharing - Dual Connection - Tight interworking between NR and E-UTRA

[0023] The Access and Mobility Management Function (AMF) handles the following main functions: - Termination of Non-Access Stratum (NAS) signalling - NAS signaling security - Access Stratum (AS) security control - Core Network (CN) inter-node signaling for mobility between 3GPP access networks - Idle mode UE reachability (including control and execution of paging retransmissions) - Registration Area Management - Support for intra-system and inter-system mobility - Access Authentication - Access authentication, including roaming rights checks - Mobility management controls (subscriptions and policies) - Network slicing support - Selection of Session Management Function (SMF)

[0024] In addition, the User Plane Function (UPF) handles the following main functions: - Anchor points for intra-RAT / inter-RAT mobility (when applicable) - External PDU session points for interconnection with data networks - Packet routing and forwarding - User plane part of packet inspection and policy rule enforcement - Traffic usage reports - An uplink classifier to support routing of traffic flows to the data network. - Branching points to support multi-homed PDU sessions - User plane QoS processing (e.g. packet filtering, gating, UL / DL rate enforcement) - Validation of uplink traffic (mapping of SDF to QoS flows) - Buffering of downlink packets and triggering of downlink data notifications

[0025] Finally, the Session Management Function (SMF) handles the following major functions:

[0026] - Session Management - UE IP address allocation and management - UP function selection and control - Configuration of traffic steering in the user plane function (UPF) for routing traffic to the correct destination - Policy enforcement and QoS control part - Downlink data notification

[0027] <Procedures for establishment and reconfiguration of RRC connection> Figure 3 shows some interactions between the UE, gNB, and AMF (5GC entity) when the UE transitions from RRC_IDLE to RRC_CONNECTED in the NAS part (see Non-Patent Document 2).

[0028] RRC is the upper layer signaling (protocol) used for the configuration of the UE and gNB. In particular, in this transition, the AMF creates UE context data (including, for example, PDU session context, security keys, UE radio capabilities, UE security capabilities, etc.) and sends it to the gNB by means of an Initial Context Setup Request. Next, the gNB activates AS security with the UE, which is performed by the gNB sending a SecurityModeCommand message to the UE and the UE responding to the gNB with a SecurityModeComplete message. Thereafter, the gNB performs reconfiguration to establish signaling radio bearer 2 (SRB2) and data radio bearer (DRB), which is by the gNB sending an RRCReconfiguration message to the UE and the gNB receiving an RRCReconfigurationComplete from the UE in response. In the case of a signaling-only connection, since SRB2 and DRB are not established, these steps related to RRCReconfiguration are skipped. Finally, the gNB notifies the AMF by means of an Initial Context Setup Response that the establishment procedure has been completed.

[0029] Therefore, the present disclosure provides a 5th Generation Core (5GC) entity (e.g., AMF, SMF, etc.), comprising: a control circuit for establishing a next generation (NG) connection with a gNodeB in operation; and a transmitter for transmitting an initial context setup message to the gNodeB via the NG connection to establish a signaling radio bearer between the gNodeB and a user equipment (UE) in operation. Specifically, the gNodeB transmits Radio Resource Control (RRC) signaling including an information element (IE) of resource allocation configuration to the UE via the signaling radio bearer. The UE performs uplink transmission or downlink reception based on the resource allocation configuration.

[0030] <IMT usage scenarios after 2020> Figure 4 shows some of the use cases for 5G NR. The 3GPP (3rd Generation Partnership Project) New Radio (3GPP NR) considers three envisioned use cases to support various services and applications with IMT-2020. The specifications for Phase 1 of Enhanced Mobile Broadband (eMBB) have been finalized. Current and upcoming work includes the standardization of Ultra-Reliable and Low-Latency Communications (URLLC) and Large-Scale Machine-Type Communications, in addition to further extending support for eMBB. Figure 4 shows some examples of envisioned usage scenarios for IMT beyond 2020 (see, for example, Figure 2 in Non-Patent Document 4).

[0031] URLLC use cases have stringent requirements on capabilities such as throughput, latency and availability, and are envisioned as one of the enablers of future vertical applications such as wireless control of industrial manufacturing and production processes, remote medical surgery, power distribution automation in smart grids, and transportation safety. URLLC's ultra-high reliability is supported by identifying technologies to meet the requirements set by NR URLLC in Release 15. For NR URLLC in Release 15, the main requirements include a target user plane latency of 0.5 ms on the UL (uplink) and 0.5 ms on the DL (downlink). The general URLLC requirement for a single transmission of a packet is a BLER (block error rate) of 1E-5 for a packet size of 32 bytes with a user plane latency of 1 ms.

[0032] From a physical layer perspective, there are several possible ways to improve reliability. Current scope for improving reliability includes the definition of a separate CQI table for URLLC, more compact DCI formats, PDCCH repetition, etc. However, as NR becomes more stable and developed (for a key requirement of NR URLLC), the scope for achieving ultra-high reliability may increase. Specific use cases for NR URLLC in Release 15 include augmented reality / virtual reality (AR / VR), eHealth, eSafety, and mission-critical applications.

[0033] Furthermore, technology enhancements targeted by NR URLLC target latency improvement and reliability improvement. Technology enhancements for latency improvement include configurable numerology, non-slot-based scheduling with flexible mapping, grant-free (configured grant) uplink, slot-level repetition of data channel, and preemption for downlink. Preemption means that a transmission for which resources are already allocated is aborted and the already allocated resources are used for another transmission with smaller latency / higher priority requirement requested later. Thus, an already granted transmission is preempted by a later transmission. Preemption applies regardless of service type. For example, a transmission of service type A (URLLC) can be preempted by a transmission of service type B (eMBB, etc.). Technology enhancements related to reliability improvement include dedicated CQI / MCS tables for a target BLER of 1E-5.

[0034] The mMTC (Massive Machine Type Communication) use case is characterized by a very large number of connected devices transmitting relatively small amounts of data that are generally not sensitive to latency. The devices are required to be low cost and have extremely long battery life. From an NR perspective, utilizing very narrow bandwidth portions is one possible solution to achieve power saving from the UE perspective to enable long battery life.

[0035] As mentioned above, it is expected that the scope of reliability in NR will expand. One key requirement for all cases, especially for URLLC and mMTC, is high or ultra-high reliability. Several mechanisms can be considered to improve reliability from a radio perspective and from a network perspective. In general, there are several key areas that can help improve reliability. These areas include compact control channel information, data channel / control channel repetition, diversity related to frequency domain, time domain, and / or spatial domain. These areas are generally applicable to reliability, regardless of the specific communication scenario.

[0036] For NR URLLC, further use cases with more stringent requirements have been identified, such as factory automation, transportation, and power distribution. The more stringent requirements include higher reliability (up to 10 times faster) depending on the use case. -6 These include: high-speed, low latency, high-speed (high-speed), higher availability, packet sizes up to 256 bytes, time synchronization to the order of a few microseconds (values ​​range from 1 μs to a few μs depending on the frequency range), and low latency in the order of 0.5-1 ms, with a target user plane latency of 0.5 ms in particular.

[0037] Furthermore, for NR URLLC, several technical enhancements have been identified from the physical layer perspective. In particular, enhancements related to the PDCCH (Physical Downlink Control Channel) include compact DCI, PDCCH repetition, and increased PDCCH monitoring. Also, enhancements related to the UCI (Uplink Control Information) include HARQ (Hybrid Automatic Repeat Request) enhancements and CSI feedback enhancements. Also, PUSCH enhancements related to minislot level hopping and retransmission / repetition enhancements have been recognized. The term "minislot" refers to a TTI (Transmission Time Interval) that contains fewer symbols than a slot (a slot contains 14 symbols).

[0038] <QoS Control> The 5G QoS (Quality of Service) model is based on QoS flows and supports both QoS flows that require a guaranteed flow bit rate (GBR QoS flows) and QoS flows that do not require a guaranteed flow bit rate (non-GBR QoS flows). Therefore, at the NAS level, a QoS flow is the finest granularity of QoS differentiation in a PDU session. A QoS flow is identified within a PDU session by a QoS flow ID (QFI) that is conveyed in the encapsulation header through the NG-U interface.

[0039] The 5GC establishes one or more PDU sessions per UE. The NG-RAN can establish at least one data radio bearer (DRB) per UE together with the PDU session and then configure additional DRBs for the QoS flows of that PDU session as described above, for example with reference to Figure 3 (when to configure is determined by the NG-RAN). The NG-RAN maps packets belonging to different PDU sessions to different DRBs. UL and DL packets are associated with QoS flows by NAS-level packet filters in the UE and 5GC, and UL and DL QoS flows are associated with DRBs by AS-level mapping rules in the UE and NG-RAN.

[0040] FIG. 5 shows the non-roaming reference architecture of 5G NR (see section 4.2.3 of 3GPP 5). Application Functions (AFs) (e.g., external application servers handling 5G services exemplarily described in FIG. 4) interact with the 3GPP core network to provide services. For example, they support application influence on traffic routing, access Network Exposure Functions (NEFs), and interact with a policy framework (see Policy Control Function (PCF)) for policy control (e.g., QoS control). Based on the operator's deployment, application functions (AFs) that are considered trusted by the operator can be allowed to interact directly with the relevant network functions (Network Functions). Application functions (AFs) that are not allowed by the operator to directly access network functions interact with the relevant network functions using an external exposure framework via the NEF.

[0041] Figure 5 shows further functional units of the 5G architecture: Network Slice Selection Function (NSSF), Network Repository Function (NRF), Unified Data Management (UDM), Authentication Server Function (AUSF), Access and Mobility Management Function (AMF), Session Management Function (SMF), and Data Network (DN) (e.g. operator's services, internet access, or third-party services). All or part of the core network functions and application services may be located and executed in a cloud computing environment.

[0042] Thus, in the present disclosure, an application server (e.g., an AF in a 5G architecture) is provided that includes a transmitter and a control circuit, wherein the transmitter, during operation, sends a request including QoS requirements for at least one of a URLLC service, an eMBB service, and an mMTC service to at least one of the 5GC functions (e.g., NEF, AMF, SMF, PCF, UPF, etc.) and establishes a PDU session including a radio bearer between a gNodeB and a UE in accordance with the QoS requirements, and the control circuit, during operation, performs the service using the established PDU session.

[0043] <Send system information> System information is downlink broadcast information periodically sent by the base station (gNB in ​​5G, network node in general). System information contains information for the UE to establish a connection with the base station. In 5G, the UE reads system information for cell camping at power on and for cell selection and reselection in RRC_IDLE mode. System information provides all the details required to access the network, such as system frame number, system bandwidth, PLMN, cell selection and reselection thresholds.

[0044] The system information consists of the Master Information Block (MIB) and the System Information Block (SIB). The SIB contains various information. Of relevance in this disclosure is the information related to NTN transmission, which will be explained later. The MIB information is broadcast over the BCH and PBCH channels, while the SIB is transmitted over the DL-SCH and PDSCH channels.

[0045] In general, system information may be transmitted periodically (so that newly connecting terminals can obtain the information) or on-demand. The periodic schedule of system information transmission can be configured by RRC. In particular, SIB1 (referenced by the MIB) conveys scheduling information specifying, for example, the system information window (repetition period of the system information transmission pattern), some transmission parameters (e.g. physical layer parameters) for receiving the system information, and the mapping (transmission pattern) of the SIBs within the system information window.

[0046] <Non-terrestrial network, NTN> NTNs can facilitate the deployment of NR services in unserved areas (e.g., isolated or remote areas, on aircraft or ships) and unserved regions (e.g., suburban and rural areas) that cannot be covered by terrestrial NR networks, due to their wide service coverage capabilities and the reduced vulnerability of spacecraft / aircraft to physical attacks and natural disasters. Furthermore, NTNs can enhance the reliability of NR services by providing service continuity to passengers on moving platforms or ensuring the availability of services at any location, especially for critical communications.

[0047] The benefits relate to either standalone non-terrestrial networks or integrated terrestrial and non-terrestrial networks and may impact coverage, user bandwidth, system capacity, service reliability or availability.

[0048] A non-terrestrial network refers to a network or a segment of a network that uses RF resources onboard a satellite, for example. NTNs are typically characterized by the following system elements: NTN terminals (3GPP UEs, or terminals specific to the satellite system if the satellite does not directly serve 3GPP UEs), service links, which refer to the radio links between user equipment and space / air platforms, airborne platforms carrying payloads, gateways connecting the space / air platforms to the core network, and feeder links, which refer to the radio links between the gateways and the space / air platforms.

[0049] In 3GPP, NR-based operation in non-terrestrial networks (NTN) has been considered and described (see, for example, non-patent document 6 and non-patent document 7).

[0050] A non-terrestrial network (NTN) refers to a network, or a segment of a network, that uses RF resources on board an airborne or spacecraft for transmission, such as:

[0051] · Spacecraft: Satellites (including Low Earth Orbiting (LEO) satellites, Medium Earth Orbiting (MEO) satellites, Geostationary Earth Orbiting (GEO) satellites, and Highly Elliptical Orbiting (HEO) satellites) Aerial Vehicles: High Altitude Platforms (HAPs) encompassing Unmanned Aircraft Systems (UAS), including Lighter than Air (LTA) and Heavier than Air (HTA), all of which are typically operated quasi-stationarily at altitudes between 8 and 50 km.

[0052] For example, a UAS or satellite platform is connected to the 5G network through one or more gateways linked to a data network. The NTN may comprise the following system elements: an NTN-enabled terminal (referring to a 3GPP UE, or a terminal specific to the satellite system if the satellite does not directly serve the 3GPP UE), a service link referring to a radio link between the user equipment and the space / air platform, an air platform carrying a payload, a gateway connecting the space / air platform to the core network, and a feeder link referring to a radio link between the gateway center space / air platform. The platform may implement either transparent or regenerative payload transmission and has the following exemplary characteristics:

[0053] In a transparent repeater payload, the platform acts as a repeater by filtering, converting and amplifying the wave signal, but the payload is left unchanged. In a regenerative payload, the platform has some or all of the functions of a base station. The platform can perform radio frequency filtering, conversion, and amplification, as well as demodulation / modulation, switching / routing, and encoding / decoding. · Inter-Satellite Links (ISLs) can optionally be used to form satellite constellations. ISLs (Inter-Satellite Links) are transport links between satellites.

[0054] Figure 6 shows a scenario of a non-terrestrial network where the transmission between terminals (UEs) is performed via a remote radio unit including a satellite and an NTN gateway. A gNB is located in the gateway as a scheduling device. The satellite payload implements frequency conversion and radio frequency amplifiers in both uplink and downlink directions. Thus, the satellite repeats the NR radio interface from the feeder link (between the NTN gateway and the satellite) to the service link (between the satellite and the UE) and vice versa. The satellite radio interface (SRI) of the feeder link is NR-Uu. In other words, the satellite does not terminate the NR-Uu. A satellite with such a configuration is called a transparent relay satellite.

[0055] Figure 7 shows a scenario of a non-terrestrial network, where the transmission between terminals (UEs) is via a satellite with a gNB as a scheduling device. A satellite in this configuration is called a regenerative satellite. According to an exemplary implementation (see section 5.2 of Non-Patent Document 8), the NG-RAN logical architecture described in Non-Patent Document 9 is used as a baseline for the NTN scenario. The satellite payload implements the regeneration of the signal received from the Earth. The NR-Uu radio interface is on the service link between the UE and the satellite. The Satellite Radio Interface (SRI) is on the feeder link between the NTN Gateway and the satellite. The SRI (Satellite Radio Interface) is the transport link between the NTN GW and the satellite.

[0056] Figure 8 illustrates an exemplary scenario in which three UEs (UE1, UE2, UE3) are served by a satellite S1, which communicates via a feeder link with a gNB and an NTN gateway, and via an inter-satellite link (ISL) with another nearby satellite S2.

[0057] There are different types of satellites that provide communications, such as low Earth orbit (LEO) satellites or geosynchronous equatorial orbit (GEO) satellites (also called geostationary satellites). Geostationary satellites move at the same angular velocity as the Earth and orbit along an orbit parallel to the Earth's rotation, so they appear fixed and cover a specific geographic area. From the ground, GEO satellites appear to be stationary. LEO satellites rotate at altitudes between 160 and 2000 kilometers (99 and 1200 miles). A constellation of LEO satellites can provide continuous full-earth coverage as the satellites move. Unlike GEO satellites, LEO satellites fly at a much faster pace because they are closer to the Earth.

[0058] GEO satellites have many uses, including weather forecasting, satellite radio, and television. However, because GEO satellites orbit at such a high altitude, there is a long latency period for signals to travel to and from these satellites. For this reason, many important communications are handled through LEO satellite networks, which provide a faster connection without wires or cables.

[0059] However, in general, in an NTN, there can be many different types of platforms, including not only satellites but also UAS (Unmanned Aerial System) platforms, examples of which are shown in Table 1 (corresponding to Table 4.1-1 in Non-Patent Document 7, see also Section 4.1 "Non-Terrestrial Networks overview" in Non-Patent Document 7). [Table 1]

[0060] For LEO, MEO, and HEO satellites, the satellite beams corresponding to the cells or PCI (Physical Cell ID) or SSB (Synchronization Signal Block) beams of the NR radio system may move around the Earth since they are not fixed in position relative to a given point on the Earth.

[0061] NTN scenarios that provide cells that move continuously over the Earth (e.g., LEO-based, MEO-based, HEO-based NTNs) are called Earth-moving cell scenarios. The continuous movement of cells over the Earth is due to the motion of the satellite beams being fixed relative to the NTN platform. Thus, the footprint of some satellite beams or a cell corresponding to one satellite beam moves over the Earth's surface with the motion of the NTN platform (e.g., LEO satellites).

[0062] Information about the satellites' orbits is contained in ephemeris data (or "satellite ephemeris data"). There are various ways to represent ephemeris data, one possible way is to use orbital parameters such as semi-major axis, eccentricity, inclination, right ascension of ascending node, argument of periapsis, mean anomaly at a reference point in time, and epoch. The first five parameters allow to determine the orbital plane (orbital plane parameters), and the remaining two parameters are used to determine the exact satellite position at a point in time (satellite level parameters). Orbital plane parameters and satellite level parameters are exemplified in 3GPP TS 2010-01-13, section 7.3.6.1 "Representation of Complete Ephemeris Data". Another option is to provide the satellite's position coordinates (x,y,z), velocity vector (vx,vy,vz), and time reference point. [Table 2]

[0063] In an NTN system, several satellites may share a common orbital plane. In such cases, to reduce the amount of data, some ephemeris data may be provided for an orbital plane instead of for a single satellite. The ephemeris data per orbital plane may be stored in the UE or in the Subscriber Identity Module (SIM) of the UE. However, in networks with a large number of satellites, the size of the ephemeris data may become significant. Therefore, instead of storing the ephemeris data, the ephemeris data may be at least partially transmitted from the gNB.

[0064] For example, satellite-level orbital parameters of all satellites that may serve the UE may be stored in the UE or SIM, and the ephemeris data of each satellite is linked to a satellite ID or satellite index. In this case, the satellite ID or satellite index of the serving satellite may be broadcast in the system information so that the UE can find the corresponding ephemeris data in the UE's SIM or storage device. Alternatively, the satellite-level orbital parameters of the serving satellite may be broadcast in the system information, and the UE derives the position coordinates of the serving satellite. Ephemeris data of neighboring satellites may also be provided to the UE via system information or dedicated RRC signaling. If the reference orbital plane parameters are provided to the UE or SIM, it is sufficient to broadcast the average anomaly value of the reference time instant, which can reduce the overhead of having to broadcast epochs to the UE.

[0065] <NTNにおけるタイミングアドバンス> In 3GPP, a Release 17 work item to support non-terrestrial based networks (NTN) is still in progress (see for example 3GPP 10). NTN scenarios are characterized by long propagation delays, which the UE needs to take into account in its timing advance when transmitting in the uplink. Timing Advance (TA) is a delay used to control the uplink transmission timing of an individual UE. Timing Advance (TA) helps to ensure that uplink transmissions from all UEs are synchronized when received by the base station (network node). Already in terrestrial based systems, the timing advance applied at the UE is transmitted from the network node to the specific UE.

[0066] The transmission chain of the NTN is divided into two segments: between the gateway and the satellite (the feeder link) and between the satellite and the UE (the service link). The delay in the feeder link is called the "common delay" because it is the same for any UE (see, for example, UE1, UE2, and UE3 in Figure 8) served by the same NTN entity (e.g., satellite S1). The delay in the feeder link is called the "UE-specific delay" because the UEs may be in different locations and may vary from UE to UE.

[0067] In order to avoid revealing the physical location of the network node (gNB) to the UE, 3GPP RAN1 decided to signal the feeder link delay as a common timing advance value, especially in the architecture shown in Figure 6 (see 3GPP RAN1, section 6.3.4 of 3GPP RFC3236-2).

[0068] Autonomous acquisition of the service link TA in the UE is possible using the known position of the UE and satellite ephemeris. The UE's own position is generally available to the UE, especially if it can be assumed that the UE has access to a positioning system, e.g. a Global Navigation Satellite System (GNSS) such as the global positioning system (GPS). Ephemeris data can be made available to the UE (stored in the SIM and / or obtained from system information signaling, etc.) as mentioned in some examples above.

[0069] However, in general, the present disclosure is not limited to determining the TA component of the serving link completely autonomously. Rather, obtaining the serving link TA component may be assisted by signaling UE-specific information to a particular UE. A common TA refers to a common component of propagation delay shared by all UEs within the coverage of the same satellite beam / cell, and may be broadcast by the network for each satellite beam / cell. This calculation of the common TA is performed by the network assuming at least one reference point for each satellite beam / cell.

[0070] In other words, in the exemplary scenario, the UE is assumed to be GNSS-enabled, so the UE autonomously calculates its own delays. The UE calculates the feeder link delays based on a common TA polynomial. The sum of these delays provides the UE with the timing advance value to be applied to the UL transmission.

[0071] However, it turns out that the feeder link delay can vary over time, especially for fast moving LEO satellites. Thus, a single value representing the common TA can result in large approximation errors or require very frequent SIB updates. To reflect the changes over time, the common TA can be represented (approximated), for example, as a polynomial.

[0072] For 5G-NTN, methods of signaling TA have been discussed in RAN1 (3GPP's Radio Access Network Working Group 1). For example, a common TA can be approximated by a polynomial over a certain interval (herein called validity interval) and the coefficients of the polynomial can be transmitted from a network node to one or more UEs. Since the coefficients are common to UEs served by the same NTN entity (e.g. satellite), the coefficients can be transmitted by broadcast. The UE then calculates the feeder link delay based on the polynomial defined by the received coefficients for the common TA.

[0073] One possibility is to use the Taylor series, known in mathematical analysis as a tool for expressing a function in a neighborhood of a point as a sum of its derivatives, as a specific kind of polynomial. In particular, a Taylor series expresses a function f(t) in a neighborhood of a time instance t0 in terms of its derivatives f(t0), f'(t0), f''(t0), etc., as follows:

number

[0074] In this case, for example, the gNB (network node) is TA,common (t0), N' TA,common (t0), N'' TA,common (t0), etc., and the UE signals N TA,common (t) may be calculated. The signaled coefficients may correspond to the respective found derivatives f(t0), f'(t0), f''(t0), etc.

[0075] The drawback of this approach is that the Taylor series only accurately approximates the function of interest at one point, "t0". For example, a linear approximation of a quadratic function can have problems near the point where the function rises. In such a case, the linear equation may, for example, point down while the actual function rises. Figures 9A and 9B show this simplified scenario of approximating a quadratic function by a linear function.

[0076] A simple quadratic function f(t)=(t-1.1) 2 We want to linearly approximate this function in the interval (t0,t0+h)=(1,2) shown by the vertical dotted and dashed lines. The Taylor series is as follows:

number

[0077] The Taylor series approximates the objective function at an inopportune time (t0=1) when the slope of f(t) becomes negative, even though the function f(t) itself rises within the interval (1,2).

[0078] 9B shows the absolute approximation error 910 between the function of interest and the Taylor series polynomial. As can be seen, the Taylor series approximation error 910 grows unconstrained during the considered time interval (1,2).

[0079] There are two possible ways to reduce the approximation error of the Taylor series. - Decrease the update interval, and / or - Include higher order coefficients

[0080] However, both of these approaches result in increased overhead that may be undesirable for some applications.

[0081] <Embodiment> To limit the approximation error, in one embodiment, the approximation of the common timing advance is based on a polynomial whose coefficients are designed to minimize the maximum approximation error in a given time interval, the approximation error being given by the absolute value of the difference between the polynomial and the actual common TA value.

[0082] In the following, UEs, base stations, and procedures that meet these needs are described for new radio access technologies envisioned for 5G mobile communication systems, but can also be used in LTE mobile communication systems. A number of different implementations and variations are also described. The following disclosure is prompted by, and may be based, for example, at least in part on, the discussion and findings above.

[0083] In general, it should be noted that many assumptions are made herein to explain the principles underlying the present disclosure in a clear, concise, and easy-to-understand manner. However, it should be understood that these assumptions are merely examples made herein for the purpose of explanation and are not intended to limit the scope of the present disclosure. Those skilled in the art will recognize that the principles of the following disclosure and the principles described in the claims can be applied in different scenarios and in ways not explicitly described herein.

[0084] Furthermore, although the specific terminology used in the context of new radio access technologies for the upcoming 3GPP 5G communication system has not yet been fully determined or may eventually change, some of the terms such as procedures, entities, layers, etc. used below are closely related to the terminology used in the LTE / LTE-A system or in the current 3GPP 5G standardization. Thus, the terminology may change in the future, but without affecting the functionality of the embodiments. Therefore, it will be recognized by those skilled in the art that the embodiments and their scope of protection are not limited to the specific terms used illustratively herein due to the absence of newer or finally agreed terminology, but should be understood more broadly in terms of the functions and concepts underlying the functions and principles of the present disclosure.

[0085] For example, a mobile station, mobile node, user terminal, user device, or user equipment (UE) is a physical entity (physical node) in a communication network. A node may have several functional entities. A functional entity refers to a software or hardware module that implements a given set of functions and / or provides a given set of functions to other functional entities of the same node or another node or network. A node may have one or more interfaces that attach it to a communication facility or medium through which it can communicate. Similarly, a network entity may have logical interfaces that attach a functional entity to a communication facility or medium through which it can communicate with another functional entity or a corresponding node.

[0086] The term "base station" or "radio base station" in this specification refers to a physical entity in a communication network. Similar to a mobile station, a base station may have several functional entities. A functional entity refers to a software or hardware module that implements a given set of functions and / or provides a given set of functions to other functional entities of the same node or another node or network. A physical entity performs several control tasks for communication devices, including one or more of scheduling and configuration. It should be noted that the base station functions and communication device functions may be integrated in a single device. For example, a mobile terminal may also perform the base station functions for other terminals. The terminology used in LTE is eNB (or eNodeB) and the terminology currently used in 5G NR is gNB.

[0087] The term non-terrestrial network (NTN) entity can be broadly understood as an entity of a non-terrestrial network, such as a space vehicle or an airborne vehicle, as introduced in the above section on NTNs. In the following, only satellites are considered as examples of such NTN entities, although it is clear that other examples of NTN entities are also covered.

[0088] In the following embodiments, it is exemplarily assumed that the improved timing advance determination is performed as part of the data transmission between the UE and the network node via the NTN entity (e.g., satellite). The term network node refers to a base station (e.g., gNB) as in FIG. 6, or another entity with an interface to the core network (CN), such as the NTN gateway shown in FIG. 7. In the following, the already introduced scenario of FIG. 8 can be exemplarily referred to. For the sake of simplicity, it is exemplarily assumed that the gateway and the gNB (forming the network node) are co-located, so that in the following description, the gateway and the gNB (base station) are not physically and logically separated. Therefore, in the following, the improved timing advance determination is described as being performed between the UE, the NTN entity, and the gNB, without specifically mentioning that the gateway is located between the NTN entity and the gNB, or is integrated in the gNB.

[0089] FIG. 10 shows a general and simplified exemplary block diagram of a user equipment 110 (also referred to as a communication device) and a scheduling device 160 (here assumed to be exemplarily located in a base station, e.g., an eLTE eNB (alternatively referred to as an ng-eNB) or a gNB in ​​5G NR). The UE 110 and the eNB / gNB 160 communicate with each other via (radio) physical channels, respectively, using transceivers. The communication is indicated by the arrow 150. Furthermore, the NTN entity may have the same or similar structure as the scheduling device, e.g. including a transceiver and processing circuitry. Thus, the UE 110 and the gNB 160 are part of the communication system 100.

[0090] Both the device 110 and the device 160 may include a transceiver 120, 170 and a processing circuit 130, 180. The transceiver 120, 170 may include and / or function as a receiver and a transmitter. The processing circuit 130, 180 may be one or more hardware such as one or more processors or any LSI. There is an input / output point (or node) between the transceiver and the processing circuit, and the processing circuit may control the transceiver during operation, i.e., control the receiver and / or the transmitter, and exchange receive / transmit data through the input / output point (or node). The transceiver may include an RF (radio frequency) front, including one or more antennas, amplifiers, RF modulators / demodulators, etc., as a transmitter and a receiver. The processing circuit may perform control tasks such as controlling the transceiver to transmit user data and control data provided by the processing circuit and / or receiving user data and control data that are further processed by the processing circuit. The processing circuitry may also be responsible for performing other operations such as judging, determining, calculating, measuring, etc. The transmitter may be responsible for performing transmitting and other related operations. The receiver may be responsible for receiving and other related operations such as monitoring the channel.

[0091] In the following, various implementations of the improved transmission procedure are described. In this connection, improved entities, such as an improved UE, an improved NTN entity, and an improved base station, that participate in the improved transmission procedure are presented. Corresponding methods for the operation of the UE, the NTN entity, and the BS are also provided.

[0092] According to an embodiment, a network node is provided. The network node may have a structure similar to that shown in Fig. 10. The network node 160 comprises a processing circuit 180 and a transceiver 170. The processing circuit 180 in this embodiment is configured to determine coefficients of a polynomial approximating a timing advance component between the network node and the satellite so as to minimize an approximation error for a validity interval. The approximation error is specified at a number of time instances of the validity interval relative to a reference time instance. The transceiver 170 then transmits the determined coefficients.

[0093] The validity interval can be determined by the network node before determining the coefficients (i.e. pre-determined) and can be indicated to the UE together with the coefficients. It is also possible to indicate the validity interval separately from the coefficients (possibly less frequently than signaling the coefficients). Such an approach allows to control the accuracy of the approximation depending on, for example, the actual behavior of the timing advance. However, it is also conceivable to provide a predefined (fixed) validity interval, for example in a standard, without allowing it to be configured by signaling. The present disclosure is not limited to a particular way of obtaining the validity interval in the network node and / or user device. An approximation employing a minimization of the maximum error within any validity interval can improve the efficiency of the timing advance signaling.

[0094] In general, the timing advance between the network and the UE may be defined by correction components such as a feeder link delay, a service link delay, and possibly a network controlled delay. The polynomial approximation described above is applied in relation to the feeder link portion (i.e., between the network and the satellite). This disclosure is not limited to any particular technique for determining and / or signaling the service link delay or the network controlled delay.

[0095] Apart from selecting an appropriate validity interval length, the approximation error can be further controlled by selecting the degree of the polynomial and the number of time instances in the multiple time instances: the higher the degree of the polynomial and the greater the number of time instances over which the minimization of the maximum error is performed, the more accurate the approximation can be.

[0096] As will be explained in more detail later, the reference time instance may be determined by the network node and the user device in the same way relative to some system timing parameters, so that no additional signaling may be required. However, in some implementations, it may be advantageous to explicitly signal the reference time instance from the network node to the user device. The validity interval (and the multiple time instances therein) is determined (specified) relative to the reference time instance. The reference time instance in some embodiments may start the validity interval and may be the first time instance among the multiple time instances of the validity interval. However, the present disclosure is not limited to such a relationship between the reference time instance and the validity interval. In general, any other pre-configured relative position of the reference time instance and the validity interval may be supported.

[0097] It should be noted that the functionality of the above network nodes may be incorporated on an integrated circuit that corresponds functionally to the processing circuit 180 described above. Such processing circuitry controls a transmitter to transmit and / or receive. For example, the circuitry 180 may control a transceiver (such as the transceiver 170) to transmit the determined coefficients. Here, transmitting the coefficients generally means communicating the coefficients from the network node to one or more user devices. The coefficients may be represented in any manner, for example, as coded coefficients relative to each other or to past coefficients, or in any representation that allows a receiving user device to recover the coefficients and use them to define a polynomial. The common TA components may be transmitted by broadcast, such as system information broadcast by the network node or NTN entity, since they are common to one or more devices served by the same NTN entity (e.g., satellite). In the example of FIG. 6, for example, the gNB may transmit the coefficients (via the NTN entity) along with further information in a system information block (SIB) defined in the RRC protocol.

[0098] Corresponding to the above-mentioned network node 160, a user device 110 (e.g. as in FIG. 10) is provided. The user device 110 comprises a transceiver 120 and a processing circuit 130. The transceiver 120 may be configured (e.g. controlled by the processing circuit 130) to receive coefficients of a polynomial from a network node (e.g. the above-mentioned network node 160). The processing circuit 130 is configured to determine a timing advance for a validity interval for transmitting data to the network node via a satellite based on the polynomial. The polynomial approximates a timing advance component between the network node and the satellite so as to minimize an approximation error. The approximation error is specified at a number of time instances of the validity interval relative to a reference time instance. The transceiver 120 is further configured to transmit data using the determined timing advance.

[0099] Here, data means any kind of data, such as payload and / or control data. The functions of the network node may be implemented by an integrated circuit. Such an integrated circuit (similar to that described with reference to the network node above) need not implement a transceiver. However, the processing circuit may have a corresponding interface, such as the input / output node of FIG. 10, via which the processing circuit may control the transceiver to receive and / or transmit data.

[0100] As mentioned above, the use of approximate calculations of timing advance in network nodes and user devices can provide the advantage of reduced errors, thus improving quality and enabling more efficient utilization of system resources.

[0101] In an example implementation (of a network node, a user device, a corresponding integrated circuit, or a method), the polynomial p(t) above has the following form:

number

[0102] where c0,...,c n are the coefficients of the polynomial, n is a predefined positive integer degree of the polynomial, t ref is a reference time instance.

[0103] The present disclosure is not limited to a particular technique for minimizing the maximum error. However, for practical implementation reasons, the error may be considered (sampled) only at multiple discrete time instances of the validity interval. Note that the validity interval is the time interval during which a common TA is approximated and thus a particular set of coefficients of the polynomial is valid. This validity interval may correspond to an update interval during which the network signals (broadcasts) a particular set of coefficients to the user devices. Update in this specification refers to obtaining a new set of coefficients for the next validity interval.

[0104] For example, the coefficients of the polynomial may be determined by forcing the sign of the approximation error to alternate at multiple time instances.

[0105] In an exemplary implementation, the polynomial coefficients are determined by solving:

number

[0106] Here, p(t i ) is the time instance t i where i is an integer index of a time instance among a number of equidistant time instances, E is a measure of the approximation error, and N TA,common (t i ) at time instance t i The actual timing advance component between the network node and the satellite (or generally the NTN entity) at time instance t is determined by the network node based on the location of the network node and the location of the satellite. i The number of is greater than the degree of the polynomial.

[0107] Thus, in this particular example optimization, the approximation error oscillates between -E and +E. This is due to the term (-1) i However, this oscillation can be achieved in different ways, e.g. (-1) i+1 Or it can be implemented in other ways. Moreover, E is the same for all time instances. E is solved for as a variable with the coefficients of the polynomial p. It may be advantageous to choose the number of time instances equal to the degree of the polynomial plus 2. In this way, a full-rank system of equations is obtained, which can be solved by well-known techniques for solving (computing) systems of linear equations.

[0108] The design of coefficients c0, c1, c2, etc. is done by multiple sampling points t within the valid (update) interval h. i ∈(t ref ,t ref In this example implementation, we start by selecting t ref is the start of the valid interval. At these sampling points, the polynomial p(t i ) and the actual function N TA,common (t i ) differs by an error E, which is calculated by the above formula p(t i )+(-1) i E=N TA,common (t i ) which alternates sign between sampling points. Based on this equation, i We can construct a system of linear equations for and solve for the polynomial coefficients and error E.

[0109] As a simple example for illustration, we consider a linear polynomial with two coefficients, p(t)=c0+c1(tt ref ) at sampling point t0=t ref ,t1=t ref +h / 2, and t2=t ref +h.

[0110] The system of equations is as follows:

number

number

[0111] Here the polynomial is of degree 1 and there are three time instances for which the approximation is calculated. The result is a full rank matrix with linearly independent columns. Solving this system of equations gives the coefficients c0 and c1, as well as the maximum error E. We can use standard tools of linear algebra such as Gaussian elimination, LU decomposition, etc. to find the coefficients c ican be solved and this coefficient can be signaled by the gNB. Thus, the UE can assume that the indicated coefficient minimizes the maximum approximation error over the validity period.

[0112] By iteratively modifying the sampling points, it may be possible to further minimize the maximum error E. In iterative form, such algorithms are known as Remez algorithms. In particular, in a possible implementation, the coefficients resulting from solving the linear simultaneous equations above are modified by applying one or more iterations according to the Remez algorithm.

[0113] The Remez algorithm treats a function f(t) as a polynomial p(t)=c0+c1t+···+c n t n The coefficients of the polynomial are calculated by the n+2 sampling points t0, t1, ..., t n+1 The sampling points are computed iteratively starting from a set T of sigma-squareds. A common choice of sampling points is the extrema of a Chebyshev polynomial linearly mapped onto the approximation interval.

[0114] The steps of the Remez algorithm are as follows: 1) Linear simultaneous equations p(t i )+(-1) i E = f(t i ) (where i=0,1,2,...,n+1) and construct the coefficients c0,c1,...,c n and solve for the error value E. 2) Coefficient c i to form the polynomial p(t). 3) Find the set T' of local maximum errors |p(t)-f(t)|. 4) If the errors at each t∈T' are of equal magnitude and alternate sign, then p(t) is a minimax approximation polynomial. Otherwise, replace T with T' and repeat the above steps.

[0115] This result is called the best approximation polynomial or minimax approximation algorithm.

[0116] The numerically difficult aspect of the Remez algorithm is step 3, i.e., identifying the local maximum error in the function f, which can only be evaluated numerically.

[0117] However, it should be noted that the results obtained by computing the above system of equations once may already provide sufficiently accurate results and no iterations are necessary. Iterations improve accuracy but may also increase complexity. Therefore, for a particular application, the Remez algorithm may be used with or without iterations.

[0118] In the above example, multiple time instances t i The do not have to be equidistantly distributed within the valid interval, however this makes the solution simpler and more efficient.

[0119] Returning to Figures 9A and 9B, it can be seen that the approach to calculating the polynomial coefficients by minimizing the maximum approximation error provides more accurate results over the validity interval. By applying the simultaneous equations described above to the example of Figure 9A, the minimax polynomial p M (t) is obtained.

number

[0120] The corresponding linear "minimax" approximation p of the quadratic function f(t) M (t) is shown in Figure 9A. Minimax approximation p M (t) is the Taylor approximation p T We can see that the shape of the parabola f(t) is closer to that of the minimax polynomial f(t) than to that of the minimax polynomial f(t). The error of the minimax polynomial is limited to an amplitude of E = 0.125. The error amplitude E is a function of the number of coefficients (the more coefficients, the smaller E).

[0121] FIG. 9B shows the approximation error values ​​E for the Taylor approximation (curve 910) and the minimax approximation (curve 920). The error in the case of the Taylor series grows unconstrained due to the different slopes at the approximation points, whereas the minimax approximation limits the error within the update period to not exceed a maximum level. Note that the approximation error is zero at the sampling point of the Taylor series (here t0=1), whereas the minimax polynomial has a non-zero error. However, this advantage of the Taylor series at a single sampling point is outweighed by the advantage of the minimax having a small approximation error over the entire sampling interval.

[0122] The following provides some specific exemplary implementations for obtaining a common TA. The following exemplary implementations can be combined with any of the above-mentioned embodiments and examples.

[0123] The first and second example implementations relate to obtaining a reference time instance (at a network node and / or a user device).

[0124] According to a first exemplary implementation of obtaining a reference time instance, the transceiver 170 of the network node 160 transmits an indication of the reference time instance. The transceiver can be controlled by the processing circuitry 180 to perform the transmission. The present disclosure is not limited to a particular type of transmission. For example, the indication of the reference time instance may be transmitted together with other signaling data, such as coefficients and / or validity intervals.

[0125] In a 5G / NR system, since the reference time instance is common to UEs served by a particular NTN entity, it may be advantageous to transmit an indication of the reference time instance in the system information. As mentioned above, one or more of the above coefficients and / or an indication of the reference time instance and / or an indication of the validity interval may be conveyed in the system information.

[0126] For example, the following information element SIB_NTN is provided in the RRC definition of a system information block (SIB) carrying NTN configuration parameters: [Table 3]

[0127] The acronym CTA stands for Common Timing Advance. The parameters CTA_0, CTA_1, CTA_2, CTA_N denote the respective N+1 coefficients of the CTA approximation polynomial with the above mentioned characteristics (determined by minimax). Note that N is a positive integer. N may be predefined (fixed) or configurable. The setting of N may be conveyed in the same element SIB_NTN or may be signaled separately and possibly less frequently than the coefficients.

[0128] The parameter CTA_T1 conveys an indication of a reference time instance, also called epoch time. For example, CTA_T1 can be explicitly signaled, for example in a format such as UTC (indicating absolute time, provided for example by GPS). As another example, it may be in an implicit format, such as a counter of slots, frames, and / or system frames. In other words, CTA_T1 can be signaled relative to the system timing and / or in some system time units.

[0129] Furthermore, the parameter CTA_h represents the validity interval. The validity interval can be indicated by its length (in the time domain) or by its frequency per predefined time unit. The SIB_NTN can include further configuration parameters for configuring NTN communication. As exemplarily shown in the syntax above, some NTN communication ephemeris data can also be provided in the SIB_NTN.

[0130] The SIB_NTN may be transmitted like any other system information, for example within a system information block, periodically according to the scheduling information as described above.

[0131] In this first embodiment, CTA_0 (=c0), CTA_1 (=c1), ..., CTA_N (=c N ) are coefficients designed to minimize the maximum approximation error over the validity period (interval) CTA_h. They are valid during the validity period CTA_h. Validity means that the user device can use the coefficients to approximate the CTA of the validity period. In this first embodiment, the epoch time is explicitly signaled as CTA_T1. The validity period of CTA_h in this example starts from CTA_T1. For any time t during the validity period, the user device can estimate the CTA N as follows: TA,common (t) can be calculated.

number

[0132] Note that the above calculations are only illustrative. In general, the elements of SIB_NTN do not need to be used directly in the calculations. For example, the elements of SIB_NTN may convey an indication of the coefficients and epoch times in a coded manner or in a representation that is not suitable for direct use in the equations. In such cases, the coefficients and epoch times must first be recovered (determined based on the SIB_NTN elements) and then used in the equations.

[0133] FIG. 11 illustrates an example uplink (UL) and downlink (DL) frame timing between a gNB / GW, a satellite, and a user device. In the following, some general TA aspects are described with reference to FIG. 11. It should be noted that the general concept of TA has been known for some time in mobile communication systems. The following description is intended to provide some explanation and background. However, the present disclosure is not limited to the following and can function using TA as currently understood in standardization and literature.

[0134] At time t0, the gNB determines the uplink and downlink feeder link delay d f,UL and d f,DL The satellites transmit a polynomial p(t) describing a common TA consisting of: TA It is sufficient to calculate the uplink transmit timing by subtracting the TA value from the DL receive timing, i.e., t UL =t2-N TA is obtained.

[0135] It should be noted that this explanation of time advance is exemplary and simplified, and may differ in practice, especially in 5G. For example, as described in other parts and examples of this disclosure, in practice, the SIB transmission timing (t0) and the reference timing (epoch time) are not necessarily the same.

[0136] UL transmission timing t UL applies to subsequent uplink transmissions since they cannot precede the reception of the DL signal they control.

[0137] During the subsequent time period from t3 to t6, the UE completes one round trip (corresponding to a round trip delay of t6-t2). The UE then adjusts the UL transmission timing to t UL =t6-N TA It is determined as t UL By transmitting the UL signal at t4, ideally the UL signal can be received at the gNB (also referred to herein as a gateway, GW) close to t4 (i.e. the time at which the gNB transmits the DL signal).

[0138] Note that the above description of TA is simplified. In practice, there may be further (one or more) time offsets, such as Koffset indicated to the UE by the network. The UE can derive t6 from Koffset indicated to the UE by the gNB. N is then determined according to the (gNB) RTT between t0 and t4 to match the target reception timing at the gNB (t4). TA It is necessary to determine:

number

number

[0139] As an example, the forward delay between the gateway and the satellite, d, given by Eq. f,DL The reason is that the gNB sends a DL signal at time t0, and the signal is f,DL Propagating seconds, time t0+d f,DL The satellite receives the signal at transmission time t0 and reception time t0+d f,DL Similarly, t0=t1-d f,DL By replacing it with, the feeder link delay in the backward direction DL can be obtained. Equation 10 is to place the satellite at a position corresponding to time t1, and the solution d f,DL is the location where the gNB should have been located, i.e. t1-d f,DL Reveal the location corresponding to.

[0140] The following table gives the equations for all four segments in the forward and reverse directions: These equations can for example be solved numerically (for example iteratively) - techniques for doing so are known from the prior art. [Table 4]

[0141] Conceptually, the delay of the feeder link, d f and service link delay d s consists of two components, DL and UL, i.e., d f =d f,DL +d f,UL and ds=d s,DL +d s,UL In particular, the idea is to model the common TA as follows:

number

number

[0142] With reference to Figure 11, in the following the UE procedure for timing advance is briefly described. This procedure is further illustrated in schematic form in Figure 13. As mentioned above, the gNB transmits the polynomial p(t) for time interval (t0, t0+h) in step 210. The UE receives the polynomial p(t) at time instance t2 in step 220.

[0143] The UE then receives (at step 230) the DL signal at time t6. Based on its GNSS capabilities and satellite ephemeris, the UE can calculate Equation 12 at step 240 so that the UE knows when the DL signal was relayed by the satellite, e.g., as follows:

number

number

[0144] The UE calculates the feeder link delay as N TA,common (t5) and therefore know when the UL signal is relayed by the satellite. Ideally, the UE would TA,common (t) is recognized. The corresponding timing is t3=t5-N TA,common (t5). In practice, the UE only knows the polynomial approximation of the common TA, as explained above, i.e., Equation 14. Thus, in step 250, the UE estimates the time at which the UL signal must be relayed by the satellite as follows:

number

number

[0145] Again based on the GNSS data and satellite ephemeris data, the UE can calculate the delay on the UL according to Equation 16 and obtain the UL timing in step 260 according to:

number

number

[0146] Ideally, t UL =t2. However, the common TA N TA,common Since (t) is provided to the UE as a polynomial, generally the equality holds only approximately for Equation 18. Once the UE determines the UL transmission timing and transmits the uplink signal accordingly at 270, the UL frame should arrive well aligned with the DL frame at the gNB, which is transmitted at time t4 in this example (step 280). This can be modeled as follows:

number

[0147] The residual timing error is estimated as follows:

number

[0148] The timing advance mechanism described above is applicable to any of the above-mentioned or following embodiments and examples.

[0149] According to a second exemplary implementation of obtaining a reference time instance, the epoch time (reference time instance) does not need to be signaled and is not signaled between the network and the user device. In particular, the SIB_NTN may still be transmitted, but as shown below, the SIB_NTN does not include a CTA_T1 element. [Table 5]

[0150] In both or either the network node and the user device, the processing circuitry 130 and / or 180 may be configured to determine the reference time instance based on the timing of the transmission of system information (e.g., uplink and / or downlink transmission timing).

[0151] For example, the reference time instance is determined based on at least one of the following reference points: - The start of the system information window during which system information (e.g. SIB_NTN) is transmitted. The UE (as a receiving entity) can derive the start from the SIB reception timing, i.e. from the moment when the UE receives SIB_NTN in the downlink. - The starting System Frame Number (SFN) of the frame in which the system information is transmitted. The System Frame Number can be signaled in the MIB. - The start of the frame in which system information is transmitted. - Timing of system information with a predefined offset to a reference time instance. This option is shown in Figure 12.

[0152] For example, the reference point can be either directly: - The start of the system information (SI) window in which the SIB_NTN is sent. - The start of the SFN from which the SIB_NTN is sent. - The start of the frame in which the SIB_NTN is sent. - SIB_NTN timing minus delta_t (δt), where delta_t (δt) in this example is a fixed offset (relative) starting from a reference time instance.

[0153] FIG. 12 shows a system frame with a duration of 10 ms (10 ms is a typical system frame duration in e.g. 5G). The term "system frame" means that the frame is defined (e.g. by a standard) for data transmission in a communication system. The SIB_NTN is the start of the system frame t DL The metric is transmitted at a particular location within the system frame (eg, given by subframe and / or slot and / or symbol) given by an offset δt from

[0154] With the above definition of the reference point, the UE can derive the reference time (epoch time) in the same way as the gNB. For example, the UE can use the relative timing τ (τ is the relative timing to the reference time instance) to derive N TA,common Calculate.

number

[0155] where τ is the UE data transmission timing, and ds,DL are calculated from the satellite positions and the UE position as described above. The parameters CTA_0 (=c0), CTA_1 (=c1) etc. are calculated for a reference time instance t1, i.e. the satellite is the reference position as shown in Fig. 11. The reference time instance t1 is the time instance at which the satellite transmits a downlink signal to the UE. The delay in this service link is d s In this way, the UE receives the DL signal at the s t1 can be calculated from the reference point derived based on the value of t1 minus the value of t2 minus the value of t3 minus the value of t4 minus the value of t5 minus the value of t6 minus the value of t7 minus the value of t8 minus the value of t9 minus the value of t1 ...2 minus the value of t3 minus the value of t4 minus the value

[0156] It should be noted that in the first and second exemplary implementations, the reference time instance may be t0, t1, or any value between t0 and t1. In general, the closer the approximation to the UE, the smaller the achievable error may be. Thus, in some implementations, t1 may be desirable because it results in a smaller approximation error. On the other hand, t0 has some advantages in gNB implementations.

[0157] In summary, the reference time instance in this second embodiment can be determined based on the reception time of the system information and the service link delay between the satellite and the user device.

[0158] Below, third, fourth, fifth, and sixth exemplary implementations are described that relate to the frequency of transmitting SIB_NTN with coefficients (and possibly epoch time and / or validity interval settings) and the validity of such coefficients.

[0159] According to a third example implementation, after determining the coefficients, multiple repetitions of system information including the determined coefficients and an indication of the reference time instance are transmitted during the validity interval.

[0160] Since the same coefficients are repeated multiple times during one validity period, it is advantageous to also explicitly provide a timing reference (reference time instance) in the SIB_NTN. Otherwise, the UE cannot know which SIB_NTN is the SIB_NTN received during the validity period. In this third exemplary implementation, the SIB_NTN is signaled more frequently than the coefficients are updated. In other words, the reading of updated coefficients (and possibly other elements) from the SIB_NTN on the UE side is less frequent than the transmission period of the SIB_NTN. The period in which the gNB transmits the coefficients is shorter than the period in which the UE updates the coefficients.

[0161] Figure 14 shows an example where the SIB_NTN is embedded in the system information frequently, e.g. every 0.32 seconds (corresponding to 32 frames), but the UE updates the SIB_NTN content only according to a longer validity interval, e.g. 10.24 seconds (corresponding to 1024 frames, i.e. one period of the system frame number). Thus, the first common TA value is updated at 11:21'00 and maintained until the next update at 11:21'10.24. During the validity interval, the coefficient repetitions are transmitted by the gNB 10.24 / 0.32=32 times.

[0162] In FIG. 14, the SIB_NTN content is valid for the next 10.24-(0.32×k) seconds at each SIB reception timing k. The UE derives (0.32×k) as the difference between the indicated epoch time and the SIB reception timing. Alternatively, the SIB periodicity and count k may be explicitly configured by the gNB (e.g., in the system information). In the example of FIG. 14, k can have any value from 1 to 9. For example, if the UE receives the 5th repetition of the SIB_NTN, the UE needs to update (reread) the SIB_NTN in 10.24-(0.32×5)=8.64 seconds. On the other hand, if the UE receives the 20th repetition of the SIB_NTN, the UE needs to update (reread) the SIB_NTN in 10.24-(0.32×20)=3.84 seconds. This is indicated in FIG. 14 by horizontal arrows with different lengths corresponding to the remaining time the UE has to update the coefficients. The value of the validity timer is derived from the time difference between the SIB reception timing and the epoch time indicated in SIB_NTN.

[0163] One advantage of this approach is that idle UEs can connect quickly, whereas connected UEs can update their system information less frequently.

[0164] Thus, in this exemplary implementation, the processing circuitry of the user device may be configured to: If the user device is in a connected state, it controls the transceiver to receive system information having a period corresponding to the validity interval. When the user device is in idle mode, controlling the transceiver to receive system information with an indication of a reference time instance in one of a number of repetitions of the system information transmitted during the validity interval.

[0165] According to a fourth exemplary implementation, the validity interval corresponds to (or is equal to) the system information period, which is the period during which the coefficients are determined and transmitted within the system information.

[0166] This is illustrated in Figure 15. As can be seen, the signaling of the SIB_NTN and the update of the SIB_NTN by the UE are consistent. The periodicity with which the gNB transmits the coefficients is the same as the periodicity with which the UE updates the coefficients. In this case, the epoch time can be implicitly indicated to the UE, for example, by the position of the SIB_NTN (see the second exemplary implementation above).

[0167] In the example of Figure 15, the system information is embedded with SIB_NTN, for example, every 10.24 seconds, and the UE reads and updates SIB_NTN every 10.24 seconds. This approach may be simpler than the third exemplary implementation. On the other hand, a large indication period may increase latency for connected UEs (e.g., UEs in idle mode). One advantage of this approach is that no epoch time indication is required.

[0168] According to a fifth exemplary implementation, the system information includes coefficients determined for a first validity interval and coefficients determined for a second validity interval having a different length and / or reference time instance than the first validity interval.

[0169] For example, SIB_NTN includes two CTA parameter sets with different validity periods (eg, one from 0 seconds to 5.12 seconds and the other from 0 seconds to 10.24 seconds).

[0170] In the third exemplary implementation shown in FIG. 14, when the UE acquires the SIB_NTN in one or two SIB transmission periods before the expiration (e.g., 11:21'10.24-0.32 seconds in the example of FIG. 14), the UE needs to acquire the NTN-SIB again very soon. By transmitting two sets of coefficients, such frequent SIB readings can be avoided. The set of coefficients may be two, three or more.

[0171] According to a sixth exemplary implementation, the validity interval is longer than the system information period, and the system information period is the period during which the coefficients are determined and transmitted in the system information together with an indication of the reference time instance.

[0172] FIG. 16 shows such an example. As indicated by the horizontal arrows, the validity periods may overlap. In this example, the validity periods have the same length of 10.24 seconds. The gNB signals the SIB_NTN more frequently (here every 0.32 seconds) than the UE is requested to read the SIB_NTN (here every 10.24 seconds). In this example, each SIB_NTN signaled includes updated coefficients. Thus, other than in the third exemplary embodiment (FIG. 14), the coefficients are not repeated but are updated by the gNB for each transmission of the SIB_NTN. The UE can read the SIB_NTN and update the coefficients (and correspondingly the TA) at any time. However, the UE must actually read (receive) the SIB_NTN after the validity of the last received SIB_NTN has expired (here 10.24 seconds after reception). The epoch time (reference time instance) is explicitly signaled to the UE (see the first example implementation for signaling the epoch time).

[0173] In the examples presented with reference to Figures 14-16, a specific validity interval length and a specific SIB update timing are applied. However, the present disclosure is not limited to these merely exemplary timings. As will be apparent to those skilled in the art, the specific time interval may be longer or shorter than the time interval presented herein.

[0174] <Example Simulation Results> In the following, we provide a case study to illustrate the performance of the common TA determination described herein, assuming coefficients obtained by applying the minimization of the maximum error to determine the approximation. The case study is a constellation with a gateway (gNB, network node), a satellite, and a single UE in two different initial positions. At time t=0, we assume that the satellite is directly above the gateway. In case 1 (Figure 17, left), at t=0, the satellite is seen by the UE with an elevation angle of 10°. In case 2 (Figure 18, left), the gateway and the UE are in the same position, corresponding to an elevation angle of 90°. The satellite proceeds in its orbit until it reaches a minimum elevation angle of 10° relative to the gateway. Figures 17 and 18 (right) show the corresponding common timing advance values ​​N TA,common (t) is shown for two satellite altitudes (600km, 1200km). To obtain the numerical results, the steps outlined with reference to Figures 11 and 13 have been implemented as Python code. First, a time axis or visibility window is determined within which the satellite is visible from both the gateway and the satellite (assuming a minimum elevation angle of 10°). Next, the visibility window is divided into non-overlapping update periods. These are time intervals of equal size (t0, t0+h) that appear throughout this disclosure. For each interval, N TA,common (t) is calculated, which is used by the UE to derive uplink timing for all time intervals.

[0175] The timing errors mentioned above are obtained as follows.

number

[0176] The error is shown in Figures 19A-19B for each update interval, for the Taylor series and minimax methods, and for linear and quadratic polynomials. The error was calculated by a global optimization algorithm called Differential Evolution, which is a probabilistic and robust algorithm and does not require differentiation to operate.

[0177] <Case 1> Four update periods were considered: 0.1 s, 1.0 s, 2.0 s, and 10.0 s. The left graphs in Fig. 19A-D show the results for the Taylor series, and the right graphs in Fig. 19A-D show the results for the minimax polynomial. In each of the shown graphs, there is a horizontal line marked error threshold 1 / 4*0.58us, which represents a quarter of the most stringent cyclic prefix in 5G-NR for PUSCH. Fig. 19A shows linear interpolation, and Fig. 19B shows quadratic interpolation.

[0178] In Figure 19A (linear polynomial), the maximum approximation error occurs at time t = 0. The error behavior of the minimax outperforms the Taylor method by half an order of magnitude. We can see that the Taylor series requires an update interval of less than 1 second to get the error below the target threshold, whereas the minimax approaches the error threshold with an update interval of only 2 seconds.

[0179] In Figure 19B (quadratic polynomial), the error performance is improved overall. However, the minimax method easily outperforms the Taylor series by an order of magnitude. Also, the minimax method can stay below the target error threshold with a 10 second update interval, whereas the Taylor series cannot.

[0180] Note that the jagged behavior of some of the error curves can be explained by the stochastic nature of the differential evolution algorithm operating on fairly small numbers.

[0181] <Case 2> The setup for case 2 (GW and UE locations are aligned) is shown in Figure 18. The results are similar to case 1. In particular, Figure 19C shows the update periods 0.1 s, 1.0 s, 2.0 s, 10.0 s and the approximation error for linear polynomial coefficients, while Figure 19D shows the same update periods and the approximation error for quadratic polynomial coefficients.

[0182] In summary, a generalized polynomial with coefficients designed by applying the maximum error minimization as described above can provide a significantly smaller approximation error over all update intervals compared to, for example, a Taylor series. Hence, the advantage compared to a Taylor series is a lower signaling overhead and / or a potentially larger coefficient update period.

[0183] The present disclosure can be implemented by software, by hardware, or by software cooperating with hardware. Each functional block used in the description of each embodiment above can be implemented in part or in whole by an LSI (large scale integrated circuit) such as an integrated circuit (IC), and each process described in each embodiment can be controlled in part or in whole by the same LSI or a combination of LSIs. The LSI can be formed as a chip individually, or a single chip can be formed to include some or all of the functional blocks. The LSI can include a data input / output unit coupled to it. Here, the LSI is also referred to as an IC, a system LSI, a super LSI, or an ultra LSI depending on the degree of integration. However, the technology for implementing the integrated circuit is not limited to the LSI, and may be implemented by using a dedicated circuit, a general-purpose processor, or a dedicated processor. Furthermore, an FPGA (field programmable gate array) that can be programmed after the LSI is manufactured, or a reconfigurable processor that can reconfigure the connections and settings of the circuit cells arranged inside the LSI, can also be used. The present disclosure can be implemented as digital processing or analog processing. If, as a result of advances in semiconductor technology or other derivative technologies, LSI is replaced by a future integrated circuit technology, the future integrated circuit technology can be used to integrate the functional blocks. Biotechnology can also be applied.

[0184] The present disclosure may be implemented by any kind of apparatus, device or system having a communication capability (referred to as a communication apparatus).

[0185] A communication device may include a transceiver and processing / control circuitry. The transceiver may include a receiver and a transmitter and / or function as a receiver and a transmitter. The transceiver as a transmitter and a receiver may include an RF (radio frequency) module including an amplifier, an RF modulator / demodulator, etc., and one or more antennas.

[0186] Some non-limiting examples of such communications devices include phones (e.g., cell phones, smartphones), tablets, personal computers (PCs) (e.g., laptops, desktops, notebooks), cameras (e.g., digital still / video cameras), digital players (digital audio / video players), wearable devices (e.g., wearable cameras, smart watches, tracking devices), game consoles, e-book readers, telehealth / telemedicine equipment, vehicles that provide communications capabilities (e.g., cars, airplanes, ships), and various combinations thereof.

[0187] Communications devices are not limited to portable or mobile, but can also include any type of equipment, device, or system that is non-portable or stationary, such as smart home devices (e.g., appliances, lights, smart meters, control panels), vending machines, and any other "things" in the Internet of Things (IoT) network.

[0188] Communications may include, for example, exchanging data through cellular systems, wireless LAN systems, satellite systems, etc., as well as various combinations thereof.

[0189] A communications device may include devices such as a controller or a sensor coupled to the communications device to perform the communications functions described in this disclosure. For example, a communications device may include a controller or a sensor that generates control or data signals used by the communications device to perform the communications functions of the communications device.

[0190] The communications apparatus may further include infrastructure facilities, such as base stations, access points, and any other apparatus, devices, or systems that communicate with or control apparatuses such as the apparatuses in the non-limiting examples above.

[0191] <Summary of the embodiment> The present disclosure provides a network node, the network node comprising a processing circuit that determines, during operation, coefficients of a polynomial approximating a timing advance component between the network node and a satellite so as to minimize an approximation error for a validity interval, the approximation error being specified at a number of time instances of the validity interval relative to a reference time instance, the network node further comprising a transceiver for transmitting the coefficients during operation.

[0192] The network node may be a base station or may include a satellite gateway function.

[0193] For example, a polynomial p(t) has the form

number

[0194] where c0,...,c n are the coefficients of the polynomial, n is a predefined positive integer degree of the polynomial, and t ref is a reference time instance.

[0195] In some example implementations, the processing circuitry determines the coefficients of the polynomial during operation by forcing the sign of the approximation error to alternate at multiple time instances.

[0196] In particular, during operation the processing circuitry determines the coefficients of the polynomial by solving:

number

[0197] where p(t1) is a polynomial at a time instance t1, i is an integer index of a time instance among a number of equidistant time instances, E is a measure of the approximation error, and N TA.common (t i ) at time instance t i The timing advance between the network node and the satellite at time instance t is determined by the network node based on the location of the network node and the location of the satellite. i The number of is greater than the degree of the polynomial.

[0198] The coefficients resulting from the above solution may be modified, for example, by applying one or more iterations according to the Remez algorithm.

[0199] According to an exemplary implementation, the transceiver transmits, during operation, an indication of a reference time instance.

[0200] For example, the transceiver may transmit, during operation, in system information, said coefficients and / or an indication of the reference time instance and / or an indication of the validity interval.

[0201] In some implementations, it is not necessary to transmit an indication of the reference time instance, for example, in some implementations, the processing circuitry determines the reference time instance during operation based on the timing of transmissions of system information.

[0202] According to a first implementation form, the validity interval corresponds to the system information period, which is the period during which the coefficients are determined and transmitted in the system information.

[0203] According to a second implementation, after determining the coefficients, multiple repetitions of system information including the determined coefficients and an indication of the reference time instance are transmitted during the validity interval.

[0204] According to a third implementation form, the validity interval is longer than the system information period, the system information period being the period during which the coefficients are determined and transmitted in the system information together with an indication of the reference time instance.

[0205] According to a fourth implementation, the system information includes coefficients determined for a first validity interval and coefficients determined for a second validity interval having a different length and / or reference time instance than the first validity interval.

[0206] In the present disclosure, a user device is provided, the user device (user equipment) comprising: a transceiver for receiving, during operation, coefficients of a polynomial from a network node; and a processing circuit for determining, during operation, a timing advance for a validity interval based on the polynomial for transmitting data to the network node via a satellite, the processing circuitry approximating a timing advance component between the network node and the satellite such that an approximation error is minimized. The approximation error is specified at a number of time instances of the validity interval relative to a reference time instance. The transceiver also transmits data using the determined timing advance during operation.

[0207] At the user device, for example, the transceiver receives an indication of a reference time instance during operation.

[0208] In some implementations, a user device transceiver receives, during operation, the coefficients and / or an indication of the reference time instance and / or an indication of the validity interval in system information.

[0209] As discussed above with reference to the network node, it may not be necessary for the user equipment to actually receive an indication of the reference time instance, in some implementations the processing circuitry of the user equipment determines the reference time instance during operation based on the timing of transmissions of the system information.

[0210] Regarding the determination of the reference time instance, many implementations are possible. For example, in the user device, the processing circuitry determines the reference time instance during operation based on at least one of the following: - Start of the System Information window where system information is sent - The start of the system frame number in the frame in which the system information is transmitted - The start of the frame in which system information is transmitted - Timing of system information and predefined offsets to reference time instances

[0211] In a first implementation, the validity interval corresponds to a system information period, which is the period during which the coefficients are determined and transmitted in the system information.

[0212] In a second implementation on the user device side, the processing circuitry, during operation, controls the transceiver to receive system information having a period corresponding to the validity interval when the user device is in a connected state, and controls the transceiver to receive system information together with an indication of a reference time instance in one of multiple repetitions of the system information transmitted during the validity interval when the user device is in an idle mode.

[0213] In a third implementation, the validity interval is longer than the system information period, the system information period being the period during which the coefficients are updated and transmitted in the system information together with an indication of the reference time instance.

[0214] In a fourth implementation, the system information includes coefficients determined for a first validity interval and coefficients determined for a second validity interval having a different length and / or reference time instance than the first validity interval.

[0215] During operation, the processing circuitry determines whether to apply the coefficients determined for the first validity interval or the coefficients determined for the second validity interval based on the time until the first validity interval and / or the second validity interval expires.

[0216] In another possible implementation, in the network node or the user device, the reference time is determined based on the reception time of the system information and the service link delay between the satellite and the user device.

[0217] In response to the network nodes and user devices described above, and related further examples and implementations, the present disclosure provides corresponding methods performed by the network nodes and user devices, or by processing circuitry thereof.

[0218] In the present disclosure, a method is provided that may be performed in a network node. The method includes determining coefficients of a polynomial approximating a timing advance component between the network node and a satellite so as to minimize an approximation error for a validity interval. The approximation error is specified at a number of time instances of the validity interval relative to a reference time instance. The method may further include transmitting said coefficients (e.g., when the method is performed on a network device). The method may include providing said coefficients to a transmitter for transmission (when the method is performed by a processing circuit of the network device or a processing circuit of a corresponding integrated circuit).

[0219] The present disclosure provides a method executable by a user device, the method including the steps of receiving polynomial coefficients from a network node, determining a timing advance for a validity interval for transmitting data to the network node via a satellite based on the polynomial, the polynomial approximating a timing advance component between the network node and the satellite such that an approximation error is minimized, the approximation error being specified at a number of time instances of the validity interval relative to a reference time instance, and transmitting the data using the determined timing advance.

[0220] Further exemplary embodiments and implementations of the method are provided by steps that are operatively performed by the above-mentioned processing circuitry of the network node and / or user device.

[0221] It should be noted that the method can also be performed on a processing circuit of a user device or by an integrated circuit. In such a case, instead of the receiving and transition steps, the method includes providing data for (radio) transmission to a transceiver (or simply at an output) and obtaining data (e.g. coefficients) from the transceiver (or simply at an input).

[0222] In the present disclosure, an integrated circuit (IC) is provided which, during operation, determines, for a validity interval, coefficients of a polynomial approximating a timing advance component between a network node and a satellite so as to minimize an approximation error. The approximation error is specified at a number of time instances of the validity interval relative to a reference time instance. The IC further comprises an output at which the determined coefficients are provided. Such an output is connectable or can be connected in a practical implementation to a transceiver that performs the transmission.

[0223] In the present disclosure, an integrated circuit (IC) is provided. In operation, the IC determines a timing advance for a validity interval for transmission of data to a network node via a satellite based on a polynomial, the polynomial approximating a timing advance component between the network node and the satellite to minimize an approximation error. The approximation error is specified at a number of time instances of the validity interval relative to a reference time instance. The polynomial may be obtained (received) at an input of the IC (e.g., from a transceiver). The IC may further have an output at which data is provided using the determined timing advance, e.g., for transmission by the transceiver.

[0224] The present disclosure further provides program code that, when executed on one or more processors, causes the one or more processors to perform any of the methods described above. The program code may be stored in a non-transitory medium.

[0225] The present disclosure provides a communication system including the network node as described above and one or more user devices as described above. The communication system may further include one or more NTN entities.

Claims

1. A network node, A processing circuit, which during operation: determining coefficients of a polynomial approximating a timing advance component between the network node and a satellite so as to minimize an approximation error in a validity interval; the approximation error is specified at a number of time instances of the validity interval relative to a reference time instance; A processing circuit; a transceiver for transmitting said coefficients during operation; A network node comprising:

2. The polynomial p(t) has the form: [0023] Here, c 0 , . . . , c n are the coefficients of the polynomial, n is a predefined positive integer degree of the polynomial, and t ref is a reference time instance, A network node according to claim 1.

3. 3. A network node according to claim 1 or claim 2, wherein the processing circuitry is adapted, during operation, to determine the coefficients of the polynomial by forcing the sign of the approximation error to alternate at the multiple time instances.

4. The processing circuitry, during operation, determines the coefficients of the polynomial by solving: [0024] Here, p(t i ) at time instance t i where i is an integer index of the time instance among the plurality of equidistant time instances, E is a value of the approximation error, the approximation error oscillating between −E and +E, and N TA,common (t i ) at time instance t ia timing advance between the network node and a satellite in the network node; the timing advance being determined by the network node based on a position of the network node and a position of the satellite; The time instance t in the plurality of time instances i is greater than the degree of the polynomial, A network node according to claim 3.

5. 5. The network node of claim 4, wherein the coefficients resulting from the solving are modified by applying one or more iterations according to the Remez algorithm.

6. A network node according to claim 1 , wherein the transceiver is operable, during operation, to transmit an indication of the reference time instance.

7. 6. A network node according to claim 1, wherein the transceiver is adapted, during operation, to transmit in system information the coefficients and / or an indication of the reference time instance and / or an indication of the validity interval.

8. The processing circuitry, during operation, based on the timing of the transmission of the system information; and / or the start of a system information window during which said system information is transmitted; the start of the system frame number of the frame in which said system information is transmitted, the start of the frame in which said system information is transmitted, - timing of system information and predefined offsets to a reference time instance; Based on at least one of determining the reference time instance; A network node according to claim 7.

9. The validity period corresponds to a system information period; the system information period is a period during which the coefficients are determined and transmitted within the system information; A network node according to claim 7 or claim 8.

10. after determining the coefficients, multiple iterations of system information including the determined coefficients and the indication of the reference time instance are transmitted during the validity interval. A network node according to claim 7 or claim 8.

11. The validity period is longer than a system information period; the system information period being a period during which the coefficients are determined and transmitted within the system information together with the indication of the reference time instance. A network node according to claim 7 or claim 8.

12. The system information includes coefficients determined for a first validity interval and coefficients determined for a second validity interval having a different length and / or reference time instance than the first validity interval. A network node according to claim 7 or claim 8.

13. 1. A user device, comprising: a transceiver adapted, during operation, to receive polynomial coefficients from a network node; A processing circuit, which during operation: determining a timing advance for a validity interval for transmitting data to the network node via a satellite based on the polynomial, the polynomial approximating a timing advance component between the network node and the satellite so as to minimize an approximation error, the approximation error being specified at a plurality of time instances of the validity interval relative to a reference time instance; A processing circuit; Equipped with and wherein the transceiver, during operation, transmits the data using the determined timing advance. User device.

14. and receiving, during operation, an indication of the reference time instance. The user device of claim 13.

15. 14. The user device of claim 13, wherein the transceiver is operable to receive, during operation, the coefficients and / or an indication of the reference time instance and / or an indication of the validity interval in system information.

16. The user device of claim 13 , wherein the processing circuitry is operable to determine, during operation, the reference time instance based on a timing of a transmission of the system information.

17. The processing circuitry, during operation, the start of a system information window during which said system information is transmitted; the start of the system frame number of the frame in which said system information is transmitted, the start of the frame in which said system information is transmitted, - the timing of system information and a predefined offset relative to said reference time instance; determining the reference time instance based on at least one of:

17. The user device of claim 16.

18. the validity period corresponds to the system information period; the system information period is a period during which the coefficients are determined and transmitted within the system information; A user device according to any one of claims 13 to 17.

19. The processing circuitry, during operation, When the user device is in a connected state, controlling the transceiver to receive system information having a period corresponding to the validity interval; controlling the transceiver to receive system information with an indication of the reference time instance during one of a plurality of repetitions of system information transmitted during the validity interval when the user device is in an idle mode; A user device according to any one of claims 13 to 17.

20. The validity period is longer than the system information period; the system information period being a period during which the coefficients are updated and transmitted within the system information together with an indication of the reference time instance. A user device according to any one of claims 13 to 17.

21. the system information comprises coefficients determined for a first validity interval and coefficients determined for a second validity interval having a different length and / or reference time instance than the first validity interval, the processing circuitry determines, during operation, whether to apply the coefficients determined for the first validity interval or the coefficients determined for the second validity interval based on the time until the first validity interval and / or the second validity interval expires. A user device according to any one of claims 13 to 20.

22. 22. The user device of claim 13, wherein the reference time is determined based on a reception time of the system information and a service link delay between the satellite and the user device.

23. A method performed by a network node, comprising the steps of: determining coefficients of a polynomial approximating a timing advance component between the network node and the satellite so as to minimize an approximation error for a validity interval, determining, wherein the approximation error is specified at a number of time instances of the validity interval relative to a reference time instance; transmitting the coefficients; A method comprising:

24. 1. A method performed by a user device, comprising: receiving coefficients of a polynomial from a network node; determining a timing advance for a validity interval for transmitting data to the network node via a satellite based on the polynomial, the polynomial approximating a timing advance component between the network node and a satellite so as to minimize an approximation error, the approximation error being specified at a number of time instances of the validity interval relative to a reference time instance; transmitting data using said determined timing advance; A method comprising:

25. 1. An integrated circuit (IC) configured to control a network node, the integrated circuit (IC) comprising: determining coefficients of a polynomial approximating a timing advance component between the network node and a satellite for a validity interval such that an approximation error is minimized; the approximation error is specified at a number of time instances of the validity interval relative to a reference time instance; the IC further comprising an output to which the determined coefficients are provided. Integrated circuit (IC).

26. 1. An integrated circuit (IC) configured to control a user device, the integrated circuit (IC) comprising: determining a timing advance for a validity interval for transmitting data to a network node via a satellite based on a polynomial, the polynomial approximating a timing advance component between the network node and the satellite so as to minimize an approximation error, the approximation error being specified at a plurality of time instances of the validity interval relative to a reference time instance; the IC further comprising an output at which the data is provided using the determined timing advance for transmission. Integrated circuit (IC).

Citation Information

Patent Citations

  • Signalling of feeder links and common delays in NTN

    JP2024516788A

  • Compressing a time series of data

    US8742959B1

  • ITRM.20183

  • TR38.321