Method and Apparatus for Random Access

Abstract

Various embodiments of the present disclosure provide a method for random access. The method which may be performed by a network node comprises determining configuration information for a contention free preamble in a random access occasion, based at least in part on mapping between synchronization signal and physical broadcast channel blocks and preambles for two-step random access in the random access occasion. The contention free preamble is applicable for the two-step random access. The method further comprises transmitting the configuration information to a terminal device. According to some embodiments of the present disclosure, an association between signaling transmissions in a two-step random access procedure can be configured flexibly and efficiently.

Claims

1-45. (canceled)

46. A method performed by a network node, comprising: determining configuration information for a contention free preamble in a random access occasion, based at least in part on mapping between synchronization signal and physical broadcast channel blocks and preambles for two-step random access in the random access occasion, wherein the contention free preamble is applicable for the two-step random access; and transmitting the configuration information to a terminal device.

47. The method according to claim 46, wherein the random access occasion is configured with the preambles for the two-step random access and preambles for four-step random access.

48. The method according to claim 46, wherein the configuration information comprises at least one of: a first parameter to indicate mapping between a synchronization signal and physical broadcast channel block and one or more contention free preambles for the two-step random access; and a second parameter to indicate mapping between a synchronization signal and physical broadcast channel block and one or more contention-based preambles for the two-step random access.

49. The method according to claim 48, wherein the contention free preamble is also applicable for four-step random access.

50. The method according to claim 49, wherein it is determined by the terminal device whether to use the contention free preamble for the two-step random access or the four-step random access, according to at least one of: a measurement on downlink transmission; a service type; a frequency band in operation; a number of failures in a type of random access; a cell coverage; an uplink shared channel resource; and a speed of the terminal device.

51. The method according to claim 46, wherein the contention free preamble is associated with uplink radio resource comprising at least one of: an uplink shared channel occasion; and one or more resource units configured in the uplink shared channel occasion.

52. The method according to claim 51, wherein the uplink radio resource is determined according to at least one of: a contention free preamble identifier; an identifier of the uplink shared channel occasion; identifiers of the one or more resource units; and random access resource allocated by the network node, wherein the allocated random access resource comprises reserved uplink shared channel resource or dynamically scheduled uplink shared channel resource.

53. A method performed by a terminal device, comprising: receiving, from a network node, configuration information for a contention free preamble in a random access occasion, wherein the configuration information is based at least in part on mapping between synchronization signal and physical broadcast channel blocks and preambles for two-step random access in the random access occasion, and the contention free preamble is applicable for the two-step random access.

54. The method according to claim 53, further comprising: using the contention free preamble according to the configuration information.

55. The method according to claim 53, wherein the random access occasion is configured with the preambles for the two-step random access and preambles for four-step random access.

56. The method according to claim 53, wherein one or more reserved preambles are reserved in the random access occasion.

57. The method according to claim 53, wherein the configuration information comprises at least one of: a first parameter to indicate mapping between a synchronization signal and physical broadcast channel block and one or more contention free preambles for the two-step random access; and a second parameter to indicate mapping between a synchronization signal and physical broadcast channel block and one or more contention-based preambles for the two-step random access.

58. The method according to claim 53, wherein the configuration information comprises at least one of: a third parameter to indicate a number of one or more contention free preambles per synchronization signal and physical broadcast channel block for two-step random access; and a fourth parameter to indicate a number of one or more contention-based preambles per synchronization signal and physical broadcast channel block for two-step random access.

59. The method according to claim 57, wherein the one or more contention free preambles for the two-step random access comprise at least one preamble allocated from a set of contention free preambles for four-step random access.

60. The method according to claim 53, wherein the contention free preamble is also applicable for four-step random access.

61. The method according to claim 60, further comprising: receiving, from the network node, information about whether the contention free preamble is configured for the two-step random access or the four-step random access.

62. The method according to claim 60, further comprising determining whether to use the contention free preamble for the two-step random access or the four-step random access, according to at least one of: a measurement on downlink transmission; a service type; a frequency band in operation; a number of failures in a type of random access; a cell coverage; an uplink shared channel resource; and a speed of the terminal device.

63. The method according to claim 53, wherein the contention free preamble is associated with uplink radio resource comprising at least one of: an uplink shared channel occasion; and one or more resource units configured in the uplink shared channel occasion.

64. The method according to claim 63, wherein the uplink radio resource is determined according to at least one of: a contention free preamble identifier; an identifier of the uplink shared channel occasion; identifiers of the one or more resource units; and random access resource allocated by the network node, wherein the allocated random access resource comprises reserved uplink shared channel resource or dynamically scheduled uplink shared channel resource.

65. A terminal device, comprising: one or more processors; and one or more memories comprising computer program codes, the one or more memories and the computer program codes being configured to, with the one or more processors, cause the terminal device at least to: receive, from a network node, configuration information for a contention free preamble in a random access occasion, wherein the configuration information is based at least in part on mapping between synchronization signal and physical broadcast channel blocks and preambles for two-step random access in the random access occasion, and the contention free preamble is applicable for the two-step random access.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0057] The disclosure itself, the preferable mode of use and further objectives are best understood by reference to the following detailed description of the embodiments when read in conjunction with the accompanying drawings, in which:

[0058] FIG. 1A is a diagram illustrating an exemplary four-step RA procedure according to an embodiment of the present disclosure;

[0059] FIG. 1B is a diagram illustrating an exemplary PRACH configuration according to an embodiment of the present disclosure;

[0060] FIGS. 1C-1D are diagrams illustrating examples of an association between an SSB and a PRACH occasion according to some embodiments of the present disclosure;

[0061] FIG. 1E is a diagram illustrating an example of mapping between an SSB and RA preambles according to an embodiment of the present disclosure;

[0062] FIG. 1F is a diagram illustrating exemplary preambles per SSB per PRACH occasion according to an embodiment of the present disclosure;

[0063] FIG. 2 is a diagram illustrating an exemplary two-step RA procedure according to an embodiment of the present disclosure;

[0064] FIGS. 3A-3E are diagrams illustrating examples of preamble configuration according to some embodiments of the present disclosure;

[0065] FIG. 4 is a flowchart illustrating a method according to some embodiments of the present disclosure;

[0066] FIG. 5 is a flowchart illustrating another method according to some embodiments of the present disclosure;

[0067] FIG. 6 is a block diagram illustrating an apparatus according to some embodiments of the present disclosure;

[0068] FIG. 7 is a block diagram illustrating another apparatus according to some embodiments of the present disclosure;

[0069] FIG. 8 is a block diagram illustrating yet another apparatus according to some embodiments of the present disclosure;

[0070] FIG. 9 is a block diagram illustrating a telecommunication network connected via an intermediate network to a host computer in accordance with some embodiments of the present disclosure;

[0071] FIG. 10 is a block diagram illustrating a host computer communicating via a base station with a UE over a partially wireless connection in accordance with some embodiments of the present disclosure;

[0072] FIG. 11 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment of the present disclosure;

[0073] FIG. 12 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment of the present disclosure;

[0074] FIG. 13 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment of the present disclosure; and

[0075] FIG. 14 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment of the present disclosure.

DETAILED DESCRIPTION

[0076] The embodiments of the present disclosure are described in detail with reference to the accompanying drawings. It should be understood that these embodiments are discussed only for the purpose of enabling those skilled persons in the art to better understand and thus implement the present disclosure, rather than suggesting any limitations on the scope of the present disclosure. Reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the present disclosure should be or are in any single embodiment of the disclosure. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present disclosure. Furthermore, the described features, advantages, and characteristics of the disclosure may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize that the disclosure may be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the disclosure.

