Method and apparatus for random access

Abstract

Various embodiments of the present disclosure provide a method for random access. The method, which can be implemented by a network node, includes: determining the association between downlink transmission and uplink transmission in the two-step random access process (for example, the association between synchronization signals and physical broadcast channel blocks and random access opportunities) based at least in part on the random access resource configuration of the two-step random access process (for example, based at least in part on whether the random access resources are shared by the two-step random access process and the four-step random access process). The method also includes: sending information indicating the association to a terminal device. According to an embodiment of the present disclosure, the association between synchronization signals and physical broadcast channel blocks and random access opportunities in the two-step random access process can be flexibly and efficiently configured.

Description

Technical Field

[0001] The present disclosure relates generally to communication networks, and more particularly, to methods and apparatus for random access. Background Art

[0002] This section introduces various aspects that may help to better understand the present disclosure. Accordingly, the contents stated in this section should be read in this manner and should not be understood as an admission of what is or is not prior art.

[0003] Communication service providers and network operators are constantly faced with the challenge of delivering value and convenience to consumers (e.g., by providing compelling network services and performance). With the rapid development of networking and communication technologies, wireless communication networks such as long-term evolution (LTE) networks and new radio (NR) networks are expected to achieve high service capacity and end-user data rates with lower latency. In order to connect to a network node, a random access (RA) process can be initiated for a terminal device. During the RA process, system information (SI) and synchronization signals (SS) as well as related radio resources and transmission configurations can be notified to the terminal device through control information from the network node. The RA process can enable a terminal device to establish a session for a specific service with a network node. Thus, it is desirable to enhance the configuration and performance of the RA process. Summary of the invention

[0004] This summary is provided to introduce selected concepts in a simplified form that are further described in the following detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

[0005] Wireless communication networks such as NR / 5G networks are able to support flexible network configurations. Various signaling methods (e.g., four-step method, two-step method, etc.) can be used for the RA process of a terminal device to establish a connection with a network node. For RA processes using different signaling methods, separate radio resources need to be configured so that a terminal device implementing an RA process such as a four-step RA process can be distinguished from a terminal device implementing another RA process such as a two-step RA process. For the RA process, there may be specific associations of signaling transmissions, such as the association between synchronization signals and physical broadcast channel blocks (which are also referred to as SS / PBCH blocks or SSBs) and time-frequency physical random access channel (PRACH) opportunities (which are also referred to as RA opportunities). It may be desirable to configure the association between signaling transmissions more flexibly and efficiently for different RA processes.

[0006] Various embodiments of the present disclosure propose an RA solution that can support flexible configuration of RA processes (e.g., two-step RA processes), for example, by providing flexibility in mapping SSB to RA timing and preamble, thereby saving signaling overhead while avoiding significant impact on other RA processes (e.g., four-step RA processes).

[0007] It can be appreciated that the terms "random access opportunity (RO)", "random access channel (RACH) opportunity" or "PRACH opportunity" mentioned herein may refer to time-frequency resources that can be used for preamble transmission in the RA process, which may also be referred to as "RA opportunity". These terms may be used interchangeably herein.

[0008] According to a first aspect of the present disclosure, a method implemented by a network node is provided. The method includes: determining an association between an SSB and an RA opportunity in a two-step RA process based at least in part on whether an RA resource is shared by a two-step RA process and a four-step RA process. In the two-step RA process, a preamble and a physical uplink shared channel (PUSCH) may be sent in one message at an RA opportunity and a PUSCH opportunity, respectively. The method also includes: sending information indicating the association to a terminal device.

[0009] According to a second aspect of the present disclosure, a device that can be implemented as a network node is provided. The device includes: one or more processors, and one or more memories including computer program code. The one or more memories and the computer program code are configured to, together with the one or more processors, enable the device to at least implement any step of the method according to the first aspect of the present disclosure.

[0010] According to a third aspect of the present disclosure, there is provided a computer readable medium storing a computer program code, which, when executed on a computer, causes the computer to implement any step of the method according to the first aspect of the present disclosure.

[0011] According to a fourth aspect of the present disclosure, a device that can be implemented as a network node is provided. The device includes a determining unit and a sending unit. According to some exemplary embodiments, the determining unit is operable to at least perform the determining step of the method according to the first aspect of the present disclosure. The sending unit is operable to at least perform the sending step of the method according to the first aspect of the present disclosure.

[0012] According to a fifth aspect of the present disclosure, a method implemented by a terminal device (e.g., a user equipment (UE)) is provided. The method includes: receiving information indicating an association between an SSB and an RA opportunity in a two-step RA process from a network node. The association may be based at least in part on whether RA resources are shared by the two-step RA process and the four-step RA process. Optionally, the method may further include: implementing the two-step RA process according to the information received from the network node.

[0013] According to a sixth aspect of the present disclosure, there is provided an apparatus that can be implemented as a terminal device. The apparatus includes: one or more processors, and one or more memories including computer program codes. The one or more memories and the computer program codes are configured to, together with the one or more processors, enable the apparatus to at least implement any step of the method according to the fifth aspect of the present disclosure.

[0014] According to a seventh aspect of the present disclosure, there is provided a computer-readable medium storing a computer program code, which, when executed on a computer, causes the computer to implement any step of the method according to the fifth aspect of the present disclosure.

[0015] According to an eighth aspect of the present disclosure, a device that can be implemented as a terminal device is provided. The device includes a receiving unit and an optional implementation unit. According to some exemplary embodiments, the receiving unit is operable to at least perform the receiving step of the method according to the fifth aspect of the present disclosure. The implementation unit is operable to at least perform the implementation step of the method according to the fifth aspect of the present disclosure.

[0016] According to an exemplary embodiment, the association between the SSB and the RA opportunity in the two-step RA procedure may be further based on the RA resource configuration of the four-step RA procedure.

[0017] According to an exemplary embodiment, the association between the SSB and the RA opportunity may include: a mapping of the SSB to one or more preambles in the RA opportunity.

[0018] According to an exemplary embodiment, the RA occasions for the two-step RA procedure may be separated from RA occasions for the four-step RA procedure.

[0019] According to an exemplary embodiment, the association between the SSB and the RA opportunity in the two-step RA procedure may be the same as the association between the SSB and the RA opportunity in the four-step RA procedure.

[0020] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA procedure may also indicate: the association between the SSB and the RA opportunity in the four-step RA procedure.

[0021] According to an exemplary embodiment, the association between the SSB and the RA opportunity in the two-step RA procedure may be different from the association between the SSB and the RA opportunity in the four-step RA procedure.

[0022] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a first parameter to indicate the following:

[0023] The number of SSBs mapped to one RA opportunity for the two-step RA procedure; and

[0024] • The number of preambles mapped to one SSB for the two-step RA procedure.

[0025] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may further include a second parameter to indicate the following:

[0026] • A number of preambles in the RA occasions used for the two-step RA procedure, wherein the preambles in the RA occasions used for the two-step RA procedure may include contention-based preambles.

[0027] According to an exemplary embodiment, the preamble in the RA opportunity used for the two-step RA procedure may further include a contention-free preamble.

[0028] According to an exemplary embodiment, the RA opportunity may be shared by the two-step RA procedure and the four-step RA procedure.

[0029] According to an exemplary embodiment, the shared RA opportunity may be configured with separate preambles for the two-step RA procedure and the four-step RA procedure.Alternatively, the shared RA opportunity may be configured with at least one reserved preamble.

[0030] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a third parameter to indicate the following:

[0031] • For the two-step RA procedure, the number of SSBs mapped to the shared RA opportunities.

[0032] According to an exemplary embodiment, the third parameter may be used to determine the number of preambles mapped to an SSB in the two-step RA procedure.

[0033] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a fourth parameter to indicate the following:

[0034] • The number of preambles configured in the shared RA opportunity for the two-step RA procedure.

[0035] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a fifth parameter to indicate the following:

[0036] • The number of preambles mapped to one SSB for the two-step RA procedure.

[0037] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may further include a sixth parameter to indicate the following:

