Methods and apparatus for wireless communication

Abstract

The present invention provides a method and apparatus for wireless communication. The method includes the step of transmitting a plurality of preambles in a first random access opportunity group, the first random access opportunity group comprising a plurality of random access opportunities, two random access opportunities in the first random access opportunity group being adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance being related to the number of plurality of random access opportunities included in the first random access opportunity group. That is, the frequency hopping distance between two random access opportunities in the first random access opportunity group (e.g., the first frequency hopping distance) can vary with the number of transmissions of physical random access channels in the first random access opportunity group, and compared to conventional frequency hopping schemes where the frequency hopping distance between two random access opportunities in a random access opportunity group is fixed, thus limiting the frequency domain span of the random access opportunity group, this contributes to improving the frequency domain diversity gain of the frequency hopping scheme.

Description

Technical Field

[0001] This application relates to the technical field of communications, and more specifically, to a method and apparatus for wireless communication.

Background Art

[0002] Currently, some applicants propose that under certain channel conditions (for example, an environment with rich scattering), the frequency hopping method can bring additional frequency domain diversity gains to communication based on a random access channel occasion group (RO group, ROG). However, in this frequency hopping method, only one resource block (RB) is different in the frequency domain between two adjacent random access channel (RACH) opportunities (ROs) in the time domain. In other words, for two adjacent ROs in the time domain, the frequency hopping distance is one resource block (RB). The frequency domain diversity gain brought by such a frequency hopping method based on a fixed frequency hopping distance is very limited.

Summary of the Invention

Problems to be Solved by the Invention

[0003] This application provides a method and apparatus for wireless communication. The following describes each aspect according to this application.

Means for Solving the Problems

[0004] A first embodiment provides a method for wireless communication comprising the step of transmitting a plurality of preambles in a first random access opportunity group, wherein the first random access opportunity group comprises a plurality of random access opportunities, and two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, wherein the first frequency hopping distance is related to the number of plurality of random access opportunities included in the first random access opportunity group.

[0005] A second embodiment provides a method for wireless communication comprising the step of receiving one or more preambles in a first random access opportunity group, wherein the first random access opportunity group comprises a plurality of random access opportunities, and two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance relating to the number of plurality of random access opportunities in the first random access opportunity group.

[0006] In a third embodiment, the present invention includes a first transmitter configured to transmit a plurality of preambles in a first random access opportunity group, the first random access opportunity group comprising a plurality of random access opportunities, two random access opportunities in the first random access opportunity group being adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance providing a first node for wireless communication relating to the number of plurality of random access opportunities included in the first random access opportunity group.

[0007] In a fourth embodiment, a first receiver is included, configured to receive one or more preambles in a first random access opportunity group, the first random access opportunity group includes a plurality of random access opportunities, two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance providing a second node for wireless communication relating to the number of random access opportunities in the first random access opportunity group.

[0008] In the fifth aspect, a user device is provided which includes a processor, memory and a communication interface, wherein the memory is configured to store one or more computer programs, and the processor is configured to call the computer programs in the memory, thereby causing the user device to perform some or all of the steps in the methods of each of the above aspects.

[0009] In the sixth aspect, a network device is provided, comprising a processor, memory, and a transceiver, wherein the memory is configured to store one or more computer programs, and the processor is configured to call the computer programs in the memory, thereby causing the network device to perform some or all of the steps in the methods of each of the above aspects.

[0010] In the seventh embodiment, an embodiment of the present application provides a communication system including the user equipment and / or network equipment described above. In another possible design, the system may further include other equipment that interacts with the user equipment or network equipment in the means relating to the embodiment of the present application.

[0011] In the eighth aspect, an embodiment of the present application provides a computer-readable storage medium that stores a computer program causing a communication device (e.g., a user device or a network device) to perform some or all of the steps of the methods of each of the above aspects.

[0012] In the ninth embodiment, an embodiment of the present application provides a computer program product comprising a non-temporary computer-readable storage medium storing an operable computer program that causes a communication device (e.g., a user device or a network device) to perform some or all of the steps of the methods of each embodiment described above. In some embodiments, this computer program product may be a single software installation package.

[0013] In the tenth embodiment, the embodiment of the present application includes a memory and a processor, the processor being able to call and execute a computer program from the memory, thereby providing a chip that accomplishes some or all of the steps described in the manner of each of the above embodiments. [Effects of the Invention]

[0014] On the one hand, in the embodiment of the present application, two random access opportunities in a first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance being related to the number of random access opportunities included in the first random access opportunity group. That is, the frequency hopping distance between two random access opportunities in the first random access opportunity group (e.g., the first frequency hopping distance) can change with the number of PRACH transmissions in the first random access opportunity group. Compared to conventional frequency hopping schemes where the frequency hopping distance between two random access opportunities in a random access opportunity group is fixed, which limits the frequency domain span of the random access opportunity group, this contributes to improving the frequency domain span corresponding to the first random access opportunity group and thus contributes to improving the frequency domain diversity gain of the frequency hopping scheme.

[0015] On the other hand, in the embodiments of the present invention, the random access opportunity groups corresponding to the number of different random access opportunities differ significantly in the first frequency hopping distance used. By shifting some or all of the random access opportunities within the different random access opportunity groups, the probability of preambles transmitted across multiple different ROs colliding is reduced. In particular, when different users employ random selection, even if preambles selected by different users may collide at one RO, the probability of collisions across multiple different ROs is small. Therefore, the frequency hopping method of the embodiments of the present invention improves the coverage performance of multiple PRACH transmissions, reduces the collision probability of physical random access channels (PRACHs), thereby reducing random access delay and contributing to improved resource utilization efficiency.

[0016] Furthermore, in the embodiments of the present invention, the first frequency hopping distance is related to the number of random access opportunities included in the first random access opportunity group. Compared to conventional frequency hopping schemes where the frequency hopping distance between two random access opportunities in a random access opportunity group is fixed, this contributes to improving the frequency domain span of random access opportunity groups with fewer random access opportunities, thereby improving the frequency domain diversity gain achieved by employing the frequency hopping scheme. [Brief explanation of the drawing]

[0017] [Figure 1] This is a wireless communication system 100 in an embodiment of the present invention. [Figure 2] This invention relates to a method for wireless communication in an embodiment of the present invention. [Figure 3] This is a schematic diagram illustrating the relationship between random access opportunities and the preamble in an embodiment of the present invention. [Figure 4] This is a schematic diagram illustrating the relationship between random access opportunities and the preamble in another embodiment of the present invention. [Figure 5] Schematic diagram of a first node for wireless communication according to an embodiment of the present application [Figure 6] Schematic diagram of a second node for wireless communication according to an embodiment of the present application. [Figure 7] Schematic structural diagram of a communication device according to an embodiment of the present application [Figure 8] Schematic diagram of a hardware module of a communication device according to an embodiment of the present application

Modes for Carrying Out the Invention

[0018] The following refers to the drawings to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, not all of them.

[0019] Architecture of a communication system FIG. 1 is a diagram showing an example of the system architecture of a wireless communication system 100 to which an embodiment of the present application can be applied. The wireless communication system 100 may include a network device 110 and a user equipment (UE) 120. The network device 110 may be a device that communicates with the user equipment 120. The network device 110 can provide communication coverage in a specific geographical area and communicate with the user equipment 120 located within the coverage area.

[0020] FIG. 1 illustratively shows one network device and two user equipments. Optionally, the wireless communication system 100 may include multiple network devices, and within the coverage range of each network device, other numbers of user equipments may be included. The embodiments of the present application do not limit this.

[0021] Optionally, the wireless communication system 100 may further include other network entities such as a network controller and a mobility management entity. The embodiments of the present application do not limit this.

[0022] It should be understood that, although the technical solution of the embodiment of this application targets initial access, it can also be applied to beam failure recovery. Furthermore, although the technical solution of the embodiment of this application targets Type-1 random access procedures, it can also be applied to Type-2 random access procedures. Furthermore, although the technical solution of the embodiment of this application targets Uu interfaces, it can also be applied to PC5 interfaces. Furthermore, although the technical solution of the embodiment of this application targets single-carrier communication, it can also be applied to multi-carrier communication. Furthermore, although the technical solution of the embodiment of this application targets user equipment and base station scenarios, it can also be applied to V2X scenarios, user equipment and relays, and relays and base station communication scenarios, and the same technical effects as in the user equipment and base station scenario can be obtained. Furthermore, the technical solutions of the embodiments of this application can be applied to various communication scenarios, such as Enhanced Mobile Broadband (eMBB) scenarios, Ultra Reliable & Low Latency Communication (URLLC) scenarios, and Massive Machine Type Communication (mMTC) scenarios. Moreover, adopting a unified solution across different scenarios contributes to reducing hardware complexity and cost.

[0023] It should be understood that, as long as they do not contradict each other, the embodiments and features of the first node of this application can also be applied to the second node, and vice versa. As long as they do not contradict each other, the embodiments and features of the applications can be combined in any way.

[0024] It should be understood that the technical solutions of the embodiments of this application can be applied to various communication systems, such as 5th generation (5G) systems, new radio (NR), long-term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, and LTE time division duplex (TDD) systems. The technical solutions of this application can also be applied to future communication systems such as 6th generation mobile communication systems and satellite communication systems.