[0077] As used herein, the term “communication network” refers to a network following any suitable communication standards, such as new radio (NR), long term evolution (LTE), LTE-Advanced, wideband code division multiple access (WCDMA), high-speed packet access (HSPA), and so on. Furthermore, the communications between a terminal device and a network node in the communication network may be performed according to any suitable generation communication protocols, including, but not limited to, the first generation (1G), the second generation (2G), 2.5G, 2.75G, the third generation (3G), 4G, 4.5G, 5G communication protocols, and/or any other protocols either currently known or to be developed in the future.

[0078] The term “network node” refers to a network device in a communication network via which a terminal device accesses to the network and receives services therefrom. The network node may refer to a base station (BS), an access point (AP), a multi-cell/multicast coordination entity (MCE), a controller or any other suitable device in a wireless communication network. The BS may be, for example, a node B (NodeB or NB), an evolved NodeB (eNodeB or eNB), a next generation NodeB (gNodeB or gNB), a remote radio unit (RRU), a radio header (RH), a remote radio head (RRH), a relay, a low power node such as a femto, a pico, and so forth.

[0079] Yet further examples of the network node comprise multi-standard radio (MSR) radio equipment such as MSR BSs, network controllers such as radio network controllers (RNCs) or base station controllers (BSCs), base transceiver stations (BTSs), transmission points, transmission nodes, positioning nodes and/or the like. More generally, however, the network node may represent any suitable device (or group of devices) capable, configured, arranged, and/or operable to enable and/or provide a terminal device access to a wireless communication network or to provide some service to a terminal device that has accessed to the wireless communication network.

[0080] The term “terminal device” refers to any end device that can access a communication network and receive services therefrom. By way of example and not limitation, the terminal device may refer to a mobile terminal, a user equipment (UE), or other suitable devices. The UE may be, for example, a subscriber station, a portable subscriber station, a mobile station (MS) or an access terminal (AT). The terminal device may include, but not limited to, portable computers, image capture terminal devices such as digital cameras, gaming terminal devices, music storage and playback appliances, a mobile phone, a cellular phone, a smart phone, a tablet, a wearable device, a personal digital assistant (PDA), a vehicle, and the like.

[0081] As yet another specific example, in an Internet of things (IoT) scenario, a terminal device may also be called an IoT device and represent a machine or other device that performs monitoring, sensing and/or measurements etc., and transmits the results of such monitoring, sensing and/or measurements etc. to another terminal device and/or a network equipment. The terminal device may in this case be a machine-to-machine (M2M) device, which may in a 3rd generation partnership project (3GPP) context be referred to as a machine-type communication (MTC) device.

[0082] As one particular example, the terminal device may be a UE implementing the 3GPP narrow band Internet of things (NB-IoT) standard. Particular examples of such machines or devices are sensors, metering devices such as power meters, industrial machinery, or home or personal appliances, e.g. refrigerators, televisions, personal wearables such as watches etc. In other scenarios, a terminal device may represent a vehicle or other equipment, for example, a medical instrument that is capable of monitoring, sensing and/or reporting etc. on its operational status or other functions associated with its operation.

[0083] As used herein, the terms “first”, “second” and so forth refer to different elements. The singular forms “a” and “an” are intended to include the plural forms as well, unless the context clearly indicates otherwise. The terms “comprises”, “comprising”, “has”, “having”, “includes” and/or “including” as used herein, specify the presence of stated features, elements, and/or components and the like, but do not preclude the presence or addition of one or more other features, elements, components and/or combinations thereof. The term “based on” is to be read as “based at least in part on”. The term “one embodiment” and “an embodiment” are to be read as “at least one embodiment”. The term “another embodiment” is to be read as “at least one other embodiment”. Other definitions, explicit and implicit, may be included below.

[0084] Wireless communication networks are widely deployed to provide various telecommunication services such as voice, video, data, messaging and broadcasts. As described previously, in order to connect to a network node such as a gNB in a wireless communication network, a terminal device such as a UE may need to perform a RA procedure to exchange essential information and messages for communication link establishment with the network node.

[0085] FIG. 1A is a diagram illustrating an exemplary four-step RA procedure according to an embodiment of the present disclosure. As shown in FIG. 1A, a UE can detect a synchronization signal (SS) by receiving 101 an SSB (e.g., a primary synchronization signal (PSS), a secondary synchronization signal (SSS), and physical broadcast channel (PBCH)) from a gNB. The UE can decode 102 some system information (e.g., remaining minimum system information (RMSI) and other system information (OSI)) broadcasted in the downlink (DL). Then the UE can transmit 103 a PRACH preamble (message1/msg1) in the uplink (UL). The gNB can reply 104 with a random access response (RAR, message2/msg2). In response to the RAR, the UE can transmit 105 the UE's identification information (message3/msg3) on physical uplink shared channel (PUSCH). Then the gNB can send 106 a contention resolution message (CRM, message4/msg4) to the UE.

[0086] In this exemplary procedure, the UE transmits message3/msg3 on PUSCH after receiving a timing advance command in the RAR, allowing message3/msg3 on PUSCH to be received with timing accuracy within a cyclic prefix (CP). Without this timing advance, a very large CP may be needed in order to be able to demodulate and detect message3/msg3 on PUSCH, unless the communication system is applied in a cell with very small distance between the UE and the gNB. Since a NR system can also support larger cells with a need for providing a timing advance command to the UE, the four-step approach is needed for the RA procedure.

[0087] In the NR system, the time and frequency resource on which a PRACH preamble is transmitted can be defined as a PRACH occasion. Different PRACH configuration schemes may be specified for FR1 paired spectrum, FR1 unpaired spectrum and FR2 with unpaired spectrum, respectively. The specified PRACH configuration can be maintained in a PRACH configuration table. The time resource and preamble format for PRACH transmission can be configured by a PRACH configuration index, which indicates a row in a PRACH configuration table. For example, at least part of PRACH configuration for preamble format 0 for FR1 unpaired spectrum is shown in Table 1.

TABLE-US-00001 TABLE 1 N.sub.t.sup.RA,slot, number of Number of time-domain PRACH PRACH PRACH slots occasions N.sub.dur.sup.RA, Configuration Preamble n.sub.SFN mod x = y Subframe Starting within a within a PRACH Index format X y number symbol subframe PRACH slot duration 0 0 16 1 9 0 — — 0 1 0 8 1 9 0 — — 0 2 0 4 1 9 0 — — 0 3 0 2 0 9 0 — — 0 4 0 2 1 9 0 — — 0 5 0 2 0 4 0 — — 0 6 0 2 1 4 0 — — 0 7 0 1 0 9 0 — — 0 8 0 1 0 8 0 — — 0 9 0 1 0 7 0 — — 0 10 0 1 0 6 0 — — 0 11 0 1 0 5 0 — — 0 12 0 1 0 4 0 — — 0 13 0 1 0 3 0 — — 0 14 0 1 0 2 0 — — 0 15 0 1 0 1,6 0 — — 0 16 0 1 0 1,6 7 — — 0 17 0 1 0 4,9 0 — — 0 18 0 1 0 3,8 0 — — 0 19 0 1 0 2,7 0 — — 0 20 0 1 0 8,9 0 — — 0 21 0 1 0 4,8,9 0 — — 0 22 0 1 0 3,4,9 0 — — 0 23 0 1 0 7,8,9 0 — — 0 24 0 1 0 3,4,8,9 0 — — 0 25 0 1 0 6,7,8,9 0 — — 0 26 0 1 0 1,4,6,9 0 — — 0 27 0 1 0 1,3,5,7,9 0 — — 0

[0088] In Table 1, the value of x indicates the PRACH configuration period in number of system frames, and the value of y indicates the system frame within each PRACH configuration period on which the PRACH occasions are configured. For instance, if y is set to 0, then it means that PRACH occasions are only configured in the first frame of each PRACH configuration period. The value in the column “Subframe number” tells on which subframes PRACH occasions are configured. The value in the column “Starting symbol” is the symbol index.