[0038] • The total number of preambles used for the two-step RA procedure and the four-step RA procedure in the shared RA occasions.

[0039] According to an exemplary embodiment, the preamble mapped to the SSB for the two-step RA procedure may be configured by using at least a portion of the contention-free preamble initially configured for the four-step RA procedure.

[0040] According to an exemplary embodiment, the two-step RA procedure and the four-step RA procedure may be configured to have the same association between the SSB and the shared RA opportunity.

[0041] According to a ninth aspect of the present disclosure, a method implemented in a communication system is provided, the communication system may include a host computer, a base station and a UE. The method may include: providing user data at the host computer. Optionally, the method may include: initiating, at the host computer, a transmission carrying the user data for the UE via a cellular network including the base station, the base station may implement any steps of the method according to the first aspect of the present disclosure.

[0042] According to a tenth aspect of the present disclosure, there is provided a communication system comprising a host computer. The host computer may include: a processing circuit 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 include a base station having a radio interface and a processing circuit. The processing circuit of the base station may be configured to implement any step of the method according to the first aspect of the present disclosure.

[0043] According to an eleventh aspect of the present disclosure, a method implemented in a communication system is provided, the communication system may include a host computer, a base station and a UE. The method may include: providing user data at the host computer. Optionally, the method may include: initiating, at the host computer, a transmission carrying the user data for the UE via a cellular network including the base station. The UE may implement any steps of the method according to the fifth aspect of the present disclosure.

[0044] According to a twelfth aspect of the present disclosure, there is provided a communication system comprising a host computer. The host computer may include: a processing circuit 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 UE may include a radio interface and a processing circuit. The processing circuit of the UE may be configured to implement any step of the method according to the fifth aspect of the present disclosure.

[0045] According to the thirteenth aspect of the present disclosure, a method implemented in a communication system is provided, and the communication system may include a host computer, a base station and a UE. The method may include: at the host computer, receiving user data transmitted from the UE to the base station, and the UE may implement any step of the method according to the fifth aspect of the present disclosure.

[0046] According to a fourteenth aspect of the present disclosure, there is provided a communication system comprising a host computer. The host computer may include a communication interface configured to receive user data originating from a transmission from a UE to a base station. The UE may include a radio interface and a processing circuit. The processing circuit of the UE may be configured to implement any step of the method according to the fifth aspect of the present disclosure.

[0047] According to a fifteenth aspect of the present disclosure, there is provided a method implemented in a communication system, the communication system may include a host computer, a base station and a UE. The method may include: at the host computer, receiving from the base station user data originating from a transmission that the base station has received from the UE. The base station may implement any steps of the method according to the first aspect of the present disclosure.

[0048] According to a sixteenth aspect of the present disclosure, a communication system is provided, which may include a host computer. The host computer may include a communication interface configured to receive user data originating from a transmission from a UE to a base station. The base station may include a radio interface and a processing circuit. The processing circuit of the base station may be configured to implement any step of the method according to the first aspect of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] The present disclosure itself, preferred modes of use and further objects may best be understood by reference to the following detailed description of embodiments when read in conjunction with the accompanying drawings, in which:

[0050] Figure 1A is a diagram illustrating an exemplary four-step RA process according to an embodiment of the present disclosure;

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

[0052] Figure 1C-1D is a diagram showing an example of association between SSB and PRACH opportunities according to some embodiments of the present disclosure;

[0053] Figure 1E is a diagram showing an example of mapping between SSB and RA preamble codes according to an embodiment of the present disclosure;

[0054] Figure 1F is a diagram illustrating an exemplary preamble code for each SSB of each PRACH opportunity according to an embodiment of the present disclosure;

[0055] Figure 2 is a diagram illustrating an exemplary two-step RA process according to an embodiment of the present disclosure;

[0056] Figures 3A-3C is a diagram showing an example of a preamble configuration of Option 1 according to some embodiments of the present disclosure;

[0057] Figure 3D-3F is a diagram showing an example of a preamble configuration of Option II according to some embodiments of the present disclosure;

[0058] Figure 4 is a flowchart illustrating a method according to some embodiments of the present disclosure;

[0059] Figure 5 is a flow chart illustrating another method according to some embodiments of the present disclosure;

[0060] Figure 6 is a block diagram illustrating an apparatus according to some embodiments of the present disclosure;

[0061] Figure 7 is a block diagram illustrating another apparatus according to some embodiments of the present disclosure;

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

[0063] Fig. 9is a block diagram illustrating a telecommunications network connected to a host computer via an intermediate network according to some embodiments of the present disclosure;

[0064] Fig.10 is a block diagram illustrating a host computer communicating with a UE over a partially wireless connection via a base station according to some embodiments of the present disclosure;

[0065] Fig.11 is a flow chart showing a method implemented in a communication system according to an embodiment of the present disclosure;

[0066] Fig.12 is a flow chart showing a method implemented in a communication system according to an embodiment of the present disclosure;

[0067] Fig.13 is a flowchart showing a method implemented in a communication system according to an embodiment of the present disclosure; and

[0068] Fig.14 is a flow chart showing a method implemented in a communication system according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0069] 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 to enable those skilled in the art to better understand and thereby realize the present disclosure, rather than to imply any limitation in terms of the scope of the present disclosure. References to features, advantages or similar language throughout the specification do not mean that all features and advantages that can be implemented in accordance with the present disclosure should be in or in any single embodiment of the present disclosure. On the contrary, the language related to the features and advantages is understood to mean that the specific features, advantages or characteristics described in conjunction with the embodiments are included in at least one embodiment of the present disclosure. In addition, the features, advantages and characteristics of the present disclosure described can be combined in one or more embodiments in any suitable manner. Those skilled in the relevant art will recognize that the present disclosure can be practiced without one or more specific features or advantages of a specific embodiment. In other cases, additional features and advantages can be found in certain embodiments, which may not appear in all embodiments of the present disclosure.

[0070] As used herein, the term "communication network" refers to a network that complies with any suitable communication standard, such as NR, Long Term Evolution (LTE), Advanced LTE, Wideband Code Division Multiple Access (WCDMA), High Speed ​​Packet Access (HSPA), etc. In addition, the communication between terminal devices and network nodes in the communication network can be implemented according to any suitable communication protocol, including but not limited to first generation (1G), second generation (2G), 2.5G, 2.75G, third generation (3G), 4G, 4.5G, 5G communication protocols and / or any other protocol currently known or developed in the future.

[0071] The term "network node" refers to a network device in a communication network through which a terminal device accesses the network and receives services from it. A 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. A 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 head (RH), a remote radio head (RRH), a repeater, a low power node such as a femtocell, a picocell, and the like.

[0072] Some further examples of network nodes include: MSR radio equipment such as a multi-standard radio (MSR) BS, a network controller such as a radio network controller (RNC) or a base station controller (BSC), a base transceiver station (BTS), a transmission point, a transmission node and / or a positioning node, etc. However, more generally, a network node may represent any suitable device (or group of devices) that is capable of, configured to, arranged to and / or operable to enable and / or provide a terminal device with access to a wireless communication network or to provide some services to a terminal device that has access to the wireless communication network.

[0073] The term "terminal device" refers to any end device that can access a communication network and receive services therefrom. As an example and not limitation, a terminal device may refer to a mobile terminal, a user equipment (UE), or other suitable device. A UE may be, for example, a subscriber station, a portable subscriber station, a mobile station (MS), or an access terminal (AT). A terminal device may include, but is not limited to, a portable computer, an image capture terminal device such as a digital camera, a game terminal device, a music storage and playback device, a mobile phone, a cellular phone, a smart phone, a tablet computer, a wearable device, a personal digital assistant (PDA), a vehicle, etc.

[0074] As another specific example, in an Internet of Things (IoT) scenario, a terminal device may also be referred to as an IoT device, and refers to a machine or other device that implements monitoring, sensing and / or measurement, etc. and transmits the results of such monitoring, sensing and / or measurement, etc. to another terminal device and / or a network device. In this case, the terminal device may be a machine-to-machine (M2M) device, which may be referred to as a machine type communication (MTC) device in the 3GPP context.