[0025] In the embodiments of this application, terminal equipment may also be called user equipment, access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. In the embodiments of this application, user equipment may refer to equipment that provides a voice and / or data link to a user, and can be used to connect humans, objects, and machines, such as handheld devices and in-vehicle devices with wireless connectivity. The user devices in the embodiments of this application may include mobile phones, tablet PCs (Pads), laptop computers, palmtop computers, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, and wireless terminals in smart homes. Optionally, the UE can function as a base station. For example, the UE can function as a scheduling entity, providing sidelink signals between UEs in V2X or D2D, etc. For example, a cellular phone and a car communicate with each other using sidelink signals. Communication between a cellular phone and smart home devices does not require relaying communication signals by a base station.

[0026] The network equipment in the embodiments of the present application may be equipment for communicating with user equipment, and such network equipment may be called access network equipment or wireless access network equipment, for example, the network equipment may be a base station. The network equipment in the embodiments of the present application may refer to a radio access network (RAN) node (or equipment) that provides user equipment to a wireless network. The term "base station" broadly covers, or may be replaced by, various names such as NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), main base station (MeNB), secondary base station (SeNB), multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, base band unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), and positioning node. A base station may also be a macro base station, micro base station, relay node, donor node, or similar, or a combination thereof. A base station may further refer to a communication module, modem, or chip installed within the aforementioned equipment or device.A base station may also be a device that performs base station functions in mobile switching centers and device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. A base station can support networks with the same or different access technologies. The embodiments of this application do not limit the specific technologies and specific forms of devices employed in the network equipment.

[0027] Base stations may be fixed or mobile. For example, a helicopter or drone may be configured as a mobile base station, with one or more cells moving according to the location of the mobile base station. In another example, a helicopter or drone may be configured as equipment for communicating with another base station.

[0028] In some deployments, the network equipment in the embodiments of the present invention refers to a CU or DU, or the network equipment may include both a CU and a DU. The gNB may further include an AAU.

[0029] Network equipment and user equipment may be located on land, including indoors or outdoors, handheld or vehicle-mounted, on water, or in the air on airplanes, balloons, or satellites. The embodiments of this application do not limit the scenarios in which network equipment and user equipment are located.

[0030] It should be understood that all or some of the functions of the communication equipment in this application may be implemented by software functions running on the hardware, or by virtualization functions instantiated on a platform (e.g., a cloud platform).

[0031] It should be understood that the interpretation of terminology in the embodiments of this application can be based on the 3GPP® standard protocols TS36, TS37, and TS38 series, but the standards protocols of the Institute of Electrical and Electronics Engineers (IEEE) can also be referenced.

[0032] PRACH transmission coverage expansion The coverage performance of a communication system (e.g., an NR system) is an important factor that operators must consider when commercially deploying a communication network, because the coverage performance of a communication system directly impacts the service quality of the communication system and the operator's costs, such as capital expenditures (CAPEX) and operating expenses (OPEX).

[0033] The coverage performance of a communication system varies depending on the frequency band in which it operates. For example, NR systems operate in higher frequency bands (e.g., millimeter wave bands) than LTE systems, resulting in greater path loss in NR systems and consequently, relatively inferior coverage performance. Therefore, as the frequency bands supported by communication systems increase, how to expand the coverage of these systems becomes a problem that needs to be solved.

[0034] In most actual deployment scenarios, the capabilities of user equipment are somewhat weaker than those of network equipment, making uplink coverage a bottleneck in extending the coverage of the communication system. Meanwhile, with the advancement of communication technology, uplink services such as video uploading services in certain emerging vertical industry use cases are gradually increasing, and in scenarios with many uplink services, how to extend uplink coverage is a problem that needs to be further addressed.

[0035] In related technologies, technical solutions for coverage extension for specific uplink links already exist. For example, in the 17th version of NR (release 17, Rel-17), coverage extension means are designed for physical uplink shared channels (PUSCH), physical uplink control channels (PUCCH), and message 3 (Msg3) in random access procedures.

[0036] However, while Rel-17 does not design a means to extend coverage for PRACH, PRACH transmission performance is crucial in many procedures such as initial access and beam failure recovery, and therefore, extending PRACH coverage is also very important. Based on this, the Rel-18 version of NR formally established a work item (WI) for "further NR coverage enhancements," and improving the coverage performance of PRACH transmission is one of the important issues under consideration in this work item.

[0037] One possible embodiment is the use of multiple PRACH transmissions to extend the coverage of PRACH transmissions. In other words, PRACH transmission coverage can be extended by repeatedly transmitting PRACH (for example, sending a preamble multiple times in PRACH).

[0038] In the embodiments of this application, the multiple PRACH transmissions may be multiple PRACH transmissions using the same beam or multiple PRACH transmissions using different beams. Taking multiple PRACH transmissions using the same beam as an example, the 3rd generation partnership project (3GPP®) Radio Access Network (RAN) 1#110bis-e meeting has already agreed: PRACH opportunities (or referred to as RACH opportunities) located at least at different time instances may be used for multiple PRACH transmissions using the same beam. Furthermore, the RAN1#110bis-e meeting has defined the repetition factor (number / occurrence) of multiple PRACH transmissions using the same beam, and this repetition factor may include at least two and four, and later possibly include eight.

[0039] Association mapping between synchronization signal blocks and PRACH opportunities A synchronization signal block is one of the signal structures defined in a communication standard and may include a primary synchronization signal (PSS), a secondary synchronization signal (SSS), and a physical broadcast channel (PBCH). In some embodiments, a synchronization signal block can be represented as an SSB (synchronization signal block), and in some embodiments, a synchronization signal block can also be represented as an SS / PBCH block (synchronization signal / physical broadcast channel block). In other words, a synchronization signal block can also be called a synchronization signal / broadcast channel block, and the embodiments of this application are not limited to this. Hereafter, the synchronization signal block will be described as an SSB as an example, and naturally, all SSBs below may be replaced with SS / PBCH blocks.

[0040] SSB is a set of resources transmitted over a basic orthogonal frequency division multiplexing grid, which may include one or more of the following: time-domain resources, frequency-domain resources, code-domain resources, etc.

[0041] During the initial access or beam fault recovery process, if the user equipment detects an SSB transmitted from a network device, it can obtain the SSB index of that SSB, thereby determining the time-domain location of the SSB and facilitating downlink synchronization with the network device. To achieve uplink synchronization, the user equipment needs to transmit a preamble to the network device. The user equipment determines how to select the preamble to transmit and at which PRACH opportunity the selected preamble should be transmitted, based on the received (or detected) SSB.

[0042] As a feasible technical solution, an SSB can be mapped to at least one preamble in at least one PRACH opportunity, so that when user equipment performs initial access or beam fault recovery, it can determine the associated PRACH opportunity and preamble based on the received SSB, thereby enabling it to continue PRACH transmission.

[0043] In related technologies, the related mapping relationship between SSB, PRACH opportunities, and preambles can follow the following order: first, sorted in ascending order of preamble index within each PRACH opportunity; second, sorted in ascending order of frequency-domain resource index for frequency-division multiplexed PRACH opportunities; third, sorted in ascending order of time-domain resource index for time-division multiplexed PRACH opportunities within each PRACH slot; and finally, sorted in ascending order of PRACH slot index.

[0044] Random access opportunity group In some scenarios, an RO group is introduced to refer to a set containing multiple ROs, and thus an RO group is also called an RO set. The embodiments of this application do not limit the names of RO groups. For the sake of ease of explanation, the embodiments of this application will be described based on RO groups.

[0045] As one embodiment, an RO group may include ROs corresponding to multiple PRACHs transmitted in the same beam.