[0089] In the case of time division duplexing (TDD), semi-statically configured DL parts and/or actually transmitted SSBs can override and invalidate some time-domain PRACH occasions defined in the PRACH configuration table. More specifically, PRACH occasions in the UL part are always valid, and a PRACH occasion within a certain part (e.g., a part with flexible symbols within a NR slot) is valid as long as it does not precede or collide with an SSB in the RACH slot and there are at least N symbols after the DL part and the last symbol of an SSB. For example, N may be set as 0 or 2, depending on the PRACH format and subcarrier spacing.

[0090] FIG. 1B is a diagram illustrating an exemplary PRACH configuration according to an embodiment of the present disclosure. In the frequency domain, a NR system can support multiple frequency-multiplexed PRACH occasions on the same time-domain PRACH occasion. This is mainly motivated by the support of analog beam sweeping in the NR system such that the PRACH occasions associated to one SSB are configured at the same time instance but different frequency locations. As shown in FIG. 1B, the number of PRACH occasions frequency-division multiplexed (FDMed) in one time domain PRACH occasion may be 1, 2, 4, or 8, and the PRACH configuration period may be 10 ms, 20 ms, 40 ms, 80 ms or 160 ms. As mentioned previously, a row in a PRACH/RACH configuration table can specify the time-domain PRACH occasion pattern for one PRACH configuration period.

[0091] In accordance with an exemplary embodiment, there are up to 64 sequences that can be used as RA preambles per PRACH occasion in each cell. The radio resource control (RRC) parameter such as totalNumberOfRA-Preambles can be used to determine how many of these 64 sequences are used as RA preambles per PRACH occasion in each cell. The 64 sequences may be configured by including firstly all the available cyclic shifts of a root Zadoff-Chu sequence, and secondly in the order of increasing root index, until 64 preambles have been generated for the PRACH occasion.

[0092] According to some exemplary embodiments, there may be an association between an SSB and a PRACH occasion. For example, one-to-one association between an SSB and a PRACH occasion (e.g., one SSB per PRACH occasion) can be supported in the NR system. Similarly, one-to-many and/or many-to-one association between SSB(s) and PRACH occasion(s) can also be supported in the NR system.

[0093] FIGS. 1C-1D are diagrams illustrating examples of an association between an SSB and a PRACH occasion according to some embodiments of the present disclosure. In the example of one SSB per PRACH occasion as shown in FIG. 1C, SSB0, SSB1, SSB2 and SSB3 are associated with four different PRACH occasions, respectively. In the example of two SSBs per PRACH occasion as shown in FIG. 1D, SSB0 and SSB1 are associated with a PRACH occasion, and SSB2 and SSB3 are associated with another PRACH occasion. It can be appreciated that the association between an SSB and a PRACH occasion as shown in FIG. 1C or FIG. 1D is just as an example, and other suitable association between an SSB and a PRACH occasion with a proper PRACH preamble format may also be implemented.

[0094] In accordance with an exemplary embodiment, a gNB can use different transmission beams to transmit the respective SSBs to a UE. In response to reception of the SSBs from the gNB, the UE can send PRACH preambles to the gNB in an associated PRACH occasion. According to the association between an SSB and a PRACH occasion and the mapping from an SSB to a transmission beam, the gNB can use the PRACH preambles received from the UE to determine its transmission beam preferred by the UE. The gNB can use the determined transmission beam in the DL transmission and optionally in the UL reception.

[0095] In accordance with some exemplary embodiments, the preambles associated to each SSB can be configured by two RRC parameters ssb-perRACH-OccasionAndCB-PreamblesPerSSB and totalNumberOfRA-Preambles, which may be indicated by an information element (IE) such as RACH-ConfigCommon in a system information block (e.g., SIB1). A specific rule may be defined for mapping an SSB to RA preambles. For example, a UE may be provided with a number N of SSBs associated to one PRACH occasion and a number R of contention based (CB) preambles per SSB per valid PRACH occasion by parameter ssb-perRACH-OccasionAndCB-PreamblesPerSSB. If N<1, one SSB is mapped to 1/N consecutive valid PRACH occasions and R contention based preambles with consecutive indexes associated with the SSB per valid PRACH occasion start from preamble index 0. If N≥1, R contention based preambles with consecutive indexes associated with SSB n, 0≤n≤N−1, per valid PRACH occasion start from preamble index n.Math.N.sub.preamble.sup.total/N, where N.sub.preamble.sup.total is provided by parameter totalNumberOfRA-Preambles and is an integer multiple of N.

[0096] FIG. 1E is a diagram illustrating an example of mapping between an SSB and RA preambles according to an embodiment of the present disclosure. In this example, the number of PRACH slots in one PRACH configuration period is 2, the number of PRACH occasions in one PRACH slot is 4, and the number of SSBs in one PRACH occasion is 2. As shown in FIG. 1E, the mapping between an SSB and PRACH preambles may be done by consecutively associating M preambles to each SSB, where M.sup.=N.sub.preamble.sup.total/N. For instance, the preambles can be taken as follows: [0097] first, in increasing order of preamble indexes within a single PRACH occasion; [0098] second, in increasing order of frequency resource indexes for frequency multiplexed PRACH occasions; and [0099] third, in increasing order of time.

[0100] FIG. 1F is a diagram illustrating exemplary preambles per SSB per PRACH occasion according to an embodiment of the present disclosure. In this embodiment, for each SSB, the associated preambles per PRACH occasion are further divided into two sets for contention-based random access (CBRA) and contention free random access (CFRA). The number of contention-based (CB) preambles per SSB per PRACH occasion may be signaled by an RRC parameter such as CB-preambles-per-SSB. Preamble indices for CBRA and CFRA are mapped consecutively for one SSB in one PRACH occasion, as shown in FIG. 1F.

[0101] FIG. 2 is a diagram illustrating an exemplary two-step RA procedure according to an embodiment of the present disclosure. Similar to the procedure as shown in FIG. 1A, in the procedure shown in FIG. 2, a UE can detect a SS by receiving 201 an SSB (e.g., comprising a PSS, a SSS and PBCH) from a gNB, and decode 202 system information (e.g., remaining minimum system information (RMSI) and other system information (OSI)) broadcasted in the DL. Compared to the four-step approach as shown in FIG. 1A, the UE performing the procedure in FIG. 2 can complete random access in only two steps. Firstly, the UE sends 203a/203b to the gNB a message A (msgA) including RA preamble together with higher layer data such as an RRC connection request possibly with some payload on PUSCH. Secondly, the gNB sends 204 to the UE a RAR (also called message B or msgB) including UE identifier assignment, timing advance information, a contention resolution message, and etc.

[0102] In the two-step RA procedure, the preamble and msgA PUSCH can be transmitted by the UE in one message called message A. Separate PRACH resources (defined by PRACH occasions and preamble sequences) can be configured for the two-step RA procedure and the four-step RA procedure so that the network can distinguish the legacy UEs performing the four-step RA procedure from the UEs performing the two-step RA procedure.

[0103] Some agreement may be made regarding PRACH configuration for two-step RA. Considering the relation of PRACH resources between two-step RA and four-step RA, the network may have the flexibility to configure the following options: [0104] Option I: separate PRACH occasions for two-step RA and four-step RA; and [0105] Option II: shared PRACH occasion but separate preambles for two-step RA and four-step RA.

[0106] For the four-step RA procedure, the SSB to RO and preamble mapping is described in connection with FIGS. 1C-1F. For the two-step RA procedure, it also may be needed to map an SSB to a RO and the corresponding preambles adaptively, according to the selected option (e.g., Option I or Option II) for PRACH configuration. However, there may be no detail signaling schemes to support either of the two options, and the SSB to preamble and RO mapping may be different for different options selected.