[0075] As a specific example, the terminal device may be a UE implementing the 3GPP Narrowband Internet of Things (NB-IoT) standard. Specific examples of such machines or devices are sensors, metering equipment such as power meters, industrial machinery, or household or personal devices such as refrigerators, televisions, personal wearables such as watches, etc. In other scenarios, the terminal device may represent a vehicle or other equipment, such as a medical instrument capable of monitoring, sensing and / or reporting its operating status or other functions related to its operation.

[0076] As used herein, the terms "first", "second", etc. refer to different elements. Unless the context clearly indicates otherwise, the singular forms "one" and "an" are also intended to include the plural forms. The terms "include", "comprise", "have", "contain", "include" and / or "comprises" used in the text indicate the presence of the described features, elements and / or components, etc., but do not exclude the presence or addition of one or more other features, elements, components and / or combinations thereof. The term "based on" should be understood as "based at least in part". The terms "one embodiment" and "embodiment" will be interpreted as "at least one embodiment". The term "another embodiment" should be understood as "at least one other embodiment". Other definitions may be explicitly and implicitly included below.

[0077] Wireless communication networks are widely deployed to provide a variety of telecommunication services such as voice, video, data, messaging, broadcast, etc. As mentioned above, 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 implement a RA procedure in order to exchange basic information and messages for communication link establishment with the network node.

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

[0079] In this exemplary process, the UE sends message3 / msg3 on PUSCH after receiving the timing advance command in the RAR, which allows message3 / msg3 on PUSCH to be received with timing accuracy within the cyclic prefix (CP). Without this timing advance, a very large CP may be required to demodulate and detect message3 / msg3 on PUSCH unless the communication system is applied in a cell with a very small distance between the UE and the gNB. Since the NR system can also support larger cells, a timing advance command needs to be provided to the UE, so this RA process requires a four-step approach.

[0080] In the NR system, the time and frequency resources on which the PRACH preamble is transmitted can be defined as PRACH opportunities. Different PRACH configuration schemes can be specified for FR1 (frequency range 1) paired spectrum, FR1 unpaired spectrum, and FR2 (frequency range 2) in the case of unpaired spectrum. The specified PRACH configuration can be maintained in the PRACH configuration table. The time resources and preamble formats used for PRACH transmission can be configured by a PRACH configuration index, which indicates a row in the PRACH configuration table. For example, at least a portion of the PRACH configuration for preamble format 0 for FR1 unpaired spectrum is shown in Table 1.

[0081] Table 1

[0082]

[0083] In Table 1, the x value indicates the PRACH configuration period (in system frame numbers), and the y value indicates the system frame within each PRACH configuration period on which the PRACH opportunity is configured. For example, if y is set to 0, it means that the PRACH opportunity is configured only in the first frame of each PRACH configuration period. The values ​​in the column "Subframe Number" indicate on which subframes the PRACH opportunity is configured. The values ​​in the "Start Symbol" column are symbol indexes.

[0084] In the case of time division duplex (TDD), the semi-statically configured DL part and / or the actually transmitted SSB may overwrite some time domain PRACH opportunities defined in the PRACH configuration table or invalidate some time domain PRACH opportunities defined in the PRACH configuration table. More specifically, the PRACH opportunities in the UL part are always valid, and for the PRACH opportunities in a specific part (e.g., a part with flexible symbols in an NR time slot), as long as it does not precede or collide with the SSB in the RACH time slot, and there are at least N symbols after the last symbol of the SSB and the DL part, the PRACH opportunities in the specific part are valid. For example, N can be set to 0 or 2 according to the PRACH format and the subcarrier spacing.

[0085] Figure 1B is a diagram showing an exemplary PRACH configuration according to an embodiment of the present disclosure. In the frequency domain, the NR system can support multiple frequency multiplexed PRACH opportunities in the same time domain PRACH opportunity. This is mainly due to the support of analog beam scanning in the NR system, so that the PRACH opportunities associated with one SSB are configured at the same time but at different frequency positions. Figure 1B As shown, the number of frequency division multiplexed (FDMed) PRACH opportunities in one time domain PRACH opportunity can be 1, 2, 4, or 8, and the PRACH configuration period can be 10ms, 20ms, 40ms, 80ms, or 160ms. As previously described, a row in the PRACH / RACH configuration table can specify a time domain PRACH opportunity pattern for one PRACH configuration period.

[0086] According to an exemplary embodiment, a maximum of 64 sequences may be used as RA preambles for each PRACH opportunity in each cell. A radio resource control (RRC) parameter (e.g., totalNumberOfRA-Preambles) may be used to determine how many of these 64 sequences are used as RA preambles in each PRACH opportunity in each cell. These 64 sequences may be configured in the following manner: first, including all available cyclic shifts of the root Zadoff-Chu sequence, and second, in order of increasing root index until 64 preambles are generated for the PRACH opportunity.

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

[0088] Figure 1C-1D is a diagram showing an example of association between SSB and PRACH opportunities according to some embodiments of the present disclosure. Figure 1C In the example of one SSB per PRACH opportunity shown, SSB0, SSB1, SSB2, and SSB3 are associated with four different PRACH opportunities, respectively. Figure 1D In the example of two SSBs per PRACH opportunity shown, SSB0 and SSB1 are associated with one PRACH opportunity, and SSB2 and SSB3 are associated with another PRACH opportunity. Figure 1C or Figure 1D The shown association between SSB and PRACH opportunities is only by way of example, and other suitable associations between SSB and PRACH opportunities with appropriate PRACH preamble formats may also be implemented.

[0089] According to an exemplary embodiment, the gNB may send each SSB to the UE using a different transmit beam. In response to receiving the SSB from the gNB, the UE may send a PRACH preamble to the gNB in ​​the associated PRACH opportunity. Based on the association between the SSB and the PRACH opportunity and the mapping from the SSB to the transmit beam, the gNB may determine the transmit beam of the gNB preferred by the UE using the PRACH preamble received from the UE. The gNB may use the determined transmit beam in DL transmission and optionally in UL reception.

[0090] According to some exemplary embodiments, the preamble associated with each SSB may 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). Specific rules for mapping SSBs to RA preambles may be defined. For example, N SSBs associated with one PRACH opportunity and R contention-based (CB) preambles for each SSB for each valid PRACH opportunity may be provided to the UE via the parameter ssb-perRACH-OccasionAndCB-PreamblesPerSSB. If N<1, one SSB is mapped to 1 / N consecutive valid PRACH opportunities, and the R contention-based preambles with consecutive indices associated with the SSB for each valid PRACH opportunity start at preamble index 0. If N ≥ 1, then the R contention-based preambles with consecutive indices associated with SSB n (0 ≤ n ≤ N-1) of each valid PRACH opportunity start at preamble index in It is provided by the parameter totalNumberOfRA-Preambles and is an integer multiple of N.

[0091] Figure 1E is a diagram showing an example of mapping between SSB and RA preamble 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 opportunities in one PRACH slot is 4, and the number of SSBs in one PRACH opportunity is 2. Figure 1E As shown, the mapping between SSB and PRACH preamble code can be completed by continuously associating M preamble codes to each SSB, where For example, the preamble can be obtained as follows:

[0092] - First, in increasing order of preamble index within a single PRACH opportunity;

[0093] - secondly, in increasing order of frequency resource indexes of PRACH opportunities used for frequency reuse; and

[0094] -Third, in ascending chronological order.

[0095] Figure 1F is a diagram showing an exemplary preamble for each SSB per PRACH opportunity according to an embodiment of the present disclosure. In this embodiment, for each SSB, the associated preamble for each PRACH opportunity is further divided into two groups for contention-based random access (CBRA) and contention-free random access (CFRA). The number of contention-based (CB) preambles per SSB per PRACH opportunity can be signaled via an RRC parameter (e.g., CB-preambles-per-SSB). The preamble indexes for CBRA and CFRA are consecutively mapped to one SSB in one PRACH opportunity, such as Figure 1F shown.