[0046] As one example, several conferences (e.g., 3GPP® RAN1#110bis-e) have considered the possibility of using ROs located at different time periods (also called "time instances") for multiple PRACH transmissions using the same beam.

[0047] As one embodiment, for a certain number of PRACH transmissions, one ROG contains an active RO, and a certain number of PRACHs are transmitted by the active RO.

[0048] In one embodiment, all ROs within a single ROG can be associated with a single synchronization signal / physical broadcast channel block. Naturally, in the embodiments of this application, a single ROG can be associated with multiple SSBs.

[0049] Currently, several applicants propose that under certain channel conditions (e.g., scattering-rich environments), frequency hopping schemes can provide additional frequency-domain diversity gain to multiple PRACH transmissions employing the same beam. Specifically, for a frequency hopping scheme with two PRACH transmissions, the RO index pattern used in the frequency domain is {0, 1}. For a frequency hopping scheme with four PRACH transmissions, the RO index pattern used in the frequency domain is {0, 1, 0, 1}.

[0050] On the one hand, based on the conventional frequency hopping method described above, in the time domain, two adjacent ROs differ by only one RB in the frequency domain; in other words, for two adjacent ROs in the time domain, the frequency hopping distance is one RB. The frequency domain diversity gain of such a frequency hopping method based on a fixed frequency hopping distance is very limited.

[0051] For example, under channel conditions where scattering is not abundant, if the frequency domain channel fading is flat and one RB is used as the frequency hopping distance, the corresponding channel conditions between adjacent ROs in the time domain may not differ significantly, resulting in a very limited frequency domain diversity gain for the frequency hopping method.

[0052] On the other hand, as can be seen from the conventional frequency hopping schemes described above, for frequency hopping schemes of two PRACH transmissions, the frequency hopping distance employed between adjacent ROs in the time domain is still one RB, which results in a smaller frequency domain diversity gain for a smaller number of PRACH transmissions.

[0053] Furthermore, as can be seen from the conventional frequency hopping methods described above, the performance of multiple PRACH transmissions is currently poor, and PRACH transmissions become a bottleneck in the coverage range of communication systems (e.g., NR).

[0054] Therefore, in view of the above problems, the embodiments of the present application propose a solution for wireless communication, and in order to facilitate understanding, the method for wireless communication of the embodiments of the present application will be described below with reference to Figure 2 in Embodiment 1.

[0055] Example 1 The method shown in Figure 2 includes step S210. It should be understood that the method shown in Figure 2 can be performed by a first node, and the embodiments of this application are not limited to the first node. In some embodiments, the first node may be a network device, which may include, for example, a network-controlled repeater (NCR), an access network device, etc.

[0056] In step S210, multiple preambles are sent in a first random access opportunity group, the first random access opportunity group includes multiple random access opportunities.

[0057] In one embodiment, the number of random access opportunities included in the first random access opportunity group may be one of 2, 4, or 8. Naturally, in the embodiments of the present application, the number of random access opportunities included in the first random access opportunity group may be any other number, and the embodiments of the present application are not limited thereto.

[0058] In one embodiment, the above-mentioned multiple preambles may be transmitted from the first node to the second node, where the second node may be a user device. In some other embodiments, the second node may be a user device other than the first node.

[0059] In one embodiment, two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, wherein the first frequency hopping distance is related to the number of random access opportunities included in the first random access opportunity group.

[0060] The above-mentioned first frequency hopping distance can be understood as the frequency distance between two random access opportunities in a frequency hopping communication system. In some scenarios, the above frequency hopping distance is also called the "frequency hopping interval." For ease of explanation, the following will describe the first frequency hopping distance as an example. In the embodiments of this application, the frequency domain units of the frequency hopping distance are not limited. For example, the frequency domain units of the frequency hopping distance may be RB. Alternatively, for example, the frequency domain units of the frequency hopping distance may be RE.

[0061] In the embodiments of this application, the number of random access opportunities included in the first random access opportunity group may include, or be replaced by, at least one of the number of preambles transmitted in the first random access opportunity group, or the number of PRACH transmissions in multiple PRACH transmissions performed based on the first random access opportunity group.

[0062] Furthermore, in the embodiments of the present application, the random access opportunity may include or be replaced by at least one of the following: a physical random access channel opportunity (PRACH opportunity) or a physical random access channel transmission opportunity (PRACH transmission opportunity).

[0063] In one embodiment, any two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated by the first frequency hopping distance in the frequency domain. That is, in this case, the time-frequency positions between all random access opportunities in the first random access opportunity group can satisfy the above condition. Of course, in the embodiment of the present application, the two random access opportunities in the first random access opportunity group may be random access opportunities that are adjacent in two time domains within the first random access opportunity group and separated by the first frequency hopping distance in the frequency domain. That is, in this case, the time-frequency positions between some two random access opportunities in the first random access opportunity group can satisfy the above condition.

[0064] Furthermore, if some random access opportunities within the first random access opportunity group satisfy the above conditions, the frequency hopping distance between the other random access opportunities within the first random access opportunity group may be one or more second frequency hopping distances, and one or more second frequency hopping distances may differ from the first frequency hopping distance. In addition, the embodiments of this application do not limit the method for determining the second frequency hopping distance, and for example, the second frequency hopping distance may be predefined or preconfigured.

[0065] In one embodiment, the number of random access opportunities included in the first random access opportunity group is configured to determine the first frequency hopping distance, or in other words, the first frequency hopping distance is determined based on the number of random access opportunities in the first random access opportunity group. The relationship between the first frequency hopping distance and the number of random access opportunities in the first random access group will be explained below with reference to Example 2, but for simplicity, the explanation will be omitted here.

[0066] In the embodiments of this application, the first frequency hopping distance may be determined solely based on the number of random access opportunities in the first random access opportunity group. Naturally, in the embodiments of this application, the first frequency hopping distance may also be determined based on the number of random access opportunities in the first random access opportunity group and other factors, the other factors may include, for example, transmission power, terrain, and communication environment.

[0067] In one embodiment, multiple random access opportunities included in the first random access opportunity group are configured to transmit the multiple preambles. For example, each random access opportunity in the multiple random access opportunities may be used to transmit one of the multiple preambles. Alternatively, each random access opportunity in the multiple random access opportunities may be used to transmit at least two of the multiple preambles. The relationship between random access opportunities and preambles in the embodiments of the present application will be explained below with reference to Figures 3 and 4, and for simplicity, the explanation will be omitted here.

[0068] In one embodiment, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group belongs to one PRACH slot in the time domain. Naturally, in the embodiments of the present application, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group belongs to one PRACH slot in the time domain, and the embodiments of the present application are not limited thereto.

[0069] In one embodiment, all random access opportunities in the multiple random access opportunities included in the first random access opportunity group belong to one PRACH slot in the time domain. Naturally, in embodiments of the present application, some random access opportunities in the multiple random access opportunities included in the first random access opportunity group belong to one PRACH slot in the time domain, and embodiments of the present application are not limited thereto.

[0070] The above describes the time-domain locations of multiple random access opportunities within the first random access opportunity group, and the following describes the time-domain granularity and / or frequency-domain granularity occupied by one random access opportunity within the first random access opportunity group in the embodiment of the present application.

[0071] In one embodiment, any random access opportunity in a plurality of random access opportunities included in the first random access opportunity group includes at least one multicarrier symbol in the time domain and / or such random access opportunity includes at least one RB in the frequency domain. In some other embodiments, any random access opportunity in a plurality of random access opportunities included in the first random access opportunity group includes at least one multicarrier symbol in the time domain and / or such random access opportunity includes at least one RB in the frequency domain. Naturally, embodiments of the present application do not limit the granularity of the time-frequency resources occupied by the random access opportunity.

[0072] In the embodiments of this application, the multicarrier symbol may include or be replaced by at least one of the following: a multicarrier symbol, an orthogonal frequency division multiplexing (OFDM) symbol, a discrete fourier transform-spread-OFDM (DFT-s-OFDM) symbol, or a single-carrier frequency division multiple access (SC-FDMA) symbol.

[0073] As one embodiment, the multiple random access opportunities included in the first random access opportunity group belong to multiple PRACH slots. For example, each random access opportunity in the multiple random access opportunities included in the first random access opportunity group belongs to one of the multiple PRACH slots. Alternatively, for example, some of the random access opportunities in the multiple random access opportunities included in the first random access opportunity group belong to one of the multiple PRACH slots.

[0074] In one embodiment, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies multiple multicarrier symbols in the time domain. Naturally, in the embodiments of the present application, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies multiple multicarrier symbols in the time domain, and the relevant explanation of multicarrier symbols can be found above.

[0075] In one embodiment, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies multiple uplink symbols in the time domain. Naturally, in the embodiment of the present application, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies multiple uplink symbols in the time domain.

[0076] In one embodiment, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies one RB in the frequency domain. Naturally, in the embodiments of the present application, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies one RB in the frequency domain, and the embodiments of the present application are not limited thereto.

[0077] In one embodiment, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies multiple RBs in the frequency domain. Naturally, in the embodiments of the present application, any random access opportunity in the group of multiple random access opportunities included in the first random access opportunity group occupies multiple RBs in the frequency domain, and the embodiments of the present application are not limited thereto.

[0078] Example 2 In one embodiment, there is a negative correlation between the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group. That is, the first frequency hopping distance decreases as the number of random access opportunities included in the first random access opportunity group increases, or in other words, the first frequency hopping distance increases as the number of random access opportunities included in the first random access opportunity group decreases.

[0079] If the number of random access opportunities included in random access opportunity group 1 is N1, the number of random access opportunities included in random access opportunity group 2 is N2, and N1 < N2, then the first frequency hopping distance corresponding to random access opportunity group 1 is greater than the first frequency hopping distance corresponding to random access opportunity 2.

[0080] The above explains the relationship between the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group in the embodiments of the present application. The following explains the determination method of the first frequency hopping distance in the embodiments of the present application.

[0081] As an example, the first frequency hopping distance is inversely proportional to the number of a plurality of random access opportunities included in the first random access opportunity group.

[0082] Figure 3 shows the relationship between the number of random access opportunities and the first frequency hopping distance among the random access opportunity groups in the embodiments of the present application. Taking the number of random access opportunities among the random access opportunity groups as the number of PRACH transmissions among the random access opportunity groups as an example, as shown in Figure 3, the number of PRACH transmissions in ROG1 is 2, that is, Rep1 = 2. Then, the first frequency hopping distance Drog1 corresponding to ROG1 can be determined by the formula Drog1 = (8 / Rep1) RB = 4RB. The number of PRACH transmissions in ROG2 is 4, that is, Rep2 = 4. Then, the first frequency hopping distance Drog2 corresponding to ROG2 can be determined by the formula Drog2 = (8 / Rep2) RB = 2RB. The number of PRACH transmissions in ROG3 is 8, that is, Rep3 = 8. Then, the first frequency hopping distance Drog3 corresponding to ROG3 can be determined by the formula Drog3 = (8 / Rep3) RB = 1RB. As can be seen from this, the first frequency hopping distance corresponding to ROG is inversely proportional to the number of PRACH transmissions in ROG.

[0083] In one embodiment, the first frequency hopping distance is equal to the remainder of the number of random access opportunities included in the first random access opportunity group and the first numerical value.

[0084] In one embodiment, the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is not greater than a first value. In other words, the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to a first value.

[0085] Figure 3 shows the relationship between the number of random access opportunities in a random access opportunity group and the first frequency hopping distance in an embodiment of the present invention. As an example, the number of random access opportunities in a random access opportunity group is the number of PRACH transmissions in the random access opportunity group, and the first value is 8. As shown in Figure 3, the number of PRACH transmissions in ROG1 is 2, i.e., Rep1 = 2, and the first frequency hopping distance Drog1 corresponding to ROG1 can be determined by the formula Drog1 = (8 / Rep1)RB = 4RB. The number of PRACH transmissions in ROG2 is 4, i.e., Rep2 = 4, and the first frequency hopping distance Drog2 corresponding to ROG2 can be determined by the formula Drog2 = (8 / Rep2)RB = 2RB. The number of PRACH transmissions in ROG3 is 8, i.e., Rep3 = 8, and the first frequency hopping distance Drog3 corresponding to ROG3 can be determined by the formula Drog3 = (8 / Rep3)RB = 1RB.

[0086] As can be seen from this, for ROG1, the product of the first frequency hopping distance and the number of PRACH transmissions in ROG1 is equal to the first value. For ROG2, the product of the first frequency hopping distance and the number of PRACH transmissions in ROG2 is equal to the first value. For ROG3, the product of the first frequency hopping distance and the number of PRACH transmissions in ROG3 is equal to the first value.

[0087] Naturally, in embodiments of the present application, the first frequency hopping distance may be determined based on the quotient between a first numerical value and the number of random access opportunities included in the first random access opportunity group. Alternatively, the first frequency hopping distance may be determined based on the remainder of the number of random access opportunities included in the first random access opportunity group and the embodiments of the present application are not specifically limited thereto.

[0088] In the embodiments of this application, the method for determining the first numerical value is not limited, and in one embodiment, the first numerical value may be fixed. In one embodiment, the first numerical value may be configured by upper-layer signaling. In one embodiment, the first numerical value may be equal to the number of random access opportunities that are frequency-division multiplexed in one period (e.g., a time instance).

[0089] The above describes the relationship between the number of random access opportunities in the first random access opportunity group and the first frequency hopping distance in embodiments of the present application. In some scenarios, a single period (e.g., a time instance) may contain multiple random access opportunities, and the first frequency hopping distance corresponding to such time instance may be related to the number of random access opportunities in that time instance. This will be explained below with reference to Embodiment 3.

[0090] Example 3 As one embodiment, the method shown in Figure 2 further includes the step of receiving first information, wherein the first information is configured to indicate the number of multiple random access opportunities within a single time instance, the multiple random access opportunities within the time instance are frequency-division multiplexed, and the first frequency-hopping distance is related to the number of multiple random access opportunities within the time instance.

[0091] In the embodiments of the present application, the time instance is not particularly limited. In one embodiment, the time instance may include one PRACH slot. In one embodiment, the time instance may include one multi-carrier symbol. In one embodiment, the time instance may include multiple multi-carrier symbols. For a description of carrier symbols, refer to Embodiment 1.

[0092] In one embodiment, the above-mentioned first information may be transmitted from a second node. Naturally, in the embodiments of the present application, the above-mentioned first information may be transmitted from other nodes, and the embodiments of the present application are not limited thereto.

[0093] In one embodiment, the first information may be configured to indicate the first numerical value. Of course, in the embodiment of the present application, the information indicating the first numerical value may be different from the first information.

[0094] In one embodiment, the first frequency hopping distance is related to both the number of random access opportunities included in the first random access opportunity group and the number of random access opportunities in one time instance.

[0095] In one embodiment, the number of random access opportunities within the time instance is configured to determine the first frequency hopping distance. In other words, the first frequency hopping distance may be determined based on the number of random access opportunities within the time instance.

[0096] In the embodiments of the present invention, the first frequency hopping distance may be determined solely on the number of random access opportunities within the time instance. Naturally, in the embodiments of the present invention, the first frequency hopping distance may also be determined on the number of random access opportunities within the time instance and other factors, the other factors may include, for example, transmission power, terrain, and communication environment.

[0097] As an example, the method for determining the first frequency hopping distance can also be used in combination with the method for determining the first frequency hopping distance described in Embodiment 2. That is, both the number of random access opportunities included in the first random access opportunity group and the number of random access opportunities within the time instance are configured to determine the first frequency hopping distance. Of course, in the embodiments of the present application, the method for determining the first frequency hopping distance can also be used individually with the method for determining the first frequency hopping distance described in Embodiment 2.

[0098] Hereinafter, referring to Embodiment 1 and Embodiment 2, a solution for individually determining the first frequency hopping distance based on the number of random access opportunity groups within the time instance, and a method for determining the first frequency hopping distance based on the number of random access opportunity groups within the time instance and the number of random access opportunities included in the first random access opportunity group will be described.

[0099] Embodiment 1: Method for Determining the First Frequency Hopping Distance Based on the Number of Random Access Opportunity Groups within the Time Instance As an example, the first frequency hopping distance has a negative correlation with the number of random access opportunities within the time instance. That is, the first frequency hopping distance decreases as the number of random access opportunities within the time instance increases. In other words, the first frequency hopping distance increases as the number of random access opportunities within the time instance decreases.

[0100] If the number of random access opportunities included in time instance 1 is N3, the number of random access opportunities included in time instance 2 is N4, and N3 < N4, then the first frequency hopping distance corresponding to time instance 1 is greater than the first frequency hopping distance corresponding to time instance 2.

[0101] The above describes the relationship between the first frequency hopping distance and the number of random access opportunities within the time instance in an embodiment of the present application, and the following describes the method for determining the first frequency hopping distance in another embodiment of the present application.

[0102] In one embodiment, the first frequency hopping distance is inversely proportional to the number of random access opportunities within the time instance.

[0103] In one embodiment, the first frequency hopping distance is equal to the remainder of the number of random access opportunities within the time instance by the first numerical value.

[0104] In one embodiment, the product of the first frequency hopping distance and the number of random access opportunities within the time instance is less than or equal to a first numerical value. In other words, the product of the first frequency hopping distance and the number of random access opportunities within the time instance is less than or equal to a first numerical value.

[0105] Naturally, in the embodiments of the present application, the first frequency hopping distance may be equal to the quotient of the first numerical value and the number of random access opportunities within the time instance. Alternatively, the first frequency hopping distance may be equal to the remainder of the number of random access opportunities within the time instance and the embodiments of the present application do not specifically limit this.

[0106] In the embodiments of this application, the method for determining the first numerical value is not limited, and in one embodiment, the first numerical value may be fixed. In one embodiment, the first numerical value may be configured by upper-layer signaling. In one embodiment, the first numerical value may be equal to the number of random access opportunities that are frequency-division multiplexed in the time instance.

[0107] Embodiment 2: A method for determining the first frequency hopping distance based on the number of random access opportunity groups within the time instance and the number of random access opportunities included in the first random access opportunity group.

[0108] In one embodiment, the first frequency hopping distance is equal to the remainder of the number of random access opportunities within the time instance and the number of random access opportunities included in the first random access opportunity group.

[0109] In one embodiment, the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is not greater than the number of random access opportunities in the time instance. In other words, the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to the number of random access opportunities in the time instance.

[0110] Figure 3 shows the relationship between the number of random access opportunities in a random access opportunity group and the first frequency hopping distance in an embodiment of the present invention. The number of random access opportunities in a random access opportunity group is the number of PRACH transmissions in the random access opportunity group, and taking the number of multiple random access opportunities in the time instance as 8 as an example, then as shown in Figure 3, the number of PRACH transmissions in ROG1 is 2, i.e., Rep1 = 2, and the first frequency hopping distance Drog1 corresponding to ROG1 can be determined by the formula Drog1 = (8 / Rep1)RB = 4RB. The number of PRACH transmissions in ROG2 is 4, i.e., Rep2 = 4, and the first frequency hopping distance Drog2 corresponding to ROG2 can be determined by the formula Drog2 = (8 / Rep2)RB = 2RB. The number of PRACH transmissions in ROG3 is 8, i.e., Rep3 = 8, and the first frequency hopping distance Drog3 corresponding to ROG3 can be determined by the formula Drog3 = (8 / Rep3)RB = 1RB.

[0111] As can be seen from the above, for ROG1, the product of the first frequency hopping distance and the number of PRACH transmissions in ROG1 is equal to the number of multiple random access opportunities within the time instance. For ROG2, the product of the first frequency hopping distance and the number of PRACH transmissions in ROG2 is equal to the number of multiple random access opportunities within the time instance. For ROG3, the product of the first frequency hopping distance and the number of PRACH transmissions in ROG3 is equal to the number of multiple random access opportunities within the time instance.

[0112] Naturally, in embodiments of the present application, the first frequency hopping distance may be determined based on the quotient of the number of random access opportunities in the time instance and the number of multiple random access opportunities included in the first random access opportunity group. Alternatively, the first frequency hopping distance may be determined based on the remainder of the number of random access opportunities in the time instance and the number of multiple random access opportunities included in the first random access opportunity group, and embodiments of the present application are not specifically limited thereto.

[0113] The embodiments of this application are not limited to the first information. In one embodiment, the first information may be a single radio resource control (RRC) layer signaling, or the first information may be carried to an RRC signaling.

[0114] In one embodiment, the first information may include a single radio resource control information element (RRC information element, RRCIE), or in other words, the first information may be transmitted to the RRC IE.

[0115] In one embodiment, the first information may include a RACH generic configuration (RACH-ConfigGeneric), or in other words, the first information may be transported to the RACH-ConfigGeneric. The RACH-ConfigGeneric is configured to configure the parameters of RACH. In some embodiments, the preambleInfo may include one or more sub-items of information for configuring a random access sequence, such as preambleInitialReceivedTargetPower, initial received power of the random access sequence, powerRampingStep configured to gradually increase the transmit power before transmitting the random access, preambleTransMax (maximum number of transmissions of the random access sequence), raResponseWindowSize (random access response window size for the length of the random access response window), number of random access response slots for a MAC ContentionResolutionTimer to indicate the number of slots awaiting MAC contention resolution, maxHARQMsg3Tx (maximum number of HARQ retransmissions configured to retransmit RRC connection request messages), rarWindowSize (size of the RRC connection request window indicating the number of RRC connection request slots), sequence number, Zadoff-Chu sequence index, and Zadoff-Chu sequence root index. For a description of RACH-ConfigGeneric, please refer to Section 6.3.2 of 3GPP® TS38.331.

[0116] In one embodiment, the first information may include message1-frequency division mutiplexing (msg1-FDM), or in other words, the first information may be carried to msg1-FDM. msg1-FDM is configured to indicate PRACH chances in the frequency domain at the same time. A description of msg1-FDM can be found in section 6.3.2 of 3GPP® TS38.331.

[0117] In the embodiments of the present application, the relationship between the first random access opportunity group and the time instance is not limited. In some embodiments, all random access opportunities in the first random access opportunity group may be located within a single period (i.e., the time instance described above). In some other embodiments, any two random access opportunities in the first random access opportunity group may each be in two different time instances. For example, each random access opportunity in the first random access opportunity group may be in a different time instance. Naturally, in the embodiments of the present application, two random access opportunities in the first random access opportunity group may each be in two different time instances, and correspondingly, other random access opportunities in the first random access opportunity group other than the two aforementioned random access opportunities may be in the same time instance, and the other random access opportunities may consist of one or more random access opportunities.

[0118] In the embodiments of the present invention, the two random access opportunities (any two random access opportunities, or two random access times) can be replaced with two random access opportunities (any two random access opportunities, or two random access times) in two different time instances, each occupying two different time instances.

[0119] Furthermore, the embodiments of this application do not specifically limit the two random access opportunities (any two random access opportunities, or two random access times). In one embodiment, the two random access opportunities are frequency-division multiplexed. In another embodiment, the two random access opportunities are orthogonal in the time domain.

[0120] In some scenarios, the first random access opportunity group may belong to one of several random access opportunity groups, and one or more of these groups may contain multiple random access opportunities. The multiple random access opportunity groups in embodiments of the present application are described below.

[0121] In one embodiment, the multiple random access opportunities included in at least two of the multiple random access opportunity groups have one or more different random access opportunities. That is, the multiple random access opportunities included in at least two random access opportunity groups and the multiple random access opportunities included in the other of the at least two random access opportunity groups have at least one different random access opportunity.

[0122] Furthermore, the statement that multiple random access opportunities included in at least two random access opportunity groups and multiple random access opportunities included in the other of the at least two random access opportunity groups have at least one different random access opportunity can be understood as meaning that all random access opportunities in the multiple random access opportunities included in at least two random access opportunity groups are different (see Figure 3 as an example below). Naturally, in the embodiments of the present application, it can also be understood as meaning that some of the random access opportunities in the multiple random access opportunities included in at least two random access opportunity groups are different (see Figure 4 as an example below).

[0123] Furthermore, the embodiments of the present application do not limit the random access opportunity groups in which different random access opportunities reside. In one embodiment, at least one random access opportunity in a plurality of random access opportunities included in any two random access opportunity groups among the plurality of random access opportunity groups is different. In one embodiment, at least one random access opportunity in a plurality of random access opportunities included in two random access opportunity groups among the plurality of random access opportunity groups is different.

[0124] Naturally, in the embodiments of the present invention, the multiple random access opportunities included in all of the multiple random access opportunity groups in the multiple random access opportunity groups may be exactly the same.

[0125] In one embodiment, the number of random access opportunities included in any of the multiple random access opportunity groups is one of 2, 4, or 8. In other words, the number of random access opportunities included in a particular random access opportunity group within the multiple random access opportunity groups is one of 2, 4, or 8. Naturally, in the embodiments of the present application, one or more of the multiple random access opportunity groups may further include other numbers of random access opportunities.

[0126] In another embodiment, each of the multiple random access opportunity groups corresponds to a multiple preamble, and at least two of the multiple random access opportunity groups correspond to different preambles.

[0127] Furthermore, the fact that the preambles corresponding to at least two random access opportunity groups are different can be understood as meaning that the preamble corresponding to each random access opportunity group is different in multiple random access opportunity groups (this will be explained below using Figure 4 as an example). Naturally, in the embodiments of this application, it can also be understood as meaning that the preambles corresponding to some random access opportunity groups in multiple random access opportunities included in at least two random access opportunity groups are different.

[0128] In one embodiment, a plurality of first sequences are configured to generate the plurality of preambles corresponding to the plurality of random access opportunity groups.

[0129] In the embodiments of this application, the number of first sequences is not limited. In one embodiment, any two of the multiple first sequences are different. In one embodiment, the initial values ​​of any two of the multiple first sequences are different. In one embodiment, the cyclic shifts of any two of the multiple first sequences are different. Naturally, in the embodiments of this application, the initial values ​​and cyclic shifts of any two of the multiple first sequences are all different. Or, the initial values ​​of any two of the multiple first sequences are the same, but the cyclic shifts of these two first sequences are all different. Or, the initial values ​​of any two of the multiple first sequences are different, but the cyclic shifts of these two first sequences are the same.

[0130] In one embodiment, two of the multiple first sequences are different. In another embodiment, the initial values ​​of two of the multiple first sequences are different. In another embodiment, the cyclic shifts of two of the multiple first sequences are different. Naturally, in the embodiments of the present application, the initial values ​​and cyclic shifts of two of the multiple first sequences are all different. Or, the initial values ​​of two of the multiple first sequences are the same, but the cyclic shifts of these two first sequences are all different. Or, the initial values ​​of two of the multiple first sequences are different, but the cyclic shifts of these two first sequences are the same.

[0131] The above describes the multiple random access opportunity groups in the embodiment of the present application, and below, the method for determining the first random access opportunity group in the embodiment of the present application will be described.

[0132] In one embodiment, the first random access opportunity group may be determined based on the index of the first synchronization signal block and the reception quality for the first synchronization signal block. That is, the method further includes the step of receiving the first synchronization signal block, wherein the index of the first synchronization signal block and the reception quality for the first synchronization signal block are configured to determine the first random access opportunity group.

[0133] In the embodiments of this application, the method for determining the first random access opportunity group is not limited. In one embodiment, the index of the first synchronization signal block is configured to determine the first random access opportunity group. In one embodiment, the reception quality for the first synchronization signal block is configured to determine the first random access opportunity group.

[0134] In the embodiments of this application, the reception quality for the first synchronization signal block is not limited. In one embodiment, the reception quality for the first synchronization signal block includes RSRP. In one embodiment, the reception quality for the first synchronization signal block includes SS-RSRP. In one embodiment, the reception quality for the first synchronization signal block includes CSI-RSRP. In one embodiment, the reception quality for the first synchronization signal block includes RSRQ. In one embodiment, the reception quality for the first synchronization signal block includes SINR.

[0135] As one example, the definition of SS-RSRP is as described above, refer to Section 5.1.1 of 3GPP® TS38.215.

[0136] As one example, the definition of CSI-RSRP is as described above, refer to Section 5.1.2 of 3GPP® TS38.215.

[0137] In the embodiments of this application, the first synchronization signal block may be transmitted from a network device, or, taking the second node as an example, the first synchronization signal block may be transmitted from the second node. In the embodiments of this application, the first synchronization signal block may also be called a synchronization signal / physical broadcast channel block (SS / PBCH block).

[0138] Furthermore, in the embodiments of the present application, the index of the first synchronization signal block may be one of the indices of a plurality of candidate synchronization signal blocks. In one embodiment, the indices of the plurality of candidate synchronization signal blocks may each be mapped to a plurality of random access time groups.

[0139] In one embodiment, multiple beams are applied to transmit the multiple preambles in the first random access opportunity group, and the multiple beams are the same. Naturally, in the embodiments of the present application, some or all of the multiple beams may be the same.

[0140] Furthermore, the beam referred to in this application may include, or be replaced by, at least one of the following: beam, physical beam, logical beam, spatial filter, spatial domain filter, spatial domain transmission filter, spatial domain reception filter, or antenna port.

[0141] To facilitate understanding, the frequency hopping method of the embodiment of this application will be explained below with reference to Figures 3 and 4. In the method shown in Figures 3 and 4, the number of PRACH transmissions in the ROG will be explained as an example in which the number of ROs included in the ROG is used.

[0142] Figure 3 shows the frequency hopping method in ROG1 to ROG3 of the embodiment of the present application. As shown in Figure 3, the number of PRACH transmissions differs in different ROGs: ROG1 has 2 PRACH transmissions, ROG2 has 4 PRACH transmissions, and ROG3 has 8 PRACH transmissions. Furthermore, the ROs occupied by different ROGs are relatively independent, and therefore the starting RBs of the ROs of different ROGs are different. The RB index pattern adopted in the frequency domain for ROG1 is {0, 4}, the RB index pattern adopted in the frequency domain for ROG2 is {0, 2, 4, 6}, and the RB index pattern adopted in the frequency domain for ROG3 is {4, 5, 6, 7, 0, 1, 2, 3}.

[0143] For each ROG, the first frequency hopping distance (indicated as "Drog") between two adjacent ROs in the time domain is related to the number of PRACH transmissions in that ROG. For ROG1, the number of PRACH transmissions in ROG1, Rep1, is 2, i.e., Rep1 = 2, and the first frequency hopping distance Drog1 can be determined by the formula Drog1 = (8 / Rep1)RB = 4RB. For ROG2, the number of PRACH transmissions, Rep2, is 4, i.e., Rep2 = 4, and the first frequency hopping distance Drog2 can be determined by the formula Drog2 = (8 / Rep2)RB = 2RB. For ROG3, the number of PRACH transmissions, Rep3, is 8, i.e., Rep3 = 8, and the first frequency hopping distance Drog3 can be determined by the formula Drog3 = (8 / Rep3)RB = 1RB. In other words, in the frequency hopping scheme shown in Figure 3, the first frequency hopping distance in the ROG is inversely proportional to the number of PRACH transmissions in the ROG.

[0144] Figure 4 shows a frequency hopping scheme in ROG1 to ROG3 according to another embodiment of the present invention. As shown in Figure 4, the number of PRACH transmissions differs in different ROGs. ROG1 has 2 PRACH transmissions, ROG2 has 4 PRACH transmissions, and ROG3 has 8 PRACH transmissions. Furthermore, ROs in multiple ROGs may overlap in the time domain. The preambles adopted by different ROGs are independent of each other; that is, ROGs can be distinguished by different preambles, and therefore, the RO start RB of different ROGs may be the same. For ROG1, the RB index pattern used in the frequency domain is {0, 4}. For ROG2, the RB index pattern used in the frequency domain is {0, 2, 4, 6}. For ROG3, the RB index pattern used in the frequency domain is {0, 1, 2, 3, 4, 5, 6, 7}.

[0145] For each ROG, the first frequency hopping distance (indicated as "Drog") between two adjacent ROs in the time domain is related to the number of PRACH transmissions in that ROG. For ROG1, the number of PRACH transmissions in ROG1, Rep1, is 2, i.e., Rep1 = 2, and the first frequency hopping distance can be determined by the formula Drog1 = (8 / Rep1)RB = 4RB. For ROG2, the number of PRACH transmissions, Rep2, is 4, i.e., Rep2 = 4, and the first frequency hopping distance can be determined by the formula Drog2 = (8 / Rep2)RB = 2RB. For ROG3, the number of PRACH transmissions in ROG3, Rep3, is 8, i.e., Rep3 = 8, and the first frequency hopping distance can be determined by the formula Drog3 = (8 / Rep3)RB = 1RB. In other words, in the frequency hopping scheme shown in Figure 4, the first frequency hopping distance in the ROG is inversely proportional to the number of PRACH transmissions in the ROG.

[0146] As mentioned above, in conventional frequency hopping methods, the frequency hopping distance between two ROs in an ROG is fixed, and the RBs occupied by different ROs are also fixed. As a result, the frequency domain span of the ROG is limited, and the frequency domain diversity gain of the frequency hopping method is restricted. In the embodiment of the present invention, a new frequency hopping method is introduced, and the frequency hopping distance between two ROs in an ROG (e.g., the first frequency hopping distance) can be changed in accordance with the number of PRACH transmissions in the ROG. This contributes to improving the frequency domain span corresponding to the ROG and to improving the frequency domain diversity gain of the frequency hopping method.

[0147] For example, as shown in Figure 3 or Figure 4, the frequency domain span of ROG1, which includes two PRACH transmissions, may be a frequency domain range corresponding to four RBs. Also, for example, as shown in Figure 3 or Figure 4, the frequency domain span of ROG2, which includes four PRACH transmissions, may be a frequency domain range corresponding to seven RBs. Also, for example, as shown in Figure 3 or Figure 4, the frequency domain span of ROG3, which includes eight PRACH transmissions, may be a frequency domain range corresponding to eight RBs.

[0148] Furthermore, in the frequency hopping method of the embodiment of the present invention, the frequency hopping distances corresponding to different ROGs differ significantly (for example, there is a large difference in the frequency hopping patterns corresponding to different ROGs), and by shifting some or all of the ROs in different ROGs, it contributes to reducing the probability of collisions between preambles transmitted at multiple different ROs. In particular, when different users employ random selection, even if there is a possibility of collisions between preambles selected by different users at one RO, the probability of collisions at multiple different ROs is small. Therefore, the frequency hopping method of the embodiment of the present invention improves the coverage performance of multiple PRACH transmissions, reduces the probability of PRACH collisions, and thereby contributes to reducing random access delay and improving resource utilization efficiency.

[0149] The method embodiment of the present application has been described in detail above with reference to Figures 1 to 4. Now, the apparatus embodiment of the present application will be described in detail below with reference to Figures 5 to 8. It should be understood that the description of the method embodiment corresponds to the description of the apparatus embodiment, so for parts not described in detail, you can refer to the method embodiment described above.

[0150] Figure 5 is a schematic diagram of a first node used for wireless communication in an embodiment of the present invention, and the first node 500 shown in Figure 5 may include a first transmitter 510.

[0151] The first transmitter 510 is configured to transmit multiple preambles in a first random access opportunity group, the first random access opportunity group comprising multiple random access opportunities, two random access opportunities in the first random access opportunity group being adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance relating to the number of multiple random access opportunities included in the first random access opportunity group.

[0152] In one embodiment, there is a negative correlation between the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group.

[0153] In one embodiment, the first node 500 shown in Figure 5 may include a first receiver configured to receive first information, the first information configured to indicate the number of multiple random access opportunities in a single time instance, the multiple random access opportunities in the time instance being frequency-division multiplexed, and the first frequency-hopping distance being related to the number of multiple random access opportunities in the time instance.

[0154] In one embodiment, the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to the number of random access opportunities in one time instance.

[0155] As one embodiment, any two random access opportunities in the first random access opportunity group each exist in two different time instances.

[0156] In one embodiment, the first random access opportunity group is one of a plurality of random access opportunity groups, and any of the plurality of random access opportunity groups includes a plurality of random access opportunities, and the plurality of random access opportunities included in at least two random access opportunity groups and the plurality of random access opportunities included in the other of the at least two random access opportunity groups each have at least one different random access opportunity.

[0157] In one embodiment, the first random access opportunity group is one of a plurality of random access opportunity groups, any of the plurality of random access opportunity groups includes a plurality of random access opportunities, each of the plurality of random access opportunity groups corresponds to a plurality of preambles, and at least two of the plurality of random access opportunity groups correspond to different preambles.

[0158] In one embodiment, the first receiver is configured to receive a first synchronization signal block, the index of the first synchronization signal block being one of a plurality of candidate synchronization signal block indices, and the index of the first synchronization signal block and the reception quality for the first synchronization signal block are configured to determine the first random access opportunity group.

[0159] In one embodiment, each of the multiple beams is applied to transmit the multiple preambles in the first random access opportunity group, and the multiple beams are the same.

[0160] In one embodiment, the number of random access opportunities included in the first random access opportunity group is one of 2, 4, or 8.

[0161] Figure 6 is a schematic diagram of a second node used for wireless communication in an embodiment of the present invention, and the second node shown in Figure 6 may include a first receiver 610.

[0162] The first receiver 610 is configured to receive one or more preambles in a first random access opportunity group, the first random access opportunity group comprising a plurality of random access opportunities, two random access opportunities in the first random access opportunity group being adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance relating to the number of plurality of random access opportunities in the first random access opportunity group.

[0163] In one embodiment, there is a negative correlation between the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group.

[0164] In one embodiment, a time instance includes multiple random access opportunities, the multiple random access opportunities within the time instance are frequency-division multiplexed, and the first frequency-hopping distance is related to the number of multiple random access opportunities within the time instance.

[0165] In one embodiment, the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to the number of random access opportunities in one time instance.

[0166] As one embodiment, any two random access opportunities in the first random access opportunity group each exist in two different time instances.

[0167] In one embodiment, the first random access opportunity group is one of a plurality of random access opportunity groups, and any of the plurality of random access opportunity groups includes a plurality of random access opportunities, and the plurality of random access opportunities included in at least two random access opportunity groups and the plurality of random access opportunities included in the other of the at least two random access opportunity groups each have at least one different random access opportunity.

[0168] In one embodiment, the first random access opportunity group is one of a plurality of random access opportunity groups, any of the plurality of random access opportunity groups includes a plurality of random access opportunities, each of the plurality of random access opportunity groups corresponds to a plurality of preambles, and at least two of the plurality of random access opportunity groups correspond to different preambles.

[0169] In one embodiment, the first random access opportunity group is determined based on the index of the first synchronization signal block and the reception quality for the first synchronization signal block, wherein the index of the first synchronization signal block is one of a plurality of candidate synchronization signal block indices.

[0170] In one embodiment, each of the multiple beams is applied to transmit the multiple preambles in the first random access opportunity group, and the multiple beams are the same.

[0171] In one embodiment, the number of random access opportunities included in the first random access opportunity group is one of 2, 4, or 8.

[0172] In selectable embodiments, the first transmitter 510 may be a transceiver 730. The first node 500 may further include the transceiver 730 and a memory 720, specifically as shown in Figure 7.

[0173] In selectable embodiments, the first receiver 610 may be a transceiver 730. The second node 600 may further include the transceiver 730 and a memory 720, specifically as shown in Figure 7.

[0174] Figure 7 is a schematic diagram of the structure of a communication device in an embodiment of the present invention. The dashed lines in Figure 7 indicate that the unit or module is selectable. The device 700 may be configured to implement the method described in the above embodiment. The device 700 may be a chip, user equipment, or network equipment.

[0175] The apparatus 700 may include one or more processors 710. The processors 710 can support the apparatus 700 in implementing the methods described in the above embodiment of the method. The processors 710 may be general-purpose processors or dedicated processors. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may be another general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc. The general-purpose processor may be a microprocessor, or the processor may be any conventional processor, etc.

[0176] The device 700 may further include one or more memories 720. A program is stored in the memory 720, which can be executed by the processor 710 to cause the processor 710 to perform the method described in the above embodiment of the method. The memory 720 may be independent of the processor 710 or may be integrated with the processor 710.

[0177] The device 700 may further include a transceiver 730. The processor 710 can communicate with other devices or chips via the transceiver 730. For example, the processor 710 can send and receive data with other devices or chips via the transceiver 730.

[0178] Figure 8 is a schematic diagram of the hardware module of a communication device according to an embodiment of the present invention. Specifically, Figure 8 shows a block diagram of a first communication device 450 and a second communication device 410 that communicate with each other in an access network.

[0179] The first communication device 450 includes a controller / processor 459, memory 460, data source 467, transmit processor 468, receive processor 456, multi-antenna transmit processor 457, multi-antenna receive processor 458, transmitter / receiver 454, and antenna 452.

[0180] The second communication device 410 includes a controller / processor 475, memory 476, data source 477, receiving processor 470, transmitting processor 416, multi-antenna receiving processor 472, multi-antenna transmitting processor 471, transmitter / receiver 418, and antenna 420.

[0181] In transmission from the second communication device 410 to the first communication device 450, the second communication device 410 provides the controller / processor 475 with upper-layer data packets from the core network or from the data source 477. The core network and data source 477 represent all protocol layers above the L2 layer. The controller / processor 475 performs the L2 layer functionality. In transmission from the second communication device 410 to the first communication device 450, the controller / processor 475 is configured to provide header compression, encryption, packet splitting and reordering, logic and multiplexing between transmission channels, and radio resource allocation to the first communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for retransmitting lost packets and signaling to the first communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 perform various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 416 facilitates forward error correction in the second communication device 410 and the mapping of signal clusters based on various modulation modes (e.g., binary phase-shift keying, quadrature phase-shift keying, M phase-shift keying, M quadrature amplitude modulation) by performing coding and interleaving. The multi-antenna transmit processor 471 performs digital spatial precoding and beamforming processing, including codebook-based precoding and non-codebook-based precoding, on the coded and modulated symbols to generate one or more spatial streams. The transmit processor 416 then maps each spatial stream to subcarriers, multiplexes them with a reference signal (e.g., a pilot) in the time domain and / or frequency domain, and then uses the inverse fast Fourier transform to generate a physical channel carrying the time-domain multicarrier symbol stream. The multi-antenna transmit processor 471 then performs transmit analog precoding / beamforming operations on the time-domain multicarrier symbol stream. Each transmitter 418 converts the baseband multicarrier symbol stream provided by the multi-antenna transmit processor 471 into an RF stream and then provides it to a different antenna 420.

[0182] In transmission from the second communication device 410 to the first communication device 450, each receiver 454 in the first communication device 450 receives the signal via its corresponding antenna 452. Each receiver 454 reconstructs the information modulated on the RF carrier and converts the RF stream into a baseband multi-carrier symbol stream, which is then provided to the receiving processor 456. The receiving processor 456 and the multi-antenna receiving processor 458 perform various signal processing functions of the L1 layer. The multi-antenna receiving processor 458 performs a received analog precoding / beamforming operation on the baseband multi-carrier symbol stream from the receiver 454. The receiving processor 456 uses the Fast Fourier Transform to convert the baseband multi-carrier symbol stream after the received analog precoding / beamforming operation from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and reference signal are demultiplexed by the receiving processor 456; the reference signal is used for channel estimation, and the data signal, after multi-antenna detection by the multi-antenna receiving processor 458, reconstructs an arbitrary spatial stream destined for the first communication device 450. Symbols in each spatial stream are demodulated and restored in the receiving processor 456 to generate a soft decision. The receiving processor 456 then decodes and deinterleaves the soft decision to restore the upper-layer data and control signals transmitted from the second communication device 410 on the physical channel. The upper-layer data and control signals are then provided to the controller / processor 459. The controller / processor 459 performs the functions of the L2 layer. The controller / processor 459 may be associated with a memory 460 that stores program code and data. The memory 460 may be called a computer-readable medium. In transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 restores the upper-layer data packets from the second communication device 410 by providing transmission and multiplexing between logic channels, packet reconstruction, decoding, header decompression, and control signal processing. The upper-layer data packets are then provided to all protocol layers above the L2 layer. Various control signals may be provided to L3 for use in L3 processing.

[0183] In transmission from the first communication device 450 to the second communication device 410, the first communication device 450 provides upper-layer data packets to the controller / processor 459 using data source 467. Data source 467 represents all protocol layers above the L2 layer. Similar to the transmission function of the second communication device 410 described in the transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 performs header compression, encryption, packet splitting, reordering, logic, and multiplexing between transmission channels, and performs L2 layer functions used in the user plane and control plane. The controller / processor 459 is also responsible for retransmitting lost packets and signaling to the second communication device 410. The transmit processor 468 performs modulation mapping and channel coding processing, and the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding and beamforming processing, including codebook-based precoding and non-codebook-based precoding. The transmit processor 468 then modulates the generated spatial stream into a multi-carrier / single-carrier symbol stream, and after analog precoding / beamforming operations are performed in the multi-antenna transmit processor 457, it is provided to different antennas 452 via the transmitter 454. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into an RF symbol stream, and then provides it to the antenna 452.

[0184] In transmission from the first communication device 450 to the second communication device 410, the functions of the second communication device 410 are the same as those of the first communication device 450 described in the transmission from the second communication device 410 to the first communication device 450. Each receiver 418 receives an RF signal by its corresponding antenna 420, converts the received RF signal into a baseband signal, and provides the baseband signal to the multi-antenna receiving processor 472 and the receiving processor 470. The receiving processor 470 and the multi-antenna receiving processor 472 jointly perform the functions of the L1 layer. The controller / processor 475 performs the functions of the L2 layer. The controller / processor 475 may be associated with a memory 476 that stores program code and data. The memory 476 may be called a computer-readable medium. In transmission from the first communication device 450 to the second communication device 410, the controller / processor 475 restores the upper-layer data packets from the first communication device 450 by providing transmission and multiplexing between logic channels, packet reconstruction, decoding, header decompression, and control signal processing. The upper-layer data packets from the controller / processor 475 may be provided to the core network or all protocol layers above the L2 layer, and various control signals may be provided to the core network or L3 for use in L3 processing.

[0185] As an embodiment, the first communication device 450 includes at least one processor and at least one memory, the at least one memory includes computer program code, the at least one memory and the computer program code are configured to be used together with the at least one processor, the first communication device 450 is configured to at least perform the task of receiving first information, the first information includes a plurality of beam information and a plurality of time-domain resource sets, the plurality of beam information and the plurality of time-domain resource sets correspond one-to-one, at least two of the plurality of time-domain resource sets include a first time-domain resource, at least two beam information corresponding to each of the at least two time-domain resource sets are different, at least one of the at least two beam information is configured to determine that the second module is in a first state in the first time-domain resource, the first state is one of a plurality of candidate states, the plurality of candidate states include at least two of the following: off state, transmitting a wireless signal on one or more first beams, and receiving a wireless signal on one or more first beams.

[0186] In one embodiment, the first communication device 450 includes a memory for storing a computer-readable instruction program, the computer-readable instruction program, when executed by at least one processor, generates an operation, the operation includes transmitting a plurality of preambles in a first random access opportunity group, the first random access opportunity group includes a plurality of random access opportunities, two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance being related to the number of plurality of random access opportunities included in the first random access opportunity group.

[0187] In one embodiment, the first communication device 450 corresponds to the first node in this application. Correspondingly, in one embodiment, the second communication device 410 corresponds to the second node in this application.

[0188] The embodiments of this application are not limited to the first communication device. In one embodiment, the first communication device 450 is a single NCR. In one embodiment, the first communication device 450 is a single wireless repeater. In one embodiment, the first communication device 450 is a relay. In one embodiment, the first communication device 450 is a single user device which can function as a relay node. In one embodiment, the first communication device 450 is a user device that supports V2X which can function as a relay node. In one embodiment, the first communication device 450 is a user device that supports D2D which can function as a relay node.

[0189] The embodiments of this application are not limited to the second communication device. In one embodiment, the second communication device 410 is an access network device.

[0190] In one embodiment, the antenna 452, the receiver 454, the multi-antenna receiving processor 458, the receiving processor 456, and the controller / processor 459 are configured to receive a plurality of preambles in this application.

[0191] In one embodiment, the antenna 420, the transmitter 418, the multi-antenna transmitting processor 471, the transmitting processor 416, and the controller / processor 475 are configured to transmit a plurality of preambles in this application.

[0192] In one embodiment, the antenna 452, the transmitter 454, the multi-antenna transmitting processor 457, the transmitting processor 468, and the controller / processor 459 are configured to transmit a plurality of preambles in this application.

[0193] In one embodiment, the antenna 420, the receiver 418, the multi-antenna receiving processor 472, the receiving processor 470, and the controller / processor 475 are configured to receive a plurality of preambles in this application.

[0194] Embodiments of the present application further provide a computer-readable storage medium for storing a program. The computer-readable storage medium can be applied to user equipment or network equipment according to embodiments of the present application, and the program causes a computer to execute the program in the manner performed by the user equipment or network equipment in each embodiment of the present application.

[0195] Embodiments of the present application further provide a computer program product, which includes a program, which can be applied to user equipment or network equipment according to embodiments of the present application, and which causes a computer to execute the methods performed by the user equipment or network equipment in each embodiment of the present application.

[0196] Embodiments of the present application further provide a computer program. The computer program can be applied to user equipment or network equipment according to embodiments of the present application, and the computer program causes a computer to execute the methods performed by the user equipment or network equipment in each embodiment of the present application.

[0197] It should be understood that, in this application, the terms “system” and “network” may be interchangeable. Furthermore, the terms used in this application are used solely to interpret the specific embodiments of this application and are not intended to limit it. Terms such as “first,” “second,” “third,” and “fourth” in the specification, claims, and drawings of this application are used to distinguish different subjects, not to describe a specific order. Also, the terms “include,” “have,” and any variations thereof are intended to cover non-exclusive inclusion.

[0198] In the embodiments of the present application, the “instruction” referred to may be a direct instruction, an indirect instruction, or an indication of a related relationship. For example, A instructing B may mean that A directly instructs B, for example, indicating that B can be obtained by A; or A indirectly instructs B, for example, indicating that A instructs C, indicating that B can be obtained by C; or an indication of a related relationship between A and B.

[0199] In the embodiments of this application, "B corresponding to A" indicates that B is associated with A and that B can be determined in accordance with A. However, determining B in accordance with A does not mean determining B in accordance with A alone, but rather that B may be determined in accordance with A and / or other information.

[0200] In the embodiments of this application, the term "correspondence" may indicate a direct or indirect correspondence between the two, a related relationship between the two, or a relationship such as instruction and instruction, or component and component.

[0201] In the embodiments of this application, “pre-defined” or “pre-configured” may be implemented by pre-storing in a device (including, for example, user devices and network devices) a form that can indicate the corresponding code, form, or related information, and this application does not limit the specific embodiments thereof. For example, pre-defined may mean defined in a protocol.

[0202] In the embodiments of the present application, the term "protocol" may refer to a standard protocol in the field of communications, and may include, for example, the LTE protocol, the NR protocol, and related protocols applicable to future communications systems, but is not limited thereto.

[0203] In the embodiments of this application, the term "and / or" simply describes the relationship between related objects and indicates that three types of relationships exist. For example, A and / or B include the three situations where only A exists, where A and B exist simultaneously, and where only B exists. In this specification, the symbol " / " generally indicates that the preceding and following related objects have an "or" relationship.

[0204] In the various embodiments of the present application, the magnitude of the process numbers does not indicate the order of execution, and the execution order of each process should be determined based on its function and inherent logic, and does not constitute any limitation on the implementation processes of the embodiments of the present application.

[0205] In some embodiments relating to this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other forms. For example, the device embodiments described above are merely illustrative, and the division of the units is merely one type of logic function division. In actual implementations, other division methods may be employed, for example, multiple units or components may be combined or integrated into another system, or some features may be ignored or omitted. Furthermore, the mutual coupling, direct coupling, or communication connection described or considered may also be an indirect coupling or communication connection via some interface, device, or unit, and may be in the form of electrical, mechanical, or other means.

[0206] The units described as separation members may or may not be physically separated, and the members referred to as units may or may not be physical units; that is, they may be located in one place or distributed among multiple network units. Some or all of the units can be selected as needed to achieve the objectives of the means of this embodiment.

[0207] Furthermore, each functional unit in each embodiment of the present application may be integrated into a single processing unit, each unit may exist physically separately, and two or more units may be integrated into a single unit.

[0208] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware, or any combination thereof. If implemented by software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. Loading and executing the computer program instructions into a computer generates all or part of the procedures or functions described in the embodiments of this application. The computer may be a general-purpose computer, a dedicated computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic cable, digital subscriber line (DSL)) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that a computer can read, or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media (e.g., solid state disks (SSDs)).

