Methods and apparatus applicable to nodes for wireless communication

Abstract

The present invention provides a method and apparatus applicable to a node for wireless communication. The first node for wireless communication includes a first transmitter that transmits a plurality of random access preambles, wherein a plurality of physical random access channel timings are used for transmitting a plurality of random access preambles, each of which corresponds to a plurality of physical random access channel transmissions, and a first receiver that monitors 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 plurality of physical random access channel transmissions.

Description

Technical Field

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

Background Art

[0002] In order to improve the coverage performance of the physical random access channel (PRACH), some communication systems (for example, the new radio (NR) system) attempt to introduce solutions for multiple PRACH transmissions. Currently, for multiple PRACH transmissions in one random access attempt, there may be only one time window for monitoring control signaling. Using a uniformly set time window length in the solution for multiple PRACH transmissions, this uniformly set time window length may not be able to meet the requirements of multiple PRACH transmissions, or in order to meet the requirement of the number of valid physical random access channel timings, the time span of multiple PRACH transmissions is lengthened, and consequently, this uniformly set time window length may be further lengthened. Or it may affect the performance of multiple PRACH transmissions, and the PRACH transmission may become a bottleneck in the coverage range of the communication system.

Summary of the Invention

Problems to be Solved by the Invention

[0003] Embodiments of this application provide a method and apparatus applied to a node for wireless communication. The following describes each aspect related to this application.

Means for Solving the Problems

[0004] In a first embodiment, a first transmitter for transmitting multiple random access preambles, wherein multiple physical random access channel timings are used for transmitting multiple random access preambles, each physical random access channel timing corresponds to a multiple physical random access channel transmission, and the first transmitter includes a first receiver that monitors a first control signaling within a first time window as a response to the multiple physical random access channel transmissions, the length of the first time window being related to the number of multiple physical random access channel transmissions, and provides a first node for wireless communication.

[0005] In one embodiment, a first control signaling is scrambled by a first radio network temporary identifier (RNTI), and the first RNTI is associated with a plurality of physical random access channel timings.

[0006] In one embodiment, the length of the first time window and the number of multiple physical random access channel transmissions are linearly related.

[0007] In one embodiment, the length of the first time window is one of a plurality of candidate time lengths, the number of a plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or a plurality of candidate numbers, and the number of a plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

[0008] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the candidate time length groups includes at least one time length, the number of a plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or a plurality of candidate numbers, and the number of a plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

[0009] In one embodiment, the first receiver receives first configuration information, and the first configuration information and the number of multiple physical random access channel transmissions are used together to determine the length of the first time window.

[0010] In one embodiment, the first configuration information includes at least two candidate time lengths, and the number of multiple physical random access channel 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.

[0011] In one embodiment, the number of multiple physical random access channel transmissions corresponds to one of multiple candidate time length groups, any of 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 one candidate time length group corresponding to the number of multiple physical random access channel transmissions in the multiple candidate time length groups.

[0012] In one embodiment, a first receiver receives second configuration information, which includes one candidate time length, and the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, where the first coefficient relates to the number of multiple physical random access channel transmissions.

[0013] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0014] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0015] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in a plurality of physical random access channel timings.

[0016] In one embodiment, a first receiver receives first information, which is used to indicate the number of at least one physical random access channel timings within a time instance, and if the number of at least one physical random access channel timings within a time instance is greater than 1, the multiple physical random access channel timings within the time instance are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within a time instance.

[0017] In one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0018] In one embodiment, a plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

[0019] In one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0020] In one embodiment, the first receiver receives a first synchronization signal block, and the reception quality for the first synchronization signal block is used to determine the number of multiple physical random access channel transmissions.

[0021] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0022] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0023] In one embodiment, a first receiver receives a first transmission block within a first time window, the first transmission block is located on a corresponding physical downlink shared channel (PDSCH), and the first control signaling is used to schedule the PDSCH.

[0024] In a second aspect, a second node for wireless communication is a first receiver that receives one or more of a plurality of random access preambles. A plurality of physical random access channel timings are used for transmitting the plurality of random access preambles. The plurality of physical random access channel timings respectively correspond to a first receiver for a plurality of physical random access channel transmissions, and as a response to the plurality of physical random access channel transmissions, a first transmitter that transmits first control signaling within a first time window. The length of the first time window is related to the number of the plurality of physical random access channel transmissions.

[0025] As one embodiment, the first control signaling is scrambled by a first RNTI, and the first RNTI is associated with the plurality of physical random access channel timings.

[0026] As one embodiment, the length of the first time window and the number of the plurality of physical random access channel transmissions are in a linear relationship.

[0027] As one embodiment, the length of the first time window is one of a plurality of candidate time lengths, the number of the plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one-to-one to the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or more of the plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

[0028] As one embodiment, the length of the first time window belongs 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, the number of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one to the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

[0029] As one embodiment, the first transmitter transmits first configuration information, and the first configuration information and the number of physical random access channel transmissions are jointly used to determine the length of the first time window.

[0030] As one embodiment, the first configuration information includes at least two candidate time lengths, and the number of physical random access channel transmissions is used to determine the length of the first time window from at least two candidate time lengths included in the first configuration information.

[0031] As one embodiment, the number of physical random access channel transmissions corresponds to one of the 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 one candidate time length group corresponding to the number of physical random access channel transmissions in the plurality of candidate time length groups.

[0032] As one embodiment, the first transmitter transmits second configuration information, the second configuration information includes one candidate time length, the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, and the first coefficient is related to the number of physical random access channel transmissions.

[0033] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0034] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0035] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in a plurality of physical random access channel timings.

[0036] In one embodiment, a first transmitter transmits first information used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within a time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

[0037] In one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0038] In one embodiment, a plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

[0039] In one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0040] In one embodiment, the first transmitter transmits a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of multiple physical random access channel transmissions.

[0041] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0042] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0043] In one embodiment, the first transmitter transmits a first transmission block within a first time window, the first transmission block is located in the corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.

[0044] A third embodiment provides a method at a first node for wireless communication, comprising the steps of transmitting a plurality of random access preambles, wherein a plurality of physical random access channel timings are used for transmitting a plurality of random access preambles, and each of the plurality of physical random access channel timings corresponds to a plurality of physical random access channel transmissions, and monitoring 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.

[0045] In one embodiment, a first control signaling is scrambled by a first RNTI, which is associated with a plurality of physical random access channel timings.

[0046] In one embodiment, the length of the first time window and the number of multiple physical random access channel transmissions are linearly related.

[0047] In one embodiment, the length of the first time window is one of a plurality of candidate time lengths, the number of a plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or a plurality of candidate numbers, and the number of a plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

[0048] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the candidate time length groups includes at least one time length, the number of a plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or a plurality of candidate numbers, and the number of a plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

[0049] In one embodiment, the method includes first configuration information, and the first configuration information and the number of multiple physical random access channel transmissions are used together to determine the length of the first time window.

[0050] In one embodiment, the first configuration information includes at least two candidate time lengths, and the number of multiple physical random access channel 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.

[0051] In one embodiment, the number of multiple physical random access channel transmissions corresponds to one of multiple candidate time length groups, any of 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 one candidate time length group corresponding to the number of multiple physical random access channel transmissions in the multiple candidate time length groups.

[0052] In one embodiment, the method includes the step of receiving second configuration information, the second configuration information includes one candidate time length, and the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, the first coefficient being related to the number of multiple physical random access channel transmissions.

[0053] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0054] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0055] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in a plurality of physical random access channel timings.

[0056] In one embodiment, the method includes the step of receiving first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within a time period is greater than 1, then multiple physical random access channel timings within a time period are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within a time period.

[0057] In one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0058] In one embodiment, a plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

[0059] In one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0060] In one embodiment, the method includes the step of receiving a first synchronization signal block, the reception quality of the first synchronization signal block being used to determine the number of multiple physical random access channel transmissions.

[0061] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0062] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0063] In one embodiment, the method includes the step of receiving a first transmission block within a first time window, the first transmission block being in a corresponding PDSCH, and the first control signaling being used to schedule the PDSCH.

[0064] A fourth embodiment provides a method at a second node for wireless communication, comprising the steps of: receiving one or more of a plurality of random access preambles, wherein the plurality of physical random access channel timings are used for transmitting the plurality of random access preambles, and each of the plurality of physical random access channel timings corresponds to a plurality of physical random access channel transmissions; and transmitting 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.

[0065] In one embodiment, a first control signaling is scrambled by a first RNTI, which is associated with a plurality of physical random access channel timings.

[0066] In one embodiment, the length of the first time window and the number of multiple physical random access channel transmissions are linearly related.

[0067] In one embodiment, the length of the first time window is one of a plurality of candidate time lengths, the number of a plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or a plurality of candidate numbers, and the number of a plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

[0068] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the candidate time length groups includes at least one time length, the number of a plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or a plurality of candidate numbers, and the number of a plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

[0069] In one embodiment, the method includes the step of transmitting first configuration information, the first configuration information and the number of multiple physical random access channel transmissions being used together to determine the length of the first time window.

[0070] In one embodiment, the first configuration information includes at least two candidate time lengths, and the number of multiple physical random access channel 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.

[0071] In one embodiment, the number of multiple physical random access channel transmissions corresponds to one of multiple candidate time length groups, any of 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 one candidate time length group corresponding to the number of multiple physical random access channel transmissions in the multiple candidate time length groups.

[0072] In one embodiment, the method includes the step of transmitting second configuration information, the second configuration information including one candidate time length, and the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, the first coefficient relating to the number of multiple physical random access channel transmissions.

[0073] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0074] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0075] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in a plurality of physical random access channel timings.

[0076] In one embodiment, the method includes the step of transmitting first information, which is used to indicate the number of at least one physical random access channel timings within a time period, wherein if the number of at least one physical random access channel timings within a time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

[0077] In one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0078] In one embodiment, a plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

[0079] In one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0080] In one embodiment, the method includes the step of transmitting a first synchronization signal block, the reception quality of the first synchronization signal block being used to determine the number of multiple physical random access channel transmissions.

[0081] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0082] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0083] In one embodiment, the method includes the step of transmitting a first transmission block within a first time window, the first transmission block being in a corresponding PDSCH, and the first control signaling being used to schedule the PDSCH.

[0084] In the fifth aspect, a first node for wireless communication is provided, which includes a transceiver, memory and a processor, the memory being used to store a program, and the processor calling the program in the memory and controlling the transceiver to send and receive signals, thereby causing the node to perform the method according to any embodiment of the third aspect.

[0085] In the sixth aspect, a second node for wireless communication is provided, which includes a transceiver, memory and a processor, the memory being used to store a program, and the processor calling the program in the memory and controlling the transceiver to send and receive signals, thereby causing the node to perform the method according to any embodiment of the fourth aspect.

[0086] In the seventh aspect, an embodiment of the present application provides a communication system including the first and / or second nodes described above. In another possible design, the system may further include other devices that interact with the first or second node in the means of the embodiment of the present application.

[0087] In the eighth aspect, an embodiment of the present application provides a computer-readable storage medium in which a computer program is stored that causes a computer to perform some or all of the steps of the methods of each of the above aspects.

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

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

[0090] The embodiment of the present invention can determine the length of the first time window based on the number of PRACH transmissions, thereby satisfying the constituent requirements for time windows of multiple PRACH transmissions with different numbers of PRACHs.

[0091] The method and apparatus for a wireless communication node according to the embodiment of the present application are advantageous for improving the performance gain of multiple PRACH transmissions.

[0092] The method and apparatus for a wireless communication node according to the embodiment of the present application are advantageous for increasing the coverage range of a communication system.

[0093] The method and apparatus for a wireless communication node according to the embodiment of the present application are advantageous in reducing random access delay.

[0094] The method and apparatus for a wireless communication node according to the embodiment of the present invention are advantageous in improving the utilization efficiency of random access resources. [Brief explanation of the drawing]

[0095] [Figure 1] This figure shows an example of a system architecture for a wireless communication system that may be applied to embodiments of the present invention. [Figure 2] This is an example of a short time window that has been constructed. [Figure 3] This is an example of a long-term window configuration. [Figure 4] This is a flowchart of a method at a first node for wireless communication according to one embodiment of the present invention. [Figure 5] This is a flowchart of a method at a first node for wireless communication according to another embodiment of the present invention. [Figure 6] This is a flowchart of a method at a first node for wireless communication according to another embodiment of the present application. [Figure 7] This is a flowchart of a method at a first node for wireless communication according to another embodiment of the present application. [Figure 8] This is a flowchart of a method at a first node for wireless communication according to another embodiment of the present application. [Figure 9] This figure shows an example of the configuration of the first time window according to one embodiment of the present application. [Figure 10] This figure shows an example of the configuration of the first time window according to another embodiment of the present application. [Figure 11] This figure shows an example of the configuration of the first time window according to another embodiment of the present application. [Figure 12] This is a flowchart of a method at a second node for wireless communication according to one embodiment of the present invention. [Figure 13] A schematic diagram of the structure of a wireless communication node according to one embodiment of the present invention. [Figure 14] This is a schematic diagram of the structure of a wireless communication node according to another embodiment of the present invention. [Figure 15] This is a schematic diagram of the apparatus according to an embodiment of the present invention. [Figure 16] This is a structural diagram of the hardware module of a communication device according to an embodiment of the present invention. [Modes for carrying out the invention]

