Method for performing random access channel procedure and user equipment thereof

By having the user equipment send multiple PRACH preambles at multiple RACH transmission times and using signature information for beam matching, the access delay problem in the random access channel process is solved, thereby improving the access efficiency and data rate of the wireless communication system.

CN116321513BActive Publication Date: 2026-04-24MEDIATEK INC
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
MEDIATEK INC
Filing Date
2018-08-10
Publication Date
2026-04-24

AI Technical Summary

Technical Problem

In existing technologies, the access delay time in random access channel processes is relatively long, especially in wireless communication systems, particularly 5G systems, where it is necessary to increase data rates and reduce latency to match the user experience of fixed networks.

Method used

The user equipment (UE) sends multiple PRACH preambles (Msg1) at multiple RACH transmission times, and determines which Msg1 are detected by explicit or implicit signals. It uses multiple antennas and signature information for beam matching and scheduling, and monitors the RAR window to optimize uplink transmission.

Benefits of technology

Through repeated trials and optimizations of beam matching, access delay time was reduced, improving the access efficiency and data transmission rate of the wireless communication system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116321513B_ABST
    Figure CN116321513B_ABST
Patent Text Reader

Abstract

Methods and apparatuses are provided for reducing access latency in random access channel (RACH) procedures. A user equipment (UE) can transmit a plurality of message 1s at a plurality of RACH transmission occasions before the end of a random access response (RAR) window. The UE receives one or more RARs in response to the plurality of transmitted message 1s. The one or more RARs can be carried in a single RAR window or a plurality of RAR windows. The UE determines the detected message 1s based on an explicit signal, an implicit indication, or both. The explicit signal can be carried in the one or more RARs received by the UE. The implicit indication can be one or more signatures associated with the plurality of RACH transmission occasions. The one or more signatures contain at least one of a physical random access channel (PRACH) preamble or preamble index, a random access radio network temporary identifier (RA-RNTI) value, a RAR window, and a control region for a physical downlink control channel (PDCCH). The beneficial effect of reduced access latency time is achieved with transmitting message 1s.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Cross-references

[0002] This application claims priority and benefit to U.S. Provisional Patent Application No. 62 / 544,147, filed August 11, 2017, entitled “RACH Design,” the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates generally to wireless network communication, and more specifically, to reducing access latency in random-access channel (RACH) processes. Background Technology

[0004] Wireless communication systems are widely deployed to provide various types of communication; for example, voice and / or data can be provided via such systems. Fifth-generation wireless systems (5G) are designed to provide a user experience comparable to fixed networks through increased data rates, improved spectral efficiency, reduced latency, and better mobility support. 5G not only enhances mobile broadband but also provides wireless connectivity for any type of device or application that might benefit from such a connection. Summary of the Invention

[0005] Some embodiments relate to a method for performing a random-access channel (RACH) process. This method includes a user equipment (UE) transmitting multiple physical random-access channel (PRACH) preambles (or "message 1 (Msg1)") at multiple RACH transmission times prior to the end of the first random-access response (RAR) window, and determining which(s) of the multiple Msg1s are detected based on explicit signals carried in one or more RARs received by the UE, and / or based on one or more signatures associated with the multiple RACH transmission times.

[0006] In some embodiments, the one or more signatures include a RA-RNTI value, wherein the RA-RNTI value is associated with the timing of the multiple RACH transmissions that send the multiple Msg1s.

[0007] In some embodiments, the one or more signatures contain one or more RAR windows during which the one or more RARs are sent.

[0008] In some embodiments, the one or more signatures include a control region configured for scheduling the physical downlink control channel (PDCCH) for RAR. This control region includes a control resource set (CORESET) and a search space. The CORESET and / or the search space are associated with the multiple RACH transmission timings.

[0009] In some embodiments, the one or more signatures include a PRACH preamble or a preamble index. The PRACH preamble or preamble index is associated, in whole or in part, with the timing of the plurality of RACH transmissions via higher-layer signaling.

[0010] Some embodiments relate to a user equipment (UE). The UE includes multiple antennas and a processor communicating with a memory. The processor is configured to execute instructions stored in the memory, causing the processor to: transmit multiple Msg1 messages at multiple RACH transmission times via one or more of the multiple antennas before the end of a first RAR window; and determine which of the multiple Msg1 messages is detected based on a dominant signal carried in one or more RARs received by the UE, and / or based on one or more signatures associated with the multiple RACH transmission times.

[0011] In some embodiments, the one or more signatures include a PRACH preamble or preamble index, a RA-RNTI value, a RAR window, and a control region of a PDCCH configured for scheduling RAR.