[0107] In the proposed solution according to some exemplary embodiments, a network node can inform a terminal device of an association between signaling transmissions for a RA procedure, considering a two-step RACH CFRA is also supported. In accordance with an exemplary embodiment, the proposed solution may allow a gNB to inform a UE of the SSB to RO and preamble mapping, e.g., for the case that the ROs for two-step RA are shared with four-step RA but separate preambles for two-step RA and four-step RA. In accordance with another exemplary embodiment, the proposed solution may enable preamble and PUSCH allocation in a two-step CFRA procedure. The proposed solution may be applied in a backward compatible manner, with reduced complexity of implementation. Optionally, the legacy SSB to RO and preamble mapping for four-step RA can be utilized, reused or simply revised for two-step RA, so as to minimize signaling overhead while providing the flexibility for the SSB to RO and preamble mapping and the msgA PUSCH resource determination without impact on the legacy four-step RA procedure.

[0108] In accordance with some exemplary embodiments, an association between DL and UL transmissions may be adaptive to a relation between RO configuration schemes for different RA procedures. For example, separate configuration rules for the SSB to RO and preamble mapping may be introduced for two-step RA and four-step RA. According to some exemplary embodiments, configuration schemes for the SSB to RO and preamble mapping may be determined, for example, depending on the two-step RO defined when two-step RACH CFRA is supported. In the case that a shared RO is configured for two-step RA and four-step RA but separate preambles for two-step RA and four-step RA, the SSB to RO and preamble mapping rule used for two-step RA may be defined based at least in part on the rule used for four-step RA.

[0109] FIGS. 3A-3E are diagrams illustrating examples of preamble configuration according to some embodiments of the present disclosure. In these examples, a RO can be shared by two-step RA and four-step RA. According to some exemplary embodiments, there are up to 64 sequences that can be used as RA preambles per RO in each cell. As shown in FIGS. 3A-3E, separate preambles may be configured for two-step RA and four-step RA. The preambles configured for two-step RA may comprise separate preambles for CBRA and CFRA. Similarly, the preambles configured for four-step RA may comprise separate preambles for CBRA and CFRA. It will be realized that parameters, variables, settings and mapping related to the signaling transmission and resource allocation described herein are just examples. Other suitable parameter settings, the associated configurations and the specific values thereof may also be applicable to implement the proposed methods.

[0110] According to preamble indices configuration for two-step and four-step RA shown in FIG. 3A, preambles per RO are divided into four sets of preambles used for CBRA in four-step RA, CFRA in four-step RA, CBRA in two-step RA and CFRA in two-step RA, respectively. In an exemplary embodiment, the preambles for four-step RA per RO may be configured such that the value of the four-step RA parameter totalNumberOfRA-Preambles is less than the maximum number of preambles per RO (e.g., MaxNumberOfRA-Preambles=64), and the rest preambles (e.g., 64−totalNumberOfRA-Preambles) may be used as the preambles for two-step RA per RO. Optionally, configuration of the SSB to RO mapping may be provisioned separately for two-step RA and four-step RA. In this case, the number of SSBs mapped to a RO for two-step RA (which may be indicated by a parameter such as ssb-perRACH-Occasion-2Step) may be the same as or different from the number of SSBs mapped to a RO for four-step RA.

[0111] According to an exemplary embodiment, a subset of the “64-totalNumberOfRA-Preambles” preambles may be used for two-step CBRA, while the remaining subset of “64−totalNumberOfRA-Preambles” preambles may be used for two-step CFRA. In the example of FIG. 3A, the preambles per RO are divided for two-step RA and four-step RA, where the number of preambles configured for four-step RA is indicated by the parameter totalNumberOfRA-Preambles=56, and the rest 8 preambles are used for two-step RA, with 2 preambles per SSB, one of the preambles is used for CBRA, and the other preamble is used for CFRA.

[0112] According to another exemplary embodiment, all the “64-totalNumberOfRA-Preambles” preambles may be used for two-step CBRA, and a part of the four-step CFRA preambles may be configured for two-step CFRA. In the example of FIG. 3B, the preambles per RO are divided for two-step RA and four-step RA, where the number of preambles configured for four-step RA is indicated by the parameter totalNumberOfRA-Preambles=56, the rest 8 preambles are used for two-step CBRA with 2 preambles per SSB, and 2 four-step CFRA preambles per SSB may be allocated for two-step CFRA.

[0113] In accordance with some exemplary embodiments, a separate parameter for two-step RA (e.g., totalNumberOfRA-Preambles-2step) may be introduced to indicate the number of preambles for two-step RA in a RO. Optionally, the preambles for four-step RA per RO may be configured such that totalNumberOfRA-Preambles<MaxNumberOfRA-Preambles (e.g., 64), and the preambles for two-step RA per RO may be configured such that totalNumberOfRA-Preambles-2step<MaxNumberOfRA-Preambles−totalNumberOfRA-Preambles. In this case, a subset of the rest preambles (MaxNumberOfRA-Preambles−totalNumberOfRA-Preambles) are used as the preambles for two-step RA per RO, and the remaining preamble(s) may be reserved and not used for RA. Thus, some preambles per RO may be used for four-step RA, some may be used for two-step RA, and some may be reserved.

[0114] According to an exemplary embodiment, a two-step CFRA preamble can be allocated from the totalNumberOfRA-Preambles-2step preambles. In the example of FIG. 3C, the number of preambles configured in a RO is MaxNumberOfRA-Preambles=64, the number of preambles configured for four-step RA is totalNumberOfRA-Preambles=52, and the number of preambles configured for two-step RA is totalNumberOfRA-Preambles-2step=8, where 4 of them are used for CBRA and the other 4 are used for CFRA, and the rest 4 preambles are reserved and not used for RA.

[0115] According to another exemplary embodiment, all the totalNumberOfRA-Preambles-2step preambles may be used for two-step CBRA, and a part of the four-step CFRA preambles may be configured for two-step CFRA. In the example of FIG. 3D, the preambles per RO are divided for two-step RA and four-step RA, where the number of preambles configured for four-step RA and two-step CFRA is indicated by the parameter totalNumberOfRA-Preambles=52, the number of preambles configured for two-step CBRA is indicated by the parameter totalNumberOfRA-Preambles-2step=8, and the rest 4 preambles are reserved and not used for RA. As shown in FIG. 3D, the two-step CFRA preamble can be allocated from the set of preambles allocated to four-step CFRA, e.g., 2 four-step CFRA preambles per SSB may be allocated for two-step CFRA.

[0116] In accordance with some exemplary embodiments, the number of preambles used for both two-step RA and four-step RA per RO may be indicated by a parameter such as totalNumberOfRA-Preambles if it is configured. A separate parameter such as CB-preambles-per-SSB-2step may be introduced to indicate the number of CB preambles per SSB for two-step RA (e.g., for configuring the preamble indices for two-step RA), such that the sum of the CB preambles configured for both two-step RA and four-step RA per RO (e.g., the sum of the values of CB-preambles-per-SSB and CB-preambles-per-SSB-2step) is less than or equal to the value of the parameter MaxNumberOfRA-Preambles (e.g., 64), or is less than or equal to the value of the parameter totalNumberOfRA-Preambles if it is configured.

[0117] Optionally, a part of the CFRA preambles initially usable for four-step RA may be configured as the preambles for two-step RA. In this case, a network node such as a gNB may need to avoid using these preambles for four-step CFRA. This can be done, for example via network implementation, or by specifying a rule that the preambles configured or reused for two-step RA (e.g., by defining a parameter such as CB-preambles-per-SSB-2step) are not valid for four-step CFRA. In the example of FIG. 3E, the number of preambles configured for both two-step RA and four-step RA per RO is 64, the number of CBRA preambles configured for four-step RA per SSB per RO is CB-preambles-per-SSB=4, the number of CBRA preambles configured for two-step RA per SSB per RO is CB-preambles-per-SSB-2step=2, and the rest preambles are for CFRA (e.g., including 8 four-step CFRA preambles and 2 two-step CFRA preambles per SSB).

