RACH RESOURCE CONFIGURATION

Abstract

Methods and apparatuses for optimization of RACH procedure in non-terrestrial network are disclosed. A method comprises transmitting a preamble on a RACH resource from an uplink time slot, which is a first time advance before corresponding downlink time slot; and monitoring a control signal from a first time offset after the end of the transmission of the preamble.

Claims

1. A method, comprising: transmitting a preamble on a random access channel (RACH) resource from an uplink time slot, which is a first time advance before a corresponding downlink time slot; and monitoring a control signal from a first time offset after an end of the transmitting of the preamble.

2. The method of claim 1, wherein the first time advance is carried in the preamble.

3. The method of claim 1, wherein the first time advance is determined by at least one of a round trip delay, a time advance offset, a distance between a user equipment (UE) and a base unit, a propagation delay, or a processing delay.

4. The method of claim 1, wherein the first time offset is determined by at least one of the first time advance, a round trip delay, a time advance offset, a distance between a user equipment (UE) and a base unit, a propagation delay, or a processing delay.

5. The method of claim 1, wherein the RACH resource includes at least one of a preamble sequence index, a random access occasion index, a subcarrier index in a RACH carrier, a RACH carrier type, or a RACH carrier index.

6. The method of claim 1, wherein the RACH resource is determined by one of the first time advance, a round trip delay, a distance between a user equipment (UE) and a base unit, or a propagation delay .

7. The method of claim 6, wherein the one or more of a first time advance threshold, a round trip delay threshold, a distance threshold, or a propagation delay threshold are determined by at least one of a RACH occasion (RO) period, or a minimal first time advance.

8. The method of claim 6, wherein one or more of a first time advance threshold, a round trip delay threshold, a distance threshold, or a propagation delay threshold are configured by higher layer signaling.

9. The method of claim 1, further comprising: transmitting a second time advance in an uplink signal, the second time advance derived from at least one of the first time advance, one or more thresholds for the first time advance, or a corrected time advance.

10. The method of claim 1, wherein the RACH resource is associated with a coverage level, the coverage level determined at least based on one of the first time advance, a round trip delay, a distance between a user equipment (UE) and a base unit, a propagation delay, a first time advance threshold, a round trip delay threshold, a distance threshold, or a propagation delay threshold.

11. An apparatus, comprising: a transmitter; a processor coupled to a memory; and the processor coupled to the transmitter configured to cause the apparatus to: transmit a preamble on a random access channel (RACH) resource from an uplink time slot, which is a first time advance before a corresponding downlink time slot; and monitor a control signal from a first time offset after an end of the preamble transmit.

12. The apparatus of claim 11, wherein, the first time advance is carried in the preamble.

13. The apparatus of claim 11, wherein the first time advance is determined by at least one of a round trip delay, a time advance offset, a distance between the apparatus and a base unit, a propagation delay, or a processing delay.

14. The apparatus of claim 11, wherein the first time offset is determined by at least one of the first time advance, a round trip delay, a time advance offset, a distance between the apparatus and a base unit, a propagation delay, or a processing delay.

15. The apparatus of claim 11, wherein the RACH resource includes at least one of a preamble sequence index, a random access occasion index, a subcarrier index in a RACH carrier, a RACH carrier type, or a RACH carrier index.

16. The apparatus of claim 11, wherein the RACH resource is determined by one of the first time advance, a round trip delay, a distance between the apparatus and a base unit, or a propagation delay .

17. The apparatus of claim 16, wherein one or more of a first time advance threshold, a round trip delay threshold, a distance threshold, or a propagation delay threshold are determined by at least one of a RACH occasion (RO) period, or a minimal first time advance.

18. The apparatus of claim 16, wherein one or more of a first time advance threshold, a round trip delay threshold, a distance threshold, or a propagation delay threshold are configured by higher layer signaling.

19. The apparatus of claim 11, wherein the processor coupled to the transmitter is configured to cause the apparatus to transmit a second time advance in an uplink signal, the second time advance derived from at least one of the first time advance, one or more thresholds for the first time advance, or a corrected time advance.

