Method and arrangement in node used for wireless communication
The method dynamically adjusts PRACH transmission time windows using RNTIs and configuration information to optimize resource utilization and enhance PRACH performance and coverage in communication systems.
Patent Information
- Application Number
- CN202411385758.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-04-14
- Publication Date
- 2024-12-06
AI Technical Summary
Existing communication systems face challenges in configuring a uniform time window for multiple PRACH transmissions, which can lead to performance bottlenecks and inadequate coverage, especially in systems like NR, due to varying requirements and potential lengthening of transmission times.
A method and apparatus that dynamically adjust the length of a time window for PRACH transmissions based on the number of physical random access channel opportunities, using radio network temporary identifiers (RNTIs) and configuration information to optimize the time window length, allowing for flexible and efficient resource utilization.
Enhances the performance and coverage of PRACH transmissions by optimizing time window lengths, reducing delay, and improving resource utilization, thereby addressing the limitations of uniform window configurations.
Smart Images

Figure CN119095191A_ABST
Abstract
Description
[0001] This application is a divisional application of the case with application number 202380010768.4, application date April 14, 2023, and invention name “Method and device used in a node for wireless communication”. Technical Field
[0002] The present application relates to the field of communication technology, and more specifically, to a method and a device in a node used for wireless communication. Background Art
[0003] In order to enhance the coverage performance of the physical random access channel (PRACH), some communication systems (such as new radio (NR) systems) plan to introduce a scheme of multiple PRACH transmissions. At present, for multiple PRACH transmissions in a random access attempt, only one time window may be supported for monitoring control signaling. If a uniformly configured time window length is used in the scheme of multiple PRACH transmissions, the uniformly configured time window length may not meet the configuration requirements of multiple PRACH transmissions; or, in order to meet the requirements of the number of valid physical random access channel opportunities, it may lead to the lengthening of the time span of multiple PRACH transmissions, thereby further lengthening the length of the uniformly configured time window; or, it may affect the performance of multiple PRACH transmissions, making PRACH transmission a bottleneck in the coverage of the communication system. Summary of the invention
[0004] The embodiments of the present application provide a method and an apparatus in a node used for wireless communication. The following introduces various aspects involved in the present application.
[0005] In a first aspect, a first node used for wireless communication is provided, comprising: a first transmitter, transmitting multiple random access preambles, multiple physical random access channel opportunities are used for transmitting the multiple random access preambles, and the multiple physical random access channel opportunities correspond to multiple physical random access channel transmissions respectively; a first receiver, as a response to the multiple physical random access channel transmissions, monitors first control signaling within a first time window; wherein the length of the first time window is related to the number of the multiple physical random access channel transmissions.
[0006] As an implementation manner, the first control signaling is scrambled by a first radio network temporary identifier (RNTI), and the first RNTI is associated with the multiple physical random access channel opportunities.
[0007] As an implementation manner, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0008] As an implementation method, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0009] As an implementation method, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0010] As an implementation method, the first receiver receives first configuration information; wherein the first configuration information and the number of physical random access channels sent are jointly used to determine the length of the first time window.
[0011] As an implementation method, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0012] As an implementation method, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0013] As an implementation method, the first receiver receives second configuration information, and the second configuration information includes a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0014] As an implementation manner, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0015] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0016] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0017] As an implementation method, the first receiver receives first information, where the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0018] As an implementation manner, any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
[0019] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0020] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0021] As an implementation manner, the first receiver receives a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0022] As an implementation manner, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0023] As an implementation manner, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0024] As an implementation manner, the first receiver receives a first transmission block within the first time window, the first transmission block is on a corresponding physical downlink shared channel (PDSCH), and the first control signaling is used to schedule the PDSCH.
[0025] In a second aspect, a second node used for wireless communication is provided, comprising: a first receiver, receiving one or more of a plurality of random access preambles, a plurality of physical random access channel opportunities being used for sending the plurality of random access preambles, the plurality of physical random access channel opportunities corresponding to a plurality of physical random access channel transmissions, respectively; a first transmitter, sending a first control signaling within a first time window as a response to the plurality of physical random access channel transmissions; wherein the length of the first time window is related to the number of the plurality of physical random access channel transmissions.
[0026] As an implementation manner, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the multiple physical random access channel opportunities.
[0027] As an implementation manner, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0028] As an implementation method, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0029] As an implementation method, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0030] As an implementation method, the first transmitter sends first configuration information; wherein the first configuration information and the number of the multiple physical random access channels sent are jointly used to determine the length of the first time window.
[0031] As an implementation method, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0032] As an implementation method, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0033] As an implementation method, the first transmitter sends second configuration information, and the second configuration information includes a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0034] As an implementation manner, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0035] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0036] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0037] As an implementation method, the first transmitter sends first information, where the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0038] As an implementation manner, any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
[0039] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0040] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0041] As an implementation manner, the first transmitter sends a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0042] As an implementation manner, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0043] As an implementation manner, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0044] As an implementation manner, the first transmitter sends a first transmission block within the first time window, the first transmission block is on a corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0045] According to a third aspect, a method is provided in a first node used for wireless communication, comprising: sending multiple random access preambles, multiple physical random access channel opportunities are used for the sending of the multiple random access preambles, and the multiple physical random access channel opportunities correspond to multiple physical random access channel sendings respectively; as a response to the sending of the multiple physical random access channels, monitoring first control signaling within a first time window; wherein the length of the first time window is related to the number of the multiple physical random access channel sendings.
[0046] As an implementation manner, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the multiple physical random access channel opportunities.
[0047] As an implementation manner, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0048] As an implementation method, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0049] As an implementation method, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0050] As an implementation manner, the method includes: receiving first configuration information; wherein the first configuration information and the number of the multiple physical random access channels sent are used together to determine the length of the first time window.
[0051] As an implementation method, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0052] As an implementation method, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0053] As an implementation method, the method includes: receiving second configuration information, the second configuration information including a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0054] As an implementation manner, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0055] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0056] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0057] As an implementation method, the method includes: receiving first information, where the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0058] As an implementation manner, any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
[0059] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0060] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0061] As an implementation manner, the method includes: receiving a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0062] As an implementation manner, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0063] As an implementation manner, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0064] As an implementation manner, the method includes: receiving a first transmission block within the first time window, the first transmission block is on a corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0065] In a fourth aspect, a method is provided in a second node used for wireless communication, comprising: receiving one or more of a plurality of random access preambles, a plurality of physical random access channel opportunities being used for sending the plurality of random access preambles, the plurality of physical random access channel opportunities corresponding to a plurality of physical random access channel transmissions respectively; sending a first control signaling within a first time window as a response to the plurality of physical random access channel transmissions; wherein the length of the first time window is related to the number of the plurality of physical random access channel transmissions.
[0066] As an implementation manner, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the multiple physical random access channel opportunities.
[0067] As an implementation manner, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0068] As an implementation method, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0069] As an implementation method, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0070] As an implementation manner, the method includes: sending first configuration information; wherein the first configuration information and the number of the multiple physical random access channels sent are used together to determine the length of the first time window.
[0071] As an implementation method, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0072] As an implementation method, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0073] As an implementation method, the method includes: sending second configuration information, the second configuration information including a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0074] As an implementation manner, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0075] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0076] As an implementation manner, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0077] As an implementation method, the method includes: sending first information, where the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0078] As an implementation manner, any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
[0079] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0080] As an implementation method, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0081] As an implementation manner, the method includes: sending a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0082] As an implementation manner, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0083] As an implementation manner, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0084] As an implementation manner, the method includes: sending a first transmission block within the first time window, the first transmission block is on a corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0085] In a fifth aspect, a first node used for wireless communication is provided, comprising a transceiver, a memory and a processor, wherein the memory is used to store programs, the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the first node executes the method described in any implementation method of the third aspect.
[0086] In the sixth aspect, a second node used for wireless communication is provided, comprising a transceiver, a memory and a processor, wherein the memory is used to store programs, the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the second node executes the method described in any implementation method of the fourth aspect.
[0087] In a seventh aspect, an embodiment of the present application provides a communication system, which includes the first node and / or the second node described above. In another possible design, the system may also include other devices that interact with the first node or the second node in the solution provided in the embodiment of the present application.
[0088] In an eighth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program enables a computer to execute part or all of the steps in the methods of the above aspects.
[0089] In a ninth aspect, an embodiment of the present application provides a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute some or all of the steps in the above-mentioned various aspects of the method. In some implementations, the computer program product can be a software installation package.
[0090] In the tenth aspect, an embodiment of the present application provides a chip, which includes a memory and a processor. The processor can call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.
[0091] The embodiment of the present application can determine the length of the first time window according to the number of multiple PRACH transmissions to meet the configuration requirements of the time windows of multiple PRACH transmissions with different numbers of PRACHs.
[0092] The method and apparatus for a node used for wireless communication provided in the embodiments of the present application are conducive to improving the performance gain of multiple PRACH transmissions.
[0093] The method and device for a node used for wireless communication provided in the embodiments of the present application are conducive to increasing the coverage of the communication system.
[0094] The method and device for a node used for wireless communication provided by the embodiments of the present application are conducive to reducing random access delay.
[0095] The method and device for a node used for wireless communication provided in the embodiments of the present application are conducive to improving the utilization efficiency of random access resources. BRIEF DESCRIPTION OF THE DRAWINGS
[0096] Figure 1 The present invention is a diagram showing an example of a system architecture of a wireless communication system to which the embodiments of the present application can be applied.
[0097] Figure 2 An example of a configured short time window.
[0098] Figure 3 An example of a configured long time window.
[0099] Figure 4 A schematic flow chart of a method in a first node used for wireless communication provided in an embodiment of the present application.
[0100] Figure 5 A schematic flow chart of a method in a first node used for wireless communication provided in another embodiment of the present application.
[0101] Figure 6 A schematic flow chart of a method in a first node used for wireless communication provided in yet another embodiment of the present application.
[0102] Figure 7 A schematic flow chart of a method in a first node used for wireless communication provided in yet another embodiment of the present application.
[0103] Figure 8 A schematic flow chart of a method in a first node used for wireless communication provided in yet another embodiment of the present application.
[0104] Fig. 9 This is an example diagram of the configuration of the first time window provided in one embodiment of the present application.
[0105] Fig.10 An example diagram of the configuration of the first time window provided in another embodiment of the present application.
[0106] Fig.11An example diagram of the configuration of the first time window provided in yet another embodiment of the present application.
[0107] Fig.12 A schematic flow chart of a method in a second node used for wireless communication provided in an embodiment of the present application.
[0108] Fig.13 A schematic diagram of the structure of a node used for wireless communication provided in one embodiment of the present application.
[0109] Fig.14 A schematic diagram of the structure of a node used for wireless communication provided in another embodiment of the present application.
[0110] Fig.15 A schematic structural diagram of a device provided in an embodiment of the present application.
[0111] Fig.16 A schematic diagram of the hardware modules of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0112] Communication system architecture
[0113] Figure 1 1 is a diagram showing an example of a 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 device 120. The network device 110 may be a device that communicates with the user device 120. The network device 110 may provide communication coverage for a specific geographic area, and may communicate with the user device 120 located in the coverage area.
[0114] Figure 1 One network device and two user devices are shown exemplarily. Optionally, the wireless communication system 100 may include multiple network devices and each network device may include another number of user devices within its coverage area, which is not limited in the embodiments of the present application.
[0115] Optionally, the wireless communication system 100 may also include other network entities such as a network controller and a mobility management entity, which is not limited in the embodiments of the present application.
[0116] It should be understood that although the technical solution of the embodiment of the present application can be used for random access, the technical solution of the embodiment of the present application can also be used for beam failure recovery. Further, the technical solution of the embodiment of the present application can be used for random access procedure type-1 (Type-1 random access procedure), and the technical solution of the embodiment of the present application can also be used for random access procedure type-2 (Type-2 random access procedure). Further, the technical solution of the embodiment of the present application can be used with the Uu interface, and the technical solution of the embodiment of the present application can also be used with the PC5 interface. Further, the technical solution of the embodiment of the present application can be used for single-carrier communication, and the technical solution of the embodiment of the present application can also be used for multi-carrier communication. Further, the technical solution of the embodiment of the present application can be used for multi-antenna communication, and the technical solution of the embodiment of the present application can also be used for single-antenna communication. Further, the technical solution of the embodiment of the present application can be used in the scenario of user equipment and base station, but the technical solution of the embodiment of the present application is also applicable to the vehicle-to-everything (V2X) scenario, the user equipment and the relay, and the communication scenario between the relay and the base station, to achieve similar technical effects in the scenario of user equipment and base station. Furthermore, the technical solutions of the embodiments of the present application can be applied to various communication scenarios, such as: Enhanced Mobile Broadband (eMBB) scenario, Ultra Reliable & Low Latency Communication (URLLC) scenario, Massive Machine Type Communication (mMTC) scenario, etc. In addition, the use of a unified solution for different scenarios can also help reduce hardware complexity and cost.
[0117] It should be understood that, in the absence of conflict, the embodiments and features in the embodiments in the first node of the present application can be applied to the second node, and vice versa. In the absence of conflict, the embodiments and features in the embodiments of the present application can be arbitrarily combined with each other.
[0118] It should be understood that the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: the fifth generation (5th generation, 5G) system or new radio (new radio, NR), long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex (time division duplex, TDD), etc. The technical solutions provided by the present application can also be applied to future communication systems, such as the sixth generation mobile communication system, satellite communication system, and so on.
[0119] The user equipment in the embodiments of the present application may also be referred to as terminal 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. The user equipment in the embodiments of the present application may refer to a device that provides voice and / or data connectivity to a user, and may be used to connect people, objects and machines, such as a handheld device with a wireless connection function, a vehicle-mounted device, etc. The user equipment in the embodiments of the present application can be a mobile phone, a tablet computer, a laptop computer, a PDA, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. Optionally, the UE can be used to act as a base station. For example, the UE can act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc. For example, a cellular phone and a car communicate with each other using a sidelink signal. Cellular phones and smart home devices communicate without relaying communication signals through a base station.
[0120] The network device in the embodiment of the present application may be a device for communicating with a user device, and the network device may also be referred to as an access network device or a radio access network device, such as a base station. The network device in the embodiment of the present application may refer to a radio access network (RAN) node (or device) that connects a user device to a wireless network. Base station can broadly cover various names as follows, or replace with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmission point (TRP), transmission point (TP), master station MeNB, auxiliary 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), positioning node, etc. The base station can be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof. The base station can also refer to a communication module, a modem or a chip used to be arranged in the aforementioned device or apparatus. The base station can also be a mobile switching center and a device that performs the base station function in device-to-device D2D, V2X, machine-to-machine (M2M) communications, a network-side device in a 6G network, and a device that performs the base station function in a future communication system. The base station can support networks with the same or different access technologies. The embodiments of the present application do not limit the specific technology and specific device form used by the network device.
[0121] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.
[0122] In some deployments, the network device in the embodiments of the present application may refer to a CU or a DU, or the network device includes a CU and a DU. The gNB may also include an AAU.
[0123] The network equipment and user equipment can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on aircraft, balloons and satellites in the air. The embodiments of the present application do not limit the scenarios in which the network equipment and user equipment are located.
[0124] It should be understood that all or part of the functions of the communication device in the present application may also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (eg, a cloud platform).
[0125] Coverage enhancement for PRACH transmission
[0126] The coverage performance of a communication system (e.g., NR system) is an important factor that operators need to consider when commercializing communication networks. This is because the coverage performance of a communication system directly affects the service quality of the communication system and the operator's costs, such as the operator's capital expenditure (CAPEX) and the operator's operating expense (OPEX).
[0127] The coverage performance of a communication system will vary with the frequency band in which the communication system operates. For example, compared with the LTE system, the NR system operates at a higher frequency band (e.g., the millimeter wave frequency band), which results in a greater path loss in the NR system, and thus results in a relatively poorer coverage performance in the NR system. Therefore, as the frequency bands supported by the communication system may become higher and higher, how to enhance the coverage of the communication system becomes a problem that needs to be solved.
[0128] In most scenarios of actual deployment, the uplink coverage performance is the bottleneck for enhancing the coverage of the communication system because the capabilities of user equipment are weaker than those of network equipment. With the development of communication technology, the uplink services in some emerging vertical use cases are gradually increasing, such as video uploading services. In scenarios with more uplink services, how to enhance the uplink coverage is a problem that needs to be further solved.
[0129] In the related art, there are already technical solutions for coverage enhancement for some uplinks. For example, NR version 17 (Release 17, Rel-17) has designed coverage enhancement solutions for the physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH) and message 3 (Msg3) in the random access process.
[0130] However, Rel-17 did not design a coverage enhancement solution for PRACH, but the performance of PRACH transmission (PRACH transmission, or PRACH transmission, hereinafter referred to as PRACH transmission as an example, but the PRACH transmission mentioned in this application can be replaced by PRACH transmission) is very important for many processes such as initial access and beam failure recovery. Therefore, it is also very important to enhance the coverage of PRACH. Based on this, Rel-18 formally established the work item (WI) of "further NR coverage enhancements", among which enhancing the coverage performance of PRACH transmission is one of the important topics of this work item.
[0131] As a possible implementation method, multiple PRACH transmissions can be used to enhance the coverage of PRACH transmissions. That is to say, the coverage enhancement of PRACH transmissions can be achieved by repeated transmission of PRACH (for example, sending the preamble in PRACH multiple times). It should be noted that in the present application, multiple PRACH transmissions can also be replaced by terms such as multiple PRACH transmissions, multiple PRACH transmissions, and multiple PRACH transmissions, and the embodiments of the present application are not limited to this. That is to say, the multiple PRACH transmissions mentioned in the present application can be replaced by at least one of multiple PRACH transmissions, multiple PRACH transmissions, and multiple PRACH transmissions.
[0132] In the embodiment of the present application, multiple PRACH transmissions may refer to multiple PRACH transmissions using the same beam, or may refer to 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 reached an agreement: at least PRACH opportunities (or RACH opportunities) in different time periods (time instances, or time points, time instances, etc.) can be used for multiple PRACH transmissions using the same beam. In addition, the RAN1#110bis-e meeting further defines the number of multiple PRACH transmissions using the same beam (the number of multiple PRACH transmissions / repetition factor), which may include at least 2, 4, and 8.
[0133] Correlation mapping between synchronization signal blocks and PRACH opportunities
[0134] The synchronization signal block is a signal structure defined in the communication standard, which may include a primary synchronization signal (PSS), a secondary synchronization signal (SSS) and a physical broadcast channel (PBCH). In some embodiments, the synchronization signal block may be represented as an SSB (synchronization signal block). In some embodiments, the synchronization signal block may also be represented as an SS / PBCH block (synchronization signal / physical broadcast channel block), that is, the synchronization signal block may also be referred to as a synchronization signal broadcast channel block, which is not limited in the embodiments of the present application. It should be noted that the following text takes the synchronization signal block represented as an SSB as an example for introduction. Of course, the SSB in the following text may be replaced by the SS / PBCH block.
[0135] SSB is a set of resources transmitted on a basic orthogonal frequency division multiplexing grid, and the set of resources may include, for example, one or more of the following resources: time domain resources, frequency domain resources, code domain resources, etc.
[0136] During the initial access or beam failure recovery process of the user equipment, when the user equipment detects the SSB sent by the network device, it can obtain the SSB index of the SSB, so as to know the time domain position of the SSB, so as to achieve downlink synchronization with the network device. In order to achieve uplink synchronization, the user equipment needs to send a random access preamble (hereinafter referred to as the preamble for simplicity) to the network device. How the user equipment selects the preamble to be sent and at which PRACH timing the selected preamble should be sent are determined by the user equipment based on the received (or detected) SSB.
[0137] As a feasible technical solution, SSB can be associated and mapped with at least one preamble in at least one PRACH opportunity, so that when the user equipment performs initial access or beam failure recovery, it can determine the associated PRACH opportunity and preamble based on the received SSB, so that PRACH transmission can continue.
[0138] In some implementations, the association mapping relationship between SSB and PRACH opportunities can follow the following order: first, arrange in ascending order of the preamble index within each PRACH opportunity; second, arrange the frequency-division multiplexed PRACH opportunities in ascending order of the frequency domain resource index; third, arrange the time-division multiplexed PRACH opportunities within each PRACH time slot in ascending order of the time domain resource index; finally, arrange in ascending order of the PRACH time slot index.
[0139] Random access opportunity group
[0140] In some scenarios, a random access occasion group (PRACH occasion group, ROG) is introduced to indicate a set of multiple physical random access channel occasions (PRACH occasion, RO), so ROG can also be called "RO set". The embodiment of the present application does not limit the name of ROG. For the convenience of description, the embodiment of the present application is introduced based on ROG. The embodiment of the present application does not limit the name of the physical random access channel occasion. For example, the physical random access channel occasion can also be called a random access occasion. For the convenience of description, the embodiment of the present application is described based on the physical random access channel occasion. The physical random access channel occasion and the random access occasion mentioned in the embodiment of the present application can be replaced with each other.
[0141] As an embodiment, the ROG may include ROs corresponding to multiple PRACHs transmitted using the same beam.
[0142] As an embodiment, it is also discussed in some meetings (eg, 3GPP RAN1#110bis-e) that ROs in different time instances may be used for multiple PRACH transmissions using the same beam.
[0143] As an embodiment, for a specific number of PRACH transmissions, a ROG includes a valid RO, which helps the specific number of PRACHs to be transmitted through the valid RO.
[0144] As an embodiment, all ROs in a ROG may be associated with one SSB. Of course, in the embodiment of the present application, a ROG may be associated with multiple SSBs.
[0145] Random access response window (RAR window)
[0146] After the user equipment sends the random access preamble, the subsequent user equipment can monitor the RAR within the RAR window. If the user equipment does not monitor or receive the RAR within the RAR window, it means that the user equipment fails to access.
[0147] As an embodiment, the size and / or position of the RAR window is configured (determined) by the network side. That is, the network side can determine the length of the RAR window and / or the starting point of the RAR window. For example, the network side can configure the length of the RAR window and / or the starting point of the RAR window for the user equipment through high-layer signaling.
[0148] As an embodiment, the starting point of the RAR window may be located at the first multi-carrier symbol of the earliest control resource set (Control Resource Set, CORESET) that the user equipment is configured to receive, and this multi-carrier symbol is at least one multi-carrier symbol away from the last multi-carrier symbol of the corresponding RO. For example, in a single PRACH transmission scheme, the starting point of the RAR window may be located at the first multi-carrier symbol of the earliest CORESET that the user equipment is configured to receive.
[0149] As an embodiment, the length of the RAR window may be configured as a uniform value, that is, the length of the RAR window may be a uniformly configured value (such as X). In this case, any random access attempt (RACH attempt) may adopt the uniformly configured value.
[0150] As an embodiment, the length of the uniformly configured RAR window may be X times of the time slot.
[0151] As an example, it is being discussed in some meetings (e.g., 3GPP RAN1#112 meeting) that for multiple PRACH transmissions in one random access attempt, only one RAR window may be supported for RAR monitoring. That is, the network will not configure a separate RAR window for each of the multiple PRACH transmissions, or, in other words, multiple PRACH transmissions may share one RAR window.
[0152] As an embodiment, for multiple PRACH transmissions in one random access attempt, the starting point of the RAR window may be determined differently.
[0153] As an embodiment, in a scheme where multiple PRACHs are sent, the starting point of the RAR window may be after the last multi-carrier symbol of the last RO in the multiple PRACHs sent. In this case, the user equipment needs to wait until multiple PRACHs are sent before starting to perform RAR monitoring. Therefore, the scheme can obtain a combined detection gain of multiple PRACHs sent.
[0154] As an embodiment, the starting point of the RAR window may be after the last multi-carrier symbol of the first RO in the multiple PRACH transmissions. In this case, the user equipment does not need to wait until all PRACHs in the multiple PRACH transmissions are transmitted. When part of the multiple PRACH transmissions has been correctly received by the network side, the user equipment may terminate the multiple PRACH transmissions early to reduce the random access delay and avoid occupying additional PRACH resources, thereby reducing the probability of collision.
[0155] Currently, after the user equipment sends the random access preamble, the subsequent user equipment can monitor the control signaling (e.g., RAR) sent by the network side within a time window (e.g., RAR window). For multiple PRACH transmissions in a random access attempt, how to determine the length of the time window is a problem that needs to be solved.
[0156] As a possible implementation method, the length of the time window can be uniformly configured for multiple PRACH transmissions. However, the length of the uniformly configured time window may not meet the configuration requirements of multiple PRACH transmissions. For example, when a shorter time window length is uniformly configured, the detection performance of multiple PRACH transmissions with a large number of PRACHs may be affected. Alternatively, when a longer time window length is uniformly configured, a larger random access delay may be caused for multiple PRACH transmissions with a small number of PRACHs. The following is combined with Figure 2 and Figure 3 This is introduced in detail.
[0157] Figure 2 An example of a short time window for one configuration is shown. Figure 2 In the example, the length of the configured time window is short. In this case, for multiple PRACH transmissions with a large number of PRACHs, the deadline of the time window cannot cover the last RO, resulting in the user equipment stopping monitoring the control signaling before the user equipment sends a later PRACH transmission, for example, stopping monitoring Message 2 (Msg2), and failing to achieve the expected detection effect.
[0158] Figure 3 An example of a long time window for one configuration is shown. Figure 3 In the example of FIG. 5 , the length of the configured time window is relatively long. In this case, for multiple PRACH transmissions with a small number of PRACHs, the user equipment needs to wait until the time window expires before performing the next step, resulting in a large random access delay.
[0159] Alternatively, multiple PRACH transmissions with a large number of PRACHs are more likely to encounter invalid ROs. In order to meet the requirement on the number of valid ROs, the time span of multiple PRACH transmissions may be lengthened, thereby further lengthening the length of the uniformly configured time window.
[0160] Alternatively, the length of the uniformly configured time window may result in poor performance of multiple PRACH transmissions, making PRACH transmission a bottleneck in the coverage of a communication system (e.g., an NR system).
[0161] In summary, how to determine the length of the time window corresponding to multiple PRACH transmissions is a problem that needs to be solved.
[0162] In response to the above problems, the embodiments of the present application provide a method and apparatus in a node used for wireless communication, which can determine the length of the corresponding time window according to the number of PRACHs, thereby achieving one or more of the following purposes: meeting the configuration requirements of the time window for sending multiple PRACHs with different numbers of PRACHs; or, improving the performance gain of multiple PRACH transmissions; or, increasing the coverage of the communication system; or, reducing random access delay; or, improving the utilization efficiency of random access resources.
[0163] The present application can be applied to scenarios where multiple PRACHs are sent, that is, multiple PRACH repeated transmissions can be used to achieve PRACH coverage enhancement.
[0164] The present application may have a variety of application scenarios, for example, it may be applied to application scenarios in which the starting point of the time window is determined in various ways. As an embodiment, in the technical solution of the present application, the starting point of the time window (i.e., the first time window mentioned below) may be after the last multi-carrier symbol of the last RO in multiple PRACH transmissions. As an embodiment, in the technical solution of the present application, the starting point of the time window (i.e., the first time window mentioned below) may be after the last multi-carrier symbol of the first RO in multiple PRACH transmissions.
[0165] As an embodiment, the multiple PRACH transmissions mentioned in the present application may refer to multiple PRACH transmissions using the same beam, so as to obtain a signal-to-noise ratio (SNR) gain by repeatedly transmitting multiple PRACHs on the same beam.
[0166] As an embodiment, the multiple PRACH transmissions mentioned in the present application may refer to multiple PRACH transmissions using different beams, so as to obtain diversity gain by repeatedly transmitting multiple PRACHs on different beams.
[0167] The method and apparatus provided by the present application are illustrated below by multiple embodiments or examples. It should be understood that, in the absence of conflict, the embodiments in the first node of the present application and the features in the embodiments can be applied to the second node, and vice versa. In the absence of conflict, the embodiments of the present application and the features in the embodiments can be arbitrarily combined with each other.
[0168] Figure 4 A flowchart of a method in a node used for wireless communication provided in one embodiment of the present application. Figure 4 The method shown may be performed by a first node. The first node may be any type of node in a communication system that is capable of sending a random access preamble.
[0169] As an embodiment, the first node may be a user equipment, for example, Figure 1 A user device 120 is shown.
[0170] As an embodiment, the first node may be a network-controlled repeater (NCR).
[0171] As an embodiment, the first node may be a relay, such as a relay terminal.
[0172] As an embodiment, the first node includes a first transmitter and a first receiver.
[0173] See also Figure 4 , Figure 4 The method shown may include step S410 and step S420, which are described below.
[0174] In step S410, a plurality of random access preambles are sent.
[0175] As an embodiment, the multiple random access preambles are sent on multiple PRACHs respectively.
[0176] As an embodiment, multiple PRACH opportunities are used to send the multiple random access preambles. In other words, the multiple random access preambles are sent on the multiple PRACH opportunities respectively.
[0177] As an embodiment, the multiple random access preambles are respectively sent on the multiple PRACH occasions on the multiple PRACHs.
[0178] In the present application, the multiple PRACH opportunities correspond to multiple PRACH transmissions (multiple PRACH transmissions) respectively. In other words, in the present application, the multiple random access preambles correspond to multiple PRACH transmissions respectively.
[0179] It should be noted that, in the present application, the multiple PRACH opportunities respectively corresponding to multiple PRACH transmissions may include or be replaced by at least one of the following: the multiple random access preambles respectively correspond to multiple PRACH transmissions; the multiple PRACH opportunities are respectively used for the multiple PRACH transmissions; the multiple random access preambles are respectively used for the multiple PRACH transmissions; the multiple PRACHs respectively correspond to the multiple PRACH transmissions; the multiple PRACHs are respectively used for the multiple PRACH transmissions; the multiple PRACHs include the multiple random access preambles; the multiple PRACH transmissions include sending the multiple random access preambles; and the multiple PRACH transmissions include sending the multiple random access preambles respectively on the multiple PRACHs.
[0180] As an embodiment, the multiple random access preambles are sent by the first node through the first transmitter.
[0181] As an embodiment, the multiple random access preambles are sent by the first node to the second node. The second node may be a network device. Of course, the embodiment of the present application is not limited thereto. For example, the multiple random access preambles may be sent by other nodes other than the second node.
[0182] As an embodiment, the multiple PRACH transmissions correspond to one random access attempt (PRACHattempt).
[0183] As an embodiment, the multiple PRACH transmissions are used for one random access attempt.
[0184] As an embodiment, the multiple PRACH transmissions include respectively transmitting the multiple random access preambles on the one random access attempt.
[0185] In step S420, first control signaling is monitored within a first time window in response to the plurality of PRACH transmissions.
[0186] As an embodiment, the first control signaling is monitored by a first receiver of the first node.
[0187] As an embodiment, the length of the first time window is related to the number of the multiple PRACH transmissions.
[0188] As an embodiment, the length of the first time window is related to the number of the multiple PRACH transmissions and may include or be replaced by: the number of the multiple PRACH transmissions is used to determine the length of the first time window.
[0189] As an embodiment, the number of the multiple PRACH transmissions refers to the number of PRACH transmissions among the multiple PRACH transmissions.
[0190] As an embodiment, the number of the multiple PRACHs sent is equal to the number of the multiple PRACHs. In other words, the length of the first time window is related to the number of the multiple PRACHs, or the number of the multiple PRACHs is used to determine the length of the first time window.
[0191] As an embodiment, the number of the multiple PRACHs sent is equal to the number of the multiple random access preambles. In other words, the length of the first time window is related to the number of the multiple random access preambles, or the number of the multiple random access preambles is used to determine the length of the first time window.
[0192] As an embodiment, the number of the multiple PRACHs sent is equal to the number of random access preambles in the multiple random access preambles respectively sent on the multiple PRACHs. In other words, the length of the first time window is related to the number of random access preambles in the multiple random access preambles respectively sent on the multiple PRACHs, or in other words, the number of random access preambles in the multiple random access preambles respectively sent on the multiple PRACHs is used to determine the length of the first time window.
[0193] The embodiment of the present application can determine the length of the first time window according to the number of multiple PRACH transmissions to meet the configuration requirements of the time windows of multiple PRACH transmissions with different numbers of PRACHs; or, improve the performance gain of multiple PRACH transmissions; or, increase the coverage of the communication system; or, reduce the random access delay; or, improve the utilization efficiency of random access resources.
[0194] As an embodiment, the length of the first time window is determined by the first node according to the length of the candidate time window configured by the network side and the number of the multiple PRACH transmissions. How the first node determines the length of the first time window will be described in detail later and will not be described here.
[0195] As an embodiment, within the first time window, the user equipment may send a random access preamble to request access to the network, and the network side may reply with a response before the end of the first time window, so that the user equipment can establish a connection with the network side. This random access mechanism can help reduce network congestion and collisions and improve network efficiency and reliability.
[0196] The embodiment of the present application does not limit the time domain unit of the first time window. As an embodiment, the time domain unit of the first time window may be a time slot. As an embodiment, the time domain unit of the first time window may be a multi-carrier symbol.
[0197] In other words, the embodiment of the present application does not limit the granularity (or granularity) of the first time window. As an embodiment, the granularity of the first time window is a time slot. As an embodiment, the granularity of the first time window is a multi-carrier symbol.
[0198] The embodiments of the present application do not specifically limit the representation method of the length of the first time window. As an embodiment, the length of the first time window can be represented by a time slot. As an embodiment, the length of the first time window can be represented by a multi-carrier symbol. As an embodiment, the length of the first time window can be represented by a subframe. As an embodiment, the length of the first time window can be represented by milliseconds. As an embodiment, the length of the first time window can be represented by seconds. It should be noted that the representation methods mentioned above are only examples, and the length of the first time window can also be represented by other methods not listed.
[0199] The embodiment of the present application does not specifically limit the length of the first time window. The length of the first time window is described below using time slots or milliseconds as examples.
[0200] As an embodiment, the length of the first time window includes at least one time slot, for example, 5 time slots, 10 time slots, etc. In other words, the length of the first time window includes multiple time slots, for example, two or more time slots.
[0201] As an embodiment, the length of the first time window is less than or equal to 10 milliseconds.
[0202] As an embodiment, the length of the first time window is less than or equal to 40 milliseconds.
[0203] Of course, the length of the first time window may also be other values, which is not limited in the embodiment of the present application.
[0204] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last random access opportunity in the multiple PRACH transmissions.
[0205] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last PRACH opportunity among the multiple PRACH opportunities.
[0206] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last random access opportunity among the multiple random access opportunities included in the first random access opportunity group, wherein the multiple random access opportunities included in the first random access opportunity group correspond to the multiple PRACH transmissions respectively. For a detailed introduction to the first random access opportunity group, please refer to the description below.
[0207] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first random access opportunity in the multiple PRACH transmissions.
[0208] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first PRACH opportunity among the multiple PRACH opportunities.
[0209] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first random access opportunity among the multiple random access opportunities included in the first random access opportunity group, wherein the multiple random access opportunities included in the first random access opportunity group respectively correspond to the multiple PRACH transmissions.
[0210] As an embodiment, the first time window is a random access response window (RAR window).
[0211] As an embodiment, the first time window is used to receive a random access response (RAR).
[0212] As an embodiment, the first time window being used to receive a random access response may include or be replaced by: monitoring the random access response within the first time window.
[0213] As an embodiment, the random access response includes the first control signaling. That is, the first time window can be used to receive the first control signaling in the random access response, or to monitor the first control signaling in the random access response within the first time window.
[0214] As an embodiment, the first time window is used to receive message 2 in the random access step.
[0215] As an embodiment, the first time window being used to receive the message 2 in the random access step may include or be replaced by: monitoring the message 2 within the first time window.
[0216] As an embodiment, the message 2 includes the first control signaling. That is, the first time window can be used to receive the first control signaling in the message 2, or to monitor the first control signaling in the message 2 within the first time window.
[0217] The embodiment of the present application does not limit the specific form of the first control signaling, and the first control signaling is introduced in detail below.
[0218] As an embodiment, the first control signaling is scrambled to ensure the security and reliability of data transmission. For example, the first control signaling is scrambled by the first RNTI. The first control signaling is scrambled by the first RNTI in detail later, and for the sake of brevity, it is not repeated here.
[0219] As an embodiment, the first control signaling is sent by a second node to the first node, wherein the second node may be a network device.
[0220] As an embodiment, the first control signaling includes downlink control information (DCI).
[0221] As an embodiment, the first control signaling is DCI.
[0222] As an embodiment, the first control signaling includes a DCI format (DCI format).
[0223] As an embodiment, the first control signaling includes a DCI format and a cyclic redundancy check (CRC).
[0224] As an embodiment, the first control signaling includes a DCI format and a CRC, and the CRC is scrambled by the first RNTI. The details of the first RNTI will be introduced in detail later and will not be described here.
[0225] As an embodiment, when the first control signaling includes DCI, the embodiment of the present application does not specifically limit the format of DCI. For example, the first control signaling may include DCI format 1_0. Alternatively, the first signaling may include other DCI formats, such as DCI format 2_0.
[0226] As an embodiment, the first control signaling includes DCI format 1_0 and CRC.
[0227] As an embodiment, the first control signaling includes DCI format 1_0 and CRC, and the CRC is scrambled by the first RNTI.
[0228] It should be noted that the first control signaling may include other signaling besides DCI, which is not limited in this embodiment of the present application.
[0229] As an embodiment, the first control signaling includes high-layer signaling, or the first control signaling includes higher-layer signaling.
[0230] The embodiments of the present application do not limit high-layer signaling or higher-layer signaling. As an embodiment, the first control signaling includes radio resource control (RRC) layer signaling. As an embodiment, the first control signaling includes medium access control (MAC) layer signaling.
[0231] The above describes the case where multiple PRACH transmissions correspond to multiple random access preambles. The following describes the case where multiple PRACH transmissions correspond to multiple random access opportunities.
[0232] As an embodiment, the first random access opportunity group includes multiple random access opportunities, and the multiple random access opportunities correspond to the multiple PRACH transmissions respectively.
[0233] As an embodiment, the multiple random access opportunities included in the first random access opportunity group are respectively used for the multiple PRACH transmissions.
[0234] As an embodiment, the first random access opportunity group includes multiple random access opportunities used for one random access attempt.
[0235] As an embodiment, the multiple random access opportunities included in the first random access opportunity group are respectively used to send the multiple random access preambles.
[0236] As an embodiment, the number of the multiple random access opportunities included in the first random access opportunity group may be one of 2, 4, and 8. Of course, in the embodiment of the present application, the number of the multiple random access opportunities included in the first random access opportunity group may also be other numbers, which is not limited in the embodiment of the present application.
[0237] As an embodiment, the multiple random access opportunities included in the first random access opportunity group respectively include the multiple PRACHs.
[0238] As an embodiment, the multiple PRACHs are respectively on the multiple random access opportunities included in the first random access opportunity group.
[0239] As an embodiment, the number of the multiple PRACHs sent is equal to the number of the multiple random access opportunities included in the first random access opportunity group.
[0240] It should be noted that in the present application, the number of multiple random access opportunities included in the first random access opportunity group may include or be replaced by at least one of the following: the number of multiple random access preambles sent in the first random access opportunity group; the number of PRACH transmissions among the multiple PRACH transmissions performed based on the first random access opportunity group.
[0241] It should be noted that, in the present application, the multiple random access occasions may include or be replaced by at least one of the following: multiple PRACH occasions, multiple RACH occasions, and multiple PRACH transmission occasions.
[0242] As an embodiment, the multiple random access opportunities included in the first random access opportunity group are time-division multiplexing (TDM).
[0243] As an embodiment, at least two random access opportunities among the multiple random access opportunities included in the first random access opportunity group have different starting positions in the frequency domain.
[0244] As an embodiment, any two random access opportunities among the multiple random access opportunities included in the first random access opportunity group have the same starting position in the frequency domain.
[0245] The embodiment of the present application does not limit the frequency domain unit of any two random access opportunities in the multiple random access opportunities included in the first random access opportunity group in the frequency domain. As an embodiment, the frequency domain unit of any two random access opportunities in the frequency domain may be a resource block (RB). As an embodiment, the frequency domain unit of any two random access opportunities in the frequency domain may be a resource element (RE).
[0246] As an embodiment, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies one RB in the frequency domain. Of course, in the embodiment of the present application, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies one RB in the frequency domain, and the embodiment of the present application does not limit this.
[0247] As an embodiment, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies multiple RBs in the frequency domain. Of course, in the embodiment of the present application, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies multiple RBs in the frequency domain, and the embodiment of the present application does not limit this.
[0248] As an embodiment, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group includes at least one multi-carrier symbol in the time domain, and / or any random access opportunity includes at least one RB in the frequency domain.
[0249] As an embodiment, a random access opportunity among the multiple random access opportunities included in the first random access opportunity group includes at least one multi-carrier symbol in the time domain, and / or the random access opportunity includes at least one RB in the frequency domain. Of course, in the embodiment of the present application, the granularity of the time-frequency resources occupied by the random access opportunity is not limited.
[0250] As an embodiment, the multiple random access opportunities included in the first random access opportunity group belong to multiple PRACH time slots. For example, each random access opportunity among the multiple random access opportunities included in the first random access opportunity group belongs to one PRACH time slot among multiple PRACH time slots. For another example, some random access opportunities among the multiple random access opportunities included in the first random access opportunity group belong to one PRACH time slot among multiple PRACH time slots.
[0251] As an embodiment, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies multiple multi-carrier symbols in the time domain. Of course, in the embodiment of the present application, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies multiple multi-carrier symbols in the time domain.
[0252] As an embodiment, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies multiple uplink symbols in the time domain. Of course, in the embodiment of the present application, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group occupies multiple uplink symbols in the time domain.
[0253] As an embodiment, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group belongs to a PRACH time slot in the time domain. Of course, in the embodiment of the present application, any random access opportunity among the multiple random access opportunities included in the first random access opportunity group belongs to a PRACH time slot in the time domain, and the embodiment of the present application does not limit this.
[0254] As an embodiment, all random access opportunities in the multiple random access opportunities included in the first random access opportunity group belong to one PRACH time slot in the time domain. Of course, in the embodiment 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 time slot in the time domain, and the embodiment of the present application does not limit this.
[0255] As mentioned above, the first control signaling may be scrambled by the first RNTI, which is described in detail below.
[0256] As an embodiment, the first RNTI is associated with the multiple PRACH opportunities.
[0257] As an embodiment, the first RNTI is the RNTI corresponding to the multiple PRACH opportunities.
[0258] As an embodiment, the CRC of the first control signaling is scrambled by the first RNTI.
[0259] The implementation of the first RNTI in the embodiment of the present application is not specifically limited, as long as the first RNTI can be used to uniquely identify a user device to prevent malicious attackers from interfering with network communications by counterfeiting the RNTI identifier. That is, in the present application, the first RNTI corresponding to each user device is different in order to distinguish different user devices. The first RNTI is exemplarily introduced below.
[0260] As an embodiment, the first RNTI is an RNTI.
[0261] As an embodiment, the first RNTI includes a random access-RNTI (RA-RNTI). In other words, the first RNTI includes a four-step random access RNTI.
[0262] As an embodiment, the first RNTI includes a message B-RNTI (message B-RNTI, MsgB-RNTI). In other words, the first RNTI includes a two-step random access RNTI.
[0263] As an embodiment, the first RNTI is associated with the multiple PRACH transmissions.
[0264] As an embodiment, the first RNTI is associated with the first random access opportunity group.
[0265] As an embodiment, the first RNTI is associated with a random access opportunity among multiple random access opportunities included in the first random access opportunity group. For example, the first RNTI may be associated with any random access opportunity among multiple random access opportunities included in the first random access opportunity group.
[0266] As an embodiment, the first RNTI is associated with a first random access opportunity among multiple random access opportunities included in the first random access opportunity group.
[0267] As an embodiment, the first RNTI is associated with the last random access opportunity among multiple random access opportunities included in the first random access opportunity group.
[0268] As an embodiment, the first RNTI is associated with the first random access opportunity in the time domain among multiple random access opportunities included in the first random access opportunity group.
[0269] As an embodiment, the first RNTI is associated with the last random access opportunity in the time domain among multiple random access opportunities included in the first random access opportunity group.
[0270] As an embodiment, the first RNTI is associated with a reference random access opportunity. The reference random access opportunity is exemplarily introduced below.
[0271] As an embodiment, the reference random access opportunity is a random access opportunity among multiple random access opportunities included in the first random access opportunity group. For example, the reference random access opportunity may be any random access opportunity among multiple random access opportunities included in the first random access opportunity group.
[0272] As an embodiment, the reference random access opportunity is the first random access opportunity in the time domain among multiple random access opportunities included in the first random access opportunity group.
[0273] As an embodiment, the reference random access opportunity is the last random access opportunity in the time domain among multiple random access opportunities included in the first random access opportunity group.
[0274] However, the present application is not limited thereto, and the reference random access opportunity may be a random access opportunity other than the multiple random access opportunities included in the first random access opportunity group. For example, the reference random access opportunity may be any random access opportunity other than the multiple random access opportunities included in the first random access opportunity group.
[0275] The following describes in detail the relationship between the length of the first time window and the number of multiple PRACH transmissions, and describes an exemplary method for determining the length of the first time window according to the number of multiple PRACH transmissions. First, the relationship between the length of the first time window and the number of multiple PRACH transmissions is described.
[0276] As an embodiment, the length of the first time window is linearly related to the number of the multiple PRACH transmissions. That is, the length of the first time window may change linearly with the number of the multiple PRACH transmissions.
[0277] As an embodiment, the length of the first time window increases or remains unchanged as the number of the multiple PRACH transmissions increases. For example, the length of the first time window may increase as the number of the multiple PRACH transmissions increases. Alternatively, the length of the first time window may remain unchanged as the number of the multiple PRACH transmissions increases.
[0278] In other words, the length of the first time window decreases or remains unchanged as the number of the multiple PRACH transmissions decreases. For example, the length of the first time window may decrease as the number of the multiple PRACH transmissions decreases. Alternatively, the length of the first time window may remain unchanged as the number of the multiple PRACH transmissions decreases.
[0279] As an embodiment, the length of the first time window is proportional to the number of the multiple PRACH transmissions. For example, when the length of the first time window increases as the number of the multiple PRACH transmissions increases, the length of the first time window increases in proportion to the number of the multiple PRACH transmissions. Or when the length of the first time window decreases as the number of the multiple PRACH transmissions decreases, the length of the first time window decreases in proportion to the number of the multiple PRACH transmissions.
[0280] As an embodiment, the length of the first time window is linearly related to the number of multiple random access opportunities included in the first random access opportunity group.
[0281] As an embodiment, the length of the first time window increases or remains unchanged as the number of multiple random access opportunities included in the first random access opportunity group increases.
[0282] As an embodiment, the length of the first time window increases as the number of multiple random access opportunities included in the first random access opportunity group increases.
[0283] As an embodiment, the length of the first time window remains unchanged as the number of multiple random access opportunities included in the first random access opportunity group increases.
[0284] As an embodiment, the length of the first time window decreases or remains unchanged as the number of multiple random access opportunities included in the first random access opportunity group decreases.
[0285] As an embodiment, the length of the first time window decreases as the number of multiple random access opportunities included in the first random access opportunity group decreases.
[0286] As an embodiment, the length of the first time window remains unchanged as the number of multiple random access opportunities included in the first random access opportunity group decreases.
[0287] As an embodiment, the length of the first time window is proportional to the number of multiple random access opportunities included in the first random access opportunity group. For example, when the length of the first time window increases with the increase of the number of multiple random access opportunities included in the first random access opportunity group, the length of the first time window increases in proportion to the number of multiple random access opportunities included in the first random access opportunity group. Or when the length of the first time window decreases with the decrease of the number of multiple random access opportunities included in the first random access opportunity group, the length of the first time window decreases in proportion to the number of multiple random access opportunities included in the first random access opportunity group.
[0288] In this way, in an embodiment of the present application, for multiple PRACH transmissions with a large number of PRACHs, the first node can select a longer first time window length, which is conducive to ensuring effective detection of multiple PRACHs; for multiple PRACH transmissions with a small number of PRACHs, the first node can select a shorter first time window length, which is conducive to reducing random access delay.
[0289] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group is equal to the number of the multiple PRACH transmissions.
[0290] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group is equal to the number of the multiple PRACHs.
[0291] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group is equal to the number of the multiple random access preambles.
[0292] It should be noted that, in an embodiment of the present application, the number of multiple random access opportunities included in the first random access opportunity group may include or be replaced by at least one of the following: the number of multiple PRACH transmissions, the number of multiple PRACHs, and the number of multiple random access preambles.
[0293] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group is used to determine the length of the first time window.
[0294] The following is an exemplary introduction on how to determine the length of the first time window according to the number of multiple PRACH transmissions.
[0295] Implementation 1:
[0296] As an embodiment, the length of the first time window is one of multiple candidate time lengths, the number of PRACH transmissions is one of multiple candidate numbers, and the number of PRACH transmissions is used to determine the length of the first time window from the multiple candidate time lengths.
[0297] As an embodiment, the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers.
[0298] As an embodiment, one of the multiple candidate time lengths corresponds to one or more candidate numbers of the multiple candidate numbers. For example, one of the multiple candidate time lengths corresponds to at least two candidate numbers of the multiple candidate numbers. In other words, one of the multiple candidate time lengths is shared by one or more candidate numbers of the multiple candidate numbers.
[0299] As an embodiment, the length of the first time window is one of multiple candidate time lengths, and the number of the multiple PRACH transmissions is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers; or, one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers.
[0300] As an embodiment, the number of the multiple PRACH transmissions is used to determine the length of the first time window from the multiple candidate time lengths.
[0301] As an embodiment, the length of the first time window is one of multiple candidate time lengths, and the number of multiple random access opportunities included in the first random access opportunity group is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers; or, one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number of multiple random access opportunities included in the first random access opportunity group is used to determine the length of the first time window from the multiple candidate time lengths.
[0302] As an embodiment, the length of the first time window is one of a plurality of candidate time lengths, and the number of the plurality of random access opportunities included in the first random access opportunity group is one of a plurality of candidate numbers, wherein the plurality of candidate time lengths correspond to the plurality of candidate numbers one-to-one; or, one of the plurality of candidate time lengths corresponds to one or more candidate numbers of the plurality of candidate numbers. In other words, one of the plurality of candidate time lengths is shared by one or more candidate numbers of the plurality of candidate numbers.
[0303] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group is used to determine the length of the first time window from the multiple candidate time lengths.
[0304] The embodiment of the present application does not specifically limit the number of the multiple candidate time lengths. For example, the multiple candidate time lengths may be two candidate time lengths, or may be three or more than three candidate time lengths.
[0305] As an embodiment, the multiple candidate time lengths include a first time length and a second time length, and the first time length and the second time length are different.
[0306] As a sub-embodiment of the above embodiment, the first time length includes at least one time slot.
[0307] As a sub-embodiment of the above embodiment, the second time length includes at least one time slot.
[0308] However, the embodiment of the present application is not limited thereto, and the granularity of the first time length and / or the second time length may be in other forms, such as milliseconds, multi-carrier symbols, etc. For example, the first time length includes at least 1 millisecond, the second time length includes at least 1 millisecond, the first time length includes at least 14 multi-carrier symbols, the second time length includes at least 14 multi-carrier symbols, and so on.
[0309] As a sub-embodiment of the above embodiment, the first time length is shorter than the second time length.
[0310] As a sub-embodiment of the above embodiment, the first time length is greater than the second time length.
[0311] As a sub-embodiment of the above embodiment, the second time length is a multiple of the first time length. For example, the multiple may be an integer multiple, such as 2 times, 3 times, etc. For another example, the multiple may be a multiple greater than 1, such as 2 times, 2.5 times, etc. For another example, the multiple may be a multiple greater than 0 and less than 1, such as 0.5 times, 0.8 times, etc.
[0312] As a sub-embodiment of the above embodiment, the second time length is the sum of the first time length and at least one time slot.
[0313] As a sub-embodiment of the above embodiment, the first time length includes 1 time slot.
[0314] As a sub-embodiment of the above embodiment, the second time length includes 2 time slots.
[0315] As a sub-embodiment of the above embodiment, the first time length includes 10 time slots, and the second time length includes 15 time slots.
[0316] As a sub-embodiment of the above embodiment, when the number of the multiple PRACHs sent is 2, the length of the first time window is the first time length; when the number of the multiple PRACHs sent is 4, the length of the first time window is the second time length.
[0317] As a sub-embodiment of the above embodiment, when the first random access opportunity group includes 2 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 4 random access opportunities, the length of the first time window is the second time length.
[0318] As a sub-embodiment of the above embodiment, when the number of the multiple PRACHs sent is 2, the length of the first time window is the first time length; when the number of the multiple PRACHs sent is 8, the length of the first time window is the second time length.
[0319] As a sub-embodiment of the above embodiment, when the first random access opportunity group includes 2 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 8 random access opportunities, the length of the first time window is the second time length.
[0320] As a sub-embodiment of the above embodiment, when the number of the multiple PRACHs sent is 4, the length of the first time window is the first time length; when the number of the multiple PRACHs sent is 8, the length of the first time window is the second time length.
[0321] As a sub-embodiment of the above embodiment, when the first random access opportunity group includes 4 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 8 random access opportunities, the length of the first time window is the second time length.
[0322] As a sub-embodiment of the above embodiment, when the number of the multiple PRACH transmissions is 2, the length of the first time window is the first time length; when the number of the multiple PRACH transmissions is 4, the length of the first time window is the first time length; when the number of the multiple PRACH transmissions is 8, the length of the first time window is the second time length.
[0323] As a sub-embodiment of the above embodiment, when the first random access opportunity group includes 2 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 4 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 8 random access opportunities, the length of the first time window is the second time length.
[0324] As a sub-embodiment of the above embodiment, when the number of the multiple PRACH transmissions is 2, the length of the first time window is the first time length; when the number of the multiple PRACH transmissions is 4, the length of the first time window is the second time length; when the number of the multiple PRACH transmissions is 8, the length of the first time window is the second time length.
[0325] As a sub-embodiment of the above embodiment, when the first random access opportunity group includes 2 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 4 random access opportunities, the length of the first time window is the second time length; when the first random access opportunity group includes 8 random access opportunities, the length of the first time window is the second time length.
[0326] As an embodiment, the multiple candidate time lengths include a first time length, a second time length and a third time length, and the first time length, the second time length and the third time length are different from each other.
[0327] As a sub-embodiment of the above embodiment, when the number of the multiple PRACH transmissions is 2, the length of the first time window is the first time length; when the number of the multiple PRACH transmissions is 4, the length of the first time window is the second time length; when the number of the multiple PRACH transmissions is 8, the length of the first time window is the third time length.
[0328] As a sub-embodiment of the above embodiment, when the first random access opportunity group includes 2 random access opportunities, the length of the first time window is the first time length; when the first random access opportunity group includes 4 random access opportunities, the length of the first time window is the second time length; when the first random access opportunity group includes 8 random access opportunities, the length of the first time window is the third time length.
[0329] Implementation 2:
[0330] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, any of the multiple candidate time length groups includes at least one time length, the number of the multiple PRACH transmissions is one of multiple candidate numbers, and the number of the multiple PRACH transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0331] As an embodiment, the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers.
[0332] As an embodiment, one of the plurality of candidate time length groups corresponds to one or more candidate numbers of the plurality of candidate numbers. For example, one of the plurality of candidate time length groups corresponds to at least two candidate numbers of the plurality of candidate numbers. In other words, one of the plurality of candidate time length groups is shared by one or more candidate numbers of the plurality of candidate numbers.
[0333] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, any one of the multiple candidate time length groups includes at least one time length, and the number of the multiple PRACH transmissions is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers; or, one of the multiple candidate time length groups corresponds to one or more candidate numbers of the multiple candidate numbers.
[0334] As an embodiment, the number of the multiple PRACH transmissions is used to determine the length of the first time window from the multiple candidate time length groups.
[0335] As an embodiment, after the number of PRACH transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups, if the candidate time length group to which the first time window belongs determined according to the number of PRACH transmissions includes only one time length, the length of the first time window may be the one time length included in the candidate time length group to which the first time window belongs. If the candidate time length group to which the first time window belongs determined according to the number of PRACH transmissions includes multiple time lengths, as an implementation method, the length of the first time window may be further determined from the multiple time lengths included in the candidate time length group to which the first time window belongs according to the number of PRACH transmissions. For the method of further determining the length of the first time window from the multiple time lengths included in the candidate time length group to which the first time window belongs according to the number of PRACH transmissions, refer to the above implementation method 1, which will not be repeated here.
[0336] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, any of the multiple candidate time length groups includes at least one time length, the number of multiple random access opportunities included in the first random access timing group is one of multiple candidate numbers, and the number of multiple random access opportunities included in the first random access timing group is used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0337] As an embodiment, the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers.
[0338] As an embodiment, one of the plurality of candidate time length groups corresponds to one or more candidate numbers of the plurality of candidate numbers. For example, one of the plurality of candidate time length groups corresponds to at least two candidate numbers of the plurality of candidate numbers. In other words, one of the plurality of candidate time length groups is shared by one or more candidate numbers of the plurality of candidate numbers.
[0339] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, any candidate time length group among the multiple candidate time length groups includes at least one time length, and the number of multiple random access opportunities included in the first random access time group is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers; or, one of the multiple candidate time length groups corresponds to one or more candidate numbers among the multiple candidate numbers.
[0340] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group is used to determine the length of the first time window from the multiple candidate time length groups.
[0341] As an embodiment, after the number of multiple random access opportunities included in the first random access opportunity group is used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups, if the candidate time length group to which the first time window belongs determined according to the number of multiple random access opportunities included in the first random access opportunity group includes only one time length, the length of the first time window may be the one time length included in the candidate time length group to which the first time window belongs. If the candidate time length group to which the first time window belongs determined according to the number of multiple random access opportunities included in the first random access opportunity group includes multiple time lengths, as an implementation method, the length of the first time window may be further determined from the multiple time lengths included in the candidate time length group to which the first time window belongs according to the number of multiple random access opportunities included in the first random access opportunity group. For the method of further determining the length of the first time window from the multiple time lengths included in the candidate time length group to which the first time window belongs according to the number of multiple random access opportunities included in the first random access opportunity group, reference may be made to the above implementation method 1, which will not be repeated here.
[0342] Implementation 3:
[0343] As an embodiment, the first node can only receive one candidate time length. In this case, the length of the first time window is determined based on the one candidate time length and the first coefficient.
[0344] As an embodiment, the first coefficient is related to the number of the multiple PRACHs sent.
[0345] As an embodiment, the first coefficient is related to the number of multiple random access opportunities included in the first random access opportunity group.
[0346] As an embodiment, the first coefficient is determined according to the number of the multiple PRACHs sent.
[0347] As an embodiment, the first coefficient is determined according to the number of multiple random access opportunities included in the first random access opportunity group.
[0348] As an embodiment, the first coefficient is linearly related to the number of the multiple PRACH transmissions.
[0349] As an embodiment, the first coefficient is linearly related to the number of multiple random access opportunities included in the first random access opportunity group.
[0350] As an embodiment, the first coefficient increases or remains unchanged as the number of the multiple PRACH transmissions increases.
[0351] As an embodiment, the first coefficient increases or remains unchanged as the number of multiple random access opportunities included in the first random access opportunity group increases.
[0352] As an embodiment, the first coefficient increases as the number of the multiple PRACH transmissions increases.
[0353] As an embodiment, the first coefficient increases as the number of multiple random access opportunities included in the first random access opportunity group increases.
[0354] As an embodiment, the first coefficient is proportional to the number of the multiple PRACHs sent.
[0355] As an embodiment, the first coefficient is proportional to the number of multiple random access opportunities included in the first random access opportunity group.
[0356] As an embodiment, the first coefficient is equal to the number of the multiple PRACH transmissions.
[0357] As an embodiment, the first coefficient is equal to the number of multiple random access opportunities included in the first random access opportunity group.
[0358] As an embodiment, the first coefficient is equal to the number of PRACHs in the multiple PRACH transmissions.
[0359] As an embodiment, the first coefficient is a positive integer. However, the embodiment of the present application is not limited thereto, and the first coefficient can be any value, such as a value greater than 0 and less than 1, or a non-integer greater than 1.
[0360] As an embodiment, the first coefficient includes at least one time slot. However, the embodiment of the present application is not limited thereto, and the first coefficient may include at least one multi-carrier symbol, at least 1 millisecond, and the like.
[0361] As an embodiment, the first coefficient is a fixed value. However, the embodiment of the present application is not limited thereto, and in some embodiments, the first coefficient may also be a variable value.
[0362] As an embodiment, the first coefficient is configured by higher layer signaling. For example, the first coefficient is configured by RRC layer signaling, or the first coefficient is configured by MAC layer signaling. In other words, the first coefficient is carried in RRC signaling, or the first coefficient is carried in MAC CE signaling.
[0363] As an embodiment, the length of the first time window is equal to the sum of the one candidate time length and the first coefficient.
[0364] As an embodiment, the length of the first time window is equal to the sum of the one candidate time length and the first coefficient time slots.
[0365] As an embodiment, the length of the first time window is equal to the product of the candidate time length and the first coefficient.
[0366] As mentioned above, the length of the first time window may be determined from a plurality of candidate time lengths, or may be determined based on one candidate time length. The configuration of the plurality of candidate time lengths and / or one candidate time length is introduced below.
[0367] Figure 5 It is a flowchart of a method in a node used for wireless communication provided by another embodiment of the present application. Figure 5 The method shown may be performed by the first node. Figure 5 The illustrated method may include step S510.
[0368] In step S510, first configuration information is received.
[0369] As an embodiment, the first configuration information may be received by a first receiver of the first node.
[0370] As an embodiment, the first configuration information may be sent by the second node. Of course, in the embodiment of the present application, the first configuration information may be sent by other nodes, and the embodiment of the present application does not limit this.
[0371] As an embodiment, the first configuration information may be configured by higher layer signaling or high layer signaling. In other words, the first configuration information may be carried in higher layer signaling or high layer signaling. For example, the first configuration information may be configured by RRC layer signaling. Alternatively, the first configuration information may be configured by MAC layer signaling.
[0372] As an embodiment, the first configuration information and the number of the multiple PRACH transmissions are used together to determine the length of the first time window.
[0373] As an embodiment, the first configuration information is used to configure a PRACH resource pool for multiple PRACH transmissions.
[0374] As an embodiment, the first configuration information includes at least two candidate time lengths (or, multiple candidate time lengths), and the number of the multiple PRACH transmissions is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0375] As an embodiment, the number of the multiple PRACH transmissions corresponds to one of a plurality of candidate time length groups, any one of the plurality of candidate time length groups includes at least one time length, and the first configuration information is used to determine the length of the first time window from a candidate time length group in the plurality of candidate time length groups corresponding to the number of the multiple PRACH transmissions.
[0376] As an embodiment, the first configuration information and the number of multiple random access opportunities included in the first random access opportunity group are used together to determine the length of the first time window.
[0377] As an embodiment, the first configuration information includes at least two candidate time lengths (or, multiple candidate time lengths), and the number of multiple random access opportunities included in the first random access opportunity group is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0378] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group corresponds to one of multiple candidate time length groups, any candidate time length group in the multiple candidate time length groups includes at least one time length, and the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of multiple random access opportunities included in the first random access opportunity group.
[0379] Figure 6 A flowchart of a method in a node used for wireless communication is provided in accordance with yet another embodiment of the present application. Figure 6 The method shown may be performed by the first node. Figure 6 The illustrated method may include step S610.
[0380] In step S610, second configuration information is received.
[0381] As an embodiment, the second configuration information may be received by the first receiver of the first node.
[0382] As an embodiment, the second configuration information may be sent by the second node. Of course, in the embodiment of the present application, the second configuration information may be sent by other nodes, which is not limited in the embodiment of the present application.
[0383] As an embodiment, the first configuration information may be configured by higher layer signaling or high layer signaling. In other words, the first configuration information may be carried in higher layer signaling or high layer signaling. For example, the first configuration information may be configured by RRC layer signaling. Alternatively, the first configuration information may be configured by MAC layer signaling.
[0384] As an embodiment, the second configuration information is used to configure a PRACH resource pool for multiple PRACH transmissions. As an embodiment, the PRACH resource pool refers to the PRACH opportunity or random access preamble mentioned above.
[0385] As an embodiment, the second configuration information includes a candidate time length.
[0386] As an embodiment, the length of the first time window is determined based on a candidate time length and a first coefficient included in the second configuration information.
[0387] As an embodiment, the length of the first time window is equal to the sum of a candidate time length included in the second configuration information and a first coefficient.
[0388] As an embodiment, the length of the first time window is equal to the sum of a candidate time length included in the second configuration information and the first coefficient time slots.
[0389] As an embodiment, the length of the first time window is equal to the product of a candidate time length included in the second configuration information and a first coefficient.
[0390] For a detailed introduction to the first coefficient, please refer to the previous article. For the sake of brevity, it will not be repeated here.
[0391] In some scenarios, a time instance may include multiple random access opportunities, and the length of the first time window corresponding to the time instance may be related to the number of random access opportunities in the time instance. Figure 7 Introduce this.
[0392] It should be noted that in the embodiments of the present application, the time period is not specifically limited. As an embodiment, the time period may include a PRACH time slot. As an embodiment, the time period includes a multi-carrier symbol. As an embodiment, the time period includes multiple multi-carrier symbols.
[0393] Figure 7 A flowchart of a method in a node used for wireless communication is provided in accordance with yet another embodiment of the present application. Figure 7 The illustrated method may be performed by a first node. Figure 7The illustrated method may include step S710.
[0394] In step S710, first information is received.
[0395] As an embodiment, the first information may be received by a first receiver of the first node.
[0396] As an embodiment, the first information may be sent by the second node. Of course, in the embodiment of the present application, the first information may be sent by other nodes, which is not limited in the embodiment of the present application.
[0397] As an embodiment, the first information is used to indicate the number of at least one random access opportunity within a time period.
[0398] As an embodiment, the multiple random access opportunities within the time period are frequency division multiplexed. Alternatively, the multiple random access opportunities within the time period are orthogonal in the time domain.
[0399] As an embodiment, when the number of the at least one random access opportunity in the time period is greater than 1, the multiple random access opportunities in the time period are frequency division multiplexed. Alternatively, when the number of the at least one random access opportunity in the time period is greater than 1, the multiple random access opportunities in the time period are orthogonal in the time domain.
[0400] As an embodiment, the length of the first time window is related to the number of at least one random access opportunity within the time period.
[0401] As an embodiment, the number of at least one random access opportunity within the time period is used to determine the length of the first time window.
[0402] As an embodiment, the length of the first time window is linearly related to the number of at least one random access opportunity within the time period.
[0403] As an embodiment, the length of the first time window increases or remains unchanged as the number of at least one random access opportunity in the time period increases.
[0404] As an embodiment, the length of the first time window is proportional to the number of at least one random access opportunity within the time period.
[0405] In the embodiment of the present application, the relationship between the first random access opportunity group and the time period is not limited. In some implementations, all random access opportunities in the first random access opportunity group may be located in one time period (i.e., the time period described above). In other implementations, any two random access opportunities in the first random access opportunity group are respectively in two different time periods. For example, each random access opportunity in the first random access opportunity group is in a different time period. Of course, in the embodiment of the present application, two random access opportunities in the first random access opportunity group are respectively in two different time periods, and accordingly, other random access opportunities in the first random access opportunity group except the two random access opportunities may be in the same time period, wherein the other random access opportunities may include one or more random access opportunities.
[0406] In an embodiment of the present application, the above-mentioned two random access opportunities (any two random access opportunities, or two random access times) in two different time periods can be replaced by two random access opportunities (any two random access opportunities, or two random access times) occupying two different time periods respectively.
[0407] In addition, in the embodiment of the present application, the above two random access opportunities (any two random access opportunities, or two random access times) are not specifically limited. As an embodiment, the above two random access opportunities are frequency division multiplexed. As an embodiment, the above two random access opportunities are orthogonal in the time domain.
[0408] In some scenarios, the first random access opportunity group may belong to one of multiple random access opportunity groups, wherein one or more random access opportunity groups in the multiple random access opportunity groups may include multiple random access opportunities. The following introduces multiple random access opportunity groups in an embodiment of the present application.
[0409] As an embodiment, one or more random access opportunities among the multiple random access opportunities included in at least two random access opportunity groups among the multiple random access opportunity groups are different. That is, at least one random access opportunity among the multiple random access opportunities included in at least two random access opportunity groups among the multiple random access opportunity groups is different.
[0410] It should be noted that at least one of the multiple random access opportunities included in the at least two random access opportunity groups is different, which can be understood as all the random access opportunities in the multiple random access opportunities included in the at least two random access opportunity groups are different. Of course, in the embodiment of the present application, it can also be understood that some of the random access opportunities in the multiple random access opportunities included in the at least two random access opportunity groups are different.
[0411] In addition, in the embodiment of the present application, the random access opportunity group including different random access opportunities is not limited. As an embodiment, at least one random access opportunity among the multiple random access opportunities included in any two random access opportunity groups among the multiple random access opportunity groups is different. As an embodiment, at least one random access opportunity among the multiple random access opportunities included in two random access opportunity groups among the multiple random access opportunity groups is different.
[0412] Of course, in the embodiment of the present application, the multiple random access opportunities included in all random access opportunity groups in the multiple random access opportunity groups may be completely the same.
[0413] As an embodiment, the number of random access opportunities included in any random access opportunity group of the multiple random access opportunity groups is one of 2, 4, and 8, or in other words, the number of random access opportunities included in a random access opportunity group of the multiple random access opportunity groups is one of 2, 4, and 8. Of course, in the embodiment of the present application, one or more random access opportunity groups in the multiple random access opportunity groups may also include other numbers of random access opportunity groups.
[0414] As an embodiment, the first random access opportunity group includes 2 random access opportunities.
[0415] As an embodiment, the first random access opportunity group includes 4 random access opportunities.
[0416] As an embodiment, the first random access opportunity group includes 8 random access opportunities.
[0417] As an embodiment, the multiple random access opportunity groups correspond to multiple preambles respectively, and the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0418] It should be noted that the preambles corresponding to the at least two random access opportunity groups are different, which can be understood as the preambles corresponding to each random access opportunity group in the multiple random access opportunity groups are different. Of course, in the embodiment of the present application, it can also be understood that the preambles corresponding to some random access opportunity groups in the multiple random access opportunities included in the at least two random access opportunity groups are different.
[0419] As an embodiment, a plurality of first type sequences are respectively used to generate the plurality of preambles corresponding to the plurality of random access opportunity groups.
[0420] In the embodiment of the present application, there is no limitation on multiple first-class sequences. As an embodiment, any two of the multiple first-class sequences are different. As an embodiment, the initial values of any two of the multiple first-class sequences are different. As an embodiment, the cyclic shifts of any two of the multiple first-class sequences are different. Of course, in the embodiment of the present application, the initial values and cyclic shifts of any two of the multiple first-class sequences are different. Alternatively, the initial values of any two of the multiple first-class sequences are the same, but the cyclic shifts of the two first-class sequences are different. Alternatively, the initial values of any two of the multiple first-class sequences are different, but the cyclic shifts of the two first-class sequences are the same.
[0421] As an embodiment, two of the multiple first-class sequences are different. As an embodiment, the initial values of two of the multiple first-class sequences are different. As an embodiment, the cyclic shifts of two of the multiple first-class sequences are different. Of course, in an embodiment of the present application, the initial values and cyclic shifts of two of the multiple first-class sequences are different. Alternatively, the initial values of two of the multiple first-class sequences are the same, but the cyclic shifts of the two first-class sequences are different. Alternatively, the initial values of two of the multiple first-class sequences are different, but the cyclic shifts of the two first-class sequences are the same.
[0422] The above describes multiple random access opportunity groups in the embodiment of the present application. The following describes a method for determining multiple random access opportunities included in the first random access opportunity group in the embodiment of the present application.
[0423] As an embodiment, the number of multiple random access opportunities included in the first random access opportunity group can be determined based on the reception quality of the first synchronization signal block. That is, the method of the embodiment of the present application may also include: receiving a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of multiple random access opportunities included in the first random access opportunity group.
[0424] In an embodiment of the present application, the reception quality of the first synchronization signal block is not limited. As an embodiment, the reception quality for the first synchronization signal block includes reference signal receiving power (RSRP). As an embodiment, the reception quality for the first synchronization signal block includes SS-RSRP (or SSB-RSRP). As an embodiment, the reception quality for the first synchronization signal block includes CSI-RSRP.
[0425] As an embodiment, the definition of SS-RSRP refers to Section 5.1.1 of 3GPP TS38.215.
[0426] As an embodiment, the definition of CSI-RSRP refers to Section 5.1.2 of 3GPP TS38.215.
[0427] As an embodiment, the reception quality for the first synchronization signal block includes reference signal receiving quality (RSRQ). As an embodiment, the reception quality for the first synchronization signal block includes SS-RSRQ.
[0428] As an embodiment, the definition of SS-RSRP refers to Section 5.1.3 of 3GPP TS38.215.
[0429] As an embodiment, the reception quality for the first synchronization signal block includes a signal to interference plus noise ratio (SINR). As an embodiment, the reception quality for the first synchronization signal block includes a SS-SINR.
[0430] As an embodiment, the definition of SS-RSRP refers to Section 5.1.5 of 3GPP TS38.215.
[0431] In the embodiment of the present application, the first synchronization signal block may be sent by a network device. Taking the second node as a network device as an example, the first synchronization signal block may be sent by the second node. In addition, in the embodiment of the present application, the first synchronization signal block may also be referred to as a synchronization signal / physical broadcast channel block (SS / PBCH block).
[0432] As an embodiment, multiple beams are respectively used to send multiple preambles corresponding to the first random access opportunity group in the first random access opportunity group, and the multiple beams are the same. Of course, in the embodiment of the present application, the multiple beams may also be partially or completely the same.
[0433] As an embodiment, the multiple random access preambles are respectively sent on the multiple PRACHs using the same beam.
[0434] As an embodiment, the same spatial domain filter is used to respectively send the multiple random access preambles on the multiple PRACHs.
[0435] As an embodiment, the same spatial domain transmission filter is used to respectively send the multiple random access preambles on the multiple PRACHs.
[0436] In some scenarios, after the first node detects the first control signaling, the PDSCH may be scheduled according to the first control signaling. This is described below.
[0437] As an embodiment, the method of the embodiment of the present application may further include: receiving a first transmission block within a first time window, the first transmission block is on a corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0438] As an embodiment, the first transmission block is received by a first receiver of the first node.
[0439] As an embodiment, the first transmission block is sent by a second node, and the second node may be, for example, a network device. However, the embodiment of the present application is not limited thereto. As an embodiment, the first transmission block is sent by a node other than the second node.
[0440] As an embodiment, the first transmission block is used for random access response.
[0441] As an embodiment, the random access response includes the first transmission block.
[0442] As an embodiment, the first control signaling and the first transmission block are used together for the random access response.
[0443] As an embodiment, the random access response includes the first control signaling and the first transmission block.
[0444] It should be noted that the beam mentioned in the present 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, antenna port.
[0445] It should be noted that the multi-carrier symbols mentioned in the present application may include or be replaced by at least one of the following: symbols, multi-carrier symbols, orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) symbols, discrete Fourier transform spread orthogonal frequency division multiplexing (discrete fourier transformation-spread-OFDM, DFT-s-OFDM) symbols, single-carrier frequency division multiple access (single-carrier frequency division multiple access, SC-FDMA) symbols.
[0446] It should be noted that the random access opportunity mentioned in the present application may include or be replaced by at least one of the following: a random access opportunity, a physical random access channel opportunity, and a PRACH opportunity.
[0447] For ease of understanding, the following Figure 8 An example is given in which the first node determines the length of the first time window based on configuration information. Figure 8 The method shown may include steps S810 to S840.
[0448] In step S810, configuration information is received.
[0449] As an embodiment, the configuration information is used to configure a PRACH opportunity for multiple PRACH transmissions. In other words, the configuration information is used to configure a PRACH resource pool for multiple PRACH transmissions.
[0450] As an embodiment, the configuration information may be the first configuration information mentioned above.
[0451] As an embodiment, the configuration information may be the second configuration information mentioned above.
[0452] As an embodiment, the configuration information includes at least one candidate time length.
[0453] In step S820, the number of PRACHs required for multiple PRACH transmission is determined.
[0454] As an embodiment, the signal quality received by the first node is used to determine the number of PRACHs required for sending the multiple PRACHs.
[0455] As an embodiment, the signal quality received by the first node may be the signal quality of the first synchronization signal block mentioned above.
[0456] As an embodiment, the signal quality received by the first node is indicated by SSB-RSRP.
[0457] As an embodiment, the number of PRACHs required for sending the multiple PRACHs may be, for example, one of 2, 4, and 8.
[0458] It should be noted that the embodiments of the present application do not specifically limit the execution order of step S810 and step S820. In some embodiments, the execution order of step S810 is earlier than that of step S820. In some embodiments, the execution order of step S810 is later than that of step S820. In some embodiments, step S810 and step S820 can be executed at the same time.
[0459] In step S830, the length of the first time window is determined.
[0460] As an embodiment, the number of PRACHs required for sending the multiple PRACHs is used to determine the length of the first time window.
[0461] As an embodiment, the above configuration information includes at least two candidate time lengths, and the first node selects one from the at least two candidate time lengths as the length of the first time window according to the number of PRACHs required for sending the multiple PRACHs.
[0462] As an embodiment, the configuration information includes a candidate time length, and the first node determines the length of the first time window according to the candidate time length and the first coefficient. For a detailed introduction to the first coefficient, please refer to the above text and will not be repeated here.
[0463] In step S840, a plurality of PRACH transmission opportunities are determined, and a first control signaling is monitored within a first time window.
[0464] As an embodiment, the first node randomly selects the PRACH timings for sending the multiple PRACHs from the configured PRACH timings. In other words, the first node randomly selects the resources for sending the multiple PRACHs from the configured PRACH resource pool.
[0465] As an embodiment, the first node monitors Msg2 within the first time window.
[0466] As an embodiment, the above-mentioned Msg2 includes the first control signaling.
[0467] In this way, in an embodiment of the present application, for multiple PRACH transmissions with a large number of PRACHs, the first node can select a longer first time window length, which is conducive to ensuring effective detection of multiple PRACHs; for multiple PRACH transmissions with a small number of PRACHs, the first node can select a shorter first time window length, which is conducive to reducing random access delay.
[0468] For ease of understanding, the following Figures 9 to 11 , several examples of the corresponding relationship between the candidate time length and the number of candidates are given. It should be noted that in the following examples, multiple PRACH transmissions are introduced by taking multiple PRACH opportunities included in the ROG as an example. It should also be noted that in the following examples, the first time window is introduced by taking the RAR window as an example.
[0469] Example 1:
[0470] See also Fig. 9 In Example 1, the number of PRACH opportunities in different ROGs is different, wherein the number of PRACH opportunities in ROG1 is 2, and the 2 PRACH opportunities included in ROG1 are used for one random access attempt of 2 PRACH transmissions. The number of PRACH opportunities in ROG2 is 4, and the 4 PRACH opportunities included in ROG2 are used for one random access attempt of 4 PRACH transmissions. The number of PRACH opportunities in ROG3 is 8, and the 8 PRACH opportunities included in ROG3 are used for one random access attempt of 8 PRACH transmissions.
[0471] In Example 1, the system (e.g., the network side) configures three candidate time lengths (Length-1 <Length-2<Length-3)。
[0472] When the number of PRACHs in multiple PRACH transmissions is 2, the length of the RAR window used is Length-1; when the number of PRACHs in multiple PRACH transmissions is 4, the length of the RAR window used is Length-2; when the number of PRACHs in multiple PRACH transmissions is 8, the length of the RAR window used is Length-3.
[0473] In other words, in this example, the length of the RAR window configured for a random access attempt sent by 2 PRACHs is Length-1, the length of the RAR window configured for a random access attempt sent by 4 PRACHs is Length-2, and the length of the RAR window configured for a random access attempt sent by 8 PRACHs is Length-3, where Length-1 <Length-2<Length-3。
[0474] Example 2:
[0475] See also Fig.10 In Example 2, the number of PRACH opportunities in different ROGs is different, wherein the number of PRACH opportunities in ROG1 is 2, and the 2 PRACH opportunities included in ROG1 are used for one random access attempt of 2 PRACH transmissions. The number of PRACH opportunities in ROG2 is 4, and the 4 PRACH opportunities included in ROG2 are used for one random access attempt of 4 PRACH transmissions. The number of PRACH opportunities in ROG3 is 8, and the 8 PRACH opportunities included in ROG3 are used for one random access attempt of 8 PRACH transmissions.
[0476] In Example 2, the system (e.g., the network side) configures two candidate time lengths (Length-2 <Length-3)。
[0477] As an embodiment, when the number of PRACHs in the multiple PRACH transmissions is 2 or 4, the length of the RAR window used is Length-2; when the number of PRACHs in the multiple PRACH transmissions is 8, the length of the RAR window used is Length-3.
[0478] In other words, in this example, the length of the RAR window configured for a random access attempt sent by 2 PRACHs or a random access attempt sent by 4 PRACHs is Length-2, and the length of the RAR window configured for a random access attempt sent by 8 PRACHs is Length-3, where Length-2 <Length-3。
[0479] Of course, in some embodiments, when the number of PRACHs in the multiple PRACH transmissions is 2, the length of the RAR window used is Length-2; when the number of PRACHs in the multiple PRACH transmissions is 4 or 8, the length of the RAR window used is Length-3.
[0480] Example 3:
[0481] See also Fig.11In Example 3, the number of PRACH opportunities in different ROGs is different, wherein the number of PRACH opportunities in ROG1 is 2, and the 2 PRACH opportunities included in ROG1 are used for one random access attempt of 2 PRACH transmissions. The number of PRACH opportunities in ROG2 is 4, and the 4 PRACH opportunities included in ROG2 are used for one random access attempt of 4 PRACH transmissions. The number of PRACH opportunities in ROG3 is 8, and the 8 PRACH opportunities included in ROG3 are used for one random access attempt of 8 PRACH transmissions.
[0482] In Example 3, the system (eg, network side) configures one candidate time length (Length-0) for multiple PRACH transmissions.
[0483] In this example, the length of the first time window can be determined according to the configured candidate time length (Length-0) and the number of PRACHs sent by the multiple PRACHs. For example, the length of the RAR window used for multiple PRACH transmissions with different numbers of PRACHs is the product of the first coefficient and Length-0. The first coefficient is determined according to the number of PRACHs sent by the multiple PRACHs, for example, the first coefficient is equal to the number of PRACHs sent by the multiple PRACHs.
[0484] Combination of the above Figures 4 to 11 , describes in detail the method of the first node used for wireless communication provided by the embodiment of the present application from the perspective of the first node. Fig.12 , a method for a second node used for wireless communication provided by an embodiment of the present application is described from the perspective of the second node. It should be understood that the descriptions of the first node and the second node correspond to each other, so the parts not described in detail can be referred to in the previous text.
[0485] As an embodiment, the second node may be a node that receives a random access preamble in the communication system.
[0486] As an embodiment, the second node may be a base station.
[0487] As an embodiment, the second node includes a first transmitter and a first receiver.
[0488] Fig.12 It is a flowchart of a method provided by an embodiment of the present application for a second node used for wireless communication. Fig.12 The method shown may include step S1210 and step S1220.
[0489] In step S1210, one or more of a plurality of random access preambles are received.
[0490] As an embodiment, the multiple random access preambles are received using a first receiver of the second node.
[0491] As an embodiment, the multiple random access preambles are sent by a first node. The first node may be, for example, a user equipment or a relay.
[0492] As an embodiment, multiple physical random access channel opportunities are used for sending the multiple random access preambles, and the multiple physical random access channel opportunities correspond to multiple physical random access channel transmissions respectively.
[0493] In step S1220, a first control signaling is sent within a first time window as a response to the transmission of the multiple physical random access channels.
[0494] As an embodiment, the length of the first time window is related to the number of the multiple physical random access channels sent.
[0495] As an embodiment, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the multiple physical random access channel opportunities.
[0496] As an embodiment, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0497] As an embodiment, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0498] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0499] As an embodiment, the first transmitter sends first configuration information; wherein, the first configuration information and the number of the multiple physical random access channels sent are used together to determine the length of the first time window.
[0500] As an embodiment, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0501] As an embodiment, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0502] As an embodiment, the first transmitter sends second configuration information, and the second configuration information includes a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0503] As an embodiment, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0504] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0505] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0506] As an embodiment, the first transmitter sends first information, wherein the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0507] As an embodiment, any two physical random access channel opportunities among the multiple physical random access channel opportunities are in two different time periods.
[0508] As an embodiment, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0509] As an embodiment, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0510] As an embodiment, the first transmitter sends a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0511] As an embodiment, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0512] As an embodiment, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0513] As an embodiment, the first transmitter sends a first transmission block within the first time window, the first transmission block is on the corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0514] Combination of the above Figures 1 to 12 , describes the method embodiment of the present application in detail, and the following is combined with Figures 13 to 16 , describes the device embodiment of the present application in detail. It should be understood that the description of the method embodiment corresponds to the description of the device embodiment, so the parts not described in detail can refer to the previous method embodiment.
[0515] Fig.13 A schematic diagram of the structure of a node used for wireless communication provided in one embodiment of the present application. Fig.13 The node 1300 shown may be any of the first nodes described above. The node 1300 may include a first transmitter 1310 and a first receiver 1320 .
[0516] The first transmitter 1310 may be configured to send a plurality of random access preambles, a plurality of physical random access channel opportunities are used for sending the plurality of random access preambles, and the plurality of physical random access channel opportunities correspond to a plurality of physical random access channel transmissions, respectively.
[0517] The first receiver 1320 may monitor the first control signaling in a first time window as a response to the transmission of the multiple physical random access channels, wherein the length of the first time window is related to the number of transmissions of the multiple physical random access channels.
[0518] As an embodiment, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the multiple physical random access channel opportunities.
[0519] As an embodiment, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0520] As an embodiment, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0521] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0522] As an embodiment, the first receiver receives first configuration information; wherein the first configuration information and the number of the multiple physical random access channels sent are used together to determine the length of the first time window.
[0523] As an embodiment, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0524] As an embodiment, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0525] As an embodiment, the first receiver receives second configuration information, and the second configuration information includes a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0526] As an embodiment, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0527] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0528] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0529] As an embodiment, the first receiver receives first information, wherein the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0530] As an embodiment, any two physical random access channel opportunities among the multiple physical random access channel opportunities are in two different time periods.
[0531] As an embodiment, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0532] As an embodiment, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0533] As an embodiment, the first receiver receives a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0534] As an embodiment, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0535] As an embodiment, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0536] As an embodiment, the first receiver receives a first transmission block within the first time window, the first transmission block is on a corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0537] As an embodiment, the first transmitter 1310 and the first receiver 1320 may be a transceiver 1530. The node 1300 may also include a processor 1510 and a memory 1520. Fig.15 shown.
[0538] Fig.14 A schematic diagram of the structure of a node used for wireless communication provided in another embodiment of the present application. Fig.14 The node 1400 shown may be any of the second nodes described above. The node 1400 may include a first receiver 1410 and a first transmitter 1420 .
[0539] The first receiver 1410 may receive one or more of a plurality of random access preambles, a plurality of physical random access channel opportunities being used for transmission of the plurality of random access preambles, the plurality of physical random access channel opportunities corresponding to a plurality of physical random access channel transmissions, respectively.
[0540] The first transmitter 1420 may send a first control signaling within a first time window as a response to the transmission of the multiple physical random access channels; wherein the length of the first time window is related to the number of transmissions of the multiple physical random access channels.
[0541] As an embodiment, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the multiple physical random access channel opportunities.
[0542] As an embodiment, the length of the first time window is linearly related to the number of the multiple physical random access channels sent.
[0543] As an embodiment, the length of the first time window is one of multiple candidate time lengths, and the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time lengths correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more candidate numbers among the multiple candidate numbers; the number sent by the multiple physical random access channels is used to determine the length of the first time window from the multiple candidate time lengths.
[0544] As an embodiment, the length of the first time window belongs to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the number sent by the multiple physical random access channels is one of multiple candidate numbers, wherein the multiple candidate time length groups correspond one-to-one to the multiple candidate numbers, or one of the multiple candidate time length groups corresponds to one or more candidate numbers in the multiple candidate numbers; the numbers sent by the multiple physical random access channels are used to determine the candidate time length group to which the length of the first time window belongs from the multiple candidate time length groups.
[0545] As an embodiment, the first transmitter sends first configuration information; wherein, the first configuration information and the number of the multiple physical random access channels sent are used together to determine the length of the first time window.
[0546] As an embodiment, the first configuration information includes at least two candidate time lengths, and the number of times the multiple physical random access channels are sent is used to determine the length of the first time window from the at least two candidate time lengths included in the first configuration information.
[0547] As an embodiment, the number of times the multiple physical random access channels are sent corresponds to one of multiple candidate time length groups, and any candidate time length group in the multiple candidate time length groups includes at least one time length; the first configuration information is used to determine the length of the first time window from a candidate time length group in the multiple candidate time length groups corresponding to the number of times the multiple physical random access channels are sent.
[0548] As an embodiment, the first transmitter sends second configuration information, and the second configuration information includes a candidate time length; wherein the length of the first time window is determined based on a candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of the multiple physical random access channels sent.
[0549] As an embodiment, the first coefficient is equal to the number of the multiple physical random access channels sent.
[0550] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities.
[0551] As an embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel opportunity among the multiple physical random access channel opportunities.
[0552] As an embodiment, the first transmitter sends first information, wherein the first information is used to indicate the number of at least one physical random access channel opportunity within a time period; when the number of the at least one physical random access channel opportunity within the time period is greater than 1, the multiple physical random access channel opportunities within the time period are frequency division multiplexed; wherein the length of the first time window is related to the number of at least one physical random access channel opportunity within the time period.
[0553] As an embodiment, any two physical random access channel opportunities among the multiple physical random access channel opportunities are in two different time periods.
[0554] As an embodiment, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, and any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities; at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups in the multiple random access opportunity groups is different.
[0555] As an embodiment, the multiple physical random access channel opportunities belong to one of multiple random access opportunity groups, any random access opportunity group in the multiple random access opportunity groups includes multiple physical random access channel opportunities, and the multiple random access opportunity groups respectively correspond to multiple preambles; the preambles corresponding to at least two random access opportunity groups in the multiple random access opportunity groups are different.
[0556] As an embodiment, the first transmitter sends a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of the multiple physical random access channels sent.
[0557] As an embodiment, the number of the multiple physical random access channels sent is one of 2, 4, or 8.
[0558] As an embodiment, multiple beams are respectively used to send the multiple random access preambles, and the multiple beams are the same.
[0559] As an embodiment, the first transmitter sends a first transmission block within the first time window, the first transmission block is on the corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.
[0560] As an embodiment, the first receiver 1410 and the first transmitter 1420 may be a transceiver 1530. The node 1400 may further include a processor 1510 and a memory 1520, specifically as follows: Fig.15 shown.
[0561] Fig.15 It is a schematic structural diagram of a communication device according to an embodiment of the present application. Fig.15 The dotted line in the figure indicates that the unit or module is optional. The device 1500 can be used to implement the method described in the above method embodiment. The device 1500 can be a chip, a user equipment or a network device.
[0562] The device 1500 may include one or more processors 1510. The processor 1510 may support the device 1500 to implement the method described in the method embodiment above. The processor 1510 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
[0563] The apparatus 1500 may further include one or more memories 1520. The memory 1520 stores a program, which can be executed by the processor 1510, so that the processor 1510 executes the method described in the above method embodiment. The memory 1520 may be independent of the processor 1510 or integrated in the processor 1510.
[0564] The apparatus 1500 may further include a transceiver 1530. The processor 1510 may communicate with other devices or chips through the transceiver 1530. For example, the processor 1510 may transmit and receive data with other devices or chips through the transceiver 1530.
[0565] Fig.16 A schematic diagram of the hardware modules of a communication device provided in an embodiment of the present application. Specifically, Fig.16 A block diagram is shown of a first communication device 450 and a second communication device 410 communicating with each other in an access network.
[0566] The first communication device 450 includes a controller / processor 459, a memory 460, a data source 467, a transmit processor 468, a receive processor 456, a multi-antenna transmit processor 457, a multi-antenna receive processor 458, a transmitter / receiver 454 and an antenna 452.
[0567] The second communication device 410 includes a controller / processor 475, a memory 476, a data source 477, a receive processor 470, a transmit processor 416, a multi-antenna receive processor 472, a multi-antenna transmit processor 471, a transmitter / receiver 418 and an antenna 420.
[0568] In the transmission from the second communication device 410 to the first communication device 450, at the second communication device 410, the upper layer data packets from the core network or the upper layer data packets from the data source 477 are provided to the controller / processor 475. The core network and the data source 477 represent all the protocol layers above the L2 layer. The controller / processor 475 implements the functionality of the L2 layer. In the transmission from the second communication device 410 to the first communication device 450, the controller / processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the first communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for the retransmission of lost packets and signaling to the first communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 416 implements coding and interleaving to facilitate forward error correction at the second communication device 410, as well as mapping of signal constellations based on various modulation schemes (e.g., binary phase shift keying, quadrature phase shift keying, M phase shift keying, M quadrature amplitude modulation). The multi-antenna transmit processor 471 performs digital spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing on the coded and modulated symbols to generate one or more spatial streams. The transmit processor 416 then maps each spatial stream to a subcarrier, multiplexes it with a reference signal (e.g., a pilot) in the time domain and / or frequency domain, and then uses an inverse fast Fourier transform to generate a physical channel carrying a time domain multi-carrier symbol stream. The multi-antenna transmit processor 471 then performs a transmit analog precoding / beamforming operation on the time domain multi-carrier symbol stream. Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 471 into a radio frequency stream, which is then provided to different antennas 420.
[0569] In the transmission from the second communication device 410 to the first communication device 450, at the first communication device 450, each receiver 454 receives a signal through its corresponding antenna 452. Each receiver 454 recovers the information modulated onto the radio frequency carrier, and converts the radio frequency stream into a baseband multi-carrier symbol stream and provides it to the receiving processor 456. The receiving processor 456 and the multi-antenna receiving processor 458 implement various signal processing functions of the L1 layer. The multi-antenna receiving processor 458 performs a receiving analog precoding / beamforming operation on the baseband multi-carrier symbol stream from the receiver 454. The receiving processor 456 uses a fast Fourier transform to convert the baseband multi-carrier symbol stream after the receiving analog precoding / beamforming operation from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receiving processor 456, wherein the reference signal will be used for channel estimation, and the data signal is recovered after multi-antenna detection in the multi-antenna receiving processor 458 to any spatial stream with the first communication device 450 as the destination. The symbols on each spatial stream are demodulated and recovered in the receiving processor 456, and soft decisions are generated. The receiving processor 456 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by 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 implements the functions of the L2 layer. The controller / processor 459 may be associated with a memory 460 that stores program codes and data. The memory 460 may be referred to as a computer-readable medium. In the transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover the upper layer data packets from the second communication device 410. The upper layer data packets are then provided to all protocol layers above the L2 layer. Various control signals may also be provided to the L3 for L3 processing.
[0570] In the transmission from the first communication device 450 to the second communication device 410, at the first communication device 450, the upper layer data packets are provided to the controller / processor 459 using the data source 467. The data source 467 represents all the protocol layers above the L2 layer. Similar to the transmission function at 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 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels, and implements L2 layer functions for user plane and control plane. The controller / processor 459 is also responsible for the retransmission of 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, including codebook-based precoding and non-codebook-based precoding, and beamforming processing. Then, the transmit processor 468 modulates the generated spatial stream into a multi-carrier / single-carrier symbol stream, which is then provided to different antennas 452 via the transmitter 454 after analog precoding / beamforming operations in the multi-antenna transmit processor 457. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a radio frequency symbol stream, and then provides it to the antenna 452.
[0571] In the transmission from the first communication device 450 to the second communication device 410, the function at the second communication device 410 is similar to the reception function at 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 a radio frequency signal through its corresponding antenna 420, converts the received radio frequency signal into a baseband signal, and provides the baseband signal to the multi-antenna reception processor 472 and the reception processor 470. The reception processor 470 and the multi-antenna reception processor 472 jointly implement the functions of the L1 layer. The controller / processor 475 implements the L2 layer functions. The controller / processor 475 can be associated with a memory 476 storing program codes and data. The memory 476 can be referred to as a computer-readable medium. In the transmission from the first communication device 450 to the second communication device 410, the controller / processor 475 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover the upper layer data packets from the first communication device 450. 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 also be provided to the core network or L3 for L3 processing.
[0572] As an embodiment, the first communication device 450 apparatus includes: at least one processor and at least one memory, the at least one memory including 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, and the first communication device 450 apparatus at least: sends multiple random access preambles, multiple physical random access channel opportunities are used for the transmission of the multiple random access preambles, and the multiple physical random access channel opportunities correspond to multiple physical random access channel transmissions respectively; as a response to the transmission of the multiple physical random access channels, monitors first control signaling within a first time window; wherein the length of the first time window is related to the number of the multiple physical random access channel transmissions.
[0573] As an embodiment, the first communication device 450 apparatus includes: a memory storing a computer-readable instruction program, wherein the computer-readable instruction program generates actions when executed by at least one processor, and the actions include: sending multiple random access preambles, multiple physical random access channel opportunities are used for the sending of the multiple random access preambles, and the multiple physical random access channel opportunities correspond to multiple physical random access channel sendings respectively; as a response to the sending of the multiple physical random access channels, monitoring a first control signaling within a first time window; wherein the length of the first time window is related to the number of the multiple physical random access channel sendings.
[0574] As an embodiment, the first communication device 450 corresponds to the first node in this application.
[0575] As an embodiment, the second communication device 410 corresponds to the second node in this application.
[0576] As an embodiment, the first communication device 450 is an NCR.
[0577] As an embodiment, the first communication device 450 is a wireless repeater.
[0578] As an embodiment, the first communication device 450 is a relay.
[0579] As an embodiment, the first communication device 450 is a user equipment.
[0580] As an embodiment, the first communication device 450 is a user equipment supporting V2X.
[0581] As an embodiment, the first communication device 450 is a user equipment supporting D2D.
[0582] As an embodiment, the second communication device 410 is a base station.
[0583] As an embodiment, the antenna 452, the receiver 454, the multi-antenna reception processor 458, the reception processor 456, and the controller / processor 459 are used to monitor the first control signaling within a first time window.
[0584] As an embodiment, the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, and the controller / processor 475 are used to send a first control signaling within a first time window.
[0585] As an embodiment, the antenna 452, the transmitter 454, the multi-antenna transmit processor 457, the transmit processor 468, and the controller / processor 459 are used to send multiple random access preambles in the present application.
[0586] As an embodiment, the antenna 420, the receiver 418, the multi-antenna receiving processor 472, the receiving processor 470, and the controller / processor 475 are used to receive multiple random access preambles sent in the present application.
[0587] The present application also provides a computer-readable storage medium for storing a program. The computer-readable storage medium can be applied to a terminal or network device provided in the present application, and the program enables a computer to execute the method performed by the terminal or network device in each embodiment of the present application.
[0588] The embodiment of the present application also provides a computer program product. The computer program product includes a program. The computer program product can be applied to the terminal or network device provided in the embodiment of the present application, and the program enables the computer to execute the method performed by the terminal or network device in each embodiment of the present application.
[0589] The embodiment of the present application also provides a computer program. The computer program can be applied to the terminal or network device provided in the embodiment of the present application, and the computer program enables a computer to execute the method executed by the terminal or network device in each embodiment of the present application.
[0590] It should be understood that the terms "system" and "network" in this application can be used interchangeably. In addition, the terms used in this application are only used to explain the specific embodiments of the present application, and are not intended to limit the present application. The terms "first", "second", "third" and "fourth" in the specification and claims of this application and the accompanying drawings are used to distinguish different objects, rather than to describe a specific order. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions.
[0591] In the embodiments of the present application, the "indication" mentioned can be a direct indication, an indirect indication, or an indication of an association relationship. For example, A indicates B, which can mean that A directly indicates B, for example, B can be obtained through A; it can also mean that A indirectly indicates B, for example, A indicates C, and B can be obtained through C; it can also mean that there is an association relationship between A and B.
[0592] In the embodiment of the present application, "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should be understood that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.
[0593] In the embodiments of the present application, the term "corresponding" may indicate that there is a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship of indication and being indicated, configuration and being configured, etc.
[0594] In the embodiments of the present application, "pre-definition" or "pre-configuration" can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, including a user device and a network device), and the present application does not limit the specific implementation method. For example, pre-definition can refer to what is defined in the protocol.
[0595] In the embodiments of the present application, the “protocol” may refer to a standard protocol in the communication field, for example, it may include an LTE protocol, an NR protocol, and related protocols used in future communication systems, and the present application does not limit this.
[0596] In the embodiments of the present application, the term "and / or" is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.
[0597] In various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0598] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0599] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0600] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0601] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose 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 computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that can be read by a computer or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a digital video disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD)).
[0602] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
Claims
1. A first node for wireless communication, It is characterized in that include: A first transceiver, using the same spatial domain filter to send multiple random access preambles in a first random access opportunity group, wherein the first random access opportunity group includes multiple physical random access channel opportunities, the multiple physical random access channel opportunities are respectively used to send the multiple random access preambles, and any two physical random access channel opportunities in the multiple physical random access channel opportunities have the same starting position in the frequency domain; The first transceiver is further configured to monitor DCI format 1_0 within a first time window; The starting point of the first time window is located after the last symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities; the cyclic redundancy check of the DCI format 1_0 is scrambled by the RA-RNTI, and the RA-RNTI is associated with the last physical random access channel opportunity among the multiple physical random access channel opportunities included in the first random access opportunity group; the length of the first time window remains unchanged as the number of the multiple random access preambles increases, and the number of the multiple random access preambles is one of 2, 4, or 8; the length of the first time window is expressed in time slots; the first configuration information is used to configure a resource pool for sending the multiple random access preambles, and the first configuration information is configured by higher layer signaling.
2. The first node according to claim 1, It is characterized in that The length of the first time window is one of a plurality of candidate time lengths, the number of the plurality of random access preambles is one of a plurality of candidate numbers, and one of the plurality of candidate time lengths is shared by the plurality of candidate numbers.
3. The first node according to claim 1 or 2, It is characterized in that The first transceiver is further configured to receive second configuration information, where the second configuration information includes a candidate time length, and the length of the first time window is the candidate time length.
4. The first node according to any one of claims 1 to 3, It is characterized in that The first transceiver is further used to receive first information, where the first information is used to indicate the number of at least one physical random access channel opportunity within a time period, and multiple physical random access channel opportunities within the time period are frequency division multiplexed.
5. The first node according to any one of claims 1 to 4, It is characterized in that The first transceiver is further configured to receive a first transport block within the first time window, where the first transport block is on a corresponding PDSCH, and the DCI format1_0 is used to schedule the PDSCH.
6. The first node according to any one of claims 1 to 5, It is characterized in that The first transceiver is further used to receive the first configuration information, where the first configuration information includes the multiple candidate time lengths, and the first configuration information is configured at the RRC layer.
7. The first node according to any one of claims 1 to 6, It is characterized in that The multiple physical random access channel opportunities included in the first random access opportunity group are one or more of the following: The multiple physical random access channel opportunities are associated with the same SS / PBCH block; The multiple physical random access channel opportunities are time division multiplexed; The number of the plurality of physical random access channel opportunities is equal to the number of the plurality of random access preambles; The plurality of physical random access channel opportunities are used for one random access attempt; Any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
8. The first node according to any one of claims 1 to 7, It is characterized in that The length of the first time window includes multiple time slots; the length of the first time window is less than or equal to 40 milliseconds.
9. The first node according to claim 8, It is characterized in that The length of the first time window is less than or equal to 10 milliseconds.
10. The first node according to any one of claims 1 to 9, It is characterized in that The first random access opportunity group belongs to one of multiple random access opportunity groups, any random access opportunity group of the multiple random access opportunity groups includes multiple physical random access channel opportunities; the multiple random access opportunity groups are one or more of the following: At least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups among the multiple random access opportunity groups is different; The multiple random access opportunity groups correspond to multiple preambles respectively, and at least two random access opportunity groups among the multiple random access opportunity groups correspond to different preambles.
11. The first node according to any one of claims 1 to 10, It is characterized in that The first transceiver is also used to receive an SS / PBCH block, and the reception quality of the SS / PBCH block is SSB-RSRP, and the SSB-RSRP is used to determine the number of the multiple physical random access channel opportunities.
12. A second node for wireless communication, It is characterized in that include: a second transceiver, receiving, in a first random access opportunity group, one or more of a plurality of random access preambles sent using a same spatial domain filter, the first random access opportunity group comprising a plurality of physical random access channel opportunities, the plurality of physical random access channel opportunities being respectively used to send the plurality of random access preambles, any two of the plurality of physical random access channel opportunities being at the same starting position in the frequency domain; The second transceiver is further configured to send DCI format 1_0 within a first time window; The starting point of the first time window is located after the last symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities; the cyclic redundancy check of the DCI format 1_0 is scrambled by the RA-RNTI, and the RA-RNTI is associated with the last physical random access channel opportunity among the multiple physical random access channel opportunities included in the first random access opportunity group; the length of the first time window remains unchanged as the number of the multiple random access preambles increases, and the number of the multiple random access preambles is one of 2, 4, or 8; the length of the first time window is expressed in time slots; the first configuration information is used to configure a resource pool for sending the multiple random access preambles, and the first configuration information is configured by higher layer signaling.
13. The second node according to claim 12, It is characterized in that The length of the first time window is one of a plurality of candidate time lengths, the number of the plurality of random access preambles is one of a plurality of candidate numbers, and one of the plurality of candidate time lengths is shared by the plurality of candidate numbers.
14. The second node according to claim 12 or 13, It is characterized in that The second transceiver is further configured to perform one or more of the following: The second transceiver is further used to send second configuration information, where the second configuration information includes a candidate time length, and the length of the first time window is the candidate time length; The second transceiver is further used to send first information, where the first information is used to indicate the number of at least one physical random access channel opportunity in a time period, and the multiple physical random access channel opportunities in the time period are frequency division multiplexed; The second transceiver is further configured to send a first transport block within the first time window, the first transport block is on a corresponding PDSCH, and the DCI format 1_0 is used to schedule the PDSCH; The second transceiver is further used to send the first configuration information, where the first configuration information includes the multiple candidate time lengths, and the first configuration information is configured by the RRC layer; The second transceiver is also used to send an SS / PBCH block, and the reception quality for the SS / PBCH block is SSB-RSRP, and the SSB-RSRP is used to determine the number of the multiple physical random access channel opportunities.
15. The second node according to any one of claims 12 to 14, It is characterized in that The multiple physical random access channel opportunities included in the first random access opportunity group are one or more of the following: The multiple physical random access channel opportunities are associated with the same SS / PBCH block; The multiple physical random access channel opportunities are time division multiplexed; The number of the plurality of physical random access channel opportunities is equal to the number of the plurality of random access preambles; The plurality of physical random access channel opportunities are used for one random access attempt; Any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
16. The second node according to any one of claims 12 to 15, It is characterized in that The length of the first time window includes multiple time slots; the length of the first time window is less than or equal to 40 milliseconds.
17. The second node according to claim 16, It is characterized in that The length of the first time window is less than or equal to 10 milliseconds.
18. The second node according to any one of claims 12 to 17, It is characterized in that The first random access opportunity group belongs to one of multiple random access opportunity groups, any random access opportunity group of the multiple random access opportunity groups includes multiple physical random access channel opportunities; the multiple random access opportunity groups are one or more of the following: At least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups among the multiple random access opportunity groups is different; The multiple random access opportunity groups correspond to multiple preambles respectively; and the preambles corresponding to at least two random access opportunity groups among the multiple random access opportunity groups are different.
19. A method in a first node for wireless communication, It is characterized in that include: sending a plurality of random access preambles by using the same spatial domain filter in a first random access opportunity group, wherein the first random access opportunity group includes a plurality of physical random access channel opportunities, the plurality of physical random access channel opportunities are respectively used to send the plurality of random access preambles, and any two of the plurality of physical random access channel opportunities have the same starting position in the frequency domain; Monitor DCI format 1_0 in the first time window; The starting point of the first time window is located after the last symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities; the cyclic redundancy check of the DCI format 1_0 is scrambled by the RA-RNTI, and the RA-RNTI is associated with the last physical random access channel opportunity among the multiple physical random access channel opportunities included in the first random access opportunity group; the length of the first time window remains unchanged as the number of the multiple random access preambles increases, and the number of the multiple random access preambles is one of 2, 4, or 8; the length of the first time window is expressed in time slots; the first configuration information is used to configure a resource pool for sending the multiple random access preambles, and the first configuration information is configured by higher layer signaling.
20. The method according to claim 19, It is characterized in that The length of the first time window is one of a plurality of candidate time lengths, the number of the plurality of random access preambles is one of a plurality of candidate numbers, and one of the plurality of candidate time lengths is shared by the plurality of candidate numbers.
21. The method according to claim 19 or 20, It is characterized in that include: Second configuration information is received, where the second configuration information includes a candidate time length, and the length of the first time window is the candidate time length.
22. The method according to any one of claims 19 to 21, It is characterized in that include: First information is received, where the first information is used to indicate the number of at least one physical random access channel opportunity in a time period, and multiple physical random access channel opportunities in the time period are frequency division multiplexed.
23. The method according to any one of claims 19 to 22, It is characterized in that include: A first transport block is received within the first time window, where the first transport block is on a corresponding PDSCH, and the DCI format 1_0 is used to schedule the PDSCH.
24. The method according to any one of claims 19 to 23, It is characterized in that include: The first configuration information is received, where the first configuration information includes the multiple candidate time lengths, and the first configuration information is configured at the RRC layer.
25. The method according to any one of claims 19 to 24, It is characterized in that The multiple physical random access channel opportunities included in the first random access opportunity group are one or more of the following: The multiple physical random access channel opportunities are associated with the same SS / PBCH block; The multiple physical random access channel opportunities are time division multiplexed; The number of the plurality of physical random access channel opportunities is equal to the number of the plurality of random access preambles; The plurality of physical random access channel opportunities are used for one random access attempt; Any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
26. The method according to any one of claims 19 to 25, It is characterized in that The length of the first time window includes multiple time slots; the length of the first time window is less than or equal to 40 milliseconds.
27. The method according to claim 26, It is characterized in that The length of the first time window is less than or equal to 10 milliseconds.
28. The method according to any one of claims 19 to 27, It is characterized in that The first random access opportunity group belongs to one of multiple random access opportunity groups, any random access opportunity group of the multiple random access opportunity groups includes multiple physical random access channel opportunities; the multiple random access opportunity groups are one or more of the following: At least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups among the multiple random access opportunity groups is different; The multiple random access opportunity groups correspond to multiple preambles respectively; and the preambles corresponding to at least two random access opportunity groups among the multiple random access opportunity groups are different.
29. The method according to any one of claims 19 to 28, It is characterized in that include: An SS / PBCH block is received, and a reception quality for the SS / PBCH block is SSB-RSRP, and the SSB-RSRP is used to determine the number of the multiple physical random access channel opportunities.
30. A method in a second node for wireless communication, It is characterized in that include: receiving, in a first random access opportunity group, one or more of a plurality of random access preambles sent using a same spatial domain filter, the first random access opportunity group comprising a plurality of physical random access channel opportunities, the plurality of physical random access channel opportunities being respectively used to send the plurality of random access preambles, any two of the plurality of physical random access channel opportunities having the same starting position in the frequency domain; Send DCI format 1_0 in the first time window; The starting point of the first time window is located after the last symbol of the last physical random access channel opportunity among the multiple physical random access channel opportunities; the cyclic redundancy check of the DCI format 1_0 is scrambled by the RA-RNTI, and the RA-RNTI is associated with the last physical random access channel opportunity among the multiple physical random access channel opportunities included in the first random access opportunity group; the length of the first time window remains unchanged as the number of the multiple random access preambles increases, and the number of the multiple random access preambles is one of 2, 4, or 8; the length of the first time window is expressed in time slots; the first configuration information is used to configure a resource pool for sending the multiple random access preambles, and the first configuration information is configured by higher layer signaling.
31. The method according to claim 30, It is characterized in that The length of the first time window is one of a plurality of candidate time lengths, the number of the plurality of random access preambles is one of a plurality of candidate numbers, and one of the plurality of candidate time lengths is shared by the plurality of candidate numbers.
32. The method according to claim 30 or 31, It is characterized in that The method may further include one or more of the following: Sending second configuration information, where the second configuration information includes a candidate time length, and the length of the first time window is the candidate time length; Sending first information, where the first information is used to indicate the number of at least one physical random access channel opportunity in a time period, where multiple physical random access channel opportunities in the time period are frequency division multiplexed; Sending a first transport block within the first time window, where the first transport block is on a corresponding PDSCH, and the DCI format 1_0 is used to schedule the PDSCH; Sending the first configuration information, where the first configuration information includes the multiple candidate time lengths, and the first configuration information is configured by the RRC layer; The SS / PBCH block is sent, and the reception quality for the SS / PBCH block is SSB-RSRP, and the SSB-RSRP is used to determine the number of the multiple physical random access channel opportunities.
33. The method according to any one of claims 30 to 32, It is characterized in that The multiple physical random access channel opportunities included in the first random access opportunity group are one or more of the following: The multiple physical random access channel opportunities are associated with the same SS / PBCH block; The multiple physical random access channel opportunities are time division multiplexed; The number of the plurality of physical random access channel opportunities is equal to the number of the plurality of random access preambles; The plurality of physical random access channel opportunities are used for one random access attempt; Any two physical random access channel opportunities among the multiple physical random access channel opportunities are respectively in two different time periods.
34. The method according to any one of claims 30 to 33, It is characterized in that The length of the first time window includes multiple time slots; the length of the first time window is less than or equal to 40 milliseconds.
35. The method according to claim 34, It is characterized in that The length of the first time window is less than or equal to 10 milliseconds.
36. The method according to any one of claims 30 to 35, It is characterized in that The first random access opportunity group belongs to one of multiple random access opportunity groups, any random access opportunity group of the multiple random access opportunity groups includes multiple physical random access channel opportunities; the multiple random access opportunity groups are one or more of the following: At least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two random access opportunity groups among the multiple random access opportunity groups is different; The multiple random access opportunity groups correspond to multiple preambles respectively; and the preambles corresponding to at least two random access opportunity groups among the multiple random access opportunity groups are different.