[0118] In accordance with some exemplary embodiments, the two-step CFRA preambles may be fully or partially shared with four-step CFRA. In this case, a sharable CFRA preamble may be configured as a two-step CFRA preamble or a four-step CFRA preamble, as required. According to an exemplary embodiment, whether a CFRA preamble is configured for two-step RA or four-step RA can be explicitly signaled to a UE by a gNB, for example, by RRC messages (e.g., in RRC reconfiguration messages, or in an information element (IE) such as “RACH-ConfigDedicated” IE, etc.) or by downlink control information (DCI) such as DCI for PDCCH ordered CFRA. For example, when a two-step CFRA is configured and to be used for a RA procedure, at least one of the following parameters may be signaled in an RRC message or DCI transmitted from the network side to the UE side: [0119] a CFRA preamble identifier (ID); and [0120] RA type: two-step or four-step RA (e.g., whether the CFRA preamble is for two-step RA or four-step RA can be configured by the network dynamically).

[0121] Please note that the “preamble identifier” used herein may be any information which can identify or indicate the preamble. Alternatively or additionally, a RA type for which a CFRA preamble indicated by the CFRA preamble ID is to be used can be selected by the UE. For example, the RA type selection may be performed (e.g., by a UE) in an implicitly manner, for example, based on at least one of the following factors: [0122] the measurement on downlink signals and channels by the UE (e.g., reference signal received power (RSRP)/reference signal received quality (RSRQ), etc.); [0123] the service type (e.g., a two-step RACH may be selected for UEs in a time-critical operation, and a four-step RACH may be selected for UEs in non-time critical operation); [0124] the frequency band in operation (e.g., a two-step RACH can be selected by UEs working in unlicensed band to reduce the number of listen-before-talks (LBTs) to complete a RA procedure; otherwise, a four-step RACH may be always used); [0125] the number of times failed in one type of RA procedure (e.g. when a UE failed to access the network K times based on two-step RA, it can select a four-step RA procedure. Here the number of trials may be a predetermined value or signaled from a base station via e.g. a broadcasting message); [0126] the coverage of the current cell (e.g., when a gNB is indoor and intended coverage is really small (smaller than a threshold L km), a two-step RACH can always be used); [0127] the PUSCH resource (e.g., if a given instance of a two-step PUSCH resource is determined as not available (e.g. occupied by a higher priority UL transmission from the UE, or the subframe is not a UL subframe), the UE may switch to four-step transmission for that instance); and [0128] the UE's speed (e.g. in the case that the UE is stationary, a two-step RACH may be selected).

[0129] In a two-step RA procedure, the RA preamble can be transmitted in a RO, and the msgA PUSCH can be transmitted in a PUSCH occasion (PO) configured with one or more resource units (RUs). The PUSCH RU (PRU) for two-step RA can be defined as the PO and at least one of demodulation reference signal (DMRS) port and DMRS sequence usable for the msgA payload transmission. The PRU may occupy a contiguous set of subcarriers and symbols.

[0130] In accordance with some exemplary embodiments, the two-step RACH CFRA preambles determined according to various embodiments may be mapped to a set of msgA POs/PRUs. Alternatively or additionally, the msgA PO (e.g., including PO/PRU) may be indicated or signaled from the network to the UE, for example, in a an RRC message or in DCI. According to an exemplary embodiment, the PO/PRU for msgA PUSCH transmission can be determined by a preamble ID associated with a PO, a PO/PRU ID indicating a PO, and/or the PO/PRU allocation directly provided by the network (e.g., a PO from a reserved PO set, or a dynamic scheduled PO).

[0131] In accordance with some exemplary embodiments, for CFRA msgA resource determination, the preamble ID (and optionally some other information such as the PO/PRU ID) can be signaled in: [0132] DCI (e.g., DCI for physical downlink control channel (PDCCH) ordered CFRA); [0133] RRC messages such as RRC reconfiguration messages (e.g., in “RACH-ConfigDedicated” IE, etc.); [0134] Handover command (which may include the RRC reconfiguration message generated by a target cell/gNB for handover) from the target cell/gNB to a source cell/gNB.

[0135] In accordance with some exemplary embodiments, the two-step CFRA PO/PRU set may be the same as the CBRA PO/PRU reserved set. Optionally, the two-step CFRA PO/PRU set may be separately reserved. According to an exemplary embodiment, the mapping between a CFRA preamble and a CFRA PO/PRU may be configured for two-step RA, for example, according to a specific rule.

[0136] It is noted that some embodiments of the present disclosure are mainly described in relation to 5G or NR specifications being used as non-limiting examples for certain exemplary network configurations and system deployments. As such, the description of exemplary embodiments given herein specifically refers to terminology which is directly related thereto. Such terminology is only used in the context of the presented non-limiting examples and embodiments, and does naturally not limit the present disclosure in any way. Rather, any other system configuration or radio technologies may equally be utilized as long as exemplary embodiments described herein are applicable.

[0137] FIG. 4 is a flowchart illustrating a method 400 according to some embodiments of the present disclosure. The method 400 illustrated in FIG. 4 may be performed by a network node or an apparatus communicatively coupled to the network node. In accordance with an exemplary embodiment, the network node may comprise a base station such as gNB. The network node can be configured to communicate with one or more terminal devices such as UEs which may be able to support one or more RA approaches such as two-step RA and/or four-step RA.

[0138] According to the exemplary method 400 illustrated in FIG. 4, the network node can determine configuration information for a contention free preamble in a RO, based at least in part on mapping between SSBs and preambles for two-step RA in the RO, as shown in block 402. The contention free preamble may be applicable for the two-step RA. In accordance with some exemplary embodiments, the network node can transmit the configuration information to a terminal device, as shown in block 404. As an example, the configuration information may be carried in a broadcast information block (such as SIB1) transmitted to the terminal device from the network node. According to an exemplary embodiment, the mapping between SSBs and preambles for two-step RA in the RO may be represented or indicated by one or more parameters related to configuration of four-step RA preambles and/or two-step RA preambles in the RO, for example, including but not limited to CB-preambles-per-SSB, CB-preambles-per-SSB-2step, totalNumberOfRA-Preambles, totalNumberOfRA-Preambles-2step, etc. The configuration information may be used to determine or derive how the contention free preamble (e.g., a two-step CFRA preamble or a four-step CFRA preamble) is configured in the RO, as described with respect to FIGS. 3A-3E.

[0139] In accordance with some exemplary embodiments, the configuration information may comprise a preamble ID of the contention free preamble. The preamble ID may be signaled to the terminal device from the network node, for example, by an RRC message (e.g., in an RRC reconfiguration message or other suitable messages or signaling information) or DCI, even if the CFRA preamble set is determined implicitly by the four-step RA preambles and two-step CBRA preambles. According to the configuration information, the terminal device can implement accessing to the network node by performing a proper RA procedure.

[0140] In accordance with some exemplary embodiments, the RO may be configured with the preambles for the two-step RA and preambles for four-step RA (e.g., the preambles for two-step and four-step RA as shown in FIGS. 3A-3E). In this case, the RO may be shared by the two-step RA and the four-step RA. Optionally, one or more preambles may be reserved in the RO (e.g., the preambles not used for RA in FIGS. 3C-3D).

[0141] In accordance with some exemplary embodiments, the configuration information may comprise at least one of: [0142] a first parameter to indicate mapping between an SSB and one or more contention free preambles for the two-step RA (e.g., preamble indices for two-step CFRA as shown in FIGS. 3A-3E); and [0143] a second parameter to indicate mapping between an SSB and one or more contention-based preambles for the two-step RA (e.g., preamble indices for two-step CBRA as shown in FIGS. 3A-3E).

[0144] Alternatively or additionally, the configuration information may comprise at least one of: [0145] a third parameter to indicate a number of one or more contention free preambles per SSB for two-step RA (e.g., CF-preambles-per-SSB-2step, etc.); and [0146] a fourth parameter to indicate a number of one or more contention-based preambles per SSB for two-step RA (e.g., CB-preambles-per-SSB-2step, etc.).