[0096] Communication system architecture

[0097] Figure 1 shows an example of a system architecture of a wireless communication system 100 that may be applied to embodiments of the present application. This 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 can provide communication coverage to a specific geographic area and can communicate with the user device 120 located within this coverage area.

[0098] Figure 1 illustrates one network device and two user devices, and optionally, this wireless communication system 100 may include multiple network devices, and the coverage range of each network device may include other numbers of user devices, but the embodiments of the present application are not limited thereto.

[0099] The wireless communication system 100 may optionally further include other network entities such as a network controller and a mobility management entity, and the embodiments of the present application are not limited thereto.

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

[0101] It should be understood that, as long as there is no contradiction, the embodiments and features of the first node of this application can also be applied to the second node, and vice versa. As long as there is no contradiction, the embodiments and features of the embodiments of this application can be combined with each other at will.

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

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

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

[0105] Base stations may be fixed or mobile. For example, a helicopter or drone may be configured as a mobile base station, and one or more cells may move depending on the location of this mobile base station. In another example, a helicopter or drone may be configured as equipment for communicating with another base station.

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

[0107] Network equipment and user equipment may be configured on land, whether indoors or outdoors, handheld or vehicle-mounted, on water, or even in the air on an airplane, balloon, or satellite. The embodiments of this application do not limit the scenarios in which the network equipment and user equipment are located.

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

[0109] PRACH transmission coverage expansion

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

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

[0112] In most real-world deployment scenarios, the capabilities of user equipment are somewhat weaker than those of network equipment, making uplink coverage a bottleneck in extending the coverage of the communication system. Meanwhile, with advancements in communication technology, uplink services such as video uploading services in certain emerging vertical industry use cases are gradually increasing. In scenarios with a large number of uplink services, how to extend uplink coverage presents an even greater challenge.

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

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

[0115] In one possible embodiment, coverage of PRACH transmissions can be extended using multiple PRACH transmissions. That is, coverage of PRACH transmissions can be extended by repeated transmission of PRACH (for example, by transmitting a preamble multiple times in PRACH). In this application, the term "multiple PRACH transmissions" may be replaced with terms such as PRACH multi-transmission, PRACH transmission with preamble repetition, or multi-PRACH transmission with multiple preamble repetitions, but the embodiments of this application are not limited to these. In other words, the multiple PRACH transmissions referred to in this application may be replaced with at least one of PRACH multi-transmission, PRACH transmission with preamble repetition, or PRACH transmission with multiple preamble repetitions.

[0116] In the embodiments of the present invention, the multiple PRACH transmissions may be multiple PRACH transmissions using the same beam or multiple PRACH transmissions using different beams. Taking the example of multiple PRACH transmissions using the same beam, the 3rd generation partnership project (3GPP® registered trademark, hereafter omitted) Radio Access Network (RAN) 1#110bis-e meeting has already agreed: PRACH timings (or PRACH Occasions, PRACH Occasions, RACH timings, RACH Occasions) located in at least different time instances may be used for multiple PRACH transmissions using the same beam. Furthermore, the RAN1#110bis-e meeting has defined the number of multiple PRACH transmissions using the same beam (number of multi-PRACH transmissions / repetition factor), and this number may include at least 2, 4, or 8.

[0117] Mapping of synchronization signal blocks and PRACH timing associations

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

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

[0120] During the process of initial access or beam fault recovery, if the user equipment detects an SSB transmitted from a network device, it can obtain the SSB index of that SSB, thereby determining the time-domain location of the SSB and facilitating downlink synchronization with the network device. To achieve uplink synchronization, the user equipment needs to transmit a random access preamble (hereinafter abbreviated as preamble for brevity) to the network device. How the user equipment selects the preamble to transmit and at what PRACH timing the selected preamble should be transmitted are both determined by the user equipment based on the received (or detected) SSB.

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

[0122] In some embodiments, the SSB is mapped to the PRACH timings in the following order: firstly, in ascending order of preamble index within each PRACH timing; secondly, in ascending order of frequency domain resource index of frequency division multiplexed (or frequency multiplexed) PRACH timings; thirdly, in ascending order of time domain resource index of time division multiplexed PRACH timings within a PRACH slot; and finally, in ascending order of PRACH slot index.

[0123] Random access timing group

[0124] In some scenarios, a random access timing group (PRACH occasion group, ROG) is introduced to refer to a set containing multiple physical random access channel timings (PRACH occasions, RO), and so the ROG may be called an "RO set". The embodiments of this application do not limit the name of the ROG. For ease of explanation, the embodiments of this application will be described based on the ROG. The embodiments of this application do not limit the name of the physical random access channel timing, and for example, the physical random access channel timing may be called random access timing. For ease of explanation, the embodiments of this application will be described based on the physical random access channel timing, and the physical random access channel timing and random access timing referred to in the embodiments of this application may be interchangeable.

[0125] In one embodiment, the ROG may include ROs corresponding to multiple PRACHs transmitted in the same beam.

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

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

[0128] In one embodiment, all ROs within a single ROG can be associated with a single SSB. Naturally, in the embodiments of this application, a single ROG can be associated with multiple SSBs.

[0129] Random access response window (RAR window)

[0130] After a user device sends a random access preamble, subsequent user devices can monitor the RAR within the RAR window. Within the RAR window, if a user device does not detect or receive a RAR, it indicates that the user device's access failed.

[0131] In one embodiment, the size and / or position of the RAR window are configured (determined) by the network. That is, the network can determine the length and / or starting point of the RAR window. For example, the network can configure the length and / or starting point of the RAR window on user equipment through upper-layer signaling.

[0132] In one embodiment, the starting point of the RAR window can be located at the first multicarrier symbol of the Control Resource Set (CORESET) that the configured user equipment receives earliest, and this multicarrier symbol is located at least one multicarrier symbol interval after the last multicarrier symbol corresponding to RO. For example, in a single PRACH transmission solution, the starting point of the RAR window can be located at the first multicarrier symbol of the CORESET that the configured user equipment receives earliest.

[0133] In one embodiment, the length of the RAR window may be configured to a single uniform value, that is, the length of the RAR window may be a uniformly set value (e.g., X). In this case, any random access attempt (RACH attempt) can use this uniformly set value.

[0134] In one embodiment, the length of a uniformly set RAR window may be X times the length of the slot.