20. The apparatus of claim 11, wherein the RACH resource is associated with a coverage level, the coverage level determined at least based on one of the first time advance, a round trip delay, a distance between the apparatus and a base unit, a propagation delay, a first time advance threshold, a round trip delay threshold, a distance threshold, or a propagation delay threshold.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0025] A more particular description of the embodiments briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. Understanding that these drawings depict only some embodiments, and are not therefore to be considered to be limiting of scope, the embodiments will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:

[0026] FIG. 1 illustrates a legacy random access procedure;

[0027] FIG. 2 illustrates the concept of the common TA and the UE-specific TA in NTN for two cases;

[0028] FIG. 3 illustrates an example of different TAs for different UEs;

[0029] FIG. 4 illustrates an example of the confusion of the eNB;

[0030] FIG. 5 illustrates a prior art solution to solve the problem of confusion;

[0031] FIG. 6 illustrates a legacy CE level determination for determining RACH resource;

[0032] FIG. 7 illustrates a timing sequence of transmitting and receiving Msg1 and Msg2;

[0033] FIG. 8 illustrates the concept of the second embodiment;

[0034] FIG. 9 illustrates the determination of CE level according to the third embodiment;

[0035] FIG. 10 is a schematic flow chart diagram illustrating an embodiment of a method; and

[0036] FIG. 11 is a schematic block diagram illustrating apparatuses according to one embodiment.

DETAILED DESCRIPTION

[0037] As will be appreciated by one skilled in the art that certain aspects of the embodiments may be embodied as a system, apparatus, method, or program product. Accordingly, embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may generally all be referred to herein as a “circuit”, “module” or “system”. Furthermore, embodiments may take the form of a program product embodied in one or more computer readable storage devices storing machine-readable code, computer readable code, and/or program code, referred to hereafter as “code”. The storage devices may be tangible, non-transitory, and/or non-transmission. The storage devices may not embody signals. In a certain embodiment, the storage devices only employ signals for accessing code.

[0038] Certain functional units described in this specification may be labeled as “modules”, in order to more particularly emphasize their independent implementation. For example, a module may be implemented as a hardware circuit comprising custom very-large-scale integration (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.

[0039] Modules may also be implemented in code and/or software for execution by various types of processors. An identified module of code may, for instance, include one or more physical or logical blocks of executable code which may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but, may include disparate instructions stored in different locations which, when joined logically together, include the module and achieve the stated purpose for the module.

[0040] Indeed, a module of code may contain a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules and may be embodied in any suitable form and organized within any suitable type of data structure. This operational data may be collected as a single data set, or may be distributed over different locations including over different computer readable storage devices. Where a module or portions of a module are implemented in software, the software portions are stored on one or more computer readable storage devices.

[0041] Any combination of one or more computer readable medium may be utilized. The computer readable medium may be a computer readable storage medium. The computer readable storage medium may be a storage device storing code. The storage device may be, for example, but need not necessarily be, an electronic, magnetic, optical, electromagnetic, infrared, holographic, micromechanical, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing.

[0042] A non-exhaustive list of more specific examples of the storage device would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or Flash Memory), portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.

[0043] Code for carrying out operations for embodiments may include any number of lines and may be written in any combination of one or more programming languages including an object-oriented programming language such as Python, Ruby, Java, Smalltalk, C++, or the like, and conventional procedural programming languages, such as the “C” programming language, or the like, and/or machine languages such as assembly languages. The code may be executed entirely on the user’s computer, partly on the user’s computer, as a stand-alone software package, partly on the user’s computer and partly on a remote computer or entirely on the remote computer or server. In the very last scenario, the remote computer may be connected to the user’s computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0044] Reference throughout this specification to “one embodiment”, “an embodiment”, or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, appearances of the phrases “in one embodiment”, “in an embodiment”, and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment, but mean “one or more but not all embodiments” unless expressly specified otherwise. The terms “including”, “comprising”, “having”, and variations thereof mean “including but are not limited to”, unless otherwise expressly specified. An enumerated listing of items does not imply that any or all of the items are mutually exclusive, otherwise unless expressly specified. The terms “a”, “an”, and “the” also refer to “one or more” unless otherwise expressly specified.