[0012] In some embodiments, the one or more signatures include a RA-RNTI value, wherein the RA-RNTI value is associated with the timing of the multiple RACH transmissions that send the multiple Msg1s.

[0013] In some embodiments, the one or more signatures contain multiple RAR windows during which the one or more RARs are sent.

[0014] In some embodiments, the one or more signatures include a control region configured for scheduling the PDCCH for RAR. The control region includes a CORESET and a search space. The CORESET and / or the search space are associated with the multiple RACH transmission timings.

[0015] In some embodiments, the one or more signatures include a PRACH preamble or a preamble index. The PRACH preamble or preamble index is associated, in whole or in part, with the timing of the plurality of RACH transmissions via higher-layer signaling.

[0016] In some embodiments, if the one or more RARs are a single RAR or correspond to a single Msg1 among the plurality of Msg1s, the processor is further configured to execute the instructions stored in the memory, which cause the processor to determine which of the plurality of antennas are used for subsequent uplink transmission based on the antenna index explicitly carried in the one or more RARs, or based on the detected Msg1 indicated by the one or more RARs.

[0017] In some embodiments, if the one or more RARs are more than one RAR or correspond to more than one Msg1 among the plurality of Msg1s, the processor is further configured to execute the instruction stored in the memory, the instruction causing the processor to: determine which one or more of the plurality of antennas will be used for subsequent uplink transmission based on the performance indicators carried in the plurality of received RARs.

[0018] In some embodiments, if the one or more RARs are more than one RAR or correspond to more than one Msg1 among the plurality of Msg1s, the processor is further configured to execute the instruction stored in the memory, the instruction causing the processor to: use one or more uplink resources scheduled in the one or more RARs for subsequent uplink transmission via the corresponding antenna of the UE, if network specifications permit and configured by the base station that sent the one or more RARs.

[0019] Some embodiments relate to a user equipment (UE). The UE includes multiple antennas and a processor communicating with a memory. The processor is configured to execute instructions stored in the memory, which cause the processor to: transmit multiple Msg1s via one or more of the multiple antennas at multiple RACH transmission times before the end of a first RAR window; and determine which(s) of the multiple Msg1s are detected based on one or more RARs received by the UE during one or more RAR windows configured by the network.

[0020] In some embodiments, the one or more RAR windows are the first RAR window. The first RAR window begins after a predetermined duration following the sending of one of the plurality of Msg1s.

[0021] In some embodiments, the size of the first RAR window is configured by the network via higher-layer signaling, or is configured to be the same size as the RAR window used for a single Msg1 transmission.

[0022] In some embodiments, the first RAR window begins after a predetermined duration following the sending of the first Msg1 of the plurality of Msg1s or after the sending of the last Msg1 of the plurality of Msg1s.

[0023] In some embodiments, the one or more RAR windows are multiple RAR windows. Each of the multiple RAR windows begins after a predetermined duration following the sending of one of the multiple Msg1s, and each RAR window has the same duration.

[0024] In some embodiments, determining which one or more of the plurality of Msg1s are detected includes: reading a dominant signal carried in the one or more RARs, or deriving it from one or more signatures carried in the one or more RARs.

[0025] This invention proposes a method and user equipment for performing random access channel procedures, which achieves the beneficial effect of reducing access delay time by sending multiple PRACH preambles (“Msg1”).

[0026] The foregoing invention is provided in an illustrative manner and is not intended to be limiting. Attached Figure Description

[0027] In the accompanying drawings, each identical or nearly identical component shown in the various figures is represented by the same numbers. For clarity, not every component is labeled in every drawing. The drawings are not necessarily drawn to scale, but are intended to illustrate various aspects of the technology and apparatus described herein.

[0028] Figure 1 An exemplary wireless communication system is shown according to some embodiments.

[0029] Figure 2 An exemplary UE is shown according to some embodiments.

[0030] Figure 3 A schematic diagram of a contention-free RACH process is shown according to some embodiments.

[0031] Figure 4 A schematic diagram of a competition-based RACH process is shown according to some embodiments.

[0032] Figures 5A-5C This is a timing diagram illustrating an alternative configuration of the RAR window for the transmission of multiple PRACH preambles (or Msg1) according to some embodiments.

[0033] Figure 6 Exemplary methods for sending multiple Msg1s by a UE during a RACH process are shown according to some embodiments.

[0034] Figure 7A A schematic diagram of the control resource set of PDCCH associated with different RACH transmission times is shown according to some embodiments.

[0035] Figure 7B A schematic diagram of the search space for PDCCH associated with different RACH transmission times is shown according to some embodiments. Detailed Implementation