[0135] As one example, several conferences (e.g., 3GPP RAN1#112) have considered supporting only one RAR window for RAR monitoring for multiple PRACH transmissions in a single random access trial. In other words, the network does not configure a separate RAR window for each PRACH transmission in multiple PRACH transmissions; rather, multiple PRACH transmissions can share a single RAR window.

[0136] As one embodiment, the method for determining the starting point of the RAR window may differ for multiple PRACH transmissions in a single random access trial.

[0137] In one embodiment, in a solution for multiple PRACH transmissions, the starting point of the RAR window may be after the last multi-carrier symbol of the last RO in the multiple PRACH transmissions. In this case, the user device must wait until all multiple PRACHs have been transmitted before starting RAR monitoring, and thus this method can obtain the combined detection gain of the multiple PRACH transmissions.

[0138] In one embodiment, the RAR window may begin after the last multi-carrier symbol of the first RO in a multi-PRACH transmission. In this case, the user device does not need to wait for all PRACHs in a multi-PRACH transmission to be transmitted. If some of the PRACHs in a multi-PRACH transmission are accurately received by the network side, the user device can early terminate the multi-PRACH transmission to reduce random access delay and avoid occupying extra PRACH resources, thereby reducing the probability of collisions.

[0139] Currently, after a user device sends a random access preamble, subsequent user devices can monitor control signaling (e.g., RAR) sent from the network side within a time window (e.g., a RAR window). For multiple PRACH transmissions in a single random access attempt, how the length of this time window is determined remains a problem to be solved.

[0140] In a possible embodiment, the length of this time window can be set uniformly for multiple PRACH transmissions. However, this uniformly set time window length may not satisfy the configuration requirements for multiple PRACH transmissions. For example, when a short time window length is set uniformly, it may affect the detection performance of multiple PRACH transmissions with a large number of PRACHs. Alternatively, when a long time window length is set uniformly, it may result in a large random access delay for multiple PRACH transmissions with a small number of PRACHs. These will be explained in detail below with reference to Figures 2 and 3, respectively.

[0141] Figure 2 shows an example of a short time window that has been configured. In the example in Figure 2, the length of the configured time window is short, and in this case, for multiple PRACH transmissions with a large number of PRACHs, the end time of this time window cannot cover the last RO. As a result, the user device stops monitoring and control signaling, for example, stopping monitoring message 2 (Message2, Msg2), before the user device sends subsequent PRACHs, and therefore the desired detection effect cannot be achieved.

[0142] Figure 3 shows an example of a configured long time window. In the example in Figure 3, the configured time window is long, and in this case, for multiple PRACH transmissions with a small number of PRACHs, the user device can wait until this time window ends before performing the next operation, resulting in a large random access delay.

[0143] Alternatively, in multiple PRACH transmissions with a large number of PRACHs, there is a higher probability of encountering invalid ROs. To meet the requirement of a sufficient number of valid ROs, the time span between multiple PRACH transmissions may be increased, further extending the length of this uniformly set time window.

[0144] Alternatively, uniformly set time window lengths may cause poor performance in multiple PRACH transmissions, making PRACH transmissions a bottleneck in the coverage area of ​​the communication system (e.g., an NR system).

[0145] In summary, the question of how to determine the length of the time window that supports multiple PRACH transmissions remains a problem that needs to be solved.

[0146] To address the above problems, embodiments of the present invention provide a method and apparatus for a node for wireless communication, which can determine the length of a corresponding time window based on the number of PRACHs, thereby achieving one or more of the following objectives: satisfying the configuration requirements for time windows of multiple PRACH transmissions with different numbers of PRACHs, improving the performance gain transmitted by multiple PRACHs, increasing the coverage range of a communication system, reducing random access delay, or improving the utilization efficiency of random access resources.

[0147] This invention can be applied to multiple PRACH transmission scenarios, that is, it can achieve PRACH coverage extension using multiple repeated PRACH transmissions.

[0148] There may be multiple application scenarios for the present invention, for example, it can be applied to application scenarios in which the starting point of a time window is determined using various methods. In one embodiment, the technical solution of the present invention may have the starting point of a time window (i.e., the first time window referred to below) after the last multicarrier symbol of the last RO in a plurality of PRACH transmissions. In one embodiment, the technical solution of the present invention may have the starting point of a time window (i.e., the first time window referred to below) after the last multicarrier symbol of the first RO in a plurality of PRACH transmissions.

[0149] As one embodiment, the multiple PRACH transmissions referred to in this application may be multiple PRACH transmissions using the same beam, and the signal-to-noise ratio (SNR) gain is obtained by repeatedly transmitting multiple PRACHs on the same beam.

[0150] As one embodiment, the multiple PRACH transmissions referred to in this application may be multiple PRACH transmissions using different beams, and diversity gain is obtained by repeatedly transmitting multiple PRACHs with different beams.

[0151] The methods and apparatus of the present application will be described below with reference to several embodiments or examples. It should be understood that, in non-contradictory circumstances, the embodiments and features of the embodiments in the first node of the present application can be applied to the second node, and vice versa. In non-contradictory circumstances, the embodiments and features of the embodiments of the present application can be combined in any way.

[0152] Figure 4 is a flowchart of a method in a node for wireless communication according to one embodiment of the present invention. The method shown in Figure 4 may be performed by a first node. The first node may be any type of node capable of transmitting a random access preamble in a communication system.

[0153] In one embodiment, the first node may be a user device, for example, the user device 120 shown in Figure 1.

[0154] In one embodiment, the first node may be a network-controlled repeater (NCR).

[0155] In one embodiment, the first node may be a relay, for example, a relay terminal.

[0156] In one embodiment, the first node includes a first transmitter and a first receiver.

[0157] Referring to Figure 4, the method shown in Figure 4 may also include steps S410 and S420, which will be described below.

[0158] In step S410, multiple random access preambles are sent.

[0159] In one embodiment, multiple random access preambles are each sent via multiple PRACHs.

[0160] In one embodiment, multiple PRACH timings are used to transmit multiple random access preambles. In other words, multiple random access preambles are transmitted at multiple PRACH timings.

[0161] In one embodiment, multiple random access preambles are sent at multiple PRACH timings in multiple PRACHs.

[0162] In this application, multiple PRACH timings each correspond to multiple PRACH transmissions; in other words, in this application, multiple random access preambles each correspond to multiple PRACH transmissions.

[0163] In this application, the idea that multiple PRACH timings each correspond to multiple PRACH transmissions may be replaced with at least one of the following: multiple random access preambles each correspond to multiple PRACH transmissions; multiple PRACH timings each are used for multiple PRACH transmissions; multiple random access preambles each are used for multiple PRACH transmissions; multiple PRACHs each correspond to multiple PRACH transmissions; multiple PRACHs each are used for multiple PRACH transmissions; multiple PRACH transmissions include multiple random access preambles; multiple PRACH transmissions include the transmission of multiple random access preambles; and multiple PRACH transmissions include the transmission of multiple random access preambles with multiple PRACHs.

[0164] In one embodiment, multiple random access preambles are transmitted by a first node via a first transmitter.

[0165] In one embodiment, multiple random access preambles are transmitted from a first node to a second node. The second node may be a network device. Of course, the embodiments of this application are not limited thereto, and for example, multiple random access preambles may be transmitted from nodes other than the second node.

[0166] In one embodiment, multiple PRACH transmissions correspond to a single random access attempt (RACH attempt, or PRACH attempt).

[0167] In one embodiment, multiple PRACH transmissions are used for a single random access attempt.

[0168] As one embodiment, multiple PRACH transmissions include transmitting multiple random access preambles in a single random access attempt.

[0169] In step S420, the first control signaling is monitored within the first time window as a response to multiple PRACH transmissions.

[0170] In one embodiment, the first control signaling is monitored by the first receiver of the first node.

[0171] In one embodiment, the length of the first time window is related to the number of PRACH transmissions.

[0172] In one embodiment, the relationship between the length of the first time window and the number of PRACH transmissions may include, or be replaced by, using the number of PRACH transmissions to determine the length of the first time window.

[0173] As one example, the number of multiple PRACH transmissions refers to the number of PRACH transmissions in multiple PRACH transmissions.

[0174] In one embodiment, the number of multiple PRACH transmissions is equal to the number of multiple PRACHs. In other words, the length of the first time window is related to the number of multiple PRACHs, or to put it another way, the number of multiple PRACHs is used to determine the length of the first time window.

[0175] In one embodiment, the number of PRACH transmissions is equal to the number of random access preambles. In other words, the length of the first time window is related to the number of random access preambles, or to put it another way, the number of random access preambles is used to determine the length of the first time window.

[0176] As one embodiment, the number of PRACH transmissions is equal to the number of random access preambles in the multiple random access preambles transmitted by each of the 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 transmitted by each of the PRACHs, and to put it another way, the number of random access preambles in the multiple random access preambles transmitted by each of the PRACHs is used to determine the length of the first time window.

[0177] The embodiment of the present invention can determine the length of the first time window based on the number of PRACH transmissions, thereby satisfying the configuration requirements for time windows of multiple PRACH transmissions with different numbers of PRACHs, improving the performance gain of multiple PRACH transmissions, increasing the coverage range of the communication system, reducing random access delay, or improving the utilization efficiency of random access resources.

[0178] In one embodiment, the length of the first time window is determined by the first node based on the length of the candidate time window configured on the network side and the number of PRACH transmissions. How the first node determines the length of the first time window will be explained in detail below and will not be explained here.

[0179] In one embodiment, within a first time window, a user device can send a random access preamble to request access to the network, while the network can send a response before the first time window ends to facilitate the establishment of a connection between the user device and the network. Such a random access mechanism can contribute to reducing network congestion and collisions, thereby improving network efficiency and reliability.

[0180] The embodiments of this application do not limit the time domain units of the first time window. In one embodiment, the time domain unit of the first time window may be a slot. In another embodiment, the time domain unit of the first time window may be a multi-carrier symbol.

[0181] In other words, the embodiments of this application do not limit the granularity (or granularity) of the first time window. In one embodiment, the granularity of the first time window is slots. In one embodiment, the granularity of the first time window is multi-carrier symbols.

[0182] The embodiments of this application do not specifically limit the method for representing the length of the first time window. In one embodiment, the length of the first time window can be represented by a slot. In one embodiment, the length of the first time window can be represented by a multi-carrier symbol. In one embodiment, the length of the first time window can be represented by a subframe. In one embodiment, the length of the first time window can be represented in milliseconds. In one embodiment, the length of the first time window can be represented in seconds. The above-mentioned representation methods are merely examples, and the length of the first time window may be represented by other methods not listed.

[0183] The embodiments of this application do not specifically limit the length of the first time window. Hereinafter, the length of the first time window will be described using either slots or milliseconds as an example.

[0184] In one embodiment, the length of the first time window includes at least one slot, for example, five slots, ten slots, etc. In other words, the length of the first time window includes multiple slots, for example, two or more slots.

[0185] In one embodiment, the length of the first time window is 10 milliseconds or less.

[0186] In one embodiment, the length of the first time window is 40 milliseconds or less.

[0187] Naturally, the length of the first time window may be any other value, and the embodiments of this application are not limited to this.

[0188] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last random access timing in multiple PRACH transmissions.

[0189] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last PRACH timing in multiple PRACH timings.

[0190] In one embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the last random access timing in the multiple random access timings included in the first random access timing group, and each of the multiple random access timings included in the first random access timing group corresponds to multiple PRACH transmissions. A detailed description of the first random access timing group can be found in a later description.

[0191] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first random access timing in multiple PRACH transmissions.

[0192] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first PRACH timing in multiple PRACH timings.

[0193] In one embodiment, the starting point of the first time window is located after the last multi-carrier symbol of the first random access timing in the multiple random access timings included in the first random access timing group, and each of the multiple random access timings included in the first random access timing group corresponds to multiple PRACH transmissions.

[0194] In one embodiment, the first time window is a random access response window (RAR window).

[0195] In one embodiment, the first time window is used to receive a Random Access Response (RAR).

[0196] In one embodiment, the use of the first time window to receive random access responses may include, or be replaced by, monitoring random access responses within the first time window.

[0197] In one embodiment, the random access response includes a first control signaling. That is, the first time window may 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.

[0198] In one embodiment, the first time window is used to receive message 2 in the random access step.

[0199] In one embodiment, the use of the first time window to receive message 2 in a random access step may include, or be replaced by, monitoring message 2 within the first time window.

[0200] In one embodiment, message 2 includes a first control signaling. That is, the first time window may be used to receive the first control signaling in message 2, or to monitor the first control signaling in message 2 within the first time window.

[0201] The embodiments of this application do not limit the specific form of the first control signaling, and the first control signaling will be described in detail below.

[0202] As one embodiment, the first control signaling is scrambled to ensure the safety and reliability of data transmission. For example, the first control signaling is scrambled by the first RNTI. The scrambling of the first control signaling by the first RNTI will be explained in detail later, and for the sake of brevity, the explanation is omitted here.

[0203] In one embodiment, the first control signaling is transmitted from the second node to the first node, and the second node may be a network device.

[0204] In one embodiment, the first control signaling includes downlink control information (DCI).

[0205] In one embodiment, the first control signaling is DCI.

[0206] In one embodiment, the first control signaling includes the DCI format.

[0207] In one embodiment, the first control signaling includes DCI format and cyclic redundancy check (CRC).

[0208] In one embodiment, the first control signaling includes DCI format and CRC, and the CRC is scrambled by the first RNTI. Details of the first RNTI will be described in detail later and are omitted here.

[0209] In one embodiment, when the first control signaling includes DCI, the embodiments of the present application do not specifically limit the format of the DCI. For example, the first control signaling may include DCI format 1_0. Alternatively, the first control signaling may include other DCI formats, such as DCI format 2_0.

[0210] In one embodiment, the first control signaling includes DCI format 1_0 and CRC.

[0211] In one embodiment, the first control signaling includes DCI format 1_0 and CRC, and the CRC is scrambled by the first RNTI.

[0212] The first control signaling may include other signalings besides DCI, and the embodiments of this application are not limited thereto.

[0213] In one embodiment, the first control signaling includes a higher-layer signaling, or the first control signaling includes a further higher-layer signaling.

[0214] The embodiments of this application are not limited to upper-layer signaling or further upper-layer signaling. In one embodiment, the first control signaling includes radio resource control (RRC) layer signaling. In another embodiment, the first control signaling includes medium access control (MAC) layer signaling.

[0215] The above explains the case where multiple PRACH transmissions correspond to multiple random access preambles, and the following explains the case where multiple PRACH transmissions correspond to multiple random access timings.

[0216] In one embodiment, the first random access timing group includes multiple random access timings, each of which corresponds to multiple PRACH transmissions.

[0217] As one embodiment, multiple random access timings included in the first random access timing group are each used for multiple PRACH transmissions.

[0218] As one embodiment, multiple random access timings included in the first random access timing group are used in a single random access trial.

[0219] In one embodiment, multiple random access timings included in the first random access timing group are each used to transmit multiple random access preambles.

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

[0221] As one embodiment, multiple random access timings included in the first random access timing group each include multiple PRACHs.

[0222] In one embodiment, multiple PRACHs are located in multiple random access timings, each belonging to a first random access timing group.

[0223] In one embodiment, the number of PRACH transmissions is equal to the number of random access timings included in the first random access timing group.

[0224] In this application, the number of random access timings included in the first random access timing group may include, or be replaced by, at least one of the number of random access preambles transmitted in the first random access timing group and the number of PRACH transmissions in the multiple PRACH transmissions based on the first random access timing group.

[0225] In this application, multiple random access timings may include or be replaced by at least one of multiple PRACH occasions, multiple RACH occasions, or multiple PRACH transmission occasions.

[0226] As one example, multiple random access timings included in the first random access timing group are time-division multiplexed (TDM).

[0227] In one embodiment, at least two of the random access timings included in the first random access timing group have different starting positions in the frequency domain.

[0228] As one embodiment, any two random access timings included in the first random access timing group have the same starting position in the frequency domain.

[0229] The embodiments of this application do not limit the frequency domain units in the frequency domain of any two random access timings among a plurality of random access timings included in the first random access timing group. In one embodiment, the frequency domain unit in the frequency domain of any two random access timings may be a resource block (RB). In another embodiment, the frequency domain unit in the frequency domain of any two random access timings may be a resource element (RE).

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

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

[0232] As one embodiment, any of the multiple random access timings included in the first random access timing group includes at least one multicarrier symbol in the time domain, and / or any of these random access timings includes at least one RB in the frequency domain.

[0233] In one embodiment, a random access timing in a plurality of random access timings included in a first random access timing group includes at least one multicarrier symbol in the time domain and / or this random access timing includes at least one RB in the frequency domain. Naturally, embodiments of the present application do not limit the granularity of the time-frequency resources occupied by the random access timing.

[0234] As one embodiment, multiple random access timings included in a first random access timing group belong to multiple PRACH slots. For example, each random access timing in the multiple random access timings included in the first random access timing timing group belongs to one of the multiple PRACH slots. Alternatively, for example, some random access timings in the multiple random access timings included in the first random access timing timing group belong to one of the multiple PRACH slots.

[0235] In one embodiment, one of the multiple random access timings included in the first random access timing group occupies multiple multicarrier symbols in the time domain. Naturally, in the embodiment of the present application, one of the multiple random access timings included in the first random access timing group occupies multiple multicarrier symbols in the time domain.

[0236] In one embodiment, one of the multiple random access timings included in the first random access timing group occupies multiple uplink symbols in the time domain. Naturally, in the embodiment of the present application, one of the multiple random access timings included in the first random access timing group occupies multiple uplink symbols in the time domain.

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

[0238] In one embodiment, all random access timings in a plurality of random access timings included in a first random access timing group belong to one PRACH slot in the time domain. Naturally, in embodiments of the present application, some random access timings in a plurality of random access timings included in a first random access timing group belong to one PRACH slot in the time domain, and embodiments of the present application are not limited thereto.

[0239] As mentioned above, the first control signaling may be scrambled by the first RNTI, which will be explained in detail below.

[0240] In one embodiment, the first RNTI is associated with multiple PRACH timings.

[0241] As one embodiment, the first RNTI is an RNTI that corresponds to multiple PRACH timings.

[0242] In one embodiment, the CRC of the first control signaling is scrambled by the first RNTI.

[0243] The embodiments of this application do not specifically limit the implementation of the first RNTI; the first RNTI only needs to uniquely identify a single user device and prevent malicious attackers from interfering with network communications by mimicking the RNTI identifier. In other words, in this application, each user device has a different first RNTI, in order to distinguish between different user devices. The first RNTI will be described illustratively below.

[0244] In one embodiment, the first RNTI is a single RNTI.

[0245] As one example, the first RNTI includes a random access-RNTI (RA-RNTI). In other words, the first RNTI includes a four-step random access RNTI.

[0246] As one 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.

[0247] In one embodiment, the first RNTI is associated with multiple PRACH transmissions.

[0248] In one embodiment, the first RNTI is associated with the first random access timing group.

[0249] In one embodiment, the first RNTI is associated with one of several random access timings included in the first random access timing group. For example, the first RNTI may be associated with any of several random access timings included in the first random access timing group.

[0250] In one embodiment, the first RNTI is associated with the first random access timing among multiple random access timings included in the first random access timing group.

[0251] In one embodiment, the first RNTI is associated with the last random access timing among multiple random access timings included in the first random access timing group.

[0252] In one embodiment, the first RNTI is associated with the first random access timing in the time domain among multiple random access timings included in the first random access timing group.

[0253] In one embodiment, the first RNTI is associated with the last random access timing in the time domain among multiple random access timings included in the first random access timing group.

[0254] As one example, the first RNTI is associated with the reference random access timing. The reference random access timing is described below in an illustrative manner.

[0255] As one embodiment, the reference random access timing is one of several random access timings included in the first random access timing group. For example, the reference random access timing may be any of several random access timings included in the first random access timing group.

[0256] As one embodiment, the reference random access timing is the first random access timing in the time domain among multiple random access timings included in the first random access timing group.

[0257] As one embodiment, the reference random access timing is the last random access timing in the time domain among multiple random access timings included in the first random access timing group.

[0258] However, this application is not limited thereto, and the reference random access timing may be any random access timing other than the multiple random access timings included in the first random access timing group. For example, the reference random access timing may be any random access timing other than the multiple random access timings included in the first random access timing group.

[0259] The following will explain in detail the relationship between the length of the first time window and the number of PRACH transmissions, and will provide an illustrative explanation of how to determine the length of the first time window based on the number of PRACH transmissions. First, we will explain the relationship between the length of the first time window and the number of PRACH transmissions.

[0260] In one embodiment, the length of the first time window and the number of PRACH transmissions are linearly related. That is, the length of the first time window may change linearly depending on the number of PRACH transmissions.

[0261] In one embodiment, the length of the first time window may increase with increasing numbers of PRACH transmissions, or it may remain unchanged. For example, the length of the first time window may increase with increasing numbers of PRACH transmissions. Alternatively, the length of the first time window may not change with increasing numbers of PRACH transmissions.

[0262] In other words, the length of the first time window decreases or remains unchanged as the number of PRACH transmissions decreases. For example, the length of the first time window may decrease as the number of PRACH transmissions decreases. Alternatively, the length of the first time window may not change as the number of PRACH transmissions decreases.

[0263] In one embodiment, the length of the first time window is proportional to the number of PRACH transmissions. For example, if the length of the first time window increases with an increase in the number of PRACH transmissions, the length of the first time window increases proportionally to the number of PRACH transmissions. Alternatively, if the length of the first time window decreases with a decrease in the number of PRACH transmissions, the length of the first time window decreases proportionally to the number of PRACH transmissions.

[0264] In one embodiment, the length of the first time window and the number of random access timings included in the first random access timing group are linearly related.

[0265] In one embodiment, the length of the first time window increases or remains unchanged as the number of random access timings included in the first random access timing group increases.

[0266] In one embodiment, the length of the first time window increases with increasing number of random access timings included in the first random access timing group.

[0267] In one embodiment, the length of the first time window does not change as the number of random access timings included in the first random access timing group increases.

[0268] In one embodiment, the length of the first time window decreases or remains unchanged as the number of random access timings included in the first random access timing group decreases.

[0269] In one embodiment, the length of the first time window decreases as the number of random access timings included in the first random access timing group decreases.

[0270] In one embodiment, the length of the first time window does not change as the number of random access timings included in the first random access timing group decreases.

[0271] As one embodiment, the length of the first time window is proportional to the number of random access timings included in the first random access timing group. For example, if the length of the first time window increases with an increase in the number of random access timings included in the first random access timing group, the length of the first time window increases in proportion to the number of random access timings included in the first random access timing group. Alternatively, if the length of the first time window decreases with a decrease in the number of random access timings included in the first random access timing group, the length of the first time window decreases in proportion to the number of random access timings included in the first random access timing group.

[0272] Thus, in the embodiments of the present invention, for multiple PRACH transmissions with a large number of PRACHs, the first node can select a long first time window length, which is advantageous in ensuring the effective detection of multiple PRACHs. For multiple PRACH transmissions with a small number of PRACHs, the first node can select a short first time window length, which is advantageous in reducing random access delay.

[0273] As one embodiment, the number of random access timings included in the first random access timing group is equal to the number of PRACH transmissions.

[0274] In one embodiment, the number of random access timings included in the first random access timing group is equal to the number of PRACHs.

[0275] In one embodiment, the number of random access timings included in the first random access timing group is equal to the number of random access preambles.

[0276] In the embodiments of this application, the number of random access timings included in the first random access timing group may include, or be replaced by, at least one of the following: the number of PRACH transmissions, the number of PRACHs, or the number of random access preambles.

[0277] As one embodiment, the number of random access timings included in the first random access timing group is used to determine the length of the first time window.

[0278] The following provides an illustrative explanation of how to determine the length of the first time window based on the number of PRACH transmissions.

[0279] Embodiment 1:

[0280] In one embodiment, the length of the first time window is one of several candidate time lengths, the number of PRACH transmissions is one of several candidate numbers, and the number of PRACH transmissions is used to determine the length of the first time window from the several candidate time lengths.

[0281] In one embodiment, multiple candidate time lengths correspond one-to-one with multiple candidate numbers.

[0282] In one embodiment, one of the multiple candidate time lengths corresponds to one or more of the multiple candidate numbers. For example, one of the multiple candidate time lengths corresponds to at least two of the multiple candidate numbers. In other words, one of the multiple candidate time lengths is shared by one or more of the multiple candidate numbers.

[0283] In one embodiment, the length of the first time window is one of several candidate time lengths, the number of multiple PRACH transmissions is one of several candidate numbers, the multiple candidate time lengths correspond one-to-one with the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more of the multiple candidate numbers.

[0284] As an example, the number of multiple PRACH transmissions is used to determine the length of the first time window from multiple candidate time lengths.

[0285] As an example, the length of the first time window is one of the multiple candidate time lengths, the number of multiple random access timings included in the first random access timing group is one of the multiple candidate numbers, 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 of the multiple candidate numbers, and the number of multiple random access timings included in the first random access timing group is used to determine the length of the first time window from the multiple candidate time lengths.

[0286] As an example, the length of the first time window is one of the multiple candidate time lengths, the number of multiple random access timings included in the first random access timing group is one of the multiple candidate numbers, 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 of the multiple candidate numbers. In other words, one of the multiple candidate time lengths is shared by one or more of the multiple candidate numbers.

[0287] As an example, the number of multiple random access timings included in the first random access timing group is used to determine the length of the first time window from the multiple candidate time lengths.

[0288] The embodiments of the present application do not specifically limit the number of multiple candidate time lengths. For example, the multiple candidate time lengths may be two candidate time lengths or three or more candidate time lengths.

[0289] As an example, 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.

[0290] As one sub-embodiment of the above embodiment, the first time length includes at least one slot.

[0291] As one sub-embodiment of the above embodiment, the second time length includes at least one slot.

[0292] However, the embodiments of the present application are not limited thereto, and the granularity of the first time length and / or second time length may be in other forms, such as milliseconds, multicarrier symbols, etc. For example, the first time length may include at least 1 millisecond, the second time length may include at least 1 millisecond, the first time length may include at least 14 multicarrier symbols, the second time length may include at least 14 multicarrier symbols, and so on.

[0293] As one sub-example of the above embodiment, the first time length is smaller than the second time length.

[0294] As one sub-example of the above embodiment, the first time length is greater than the second time length.

[0295] As one sub-example of the above embodiment, the second time length is a multiple of the first time length. For example, it may be an integer multiple such as 2 times or 3 times. Alternatively, the multiple may be a multiple greater than 1, such as 2 times or 2.5 times. Alternatively, the multiple may be a multiple greater than 0 and less than 1, such as 0.5 times or 0.8 times.

[0296] As one sub-example of the above embodiment, the second time length is the sum of the first time length and at least one slot.

[0297] As one sub-embodiment of the above embodiment, the first time length includes one slot.

[0298] As one sub-embodiment of the above embodiment, the second time length includes two slots.

[0299] As one sub-embodiment of the above embodiment, the first time length includes 10 slots, and the second time length includes 15 slots.

[0300] As one sub-example of the above embodiment, when the number of PRACH transmissions is two, the length of the first time window is the first time length, and when the number of PRACH transmissions is four, the length of the first time window is the second time length.

[0301] As one sub-embodied example of the above embodiment, when the first random access timing group includes two random access timings, the length of the first time window is the first time length, and when the first random access timing group includes four random access timings, the length of the first time window is the second time length.

[0302] As one sub-example of the above embodiment, when the number of PRACH transmissions is 2, the length of the first time window is the first time length, and when the number of PRACH transmissions is 8, the length of the first time window is the second time length.

[0303] As one sub-example of the above embodiment, when the first random access timing group includes two random access timings, the length of the first time window is the first time length, and when the first random access timing group includes eight random access timings, the length of the first time window is the second time length.

[0304] As one sub-example of the above embodiment, when the number of PRACH transmissions is four, the length of the first time window is the first time length, and when the number of PRACH transmissions is eight, the length of the first time window is the second time length.

[0305] As one sub - embodiment of the above - mentioned embodiment, when the first random access timing group includes four random access timings, the length of the first time window is the first time length; when the first random access timing group includes eight random access timings, the length of the first time window is the second time length.

[0306] As one sub - embodiment of the above - mentioned embodiment, when the number of multiple PRACH transmissions is two, the length of the first time window is the first time length; when the number of multiple PRACH transmissions is four, the length of the first time window is the first time length; when the number of multiple PRACH transmissions is eight, the length of the first time window is the second time length.

[0307] As one sub - embodiment of the above - mentioned embodiment, when the first random access timing group includes two random access timings, the length of the first time window is the first time length; when the first random access timing group includes four random access timings, the length of the first time window is the first time length; when the first random access timing group includes eight random access timings, the length of the first time window is the second time length.

[0308] As one sub - embodiment of the above - mentioned embodiment, when the number of multiple PRACH transmissions is two, the length of the first time window is the first time length; when the number of multiple PRACH transmissions is four, the length of the first time window is the second time length; when the number of multiple PRACH transmissions is eight, the length of the first time window is the second time length.

[0309] As one sub - embodiment of the above - mentioned embodiment, when the first random access timing group includes two random access timings, the length of the first time window is the first time length; when the first random access timing group includes four random access timings, the length of the first time window is the second time length; when the first random access timing group includes eight random access timings, the length of the first time window is the second time length.

[0310] In one embodiment, the multiple candidate time lengths include a first time length, a second time length, and a third time length, where the first time length, second time length, and third time length are all different.

[0311] As one sub-example of the above embodiment, when the number of PRACH transmissions is 2, the length of the first time window is the first time length; when the number of PRACH transmissions is 4, the length of the first time window is the second time length; and when the number of PRACH transmissions is 8, the length of the first time window is the third time length.

[0312] As one sub-example of the above embodiment, when the first random access timing group includes two random access timings, the length of the first time window is the first time length; when the first random access timing group includes four random access timings, the length of the first time window is the second time length; and when the first random access timing group includes eight random access timings, the length of the first time window is the third time length.

[0313] Embodiment 2:

[0314] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups contains at least one time length, the number of plurality of PRACH transmissions is one of a plurality of candidate numbers, and the number of plurality of PRACH transmissions is used to determine the candidate time length group to which the length of the first time window belongs from among the plurality of candidate time length groups.

[0315] In one embodiment, multiple candidate time length groups correspond one-to-one with multiple candidate numbers.

[0316] In one embodiment, one of the candidate time length groups corresponds to one or more of the candidate numbers. For example, one of the candidate time length groups corresponds to at least two of the candidate numbers. Alternatively, one of the candidate time length groups is shared by one or more of the candidate numbers.

[0317] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups contains at least one time length, the number of plurality of PRACH transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers.

[0318] In one embodiment, 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 among multiple candidate time length groups.

[0319] In one 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 among multiple candidate time length groups, if the candidate time length group to which the length of the first time window belongs, determined based on the number of PRACH transmissions, contains only one time length, the length of the first time window may be this one time length included in the candidate time length group to which the length of the first time window belongs. If the candidate time length group to which the length of the first time window belongs, determined based on the number of PRACH transmissions, contains multiple time lengths, in one embodiment, the length of the first time window can be further determined from the multiple time lengths included in the candidate time length group to which the length of the first time window belongs, based on the number of PRACH transmissions. For a 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 length of the first time window belongs, based on the number of PRACH transmissions, refer to Embodiment 1 in the preceding paragraph, and the explanation will be omitted here.

[0320] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups contains at least one time length, the number of plurality of random access timings included in the first random access timing group is one of a plurality of candidate numbers, and the number of plurality of random access timings 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 among the plurality of candidate time length groups.

[0321] In one embodiment, multiple candidate time length groups correspond one-to-one with multiple candidate numbers.

[0322] In one embodiment, one of a group of candidate time lengths corresponds to one or more of a group of candidate numbers. For example, one of a group of candidate time lengths corresponds to at least two of a group of candidate numbers. In other words, one of a group of candidate time lengths is shared by one or more of a group of candidate numbers.

[0323] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups includes at least one time length, the number of plurality of random access timings included in the first random access timing group is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers.

[0324] As one embodiment, the number of random access timings 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 among multiple candidate time length groups.

[0325] In one embodiment, the number of random access timings included in the first random access timing group is used to determine which candidate time length group to which the length of the first time window belongs from among several candidate time length groups. If the candidate time length group to which the length of the first time window belongs, determined based on the number of random access timings included in the first random access timing group, contains only one time length, then the length of the first time window may be this one time length included in the candidate time length group to which the length of the first time window belongs. If the candidate time length group to which the length of the first time window belongs, determined based on the number of random access timings included in the first random access timing group, contains multiple time lengths, in one embodiment, the length of the first time window can be further determined from the multiple time lengths included in the candidate time length group to which the length of the first time window belongs, based on the number of random access timings included in the first random access timing group. For a 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 length of the first time window belongs, based on the number of random access timings included in the first random access timing group, refer to Embodiment 1 in the preceding paragraph, and the explanation will be omitted here.

[0326] Embodiment 3:

[0327] In one embodiment, the first node can receive only 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.

[0328] In one embodiment, the first coefficient is related to the number of PRACH transmissions.

[0329] In one embodiment, the first coefficient relates to the number of random access timings included in the first random access timing group.

[0330] In one embodiment, the first coefficient is determined based on the number of PRACH transmissions.

[0331] In one embodiment, the first coefficient is determined based on the number of random access timings included in the first random access timing group.

[0332] In one embodiment, the first coefficient and the number of PRACH transmissions are linearly related.

[0333] In one embodiment, the first coefficient and the number of random access timings included in the first random access timing group are linearly related.

[0334] In one embodiment, the first coefficient may increase or remain unchanged as the number of PRACH transmissions increases.

[0335] In one embodiment, the first coefficient increases or remains unchanged as the number of random access timings included in the first random access timing group increases.

[0336] In one embodiment, the first coefficient increases with increasing number of PRACH transmissions.

[0337] In one embodiment, the first coefficient increases with increasing number of random access timings included in the first random access timing group.

[0338] In one embodiment, the first coefficient is proportional to the number of PRACH transmissions.

[0339] In one embodiment, the first coefficient is proportional to the number of random access timings included in the first random access timing group.

[0340] In one embodiment, the first coefficient is equal to the number of PRACH transmissions.

[0341] In one embodiment, the first coefficient is equal to the number of random access timings included in the first random access timing group.

[0342] In one embodiment, the first coefficient is equal to the number of PRACHs in multiple PRACH transmissions.

[0343] In one embodiment, the first coefficient is a positive integer. However, the embodiments of this application are not limited to this, and the first coefficient may be any number, such as a number greater than 0 and less than 1, or a non-integer greater than 1.

[0344] In one embodiment, the first coefficient includes at least one slot. However, the embodiments of the present application are not limited thereto, and the first coefficient may include at least one multicarrier symbol, at least 1 millisecond, etc.

[0345] In one embodiment, the first coefficient is a fixed value. However, the embodiments of the present application are not limited thereto, and in some embodiments, the first coefficient may be a variable value.

[0346] In one embodiment, the first coefficient is comprised of further upper-layer signaling. For example, the first coefficient is comprised of RRC layer signaling, or the first coefficient is comprised of MAC layer signaling. In other words, the first coefficient is bearered by RRC signaling, or the first coefficient is bearered by MAC CE signaling.

[0347] In one embodiment, the length of the first time window is equal to the sum of one candidate time length and the first coefficient.

[0348] In one embodiment, the length of the first time window is equal to the sum of one candidate time length and the first coefficient number of slots.

[0349] In one embodiment, the length of the first time window is equal to the product of one candidate time length and the first coefficient.

[0350] As mentioned above, the length of the first time window may be determined from multiple candidate time lengths or based on one candidate time length. The configuration of these multiple candidate time lengths and / or one candidate time length will be described below.

[0351] Figure 5 is a flowchart of a method in a node for wireless communication according to another embodiment of the present application. The method shown in Figure 5 can be performed by a first node. The method shown in Figure 5 may include step S510.

[0352] In step S510, the first configuration information is received.

[0353] In one embodiment, the first configuration information may be received by the first receiver of the first node.

[0354] In one embodiment, the first configuration information may be transmitted by a second node. Naturally, in the embodiments of the present application, the first configuration information may also be transmitted by other nodes, and the embodiments of the present application are not limited thereto.

[0355] In one embodiment, the first configuration information may be comprised of further upper-layer signaling or upper-layer signaling. In other words, the first configuration information may be bearered to further upper-layer signaling or upper-layer signaling. For example, the first configuration information may be comprised of RRC layer signaling. Alternatively, the first configuration information may be comprised of MAC layer signaling.

[0356] In one embodiment, the first configuration information and the number of PRACH transmissions are used together to determine the length of the first time window.

[0357] As one embodiment, the first configuration information is used to configure a PRACH resource pool for multiple PRACH transmissions.

[0358] In one embodiment, the first configuration information includes at least two candidate time lengths (or multiple candidate time lengths), and the number of 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.

[0359] In one embodiment, the number of multiple PRACH transmissions corresponds to one of multiple candidate time length groups, and any of 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 one candidate time length group corresponding to the number of multiple PRACH transmissions in the multiple candidate time length groups.

[0360] In one embodiment, the number of random access timings included in the first configuration information and the first random access timing group is used together to determine the length of the first time window.

[0361] In one embodiment, the first configuration information includes at least two candidate time lengths (or multiple candidate time lengths), and the number of multiple random access timings included in the first random access timing 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.

[0362] In one embodiment, the number of random access timings included in the first random access timing group corresponds to one of several candidate time length groups, and any of the 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 one candidate time length group that corresponds to the number of random access timings included in the first random access timing group in the several candidate time length groups.

[0363] Figure 6 is a flowchart of a method in a node for wireless communication according to another embodiment of the present application. The method shown in Figure 6 can be performed by a first node. The method shown in Figure 6 may include step S610.

[0364] In step S610, the second configuration information is received.

[0365] In one embodiment, the second configuration information may be received by the first receiver of the first node.

[0366] In one embodiment, the second configuration information may be transmitted by a second node. Naturally, in the embodiments of the present application, the second configuration information may be transmitted by other nodes, and the embodiments of the present application are not limited thereto.

[0367] In one embodiment, the first configuration information may be comprised of further upper-layer signaling or upper-layer signaling. In other words, the first configuration information may be bearered to further upper-layer signaling or upper-layer signaling. For example, the first configuration information may be comprised of RRC layer signaling. Alternatively, the first configuration information may be comprised of MAC layer signaling.

[0368] In one embodiment, the second configuration information is used to configure a PRACH resource pool for multiple PRACH transmissions. In one embodiment, the PRACH resource pool is the PRACH timing or random access preamble mentioned in the preceding paragraph.

[0369] In one embodiment, the second configuration information includes one candidate time length.

[0370] In one embodiment, the second configuration information includes one candidate time length, and the length of the first time window is determined based on the one candidate time length and a first coefficient.

[0371] In one embodiment, the length of the first time window is equal to the sum of one candidate time length included in the second configuration information and the first coefficient.

[0372] In one embodiment, the length of the first time window is equal to the sum of one candidate time length included in the second configuration information and the first coefficient number of slots.

[0373] In one embodiment, the length of the first time window is equal to the product of one candidate time length included in the second configuration information and the first coefficient.

[0374] For a detailed explanation of the first coefficient, please refer to the preceding text. For brevity, the explanation will be omitted here.

[0375] In some scenarios, a single time instance may contain multiple random access timings, and the length of the first time window corresponding to this time instance can be related to the number of random access timings within that time instance. This point is illustrated with reference to Figure 7.

[0376] In the embodiments of this application, the time period is not specifically limited. In one embodiment, the time period may include one PRACH slot. In one embodiment, the time period may include one multicarrier symbol. In one embodiment, the time period may include multiple multicarrier symbols.

[0377] Figure 7 is a flowchart of a method in a node for wireless communication according to another embodiment of the present application. The method shown in Figure 7 can be performed by a first node. The method shown in Figure 7 may include step S710.

[0378] In step S710, the first piece of information is received.

[0379] In one embodiment, the first information may be received by the first receiver of the first node.

[0380] In one embodiment, the first information may be transmitted by a second node. Naturally, in the embodiments of the present application, the first configuration information may be transmitted by other nodes, and the embodiments of the present application are not limited thereto.

[0381] In one embodiment, the first information is used to indicate the number of at least one random access timings within a single time period.

[0382] In one embodiment, multiple random access timings within a time period are frequency-division multiplexed. Alternatively, multiple random access timings within a time period are orthogonal in the time domain.

[0383] As one embodiment, if the number of at least one random access timings within a time period is greater than 1, multiple random access timings within that time period are frequency-division multiplexed. Alternatively, if the number of at least one random access timings within a time period is greater than 1, multiple random access timings within that time period are orthogonal in the time domain.

[0384] In one embodiment, the length of the first time window is related to the number of at least one random access timings within the time period.

[0385] In one embodiment, the number of at least one random access timings within a time period is used to determine the length of the first time window.

[0386] In one embodiment, the length of the first time window and the number of at least one random access timings within the time period are linearly related.

[0387] In one embodiment, the length of the first time window increases or remains unchanged as the number of at least one random access timings within the time period increases.

[0388] In one embodiment, the length of the first time window is proportional to the number of at least one random access timings within the time period.

[0389] In the embodiments of the present application, the relationship between the first random access timing group and the time zone is not limited. In some embodiments, all random access timings in the first random access timing group may be located within one time zone (i.e., the above time zone). In some other embodiments, any two random access timings in the first random access timing group may each be in two different time zones. For example, each random access timing in the first random access timing group may be in a different time zone. Naturally, in the embodiments of the present application, two random access timings in the first random access timing group may each be in two different time zones, and correspondingly, other random access timings in the first random access timing group other than those two may be in the same time zone, and the other random access timings may include one or more random access timings.

[0390] In the embodiment of the present invention, the two random access timings (any two random access timings, or two random access times) can be replaced with two random access timings (any two random access timings, or two random access times) in two different time periods, thereby occupying two different time periods.

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

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

[0393] As one embodiment, each of at least two of the multiple random access timing groups includes one or more different random access timings. In other words, at least one of the multiple random access timings included in each of at least two of the multiple random access timing groups is a different random access timing.

[0394] Furthermore, the fact that at least one of the multiple random access timings included in the at least two random access timing groups is different can also be understood as meaning that all of the multiple random access timings included in the at least two random access timing groups are different. Naturally, in the embodiments of this application, it can also be understood as meaning that some of the multiple random access timings included in the at least two random access timing groups are different.

[0395] Furthermore, the embodiments of this application do not limit the random access timing groups in which different random access timings reside. In one embodiment, multiple random access timings included in any two random access timing groups among a plurality of random access timing groups include at least one different random access timing. In another embodiment, multiple random access timings included in two random access timing groups within a plurality of random access timing groups include at least one different random access timing.

[0396] Naturally, in the embodiments of the present invention, the multiple random access timings included in all of the multiple random access timing groups may be exactly the same.

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

[0398] As one embodiment, the first random access timing group includes two random access timings.

[0399] As one embodiment, the first random access timing group includes four random access timings.

[0400] As one embodiment, the first random access timing group includes eight random access timings.

[0401] In one embodiment, multiple random access timing groups each correspond to multiple preambles, and at least two of the multiple random access timing groups have different preambles.

[0402] Furthermore, the fact that the preambles corresponding to at least two of the above random access timing groups are different can be understood as meaning that in multiple random access timing groups, the preamble corresponding to each random access timing group is different. Naturally, in the embodiments of the present invention, it can also be understood as meaning that the preambles corresponding to some of the random access timing groups in multiple random access timings included in at least two random access timing groups are different.

[0403] In one embodiment, multiple first-type sequences are used to generate multiple preambles, each corresponding to multiple random access timing groups.

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

[0405] As one embodiment, two first type sequences in a plurality of first type sequences are different. As another embodiment, the initial values ​​of two first type sequences in a plurality of first type sequences are different. As another embodiment, the cyclic shifts of two first type sequences in a plurality of first type sequences are different. Naturally, in the embodiments of the present application, the initial values ​​and cyclic shifts of two first type sequences in a plurality of first type sequences are all different. Or, the initial values ​​of two first type sequences in a plurality of first type sequences are the same, but the cyclic shifts of these two first type sequences are all different. Or, the initial values ​​of two first type sequences in a plurality of first type sequences are different, but the cyclic shifts of these two first type sequences are the same.

[0406] The above describes the multiple random access timing groups in the embodiments of the present application, and below, the method for determining the multiple random access timings included in the first random access timing group in the embodiments of the present application will be described.

[0407] In one embodiment, the number of random access timings included in the first random access timing group may 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 further include the step of receiving the first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of random access timings included in the first random access timing group.

[0408] In the embodiments of this application, the reception quality for the first synchronization signal block is not limited. In one embodiment, the reception quality for the first synchronization signal block includes reference signal receiving power (RSRP). In one embodiment, the reception quality for the first synchronization signal block includes SS-RSRP (or SSB-RSRP). In one embodiment, the reception quality for the first synchronization signal block includes CSI-RSRP.

[0409] As one example, the definition of SS-RSRP is given in section 5.1.1 of 3GPP TS38.215.

[0410] As one example, the definition of CSI-RSRP is found in section 5.1.2 of 3GPP TS38.215.

[0411] In one embodiment, the reception quality for the first synchronization signal block includes reference signal receiving quality (RSRQ). In another embodiment, the reception quality for the first synchronization signal block includes SS-RSRQ.

[0412] As one example, the definition of SS-RSRP is given in section 5.1.5 of 3GPP TS38.215.

[0413] In one embodiment, the reception quality for the first synchronization signal block includes the signal-to-interference plus noise ratio (SINR). In another embodiment, the reception quality for the first synchronization signal block includes the SS-SINR.

[0414] As one example, the definition of SS-RSRP is given in section 5.1.5 of 3GPP TS38.215.

[0415] In the embodiments of the present application, the first synchronization signal block may be transmitted by a network device, and, taking the second node as an example, the first synchronization signal block may be transmitted by the second node. Also in the embodiments of the present application, the first synchronization signal block is also called a synchronization signal / physical broadcast channel block (SS / PBCHblock).

[0416] In one embodiment, multiple beams are used to transmit multiple preambles corresponding to the first random access timing group in each first random access timing group, and the multiple beams are the same. Naturally, in the embodiments of the present invention, some or all of the multiple beams may be the same.

[0417] As one example, transmitting multiple random access preambles with multiple PRACHs is done using the same beam.

[0418] As one example, multiple random access preambles are sent using multiple PRACHs, each using the same spatial domain filter.

[0419] As one example, multiple random access preambles are transmitted using multiple PRACHs, each using the same spatial domain transmission filter.

[0420] In some scenarios, the first node can monitor the first control signaling and then schedule the PDSCH based on that signaling. This point is explained below.

[0421] As one embodiment, the method of the embodiment of the present application may further include the step of receiving a first transmission block within a first time window, wherein the first transmission block is in a corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.

[0422] In one embodiment, the first transmission block is received using the first receiver of the first node.

[0423] In one embodiment, the first transmission block is transmitted by a second node, which may be, for example, a network device. The embodiments of the present application are not limited thereto, and in one embodiment, the first transmission block is transmitted by a node other than the second node.

[0424] In one embodiment, the first transmission block is used for random access responses.

[0425] In one embodiment, the random access response includes a first transmission block.

[0426] In one embodiment, the first control signaling and the first transmission block are used together for random access response.

[0427] In one embodiment, the random access response includes a first control signaling and a first transmission block.

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

[0429] Furthermore, the multicarrier symbols referred to in this application may include, or be replaced by, at least one of the following: a symbol, a multicarrier symbol, an orthogonal frequency division multiplexing (OFDM) symbol, a discrete fourier transform extension (DFT-s-OFDM) symbol, or a single-carrier frequency division multiple access (SC-FDMA) symbol.

[0430] Furthermore, the random access timing referred to in this application may include or be replaced by at least one of the random access timing, physical random access channel timing, and PRACH timing.

[0431] To facilitate understanding, refer to Figure 8, which illustrates an example in which the first node determines the length of the first time window based on configuration information. The method shown in Figure 8 may include steps S810 to S840.

[0432] In step S810, configuration information is received.

[0433] As one embodiment, this configuration information is used to configure the PRACH timing for multiple PRACH transmissions. In other words, this configuration information is used to configure a PRACH resource pool for multiple PRACH transmissions.

[0434] As one embodiment, this configuration information may be the first configuration information mentioned in the preamble.

[0435] As one embodiment, this configuration information may be the second configuration information mentioned in the preceding paragraph.

[0436] In one embodiment, this configuration information includes at least one candidate time length.

[0437] Step S820 determines the number of PRACHs required for sending multiple PRACHs.

[0438] In one embodiment, the signal quality received by the first node is used to determine the number of PRACHs required for multiple PRACH transmissions.

[0439] In one embodiment, the signal quality received by the first node may be the signal quality of the first synchronization signal block mentioned in the preceding paragraph.

[0440] In one embodiment, the signal quality received by the first node is indicated by SSB-RSRP.

[0441] As one embodiment, the number of PRACHs required for sending multiple PRACHs may be, for example, one of two, four, or eight.

[0442] The embodiments of this application do not specifically limit the execution order of steps S810 and S820. In some embodiments, step S810 is executed earlier than step S820. In some embodiments, step S810 is executed later than step S820. In some embodiments, steps S810 and S820 can be executed simultaneously.

[0443] In step S830, the length of the first time window is determined.

[0444] In one embodiment, the number of PRACH signals required for multiple PRACH transmissions is used to determine the length of the first time window.

[0445] In one embodiment, the above configuration information includes at least two candidate time lengths, and the first node selects one of the at least two candidate time lengths based on the number of PRACHs required to send multiple PRACHs, and sets it as the length of the first time window.

[0446] In one embodiment, the above configuration information includes one candidate time length, and the first node determines the length of the first time window based on this candidate time length and a first coefficient. A detailed explanation of the first coefficient is as mentioned in the preceding paragraph and is omitted here.

[0447] In step S840, the PRACH timing for multiple PRACH transmissions is determined, and the first control signaling is monitored within the first time window.

[0448] In one embodiment, the first node randomly selects PRACH timings for multiple PRACH transmissions from the configured PRACH timings. In other words, the first node randomly selects resources for multiple PRACH transmissions from the configured PRACH resource pool.

[0449] In one embodiment, the first node monitors Msg2 within the first time window.

[0450] In one embodiment, the above Msg2 includes a first control signaling.

[0451] Thus, in the embodiments of the present invention, for multiple PRACH transmissions with a large number of PRACHs, the first node can select a long first time window length, which is advantageous in ensuring the effective detection of multiple PRACHs. For multiple PRACH transmissions with a small number of PRACHs, the first node can select a short first time window length, which is advantageous in reducing random access delay.

[0452] To facilitate understanding, please refer to Figures 9 to 11 below to see some examples of the correspondence between candidate time lengths and the number of candidates. In the following examples, multiple PRACH transmissions are explained using multiple PRACH timings included in ROG as an example. In the following examples, the first time window is explained using the RAR window as an example.

[0453] Example 1:

[0454] Referring to FIG. 9, in Example 1, the number of PRACH timings in different ROGs is different. The number of PRACH timings in ROG1 is 2, and the two PRACH timings included in ROG1 are used for one random access attempt of two PRACH transmissions. The number of PRACH timings in ROG2 is 4, and the four PRACH timings included in ROG2 are used for one random access attempt of four PRACH transmissions. The number of PRACH timings in ROG3 is 8, and the eight PRACH timings included in ROG3 are used for one random access attempt of eight PRACH transmissions.

[0455] In Example 1, the system (e.g., network side) constitutes three candidate time lengths (Length_1 < Length_2 < Length_3) for multiple PRACH transmissions.

[0456] When the number of PRACHs in multiple PRACH transmissions is 2, the length of the used RAR window is Length_1. When the number of PRACHs in multiple PRACH transmissions is 4, the length of the used RAR window is Length_2. When the number of PRACHs in the multiple PRACH transmissions is 8, the length of the used RAR window is Length_3.

[0457] In other words, in this example, the length of the RAR window configured for one random access attempt of two PRACH transmissions is Length_1, the length of the RAR window configured for one random access attempt of four PRACH transmissions is Length_2, and the length of the RAR window configured for one random access attempt of eight PRACH transmissions is Length_3, where Length_1 < Length_2 < Length_3.

[0458] Example 2:

[0459] Referring to FIG. 10, in Example 2, the number of PRACH timings in different ROGs is different. The number of PRACH timings in ROG1 is 2, and the two PRACH timings included in ROG1 are used for one random access attempt of two PRACH transmissions. The number of PRACH timings in ROG2 is 4, and the four PRACH timings included in ROG2 are used for one random access attempt of four PRACH transmissions. The number of PRACH timings in ROG3 is 8, and the eight PRACH timings included in ROG3 are used for one random access attempt of eight PRACH transmissions.

[0460] In Example 2, the system (e.g., network side) constitutes two candidate time lengths (Length_2 < Length_3) for multiple PRACH transmissions.

[0461] As an example, when the number of PRACHs in multiple PRACH transmissions is 2 or 4, the length of the used RAR window is Length_2, and when the number of PRACHs in multiple PRACH transmissions is 8, the length of the used RAR window is Length_3.

[0462] In other words, in this example, the length of the RAR window configured for one random access attempt of two PRACH transmissions or one random access attempt of four PRACH transmissions is Length_2, and the length of the RAR window configured for one random access attempt of eight PRACH transmissions is Length_3, where Length_2 < Length_3.

[0463] Of course, in some embodiments, when the number of PRACHs in multiple PRACH transmissions is 2, the length of the used RAR window is Length_2, and when the number of PRACHs in multiple PRACH transmissions is 4 or 8, the length of the used RAR window is Length_3.

[0464] Example 3:

[0465] Referring to Figure 11, in Example 3, the number of PRACH timings differs in the different ROGs. ROG1 has 2 PRACH timings, and the 2 PRACH timings included in ROG1 are used for one random access attempt of 2 PRACH transmissions. ROG2 has 4 PRACH timings, and the 4 PRACH timings included in ROG2 are used for one random access attempt of 4 PRACH transmissions. ROG3 has 8 PRACH timings, and the 8 PRACH timings included in ROG3 are used for one random access attempt of 8 PRACH transmissions.

[0466] In Example 3, the system (e.g., the network side) configures one candidate time length (Length_0) for multiple PRACH transmissions.

[0467] In this example, the length of the first time window may be determined based on the configured candidate time length (Length_0) and the number of PRACHs in multiple PRACH transmissions. For example, the length of the RAR window used by multiple PRACH transmissions with different numbers of PRACHs is the product of the first coefficient and Length_0. The first coefficient is determined based on the number of PRACHs in multiple PRACH transmissions, for example, the first coefficient is equal to the number of PRACHs in multiple PRACH transmissions.

[0468] The first node method for wireless communication according to the embodiment of the present application will be described in detail from the perspective of the first node, with reference to Figures 4 to 11. The second node method for wireless communication according to the embodiment of the present application will be described from the perspective of the second node, with reference to Figure 12. It should be understood that the descriptions of the first and second nodes correspond to each other; therefore, please refer to the preamble for any parts not described in detail.

[0469] In one embodiment, the second node may be a node that receives a random access preamble in the communication system.

[0470] In one embodiment, the second node may be a base station.

[0471] In one embodiment, the second node includes a first transmitter and a first receiver.

[0472] Figure 12 is a flowchart of a method for a second node for wireless communication according to an embodiment of the present application. The method shown in Figure 12 may include steps S1210 and S1220.

[0473] In step S1210, one or more of several random access preambles are received.

[0474] In one embodiment, multiple random access preambles are received using the first receiver of the second node.

[0475] In one embodiment, multiple random access preambles are transmitted from a first node. The first node may be, for example, a user device or a relay.

[0476] In one embodiment, multiple physical random access channel timings are used to transmit multiple random access preambles, and each of the multiple physical random access channel timings corresponds to a transmission of multiple physical random access channels.

[0477] In step S1220, a first control signaling is transmitted within a first time window in response to multiple physical random access channel transmissions.

[0478] In one embodiment, the length of the first time window is related to the number of multiple physical random access channel transmissions.

[0479] In one embodiment, a first control signaling is scrambled by a first RNTI, which is associated with multiple physical random access channel timings.

[0480] In one embodiment, the length of the first time window and the number of multiple physical random access channel transmissions are linearly related.

[0481] In one embodiment, the length of the first time window is one of several candidate time lengths, the number of multiple physical random access channel transmissions is one of several candidate numbers, the multiple candidate time lengths correspond one-to-one with the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more of the multiple candidate numbers, and the number of multiple physical random access channel transmissions is used to determine the length of the first time window from the multiple candidate time lengths.

[0482] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the candidate time length groups contains at least one time length, the number of multiple physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of multiple physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from among the plurality of candidate time length groups.

[0483] In one embodiment, the first transmitter transmits first configuration information, and the first configuration information and the number of multiple physical random access channel transmissions are used together to determine the length of the first time window.

[0484] In one embodiment, the first configuration information includes at least two candidate time lengths, and the number of multiple physical random access channel 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.

[0485] In one embodiment, the number of multiple physical random access channel transmissions corresponds to one of multiple candidate time length groups, and any of 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 one candidate time length group corresponding to the number of multiple physical random access channel transmissions in the multiple candidate time length groups.

[0486] In one embodiment, the first transmitter transmits second configuration information, which includes one candidate time length, and the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, where the first coefficient is related to the number of multiple physical random access channel transmissions.

[0487] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0488] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0489] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in multiple physical random access channel timings.