[0209] Although specific embodiments of the present application have been described above, the scope of protection of this application is not limited thereto. Any modifications or substitutions that a person skilled in the art could easily conceive without departing from the technical scope disclosed herein fall within the scope of protection of this application. Therefore, the scope of protection of this application should be the same as the scope of protection of the claims.

Claims

1. A method for wireless communication, The step includes sending multiple preambles in a first random access opportunity group, wherein the first random access opportunity group includes multiple random access opportunities. A method for wireless communication, wherein two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance being related to the number of multiple random access opportunities included in the first random access opportunity group, and there is a negative correlation between the first frequency hopping distance and the number of multiple random access opportunities included in the first random access opportunity group.

2. The process includes the step of receiving first information, the first information indicating the number of multiple random access opportunities within a single time instance, and the multiple random access opportunities within the time instance are frequency-division multiplexed. The method according to claim 1, wherein the first frequency hopping distance is related to the number of random access opportunities within the time instance.

3. The method according to claim 1, wherein the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to the number of random access opportunities in one time instance.

4. The method according to claim 1, wherein each random access opportunity in the first random access opportunity group is in a different time instance.

5. The first random access opportunity group is one of a plurality of random access opportunity groups, and each of the plurality of random access opportunity groups includes a plurality of random access opportunities. The method according to claim 1, wherein, for at least two of the plurality of random access opportunity groups, the plurality of random access opportunities included in the at least two random access opportunity groups and the plurality of random access opportunities included in the other of the at least two random access opportunity groups have at least one different random access opportunity.