[0036] The inventors have realized that transmitting multiple PRACH preambles (or "Msg1") can reduce access latency during the RACH process. For example, if the UE has multiple antennas that can be used as transmitter (TX) beams, the UE can transmit multiple Msg1s using one or more TX beams, allowing the UE to test multiple TX beams during RACH. This process thus accelerates beam matching and scheduling of communication between the UE and the base station.

[0037] The inventors have realized that the detected Msg1 can be explicitly transmitted in the RAR, or implicitly transmitted by associating the RACH transmission timing with one or more signatures, including, for example, the RA-RNTI value, the PRACH preamble or preamble index, the RAR window, and the control area of ​​the physical downlink control channel (PDCCH) used to schedule the RAR. The UE can determine the TX beam to use in subsequent uplink transmissions based on the indication of the detected Msg1.

[0038] The inventors have also realized that the UE can monitor a single RAR window that begins after a fixed duration following the transmission of one of the multiple Msg1s. Alternatively, the UE can monitor multiple RAR windows, each beginning after a fixed duration following the transmission of one of the multiple Msg1s.

[0039] The following description sets forth numerous specific details regarding the systems and methods of the disclosed subject matter and the environments in which such systems and methods may operate, in order to provide a thorough understanding of the disclosed subject matter. Furthermore, it should be understood that the examples provided below are exemplary, and other systems and methods are expected to exist within the scope of the disclosed subject matter.

[0040] Figure 1An exemplary wireless communication system 100 (e.g., a 3G, 4G, and / or 5G NR system) is illustrated according to some embodiments. The wireless communication system 100 may include a UE 102 and a base station (BS) 104. For example, the UE 102 may be a mobile phone, smartphone, laptop computer, and / or any other device configured to communicate with the BS 104. The BS 104 may be, for example, a base station (e.g., a cellular base station) such as an evolved Node B (eNB), a next-generation Node B (gNB), etc. Figure 1 As shown in the example, UE 102 has two antennas, antennas 106A and 106B, collectively referred to herein as antenna 106. BS 104 has three antennas, antennas 108A, 108B, and 108C, collectively referred to herein as antenna 108. UE 102 and BS 104 communicate via wireless communication channel 110. Transmissions from UE 102 to BS 104 are typically referred to as uplink (UL) communication, as shown in 112. Either antenna 106 or 108 can be dedicated to a transmitter beam or a receiver beam, or serve as a transceiver beam. Transmissions from BS 104 to UE 102 are typically referred to as downlink (DL) communication, as shown in 114. Figure 1 This is a simplified example and is not intended to be limiting. For example, UE 102 and / or BS 104 may have different numbers of antennas. As another example, UE 102 and BS 104 may communicate via multiple different frequencies and / or channels. Figure 1 Not shown in the diagram. Furthermore, the BS 104 typically communicates with multiple UEs, although for simplicity... Figure 1 Not shown in the image.

[0041] Figure 2This is a simplified block diagram of UE 102 according to some embodiments. UE 102 may include a memory 211, a processor 212, a radio frequency (RF) module 213 coupled to antennas 106A and 106B, a baseband module 215, a communication protocol stack module 226 supporting various protocol layers (including non-access stratum (NAS) 225, access stratum (AS) / radio-resource control (RRC) 224, packet data convergence protocol (PDCP) / radio link control (RLC) 223, medium access control (MAC) 222, and physical layer (PHY) 221), a transmission control protocol (TCP) / internet protocol (IP) protocol stack module 227, an application (APP) module 228, and a management module 230 including a configuration and control module 231 and a service continuity module 232. The PHY can further comprise three layers (not shown): a transport channel processor, a physical channel processor, and an analog processor.

[0042] When executed by processor 212 via program instructions contained in memory 211, functional modules and circuits can communicate with each other. For example, an application can create data packets processed by protocols such as TCP and IP. The RRC protocol can be written into signaling messages exchanged between the base station and the UE. In both cases, information can be processed by PDCP, RLC, and MAC protocols before being passed to the physical layer for transmission. In some embodiments, each functional module or circuit may include a processor and corresponding program code.

[0043] Information flowing between different protocols can be referred to as channels and signals. Physical data channels can exist between different PHY layers, such as PRACH, the physical uplink shared channel (PUSCH), and the physical downlink shared channel (PDSCH). PRACH can carry random access transmissions from the random access channel. PUSCH can carry data and signaling messages from the uplink shared channel, and sometimes uplink control information (UCI). PDSCH can carry data and signaling messages from the downlink shared channel, as well as paging messages from the paging channel. Physical control channels can also exist in the PHY, such as PDCCH and PUCCH. PDCCH can carry downlink control information. PUCCH can carry uplink control information.