[0490] In one embodiment, a first transmitter transmits first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within a time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

[0491] As one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0492] As one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, and at least one of the multiple physical random access channel timings included in at least two of the multiple random access timing groups is different.

[0493] As one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0494] In one embodiment, the first transmitter transmits a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of multiple physical random access channel transmissions.

[0495] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0496] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0497] In one embodiment, the first transmitter transmits a first transmission block within a first time window, the first transmission block is located in the corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.

[0498] The method embodiments of the present application have been described in detail above with reference to Figures 1 to 12. Now, the apparatus embodiments of the present application will be described in detail below with reference to Figures 13 to 16. It should be understood that the description of the method embodiments corresponds to the description of the apparatus embodiments, so for parts that are not described in detail, you can refer to the method embodiments described above.

[0499] Figure 13 is a schematic diagram of the structure of a wireless communication node according to one embodiment of the present invention. The node 1300 shown in Figure 13 may be any of the first nodes mentioned in the preamble. This node 1300 may include a first transmitter 1310 and a first receiver 1320.

[0500] The first transmitter 1310 is used to transmit multiple random access preambles, multiple physical random access channel timings are used to transmit multiple random access preambles, and each of the multiple physical random access channel timings corresponds to a transmission of multiple physical random access channels.

[0501] The first receiver 1320 can monitor the first control signaling within a first time window as a response to multiple physical random access channel transmissions. The length of the first time window is related to the number of multiple physical random access channel transmissions.