6. The method according to claim 1, wherein the first random access opportunity group is one of a plurality of random access opportunity groups, each of the plurality of random access opportunity groups includes a plurality of random access opportunities, each of the plurality of random access opportunity groups corresponds to a plurality of preambles, and at least two of the plurality of random access opportunity groups correspond to different preambles.

7. The method according to claim 1, further comprising the step of receiving a first synchronization signal block, wherein the index of the first synchronization signal block is one of a plurality of candidate synchronization signal block indices, and the index of the first synchronization signal block and the reception quality for the first synchronization signal block are configured to determine the first random access opportunity group.

8. The method according to claim 1, wherein each of the multiple beams is applied to transmit the multiple preambles in the first random access opportunity group, and the multiple beams are the same.

9. The method according to claim 1, wherein the number of random access opportunities included in the first random access opportunity group is one of 2, 4, or 8.

10. A method for wireless communication, The process includes the step of receiving one or more preambles in a first random access opportunity group, wherein the first random access opportunity group includes multiple random access opportunities. A method for wireless communication, wherein two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance being related to the number of multiple random access opportunities in the first random access opportunity group, and there is a negative correlation between the first frequency hopping distance and the number of multiple random access opportunities included in the first random access opportunity group.

11. The method according to claim 10, wherein one time instance includes a plurality of random access opportunities, the plurality of random access opportunities within the time instance are frequency-division multiplexed, and the first frequency-hopping distance is related to the number of the plurality of random access opportunities within the time instance.