[0044] A transport channel, such as RACH, can also exist between the MAC and PHY, through which the UE can contact the base station without any prior scheduling. For example, if the UE wishes to transmit on the PUSCH but lacks the resources to do so, the UE can send a scheduling request on the PUCCH. If the UE does not have the resources to send a scheduling request, it can initiate a RACH process. This can occur in several different situations, such as during RRC connection establishment, during handover, or if the UE has lost timing synchronization with the base station.

[0045] The configuration and control module 231 can configure handover service interruption reduction features for the UE, monitor radio resource status, and thereby determine whether a radio bearer for RRC connection to transmit data has been established. The handover process can occur between base stations using the same Radio Access Technology (RAT) or between different RATs (inter-RAT). When a handover event occurs, radio resources are first released in the serving radio network, and then established in the target radio network. The service continuity module 232 can determine whether to release the NAS signaling connection after completing the NAS signaling process based on whether the radio bearer has already been established or is being established.

[0046] Figure 3 A schematic diagram of a contention-free RACH process 300 is shown according to some embodiments. If the base station can reserve a preamble sequence for the UE, it can guarantee that no other UE will use that sequence in the same resource block set, which is the basis of a contention-free random access process. A contention-free RACH process can be used as part of a handover.

[0047] When base station 304 sends a random-access (RA) preamble allocation and resource allocation containing a preamble index to UE 302, the contention-free RACH process 300 begins with action 306. UE 302 reads the RA preamble allocation and reconfigures itself as instructed. However, UE 302 has not yet timed synchronized. In action 308, before the RAR window ends, UE 302 transmits multiple PRACH preambles (or Msg1) through one or more antennas of UE 302 at multiple RACH transmission opportunities, where the RAR window can be configured by the network. A RACH transmission opportunity can be defined as a time-frequency resource on which a PRACH preamble (or Msg1) is transmitted using a configured PRACH preamble format on a single specific TX beam. In NR, in both frequency-division duplex (FDD) and time-division duplex (TDD) modes, one or more RACH transmission opportunities can exist simultaneously, both frequency-division multiplexed (FDM). The transmission time and frequency can together determine a mobility identifier called RA-RNTI.

[0048] In action 310, if base station 304 detects at least one of multiple Msg1s, base station 304 responds using a PDCCH scheduling command that addresses to the RA-RNTI of the detected Msg1. Base station 304 also sends one or more RARs that identify the preamble sequence used by UE 302 and provide UE 302 with one or more uplink scheduling resources and initial values ​​for uplink timing advance.