[0045] Furthermore, described features, structures, or characteristics of various embodiments may be combined in any suitable manner. In the following description, numerous specific details are provided, such as examples of programming, software modules, user selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of embodiments. One skilled in the relevant art will recognize, however, that embodiments may be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid any obscuring of aspects of an embodiment.

[0046] Aspects of different embodiments are described below with reference to schematic flowchart diagrams and/or schematic block diagrams of methods, apparatuses, systems, and program products according to embodiments. It will be understood that each block of the schematic flowchart diagrams and/or schematic block diagrams, and combinations of blocks in the schematic flowchart diagrams and/or schematic block diagrams, can be implemented by code. This code may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which are executed via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the schematic flowchart diagrams and/or schematic block diagrams for the block or blocks.

[0047] The code may also be stored in a storage device that can direct a computer, other programmable data processing apparatus, or other devices, to function in a particular manner, such that the instructions stored in the storage device produce an article of manufacture including instructions which implement the function specified in the schematic flowchart diagrams and/or schematic block diagrams block or blocks.

[0048] The code may also be loaded onto a computer, other programmable data processing apparatus, or other devices, to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the code executed on the computer or other programmable apparatus provides processes for implementing the functions specified in the flowchart and/or block diagram block or blocks.

[0049] The schematic flowchart diagrams and/or schematic block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of apparatuses, systems, methods and program products according to various embodiments. In this regard, each block in the schematic flowchart diagrams and/or schematic block diagrams may represent a module, segment, or portion of code, which includes one or more executable instructions of the code for implementing the specified logical function(s).

[0050] It should also be noted that in some alternative implementations, the functions noted in the block may occur out of the order noted in the Figures. For example, two blocks shown in succession may substantially be executed concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. Other steps and methods may be conceived that are equivalent in function, logic, or effect to one or more blocks, or portions thereof, to the illustrated Figures.

[0051] Although various arrow types and line types may be employed in the flowchart and/or block diagrams, they are understood not to limit the scope of the corresponding embodiments. Indeed, some arrows or other connectors may be used to indicate only the logical flow of the depicted embodiment. For instance, an arrow may indicate a waiting or monitoring period of unspecified duration between enumerated steps of the depicted embodiment. It will also be noted that each block of the block diagrams and/or flowchart diagrams, and combinations of blocks in the block diagrams and/or flowchart diagrams, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and code.

[0052] The description of elements in each Figure may refer to elements of proceeding figures. Like numbers refer to like elements in all figures, including alternate embodiments of like elements.

[0053] The random access procedure according to a first embodiment includes the same four steps as illustrated in FIG. 1. The detailed implementations are enhanced.

[0054] When the UE has location information, the UE transmits the preamble (Msg1) in a uplink slot, which is a time advance before corresponding downlink slot. The time advance is calculated by UE itself and can be referred to as estimated TA.

[0055] The estimated TA is explained in detail. Actually, the time advance (referred to as total TA) can be classified as estimated TA and TA offset. In particular, the total TA is equal to the sum of the estimated TA and the TA offset. The TA offset depends on the duplex mode of the cell in which the uplink transmission takes place and the frequency range (FR), which is mainly for Tx/Rx switching. The value of the TA offset (N.sub.TAoffset) is shown in the following table:

TABLE-US-00001 The Value of N.sub.TA .sub.offset Frequency range and band of cell used for uplink transmission N.sub.TA .sub.offset (Unit T.sub.c) FDD in FR1 0 FR1 TDD band 39936 or 25600 (Note 1) FR2 13792 NOTE 1: The UE identifies N.sub.TA offset based on the information [TBD] according to [TS38.331]. NOTE 2: The value of N.sub.TA .sub.offset that applies to the supplementary UL carrier is determined from the non-supplementary UL carrier.

[0056] The TA offset only applies the scenario of NR (in NTN) but does not apply to the scenario of eMTC or NBIoT (in NTN).

[0057] The TA offset can be compensated by the base station. For example, when the base station configures the RACH occasion, the TA offset maybe considered. In this condition or in the condition when the TA offset does not apply, from the UE point of view, the total TA is equivalent to the estimated TA.