[0502] In one embodiment, a first control signaling is scrambled by a first RNTI, which is associated with multiple physical random access channel timings.

[0503] In one embodiment, the length of the first time window and the number of multiple physical random access channel transmissions are linearly related.

[0504] In one embodiment, the length of the first time window is one of several candidate time lengths, the number of multiple physical random access channel transmissions is one of several candidate numbers, the multiple candidate time lengths correspond one-to-one with the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more of the multiple candidate numbers, and the number of multiple physical random access channel transmissions is used to determine the length of the first time window from the multiple candidate time lengths.

[0505] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the candidate time length groups contains at least one time length, the number of multiple physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of multiple physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from among the plurality of candidate time length groups.

[0506] In one embodiment, the first receiver receives first configuration information, and the first configuration information and the number of multiple physical random access channel transmissions are used together to determine the length of the first time window.

[0507] In one embodiment, the first configuration information includes at least two candidate time lengths, and the number of multiple physical random access channel 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.

[0508] In one embodiment, the number of multiple physical random access channel transmissions corresponds to one of multiple candidate time length groups, and any of 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 one candidate time length group corresponding to the number of multiple physical random access channel transmissions in the multiple candidate time length groups.

[0509] In one embodiment, a first receiver receives second configuration information, which includes one candidate time length, and the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, where the first coefficient is related to the number of multiple physical random access channel transmissions.