[0147] In accordance with some exemplary embodiments, the first parameter may be related to the second parameter. For example, the second parameter may be used to determine the first parameter, or vice versa. Similarly, the third parameter may be related to the fourth parameter, and optionally the fourth parameter may be used to determine the third parameter, or vice versa. According to an exemplary embodiment, the first, second, third and fourth parameters may be associated with each other. The indication information (e.g., an index, an identifier, an indicator, a resource position, etc.) of the contention free preamble in the RO may be indicated by the configuration information, for example, according to at least one of the first, second, third and fourth parameters.

[0148] In accordance with some exemplary embodiments, the one or more contention free preambles for the two-step RA may comprise at least one preamble allocated from a set of contention free preambles for four-step RA (e.g., from some CFRA preambles for four-step RA as described in 3GPP standards release 15). In this case, at least a part of four-step CFRA preambles as described in 3GPP standards release 15 may be configured for two-step CFRA, as shown in FIG. 3B, FIG. 3D and FIG. 3E.

[0149] In accordance with some exemplary embodiments, the contention free preamble may also be applicable for four-step RA. In this case, one or more preambles in the RO may be shared by two-step CFRA and four-step CFRA. Accordingly, the one or more preambles may be configured or used as preambles for two-step CFRA or four-step CFRA, as required.

[0150] In accordance with some exemplary embodiments, the network node may inform the terminal device of whether the contention free preamble is configured for the two-step RA or the four-step RA (e.g., by indicating a RA type for the configured contention free preamble). According to such explicit indication information or signaling from the network node, the terminal device can determine to use the configured contention free preamble by performing the two-step RA or the four-step RA.

[0151] In accordance with some exemplary embodiments, it may be determined by the terminal device whether to use the contention free preamble for the two-step RA or the four-step RA, according to at least one of: [0152] a measurement on downlink transmission (e.g., downlink signals and/or channels quality); [0153] a service type (e.g. a time-critical or non-time critical service); [0154] a frequency band in operation (e.g., a licensed or unlicensed band); [0155] a number of failures in a type of RA; [0156] a cell coverage; [0157] an uplink shared channel resource (e.g., PUSCH resource available for RA); and [0158] a speed of the terminal device (or other mobility information of the terminal device).

[0159] In accordance with some exemplary embodiments, the contention free preamble may be associated with uplink radio resource. According to an exemplary embodiment, the uplink radio resource may comprise at least one of: an uplink shared channel occasion (e.g., PO), and one or more resource units configured in the uplink shared channel occasion (e.g., PRUs).

[0160] In accordance with some exemplary embodiments, the uplink radio resource may be determined according to at least one of: [0161] a contention free preamble identifier (e.g., CFRA preamble ID); [0162] an identifier of the uplink shared channel occasion (e.g., PO ID); [0163] identifiers of the one or more resource units (e.g., PRU IDs); and [0164] RA resource allocated by the network node (e.g., comprising reserved uplink shared channel resource or dynamically scheduled uplink shared channel resource).

[0165] FIG. 5 is a flowchart illustrating a method 500 according to some embodiments of the present disclosure. The method 500 illustrated in FIG. 5 may be performed by a terminal device or an apparatus communicatively coupled to the terminal device. In accordance with an exemplary embodiment, the terminal device such as a UE can be configured to communicate with a network node such as a gNB by supporting one or more RA approaches such as two-step RA and/or four-step RA.

[0166] According to the exemplary method 500 illustrated in FIG. 5, the terminal device may receive, from a network node (such as the network node described with respect to FIG. 4), configuration information for a contention free preamble in a RO, as shown in block 502. The configuration information may be based at least in part on mapping between SSBs and preambles for two-step RA in the RO, and the contention free preamble may be applicable for the two-step RA.

[0167] It can be appreciated that the steps, operations and related settings of the method 500 illustrated in FIG. 5 may correspond to the steps, operations and related settings of the method 400 illustrated in FIG. 4. It also can be appreciated that the contents and function of the configuration information for the contention free preamble as described with respect to FIG. 5 may correspond to the contents and function of the configuration information for the contention free preamble as described with respect to FIG. 4, respectively. According to an exemplary embodiment, the configuration information transmitted by the network node as described in connection with FIG. 4 may be the configuration information received by the terminal device as described in connection with FIG. 5.

[0168] Optionally, the terminal device may use the contention free preamble according to the configuration information, as shown in block 504. In accordance with some exemplary embodiments, the terminal device may receive, from the network node, information about whether the contention free preamble is configured for the two-step RA or the four-step RA.

[0169] In accordance with some exemplary embodiments, the terminal device can determine whether to use the contention free preamble for the two-step RA or the four-step RA, according to a measurement on downlink transmission, a service type, a frequency band in operation, a number of failures in a type of RA, a cell coverage, an uplink shared channel resource, a speed of the terminal device, or any combination thereof.

[0170] In accordance with some exemplary embodiments, the contention free preamble may be mapped to a PO/PRU(s). Optionally, the information about CFRA preamble to CFRA PO/PRU mapping may be indicated or signaled from the network node to the terminal device, e.g. in a two-step RA trigger message.

[0171] The proposed solution according to one or more exemplary embodiments can enable SSB to RO and preamble mapping in a RA procedure such as a two-step CFRA procedure. In accordance with some exemplary embodiments, the mapping between CFRA preamble and the CFRA PO/PRU is configured for the two-step RA procedure. In the case that the ROs are shared by two-step RA and four-step RA, the configuration rule and parameters of the SSB to RO and preamble mapping for the two-step RA may be based at least partly on the configuration rule and parameters of the SSB to RO and preamble mapping for the four-step RA, so as to improve flexibility of transmission configuration and enhance resource utilization.

[0172] The various blocks shown in FIGS. 4-5 may be viewed as method steps, and/or as operations that result from operation of computer program code, and/or as a plurality of coupled logic circuit elements constructed to carry out the associated function(s). The schematic flow chart diagrams described above are generally set forth as logical flow chart diagrams. As such, the depicted order and labeled steps are indicative of specific embodiments of the presented methods. Other steps and methods may be conceived that are equivalent in function, logic, or effect to one or more steps, or portions thereof, of the illustrated methods. Additionally, the order in which a particular method occurs may or may not strictly adhere to the order of the corresponding steps shown.

[0173] FIG. 6 is a block diagram illustrating an apparatus 600 according to various embodiments of the present disclosure. As shown in FIG. 6, the apparatus 600 may comprise one or more processors such as processor 601 and one or more memories such as memory 602 storing computer program codes 603. The memory 602 may be non-transitory machine/processor/computer readable storage medium. In accordance with some exemplary embodiments, the apparatus 600 may be implemented as an integrated circuit chip or module that can be plugged or installed into a network node as described with respect to FIG. 4, or a terminal device as described with respect to FIG. 5. In such case, the apparatus 600 may be implemented as a network node as described with respect to FIG. 4, or a terminal device as described with respect to FIG. 5.

[0174] In some implementations, the one or more memories 602 and the computer program codes 603 may be configured to, with the one or more processors 601, cause the apparatus 600 at least to perform any operation of the method as described in connection with FIG. 4. In other implementations, the one or more memories 602 and the computer program codes 603 may be configured to, with the one or more processors 601, cause the apparatus 600 at least to perform any operation of the method as described in connection with FIG. 5. Alternatively or additionally, the one or more memories 602 and the computer program codes 603 may be configured to, with the one or more processors 601, cause the apparatus 600 at least to perform more or less operations to implement the proposed methods according to the exemplary embodiments of the present disclosure.