12. The method according to claim 10, wherein the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to the number of random access opportunities in one time instance.

13. The method according to claim 10, wherein each random access opportunity in the first random access opportunity group is in a different time instance.

14. The first random access opportunity group is one of a plurality of random access opportunity groups, and each of the plurality of random access opportunity groups includes a plurality of random access opportunities. The method according to claim 10, wherein, for at least two of the plurality of random access opportunity groups, the plurality of random access opportunities included in the at least two random access opportunity groups and the plurality of random access opportunities included in the other of the at least two random access opportunity groups each include at least one different random access opportunity.

15. A first node for wireless communication, At least one processor, The first node comprises one or more memories connected to the at least one processor and storing program instructions, and when the program instructions are executed by the at least one processor, In the first random access opportunity group, multiple preambles are transmitted, and the first random access opportunity group includes multiple random access opportunities. A first node for wireless communication, wherein two random access opportunities in the first random access opportunity group are adjacent in the time domain and separated in the frequency domain by a first frequency hopping distance, the first frequency hopping distance being related to the number of random access opportunities included in the first random access opportunity group, and there is a negative correlation between the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group.

16. When the program instruction is executed by the at least one processor, the first node, A first piece of information is received, which indicates the number of multiple random access opportunities within a single time instance, and these multiple random access opportunities within a time instance are frequency-division multiplexed. The first node according to claim 15, wherein the first frequency hopping distance is related to the number of random access opportunities within the time instance.

17. The first node according to claim 15, wherein the product of the first frequency hopping distance and the number of random access opportunities included in the first random access opportunity group is less than or equal to the number of random access opportunities in one time instance.

18. The first node according to claim 15, wherein each random access opportunity in the first random access opportunity group is in a different time instance.

19. The first random access opportunity group is one of a plurality of random access opportunity groups, and each of the plurality of random access opportunity groups includes a plurality of random access opportunities. The first node according to claim 15, wherein, for at least two of the plurality of random access opportunity groups, the plurality of random access opportunities included in the at least two random access opportunity groups and the plurality of random access opportunities included in the other of the at least two random access opportunity groups each include at least one different random access opportunity.

20. The first random access opportunity group is one of a plurality of random access opportunity groups, each of the plurality of random access opportunity groups includes a plurality of random access opportunities, and each of the plurality of random access opportunity groups corresponds to a plurality of preambles. The first node according to claim 15, wherein at least two of the plurality of random access opportunity groups correspond to different preambles.

Images