[0510] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0511] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0512] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in multiple physical random access channel timings.

[0513] In one embodiment, a first receiver receives first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within a time period is greater than 1, multiple physical random access channel timings within a time period are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within a time period.

[0514] As one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0515] As one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, and at least one of the multiple physical random access channel timings included in at least two of the multiple random access timing groups is different.

[0516] As one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0517] In one embodiment, the first receiver receives a first synchronization signal block, and the reception quality for the first synchronization signal block is used to determine the number of multiple physical random access channel transmissions.

[0518] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0519] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0520] In one embodiment, the first receiver receives a first transmission block within a first time window, the first transmission block is located in the corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.

[0521] In one embodiment, the first transmitter 1310 and the first receiver 1320 may be a transceiver 1530. The node 1300 may further include a processor 1510 and memory 1520, specifically as shown in Figure 15.

[0522] Figure 14 is a schematic diagram of the structure of a wireless communication node according to another embodiment of the present application. The node 1400 shown in Figure 14 may be any of the second nodes mentioned in the preceding paragraph. This node 1400 may include a first receiver 1410 and a first transmitter 1420.

[0523] The first receiver 1410 may receive one or more of the multiple random access preambles, and the multiple physical random access channel timings are used to transmit the multiple random access preambles, with each of the multiple physical random access channel timings corresponding to a multiple physical random access channel transmission.