[0049] In some embodiments, UE 302 can monitor a single RAR window (e.g., a first RAR window) that begins after a fixed duration (e.g., a predetermined duration) following the transmission of one of the multiple Msg1s. The fixed duration can be zero time or several symbols in FDD and TDD, respectively. The fixed duration can be calculated from the last symbol ending the transmitted preamble. The single RAR window begins after the predetermined duration following the transmission of either the first Msg1 of the multiple Msg1s or the last Msg1 of the multiple Msg1s. The size of the RAR window can be in symbols. The size of the RAR window can be determined by the network via higher-layer signaling (e.g., Figure 2The RAR window can be configured as a layer above the PHY in the communication protocol stack module 226, or it can be the same size as the RAR window used for a single Msg1 transmission without additional signaling. For example, after sending the preamble, the RAR window can start with a fixed duration of X symbols. If multi-beam operation is considered, the fixed duration of X symbols can be the same for all DL synchronization signal (SS) blocks. Figure 5C An exemplary configuration of a single RAR window for multiple Msg1 transfers is shown.

[0050] In some embodiments, UE 302 can monitor multiple RAR windows. After sending one of multiple Msg1s, each RAR window can begin with a fixed duration. Each RAR window can have the same size (e.g., duration). It should be understood that this application is not limited to multiple RAR windows starting simultaneously and / or having the same size. The UE can monitor any RAR window configured by the network. Figures 5A-5B An exemplary configuration of multiple RAR windows for multiple Msg1 transfers is shown.

[0051] In some embodiments, an indication of which one or more of the multiple transmitted Msg1s are detected by base station 304 can be explicitly carried in the RAR. For example, the configuration of the RACH transmission timing for the detected Msg1 can be explicitly sent in the RAR. However, explicit signaling may require additional fields in the RAR content for contention-free RACH.

[0052] Alternatively or additionally, an indication of which one or more of the multiple transmitted Msg1s are detected by base station 304 may also be implied by one or more signatures associated with the timing of multiple RACH transmissions. The one or more signatures may contain at least one of the RA-RNTI value, the RAR window, and the control area of ​​the PDCCH used for scheduling RARs.

[0053] In some embodiments, if these multiple Msg1 transmissions are sent on different RACH timings, UE 302 can deduce which Msg1 was used to detect the RA-RNTI value of the RAR, where the different RACH timings are time-frequency resources and are associated with different RA-RNTI values. For example, if the RA-RNTI value is determined on a symbol-by-symbol basis, as long as the multiple RACH transmission timings are located on different symbols, the UE can determine which Msg1 the base station detected based on the RA-RNTI value associated with the received RAR.

[0054] In some embodiments, UE 302 can detect which Msg1 is being sent by monitoring different RAR windows in response to Msg1 sent at different RACH transmission times. For example, as Figure 5A As shown, the UE has two beams (beam 1 and beam 2), each beam transmitting Msg1 during two different RACH transmission events. Each of the two beams is associated with a corresponding RAR window. Therefore, the UE can deduce which Msg1 is detected by monitoring the RAR windows associated with the two beams. In some embodiments, during one or more RAR transmissions by base station 304, UE 302 can determine which Msg1(s) is detected based on one or more RAR windows associated with one or more RACH transmission events.

[0055] In some embodiments, the control region of a PDCCH may include a CORESET and a search space. The CORESET may specify the frequency position and symbol duration of the control region. The search space may specify the timing and period of the control region. In some embodiments, the CORESET may be associated with the timing of RACH transmissions. For example, as... Figure 7A As shown, if the UE has selected RACH transmission occasion #1 (RO#1) for Msg1 transmission, it will monitor the PDCCH of the corresponding RAR on control resource set #1 (CORESET#1) according to the network configuration. If RO#2 is selected for Msg1 transmission, it will use CORESET#2 to monitor the corresponding RAR. In this way, the UE can determine which preamble is detected on which RACH transmission occasion. Alternatively or additionally, the search space can be associated with RACH transmission occasions. For example, as... Figure 7B As shown, the timing of the search spaces associated with these two ROs does not overlap. Therefore, if the UE detects a PDDCH that schedules a RAR, the UE can determine which preamble on which RACH transmission timing the network has detected.

[0056] Figure 4 A schematic diagram of a contention-based RACH process 400 is shown according to some embodiments. If the UE is not assigned a preamble index, the UE uses a contention-based random access process. This typically occurs as part of a process called RRC connection establishment.

[0057] For example, UE 402 wants to send an RRC message called RRC Connection Request to base station 404, requesting a move from RRC Idle (RRC_IDLE) to RRC Connected (RRC_CONNECTED). UE 402 has no PUSCH resources on which it can send this message, nor any PUCCH resources on which it can send a scheduling request, therefore it triggers RACH process 400.

[0058] In action 406, base station 404 sends to UE 402 a DL SS containing cell search and DL beampair identifiers, as well as system information (SI) containing master information block (MIB) and remaining minimum system information (RMSI) reads, and RACH configuration carried in the RMSI.

[0059] In action 408, UE 402 randomly selects one or more preamble sequences from those available for contention-based processes, and then transmits multiple PRACH preambles (or Msg1) via one or more antennas of UE 402 at multiple RACH transmission times before the RAR window ends, where the RAR window can be configured by the network. There is a risk of contention if other UEs choose to transmit using the same preamble sequence on the same resource block. In action 410, base station 404 sends a scheduling command to UE 402 via PDCCH, and then transmits one or more RARs (Msg2) via PDSCH, which can address the PRACH preamble or preamble index of the detected Msg1. In action 412, UE 402 uses uplink resources to transmit its RRC message (RRC Connection Request (Msg3)) via PUSCH. In action 414, base station 404 sends a contention resolution (Msg4). In action 416, UE 402 sends an RRC connection completion message to base station 404.

[0060] Similar to a contention-free RACH process, an indication of which one or more of the multiple transmitted Msg1s are detected by base station 404 can be explicitly sent in the RAR, and / or implied by one or more signatures associated with the timing of multiple RACH transmissions. In addition to the possible signatures described for a contention-free RACH process 300, a contention-based RACH process 400 may include signatures such as a PRACH preamble or preamble index, which can be used by the base station to reserve specific resource blocks for PRACH.

[0061] UE 402 can determine which Msg1s were detected by reading the detected preamble indices in one or more received RARs. The PRACH preamble or preamble index can be associated with multiple RACH transmission times via higher-layer signaling (e.g., handover commands). For example, the reserved preamble index for the k-th dedicated RACH time is k0+k, the reserved preamble index for the (k+1)-th dedicated RACH time is k0+k+1, and so on. When a received RAR contains a preamble index of k0+k, the UE knows that the Msg1 transmitted at the k-th RACH transmission time has been detected. Alternatively, the association information between multiple RACH transmission times and PRACH preambles or preamble indices can be partly given by higher-layer signaling and partly predefined in the network specification.

[0062] UE 402 can also determine which TX beams(s) to use in subsequent UL transmissions, for example, Msg3 in action 412. If one or more received RARs are a single RAR, or correspond to a single Msg1 already transmitted by UE 402, and Msg1 is detected from a received RAR, UE 402 can determine which UL TX beam to use by reading the preamble index and / or RACH transmission timing information if the preamble index and / or RACH transmission timing information is explicitly indicated. For example, when multiple Msg1 transmissions occur at multiple RACH transmission timings, UE 402 can apply different TX beam indices. Alternatively or additionally, UE 402 can determine which UL TX beam to use based on the detected Msg1 indicated by one or more received RARs, which may carry explicit or implicit signals indicating the detected Msg1 and association information between the UE's TX beams and the detected Msg1.

[0063] If multiple RARs are received, or if the received RARs correspond to multiple Msg1s already transmitted by UE 402, UE 402 can determine which UL TX beams(s) to use for subsequent UL transmissions based on performance indicators (e.g., the detection power level of Msg1s). The performance indicators can be carried in the received RARs. For example, UE 402 can compare the performance indicators carried in RARs transmitted by base station 404 and select one or more TX beams with the highest performance indicator. Alternatively or additionally, if network specifications permit and are configured by base station 404 transmitting one or more RARs, UE 402 can use one or more UL resources scheduled in one or more received RARs, along with the corresponding one or more TX beams of the UE, for subsequent UL transmissions.

[0064] Figure 6 Exemplary method 600 is shown, according to some embodiments, for a UE (e.g., UE 102, UE 302, and UE 402) to transmit multiple Msg1s during a RACH process (e.g., a contention-free RACH process 300, a contention-based RACH process 400). In action 602, the UE may transmit multiple Msg1s on multiple RACH transmission moments before the end of a first RAR window. In action 604, the UE may monitor one or more received RARs during one or more RAR windows configured by the network. In action 606, the UE may determine which one or more of the multiple Msg1s are detected based on a dominant signal carried in one or more RARs, and / or based on one or more signatures associated with the multiple RACH transmission moments. The one or more signatures may include at least one of the following: a PRACH preamble or preamble index, a RA-RNTI value, a RAR window, and a control area of ​​a PDCCH configured for scheduling RARs. In action 608, the UE may determine which of the multiple antennas should be used for subsequent uplink transmissions based on the antenna index explicitly carried in one or more RARs, or based on the detected Msg1. It should be understood that the UE does not need to perform every action in method 600 to send multiple Msg1s. In some embodiments, the UE may perform only a portion of the actions in method 600 to send multiple Msg1s. For example, UE 302 may perform actions 602-606 in a contention-free RACH process 300. In some embodiments, in addition to actions 602-608, the UE may perform other actions to send multiple Msg1s. For example, when the RAR does not carry an explicit signal indicating which or all of the multiple Msg1s are detected, the UE may associate multiple RACH transmissions with one or more of the aforementioned signatures. Figure 3 , Figure 4 , Figures 5A-5C An example is described of how the UE associates a signature with multiple RACH transmission timings.

[0065] The techniques operating according to the principles described herein can be implemented in any suitable manner. The flow and decision blocks in the flowcharts above represent steps and actions that can be included in algorithms that perform these various flows. Algorithms derived from these flows can be implemented as software integrated with and directing the operation of one or more single-purpose or multi-purpose processors, can be implemented as functionally equivalent circuits, such as Digital Signal Processing (DSP) circuits or Application-Specific Integrated Circuits (ASICs), or can be implemented in any other suitable manner. It should be understood that the flowcharts contained herein do not depict the syntax or operation of any particular circuit or any particular programming language or type of programming language. Rather, the flowcharts illustrate functional information that those skilled in the art can use to fabricate circuits or implement computer software algorithms to perform the processing of a particular type of device of the technology described herein. It should also be understood that, unless otherwise indicated herein, the specific sequences of steps and / or actions described in each flowchart are merely illustrative of algorithms that can be implemented and can vary in implementations and embodiments of the principles described herein.

[0066] Therefore, in some embodiments, the techniques described herein can be embodied as computer-executable instructions implemented as software, which includes application software, system software, firmware, middleware, embedded code, or any other suitable type of computer code. Such computer-executable instructions can be written using any of a number of suitable programming languages ​​and / or programming or scripting tools, and can also be compiled into executable machine language code or intermediate code that executes on a framework or virtual machine.

[0067] When the techniques described herein are embodied as computer-executable instructions, these instructions can be implemented in any suitable manner, comprising multiple functional facilities, each providing one or more operations to perform the execution of an algorithm according to these techniques. However, an instantiated “functional facility” is a structural component of a computer system that, when integrated with and executed by one or more computers, causes the one or more computers to perform a specific operational role. A functional facility can be part of or an entire software element. For example, a functional facility can be implemented as a process function, a discrete process, or any other suitable unit process. If the techniques described herein are implemented as multiple functional facilities, each functional facility can be implemented in its own way; all these functional facility implementations need not be implemented in the same way. Furthermore, these functional facilities can be executed in parallel and / or serially as appropriate, and can exchange information with each other using shared memory on the computer on which they are executing, using message passing protocols, or in any other suitable manner.

[0068] Typically, functional facilities include routines, programs, objects, components, data structures, etc., that perform specific tasks or implement specific abstract data types. The functionality of functional facilities can generally be combined or distributed as needed within the system in which they operate. In some implementations, one or more functional facilities performing the techniques described herein can together form a complete software package. In alternative embodiments, these functional facilities may be adapted to interact with other unrelated functional facilities and / or processes to implement software application applications.

[0069] This document describes some exemplary functional facilities for performing one or more tasks. However, it should be understood that the described functional facilities and task divisions are merely illustrative of the types of functional facilities that can implement the exemplary techniques described herein, and embodiments are not limited to being implemented in any particular number, division, or type of functional facilities. In some implementations, all functions may be implemented in a single functional facility. It should also be understood that in some implementations, some of the functional facilities described herein may be implemented together with other functional facilities or separately from other functional facilities (i.e., as a single unit or a separate unit), or some of the functional facilities may not be implemented.

[0070] In some embodiments, computer-executable instructions implementing the techniques described herein (when implemented as one or more functional facilities or in any other manner) may be encoded on one or more computer-readable media to provide functionality to the media. Computer-readable media include magnetic media such as hard disk drives, optical media such as compact disks (CDs) or digital versatile disks (DVDs), persistent or non-persistent solid-state storage (e.g., flash memory, magnetic RAM, etc.), or any other suitable storage media. Such computer-readable media may be implemented in any suitable manner. As used herein, a “computer-readable medium” (also referred to as a “computer-readable storage medium”) means a tangible storage medium. A tangible storage medium is non-transitory and has at least one physical, structural component. In a “computer-readable medium” as used herein, at least one physical, structural component has at least one physical characteristic that may be altered in some way during a process of creating a medium with embedded information, a process of recording information thereon, or any other process of using an information-encoding medium. For example, the magnetization state of a portion of the physical structure of the computer-readable medium may be changed during the recording process.

[0071] Furthermore, some of the aforementioned technologies involve actions of storing information (e.g., data and / or instructions) in certain ways for use by these technologies. In some implementations of these technologies—such as implementations of these technologies as computer-executable instructions—the information can be encoded on a computer-readable storage medium. Where specific structures are described herein as advantageous formats for storing this information, these structures can be used to inform the physical organization of the information when encoded on the storage medium. These advantageous structures can then provide functionality to the storage medium by influencing the operation of one or more processors interacting with the information; for example, by improving the efficiency of computer operations performed by the processors.

[0072] In some, but not all, implementations, the technology may be embodied as computer-executable instructions that can be executed or operate in one or more suitable computing devices of any suitable computer system (or, one or more processors of one or more computing devices) and can be programmed to execute the computer-executable instructions. A computing device or processor can be programmed to execute instructions when the instructions are stored in a manner accessible to the computing device or processor, for example, in data memory (e.g., on-chip cache or instruction register, computer-readable storage medium accessible via a bus, computer-readable storage medium accessible via one or more networks, and computer-readable storage medium accessible by the device / processor, etc.). Functional facilities containing these computer-executable instructions can be integrated with and direct the operation of a single multipurpose programmable digital computing device, a coordinated system of two or more multipurpose computing devices sharing processing power and jointly executing the technologies described herein, a single computing device dedicated to executing the technologies described herein, or a coordinated system of computing devices (co-located or geographically distributed), one or more field-programmable gate arrays (FPGAs) for executing the technologies described herein, or any other suitable system.

[0073] A computing device includes at least a processor, a network adapter, and a computer-readable storage medium. The computing device can be, for example, a desktop or laptop computer, a personal digital assistant (PDA), a smartphone, a server, or any other suitable computing device. The network adapter can be any suitable hardware and / or software that enables the computing device to communicate wired and / or wirelessly with any other suitable computing device in any suitable computing network. The computing network can include wireless access points, switches, routers, gateways, and / or other network devices, as well as any suitable wired and / or wireless communication media or medium for exchanging data between two or more computers (including the Internet). The computer-readable medium can be suitable for storing data to be processed and / or instructions to be executed by the processor. The processor is capable of processing data and executing instructions. Data and instructions can be stored in the computer-readable storage medium.

[0074] In addition, computing devices may have one or more components and peripherals, including input and output devices. Among other things, these devices can be used to present a user interface. Examples of output devices that can be used to provide a user interface include printers or displays for output presentation and speakers or other sound-generating devices for output presentation. Examples of input devices that can be used for a user interface include keyboards and pointing devices such as mice, touchpads, and digital tablets. As another example, computing devices may receive input information via speech recognition or other audio formats.

[0075] Embodiments implementing these techniques in the form of circuits and / or computer-executable instructions have been described. It should be understood that some embodiments may be in the form of methods, of which at least one example has been provided. Actions performed as part of a method may be ordered in any suitable manner. Thus, embodiments may be constructed in which actions are performed in a different order than those shown, and which may include the simultaneous execution of some actions, even if shown as sequential actions in the exemplary embodiments.

[0076] The various aspects of the above embodiments can be used individually, in combination, or in various arrangements not specifically discussed in the embodiments described above. Therefore, their application is not limited to the details and arrangements of the components described above or shown in the accompanying drawings. For example, an aspect described in one embodiment can be combined in any way with aspects described in other embodiments.

[0077] The use of ordinal terms such as “first,” “second,” “third,” etc., in the claims to modify the claim elements themselves does not imply that one claim element has any priority, order of precedence, or sequence over another claim element, or, in other words, a temporary order of actions of the method, but is merely used as a label to distinguish one claim element with a particular name from another element with the same name (but for the purpose of using ordinal terms) to differentiate claim elements.

[0078] Furthermore, the wording and terminology used herein are for descriptive purposes and should not be considered limiting. The use of “comprising,” “including,” “having,” “containing,” and variations thereof in this document is intended to cover the items listed thereafter, their equivalents, and additional items.

[0079] As used herein, the term “exemplary” means used as an example, embodiment, or illustration. Therefore, any embodiment, implementation, process, feature, etc., described herein as exemplary should be understood as an illustrative example and should not be construed as a preferred or beneficial example unless otherwise indicated.

[0080] Having described several aspects of at least one embodiment, it should be understood that various changes, modifications, and improvements will readily occur to those skilled in the art. These changes, modifications, and improvements are intended to be part of the invention and to fall within the spirit and scope of the principles described herein. Therefore, the foregoing description and figures are merely exemplary.

Claims

1. A method for performing a random access channel procedure, comprising: Before the first random access response window ends, multiple messages 1 are transmitted via one or more antennas of the user equipment on multiple random access channel transmission times, wherein the first random access response window begins after a predetermined duration following the transmission of one of the multiple messages 1; and Based on the explicit signals carried in one or more random access responses received by the user equipment, determine which message(s) of the plurality of messages 1 were detected. The size of the first random access response window is configured by the network via higher-layer signaling and is configured to be the same as the size of the random access response window used for a single message 1 transmission.

2. The method for executing a random access channel process according to claim 1, characterized in that, The user equipment receives one or more random access responses based on the first random access response window.

3. The method for performing a random access channel procedure according to claim 1, characterized in that, The first random access response window begins after a predetermined duration following the sending of the last message 1 of the plurality of messages 1.

4. A user equipment for performing a random access channel procedure, comprising: One or more antennas; and The processor is configured to perform the following operations: Before the first random access response window ends, multiple messages 1 are transmitted via the one or more antennas at multiple random access channel transmission times, wherein the first random access response window begins after a predetermined duration following the transmission of one of the multiple messages 1; and Based on the explicit signals carried in one or more random access responses received by the user equipment, determine which message(s) of the plurality of messages 1 were detected. The size of the first random access response window is configured by the network via higher-layer signaling and is configured to be the same as the size of the random access response window used for a single message 1 transmission.

5. The user equipment for performing a random access channel procedure according to claim 4, characterized in that, The user equipment receives one or more random access responses based on the first random access response window.

6. The user equipment for performing a random access channel process according to claim 4, characterized in that, The first random access response window begins after a predetermined duration following the sending of the last message 1 of the plurality of messages 1.

7. A user equipment for performing a random access channel procedure, comprising: Processor; and memory, When executing the program code stored in the memory, the steps of the method for executing a random access channel process as described in any one of claims 1-3 are performed.