[0175] FIG. 7 is a block diagram illustrating an apparatus 700 according to some embodiments of the present disclosure. As shown in FIG. 7, the apparatus 700 may comprise a determining unit 701 and a transmitting unit 702. In an exemplary embodiment, the apparatus 700 may be implemented in a network node such as a gNB. The determining unit 701 may be operable to carry out the operation in block 402, and the transmitting unit 702 may be operable to carry out the operation in block 404. Optionally, the determining unit 701 and/or the transmitting unit 702 may be operable to carry out more or less operations to implement the proposed methods according to the exemplary embodiments of the present disclosure.

[0176] FIG. 8 is a block diagram illustrating an apparatus 800 according to some embodiments of the present disclosure. As shown in FIG. 8, the apparatus 800 may comprise a receiving unit 801, and optionally a using unit 802. In an exemplary embodiment, the apparatus 800 may be implemented in a terminal device such as a UE. The receiving unit 801 may be operable to carry out the operation in block 502, and the using unit 802 may be operable to carry out the operation in block 504. Optionally, the receiving unit 801 and/or the using unit 802 may be operable to carry out more or less operations to implement the proposed methods according to the exemplary embodiments of the present disclosure.

[0177] FIG. 9 is a block diagram illustrating a telecommunication network connected via an intermediate network to a host computer in accordance with some embodiments of the present disclosure.

[0178] With reference to FIG. 9, in accordance with an embodiment, a communication system includes a telecommunication network 910, such as a 3GPP-type cellular network, which comprises an access network 911, such as a radio access network, and a core network 914. The access network 911 comprises a plurality of base stations 912a, 912b, 912c, such as NBs, eNBs, gNBs or other types of wireless access points, each defining a corresponding coverage area 913a, 913b, 913c. Each base station 912a, 912b, 912c is connectable to the core network 914 over a wired or wireless connection 915. A first UE 991 located in a coverage area 913c is configured to wirelessly connect to, or be paged by, the corresponding base station 912c. A second UE 992 in a coverage area 913a is wirelessly connectable to the corresponding base station 912a. While a plurality of UEs 991, 992 are illustrated in this example, the disclosed embodiments are equally applicable to a situation where a sole UE is in the coverage area or where a sole UE is connecting to the corresponding base station 912.

[0179] The telecommunication network 910 is itself connected to a host computer 930, which may be embodied in the hardware and/or software of a standalone server, a cloud-implemented server, a distributed server or as processing resources in a server farm. The host computer 930 may be under the ownership or control of a service provider, or may be operated by the service provider or on behalf of the service provider. Connections 921 and 922 between the telecommunication network 910 and the host computer 930 may extend directly from the core network 914 to the host computer 930 or may go via an optional intermediate network 920. An intermediate network 920 may be one of, or a combination of more than one of, a public, private or hosted network; the intermediate network 920, if any, may be a backbone network or the Internet; in particular, the intermediate network 920 may comprise two or more sub-networks (not shown).

[0180] The communication system of FIG. 9 as a whole enables connectivity between the connected UEs 991, 992 and the host computer 930. The connectivity may be described as an over-the-top (OTT) connection 950. The host computer 930 and the connected UEs 991, 992 are configured to communicate data and/or signaling via the OTT connection 950, using the access network 911, the core network 914, any intermediate network 920 and possible further infrastructure (not shown) as intermediaries. The OTT connection 950 may be transparent in the sense that the participating communication devices through which the OTT connection 950 passes are unaware of routing of uplink and downlink communications. For example, the base station 912 may not or need not be informed about the past routing of an incoming downlink communication with data originating from the host computer 930 to be forwarded (e.g., handed over) to a connected UE 991. Similarly, the base station 912 need not be aware of the future routing of an outgoing uplink communication originating from the UE 991 towards the host computer 930.

[0181] FIG. 10 is a block diagram illustrating a host computer communicating via a base station with a UE over a partially wireless connection in accordance with some embodiments of the present disclosure.

[0182] Example implementations, in accordance with an embodiment, of the UE, base station and host computer discussed in the preceding paragraphs will now be described with reference to FIG. 10. In a communication system 1000, a host computer 1010 comprises hardware 1015 including a communication interface 1016 configured to set up and maintain a wired or wireless connection with an interface of a different communication device of the communication system 1000. The host computer 1010 further comprises a processing circuitry 1018, which may have storage and/or processing capabilities. In particular, the processing circuitry 1018 may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. The host computer 1010 further comprises software 1011, which is stored in or accessible by the host computer 1010 and executable by the processing circuitry 1018. The software 1011 includes a host application 1012. The host application 1012 may be operable to provide a service to a remote user, such as UE 1030 connecting via an OTT connection 1050 terminating at the UE 1030 and the host computer 1010. In providing the service to the remote user, the host application 1012 may provide user data which is transmitted using the OTT connection 1050.

[0183] The communication system 1000 further includes a base station 1020 provided in a telecommunication system and comprising hardware 1025 enabling it to communicate with the host computer 1010 and with the UE 1030. The hardware 1025 may include a communication interface 1026 for setting up and maintaining a wired or wireless connection with an interface of a different communication device of the communication system 1000, as well as a radio interface 1027 for setting up and maintaining at least a wireless connection 1070 with the UE 1030 located in a coverage area (not shown in FIG. 10) served by the base station 1020. The communication interface 1026 may be configured to facilitate a connection 1060 to the host computer 1010. The connection 1060 may be direct or it may pass through a core network (not shown in FIG. 10) of the telecommunication system and/or through one or more intermediate networks outside the telecommunication system. In the embodiment shown, the hardware 1025 of the base station 1020 further includes a processing circuitry 1028, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. The base station 1020 further has software 1021 stored internally or accessible via an external connection.

[0184] The communication system 1000 further includes the UE 1030 already referred to. Its hardware 1035 may include a radio interface 1037 configured to set up and maintain a wireless connection 1070 with a base station serving a coverage area in which the UE 1030 is currently located. The hardware 1035 of the UE 1030 further includes a processing circuitry 1038, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. The UE 1030 further comprises software 1031, which is stored in or accessible by the UE 1030 and executable by the processing circuitry 1038. The software 1031 includes a client application 1032. The client application 1032 may be operable to provide a service to a human or non-human user via the UE 1030, with the support of the host computer 1010. In the host computer 1010, an executing host application 1012 may communicate with the executing client application 1032 via the OTT connection 1050 terminating at the UE 1030 and the host computer 1010. In providing the service to the user, the client application 1032 may receive request data from the host application 1012 and provide user data in response to the request data. The OTT connection 1050 may transfer both the request data and the user data. The client application 1032 may interact with the user to generate the user data that it provides.

[0185] It is noted that the host computer 1010, the base station 1020 and the UE 1030 illustrated in FIG. 10 may be similar or identical to the host computer 930, one of base stations 912a, 912b, 912c and one of UEs 991, 992 of FIG. 9, respectively. This is to say, the inner workings of these entities may be as shown in FIG. 10 and independently, the surrounding network topology may be that of FIG. 9.

[0186] In FIG. 10, the OTT connection 1050 has been drawn abstractly to illustrate the communication between the host computer 1010 and the UE 1030 via the base station 1020, without explicit reference to any intermediary devices and the precise routing of messages via these devices. Network infrastructure may determine the routing, which it may be configured to hide from the UE 1030 or from the service provider operating the host computer 1010, or both. While the OTT connection 1050 is active, the network infrastructure may further take decisions by which it dynamically changes the routing (e.g., on the basis of load balancing consideration or reconfiguration of the network).

[0187] Wireless connection 1070 between the UE 1030 and the base station 1020 is in accordance with the teachings of the embodiments described throughout this disclosure. One or more of the various embodiments improve the performance of OTT services provided to the UE 1030 using the OTT connection 1050, in which the wireless connection 1070 forms the last segment. More precisely, the teachings of these embodiments may improve the latency and the power consumption, and thereby provide benefits such as lower complexity, reduced time required to access a cell, better responsiveness, extended battery lifetime, etc.