[0524] The first transmitter 1420 transmits a first control signaling within a first time window in response to multiple physical random access channel transmissions, the length of which is related to the number of multiple physical random access channel transmissions.

[0525] In one embodiment, a first control signaling is scrambled by a first RNTI, which is associated with multiple physical random access channel timings.

[0526] In one embodiment, the length of the first time window and the number of multiple physical random access channel transmissions are linearly related.

[0527] In one embodiment, the length of the first time window is one of several candidate time lengths, the number of multiple physical random access channel transmissions is one of several candidate numbers, the multiple candidate time lengths correspond one-to-one with the multiple candidate numbers, or one of the multiple candidate time lengths corresponds to one or more of the multiple candidate numbers, and the number of multiple physical random access channel transmissions is used to determine the length of the first time window from the multiple candidate time lengths.

[0528] In one embodiment, the length of the first time window belongs to one of a plurality of candidate time length groups, any of the candidate time length groups contains at least one time length, the number of multiple physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one-to-one with the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of multiple physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from among the plurality of candidate time length groups.

[0529] In one embodiment, the first transmitter transmits first configuration information, and the first configuration information and the number of multiple physical random access channel transmissions are used together to determine the length of the first time window.

[0530] In one embodiment, the first configuration information includes at least two candidate time lengths, and the number of multiple physical random access channel 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.

[0531] In one embodiment, the number of multiple physical random access channel transmissions corresponds to one of multiple candidate time length groups, and any of 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 one candidate time length group corresponding to the number of multiple physical random access channel transmissions in the multiple candidate time length groups.

[0532] In one embodiment, the first transmitter transmits second configuration information, which includes one candidate time length, and the length of the first time window is determined based on the one candidate time length included in the second configuration information and a first coefficient, where the first coefficient is related to the number of multiple physical random access channel transmissions.

[0533] In one embodiment, the first coefficient is equal to the number of multiple physical random access channel transmissions.

[0534] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the multiple physical random access channel timings.

[0535] In one embodiment, the start point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in multiple physical random access channel timings.

[0536] In one embodiment, a first transmitter transmits first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within a time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed, and the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

[0537] As one embodiment, any two of the multiple physical random access channel timings are located in two different time zones.

[0538] As one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, and at least one of the multiple physical random access channel timings included in at least two of the multiple random access timing groups is different.

[0539] As one embodiment, multiple physical random access channel timings belong to one of multiple random access timing groups, any one of the multiple random access timing groups includes multiple physical random access channel timings, each of the multiple random access timing groups corresponds to multiple preambles, and the preambles corresponding to at least two of the multiple random access timing groups are different.

[0540] In one embodiment, the first transmitter transmits a first synchronization signal block, and the reception quality of the first synchronization signal block is used to determine the number of multiple physical random access channel transmissions.

[0541] In one embodiment, the number of multiple physical random access channel transmissions is one of 2, 4, or 8.

[0542] In one embodiment, multiple beams are used to transmit multiple random access preambles, and the multiple beams are identical.

[0543] In one embodiment, the first transmitter transmits a first transmission block within a first time window, the first transmission block is located in the corresponding PDSCH, and the first control signaling is used to schedule the PDSCH.

[0544] In one 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 memory 1520, specifically as shown in Figure 15.

[0545] Figure 15 is a schematic diagram of the structure of a communication device in an embodiment of the present invention. The dashed lines in Figure 15 indicate that this unit or module is selectable. This device 1500 may be used to implement the method described in the above embodiment. The device 1500 may be a chip, user equipment, or network equipment.

[0546] The apparatus 1500 may include one or more processors 1510. These processors 1510 can support the apparatus 1500 in implementing the methods described in the above embodiment of the method. These processors 1510 may be general-purpose processors or dedicated processors. For example, these processors may be central processing units (CPUs). Alternatively, these processors may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor, or these processors may be any conventional processor, etc.

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

[0548] The device 1500 may further include a transceiver 1530. The processor 1510 can communicate with other devices or chips via the transceiver 1530. For example, the processor 1510 can send and receive data with other devices or chips via the transceiver 1530.

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

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

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

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

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

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

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

[0556] As one embodiment, the first communication device 450 includes at least one processor and at least one memory, the at least one memory containing computer program code, the at least one memory and the computer program code are configured to be used together with the at least one processor, the first communication device 450 transmits at least a plurality of random access preambles, a plurality of physical random access channel timings are used to transmit the plurality of random access preambles, each of the plurality of physical random access channel timings corresponds to a plurality of physical random access channel transmissions, and in response to the plurality of physical random access channel transmissions, a first control signaling is monitored within a first time window, the length of the first time window is related to the number of plurality of physical random access channel transmissions.

[0557] As one embodiment, the first communication device 450 includes a memory for storing a computer-readable instruction program, the computer-readable instruction program, when executed by at least one processor, generates an operation, the operation includes the step of transmitting a plurality of random access preambles, wherein a plurality of physical random access channel timings are used for transmitting the plurality of random access preambles, each of the plurality of physical random access channel timings corresponds to a plurality of physical random access channel transmissions, and the step of monitoring a first control signaling within a first time window as a response to the plurality of physical random access channel transmissions, the length of the first time window is related to the number of the plurality of physical random access channel transmissions.

[0558] In one embodiment, the first communication device 450 corresponds to the first node in this application.

[0559] In one embodiment, the second communication device 410 corresponds to the second node in this application.

[0560] In one embodiment, the first communication device 450 is a single NCR.

[0561] In one embodiment, the first communication device 450 is a wireless repeater.

[0562] In one embodiment, the first communication device 450 is a single relay.

[0563] In one embodiment, the first communication device 450 is a single user device.

[0564] As one embodiment, the first communication device 450 is a single user device that supports V2X.

[0565] As one embodiment, the first communication device 450 is a single user device that supports D2D.

[0566] In one embodiment, the second communication device 410 is a base station.

[0567] In one embodiment, the antenna 452, receiver 454, multi-antenna receiving processor 458, receiving processor 456, and controller / processor 459 are used to monitor the first control signaling within the first time window.

[0568] In one embodiment, the antenna 420, transmitter 418, multi-antenna transmitting processor 471, transmitting processor 416, and controller / processor 475 are used to transmit a first control signaling within a first time window.

[0569] In one embodiment, the antenna 452, transmitter 454, multi-antenna transmitting processor 457, transmitting processor 468, and controller / processor 459 are used to transmit multiple random access preambles in this application.

[0570] In one embodiment, the antenna 420, receiver 418, multi-antenna receiving processor 472, receiving processor 470, and controller / processor 475 are used to receive multiple random access preambles in this application.

[0571] Embodiments of the present application further provide a computer-readable storage medium used for storing a program. This computer-readable storage medium can be applied to a terminal or network device according to an embodiment of the present application, and the program causes a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0572] Embodiments of the present application further provide a computer program product. This computer program product includes a program. This computer program product can be applied to a terminal or network device according to an embodiment of the present application, and this program causes a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0573] Embodiments of the present application further provide a computer program. This computer program can be applied to a terminal or network device according to an embodiment of the present application, and this computer program causes a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

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

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

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

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

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

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

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

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

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

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

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

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

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

[0587] 100 Wireless Communication Systems 110 Network Equipment 120 User Equipment 1300 nodes 1310 Transmitter No. 1 1320 First Receiver 1400 nodes 1410 First receiver 1420 Transmitter No. 1 1500 equipment 1510 Processor 1520 memory 1530 Transmitter / Receiver 410 Second communication equipment 416 Transmitting Processors 418 Transmitter / Receiver 420 Antenna 450 1st communication equipment 452 Antenna 454 Transmitter / Receiver 456 Receiver Processors 457 Multi-Antenna Transmitter Processor 458 Multi-Antenna Receiving Processor 459 processors 460 memory 467 data sources 468 Transmit Processors 470 Receiver Processors 471 Multi-Antenna Transmitter Processor 472 Multi-Antenna Receiving Processor 475 Processors 476 memory 477 data sources

Claims

1. The first node for wireless communication, A first transmitter that transmits multiple random access preambles, wherein multiple physical random access channel timings are used for transmitting the multiple random access preambles, and each of the multiple physical random access channel timings corresponds to a transmission of a multiple physical random access channel, In response to the transmission of the plurality of physical random access channels, a first receiver monitors a first control signaling within a first time window, Includes, A first node for wireless communication, characterized in that the length of the first time window is related to the number of the plurality of physical random access channel transmissions.

2. The first node according to claim 1, characterized in that the first control signaling is scrambled by a first wireless network temporary identifier (RNTI), and the first RNTI is associated with the plurality of physical random access channel timings.

3. The first node according to claim 1 or 2, characterized in that the length of the first time window and the number of the plurality of physical random access channel transmissions are linearly related.

4. The first node according to any one of claims 1 to 3, 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 physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or a plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

5. The first node according to any one of claims 1 to 4, characterized in that the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups includes at least one time length, the number of the plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

6. The first receiver receives the first configuration information, The first node according to any one of claims 1 to 5, characterized in that the first configuration information and the number of the plurality of physical random access channel transmissions are used together to determine the length of the first time window.

7. The first node according to claim 6, wherein the first configuration information includes at least two candidate time lengths, and the number of the plurality of physical random access channel 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.

8. The first node according to claim 6, wherein the number of the plurality of physical random access channel transmissions corresponds to one of a plurality of candidate time length groups, any 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 one candidate time length group corresponding to the number of the plurality of physical random access channel transmissions in the plurality of candidate time length groups.

9. The first receiver receives second configuration information, and the second configuration information includes one candidate time length. The first node according to any one of claims 1 to 5, characterized in that the length of the first time window is determined based on one candidate time length included in the second configuration information and a first coefficient, the first coefficient being related to the number of the plurality of physical random access channel transmissions.

10. The first node according to claim 9, characterized in that the first coefficient is equal to the number of the plurality of physical random access channel transmissions.

11. The first node according to any one of claims 1 to 10, characterized in that the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the plurality of physical random access channel timings.

12. The first node according to any one of claims 1 to 10, characterized in that the starting point of the first time window is located after the last multi-carrier symbol of the first physical random access channel timing in the plurality of physical random access channel timings.

13. The first receiver receives first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within the time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed. The first node according to any one of claims 1 to 12, characterized in that the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

14. The first node according to any one of claims 1 to 13, characterized in that any two of the plurality of physical random access channel timings are each in two different time zones.