[0096] Figure 2 is a diagram illustrating an exemplary two-step RA process according to an embodiment of the present disclosure. Figure 1A The process shown in Figure 2 In the process shown, the UE can detect the SS by receiving 201 SSB (e.g., including PSS, SSS, and PBCH) from the gNB, and decoding 202 system information broadcast in the DL (e.g., remaining minimum system information (RMSI) and other system information (OSI)). Figure 1A Compared to the four-step approach shown, implementation Figure 2A UE that follows the procedure in can complete random access in only two steps. First, the UE sends 203a / 203b message A (msgA) to the gNB, which includes the RA preamble and higher layer data (such as RRC connection request with possible some payload on PUSCH). Second, the gNB sends 204 RAR (also called message B or msgB) to the UE, which includes UE identifier allocation, timing advance information, contention resolution information, etc.

[0097] In the two-step RA procedure, the UE may send the preamble and msgA PUSCH in one message called message A. Separate PRACH resources (defined by PRACH opportunities and preamble sequences) may be configured for the two-step RA procedure and the four-step RA procedure, thereby enabling the network to distinguish legacy UEs implementing the four-step RA procedure from UEs implementing the two-step RA procedure.

[0098] Some agreement may be reached on the PRACH configuration for two-step RA. Considering the relationship of PRACH resources between two-step RA and four-step RA, the network can flexibly configure the following options:

[0099] Option I: Separate PRACH opportunities for two-step RA and four-step RA; and

[0100] • Option II: Shared PRACH opportunities, but separate preambles for two-step RA and four-step RA.

[0101] For the four-step RA process, combined Figures 1C-1F The mapping of SSBs to PRACH opportunities and preambles is described. For the two-step RA procedure, it may be necessary to adaptively map SSBs to PRACH opportunities and corresponding preambles depending on the option selected for PRACH configuration (eg, Option I or Option II).

[0102] In the proposed solution according to some exemplary embodiments, the network node may indicate to the terminal device an association between signaling transmissions for the two-step RA procedure. According to exemplary embodiments, the proposed solution may allow the gNB to inform the UE of the mapping from SSB to PRACH opportunities for the two-step RA procedure. Optionally, the legacy mapping from SSB to PRACH opportunities and preambles for the four-step RA procedure may be used, reused or simply modified for the two-step RA procedure in order to minimize the signaling overhead while providing flexibility in the mapping of SSB to PRACH opportunities and preambles without affecting the legacy four-step RA procedure.

[0103] According to some exemplary embodiments, the association between DL transmission and UL transmission can adapt to the relationship between RA timing configuration schemes for different RA processes. For example, in the case of option I in which separate PRACH timings are configured for two-step RA and four-step RA, the mapping rules from SSB to PRACH timing and preamble for two-step RA can also be used for four-step RA. Optionally, separate configuration rules for mapping SSB to PRACH timing and preamble can be introduced for two-step RA and four-step RA. Optionally, in the case of option II in which shared PRACH timings are configured for two-step RA and four-step RA, the mapping rules from SSB to PRACH timing and preamble for two-step RA can be defined at least in part based on the rules for four-step RA.

[0104] Figures 3A-3C is a diagram showing an example of a preamble configuration of Option I according to some embodiments of the present disclosure. In the case of Option I, two-step RA and four-step RA are configured separately for PRACH opportunities. According to some exemplary embodiments, the same preamble configuration may be used for two-step RA and four-step RA. For example, the preamble configuration may indicate that 16 preambles out of a total of 64 preambles are configured for CBRA, where the number of SSBs mapped to the PRACH opportunity is 4, such as Figure 3A As shown. According to an exemplary embodiment, some configuration parameters (e.g., ssb-perRACH-OccasionAndCB-PreamblesPerSSB and totalNumberOfRA-Preambles) can be used for both two-step RA and four-step RA. In this case, the network does not need additional signaling to additionally indicate the preamble configuration for two-step RA. Optionally, if CFRA is not supported for two-step RA, the parameter totalNumberOfRA-Preambles can be ignored or skipped.

[0105] According to some exemplary embodiments, a separate preamble configuration may be introduced for two-step RA, such as Figure 3B and Figure 3C According to an exemplary embodiment, the preamble configuration for two-step RA may be indicated by one or more predefined parameters. For example, the parameter ssb-perRACH-OccasionAndCB-PreamblesPerSSB-2Step may be defined to indicate the number of SSBs mapped to one PRACH opportunity for two-step RA and the number of CB preambles for two-step RA mapped to one SSB. Figure 3B In the example of FIG. 4 , 16 preamble codes are configured for CBRA alone in the PRACH opportunity for two-step RA.

[0106] Optionally, another parameter totalNumberOfRA-Preambles-2Step may be defined to indicate the total number of preambles used for both CBRA and CFRA in a two-step RA. Figure 3C In the example of FIG. 4 , 16 preambles out of a total of 64 preambles are configured for CBRA with two-step RA, and the remaining preambles may be used for CFRA if supported.

[0107] According to some exemplary embodiments, it may not be desirable to support CFRA for two-step RA. In this case, the parameter totalNumberOfRA-Preambles-2Step may be used for CBRA by ensuring that the total number of preambles used for CBRA is the same as the value of the parameter totalNumberOfRA-Preambles-2Step. Alternatively, the parameter totalNumberOfRA-Preambles-2Step may not be required, and the parameter ssb-perRACH-OccasionAndCB-PreamblesPerSSB-2Step may be used to determine the total number of preambles used for two-step RA.

[0108] It can be appreciated that the parameters, variables and settings related to signaling transmission and resource allocation described herein are only examples. Other suitable message settings, associated configuration parameters and their specific values ​​may also be applicable to implement the proposed method.

[0109] Figure 3D-3F is a diagram showing an example of a preamble configuration according to Option II of some embodiments of the present disclosure. In the case of Option II, two-step RA and four-step RA can share a PRACH opportunity. According to some exemplary embodiments, separate preambles may be configured for two-step RA and four-step RA. For example, a preamble for four-step RA for each PRACH opportunity may be configured so that the value of the four-step RA parameter totalNumberOfRA-Preambles is less than the maximum number of preambles per PRACH opportunity (e.g., MaxNumberOfRA-Preambles=64), and the remaining preambles (e.g., 64-totalNumberOfRA-Preambles) may be used as preambles for two-step RA for each PRACH opportunity. Optionally, a configuration for mapping SSBs to PRACH opportunities may be provided separately for two-step RA and four-step RA. In this case, the number of SSBs mapped to PRACH opportunities 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 PRACH opportunities for four-step RA. Figure 3DIn the example, the preambles of each PRACH occasion are partitioned 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 remaining 8 preambles are for two-step RA, and each SSB has 2 preambles.

[0110] According to some exemplary embodiments, a separate parameter (e.g., totalNumberOfRA-Preambles-2step) for two-step RA can be introduced to indicate the number of preambles for two-step RA in a PRACH occasion. Optionally, the preambles for four-step RA in each PRACH occasion can be configured such that totalNumberOfRA-Preambles < MaxNumberOfRA-Preambles, and the preambles for two-step RA in each PRACH occasion can be configured such that totalNumberOfRA-Preambles-2step < MaxNumberOfRA-Preambles - totalNumberOfRA-Preambles. In this case, a subset of the remaining preambles (MaxNumberOfRA-Preambles - totalNumberOfRA-Preambles) is used as the preambles for two-step RA in each PRACH occasion, and the remaining preambles can be reserved and not used for RA. Thus, some preambles of each PRACH occasion can be used for four-step RA, some preambles can be used for two-step RA, and some preambles can be reserved. In Figure 3E the example, the number of preambles configured in a PRACH occasion is MaxNumberOfRA-Preambles = 64, the number of preambles configured for four-step RA is totalNumberOfRA-Preambles = 56, the number of preambles configured for two-step RA is totalNumberOfRA-Preambles-2step = 4, and the remaining 4 preambles are reserved and not used for RA.