[0188] A measurement procedure may be provided for the purpose of monitoring data rate, latency and other factors on which the one or more embodiments improve. There may further be an optional network functionality for reconfiguring the OTT connection 1050 between the host computer 1010 and the UE 1030, in response to variations in the measurement results. The measurement procedure and/or the network functionality for reconfiguring the OTT connection 1050 may be implemented in software 1011 and hardware 1015 of the host computer 1010 or in software 1031 and hardware 1035 of the UE 1030, or both. In embodiments, sensors (not shown) may be deployed in or in association with communication devices through which the OTT connection 1050 passes; the sensors may participate in the measurement procedure by supplying values of the monitored quantities exemplified above, or supplying values of other physical quantities from which the software 1011, 1031 may compute or estimate the monitored quantities. The reconfiguring of the OTT connection 1050 may include message format, retransmission settings, preferred routing etc.; the reconfiguring need not affect the base station 1020, and it may be unknown or imperceptible to the base station 1020. Such procedures and functionalities may be known and practiced in the art. In certain embodiments, measurements may involve proprietary UE signaling facilitating the host computer 1010's measurements of throughput, propagation times, latency and the like. The measurements may be implemented in that the software 1011 and 1031 causes messages to be transmitted, in particular empty or ‘dummy’ messages, using the OTT connection 1050 while it monitors propagation times, errors etc.

[0189] FIG. 11 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIG. 9 and FIG. 10. For simplicity of the present disclosure, only drawing references to FIG. 11 will be included in this section. In step 1110, the host computer provides user data. In sub step 1111 (which may be optional) of step 1110, the host computer provides the user data by executing a host application. In step 1120, the host computer initiates a transmission carrying the user data to the UE. In step 1130 (which may be optional), the base station transmits to the UE the user data which was carried in the transmission that the host computer initiated, in accordance with the teachings of the embodiments described throughout this disclosure. In step 1140 (which may also be optional), the UE executes a client application associated with the host application executed by the host computer.

[0190] FIG. 12 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIG. 9 and FIG. 10. For simplicity of the present disclosure, only drawing references to FIG. 12 will be included in this section. In step 1210 of the method, the host computer provides user data. In an optional substep (not shown) the host computer provides the user data by executing a host application. In step 1220, the host computer initiates a transmission carrying the user data to the UE. The transmission may pass via the base station, in accordance with the teachings of the embodiments described throughout this disclosure. In step 1230 (which may be optional), the UE receives the user data carried in the transmission.

[0191] FIG. 13 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIG. 9 and FIG. 10. For simplicity of the present disclosure, only drawing references to FIG. 13 will be included in this section. In step 1310 (which may be optional), the UE receives input data provided by the host computer. Additionally or alternatively, in step 1320, the UE provides user data. In substep 1321 (which may be optional) of step 1320, the UE provides the user data by executing a client application. In substep 1311 (which may be optional) of step 1310, the UE executes a client application which provides the user data in reaction to the received input data provided by the host computer. In providing the user data, the executed client application may further consider user input received from the user. Regardless of the specific manner in which the user data was provided, the UE initiates, in substep 1330 (which may be optional), transmission of the user data to the host computer. In step 1340 of the method, the host computer receives the user data transmitted from the UE, in accordance with the teachings of the embodiments described throughout this disclosure.

[0192] FIG. 14 is a flowchart illustrating a method implemented in a communication system, in accordance with an embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIG. 9 and FIG. 10. For simplicity of the present disclosure, only drawing references to FIG. 14 will be included in this section. In step 1410 (which may be optional), in accordance with the teachings of the embodiments described throughout this disclosure, the base station receives user data from the UE. In step 1420 (which may be optional), the base station initiates transmission of the received user data to the host computer. In step 1430 (which may be optional), the host computer receives the user data carried in the transmission initiated by the base station.

[0193] According to some exemplary embodiments, there is provided a method implemented in a communication system which may include a host computer, a base station and a UE. The method may comprise providing user data at the host computer. Optionally, the method may comprise, at the host computer, initiating a transmission carrying the user data to the UE via a cellular network comprising the base station which may perform any step of the exemplary method 400 as describe with respect to FIG. 4.

[0194] According to some exemplary embodiments, there is provided a communication system including a host computer. The host computer may comprise processing circuitry configured to provide user data, and a communication interface configured to forward the user data to a cellular network for transmission to a UE. The cellular network may comprise a base station having a radio interface and processing circuitry. The base station's processing circuitry may be configured to perform any step of the exemplary method 400 as describe with respect to FIG. 4.

[0195] According to some exemplary embodiments, there is provided a method implemented in a communication system which may include a host computer, a base station and a UE. The method may comprise providing user data at the host computer. Optionally, the method may comprise, at the host computer, initiating a transmission carrying the user data to the UE via a cellular network comprising the base station. The UE may perform any step of the exemplary method 500 as describe with respect to FIG. 5.

[0196] According to some exemplary embodiments, there is provided a communication system including a host computer. The host computer may comprise processing circuitry configured to provide user data, and a communication interface configured to forward user data to a cellular network for transmission to a UE. The UE may comprise a radio interface and processing circuitry. The UE's processing circuitry may be configured to perform any step of the exemplary method 500 as describe with respect to FIG. 5.

[0197] According to some exemplary embodiments, there is provided a method implemented in a communication system which may include a host computer, a base station and a UE. The method may comprise, at the host computer, receiving user data transmitted to the base station from the UE which may perform any step of the exemplary method 500 as describe with respect to FIG. 5.

[0198] According to some exemplary embodiments, there is provided a communication system including a host computer. The host computer may comprise a communication interface configured to receive user data originating from a transmission from a UE to a base station. The UE may comprise a radio interface and processing circuitry. The UE's processing circuitry may be configured to perform any step of the exemplary method 500 as describe with respect to FIG. 5.

[0199] According to some exemplary embodiments, there is provided a method implemented in a communication system which may include a host computer, a base station and a UE. The method may comprise, at the host computer, receiving, from the base station, user data originating from a transmission which the base station has received from the UE. The base station may perform any step of the exemplary method 400 as describe with respect to FIG. 4.

[0200] According to some exemplary embodiments, there is provided a communication system which may include a host computer. The host computer may comprise a communication interface configured to receive user data originating from a transmission from a UE to a base station. The base station may comprise a radio interface and processing circuitry. The base station's processing circuitry may be configured to perform any step of the exemplary method 400 as describe with respect to FIG. 4.

[0201] In general, the various exemplary embodiments may be implemented in hardware or special purpose chips, circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the disclosure is not limited thereto. While various aspects of the exemplary embodiments of this disclosure may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.

[0202] As such, it should be appreciated that at least some aspects of the exemplary embodiments of the disclosure may be practiced in various components such as integrated circuit chips and modules. It should thus be appreciated that the exemplary embodiments of this disclosure may be realized in an apparatus that is embodied as an integrated circuit, where the integrated circuit may comprise circuitry (as well as possibly firmware) for embodying at least one or more of a data processor, a digital signal processor, baseband circuitry and radio frequency circuitry that are configurable so as to operate in accordance with the exemplary embodiments of this disclosure.

[0203] It should be appreciated that at least some aspects of the exemplary embodiments of the disclosure may be embodied in computer-executable instructions, such as in one or more program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types when executed by a processor in a computer or other device. The computer executable instructions may be stored on a computer readable medium such as a hard disk, optical disk, removable storage media, solid state memory, random access memory (RAM), etc. As will be appreciated by one of skill in the art, the function of the program modules may be combined or distributed as desired in various embodiments. In addition, the function may be embodied in whole or partly in firmware or hardware equivalents such as integrated circuits, field programmable gate arrays (FPGA), and the like.

[0204] The present disclosure includes any novel feature or combination of features disclosed herein either explicitly or any generalization thereof. Various modifications and adaptations to the foregoing exemplary embodiments of this disclosure may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings. However, any and all modifications will still fall within the scope of the non-limiting and exemplary embodiments of this disclosure.