15. The first node according to any one of claims 1 to 14, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

16. The first node according to any one of claims 1 to 15, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, each of the plurality of random access timing groups corresponds to a plurality of preambles, and the preambles corresponding to at least two of the plurality of random access timing groups are different.

17. The first node according to any one of claims 1 to 16, characterized in that the first receiver receives a first synchronization signal block, and the reception quality for the first synchronization signal block is used to determine the number of the plurality of physical random access channel transmissions.

18. The first node according to any one of claims 1 to 17, characterized in that the number of the plurality of physical random access channel transmissions is one of 2, 4, or 8.

19. The first node according to any one of claims 1 to 18, characterized in that the multiple beams are each used to transmit the multiple random access preambles, and the multiple beams are the same.

20. The first node according to any one of claims 1 to 19, characterized in that the first receiver receives a first transmission block within the first time window, the first transmission block is located on a corresponding physical downlink shared channel PDSCH, and the first control signaling is used to schedule the PDSCH.

21. A second node for wireless communication, A first receiver that receives one or more of a plurality of random access preambles, wherein a plurality of physical random access channel timings are used for transmitting the plurality of random access preambles, and each of the plurality of physical random access channel timings corresponds to a plurality of physical random access channel transmissions, A first transmitter transmits a first control signaling within a first time window in response to the transmission of the plurality of physical random access channels, Includes, A second node for wireless communication, characterized in that the length of the first time window is related to the number of the plurality of physical random access channel transmissions.

22. The second node according to claim 21, characterized in that the first control signaling is scrambled by a first wireless network temporary identifier (RNTI), and the first RNTI is associated with the plurality of physical random access channel timings.

23. The second node according to claim 21 or 22, characterized in that the length of the first time window and the number of the plurality of physical random access channel transmissions are linearly related.

24. The second node according to any one of claims 21 to 23, 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 physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or more of the plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

25. The second node according to any one of claims 21 to 24, characterized in that the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups includes at least one time length, the number of the plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

26. The first transmitter transmits the first configuration information, The second node according to any one of claims 21 to 25, characterized in that the first configuration information and the number of the plurality of physical random access channel transmissions are used together to determine the length of the first time window.

27. The second node according to 26, wherein the first configuration information includes at least two candidate time lengths, and the number of the plurality of physical random access channel 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.

28. The second node according to 26, wherein the number of the plurality of physical random access channel transmissions corresponds to one of a plurality of candidate time length groups, any 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 one candidate time length group corresponding to the number of the plurality of physical random access channel transmissions in the plurality of candidate time length groups.

29. The second node according to any one of claims 21 to 25, characterized in that the first transmitter transmits second configuration information, the second configuration information includes one candidate time length, the length of the first time window is determined based on one candidate time length included in the second configuration information and a first coefficient, the first coefficient being related to the number of the plurality of physical random access channel transmissions.

30. The second node according to claim 29, characterized in that the first coefficient is equal to the number of the plurality of physical random access channel transmissions.

31. The second node according to any one of claims 21 to 30, characterized in that the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the plurality of physical random access channel timings.

32. The second node according to any one of claims 21 to 30, characterized in that the starting point of the first time window is located after the last multicarrier symbol of the first physical random access channel timing in the plurality of physical random access channel timings.

33. The first transmitter transmits first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within the time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed. The second node according to any one of claims 21 to 32, characterized in that the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

34. The second node according to any one of claims 21 to 33, characterized in that any two of the plurality of physical random access channel timings are each in two different time zones.

35. The second node according to any one of claims 21 to 34, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

36. The second node according to any one of claims 21 to 35, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, each of the plurality of random access timing groups corresponds to a plurality of preambles, and the preambles corresponding to at least two of the plurality of random access timing groups are different.

37. The second node according to any one of claims 21 to 36, characterized in that the first transmitter transmits a first synchronization signal block, and the reception quality for the first synchronization signal block is used to determine the number of the plurality of physical random access channel transmissions.

38. The second node according to any one of claims 21 to 37, characterized in that the number of the plurality of physical random access channel transmissions is one of 2, 4, or 8.

39. The second node according to any one of claims 21 to 38, characterized in that the multiple beams are each used to transmit the multiple random access preambles, and the multiple beams are the same.

40. The second node according to any one of claims 21 to 39, characterized in that the first transmitter transmits a first transmission block within the first time window, the first transmission block is located on a corresponding physical downlink shared channel PDSCH, and the first control signaling is used to schedule the PDSCH.

41. A method at a first node for wireless communication, A step of transmitting multiple random access preambles, wherein multiple physical random access channel timings are used for transmitting the multiple random access preambles, and each of the multiple physical random access channel timings corresponds to a transmission of a multiple physical random access channel. The steps include monitoring a first control signaling within a first time window as a response to the transmission of the plurality of physical random access channels, Includes, A method in a first node for wireless communication, characterized in that the length of the first time window is related to the number of the plurality of physical random access channel transmissions.

42. The method according to 41, characterized in that the first control signaling is scrambled by a first wireless network temporary identifier (RNTI), and the first RNTI is associated with the plurality of physical random access channel timings.

43. The method according to 41 or 42, characterized in that the length of the first time window and the number of the plurality of physical random access channel transmissions are linearly related.

44. The method according to any one of claims 41 to 43, 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 physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or a plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

45. The method according to any one of claims 41 to 44, characterized in that the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups includes at least one time length, the number of the plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

46. The step includes receiving first configuration information, The method according to any one of claims 41 to 45, characterized in that the first configuration information and the number of the plurality of physical random access channel transmissions are used together to determine the length of the first time window.

47. The method according to 46, wherein the first configuration information includes at least two candidate time lengths, and the number of the plurality of physical random access channel 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.

48. The method according to 46, wherein the number of the plurality of physical random access channel transmissions corresponds to one of a plurality of candidate time length groups, any 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 one candidate time length group corresponding to the number of the plurality of physical random access channel transmissions in the plurality of candidate time length groups.

49. The process includes the step of receiving second configuration information, the second configuration information including one candidate time length, The method according to any one of claims 41 to 45, characterized in that the length of the first time window is determined based on one candidate time length included in the second configuration information and a first coefficient, the first coefficient being related to the number of the plurality of physical random access channel transmissions.

50. The method according to 49, characterized in that the first coefficient is equal to the number of the plurality of physical random access channel transmissions.

51. The method according to any one of claims 41 to 50, characterized in that the starting point of the first time window is located after the last multi-carrier symbol of the last physical random access channel timing in the plurality of physical random access channel timings.

52. The method according to any one of claims 41 to 50, characterized in that the starting point of the first time window is located after the last multicarrier symbol of the first physical random access channel timing in the plurality of physical random access channel timings.

53. The process includes the step of receiving first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within the time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed. The method according to any one of claims 41 to 52, characterized in that the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

54. The method according to any one of claims 41 to 53, characterized in that any two of the plurality of physical random access channel timings are each in two different time zones.

55. The method according to any one of claims 41 to 54, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

56. The method according to any one of claims 41 to 55, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, each of the plurality of random access timing groups corresponds to a plurality of preambles, and the preambles corresponding to at least two of the plurality of random access timing groups are different.

57. The method according to any one of claims 41 to 56, comprising the step of receiving a first synchronization signal block, wherein the reception quality for the first synchronization signal block is used to determine the number of the plurality of physical random access channel transmissions.

58. The method according to any one of claims 41 to 57, characterized in that the number of the plurality of physical random access channel transmissions is one of 2, 4, or 8.

59. The method according to any one of claims 41 to 58, characterized in that each of the multiple beams is used to transmit the multiple random access preambles, and the multiple beams are the same.

60. The method according to any one of claims 41 to 59, comprising the step of receiving a first transmission block within the first time window, wherein the first transmission block is in a corresponding physical downlink shared channel PDSCH, and the first control signaling is used to schedule the PDSCH.

61. A method at a second node for wireless communication, A step of receiving one or more of a plurality of random access preambles, wherein the plurality of physical random access channel timings are used to transmit the plurality of random access preambles, and each of the plurality of physical random access channel timings corresponds to a plurality of physical random access channel transmissions. The steps include transmitting a first control signaling within a first time window as a response to the transmission of the plurality of physical random access channels, Includes, A method in a second node for wireless communication, characterized in that the length of the first time window is related to the number of the plurality of physical random access channel transmissions.

62. The method according to 61, characterized in that the first control signaling is scrambled by a first wireless network temporary identifier (RNTI), and the first RNTI is associated with the plurality of physical random access channel timings.

63. The method according to 61 or 62, characterized in that the length of the first time window and the number of the plurality of physical random access channel transmissions are in a linear relationship.

64. The method according to any one of claims 61 to 63, 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 physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time lengths correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time lengths corresponds to one or a plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the length of the first time window from the plurality of candidate time lengths.

65. The method according to any one of claims 61 to 64, characterized in that the length of the first time window belongs to one of a plurality of candidate time length groups, any of the plurality of candidate time length groups includes at least one time length, the number of the plurality of physical random access channel transmissions is one of a plurality of candidate numbers, the plurality of candidate time length groups correspond one to one of the plurality of candidate numbers, or one of the plurality of candidate time length groups corresponds to one or more of the plurality of candidate numbers, and the number of the plurality of physical random access channel transmissions is used to determine the candidate time length group to which the length of the first time window belongs from the plurality of candidate time length groups.

66. The step includes transmitting first configuration information, The method according to any one of claims 61 to 65, characterized in that the first configuration information and the number of the plurality of physical random access channel transmissions are used together to determine the length of the first time window.

67. The method according to 66, wherein the first configuration information includes at least two candidate time lengths, and the number of the plurality of physical random access channel 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.

68. The method according to 66, wherein the number of the plurality of physical random access channel transmissions corresponds to one of a plurality of candidate time length groups, any 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 one candidate time length group corresponding to the number of the plurality of physical random access channel transmissions in the plurality of candidate time length groups.

69. The process includes the step of transmitting second configuration information, the second configuration information including one candidate time length, The method according to any one of claims 61 to 65, characterized in that the length of the first time window is determined based on one candidate time length included in the second configuration information and a first coefficient, the first coefficient relating to the number of the plurality of physical random access channel transmissions.

70. The method according to 69, characterized in that the first coefficient is equal to the number of the plurality of physical random access channel transmissions.

71. The method according to any one of claims 61 to 70, characterized in that the starting point of the first time window is located after the last multicarrier symbol of the last physical random access channel timing in the plurality of physical random access channel timings.

72. The method according to any one of claims 61 to 70, characterized in that the starting point of the first time window is located after the last multicarrier symbol of the first physical random access channel timing in the plurality of physical random access channel timings.

73. The process includes the step of transmitting first information, which is used to indicate the number of at least one physical random access channel timings within a time period, and if the number of at least one physical random access channel timings within the time period is greater than 1, the multiple physical random access channel timings within the time period are frequency-division multiplexed. The method according to any one of claims 61 to 72, characterized in that the length of the first time window is related to the number of at least one physical random access channel timings within the time period.

74. The method according to any one of claims 61 to 73, characterized in that any two of the plurality of physical random access channel timings are each in two different time zones.

75. The method according to any one of claims 61 to 74, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, and at least one of the plurality of physical random access channel timings included in at least two random access timing groups among the plurality of random access timing groups is different.

76. The method according to any one of claims 61 to 75, characterized in that the plurality of physical random access channel timings belong to one of a plurality of random access timing groups, any random access timing group among the plurality of random access timing groups includes a plurality of physical random access channel timings, each of the plurality of random access timing groups corresponds to a plurality of preambles, and the preambles corresponding to at least two of the plurality of random access timing groups are different.

77. The method according to any one of claims 61 to 76, comprising the step of transmitting a first synchronization signal block, wherein the reception quality for the first synchronization signal block is used to determine the number of the plurality of physical random access channel transmissions.

78. The method according to any one of claims 61 to 77, characterized in that the number of the plurality of physical random access channel transmissions is one of 2, 4, or 8.

79. The method according to any one of claims 61 to 78, characterized in that each of the multiple beams is used to transmit the multiple random access preambles, and the multiple beams are the same.

80. The method according to any one of claims 61 to 79, comprising the step of transmitting a first transmission block within the first time window, wherein the first transmission block is located on a corresponding physical downlink shared channel PDSCH, and the first control signaling is used to schedule the PDSCH.

81. A node for wireless communication, comprising a transceiver, memory, and a processor, wherein the memory is used to store a program, and the processor is used to cause the node to execute the method according to any one of claims 41 to 60 or 61 to 80 by calling the program in the memory and controlling the transceiver to send and receive signals.

82. A device comprising a processor that causes the device to perform the method described in any one of claims 41 to 60 or 61 to 80 by calling a program from memory.

83. A chip comprising a processor that causes a device on which the chip is mounted to execute a method according to any one of claims 41 to 60 or 61 to 80 by calling a program from memory.

84. A computer-readable storage medium characterized in that it stores a program that causes a computer to execute the method described in any one of claims 41 to 60 or 61 to 80.

85. A computer program product characterized by including a program that causes a computer to execute the method described in any one of claims 41 to 60 or 61 to 80.

86. A computer program characterized by causing a computer to execute the method described in any one of claims 41 to 60 or 61 to 80.

Images