[0058] The estimated TA is dependent on the propagation delay and the processing delay. The propagation delay is dependent on the distance between the base station and UE. For example, as illustrated in FIG. 2, the distance between the base station and UE is d1 for regenerative payload and is d1+d0_F for bent-pipe payload. The propagation delay can be obtained by dividing the distance between the base station and UE by the speed of light (c). Since the speed of light is a constant, the propagation delay and the distance between the base station and UE are interchangeable. That is, one of the propagation delay and the distance between the base station and UE is determined, the other is determined. The estimated TA is twice of the propagation delay plus the processing delay.

[0059] The processing delay can be processing delay by UE and/or processing delay by base station. The processing delay by UE and/or the processing delay by base station may be dynamically configured or configured as a fixed value. For example, a fixed processing delay by the base station (e.g. 3 ms) is used in the scenario of eMTC or NBIoT (eMTC or NBIoT in NTN). The processing delay by UE and/or the processing delay by base station may also be compensated by the base station. In this condition, from the UE point of view, the estimated TA is only dependent on the propagation delay (or the distance between the base station and UE), for example, equal to twice of the propagation delay.

[0060] Twice of the propagation delay may be referred to as a round trip delay. In some condition, the round trip delay may refer to twice of the propagation delay plus the processing delay.

[0061] As a whole, the total TA is equal to the sum of the estimated TA and the TA offset. If the TA offset does not apply or is compensated by the base station, the estimated TA can be regarded as the total TA from the UE point of view. The estimated TA is equal to the sum of twice of the propagation delay plus the processing delay (by UE and/or by base station). If either or both of the processing delay by UE and the processing delay by base station are compensated by the base station, it is (they are) not considered in the estimated TA. The round trip delay may refer to twice of the propagation delay or the sum of the propagation delay and the processing delay.

[0062] As described above, in different conditions, the estimated TA may have different meanings. In a word, the estimated TA refers to the TA that has to be considered at the UE side.

[0063] FIG. 7 illustrates a timing sequence of transmitting and receiving Msg1 and Msg2 in the scenario of eMTC or NBIoT (in NTN). The values adopted in FIG. 7 are only illustrative. In FIG. 7, the TA offset (N.sub.TAoffset) does not apply and accordingly is assumed to be 0 from the UE point of view. The processing delay by UE is not considered in this example (it is irrelevant in this example). The processing delay by eNB (i.e. base station) is assumed to be 3 ms.

[0064] At a timing of 0 ms (downlink subframe 0), a SSB is transmitted from eNB. The SSB indicates that an RO occasion starts at 40 ms (subframe 40). The UE receives the SSB at certain timing corresponding to downlink subframe 0. The UE can make an estimation of the TA by itself based on the location information. Suppose that the estimated propagation delay is 18 ms. Therefore, in this example, the total TA (N.sub.TA) is equal to the estimated TA, which is twice of the propagation delay (i.e. 2*18 = 36 ms). That means that the UE would transmit the preamble (Msg1) at a timing of 40-36=4 ms corresponding to downlink subframe, starting from the timing when the SSB is received (corresponding to downlink subframe 0), so that the Msg1 can be received at the eNB at the timing of 40 ms.

[0065] The UE starts to monitor PDCCH after an offset of transmitting Msg1. The offset refers to a period from the timing of completing transmitting Msg1 to the start of the “RA Response Window”. The UE monitors RAR (i.e. Msg2, which is the response to Msg1) during the “RA Response Window”. The offset is determined by at least one of (1) the total TA (N.sub.TA) adopted in Msg1 transmission, (2) the estimated TA, (3) the TA offset, (4) the propagation delay or the distance between the UE and the eNB, and (5) the processing delay. In the example of FIG. 7, the offset is the sum of (1) the estimated TA (which is twice of the propagation delay) and (2) the processing delay by eNB (which assumed to be a fixed processing delay (e.g. 3 ms that is used in the scenario of eMTC or NBIoT (in NTN)).

[0066] The eNB receives the Msg1 at the timing of 40 ms. After the fixed processing delay (e.g. 3 ms), the eNB transmits Msg2 within a RAR window starting from the timing of 43 ms (=40+3). The UE expects to receives the Msg2 in a “RA Response Window” starting from a timing that is the offset (e.g. the sum of the 2* propagation delay (36 ms) and the fixed processing delay) (3 ms), i.e. 39 ms) from completing transmitting the Msg1.