[0111] According to some exemplary embodiments, the number of preambles used for both two-step RA and four-step RA per PRACH opportunity may be indicated by a parameter such as totalNumberOfRA-Preambles (if configured). A separate parameter such as CB-preambles-per-SSB-2step may be introduced to indicate the number of CB preambles per SSB used for two-step RA, such that the sum of the CB preambles configured for both two-step RA and four-step RA per PRACH opportunity is less than or equal to the value of the parameter MaxNumberOfRA-Preambles, or less than or equal to the value of the parameter totalNumberOfRA-Preambles (if configured).

[0112] Optionally, a portion of the CFRA preambles that were originally available for four-step RA may be configured as preambles for two-step RA. In this case, network nodes such as gNBs need to avoid using these preambles for four-step CFRA. This can be achieved, for example, by network implementations, or by specifying a rule that preambles configured or reused for two-step RA (e.g., by defining a parameter such as CB-preambles-per-SSB-2step) are invalid for four-step CFRA. Figure 3F In the example, the number of preambles configured for both two-step RA and four-step RA in each PRACH opportunity is 64, the number of CBRA preambles configured for four-step RA for each SSB of each PRACH opportunity is CB-preambles-per-SSB=4, the number of CBRA preambles configured for two-step RA for each SSB of each PRACH opportunity is CB-preambles-per-SSB-2step=2, and the remaining preambles are used for CFRA.

[0113] It should be noted that some embodiments of the present disclosure are described primarily with respect to 5G or NR specifications, which are used as non-limiting examples of specific exemplary network configurations and system deployments. As such, the description of the exemplary embodiments given here specifically refers to terms directly related thereto. Such terms are only used in the context of the non-limiting examples and embodiments presented, and naturally do not limit the present disclosure in any way. Instead, any other system configuration or radio technology may be used equally, as long as the exemplary embodiments described here are applicable.

[0114] Figure 4 is a flow chart illustrating a method 400 according to some embodiments of the present disclosure. Figure 4The method 400 shown may be implemented by a network node or a device communicatively coupled to a network node. According to an exemplary embodiment, the network node may include a base station such as a gNB. The network node may be configured to communicate with one or more terminal devices (e.g., UEs), wherein the UEs are capable of supporting one or more RA methods, such as two-step RA and / or four-step RA.

[0115] according to Figure 4 In the exemplary method 400 shown, a network node may determine an association between DL transmissions and UL transmissions in a two-step RA process (e.g., an association between SSBs and RA opportunities, etc.) based at least in part on an RA resource configuration for the two-step RA process (e.g., based at least in part on whether the RA resources are shared by the two-step RA process and the four-step RA process), as shown in block 402. Figure 2 As described, in the two-step RA process, the preamble and PUSCH may be sent in one message (e.g., msgA, etc.) at the RA timing and the PUSCH timing, respectively. The network node may then send information indicating the association to the terminal device, as shown in block 404. For example, the information indicating the association may be carried in a broadcast information block (e.g., SIB1) sent from the network node to the terminal device. Optionally, the terminal device may use the information indicating the association between the SSB and the RA timing in the two-step RA process to access the network node.

[0116] According to some exemplary embodiments, the association between DL transmission and UL transmission may include: an association between SSB and RA opportunity, and / or other associations reflecting signaling transmission / resource allocation of a two-step RA process. In an exemplary embodiment, the association between SSB and RA opportunity may include: a mapping of SSB to one or more preambles in the RA opportunity.

[0117] Figure 5 is a flow chart illustrating a method 500 according to some embodiments of the present disclosure. Figure 5 The method 500 shown may be implemented by a terminal device or an apparatus communicatively coupled to the terminal device. According to an exemplary embodiment, a terminal device such as a UE may be configured to communicate with a network node such as a gNB by supporting one or more RA methods such as two-step RA and / or four-step RA.