[0067] The second embodiment aims to solve the potential problem of confusion of RACH occasions (ROs). As illustrated in FIG. 4, the eNB may confuse the ROs due to the limitation of the RO period (small RO period compared with large differential TA (or compared with large maximum delay difference)). According to the prior art solution described with reference to FIG. 5, the actual RO period is extended to twice of the RO period. It is not favorable. In FIG. 5, each RACH resource is identified by its preamble sequence index. In addition to the preamble sequence index, the RACH resource can alternatively be any of: a Random Access occasion index, a subcarrier index in a RACH carrier, a RACH carrier type, and a RACH carrier index. For simplicity, the following description still takes the preamble sequence index as an example of the RACH resource.

[0068] According to the second embodiment, the RACH resource is determined by the comparison of the estimated TA with a threshold (or with multiple thresholds). As described above, the estimated TA may be different in different conditions. As a result, the parameter to be compared with the threshold(s) may alternatively be any of the total TA, the propagation delay, the distance between UE and base station.

[0069] With reference to FIG. 1, according to prior art random access procedure, the estimated TA is not carried in Msg1. So, the eNB does not know the estimated TA after receiving the Msg1, and accordingly may confuse to which RO occasion the Msg1 belongs.

[0070] According to the second embodiment, initial TA information (i.e. the estimated TA by the UE) is carried in Msg1. Therefore, the UE knows the estimated TA when transmitting Msg1, and the eNB also knows the estimated TA after receiving the Msg1.

[0071] According to the value of the estimated TA, the UE can estimate when the Msg1 will be received by the eNB; and the eNB can estimate when the Msg1 was transmitted by UE and accordingly assume to which RO occasion the Msg1 belongs.

[0072] A threshold can be configured to distinguish the preambles (Msg1) with different estimated TAs. For example, the threshold can be configured by a higher layer signaling, e.g. as 2* RO period plus minimal TA. For another example, the threshold can be directly configured by the higher layer signaling as a value with a unit of millisecond.

[0073] FIG. 8 illustrates the concept of the second embodiment. In FIG. 8, the RO period is 30 ms, and the minimal TA is 20 ms. For ease of discussion, each of the TA offset, the processing delay by UE and the processing delay by eNB (by base station) is assumed to be 0.

[0074] The RO occasions are assumed to be at 50 ms (first RO occasion), 80 ms (second RO occasion), 110 ms (third RO occasion), etc, with a RO period of 30 ms. The threshold for the estimated TAs to distinguish different preambles (Msg1) is configured as 2* RO period plus minimal TA, i.e. 2*30+20 = 80 ms. From the point of view of propagation delay (which is half of the estimated TA in this example), the threshold for the estimated TA being 80 ms is equivalent to the threshold for the estimated propagation delay being 40 ms. Therefore, as shown in FIG. 10, the dashed lines aligning with 40 ms, 80 ms and 120 ms represent the thresholds for the estimated propagation delays. Among the RACH resources to be received at the second RO occasion (at timing of 80 ms), a part of the RACH resources with an estimated TA that is smaller than the threshold (e.g. the preambles with odd preamble sequence indices (e.g. 1, 3, 5, ...)) are considered to be in one group. On the other hand, the other part of the RACH resources with an estimated TA that is larger than the threshold (e.g. the preambles with even preamble sequence indices (e.g. 0, 2, 4, ...)) are considered to be in the other group.