[0118] according to Figure 5 In the exemplary method 500 shown, a terminal device may receive information from a network node (e.g., Figure 4The terminal device may receive information indicating an association between DL transmission and UL transmission in a two-step RA procedure (e.g., an association between SSB and RA opportunity), as shown in block 502. The association may be based at least in part on the RA resource configuration of the two-step RA procedure (e.g., based at least in part on whether the RA resource is shared by the two-step RA procedure and the four-step RA procedure). Optionally, the terminal device may implement the two-step RA procedure based on the information received from the network node, as shown in block 504.

[0119] According to some exemplary embodiments, the association between SSB and RA opportunity in the two-step RA process may be further based on the RA resource configuration of the four-step RA process (e.g., RA opportunity configuration and optional RA preamble configuration, etc.). In an embodiment, the RA resources may include: RA opportunity and / or one or more associated RA preambles.

[0120] According to some exemplary embodiments, the RA resources available for the two-step RA procedure may be separate from the RA resources available for the four-step RA procedure. In this case, the two-step RA procedure and the four-step RA procedure may not share RA resources. In an embodiment, the RA timing for the two-step RA procedure may be separate from the RA timing for the four-step RA procedure. According to exemplary embodiments, the association between SSB and RA timing in the two-step RA procedure may be the same as the association between SSB and RA timing in the four-step RA procedure (e.g., Figure 3A , which is a mapping from SSB to RA opportunity applicable to both two-step RA and four-step RA. In an embodiment, the information indicating the association between SSB and RA opportunity in the two-step RA process may also indicate the association between SSB and RA opportunity in the four-step RA process. Thus, some existing parameters defined for the four-step RA process may also be used for the two-step RA process.

[0121] According to some exemplary embodiments, the association between SSB and RA opportunity in the two-step RA process may be different from the association between SSB and RA opportunity in the four-step RA process. In this case, the information indicating the association between SSB and RA opportunity in the two-step RA process may include a first parameter (e.g., information about Figure 3B ssb-perRACH-OccasionAndCB-PreamblesPerSSB-2Step) as described in order to indicate the following:

[0122] The number of SSBs mapped to one RA opportunity for the two-step RA procedure; and

[0123] • The number of preambles mapped to one SSB for the two-step RA procedure.

[0124] According to an exemplary embodiment, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may also include a second parameter (e.g., Figure 3C totalNumberOfRA-Preambles-2Step) as described above, to indicate the following:

[0125] • The number of preambles in this RA for the two-step RA procedure.

[0126] The preamble in this RA opportunity for the two-step RA procedure may include a CB preamble (eg, Figure 3C Optionally, the preamble in the RA opportunity for the two-step RA process may further include a CF preamble (e.g., Figure 3C CFRA preamble shown).

[0127] According to some exemplary embodiments, RA resources that can be used for the two-step RA process can be shared by the four-step RA process. In an embodiment, the two-step RA process and the four-step RA process can share RA opportunities. In this case, the shared RA opportunity can be configured with separate preambles for the two-step RA process and the four-step RA process (e.g., Figure 3D-Figure 3F In an embodiment, the shared RA opportunity may be configured with at least one reserved preamble (eg, Figure 3E preamble configuration shown).

[0128] According to some example embodiments, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a third parameter (eg, Figure 3D ssb-perRACH-Occasion-2Step) described in order to indicate the following:

[0129] • For the two-step RA procedure, the number of SSBs mapped to the shared RA opportunities.

[0130] According to an exemplary embodiment, the third parameter may be used to determine the number of preambles mapped to one SSB for the two-step RA process. For example, the number of preambles mapped to one SSB for the two-step RA process may be determined by (MaxNumberOfRA-Preambles-totalNumberOfRA-Preambles) / ssb-perRACH-Occasion-2Step, as combined with Figure 3D as described.

[0131] According to some exemplary embodiments, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a fourth parameter (eg, Figure 3EtotalNumberOfRA-Preambles-2step) as described above, to indicate the following:

[0132] • The number of preambles configured in the shared RA opportunity for the two-step RA procedure.

[0133] According to some exemplary embodiments, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may include a fifth parameter (eg, Figure 3E and Figure 3F CB-preambles-per-SSB-2step) as described in order to indicate the following:

[0134] • The number of preambles mapped to one SSB for the two-step RA procedure.

[0135] According to some exemplary embodiments, the information indicating the association between the SSB and the RA opportunity in the two-step RA process may also include a sixth parameter (eg, Figure 3F totalNumberOfRA-Preambles) as described in order to indicate the following:

[0136] • The total number of preambles used for the two-step RA procedure and the four-step RA procedure in the shared RA occasions.

[0137] According to some exemplary embodiments, the preamble mapped to the SSB for the two-step RA procedure may be configured by using at least a portion of the CF preamble initially configured for the four-step RA procedure. In this way, some preambles initially configured for the four-step RA procedure may be reused for the two-step RA procedure. Optionally, the two-step RA procedure and the four-step RA procedure may be configured with the same association between the SSB and the shared RA opportunity (e.g., Figure 3F preamble configuration shown).

[0138] The solution proposed according to one or more exemplary embodiments may enable UL transmission to be associated with DL transmission based at least in part on a specified configuration rule for an RA process (e.g., a two-step RA process). According to some exemplary embodiments, the association between SSBs and RA opportunities for a two-step RA process (e.g., mapping of SSBs to RA opportunities and msgA preambles) may be determined based on the relationship between the RA resource (e.g., RA opportunity) configuration for the two-step RA process and the RA resource configuration for the four-step RA process (e.g., based on whether the two-step RA process and the four-step RA process share RA resources). The configuration rules and parameters for mapping from SSBs to RA opportunities for the four-step RA process may be at least partially utilized to form configuration rules and parameters for mapping from SSBs to RA opportunities for the two-step RA process, thereby improving the flexibility of transmission configuration and enhancing resource utilization.

[0139] Figures 4 to 5 The various blocks shown in the can be viewed as method steps, and / or operations generated by the operation of computer program code, and / or multiple coupled logic circuit elements configured to perform related functions. The schematic flow charts described above are generally described as logic flow charts. Thus, the depicted order and labeled steps indicate a specific embodiment of the proposed method. Other steps and methods can be envisioned, which are equivalent to one or more steps or parts thereof of the illustrated method in function, logic or effect. In addition, the order in which a particular method occurs may or may not strictly follow the order of the corresponding steps shown.

[0140] Figure 6 6 is a block diagram showing an apparatus 600 according to various embodiments of the present disclosure. Figure 6 As shown, the apparatus 600 may include one or more processors (e.g., processor 601) and one or more memories (e.g., memory 602 storing computer program code 603). The memory 602 may be a non-transitory machine / processor / computer readable storage medium. According to some exemplary embodiments, the apparatus 600 may be implemented as an integrated circuit chip or module, which may be inserted into or installed in a computer system such as a computer system. Figure 4 The network node described herein may be inserted into or installed in a Figure 5 In this case, the apparatus 600 may be implemented as described in Figure 4 A network node as described, or as Figure 5 The terminal device described.

[0141] In some implementations, the one or more memories 602 and the computer program code 603 may be configured to work with the one or more processors 601 to cause the apparatus 600 to at least implement the Figure 4In other implementations, the one or more memories 602 and the computer program code 603 may be configured to work with the one or more processors 601 to cause the apparatus 600 to at least implement the method described in conjunction with Figure 5 Alternatively or additionally, the one or more memories 602 and the computer program code 603 may be configured to, together with the one or more processors 601, enable the apparatus 600 to at least implement more or fewer operations to realize the method proposed according to the exemplary embodiments of the present disclosure.

[0142] Figure 7 is a block diagram showing an apparatus 700 according to some embodiments of the present disclosure. Figure 7 As shown, the apparatus 700 may include a determining unit 701 and a sending 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 perform the operations in box 402, and the sending unit 702 may be operable to perform the operations in box 404. Optionally, the determining unit 701 and / or the sending unit 702 may be operable to perform more or less operations to implement the method proposed according to the exemplary embodiments of the present disclosure.

[0143] Figure 8 8 is a block diagram showing an apparatus 800 according to some embodiments of the present disclosure. Figure 8 As shown, the apparatus 800 may include a receiving unit 801 and an optional implementation 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 perform the operations in box 502, and the implementation unit 802 may be operable to perform the operations in box 504. Optionally, the receiving unit 801 and / or the implementation unit 802 may be operable to perform more or less operations to implement the method proposed according to the exemplary embodiments of the present disclosure.

[0144] Fig. 9 is a block diagram illustrating a telecommunications network connected to a host computer via an intermediary network according to some embodiments of the present disclosure.

[0145] refer to Fig. 9According to an embodiment, a communication system includes a telecommunication network 910 (such as a cellular network of the 3GPP type), which includes an access network 911 (such as a radio access network) and a core network 914. The access network 911 includes a plurality of base stations 912a, 912b, 912c, such as NBs, eNBs, gNBs or other types of wireless access points, each of which defines a corresponding coverage area 913a, 913b, 913c. Each base station 912a, 912b, 912c may be connected to the core network 914 via a wired or wireless connection 915. A first UE 991 located in the coverage area 913c is configured to be wirelessly connected to the corresponding base station 912c or to be paged by the corresponding base station 912c. A second UE 992 in the coverage area 913a may be wirelessly connected to the corresponding base station 912a. Although multiple UEs 991, 992 are shown in this example, the disclosed embodiments are equally applicable to the case where a single UE is in the coverage area or a single UE is connected to the corresponding base station 912.

[0146] The telecommunications network 910 itself is 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 a processing resource in a server farm. The host computer 930 may be under the ownership or control of a service provider, or may be operated by or on behalf of a service provider. The connections 921 and 922 between the telecommunications network 910 and the host computer 930 may extend directly from the core network 914 to the host computer 930, or may pass through an optional intermediate network 920. The intermediate network 920 may be one of a public network, a private network, or a managed network, or a combination of more than one of these; the intermediate network 920 (if any) may be a backbone network or the Internet; in particular, the intermediate network 920 may include two or more sub-networks (not shown).

[0147] Fig. 9The communication system generally realizes the connection between the connected UE 991, 992 and the host computer 930. The connection can be described as an over-the-top (OTT) connection 950. The host computer 930 and the connected UE 991, 992 are configured to use the access network 911, the core network 914, any intermediate network 920 and possible other infrastructure (not shown) as intermediaries to transmit data and / or signaling via the OTT connection 950. The OTT connection 950 can be transparent in terms of the fact that the participating communication devices through which the OTT connection 950 passes do not know the routes of the uplink and downlink communications. For example, the base station 912 may not be informed or need not be informed of the past routes of the inflow type downlink communication with data from the host computer 930 to be forwarded (e.g., switched) to the connected UE 991. Similarly, the base station 912 does not need to know the future routes of the outflow type uplink communication from the UE 991 to the host computer 930.

[0148] Fig.10 is a block diagram illustrating a host computer communicating with a UE over a partially wireless connection via a base station according to some embodiments of the present disclosure.

[0149] Now refer to Fig.10 Describe the example implementation of the UE, base station and host computer discussed in the previous paragraphs according to the embodiment. In the communication system 1000, the host computer 1010 includes hardware 1015, the hardware 1015 includes a communication interface 1016, and the communication interface 1016 is configured to establish and maintain a wired or wireless connection with the interface of different communication devices of the communication system 1000. The host computer 1010 also includes: a processing circuit 1018, which may have storage and / or processing capabilities. In particular, the processing circuit 1018 may include one or more programmable processors, application specific integrated circuits, field programmable gate arrays, or a combination of these components (not shown) suitable for executing instructions. The host computer 1010 also includes software 1011, which is stored in the host computer 1010 or can be accessed by the host computer 1010 and can be executed by the processing circuit 1018. The software 1011 includes a host application 1012. The host application 1012 is operable to provide services to a remote user, such as a UE 1030 connected via an OTT connection 1050 terminating at the UE 1030 and the host computer 1010. In providing services to the remote user, the host application 1012 may provide user data transmitted using the OTT connection 1050.

[0150] The communication system 1000 also includes a base station 1020 provided in the telecommunication system, and the base station 1020 includes hardware 1025 that enables it to communicate with the host computer 1010 and the UE 1030. The hardware 1025 may include a communication interface 1026 for establishing and maintaining a wired or wireless connection with different communication devices of the communication system 1000, and a communication interface 1026 for establishing and maintaining a connection with a network located in a coverage area ( Fig.10 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 (eg, a wireless network) of the telecommunications system. Fig.10 1020) and / or traverse one or more intermediate networks external to the telecommunications system. In the illustrated embodiment, the hardware 1025 of the base station 1020 also includes processing circuitry 1028, which may include one or more programmable processors, application specific integrated circuits, field programmable gate arrays, or a combination of these components (not shown) suitable for executing instructions. The base station 1020 also has software 1021 stored internally or accessible via an external connection.

[0151] The communication system 1000 also includes the UE 1030 already cited. Its hardware 1035 may include a radio interface 1037, which is configured to establish and maintain a wireless connection 1070 with a base station serving the coverage area where the UE 1030 is currently located. The hardware 1035 of the UE 1030 also includes a processing circuit 1038, which may include one or more programmable processors, application specific integrated circuits, field programmable gate arrays, or a combination of these components (not shown) suitable for executing instructions. The UE 1030 also includes software 1031, which is stored in the UE 1030 or can be accessed by the UE 1030 and can be executed by the processing circuit 1038. The software 1031 includes a client application 1032. The client application 1032 is operable to provide services to human users or non-human users via the UE 1030 under the support of the host computer 1010. In the host computer 1010, the executing host application 1012 can communicate with the executing client application 1032 via the OTT connection 1050 that terminates at the UE 1030 and the host computer 1010. When providing services to the user, the client application 1032 can receive request data from the host application 1012 and provide user data in response to the request data. The OTT connection 1050 can transmit both the request data and the user data. The client application 1032 can interact with the user to generate the user data it provides.

[0152] It should be noted that Fig.10The host computer 1010, base station 1020 and UE 1030 shown in FIG. 1 can be respectively connected to Fig. 9 The host computer 930, one of the base stations 912a, 912b, 912c, and one of the UEs 991, 992 may be similar or identical. That is, the internal workings of these entities may be similar to Fig.10 As shown, and independently, the surrounding network topology can be Fig. 9 network topology.

[0153] exist Fig.10 In FIG. 1 , an OTT connection 1050 has been abstractly drawn to illustrate communication between a host computer 1010 and a UE 1030 via a base station 1020, without explicitly involving any intermediate devices and the precise routing of messages via these devices. The network infrastructure may determine the routing, which may be configured to hide the routing from the UE 1030 or the service provider operating the host computer 1010, or both. When the OTT connection 1050 is active, the network infrastructure may further make decisions to dynamically change the routing (e.g., based on load balancing considerations or reconfiguration of the network).

[0154] The wireless connection 1070 between the UE 1030 and the base station 1020 is based on the teachings of the embodiments described throughout the present disclosure. One or more of the various embodiments improve the performance of the OTT service provided to the UE 1030 using the OTT connection 1050, wherein the wireless connection 1070 forms the last segment. More specifically, the teachings of these embodiments can improve latency and power consumption, thereby providing advantages such as lower complexity, reduced time required to access a cell, better responsiveness, and extended battery life.

[0155] A measurement process may be provided to monitor data rates, latency, and other factors improved by one or more embodiments. In response to changes in the measurement results, there may also be an optional network function for reconfiguring the OTT connection 1050 between the host computer 1010 and the UE 1030. The measurement process and / or network function for reconfiguring the OTT connection 1050 may be implemented in the software 1011 and hardware 1015 of the host computer 1010, or in the software 1031 and hardware 1035 of the UE 1030, or in both. In an embodiment, a sensor (not shown) may be deployed in or associated with a communication device through which the OTT connection 1050 passes; the sensor may participate in the measurement process by providing the values ​​of the monitoring quantities exemplified above, or by providing the values ​​of other physical quantities from which the software 1011, 1031 can calculate or estimate the monitoring quantities. The reconfiguration of the OTT connection 1050 may include message formats, retransmission settings, preferred routes, etc.; the reconfiguration does not need to affect the base station 1020, and the base station 1020 may not know or be aware of the reconfiguration. These processes and functions may be known and practiced in the art. In certain embodiments, the measurements may involve proprietary UE signaling that facilitates host computer 1010 to measure throughput, propagation time, latency, etc. The measurements may be implemented in the following manner: Software 1011 and 1031 use OTT connection 1050 to cause messages (particularly empty messages or "dummy" messages) to be transmitted while it monitors propagation time, errors, etc.

[0156] Fig.11 1 is a flow chart showing a method implemented in a communication system according to an embodiment. The communication system includes a host computer, a base station and a UE, which can be reference Fig. 9 and Fig.10 To simplify the present disclosure, only the Fig.11 . In step 1110, the host computer provides user data. In sub-step 1111 of step 1110 (which may be optional), 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), in accordance with the teachings of the embodiments described throughout the present disclosure, the base station transmits the user data carried in the transmission initiated by the host computer to the UE. In step 1140 (which may also be optional), the UE executes a client application associated with the host application executed by the host computer.

[0157] Fig.12 1 is a flow chart showing a method implemented in a communication system according to an embodiment. The communication system includes a host computer, a base station and a UE, which can be reference Fig. 9 and Fig.10To simplify this disclosure, only the Fig.12 Reference is made to the accompanying drawings of the present invention. In step 1210 of the method, the host computer provides user data. In an optional sub-step (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. According to the teachings of the embodiments described throughout the present disclosure, the transmission may pass through a base station. In step 1230 (which may be optional), the UE receives the user data carried in the transmission.

[0158] Fig.13 1 is a flow chart showing a method implemented in a communication system according to an embodiment. The communication system includes a host computer, a base station and a UE, which can be reference Fig. 9 and Fig.10 To simplify this disclosure, only the Fig.13 . In step 1310 (which may be optional), the UE receives input data provided by the host computer. Additionally or optionally, in step 1320, the UE provides user data. In sub-step 1321 (which may be optional) of step 1320, the UE provides user data by executing a client application. In sub-step 1311 (which may be optional) of step 1310, the UE executes a client application, which provides user data in response to the received input data provided by the host computer. When providing user data, the executed client application may also consider user input received from the user. Regardless of the specific manner of providing user data, the UE initiates the transmission of user data to the host computer in sub-step 1330 (which may be optional). In step 1340 of the method, according to the teachings of the embodiments described throughout the present disclosure, the host computer receives user data transmitted from the UE.

[0159] Fig.14 1 is a flow chart showing a method implemented in a communication system according to an embodiment. The communication system includes a host computer, a base station and a UE, which can be reference Fig. 9 and Fig.10 To simplify this disclosure, only the Fig.14 In step 1410 (which may be optional), according to the teachings of the embodiments described throughout the present disclosure, the base station receives user data from the UE. In step 1420 (which may be optional), the base station initiates a 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.

[0160] In general, various exemplary embodiments may be implemented in hardware or dedicated 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 that may be executed by a controller, microprocessor, or other computing device, although the disclosure is not limited thereto. Although various aspects of the exemplary embodiments of the present disclosure may be illustrated and described as block diagrams, flow charts, or using some other graphical representations, it is understood that the blocks, devices, systems, techniques, or methods described herein may be implemented in hardware, software, firmware, dedicated circuits or logic, general hardware or controllers, or other computing devices, or some combination thereof, as non-limiting examples.

[0161] As such, it should be appreciated that at least some aspects of the exemplary embodiments of the present disclosure may be practiced in various components such as integrated circuit chips and modules. It should therefore be understood that the exemplary embodiments of the present disclosure may be implemented in an apparatus embodied as an integrated circuit, wherein the integrated circuit may include at least circuitry (and possible firmware) for embodying one or more of a data processor, a digital signal processor, a baseband circuit, and a radio frequency circuit that may be configured to operate in accordance with the exemplary embodiments of the present disclosure.

[0162] It should be understood that at least some aspects of the exemplary embodiments of the present disclosure may be embodied in computer executable instructions executed by one or more computers or other devices, such as in one or more program modules. Typically, a program module includes routines, programs, objects, components, data structures, etc. that implement specific tasks or implement specific abstract data types when executed by a processor in a computer or other device. Computer executable instructions may be stored on computer readable media such as hard disks, optical disks, removable storage media, solid-state memory, random access memory (RAM), etc. As will be appreciated by those skilled in the art, the functions of program modules may be combined or distributed as needed in various embodiments. In addition, the functions may be embodied in whole or in part in firmware or hardware equivalents (such as integrated circuits, field programmable gate arrays (FPGAs), etc.).

[0163] The present disclosure includes any novel feature or feature combination explicitly disclosed herein or arbitrarily summarized thereof. In view of the foregoing description, various modifications and adaptations to the aforementioned exemplary embodiments of the present disclosure may become apparent to those skilled in the relevant art 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 the present disclosure.

Claims

1. A method (400) implemented by a network node, comprising: determining (402) an association between a synchronization signal and a physical broadcast channel block and a random access opportunity in a two-step random access procedure based at least in part on whether a random access resource is shared by a two-step random access procedure and a four-step random access procedure, wherein a preamble and a physical uplink shared channel (PUSCH) are sent in one message in the random access opportunity and a PUSCH opportunity, respectively; sending (404) information indicating the association to a terminal device; The random access opportunity is shared by the two-step random access process and the four-step random access process; the information indicating the association between the synchronization signal and the physical broadcast channel block in the two-step random access process and the random access opportunity includes an indication of the number of preamble codes mapped to a synchronization signal and a physical broadcast channel block used for the two-step random access process.

2. The method according to claim 1, wherein: The association between the synchronization signal and the physical broadcast channel block and the random access opportunity comprises: Mapping of the synchronization signal and physical broadcast channel blocks to one or more preambles in the random access opportunity.

3. The method according to any one of claims 1 to 2, wherein: The random access opportunity used for the two-step random access procedure is separate from the random access opportunity used for the four-step random access procedure.

4. The method according to claim 3, wherein: The association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the two-step random access process is the same as the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the four-step random access process.

5. The method according to claim 4, wherein: The information indicating the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the two-step random access process also indicates: the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the four-step random access process.

6. The method according to claim 3, wherein: The association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the two-step random access procedure is different from the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the four-step random access procedure.

7. The method according to claim 6, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process includes a first parameter to indicate the following: the number of synchronization signal and physical broadcast channel blocks mapped to a random access opportunity for the two-step random access procedure; as well as The number of preambles mapped to a synchronization signal and physical broadcast channel block for the two-step random access procedure.

8. The method according to claim 7, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process also includes a second parameter to indicate the following: a number of preambles in the random access opportunities for the two-step random access procedure, wherein the preambles in the random access opportunities for the two-step random access procedure include contention-based preambles.

9. The method according to claim 8, wherein: The preamble in the random access opportunity for the two-step random access procedure also includes a contention-free preamble.

10. The method according to claim 9, wherein: The shared random access opportunity is configured with separate preambles for the two-step random access procedure and the four-step random access procedure.

11. The method according to claim 9, wherein: The shared random access opportunity is configured with at least one reserved preamble.

12. The method according to claim 9, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process includes a third parameter to indicate the following: The number of synchronization signals and physical broadcast channel blocks mapped to the shared random access opportunities for the two-step random access procedure.

13. The method according to claim 12, wherein: The third parameter can be used to determine the number of preambles mapped to a synchronization signal and physical broadcast channel block for the two-step random access procedure.

14. The method according to claim 9, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process includes a fourth parameter to indicate the following: The number of preambles configured in the shared random access opportunity for the two-step random access procedure.

15. The method according to claim 14, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process also includes a sixth parameter to indicate the following: The total number of preambles used for the two-step random access procedure and the four-step random access procedure in the shared random access opportunity.

16. The method according to claim 15, wherein: The preamble mapped to the synchronization signal and physical broadcast channel block for the two-step random access procedure is configured by using at least a portion of a contention-free preamble initially configured for the four-step random access procedure.

17. The method according to claim 15, wherein: The two-step random access procedure and the four-step random access procedure are configured with the same association between synchronization signals and physical broadcast channel blocks and the shared random access opportunities.

18. A method (500) implemented by a terminal device, comprising: receiving (502) from a network node information indicating an association between a synchronization signal and a physical broadcast channel block and a random access opportunity in a two-step random access procedure, wherein a preamble and a physical uplink shared channel PUSCH are sent in one message in the random access opportunity and the PUSCH opportunity, respectively, wherein the association is based at least in part on whether a random access resource is shared by the two-step random access procedure and the four-step random access procedure; The random access opportunity is shared by the two-step random access process and the four-step random access process; the information indicating the association between the synchronization signal and the physical broadcast channel block in the two-step random access process and the random access opportunity includes an indication of the number of preamble codes mapped to a synchronization signal and a physical broadcast channel block used for the two-step random access process.

19. The method according to claim 17, wherein: The association between the synchronization signal and the physical broadcast channel block and the random access opportunity comprises: Mapping of the synchronization signal and physical broadcast channel blocks to one or more preambles in the random access opportunity.

20. The method according to any one of claims 17-18, wherein: The random access opportunity used for the two-step random access procedure is separate from the random access opportunity used for the four-step random access procedure.

21. The method according to claim 19, wherein: The association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the two-step random access process is the same as the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the four-step random access process.

22. The method according to claim 20, wherein: The information indicating the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the two-step random access process also indicates: the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the four-step random access process.

23. The method according to claim 21, wherein: The association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the two-step random access procedure is different from the association between the synchronization signal and the physical broadcast channel block and the random access opportunity in the four-step random access procedure.

24. The method according to claim 23, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process includes a first parameter to indicate the following: the number of synchronization signal and physical broadcast channel blocks mapped to a random access opportunity for the two-step random access procedure; as well as The number of preambles mapped to a synchronization signal and physical broadcast channel block for the two-step random access procedure.

25. The method according to claim 23, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process also includes a second parameter to indicate the following: a number of preambles in the random access opportunities for the two-step random access procedure, wherein the preambles in the random access opportunities for the two-step random access procedure include contention-based preambles.

26. The method according to claim 24, wherein: The preamble in the random access opportunity for the two-step random access procedure also includes a contention-free preamble.

27. The method of claim 17, wherein: The shared random access opportunity is configured with separate preambles for the two-step random access procedure and the four-step random access procedure.

28. The method according to claim 26, wherein: The shared random access opportunity is configured with at least one reserved preamble.

29. The method according to claim 27, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process includes a third parameter to indicate the following: The number of synchronization signals and physical broadcast channel blocks mapped to the shared random access opportunities for the two-step random access procedure.

30. The method of claim 29, wherein: The third parameter can be used to determine the number of preambles mapped to a synchronization signal and physical broadcast channel block for the two-step random access procedure.

31. The method of claim 29, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process includes a fourth parameter to indicate the following: The number of preambles configured in the shared random access opportunity for the two-step random access procedure.

32. The method of claim 17, wherein: The information indicating the association between the synchronization signal and physical broadcast channel block and the random access opportunity in the two-step random access process also includes a sixth parameter to indicate the following: The total number of preambles used for the two-step random access procedure and the four-step random access procedure in a shared random access opportunity.

33. The method of claim 32, wherein: The preamble mapped to the synchronization signal and physical broadcast channel block for the two-step random access procedure is configured by using at least a portion of a contention-free preamble initially configured for the four-step random access procedure.

34. The method of claim 31, wherein: The two-step random access procedure and the four-step random access procedure are configured with the same association between synchronization signals and physical broadcast channel blocks and the shared random access opportunities.

35. A network node (600), comprising: one or more processors (601); as well as one or more memories (602) including computer program code (603), The one or more memories (602) and the computer program code (603) are configured to, together with the one or more processors (601), cause the network node (600) to at least implement the method according to any one of claims 1-17.

36. A terminal device (600), comprising: one or more processors (601); as well as one or more memories (602) including computer program code (603), The one or more memories (602) and the computer program code (603) are configured to, together with the one or more processors (601), cause the terminal device (600) to at least implement the method according to any one of claims 18-34.

Images