[0075] Since the UE knows the estimated TA, the UE knows the timing when the preamble it transmits will be received by the eNB, and accordingly knows the transmitted preamble would belong to which RO occasion. Because the preambles with different estimated TAs are grouped based on the comparison of the estimated TAs with the threshold, the preambles in the same group will have smaller differential TA compared with the grouping without considering estimated TAs in the prior art shown in FIG. 5. For example, in FIG. 5, when the Max TA is 100 ms (and the Min TA is 20 ms), the differential TA would be 80 ms. On the other hand, as the threshold is configured as 80 ms (and the Min TA is 20 ms) in the example of FIG. 8, the differential TA becomes 60 ms for the group of RACH resources with a TA that is smaller than the threshold. Due to small differential TA, it is easy to schedule Msg2 in the RAR window for UEs with similar TA ranges.

[0076] In the example of FIG. 8, one threshold for the estimated TAs is configured. In a variety of the second embodiment, two or more thresholds for the estimated TAs can be configured. For example, when two thresholds, e.g. a first threshold (e.g. 4* RO period plus minimal TA) and a second threshold (e.g. 2* RO period plus minimal TA), are configured, if an estimated TA of a UE is larger than the first threshold, the UE is assumed to be configured in RACH resource group 1 (e.g. the preambles with preamble sequence indices 0, 3, 6, ...); if the estimated TA of a UE is larger than the second threshold and smaller than the first threshold, the UE is assumed to be configured in RACH resource group 2 (e.g. the preambles with preamble sequence indices 1, 4, 7, ...); and otherwise (if the estimated TA of a UE is smaller than the second threshold), the UE is assumed to be configured in RACH resource group 3 (e.g. the preambles with preamble sequence indices 2, 5, 8, ...). The minimal TA, the first threshold and the second threshold can be configured by higher layer. In the above example, the threshold(s) are determined by the RO period and the minimal TA (e.g. calculated as 4* RO period plus minimal TA, and 2* RO period plus minimal TA). The threshold(s) may be alternatively directly configured by a higher layer signaling as a value with a unit of millisecond. For example, three thresholds (e.g. TA1, TA2, TA3) can be configures as TA1 = 30 (ms), TA2 = 60 (ms), and TA3 = 90 (ms).

[0077] As another variety of the second embodiment, the RACH resource may not be preamble sequence indices. For example, the RACH resource may be RACH carrier type which may be non-anchor carrier or anchor carrier. If the estimated TA is larger than a threshold, the non-anchor carrier is the carrier for RACH, otherwise (if the estimated TA is smaller than the threshold), the anchor carrier is the carrier for RACH.

[0078] According to yet another variety of the second embodiment, the number of RACH resources in a group may not be the same. For example, if the estimated TA is larger than a threshold, all preambles of odd RO occasion and even preamble indices (e.g. 0, 2, 4, ...) of even RO occasion are configured in one group, otherwise (if the estimated TA is smaller than the threshold), odd preamble indices (e.g. 1, 3, 5, ...) of even RO occasion are configured in the other group.

[0079] As the RACH resources are grouped according to a comparison of different estimated TAs with the threshold(s) therefor, the TA information in Msg3 scheduled by Msg2 can be based on the reference TA corresponding to the RO (i.e. the threshold(s) for the estimated TAs). In particular, the TA information may be derived from the estimated TA, corrected TA in Msg2 and threshold(s) for the estimated TAs. For example, if estimated TA is smaller than the threshold “2* RO period plus minimal TA”, RACH resource is configured in RACH resource group 1, and the TA information in Msg3 is also based on the threshold “2* RO period plus minimal TA” which is the maximum TA for the RACH resources in RACH resource group 1. Therefore, compared with prior art in which the TA information in Msg3 is based on the maximum TA, shorter differential TA range that can be indicated by less bits is achieved. For example, assuming that the maximal TA is 180 ms and the minimal TA is 20 ms. When no threshold(s) are configured, the TA information in all Msg3 scheduled by Msg2 is scheduled based on the maximal TA with a range of the maximal TA minus the minimal TA (that is 160 ms). On the other hand, when thresholds (e.g. TA1=80 ms and TA2=140 ms) are configured, the TA information in Msg3 for the UE with estimated TAs larger than 140 ms can be scheduled based on the maximal TA with a range of the maximal TA minus TA2 (that is 40 ms); the TA information in Msg3 for the UE with estimated TAs larger than 80 ms and smaller than 140 ms can be scheduled based on the threshold TA2 (=140 ms) with a range of TA2 minus TA1 (that is 60 ms); and the TA information in Msg3 for the UE with estimated TAs smaller than 80 ms can be scheduled based on the threshold TA1 (=80 ms) with a range of TA1 minus the minimal TA (that is 60 ms). Therefore, the differential TA range can be reduced from 160 ms to 60 ms.

[0080] According to a third embodiment, the CE level is determined with reference to TA information, e.g. one of the estimated TA, the round trip delay, the distance between UE and a base station and a propagation delay, by comparing the TA information with configured threshold(s) for the TA information. In the following example, the TA information is the estimated TA.

[0081] Line of sight (LOS) is a normal scenario of eMTC or NBIoT in NTN. That is to say, RSRP is largely determined by the distance between satellite and UE (e.g. TA). Therefore, it is reasonable to configure different TAs to different coverage (CE level).

[0082] For example, a TH1 is configured as a threshold for RSRP and a TA1 is configured as a threshold for TA. If RSRP > TH1 and TA<TA1, coverage 0 is determined; if RSRP > TH1 and TA > TA1, coverage 1 is determined; if RSRP < TH1 and TA < TA1, coverage 2 is determined; and if RSRP < TH1 and TA > TA1, coverage 3 is determined.

[0083] For another example, TA1, TA2 and TA3 (TA1< TA2 < TA3) are configured as thresholds for TA. If TA < TA1, coverage 0 is determined; if TA1 < TA < TA2, coverage 1 is determined; if TA2 < TA < TA3, coverage 2 is determined; and if TA > TA3, coverage 3 is determined.

[0084] Therefore, as illustrated in FIG. 9, the coverage can be determined by a combination of RSRP and estimated TA, or only by estimated TA. The RACH resource is configured per coverage (i.e. CE level). Based on the determined RACH resource, the preamble (i.e. Msg1) is transmitted.

[0085] FIG. 10 is a schematic flow chart diagram illustrating an embodiment of a method 1000 according to the present application. In some embodiments, the method 1000 is performed by an apparatus, such as a remote unit. In certain embodiments, the method 1000 may be performed by a processor executing program code, for example, a microcontroller, a microprocessor, a CPU, a GPU, an auxiliary processing unit, a FPGA, or the like.

[0086] The method 1000 may include 1002 transmitting a preamble on a RACH resource from an uplink time slot, which is a first time advance before corresponding downlink time slot; and 1004 monitoring a control signal from a first time offset after the end of the transmission of the preamble.

[0087] FIG. 11 is a schematic block diagram illustrating apparatuses according to one embodiment.

[0088] Referring to FIG. 11, the UE (i.e. the remote unit) includes a processor, a memory, and a transceiver. The processor implements a function, a process, and/or a method which are proposed in FIG. 10. The eNB or gNB (i.e. base unit) includes a processor, a memory, and a transceiver. Layers of a radio interface protocol may be implemented by the processors. The memories are connected with the processors to store various pieces of information for driving the processors. The transceivers are connected with the processors to transmit and/or receive a radio signal. Needless to say, the transceiver may be implemented as a transmitter to transmit the radio signal and a receiver to receive the radio signal.

[0089] The memories may be positioned inside or outside the processors and connected with the processors by various well-known means.

[0090] In the embodiments described above, the components and the features of the embodiments are combined in a predetermined form. Each component or feature should be considered as an option unless otherwise expressly stated. Each component or feature may be implemented not to be associated with other components or features. Further, the embodiment may be configured by associating some components and/or features. The order of the operations described in the embodiments may be changed. Some components or features of any embodiment may be included in another embodiment or replaced with the component and the feature corresponding to another embodiment. It is apparent that the claims that are not expressly cited in the claims are combined to form an embodiment or be included in a new claim.

[0091] The embodiments may be implemented by hardware, firmware, software, or combinations thereof. In the case of implementation by hardware, according to hardware implementation, the exemplary embodiment described herein may be implemented by using one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, and the like.

[0092] Embodiments may be practiced in other specific forms. The described embodiments are to be considered in all respects to be only illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.