WO2024168703A1 - 用于无线通信的节点中的方法和装置 - Google Patents

用于无线通信的节点中的方法和装置 Download PDF

Info

Publication number
WO2024168703A1
WO2024168703A1 PCT/CN2023/076510 CN2023076510W WO2024168703A1 WO 2024168703 A1 WO2024168703 A1 WO 2024168703A1 CN 2023076510 W CN2023076510 W CN 2023076510W WO 2024168703 A1 WO2024168703 A1 WO 2024168703A1
Authority
WO
WIPO (PCT)
Prior art keywords
random access
access channel
group
opportunity
groups
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2023/076510
Other languages
English (en)
French (fr)
Inventor
吕玲
赵铮
杨中志
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Quectel Wireless Solutions Co Ltd
Original Assignee
Quectel Wireless Solutions Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to KR1020267006396A priority Critical patent/KR20260036619A/ko
Priority to CN202380082659.3A priority patent/CN120359788A/zh
Priority to PCT/CN2023/076510 priority patent/WO2024168703A1/zh
Priority to EP23921859.7A priority patent/EP4529304A4/en
Priority to KR1020257005633A priority patent/KR102934625B1/ko
Priority to JP2024576833A priority patent/JP7769154B2/ja
Application filed by Quectel Wireless Solutions Co Ltd filed Critical Quectel Wireless Solutions Co Ltd
Priority to US18/402,452 priority patent/US12143922B2/en
Publication of WO2024168703A1 publication Critical patent/WO2024168703A1/zh
Priority to US18/940,966 priority patent/US20250071664A1/en
Anticipated expiration legal-status Critical
Priority to JP2025183801A priority patent/JP2026035595A/ja
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A) or DMT
    • H04L5/0012—Hopping in multicarrier systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signalling for the administration of the divided path, e.g. signalling of configuration information
    • H04L5/0092—Indication of how the channel is divided
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
    • H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H04W74/004—Transmission of channel access control information in the uplink, i.e. towards network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H04W74/006—Transmission of channel access control information in the downlink, i.e. towards the terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA

Definitions

  • the present application relates to the field of communication technology, and more specifically, to a method and device in a node for wireless communication.
  • some communication systems e.g., new radio (NR) systems
  • PRACH physical random access channels
  • the mapping method of the traditional synchronization signal block (Synchronization Signal/Physical Broadcast Channel block, referred to as SSB or SS/PBCH block) and random access occasion (Random Access Occasion, RO, also known as PRACH Occasion) used for wireless communication may cause multiple random access occasions to overlap in the time domain, which not only brings higher requirements to the system configuration, but also increases the system processing complexity and the transmission power overhead; it may also cause a large time interval between multiple random access occasions, thereby increasing the access delay of the system; it may also reduce the utilization efficiency of random access resources; it may also increase additional signaling overhead.
  • the embodiments of the present application are dedicated to providing a method and apparatus in a node for wireless communication.
  • the various aspects involved in the present application are introduced below.
  • a method in a first node for wireless communication, comprising: receiving a first synchronization signal block, the index of the first synchronization signal block is one of a plurality of candidate synchronization signal block indexes; sending a first preamble group, the first preamble group including a plurality of preambles; a first random access channel opportunity group including a plurality of random access channel opportunities, the plurality of random access channel opportunities in the first random access channel opportunity group being respectively used to send the plurality of preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the plurality of candidate synchronization signal block indexes are mapped to a plurality of random access channel opportunity groups according to a first mapping order, the first random access channel opportunity group being one of the plurality of random access channel opportunity groups; the first random access channel opportunity group corresponds to a first opportunity group type, the first opportunity group type being one of a plurality of candidate
  • a method in a second node for wireless communication, comprising: sending one or more synchronization signal blocks, a first synchronization signal block is one of the one or more synchronization signal blocks, and an index of the first synchronization signal block is one of a plurality of candidate synchronization signal block indexes; receiving a first preamble group, the first preamble group comprising a plurality of preambles; a first random access channel opportunity group comprising a plurality of random access channel opportunities, the plurality of random access channel opportunities in the first random access channel opportunity group being respectively used to send the plurality of preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the plurality of candidate synchronization signal block indexes are mapped to a plurality of random access channel opportunity groups according to a first mapping order, the first random access channel opportunity group being one of the plurality of random access channel opportunity groups; the first random access channel opportunity group
  • a first node for wireless communication comprising: a first receiver for receiving a first synchronization signal block, the index of the first synchronization signal block being one of a plurality of candidate synchronization signal block indexes; a first transmitter for sending a first preamble group, the first preamble group comprising a plurality of preambles; a first random access channel opportunity group comprising a plurality of random access channel opportunities, the plurality of random access channel opportunities in the first random access channel opportunity group being respectively used to send the plurality of preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the plurality of candidate synchronization signal block indexes are mapped to a plurality of random access channel opportunity groups according to a first mapping order, the first random access channel opportunity group being one of the plurality of random access channel opportunity groups; the first random access channel opportunity group corresponds to a first opportunity group type, the first opportunity group type being
  • a second node for wireless communication comprising: a first transmitter, for sending one or more synchronization signal blocks, the first synchronization signal block is one of the one or more synchronization signal blocks, and the index of the first synchronization signal block is one of multiple candidate synchronization signal block indexes; a first receiver, for receiving a first preamble group, the first preamble group including multiple preambles; a first random access channel opportunity group including multiple random access channel opportunities, the multiple random access channel opportunities in the first random access channel opportunity group are respectively used to send the multiple preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to a first mapping order, and the first random access channel opportunity group is one of the multiple random access channel opportunity groups.
  • the first random access channel opportunity group corresponds to a first opportunity group type, and the first opportunity group type is one of multiple candidate opportunity group types; the index of the first synchronization signal block, the first opportunity group type and the first mapping order are used to determine the first random access channel opportunity group.
  • a first node for wireless communication comprising a processor, a memory, and a communication interface, wherein the memory is used to store one or more computer programs, and the processor is used to call the computer program in the memory so that the first node executes part or all of the steps in the method of the first aspect.
  • a second node for wireless communication comprising a processor, a memory, and a communication interface, wherein the memory is used to store one or more computer programs, and the processor is used to call the computer program in the memory so that the second node executes part or all of the steps in the method of the second aspect.
  • an embodiment of the present application provides a communication system, which includes the first node and/or the second node mentioned above.
  • the system may also include other devices that interact with the first node or the second node in the solution provided in the embodiment of the present application.
  • an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program enables the first node or the second node to execute part or all of the steps in the methods of the above aspects.
  • an embodiment of the present application provides a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a first node or a second node to perform some or all of the steps in the above-mentioned various aspects of the method.
  • the computer program product can be a software installation package.
  • an embodiment of the present application provides a chip, which includes a memory and a processor.
  • the processor can call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.
  • the first node can determine the first random access channel opportunity group corresponding to the first synchronization signal block according to the index of the first synchronization signal block, the first opportunity group type and the first mapping order, so that any two random access channel opportunities in the determined first random access channel opportunity group are orthogonal in the time domain, that is, any two random access channel opportunities in the first random access channel opportunity group do not overlap in the time domain.
  • any two random access channel opportunities in the first random access channel opportunity group determined by the first node according to the index of the first synchronization signal block, the first opportunity group type and the first mapping order do not overlap in the time domain.
  • any two random access channel opportunities in the first random access channel opportunity group do not overlap in the time domain, thereby reducing the requirements for system configuration, reducing system processing complexity, and saving transmission power overhead.
  • the method for mapping synchronization signal blocks to random access opportunities is conducive to ensuring that the time intervals between multiple random access channel opportunities in a determined first random access channel opportunity group are small, thereby helping to reduce the access delay of the system.
  • mapping method of the synchronization signal block and the random access opportunity provided in the embodiment of the present application is conducive to improving the utilization efficiency of random access resources, or saving signaling overhead.
  • FIG1 is a diagram showing an example of a system architecture of a wireless communication system to which an embodiment of the present application may be applied.
  • FIG. 2 is an example diagram of the mapping relationship between synchronization signal blocks and random access channel opportunities.
  • FIG3 is a schematic flow chart of a method for wireless communication provided in an embodiment of the present application.
  • FIG4 is an example diagram of the mapping relationship between synchronization signal blocks and random access channel opportunity groups provided in an embodiment of the present application.
  • FIG5 is an example diagram of the mapping relationship between synchronization signal blocks and random access channel opportunity groups provided in another embodiment of the present application.
  • FIG6 is an example diagram of the mapping relationship between synchronization signal blocks and random access channel opportunity groups provided in yet another embodiment of the present application.
  • FIG. 7 is a schematic flow chart of a method for wireless communication provided in another embodiment of the present application.
  • FIG8 is a schematic diagram of the structure of the first node provided in an embodiment of the present application.
  • FIG. 9 is a schematic diagram of the structure of the second node provided in an embodiment of the present application.
  • FIG. 10 is a schematic structural diagram of a communication device provided in an embodiment of the present application.
  • FIG. 11 is a schematic diagram of the hardware modules of the communication device provided in an embodiment of the present application.
  • FIG1 is a diagram showing an example of a system architecture of a wireless communication system 100 to which an embodiment of the present application can be applied.
  • the wireless communication system 100 may include a network device 110 and a user equipment (UE) 120.
  • the network device 110 may be a device that communicates with the user equipment 120.
  • the network device 110 may provide communication coverage for a specific geographic area and may communicate with the user equipment 120 located in the coverage area. to communicate.
  • FIG1 exemplarily shows a network device and two user devices.
  • the wireless communication system 100 may include multiple network devices and each network device may include other number of user devices within its coverage area, which is not limited in the embodiments of the present application.
  • the wireless communication system 100 may also include other network entities such as a network controller and a mobility management entity, which is not limited in the embodiments of the present application.
  • network entities such as a network controller and a mobility management entity, which is not limited in the embodiments of the present application.
  • the technical solution of the embodiment of the present application is for random access
  • the technical solution of the embodiment of the present application can also be used for beam failure recovery (Beam Failure Recovery).
  • the technical solution of the embodiment of the present application is for random access procedure type-1 (Type-1 random access procedure)
  • the technical solution of the embodiment of the present application can also be used for random access procedure type-2 (Type-2 random access procedure).
  • the technical solution of the embodiment of the present application is for Uu interface
  • the technical solution of the embodiment of the present application can also be used for PC5 interface.
  • the technical solution of the embodiment of the present application is for single-carrier communication
  • the technical solution of the embodiment of the present application can also be used for multi-carrier communication.
  • the technical solution of the embodiment of the present application is for multi-antenna communication
  • the technical solution of the embodiment of the present application can also be used for single-antenna communication.
  • the technical solution of the embodiment of the present application is for the scenario of user equipment and base station
  • the technical solution of the embodiment of the present application is also applicable to V2X scenario, user equipment and relay, and communication scenario between relay and base station, to achieve similar technical effects in the scenario of user equipment and base station.
  • the technical solutions of the embodiments of the present application can be applied to various communication scenarios, such as: Enhanced Mobile Broadband (eMBB) scenario, Ultra Reliable & Low Latency Communication (URLLC) scenario, Massive Machine Type Communication (mMTC) scenario, etc.
  • eMBB Enhanced Mobile Broadband
  • URLLC Ultra Reliable & Low Latency Communication
  • mMTC Massive Machine Type Communication
  • the use of a unified solution for different scenarios can also help reduce hardware complexity and cost.
  • the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: the fifth generation (5th generation, 5G) system or new radio (new radio, NR), long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex (time division duplex, TDD), etc.
  • 5G fifth generation
  • NR new radio
  • long term evolution long term evolution
  • LTE long term evolution
  • LTE frequency division duplex frequency division duplex
  • FDD frequency division duplex
  • TDD time division duplex
  • future communication systems such as the sixth generation mobile communication system, satellite communication system, etc.
  • the user equipment in the embodiments of the present application may also be referred to as terminal equipment, access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.
  • the user equipment in the embodiments of the present application may be a device that provides voice and/or data connectivity to a user, and may be used to connect people, objects and machines, such as a handheld device with wireless connection function, a vehicle-mounted device, etc.
  • the user equipment in the embodiments of the present application may be a mobile phone, a tablet computer, a laptop computer, a PDA, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc.
  • the UE may be used to act as a base station.
  • the UE may act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc.
  • a cellular phone and a car communicate with each other using sidelink signals.
  • the cellular phone and smart home devices communicate with each other without relaying the communication signal through a base station.
  • the network device in the embodiment of the present application may be a device for communicating with a user device, and the network device may also be referred to as an access network device or a wireless access network device, such as a base station.
  • the network device in the embodiment of the present application may refer to a wireless access network (RAN) node (or device) that connects a user device to a wireless network.
  • RAN wireless access network
  • Base station can broadly cover various names as follows, or be replaced with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station MeNB, secondary station SeNB, multi-standard radio (MSR) node, home base station, network controller, access node, wireless 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), positioning node, etc.
  • the base station can be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof.
  • the base station can also refer to a communication module, a modem or a chip used to be arranged in the aforementioned device or apparatus.
  • the base station can also be a mobile switching center and a device to device D2D, vehicle-to-everything (V2X), a device that performs the base station function in machine-to-machine (M2M) communications, a network side device in a 6G network, and a device that performs the base station function in a future communication system.
  • the base station can support networks with the same or different access technologies. The embodiments of the present application do not limit the specific technology and specific device form adopted by the network equipment.
  • Base stations can be fixed or mobile.
  • a helicopter or drone can be configured to act as a mobile base station, one or The cells may be moved according to the location of the mobile base station.
  • a helicopter or drone may be configured to act as a device to communicate with another base station.
  • the network device in the embodiments of the present application may refer to a CU or a DU, or the network device includes a CU and a DU.
  • the gNB may also include an AAU.
  • the network equipment and user equipment can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on aircraft, balloons and satellites in the air.
  • the embodiments of the present application do not limit the scenarios in which the network equipment and user equipment are located.
  • the coverage performance of a communication system is an important factor that operators need to consider when commercializing their communication networks. This is because the coverage performance of a communication system will directly affect the service quality of the communication system and the operator's costs, such as the operator's capital expenditure (CAPEX) and operating expense (OPEX).
  • CAEX operator's capital expenditure
  • OPEX operating expense
  • the coverage performance of a communication system will vary with the frequency band in which the communication system operates.
  • the NR system operates at a higher frequency band (e.g., the millimeter wave frequency band), which results in a greater path loss in the NR system, and thus results in a relatively poorer coverage performance in the NR system. Therefore, as the frequency bands supported by the communication system may become higher and higher, how to enhance the coverage of the communication system becomes a problem that needs to be solved.
  • the uplink coverage performance is the bottleneck for enhancing the coverage of the communication system because the capabilities of user devices are weaker than those of network devices.
  • the uplink services in some emerging vertical use cases are gradually increasing, such as video uploading services.
  • how to enhance the uplink coverage is a problem that needs to be further solved.
  • NR version 17 (Release 17, Rel-17) has designed coverage enhancement solutions for the physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH) and message 3 (Msg3) in the random access process.
  • PUSCH physical uplink shared channel
  • PUCCH physical uplink control channel
  • Msg3 message 3
  • Rel-17 did not design a coverage enhancement solution for PRACH, but PRACH transmission performance is very important for many processes such as initial access and beam failure recovery. Therefore, it is also very important to enhance the coverage of PRACH.
  • Rel-18 formally established the "further NR coverage enhancements" work item (WI), in which enhancing the coverage performance of PRACH transmission is one of the important topics of this work item.
  • multiple PRACH transmissions may be used to enhance the coverage of PRACH transmissions.
  • the coverage of PRACH transmissions may be enhanced by repeated transmission of PRACH (for example, sending a preamble in PRACH multiple times).
  • multiple PRACH transmissions may refer to multiple PRACH transmissions using the same beam, or may refer to multiple PRACH transmissions using different beams.
  • 3GPP 3rd Generation Partnership Project
  • RAN 1#110bis-e meeting has reached an agreement: at least PRACH opportunities (or RACH opportunities) at different time instances can be used for multiple PRACH transmissions using the same beam.
  • the RAN1#110bis-e meeting further defines the repetition factor (the number/number of multiple PRACH transmissions) of multiple PRACH transmissions using the same beam, which may include at least 2 and 4, and may include 8 in the future.
  • a synchronization signal block is a signal structure defined in a communication standard, which may include a primary synchronization signal (PSS), a secondary synchronization signal (SSS), and a physical broadcast channel (PBCH).
  • a synchronization signal block may be represented as an SSB (synchronization signal block).
  • a synchronization signal block may also be represented as an SS/PBCH block (synchronization signal/physical broadcast channel block), that is, a synchronization signal block may also be referred to as a synchronization signal broadcast channel block, which is not limited in the embodiments of the present application.
  • SSB primary synchronization signal
  • SSS secondary synchronization signal
  • PBCH physical broadcast channel
  • SSB is a group of resources transmitted on a basic orthogonal frequency division multiplexing grid, and the group of resources may include, for example, one or more of the following resources: time domain resources, frequency domain resources, code domain resources, etc.
  • the user equipment when the user equipment detects the SSB sent by the network device, the SSB index of the SSB can be obtained, so that the time domain position of the SSB can be known, so as to realize communication with the network device.
  • Downlink synchronization In order to achieve uplink synchronization, the user equipment needs to send a preamble to the network equipment. How the user equipment selects the preamble to be sent and at which PRACH timing the selected preamble should be sent are determined by the user equipment according to the received (or detected) SSB.
  • SSB can be associated and mapped with at least one preamble in at least one PRACH opportunity, so that when the user equipment performs initial access or beam failure recovery, it can determine the associated PRACH opportunity and preamble based on the received SSB, so that PRACH transmission can continue.
  • the association mapping relationship between SSB and PRACH opportunities and preambles follows the following order: first, arrange in ascending order of the preamble index within each PRACH opportunity; second, arrange the frequency-division multiplexed PRACH opportunities in ascending order of the frequency domain resource index; third, arrange the time-division multiplexed PRACH opportunities within each PRACH time slot in ascending order of the time domain resource index; finally, arrange in ascending order of the PRACH time slot index.
  • PRACH coverage can be enhanced through multiple PRACH transmissions.
  • the above-mentioned association mapping relationship is used to determine multiple PRACH opportunities associated with the SSB, it may cause multiple PRACH opportunities associated with the same SSB to overlap in the time domain, thereby increasing the transmission power overhead of the device.
  • an embodiment of the present application provides a method and an apparatus in a node for wireless communication, which can effectively associate and map the SSB to multiple PRACH opportunities that are orthogonal in the time domain, thereby helping to save transmission power overhead.
  • the embodiments of the present application can be applied to the scenario of multiple PRACH transmissions, that is, multiple PRACH repeated transmissions can be used to achieve PRACH coverage enhancement.
  • the multi-PRACH transmission mentioned in the embodiments of the present application may refer to multi-PRACH transmission using the same beam to obtain a signal-to-noise ratio (SNR) gain by performing repeated transmission of multiple PRACHs on the same beam.
  • the multi-PRACH transmission mentioned in the embodiments of the present application may refer to multi-PRACH transmission using different beams to obtain a diversity gain by performing repeated transmission of multiple PRACHs on different beams.
  • SNR signal-to-noise ratio
  • the beam mentioned in the embodiments of the present application can be replaced by other terms such as antenna port, spatial filter, spatial parameter, etc., and the meanings expressed by them can be consistent. The embodiments of the present application do not distinguish between them.
  • the embodiments of the present application can be applied to the initial access process or the beam failure recovery process. Taking the initial access process as an example, the embodiments of the present application can be applied to a four-step random access procedure (i.e., type-1 random access procedure), or can also be applied to a two-step random access procedure (i.e., type-2 random access procedure), and the embodiments of the present application are not limited to this.
  • a four-step random access procedure i.e., type-1 random access procedure
  • a two-step random access procedure i.e., type-2 random access procedure
  • Figure 3 is a flow chart of a method in a node for wireless communication provided by an embodiment of the present application. The method shown in Figure 3 is described from the perspective of the interaction between the first node and the second node.
  • the first node may be a network-controlled repeater (NCR).
  • NCR network-controlled repeater
  • the first node may be a user equipment, for example, the user equipment 120 shown in FIG. 1 .
  • the first node may be a relay, such as a relay terminal.
  • the second node may be a network device, for example, the network device 110 shown in FIG. 2 .
  • the method shown in FIG. 3 may include step S310 and step S320 , which are described below.
  • step S310 the first node receives a first synchronization signal block.
  • the index of the first synchronization signal block is one of multiple candidate synchronization signal block indices.
  • the first synchronization signal block may be one of one or more synchronization signal blocks sent by the second node.
  • a synchronization signal block (for example, a first synchronization signal block, one or more synchronization signal blocks sent by a second node, etc.) can be represented as an SSB; or, a synchronization signal block can be represented as an SS/PBCH block, which is not limited to this embodiment of the present application.
  • the index of the first synchronization signal block is mapped to a first random access channel opportunity group.
  • the first random access channel opportunity group includes multiple random access channel opportunities.
  • the multiple random access channel occasions included in the first random access channel occasion group may be expressed as RO (RACH occasion) or PRO (PRACH occasion), which is not limited in the embodiment of the present application.
  • the first node sends a first preamble group.
  • the first preamble group includes multiple preambles.
  • the preamble may also be called a preamble code, which is not limited in the embodiments of the present application.
  • the multiple random access channel opportunities in the first random access channel opportunity group are respectively used to send multiple preambles in the first preamble group. That is, the multiple preambles in the first preamble group can be sent on multiple random access channel opportunities in the first random access channel opportunity group, for example, each preamble is sent on a random access channel opportunity.
  • any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain. In this way, any two random access channel opportunities in the first random access channel opportunity group will not overlap in the time domain, that is, the multiple random access channel opportunities associated with the first synchronization signal block are non-overlapping in the time domain.
  • any random access channel opportunity in the first random access channel opportunity group is valid.
  • all random access channel opportunities may be valid.
  • a random access channel opportunity may also be valid if certain conditions are met, and the condition may be associated with a parameter tdd-UL-DL-ConfigurationCommon, for example.
  • the above multiple candidate synchronization signal block indexes can be mapped to multiple random access channel opportunity groups according to the first mapping order, wherein the first random access channel opportunity group is one of the multiple random access channel opportunity groups. How multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to the first mapping order will be described in detail later, and will not be repeated here.
  • any random access channel opportunity group among the multiple random access channel opportunity groups includes at least one random access channel opportunity.
  • the multiple random access channel opportunity groups including the first random access channel opportunity group may include at least one random access channel opportunity.
  • any random access channel opportunity group among the multiple random access channel opportunity groups includes multiple (two or more) random access channel opportunities.
  • the first random access channel opportunity group may include multiple random access channel opportunities.
  • any two random access channel opportunities included in any random access channel opportunity group among the multiple random access channel opportunity groups are orthogonal in the time domain.
  • any two random access channel opportunities are orthogonal in the time domain, which can be understood as any two random access channel opportunities are distributed at different time points (time instances).
  • the time point can also be replaced by other terms such as time interval, which is not limited in the embodiments of the present application.
  • any random access channel opportunity group among the multiple random access channel opportunity groups is valid.
  • all random access channel opportunity groups may be valid.
  • the random access channel opportunity group may also be valid if certain conditions are met, and the condition may be associated with the parameter tdd-UL-DL-ConfigurationCommon, etc.
  • one or more random access channel opportunities included in any random access channel opportunity group among the multiple random access channel opportunity groups are valid.
  • At least two random access channel opportunities in at least one random access channel opportunity group among the multiple random access channel opportunity groups belong to two different time slots.
  • the first cycle includes 3 random access channel time slots (PRACH slots), and one or more random access channel opportunity groups among the multiple random access channel opportunity groups can occupy 2 or 3 PRACH time slots among the 3 PRACH time slots.
  • PRACH slots random access channel time slots
  • all random access channel opportunities included in any random access channel opportunity group in multiple random access channel opportunity groups are located in the same time slot, that is, all random access channel opportunities included in any random access channel opportunity group in multiple random access channel opportunity groups are located in the same PRACH time slot.
  • any random access channel opportunity group among multiple random access channel opportunity groups may include multiple preambles.
  • the preamble can be sent on the random access channel opportunity group.
  • the leading indexes included in any random access channel opportunity in the random access channel opportunity group may be the same.
  • the leading indexes included in the plurality of random access channel opportunities included in the first random access channel opportunity group may be the same, for example, the leading index ranges included in the plurality of random access channel opportunities included in the first random access channel opportunity group may all be 0-63.
  • the preamble indexes included in any random access channel opportunity in the random access channel opportunity group may be different or partially different. Still taking the first random access channel opportunity group in a plurality of random access channel opportunity groups as an example, the preamble indexes included in the plurality of random access channel opportunity groups included in the first random access channel opportunity group may be different.
  • the first random access channel opportunity group includes 4 random access channel opportunities.
  • the channel opportunities may include preamble index ranges of 0-63, 64-127, 128-191, and 192-255, respectively.
  • the first random access channel opportunity group corresponds to the first opportunity group type, that is, the first random access channel opportunity group corresponds to the first opportunity group type.
  • the first opportunity group type is one of a plurality of candidate opportunity group types, and the first opportunity group type and/or the candidate opportunity group type may include a variety of information, such as a repetition factor, a frequency hopping indication, a frequency hopping spectrum, etc., which will be described in detail later in conjunction with specific examples and will not be described here.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order can be used to determine the first random access channel timing group.
  • the first node after the first node receives the first synchronization signal block, it can determine the first random access channel timing group corresponding to the first synchronization signal block according to the index of the first synchronization signal block, the first timing group type and the first mapping order, and the first random access channel timings contained in the first random access channel timing group determined by the first node according to the index of the first synchronization signal block, the first timing group type and the first mapping order are orthogonal in the time domain.
  • the first node sends multiple preambles in the first preamble group on multiple random access channel timings in the first random access channel timing group, which can reduce random access delay and improve random access resource utilization efficiency.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group from a plurality of random access channel timing groups.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group from a plurality of random access channel timing groups included in the first period.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine any random access channel timing in the first random access channel timing group from a plurality of random access channel timings included in the first period.
  • the embodiment of the present application does not specifically limit the implementation method of determining the first random access channel opportunity group by using the index of the first synchronization signal block, the first opportunity group type and the first mapping order, as long as the first random access channel opportunity group corresponding to the first synchronization signal block can be determined by combining the above three types of information.
  • the embodiment of the present application can filter out the first random access channel opportunity group from multiple random access channel opportunity groups by using the above three types of information.
  • the following exemplarily gives several implementation methods of determining the first random access channel opportunity group by using the index of the first synchronization signal block, the first opportunity group type and the first mapping order.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group, including: according to the first mapping order, the index of the first synchronization signal block is mapped to at least two random access channel timing groups among a plurality of random access channel timing groups, the at least two random access channel timing groups respectively correspond to at least two different candidate timing group types, and the first timing group type is used to determine the first random access channel timing group from the at least two random access channel timing groups.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group, including: the first timing group type is used to determine at least L random access channel timing groups from multiple random access channel timing groups, the index of the first synchronization signal block and the first mapping order are used to determine the first random access channel timing group from the at least L random access channel timing groups, and L is a positive integer greater than 1.
  • L is one of ⁇ 4, 8, 64 ⁇ .
  • any random access channel opportunity group among the multiple random access channel opportunity groups belongs to the first period.
  • the first cycle can be understood as a mapping cycle of synchronization signal blocks and random access channel opportunities.
  • the first cycle may include one or more PRACH time slots.
  • the embodiment of the present application does not limit the number of multiple PRACH time slots included in the first cycle, for example, it may include 3 PRACH time slots, 4 PRACH time slots, or a greater number of PRACH time slots.
  • any random access channel opportunity in any random access channel opportunity group in a plurality of random access channel opportunity groups belongs to one of a plurality of PRACH time slots included in the first period.
  • the first cycle includes the multiple random access channel opportunity groups mentioned above. That is, mapping multiple candidate synchronization signal block indexes to multiple random access channel opportunity groups according to the first mapping order is performed within the first cycle.
  • the first period includes multiple random access channel opportunities.
  • any random access channel opportunity in the multiple random access channel opportunity groups is one of the multiple random access channel opportunities included in the first period.
  • one or more of the multiple random access channel opportunities included in the first period can constitute any random access channel opportunity group in the multiple random access channel opportunity groups.
  • multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to a first mapping order, which may mean that multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups in a first period according to the first mapping order.
  • multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to a first mapping order, which may mean that multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunities in a first period according to a first mapping order.
  • any candidate synchronization signal block index among multiple candidate synchronization signal block indexes can be mapped to at least one random access channel opportunity group in the first period.
  • any candidate synchronization signal block index among multiple candidate synchronization signal block indexes can be mapped to at least one random access channel opportunity in the first period.
  • mapping of multiple candidate synchronization signal block indexes to multiple random access channel opportunity groups is performed within the first cycle.
  • the first period may refer to a PRACH configuration period.
  • the first period may refer to an association period (association period) of mapping multiple candidate synchronization signal block indexes to multiple random access channel time groups.
  • the first period may refer to an association pattern period (association pattern period) including one or more association periods (association period).
  • the first period of mapping multiple candidate synchronization signal block indexes to multiple random access channel opportunity groups is the minimum value in the set determined by the PRACH configuration period.
  • the set determined by the PRACH configuration period can refer to Table 1, that is, the value of the first period can be determined according to Table 1.
  • the first cycle may start from frame number 0.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group.
  • the first timing group type and the first mapping order are introduced below.
  • the first opportunity group type may include one or more of the following information: a first repetition factor, a first frequency hopping indication, and a first frequency hopping pattern.
  • the first time group type may include one of the above information, for example, only the first repetition factor, or only the first frequency hopping indication, or only the first frequency hopping spectrum.
  • the first timing group type may include multiple types of the above information, such as the first repetition factor and the first frequency hopping indication, or the first repetition factor and the first frequency hopping spectrum; or the first repetition factor, the first frequency hopping indication and the first frequency hopping spectrum, etc.
  • the first timing group type may include other information in addition to one or more of the above information, which is not limited in the embodiment of the present application.
  • the first opportunity group type may include a first repetition factor, and the number of all random access channel opportunities included in the first random access channel opportunity group is equal to the first repetition factor.
  • the first repetition factor as 4 as an example, the number of random access channel opportunities included in the first random access channel opportunity group is 4, that is, the first random access channel opportunity group includes 4 random access channel opportunities.
  • the first repetition factor is a positive integer.
  • the first repetition factor can be any positive integer, such as 2, 4, 8, 16, and so on.
  • the first repetition factor may include values which are predefined by the protocol or configured by the network.
  • the first repetition factor may be one of 2 and 4.
  • the first repetition factor may be one of 2, 4, and 8.
  • the first repetition factor may be one of 1, 2, 4, and 8.
  • the multiple repetition factors are not equal.
  • the first repetition factor is one of a plurality of repetition factors.
  • the plurality of repetition factors may refer to repetition factors of multiple PRACH transmissions, that is, the number of repetitions of PRACH transmissions.
  • the multiple repetition factors may include at least 2 and 4.
  • the multiple repetition factors may include only 2 and 4; or, the multiple repetition factors may include 2, 4, and other positive integers.
  • the multiple repetition factors may include 2, 4, and 8.
  • the multiple repetition factors may include 1, 2, and 4.
  • the multiple repetition factors may include 1, 2, 4 and 8.
  • the multiple repetition factors may be 2 and 4 respectively.
  • the multiple repetition factors may be 2, 4 and 8 respectively.
  • the multiple repetition factors may be 1, 2 and 4 respectively.
  • the multiple repetition factors may be 1, 2, 4 and 8 respectively.
  • the number of all random access channel opportunities included in any random access channel opportunity group in the multiple random access channel opportunity groups is equal to one of the multiple repetition factors. Taking the multiple repetition factors as 2 and 4 as an example, any random access channel opportunity group in the multiple random access channel opportunity groups either includes 2 random access channel opportunities or 4 random access channel opportunities.
  • the multiple candidate timing group types may include a first candidate timing group type and a second candidate timing group type, and the first candidate timing group type is different from the second candidate timing group type.
  • the first candidate timing group type being different from the second candidate timing group type may include: a repetition factor included in the first candidate timing group type is different from a repetition factor included in the second candidate timing group type.
  • the first repetition factor included in the first timing group type is different.
  • the first repetition factor is one of the above-mentioned multiple repetition factors; when the first timing group type is the second candidate timing group type, the first repetition factor is the other repetition factor among the multiple repetition factors except the repetition factor included in the first candidate timing group type.
  • the first repetition factor may be 2; when the first timing group type is the second candidate timing group type, the first repetition factor may be 4.
  • any random access channel opportunity group in the multiple random access channel opportunity groups corresponds to one of the multiple candidate opportunity group types.
  • the multiple random access channel opportunity groups include 4 random access channel opportunity groups, namely A, B, C, and D
  • the candidate opportunity group types include a first candidate opportunity group type and a second candidate opportunity group type, wherein the A random access channel opportunity group and the B random access channel opportunity group correspond to the first candidate opportunity group type, and the C random access channel opportunity group and the D random access channel opportunity group correspond to the second candidate opportunity group type.
  • multiple candidate timing group types respectively include the multiple repetition factors.
  • the first candidate timing group type among the multiple candidate timing group types may include repetition factor 2
  • the second candidate timing group type may include repetition factor 4.
  • the number of all random access channel opportunities included in the second random access channel opportunity group is equal to the repetition factor included in a candidate opportunity group type corresponding to the second random access channel opportunity group, wherein the second random access channel opportunity group is any random access channel opportunity group among multiple random access channel opportunity groups.
  • the candidate opportunity group type corresponding to the second random access channel opportunity group is the first candidate opportunity group type, and the first candidate opportunity group type includes a repetition factor of 2, then the number of random access channel opportunities included in the second random access channel opportunity group is equal to 2; if the candidate opportunity group type corresponding to the second random access channel opportunity group is the second candidate opportunity group type, and the second candidate opportunity group type includes a repetition factor of 4, then the number of random access channel opportunities included in the second random access channel opportunity group is equal to 4.
  • the multiple candidate opportunity group types respectively include the multiple repetition factors, and the number of all random access channel opportunities included in any random access channel opportunity group in the multiple random access channel opportunity groups is equal to one of the multiple repetition factors.
  • the number of all random access channel opportunities included in any random access channel opportunity group in the multiple random access channel opportunity groups can be equal to one of 1, 2, 4, and 8.
  • the first opportunity group type may include a first frequency hopping indication.
  • the first frequency hopping indication may be used to determine whether the frequency domain resources occupied by at least two random access channel opportunities in the first random access channel opportunity group are different. In other words, the first frequency hopping indication may be used to determine whether the frequency domain resources occupied by at least two random access channel opportunities in the first random access channel opportunity group are the same.
  • the multiple candidate timing group types may include a first candidate timing group type and a second candidate timing group type, and the first candidate timing group type is different from the second candidate timing group type.
  • the first candidate timing group type being different from the second candidate timing group type may include: a frequency hopping indication included in the first candidate timing group type is different from a frequency hopping indication included in the second candidate timing group type.
  • the first frequency hopping indication included in the first opportunity group type is different.
  • the first frequency hopping indication can be used to indicate that the frequency domain resources occupied by all random access channel opportunities in the first random access channel opportunity group are the same;
  • the first frequency hopping indication can be used to indicate that the frequency domain resources occupied by at least two random access channel opportunities in the first random access channel opportunity group are different.
  • the first opportunity group type may include a first frequency hopping pattern.
  • the first frequency hopping pattern is used to determine the frequency domain resources occupied by any random access channel opportunity in the first random access channel opportunity group.
  • the frequency domain resources occupied by any random access channel opportunity in the first random access channel opportunity group correspond to the first frequency hopping spectrum.
  • the plurality of candidate timing group types may include a first candidate timing group type and a second candidate timing group type, the first candidate timing group type The candidate timing group type is different from the second candidate timing group type.
  • that the first candidate timing group type is different from the second candidate timing group type may include: a frequency hopping pattern included in the first candidate timing group type is different from a frequency hopping pattern included in the second candidate timing group type.
  • the first frequency hopping spectrum included in the first opportunity group type is different.
  • the first frequency hopping spectrum included in the first opportunity group type is the A frequency hopping spectrum
  • the first frequency hopping spectrum included in the first opportunity group type is the B frequency hopping spectrum, wherein the A frequency hopping spectrum is at least partially different from the B frequency hopping spectrum.
  • the multiple candidate timing group types may respectively include multiple frequency hopping patterns.
  • the frequency domain resources occupied by any random access channel timing group in the multiple random access channel timing groups correspond to a frequency hopping pattern in the multiple frequency hopping patterns.
  • any random access channel opportunity group among a plurality of random access channel opportunity groups corresponds to one of a plurality of candidate opportunity group types
  • the plurality of candidate opportunity group types respectively include a plurality of frequency hopping spectra
  • the frequency domain resources occupied by any random access channel opportunity group among the plurality of random access channel opportunity groups correspond to a frequency hopping spectrum among the plurality of frequency hopping spectra.
  • the first timing group type is one of a plurality of candidate timing group types, and thus the plurality of candidate timing group types may include one or more of the following information: a repetition factor, a frequency hopping indication, and a frequency hopping spectrum.
  • the specific content of the information included in the plurality of candidate timing group types is similar to the information included in the first timing group type, and the specific introduction can refer to the introduction of the information included in the first timing group type in the previous text, and for the sake of brevity, it will not be repeated here.
  • multiple random access channel opportunities are divided into multiple random access channel opportunity groups using multiple candidate opportunity group types (eg, multiple repetition factors), so that the number of random access channel opportunities occupied by multiple PRACH transmissions is variable.
  • the first mapping order is described in detail below.
  • the first mapping order is associated with one or more of the following information: a preamble index within a random access channel opportunity group, frequency domain resources of multiple random access channel opportunity groups, and time domain resources of multiple random access channel opportunity groups.
  • the first mapping order may include: according to the change order of the preamble index in one random access channel opportunity group among the multiple random access channel opportunity groups, such as the order of increasing preamble index or the order of decreasing preamble index, etc.
  • the multiple candidate synchronization signal block indexes may be arranged according to the change order (e.g., increasing order) of the preamble index in one random access channel opportunity group among the multiple random access channel opportunity groups.
  • the first mapping order may include: according to the change order of frequency domain resources of multiple random access channel opportunity groups, such as the increasing order of frequency domain resources or the decreasing order of frequency domain resources, etc.
  • multiple candidate synchronization signal block indexes can arrange multiple random access channel opportunity groups of frequency division multiplexing according to the change order of frequency domain resources of multiple random access channel opportunity groups (for example, increasing order).
  • the first mapping order may include: according to the change order of time domain resources of multiple random access channel opportunity groups, such as the order of increasing time domain resources or the order of decreasing time domain resources, etc.
  • multiple candidate synchronization signal block indexes can arrange multiple random access channel opportunity groups for time division multiplexing according to the change order of time domain resources of multiple random access channel opportunity groups (for example, increasing order).
  • the first mapping order may include one or more of the following orders: an order according to the increasing order of the leading index within a random access channel opportunity group among multiple random access channel opportunity groups; an order according to the increasing order of the frequency domain resources of multiple random access channel opportunity groups; and an order according to the increasing order of the time domain resources of multiple random access channel opportunity groups.
  • the first mapping order may include: first, according to the ascending order of the leading index within a random access channel opportunity group among multiple random access channel opportunity groups; second, according to the ascending order of the frequency domain resources of multiple random access channel opportunity groups; and third, according to the ascending order of the time domain resources of multiple random access channel opportunity groups.
  • the embodiments of the present application are not limited thereto, and the above-mentioned several orders included in the first mapping order can be randomly arranged and combined, and the order between them can also be swapped.
  • the first mapping order may include: firstly according to the order of increasing preamble index in a random access channel opportunity group among multiple random access channel opportunity groups; secondly according to the order of increasing time domain resources of multiple random access channel opportunity groups; thirdly according to the order of increasing frequency domain resources of multiple random access channel opportunity groups, and so on.
  • the multiple random access channel opportunity groups may include multiple random access channel opportunities, and each of the multiple random access channel opportunities included in the multiple random access channel opportunity groups may belong to only one random access channel opportunity group in the multiple random access channel opportunity groups.
  • the multiple random access channel opportunity groups will not repeat, that is, the resources occupied by the multiple random access channel opportunity groups (for example, random access channel opportunities) will not overlap.
  • each random access channel opportunity among a plurality of random access channel opportunities belongs to only one random access channel opportunity group is given below in conjunction with FIG. 4 .
  • the multiple repetition factors included in the multiple candidate timing group types are 1, 2, and 4, respectively, where 4 is the maximum repetition factor Qmax, or in other words, the maximum repetition factor Qmax of the multi-PRACH transmission is 4.
  • all random access channel opportunities in the first period can be divided into Multiple random access channel opportunity groups.
  • all random access channel opportunities in the first cycle are divided into multiple random access channel opportunity groups in descending order of multiple repetition factors included in multiple candidate opportunity group types.
  • each dotted box represents a random access channel opportunity group, and the random access channel opportunity group is divided in descending order according to a plurality of repetition factors (1, 2 and 4).
  • the multiple random access channel opportunity groups include multiple random access channel opportunities.
  • any random access channel opportunity included in the multiple random access channel opportunity groups it only belongs to one random access channel opportunity group.
  • random access channel opportunity 1 (RO1 in the figure) only belongs to one random access channel (ROG1 in the figure)
  • random access channel opportunity 8 (RO8 in the figure) only belongs to one random access channel (ROG2 in the figure)
  • ROG2 random access channel
  • the multiple random access channel opportunity groups include multiple random access channel opportunities. For each random access channel opportunity included in the multiple random access channel opportunity groups, different candidate synchronization signal block indexes are mapped to different preambles in the multiple preambles included in each random access channel opportunity.
  • candidate synchronization signal block index 0 and candidate synchronization signal block index 1 are both mapped to random access channel opportunity 1, but candidate synchronization signal block index 0 and candidate synchronization signal block index 1 are mapped to different preambles in random access channel opportunity 1, such as candidate synchronization signal block index 0 is mapped to preambles 0-21 in random access channel opportunity 1, and candidate synchronization signal block index 1 is mapped to preambles 22-43 in random access channel opportunity 1.
  • the multiple random access channel opportunity groups may include multiple random access channel opportunities, and each random access channel opportunity of the multiple random access channel opportunity groups may be shared by at least two random access channel opportunity groups in the multiple random access channel opportunity groups.
  • the resources occupied by the multiple random access channel opportunity groups e.g., random access channel opportunities
  • each random access channel opportunity in a plurality of random access channel opportunity groups is shared by at least two random access channel opportunity groups in a plurality of random access channel opportunity groups is given below in conjunction with FIG. 5 .
  • the multiple repetition factors included in the multiple candidate opportunity group types are 1, 2 and 4, respectively, where 4 is the maximum repetition factor Qmax, or in other words, the maximum repetition factor Qmax of the multiple PRACH transmissions is 4.
  • all random access channel opportunities in the first period may be divided into multiple random access channel opportunity groups according to the multiple repetition factors included in the multiple candidate opportunity group types.
  • all random access channel opportunities in the first period are divided into multiple random access channel opportunity groups according to multiple repetition factors included in multiple candidate opportunity group types.
  • each dotted box represents a random access channel opportunity group, and the random access channel opportunity group is divided according to multiple repetition factors (1, 2, and 4).
  • the dotted oval box and the dotted square box represent the random access channel opportunity groups obtained by dividing according to different repetition factors.
  • the dotted oval box represents the random access channel opportunity group obtained by dividing according to the repetition factor of 4
  • the dotted square box represents the random access channel opportunity group obtained by dividing according to the repetition factor of 2.
  • the multiple random access channel opportunity groups include multiple random access channel opportunities.
  • any random access channel opportunity included in the multiple random access channel opportunity groups it is shared by at least two random access channel opportunity groups in the multiple random access channel opportunity groups.
  • random access channel opportunity 1 (RO1 in the figure) is shared by two random access channel opportunity groups (ROG1 and ROG7 in the figure)
  • random access channel opportunity 8 (RO8 in the figure) is shared by two random access channel opportunity groups (ROG2 and ROG8 in the figure), and so on.
  • the multiple random access channel opportunity groups include multiple random access channel opportunities. For each random access channel opportunity included in the multiple random access channel opportunity groups, at least two random access channel opportunity groups that share the random access channel opportunity are mapped to different preambles among the multiple preambles included in the random access channel opportunity.
  • random access channel opportunity group 1 and random access channel opportunity group 7 share random access channel opportunity 1, and both are mapped to random access channel opportunity 1, but random access channel opportunity group 1 and random access channel opportunity group 7 are mapped to different preambles in random access channel opportunity 1, such as random access channel opportunity group 1 is mapped to preambles 0-21 in random access channel opportunity 1, and random access channel opportunity group 7 is mapped to preambles 22-43 in random access channel opportunity 1.
  • Figure 6 is another example in which each random access channel opportunity in a plurality of random access channel opportunities is shared by at least two random access channel opportunity groups in a plurality of random access channel opportunity groups.
  • the solution of Figure 6 can be understood as a combination (or hybrid) of the implementations shown in Figures 4 and 5 .
  • the multiple repetition factors included in the multiple candidate opportunity group types are 1, 2 and 4 respectively, where 4 is the maximum repetition factor Qmax, or in other words, the maximum repetition factor Qmax of multiple PRACH transmissions is 4.
  • all random access channel opportunities in the first period can be first divided into multiple random access channel opportunity groups according to the multiple repetition factors included in the multiple candidate opportunity group types in turn (that is, first divided into multiple random access channel opportunity groups according to the implementation method shown in FIG4 ).
  • the random access channel opportunity groups whose preambles have not been used up in the multiple random access channel opportunity groups are divided twice, and the candidate opportunity group types (for example, repetition factors) corresponding to the two divisions are different.
  • the secondary division may be performed according to the implementation method shown in FIG5 .
  • each dotted box represents a random access channel opportunity group
  • the dotted ellipse box represents a plurality of random access channel opportunity groups obtained by dividing in sequence according to a plurality of repetition factors included in a plurality of candidate opportunity group types
  • the dotted square box represents a random access channel opportunity group obtained by secondary division of a random access channel opportunity group that has not been used up in the leading section.
  • the multiple random access channel opportunity groups include multiple random access channel opportunities.
  • any random access channel opportunity included in the multiple random access channel opportunity groups it may belong to only one random access channel opportunity group, or may be shared by at least two random access channel opportunity groups in the multiple random access channel opportunity groups.
  • random access channel opportunity 1 (RO1 in the figure) belongs only to random access channel opportunity group 1 (ROG1 in the figure)
  • random access channel opportunity 13 (RO13 in the figure) is shared by two random access channel opportunity groups (ROG4 and ROG12 in the figure), and so on.
  • the multiple random access channel opportunity groups include multiple random access channel opportunities. For each random access channel opportunity included in the multiple random access channel opportunity groups, if the random access channel opportunity belongs to only one random access channel opportunity group, different candidate synchronization signal block indexes may be mapped to different preambles in the multiple preambles included in each random access channel opportunity.
  • candidate synchronization signal block index 0 and candidate synchronization signal block index 1 are both mapped to random access channel opportunity 1, but candidate synchronization signal block index 0 and candidate synchronization signal block index 1 are mapped to different preambles in random access channel opportunity 1, such as candidate synchronization signal block index 0 is mapped to preambles 0-21 in random access channel opportunity 1, and candidate synchronization signal block index 1 is mapped to preambles 22-43 in random access channel opportunity 1.
  • the random access channel opportunity is shared by at least two random access channel opportunity groups, at least two random access channel opportunity groups that share the random access channel opportunity may be mapped to different preambles in the multiple preambles included in the random access channel opportunity.
  • random access channel opportunity group 4 and random access channel opportunity group 12 share random access channel opportunity 13, and both are mapped to random access channel opportunity 13, but random access channel opportunity group 4 and random access channel opportunity group 12 are mapped to different preambles in random access channel opportunity 13, for example, random access channel opportunity group 4 is mapped to preambles 0-21 in random access channel opportunity 13, and random access channel opportunity group 12 is mapped to preambles 22-43 in random access channel opportunity 13.
  • Fig. 7 is a flow chart of a method in a node for wireless communication provided by another embodiment of the present application.
  • the method shown in Fig. 7 may include steps S710 to S730.
  • step S710 the first node receives a first synchronization signal block.
  • step S720 the first node sends a first preamble group.
  • step S710 and step S720 please refer to the previous description of step S310 and step S320, which will not be repeated here.
  • step S730 in response to sending the first preamble group, the first node receives a first random access response within a first time window.
  • the first random access channel opportunity group may be used to determine one or more of the following: determining a start of a first time window, and determining a scrambling sequence of a first random access response.
  • the first random access channel opportunity group is used for starting the first time window.
  • the first random access channel opportunity group is used for the start of the first time window and a scrambling sequence of the first random access response.
  • FIG8 is a schematic diagram of the structure of a first node provided in an embodiment of the present application.
  • the first node 800 shown in FIG8 may include a first receiver 810 and a first transmitter 820.
  • the first receiver 810 may be configured to receive a first synchronization signal block, the index of the first synchronization signal block being one of a plurality of candidate synchronization signal block indexes.
  • the first transmitter 820 can be used to send a first preamble group, the first preamble group includes multiple preambles; the first random access channel opportunity group includes multiple random access channel opportunities, and the multiple random access channel opportunities in the first random access channel opportunity group are respectively used to send the multiple preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to a first mapping order, and the first random access channel opportunity group is one of the multiple random access channel opportunity groups; the first random access channel opportunity group corresponds to a first opportunity group type, and the first opportunity group type is one of multiple candidate opportunity group types; the index of the first synchronization signal block, the first opportunity group type and the first mapping order are used to determine the first random access channel opportunity group.
  • any random access channel opportunity group among the multiple random access channel opportunity groups belongs to the first period.
  • the first opportunity group type includes a first repetition factor, the number of random access channel opportunities included in the first random access channel opportunity group is equal to the first repetition factor, and the first repetition factor is one of multiple repetition factors.
  • any random access channel opportunity group among the multiple random access channel opportunity groups corresponds to one of the multiple candidate opportunity group types; the multiple candidate opportunity group types respectively include the multiple repetition factors, and the number of random access channel opportunities included in the second random access channel opportunity group is equal to the repetition factor included in the candidate opportunity group type corresponding to the second random access channel opportunity group, wherein the second random access channel opportunity group is any random access channel opportunity group among the multiple random access channel opportunity groups.
  • the first opportunity group type includes a first frequency hopping indication; the first frequency hopping indication is used to determine whether frequency domain resources occupied by at least two random access channel opportunities in the first random access channel opportunity group are different.
  • the first opportunity group type includes a first frequency hopping spectrum; and frequency domain resources occupied by any random access channel opportunity in the first random access channel opportunity group correspond to the first frequency hopping spectrum.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group, including: according to the first mapping order, the index of the first synchronization signal block is mapped to at least two random access channel timing groups among the multiple random access channel timing groups, the at least two random access channel timing groups respectively correspond to at least two different candidate timing group types, and the first timing group type is used to determine the first random access channel timing group from the at least two random access channel timing groups.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group, including: the first timing group type is used to determine at least L random access channel timing groups from the multiple random access channel timing groups, the index of the first synchronization signal block and the first mapping order are used to determine the first random access channel timing group from the at least L random access channel timing groups, and L is a positive integer greater than 1.
  • the first mapping order includes one or more of the following orders: in an ascending order of the leading index within a random access channel opportunity group among the multiple random access channel opportunity groups; in an ascending order of the frequency domain resources of the multiple random access channel opportunity groups; in an ascending order of the time domain resources of the multiple random access channel opportunity groups.
  • the first mapping order includes: first, according to the ascending order of the leading index within a random access channel opportunity group among the multiple random access channel opportunity groups; second, according to the ascending order of the frequency domain resources of the multiple random access channel opportunity groups; and third, according to the ascending order of the time domain resources of the multiple random access channel opportunity groups.
  • the multiple random access channel opportunity groups include multiple random access channel opportunities, each random access channel opportunity among the multiple random access channel opportunity groups included in the multiple random access channel opportunity groups belongs to only one random access channel opportunity group among the multiple random access channel opportunity groups; or each random access channel opportunity is shared by at least two random access channel opportunity groups among the multiple random access channel opportunity groups.
  • At least two random access channel opportunities in at least one random access channel opportunity group among the multiple random access channel opportunity groups belong to two different time slots.
  • the first node 800 also includes: a second receiver, used to receive a first random access response within a first time window as a response to sending the first preamble group; wherein the first random access channel opportunity group is used to determine the start of the first time window; and the first random access channel opportunity group is used to determine an encryption sequence of the first random access response.
  • the first receiver 810 and the first transmitter 820 may be a transceiver 1030.
  • the first node 800 may further include a processor 1010 and a memory 1020, as specifically shown in FIG10 .
  • FIG9 is a schematic diagram of the structure of a second node provided in an embodiment of the present application.
  • the second node 900 shown in FIG9 may include a first transmitter 910 and a first receiver 920.
  • the first transmitter 910 can be used to send one or more synchronization signal blocks, the first synchronization signal block is one of the one or more synchronization signal blocks, and the index of the first synchronization signal block is one of multiple candidate synchronization signal block indexes.
  • the first receiver 920 can be used to receive a first preamble group, the first preamble group includes multiple preambles; the first random access channel opportunity group includes multiple random access channel opportunities, and the multiple random access channel opportunities in the first random access channel opportunity group are respectively used to transmit the multiple preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to a first mapping order, and the first random access channel opportunity group is one of the multiple random access channel opportunity groups; the first random access channel opportunity group corresponds to a first opportunity group type, and the first opportunity group type is one of multiple candidate opportunity group types; the index of the first synchronization signal block, the first opportunity group type and the first mapping order are used to determine the first random access channel opportunity group.
  • any random access channel opportunity group among the multiple random access channel opportunity groups belongs to the first period.
  • the first opportunity group type includes a first repetition factor, the number of random access channel opportunities included in the first random access channel opportunity group is equal to the first repetition factor, and the first repetition factor is one of multiple repetition factors.
  • any random access channel opportunity group in the multiple random access channel opportunity groups corresponds to one of the multiple candidate opportunity group types; the multiple candidate opportunity group types respectively include the multiple repetition factors, the second random access channel opportunity
  • the number of random access channel opportunities included in the group is equal to the repetition factor included in the candidate opportunity group type corresponding to the second random access channel opportunity group, wherein the second random access channel opportunity group is any random access channel opportunity group among the multiple random access channel opportunity groups.
  • the first opportunity group type includes a first frequency hopping indication; the first frequency hopping indication is used to determine whether frequency domain resources occupied by at least two random access channel opportunities in the first random access channel opportunity group are different.
  • the first opportunity group type includes a first frequency hopping spectrum; and frequency domain resources occupied by any random access channel opportunity in the first random access channel opportunity group correspond to the first frequency hopping spectrum.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group, including: according to the first mapping order, the index of the first synchronization signal block is mapped to at least two random access channel timing groups among the multiple random access channel timing groups, the at least two random access channel timing groups respectively correspond to at least two different candidate timing group types, and the first timing group type is used to determine the first random access channel timing group from the at least two random access channel timing groups.
  • the index of the first synchronization signal block, the first timing group type and the first mapping order are used to determine the first random access channel timing group, including: the first timing group type is used to determine at least L random access channel timing groups from the multiple random access channel timing groups, the index of the first synchronization signal block and the first mapping order are used to determine the first random access channel timing group from the at least L random access channel timing groups, and L is a positive integer greater than 1.
  • the first mapping order includes one or more of the following orders: in an ascending order of the leading index within a random access channel opportunity group among the multiple random access channel opportunity groups; in an ascending order of the frequency domain resources of the multiple random access channel opportunity groups; in an ascending order of the time domain resources of the multiple random access channel opportunity groups.
  • the first mapping order includes: first, according to the ascending order of the leading index within a random access channel opportunity group among the multiple random access channel opportunity groups; second, according to the ascending order of the frequency domain resources of the multiple random access channel opportunity groups; and third, according to the ascending order of the time domain resources of the multiple random access channel opportunity groups.
  • the multiple random access channel opportunity groups include multiple random access channel opportunities, each random access channel opportunity among the multiple random access channel opportunity groups included in the multiple random access channel opportunity groups belongs to only one random access channel opportunity group among the multiple random access channel opportunity groups; or each random access channel opportunity is shared by at least two random access channel opportunity groups among the multiple random access channel opportunity groups.
  • At least two random access channel opportunities in at least one random access channel opportunity group among the multiple random access channel opportunity groups belong to two different time slots.
  • the second node 900 includes: a second transmitter, used to send a first random access response within a first time window as a response to receiving the first preamble group; wherein the first random access channel opportunity group is used to determine the start of the first time window; and the first random access channel opportunity group is used to determine an encryption sequence of the first random access response.
  • the first transmitter 910 and the first receiver 920 may be a transceiver 1030.
  • the second node 900 may further include a processor 1010 and a memory 1020, as specifically shown in FIG10 .
  • FIG10 is a schematic structural diagram of a communication device according to an embodiment of the present application.
  • the dotted lines in FIG10 indicate that the unit or module is optional.
  • the device 1000 may be used to implement the method described in the above method embodiment.
  • the device 1000 may be a chip, a user device, or a network device.
  • the device 1000 may include one or more processors 1010.
  • the processor 1010 may support the device 1000 to implement the method described in the method embodiment above.
  • the processor 1010 may be a general-purpose processor or a special-purpose processor.
  • the processor may be a central processing unit (CPU).
  • the processor may also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • DSP digital signal processor
  • ASIC application specific integrated circuits
  • FPGA field programmable gate arrays
  • a general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
  • the apparatus 1000 may further include one or more memories 1030.
  • the memory 1030 stores a program, which can be executed by the processor 1010, so that the processor 1010 executes the method described in the above method embodiment.
  • the memory 1030 may be independent of the processor 1010 or integrated in the processor 1010.
  • the apparatus 1000 may further include a transceiver 1030.
  • the processor 1010 may communicate with other devices or chips through the transceiver 1030.
  • the processor 1010 may transmit and receive data with other devices or chips through the transceiver 1030.
  • Figure 11 is a schematic diagram of the hardware modules of the communication device provided in the embodiment of the present application. Specifically, Figure 11 shows a block diagram of a first communication device 450 and a second communication device 410 communicating with each other in an access network.
  • the first communication device 450 includes a controller/processor 459, a memory 460, a data source 467, a transmit processor 468, a receive processor 456, a multi-antenna transmit processor 457, a multi-antenna receive processor 458, a transmitter/receiver 454 and an antenna 452.
  • the second communication device 410 includes a controller/processor 475, a memory 476, a data source 477, a receiving processor 470, a transmitting processor 416, multi-antenna receive processor 472, multi-antenna transmit processor 471, transmitter/receiver 418 and antenna 420.
  • the upper layer data packets from the core network or the upper layer data packets from the data source 477 are provided to the controller/processor 475.
  • the core network and the data source 477 represent all the protocol layers above the L2 layer.
  • the controller/processor 475 implements the functionality of the L2 layer.
  • the controller/processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and allocation of radio resources to the first communication device 450 based on various priority metrics.
  • the controller/processor 475 is also responsible for the retransmission of lost packets and signaling to the first communication device 450.
  • the transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer).
  • the transmit processor 416 implements coding and interleaving to facilitate forward error correction at the second communication device 410, as well as mapping of signal constellations based on various modulation schemes (e.g., binary phase shift keying, quadrature phase shift keying, M phase shift keying, M quadrature amplitude modulation).
  • the multi-antenna transmit processor 471 performs digital spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing on the coded and modulated symbols to generate one or more spatial streams.
  • the transmit processor 416 maps each spatial stream to a subcarrier, multiplexes it with a reference signal (e.g., a pilot) in the time domain and/or frequency domain, and then uses an inverse fast Fourier transform to generate a physical channel carrying a time domain multi-carrier symbol stream.
  • the multi-antenna transmit processor 471 then performs a transmit analog precoding/beamforming operation on the time domain multi-carrier symbol stream.
  • Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 471 into a radio frequency stream, which is then provided to different antennas 420.
  • each receiver 454 receives a signal through its corresponding antenna 452.
  • Each receiver 454 recovers the information modulated onto the radio frequency carrier, and converts the radio frequency stream into a baseband multi-carrier symbol stream and provides it to the receiving processor 456.
  • the receiving processor 456 and the multi-antenna receiving processor 458 implement various signal processing functions of the L1 layer.
  • the multi-antenna receiving processor 458 performs a receiving analog precoding/beamforming operation on the baseband multi-carrier symbol stream from the receiver 454.
  • the receiving processor 456 uses a fast Fourier transform to convert the baseband multi-carrier symbol stream after the receiving analog precoding/beamforming operation from the time domain to the frequency domain.
  • the physical layer data signal and the reference signal are demultiplexed by the receiving processor 456, wherein the reference signal will be used for channel estimation, and the data signal is recovered after multi-antenna detection in the multi-antenna receiving processor 458 to any spatial stream with the first communication device 450 as the destination.
  • the symbols on each spatial stream are demodulated and recovered in the receiving processor 456, and soft decisions are generated.
  • the receiving processor 456 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communication device 410 on the physical channel.
  • the upper layer data and control signals are then provided to the controller/processor 459.
  • the controller/processor 459 implements the functions of the L2 layer.
  • the controller/processor 459 may be associated with a memory 460 that stores program codes and data.
  • the memory 460 may be referred to as a computer-readable medium.
  • the controller/processor 459 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover the upper layer data packets from the second communication device 410.
  • the upper layer data packets are then provided to all protocol layers above the L2 layer.
  • Various control signals may also be provided to the L3 for L3 processing.
  • the upper layer data packets are provided to the controller/processor 459 using the data source 467.
  • the data source 467 represents all the protocol layers above the L2 layer.
  • the controller/processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels, and implements L2 layer functions for user plane and control plane.
  • the controller/processor 459 is also responsible for the retransmission of lost packets and signaling to the second communication device 410.
  • the transmit processor 468 performs modulation mapping and channel coding processing, and the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing. Then, the transmit processor 468 modulates the generated spatial stream into a multi-carrier/single-carrier symbol stream, which is then provided to different antennas 452 via the transmitter 454 after analog precoding/beamforming operations in the multi-antenna transmit processor 457. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a radio frequency symbol stream, and then provides it to the antenna 452.
  • the function at the second communication device 410 is similar to the reception function at the first communication device 450 described in the transmission from the second communication device 410 to the first communication device 450.
  • Each receiver 418 receives a radio frequency signal through its corresponding antenna 420, converts the received radio frequency signal into a baseband signal, and provides the baseband signal to the multi-antenna reception processor 472 and the reception processor 470.
  • the reception processor 470 and the multi-antenna reception processor 472 jointly implement the functions of the L1 layer.
  • the controller/processor 475 implements the L2 layer functions.
  • the controller/processor 475 can be associated with a memory 476 storing program codes and data.
  • the memory 476 can be referred to as a computer-readable medium.
  • the controller/processor 475 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover the upper layer data packets from the first communication device 450.
  • the upper layer data packets from the controller/processor 475 may be provided to the core network or all protocol layers above the L2 layer, and various control signals may also be provided to the core network or L3 for L3 processing.
  • the first communication device 450 comprises: at least one processor and at least one memory, wherein the at least one memory comprises a computer program code; the at least one memory and the computer program code are configured to communicate with the at least one processor. Used together with a processor, the first communication device 450 device at least: receives a first synchronization signal block, the index of the first synchronization signal block is one of multiple candidate synchronization signal block indexes; sends a first preamble group, the first preamble group includes multiple preambles; a first random access channel opportunity group includes multiple random access channel opportunities, the multiple random access channel opportunities in the first random access channel opportunity group are respectively used to send the multiple preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the multiple candidate synchronization signal block indexes are mapped to multiple random access channel opportunity groups according to a first mapping order, and the first random access channel opportunity group is one of the multiple random access channel opportunity groups; the first
  • the first communication device 450 apparatus includes: a memory storing a computer-readable instruction program, the computer-readable instruction program generates an action when executed by at least one processor, the action including: receiving a first synchronization signal block, the index of the first synchronization signal block is one of a plurality of candidate synchronization signal block indexes; sending a first preamble group, the first preamble group including a plurality of preambles; a first random access channel opportunity group including a plurality of random access channel opportunities, the plurality of random access channel opportunities in the first random access channel opportunity group being respectively used to send the plurality of preambles in the first preamble group; any two random access channel opportunities in the first random access channel opportunity group are orthogonal in the time domain; wherein the plurality of candidate synchronization signal block indexes are mapped to a plurality of random access channel opportunity groups according to a first mapping order, the first random access channel opportunity group being one of the plurality of random access channel opportunity groups; the first random access channel opportunity group
  • the first communication device 450 corresponds to the first node in this application.
  • the second communication device 410 corresponds to the second node in this application.
  • the first communication device 450 is a UE.
  • the first communication device 450 is a user equipment supporting V2X.
  • the first communication device 450 is a user equipment supporting D2D.
  • the first communication device 450 is a network control relay.
  • the first communication device 450 is a relay.
  • the second communication device 410 is a base station.
  • the antenna 452, the receiver 454, the multi-antenna receiving processor 458, the receiving processor 456, and the controller/processor 459 are used to receive the first synchronization signal block in the present application.
  • the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, and the controller/processor 475 are used to send one or more synchronization signal blocks in the present application, and the first synchronization signal block is one of the one or more synchronization signal blocks.
  • the antenna 452, the transmitter 454, the multi-antenna transmit processor 457, the transmit processor 468, and the controller/processor 459 are used to send the first preamble group in this application.
  • the antenna 420, the receiver 418, the multi-antenna receiving processor 472, the receiving processor 470, and the controller/processor 475 are used to receive the first preamble group in the present application.
  • the present application also provides a computer-readable storage medium for storing a program.
  • the computer-readable storage medium can be applied to a terminal or network device provided in the present application, and the program enables a computer to execute the method performed by the terminal or network device in each embodiment of the present application.
  • the embodiment of the present application also provides a computer program product.
  • the computer program product includes a program.
  • the computer program product can be applied to the terminal or network device provided in the embodiment of the present application, and the program enables the computer to execute the method performed by the terminal or network device in each embodiment of the present application.
  • the embodiment of the present application also provides a computer program.
  • the computer program can be applied to the terminal or network device provided in the embodiment of the present application, and the computer program enables a computer to execute the method executed by the terminal or network device in each embodiment of the present application.
  • the "indication" mentioned can be a direct indication, an indirect indication, or an indication of an association relationship.
  • a indicates B which can mean that A directly indicates B, for example, B can be obtained through A; it can also mean that A indirectly indicates B, for example, A indicates C, B can be obtained through C; it can also mean that there is an association relationship between A and B.
  • B corresponding to A means that B is associated with A, and B can be determined based on A.
  • Determining B based on A does not mean that B is determined based on A alone.
  • B can also be determined based on A and/or other information.
  • the term "corresponding" may indicate that there is a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship of indication and being indicated, configuration and being configured, etc.
  • pre-definition or “pre-configuration” can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, including a user device and a network device), and the present application does not limit the specific implementation method.
  • pre-definition can refer to what is defined in the protocol.
  • the “protocol” may refer to a standard protocol in the communication field, for example, it may include an LTE protocol, an NR protocol, and related protocols used in future communication systems, and the present application does not limit this.
  • the term "and/or" is only a description of the association relationship of the associated objects, indicating that there can be three relationships.
  • a and/or B can represent: A exists alone, A and B exist at the same time, and B exists alone.
  • the character "/" in this article generally indicates that the associated objects before and after are in an "or" relationship.
  • the size of the serial numbers of the above-mentioned processes does not mean the order of execution.
  • the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.
  • Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer instructions can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center.
  • the computer-readable storage medium can be any available medium that can be read by a computer or a data storage device such as a server or data center that includes one or more available media integrated.
  • the available medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a digital video disc (DVD)), or a semiconductor medium (e.g., a solid state disk (SSD)), etc.
  • a magnetic medium e.g., a floppy disk, a hard disk, a magnetic tape
  • an optical medium e.g., a digital video disc (DVD)
  • DVD digital video disc
  • SSD solid state disk

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Databases & Information Systems (AREA)

Abstract

本申请提供了一种用于无线通信的节点中的方法和装置。该方法包括：接收第一同步信号块，第一同步信号块的索引是多个候选同步信号块索引之一；发送第一前导组，第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，该多个随机接入信道时机分别被用于发送该多个前导；第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，第一随机接入信道时机组是多个随机接入信道时机组之一；第一随机接入信道时机组对应于第一时机组类型；第一同步信号块的索引，第一时机组类型和第一映射顺序被用于确定第一随机接入信道时机组。

Description

用于无线通信的节点中的方法和装置 技术领域
本申请涉及通信技术领域，并且更为具体地，涉及一种用于无线通信的节点中的方法和装置。
背景技术
为了增强随机接入的覆盖性能，某些通信系统(比如，新无线(new radio，NR)系统)计划引入基于多物理随机接入信道(physical random access channel，PRACH)传输的方案。然而，在多PRACH传输的场景中，用于无线通信的传统的同步信号块(Synchronization Signal/Physical Broadcast Channel block，简称为SSB或SS/PBCH block)与随机接入时机(Random Access Occasion，RO，也可以称为PRACH Occasion)的映射方法可能导致多个随机接入时机在时域上有重叠，不但对系统配置带来更高的要求，还增加系统处理复杂度，增大发射功率开销；也可能导致多个随机接入时机之间有较大的时间间隔，从而扩大系统的接入延迟；也可能导致降低随机接入资源的利用效率；也可能导致增加额外的信令开销。
发明内容
有鉴于此，本申请实施例致力于提供一种用于无线通信的节点中的方法和装置，下面对本申请涉及的各个方面进行介绍。
第一方面，提供了一种用于无线通信的第一节点中的方法，包括：接收第一同步信号块，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；发送第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
第二方面，提供了一种用于无线通信的第二节点中的方法，包括：发送一个或多个同步信号块，第一同步信号块是所述一个或多个同步信号块中的之一，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；接收第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
第三方面，提供了一种用于无线通信的第一节点，包括：第一接收机，用于接收第一同步信号块，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；第一发射机，用于发送第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
第四方面，提供了一种用于无线通信的第二节点，包括：第一发射机，用于发送一个或多个同步信号块，第一同步信号块是所述一个或多个同步信号块中的之一，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；第一接收机，用于接收第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之 一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
第五方面，提供了一种用于无线通信的第一节点，包括处理器、存储器以及通信接口，所述存储器用于存储一个或多个计算机程序，所述处理器用于调用所述存储器中的计算机程序使得所述第一节点执行第一方面的方法中的部分或全部步骤。
第六方面，提供了一种用于无线通信的第二节点，包括处理器、存储器以及通信接口，所述存储器用于存储一个或多个计算机程序，所述处理器用于调用所述存储器中的计算机程序使得所述第二节点执行第二方面的方法中的部分或全部步骤。
第七方面，本申请实施例提供了一种通信系统，该系统包括上述的第一节点和/或第二节点。在另一种可能的设计中，该系统还可以包括本申请实施例提供的方案中与该第一节点或第二节点进行交互的其他设备。
第八方面，本申请实施例提供了一种计算机可读存储介质，所述计算机可读存储介质存储有计算机程序，所述计算机程序使得第一节点或第二节点执行上述各个方面的方法中的部分或全部步骤。
第九方面，本申请实施例提供了一种计算机程序产品，其中，所述计算机程序产品包括存储了计算机程序的非瞬时性计算机可读存储介质，所述计算机程序可操作来使第一节点或第二节点执行上述各个方面的方法中的部分或全部步骤。在一些实现方式中，该计算机程序产品可以为一个软件安装包。
第十方面，本申请实施例提供了一种芯片，该芯片包括存储器和处理器，处理器可以从存储器中调用并运行计算机程序，以实现上述各个方面的方法中所描述的部分或全部步骤。
本申请实施例中，第一节点能够根据第一同步信号块的索引、第一时机组类型和第一映射顺序确定第一同步信号块对应的第一随机接入信道时机组，使得确定的第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的，即第一随机接入信道时机组中的任意两个随机接入信道时机在时域上不会重叠。
本申请实施例中，第一节点根据第一同步信号块的索引、第一时机组类型和第一映射顺序确定的第一随机接入信道时机组中的任意两个随机接入信道时机在时域上不会重叠。本申请实施例通过改变同步信号块与随机接入时机的映射方法来保证第一随机接入信道时机组中的任意两个随机接入信道时机在时域上不会重叠，从而可以降低对系统配置的要求，降低系统处理复杂度，以及节省发射功率开销。
本申请实施例提供的同步信号块与随机接入时机的映射方法，有利于保证确定的第一随机接入信道时机组中的多个随机接入信道时机之间的时间间隔较小，从而有利于减小系统的接入延迟。
此外，本申请实施例提供的同步信号块与随机接入时机的映射方法，有利于提升随机接入资源的利用效率，或者有利于节省信令开销。
附图说明
图1为可应用本申请实施例的无线通信系统的系统架构示例图。
图2为同步信号块与随机接入信道时机的映射关系的示例图。
图3为本申请实施例提供的用于无线通信的方法的流程示意图。
图4为本申请一实施例提供的同步信号块与随机接入信道时机组的映射关系的示例图。
图5为本申请另一实施例提供的同步信号块与随机接入信道时机组的映射关系的示例图。
图6为本申请又一实施例提供的同步信号块与随机接入信道时机组的映射关系的示例图。
图7为本申请另一实施例提供的用于无线通信的方法的流程示意图。
图8为本申请实施例提供的第一节点的结构示意图。
图9为本申请实施例提供的第二节点的结构示意图。
图10为本申请实施例提供的通信装置的示意性结构图。
图11为本申请实施例提供的通信设备的硬件模块示意图。
具体实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅是本申请一部分实施例，而不是全部的实施例。
通信系统架构
图1是可应用本申请实施例的无线通信系统100的系统架构示例图。该无线通信系统100可以包括网络设备110和用户设备(user equipment，UE)120。网络设备110可以是与用户设备120通信的设备。网络设备110可以为特定的地理区域提供通信覆盖，并且可以与位于该覆盖区域内的用户设备120 进行通信。
图1示例性地示出了一个网络设备和两个用户设备，可选地，该无线通信系统100可以包括多个网络设备并且每个网络设备的覆盖范围内可以包括其它数量的用户设备，本申请实施例对此不做限定。
可选地，该无线通信系统100还可以包括网络控制器、移动管理实体等其他网络实体，本申请实施例对此不作限定。
应理解，虽然本申请实施例的技术方案是针对随机接入，但本申请实施例的技术方案也能被用于波束失败恢复(Beam Failure Recovery)。进一步的，虽然本申请实施例的技术方案是针对随机接入流程类型-1(Type-1 random access procedure)，但本申请实施例的技术方案也能被用随机接入流程类型-2(Type-2 random access procedure)。进一步的，虽然本申请实施例的技术方案是针对Uu接口，但本申请实施例的技术方案也能被用PC5接口。进一步的，虽然本申请实施例的技术方案是针对单载波通信，但本申请实施例的技术方案也能被用于多载波通信。进一步的，虽然本申请实施例的技术方案是针对多天线通信，但本申请实施例的技术方案也能被用于单天线通信。进一步的，虽然本申请实施例的技术方案是针对用户设备与基站的场景，但本申请实施例的技术方案也同样适用于V2X场景，用户设备与中继，以及中继与基站之间的通信场景，取得类似的用户设备与基站场景中的技术效果。进一步的，本申请实施例的技术方案可以应用于各种通信场景，例如：增强移动宽带(Enhanced Mobile Broadband，eMBB)场景、超高可靠低时延通信(Ultra Reliable & Low Latency Communication，URLLC)场景、大规模物联网(Massive Machine Type Communication，mMTC)场景等。此外，不同场景采用统一的解决方案还有助于降低硬件复杂度和成本。
应理解，在不冲突的情况下，本申请的第一节点中的实施例和实施例中的特征可以应用到第二节点中，反之亦然。在不冲突的情况下，本申请的实施例和实施例中的特征可以任意相互组合。
应理解，本申请实施例的技术方案可以应用于各种通信系统，例如：第五代(5th generation，5G)系统或新无线(new radio，NR)、长期演进(long term evolution，LTE)系统、LTE频分双工(frequency division duplex，FDD)系统、LTE时分双工(time division duplex，TDD)等。本申请提供的技术方案还可以应用于未来的通信系统，如第六代移动通信系统，又如卫星通信系统，等等。
本申请实施例中的用户设备也可以称为终端设备、接入终端、用户单元、用户站、移动站、移动台(mobile station，MS)、移动终端(mobile terminal，MT)、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。本申请实施例中的用户设备可以是指向用户提供语音和/或数据连通性的设备，可以用于连接人、物和机，例如具有无线连接功能的手持式设备、车载设备等。本申请的实施例中的用户设备可以是手机(mobile phone)、平板电脑(Pad)、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备，虚拟现实(virtual reality，VR)设备、增强现实(augmented reality，AR)设备、工业控制(industrial control)中的无线终端、无人驾驶(self driving)中的无线终端、远程手术(remote medical surgery)中的无线终端、智能电网(smart grid)中的无线终端、运输安全(transportation safety)中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端等。可选地，UE可以用于充当基站。例如，UE可以充当调度实体，其在V2X或D2D等中的UE之间提供侧行链路信号。比如，蜂窝电话和汽车利用侧行链路信号彼此通信。蜂窝电话和智能家居设备之间通信，而无需通过基站中继通信信号。
本申请实施例中的网络设备可以是用于与用户设备通信的设备，该网络设备也可以称为接入网设备或无线接入网设备，如网络设备可以是基站。本申请实施例中的网络设备可以是指将用户设备接入到无线网络的无线接入网(radio access network，RAN)节点(或设备)。基站可以广义的覆盖如下中的各种名称，或与如下名称进行替换，比如：节点B(NodeB)、演进型基站(evolved NodeB，eNB)、下一代基站(next generation NodeB，gNB)、中继站、接入点、传输点(transmitting and receiving point，TRP)、发射点(transmitting point，TP)、主站MeNB、辅站SeNB、多制式无线(MSR)节点、家庭基站、网络控制器、接入节点、无线节点、接入点(access point，AP)、传输节点、收发节点、基带单元(base band unit，BBU)、射频拉远单元(Remote Radio Unit，RRU)、有源天线单元(active antenna unit，AAU)、射频头(remote radio head，RRH)、中心单元(central unit，CU)、分布式单元(distributed unit，DU)、定位节点等。基站可以是宏基站、微基站、中继节点、施主节点或类似物，或其组合。基站还可以指用于设置于前述设备或装置内的通信模块、调制解调器或芯片。基站还可以是移动交换中心以及设备到设备D2D、车辆外联(vehicle-to-everything，V2X)、机器到机器(machine-to-machine，M2M)通信中承担基站功能的设备、6G网络中的网络侧设备、未来的通信系统中承担基站功能的设备等。基站可以支持相同或不同接入技术的网络。本申请的实施例对网络设备所采用的具体技术和具体设备形态不做限定。
基站可以是固定的，也可以是移动的。例如，直升机或无人机可以被配置成充当移动基站，一个或 多个小区可以根据该移动基站的位置移动。在其他示例中，直升机或无人机可以被配置成用作与另一基站通信的设备。
在一些部署中，本申请实施例中的网络设备可以是指CU或者DU，或者，网络设备包括CU和DU。gNB还可以包括AAU。
网络设备和用户设备可以部署在陆地上，包括室内或室外、手持或车载；也可以部署在水面上；还可以部署在空中的飞机、气球和卫星上。本申请实施例中对网络设备和用户设备所处的场景不做限定。
应理解，本申请中的通信设备的全部或部分功能也可以通过在硬件上运行的软件功能来实现，或者通过平台(例如云平台)上实例化的虚拟化功能来实现。
应理解，本申请实施例中的术语(Terminology)的解释可以参考3GPP的规范协议TS36系列，TS37系列和TS38系列，但也可以参考电气和电子工程师协会(Institute of Electrical and Electronics Engineers，IEEE)的规范协议。
PRACH传输的覆盖增强
通信系统(比如，NR系统)的覆盖性能是运营商在进行通信网络商业化部署时需要考虑的一个重要因素，这是因为，通信系统的覆盖性能会直接影响通信系统的服务质量(service quality)以及运营商的成本，比如，运营商的资本性支出(capital expenditure，CAPEX)和运营商的运营成本(operating expense，OPEX)等。
通信系统的覆盖性能会随着通信系统工作的频段的不同而变化，例如，相比LTE系统，NR系统工作的频段更高(比如，毫米波频段)，导致NR系统的路径损耗更大，从而导致NR系统的覆盖性能相对更差。因此，随着通信系统支持的频段可能越来越高，如何对通信系统进行覆盖增强成为需要解决的问题。
在实际部署的大多数场景中，由于用户设备的能力相比网络设备的能力要弱一些，因此上行链路(uplink)的覆盖性能是对通信系统进行覆盖增强的瓶颈。而随着通信技术的发展，某些新兴的垂直用例行业(vertical use cases)中的上行业务也逐渐增多，比如，视频上传(video uploading)业务，在上行业务较多的场景下，如何进行上行链路的覆盖增强是需要进一步解决的问题。
相关技术中，针对某些上行链路已经存在覆盖增强的技术方案。比如，NR的第17版本(release 17，Rel-17)已经针对物理上行共享信道(physical uplink shared channel，PUSCH)、物理上行控制信道(physical uplink control channel，PUCCH)和随机接入流程中的消息3(message 3，Msg3)设计了覆盖增强方案。
然而，Rel-17并没有针对PRACH设计覆盖增强方案，但是PRACH传输性能对于初始接入(initial access)和波束失效恢复(beam failure recovery)等许多流程都非常重要，因此，对PRACH进行覆盖增强也是非常重要的。基于此，Rel-18正式成立了“进一步NR覆盖增强(further NR coverage enhancements)”的工作项目(work item，WI)，其中，增强PRACH传输的覆盖性能是该工作项目的重要议题之一。
作为一种可能的实现方式，可以采用多PRACH传输(multiple PRACH transmissions)进行PRACH传输的覆盖增强。也就是说，可以通过PRACH的重复传输(比如，多次在PRACH中发送前导(preamble))来实现PRACH传输的覆盖增强。
本申请实施例中，多PRACH传输可以是指采用相同波束的多PRACH传输，也可以是指采用不同波束的多PRACH传输。以采用相同波束的多PRACH传输为例，第3代合作伙伴计划(3rd generation partnership project，3GPP)无线接入网(radio access network，RAN)1#110bis-e会议已达成协议(agreement)：至少位于不同时间点(time instances)的PRACH时机(或称，RACH时机)可以被用于采用相同波束的多PRACH传输。此外，RAN1#110bis-e会议还进一步对采用相同波束的多PRACH传输的重复因子(多PRACH传输的个数/次数)进行了定义，该重复因子可以至少包括2个和4个，后续还可能包括8个。
同步信号块和PRACH时机的关联映射
同步信号块是通信标准中定义的一种信号结构，其可以包含主同步信号(primary synchronization signal，PSS)、辅同步信号(secondary synchronization signal，SSS)以及物理广播信道(physical broadcast channel，PBCH)。在一些实施例中，同步信号块可以表示为SSB(synchronization signal block)，在一些实施例中，同步信号块也可以表示为SS/PBCH block(synchronization signal/physical broadcast channel block)，即同步信号块也可以称为同步信号广播信道块，本申请实施例对此并不限定。需要说明的是，后文以同步信号块表示为SSB为例进行介绍，当然，后文的SSB均可以替换为SS/PBCH block。
SSB是在基本的正交频分复用网格上传输的一组资源，该一组资源例如可以包括以下资源中的一种或多种：时域资源、频域资源、码域资源等。
在用户设备进行初始接入或波束失效恢复的过程中，用户设备检测到网络设备发送的SSB时，可以获得该SSB的SSB索引(SSB index)，从而可以获知该SSB所在的时域位置，以便与网络设备实现 下行同步。而为了实现上行同步，用户设备需要向网络设备发送前导。用户设备如何选择要发送的前导，以及选择的前导应该在哪个PRACH时机上进行发送都是用户设备根据接收到(或称，检测到)的SSB确定的。
作为一种可行的技术方案，SSB可以与至少一个PRACH时机中的至少一个前导关联映射，以便用户设备执行初始接入或波束失效恢复时，可以根据接收的SSB确定所关联的PRACH时机和前导，从而可以继续执行PRACH传输。
相关技术中，SSB与PRACH时机和前导的关联映射关系遵循以下顺序：首先，按照每个PRACH时机内的前导索引递增的顺序排列；其次，按照频域资源索引递增的顺序对频分复用的PRACH时机进行排列；再次，按照时域资源索引递增的顺序对每个PRACH时隙内的时分复用的PRACH时机进行排列；最后，按照PRACH时隙索引递增的顺序排列。
下面结合图2给出SSB和PRACH时机的关联映射关系的一个示例。在图2的示例中，假设有8个SSB波束，该8个SSB波束对应的SSB索引为SSB0-SSB7；假设网络设备向用户设备发送的SSB-perRACH-Occasion参数的取值为1/2；假设网络设备向用户设备发送的频分复用的PRACH时机的个数取值为4，则SSB对应的PRACH时机如图2所示，其中，图中的每个方框代表一个PRACH时机。
如前文所述，可以通过多PRACH传输来进行PRACH的覆盖增强，那么在多PRACH传输的场景中，如果采用上述关联映射关系确定SSB关联的多个PRACH时机，则可能会导致与同一SSB关联的多个PRACH时机在时域上有重叠，从而导致设备的发射功率开销增大。
此外，在采用相同波束的多PRACH传输的场景中，如果采用上述关联映射关系确定SSB关联的多个PRACH时机，还与在RAN1#110-bis-e会议上达成的用于多PRACH传输的时域正交PRACH时机方案产生冲突。
综上，在多PRACH传输场景中，如何根据SSB确定该SSB关联的多个PRACH时机是需要解决的问题。
为了解决上述问题，本申请实施例提供了一种用于无线通信的节点中的方法和装置，能够将SSB有效地关联映射到多个时域正交的PRACH时机，从而有利于节省发射功率开销。
本申请实施例可以应用于多PRACH传输的场景中，即可以采用多个PRACH重复传输来实现PRACH的覆盖增强。
在一些实施例中，本申请实施例提及的多PRACH传输可以是指采用相同波束的多PRACH传输，以通过在相同波束上进行多个PRACH的重复传输来获得信噪比(signal to noise ratio，SNR)增益。在一些实施例中，本申请实施例提及的多PRACH传输可以是指采用不同波束的多PRACH传输，以通过在不同波束上进行多个PRACH的重复传输来获得分集增益。
需要说明的是，本申请实施例提及的波束(beam)可以用天线端口(antenna port)、空间滤波器(spatial filter)、空间参数(spatial parameter)等其他术语替换，其表达的含义可以是一致的，本申请实施例对此并不进行区分。
本申请实施例可以应用于初始接入过程或波束失效恢复过程。以初始接入过程为例，本申请实施例可以应用于四步随机接入流程(即，随机接入流程类型1，type-1 random access procedure)，或者也可以应用于两步随机接入流程(即，随机接入流程类型2)，本申请实施例对此并不限定。
下面结合附图对本申请的方法实施例进行详细介绍。图3为本申请一实施例提供的用于无线通信的节点中的方法的流程示意图。图3所示的方法是站在第一节点和第二节点交互的角度进行介绍的。
作为一个实施例，第一节点可以是网络控制中继(network-controlled repeater，NCR)。
作为一个实施例，第一节点可以是用户设备，例如，图1所示的用户设备120。
作为一个实施例，第一节点可以是中继(relay)，比如中继终端。
作为一个实施例，第二节点可以是网络设备，例如，图2所示的网络设备110。
图3所示的方法可以包括步骤S310和步骤S320，下面对这些步骤进行介绍。
在步骤S310，第一节点接收第一同步信号块。
第一同步信号块的索引是多个候选同步信号块索引中的之一。
作为一个实施例，第一同步信号块可以是第二节点发送的一个或多个同步信号块中的一个。
作为一个实施例，同步信号块(比如，第一同步信号块，第二节点发送的一个或多个同步信号块等)可以表示为SSB；或者，同步信号块可以表示为SS/PBCH block，本申请实施例对此并不限定。
作为一个实施例，第一同步信号块的索引被映射到第一随机接入信道时机组。该第一随机接入信道时机组包括多个随机接入信道时机。
作为一个实施例，第一随机接入信道时机组包括的多个随机接入信道时机可以表示为RO(RACH occasion)，也可以表示为PRO(PRACH occasion)，本申请实施例对此并不限定。
在步骤S320，第一节点发送第一前导组。该第一前导组包括多个前导(preamble)。在一些实施例中，前导也可以称为前导码，本申请实施例对此并不限定。
第一随机接入信道时机组中的该多个随机接入信道时机分别被用于发送第一前导组中的多个前导。也就是说，第一前导组中的多个前导可以分别在第一随机接入信道时机组中的多个随机接入信道时机上发送，例如，每个前导在一个随机接入信道时机上发送。
第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的。如此一来，第一随机接入信道时机组中的任意两个随机接入信道时机在时域上便不会重叠，即第一同步信号块关联映射的多个随机接入信道时机在时域上均是不重叠的。
作为一个实施例，第一随机接入信道时机组中的任一随机接入信道时机是有效的。例如，对于配对频谱或补充上行频段，所有随机接入信道时机可以是有效的。或者，对于未配对频谱，随机接入信道时机在满足一定条件的情况下也可以是有效的，该条件例如可以与参数tdd-UL-DL-ConfigurationCommon关联等。
作为一个实施例，上文的多个候选同步信号块索引可以按照第一映射顺序被映射到多个随机接入信道时机组，其中，第一随机接入信道时机组是该多个随机接入信道时机组中的之一。后文将会对多个候选同步信号块索引如何按照第一映射顺序被映射到多个随机接入信道时机组进行详细介绍，此处暂不赘述。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组包括至少一个随机接入信道时机。以该多个随机接入信道时机组包括第一随机接入信道时机组为例，第一随机接入信道时机组可以包括至少一个随机接入信道时机。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组包括多个(两个或两个以上)随机接入信道时机，例如，第一随机接入信道时机组可以包括多个随机接入信道时机。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组包括的任意两个随机接入信道时机在时域上是正交的。
作为一个实施例，任意两个随机接入信道时机在时域上是正交的可以理解为，任意两个随机接入信道时机分布在不同的时间点(time instances)。在一些实施例中，时间点也可以替换为时间间隔等其他术语，本申请实施例对此并不限定。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组是有效的。例如，对于配对频谱或补充上行频段，所有随机接入信道时机组可以是有效的。或者，对于未配对频谱，随机接入信道时机组在满足一定条件的情况下也可以是有效的，该条件例如可以与参数tdd-UL-DL-ConfigurationCommon关联等。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组包括的一个或多个随机接入信道时机是有效的。
作为一个实施例，多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。例如，第一周期包括3个随机接入信道时隙(PRACH slot)，多个随机接入信道时机组中的某一个或多个随机接入信道时机组可以占用该3个PRACH时隙中的2个或3个PRACH时隙。
作为一个实施例，多个随机接入信道时机组中任一随机接入信道时机组包括的所有随机接入信道时机均位于同一时隙内，即多个随机接入信道时机组中任一随机接入信道时机组包括的所有随机接入信道时机位于同一PRACH时隙。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组可以包括多个前导。如此一来，第一节点根据接收到(检测到)的第一同步信号块的索引确定第一同步信号块对应的随机接入信道时机组(可以是该多个随机接入信道时机组中的任一随机接入信道时机组)后，便可以在该随机接入信道时机组上发送前导。
作为一个实施例，对于多个随机接入信道时机组中的任一随机接入信道时机组而言，该随机接入信道时机组中的任一随机接入信道时机包括的前导索引可以都相同。以多个随机接入信道时机组中的第一随机接入信道时机组为例，第一随机接入信道时机组包含的多个随机接入信道时机包括的前导索引可以都相同，比如，第一随机接入信道时机组包含的多个随机接入信道时机包括的前导索引范围可以均为0-63。
作为一个实施例，对于多个随机接入信道时机组中的任一随机接入信道时机组而言，该随机接入信道时机组中的任一随机接入信道时机包括的前导索引可以不同或部分不同。仍然以多个随机接入信道时机组中的第一随机接入信道时机组为例，第一随机接入信道时机组包含的多个随机接入信道时机包括的前导索引可以不同，比如，第一随机接入信道时机组包含4个随机接入信道时机，这4个随机接入 信道时机包括的前导索引范围可以分别为0-63，64-127，128-191，192-255。
作为一个实施例，第一随机接入信道时机组对应于第一时机组类型，即第一随机接入信道时机组与第一时机组类型对应。该第一时机组类型是多个候选时机组类型中的之一，第一时机组类型和/或候选时机组类型包括的信息可以有多种，例如，重复因子、跳频指示、跳频图谱等，后文将会结合具体示例进行详细介绍，此处暂不赘述。
本申请实施例中，第一同步信号块的索引、第一时机组类型和第一映射顺序可以被用于确定第一随机接入信道时机组。如此一来，第一节点接收第一同步信号块之后，便可以根据第一同步信号块的索引、第一时机组类型和第一映射顺序来确定第一同步信号块对应的第一随机接入信道时机组，且第一节点根据第一同步信号块的索引、第一时机组类型和第一映射顺序确定的第一随机接入信道时机组包含的多个随机接入信道时机在时域上分别是正交的。进一步地，第一节点在第一随机接入信道时机组的多个随机接入信道时机上分别发送第一前导组中的多个前导，能够减小随机接入延迟，提高随机接入资源利用效率。
作为一个实施例，第一同步信号块的索引，第一时机组类型和第一映射顺序被用于从多个随机接入信道时机组中确定所述第一随机接入信道时机组。
作为一个实施例，第一同步信号块的索引，第一时机组类型和第一映射顺序被用于从第一周期包括的多个随机接入信道时机组中确定第一随机接入信道时机组。
作为一个实施例，第一同步信号块的所述索引，第一时机组类型和第一映射顺序被用于从第一周期包括的多个随机接入信道时机中确定第一随机接入信道时机组中的任一随机接入信道时机。
本申请实施例对利用第一同步信号块的索引、第一时机组类型和第一映射顺序来确定第一随机接入信道时机组的实现方式不做具体限定，只要结合上述三种信息能够确定第一同步信号块对应的第一随机接入信道时机组即可。或者说，本申请实施例只要能够利用上述三种信息从多个随机接入信道时机组中筛选出第一随机接入信道时机组即可。下面示例性地给出利用第一同步信号块的索引、第一时机组类型和第一映射顺序来确定第一随机接入信道时机组的几种实现方式。
作为一个实施例，第一同步信号块的索引，第一时机组类型和第一映射顺序被用于确定第一随机接入信道时机组，包括：按照第一映射顺序，第一同步信号块的索引被映射到多个随机接入信道时机组中的至少两个随机接入信道时机组，该至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，第一时机组类型被用于从该至少两个随机接入信道时机组中确定第一随机接入信道时机组。
作为一个实施例，第一同步信号块的索引，第一时机组类型和第一映射顺序被用于确定第一随机接入信道时机组，包括：第一时机组类型被用于从多个随机接入信道时机组中确定至少L个随机接入信道时机组，第一同步信号块的索引和第一映射顺序被用于从该至少L个随机接入信道时机组中确定第一随机接入信道时机组，L是大于1的正整数。
作为一个实施例，L是{4，8，64}中的之一。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
作为一个实施例，第一周期可以理解为同步信号块和随机接入信道时机的映射周期(mapping cycle)。
作为一个实施例，第一周期可以包括一个或多个PRACH时隙。以第一周期包括多个PRACH时隙为例，本申请实施例对第一周期包括的多个PRACH时隙的数量不做限定，例如，可以包括3个PRACH时隙、4个PRACH时隙、或者更多数量的PRACH时隙。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组中的任一随机接入信道时机属于第一周期包括的多个PRACH时隙中的之一。
作为一个实施例，第一周期包括前文提及的多个随机接入信道时机组。也就是说，多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组是在第一周期内进行的。
作为一个实施例，所述第一周期包括多个随机接入信道时机。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机是第一周期包括的多个随机接入信道时机中的之一。或者说，第一周期包括的多个随机接入信道时机中的一个或多个可以组成多个随机接入信道时机组中的任一随机接入信道时机组。
作为一个实施例，多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组可以是指，多个候选同步信号块索引按照第一映射顺序被映射到第一周期中的多个随机接入信道时机组。
作为一个实施例，多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组可以是指，多个候选同步信号块索引按照第一映射顺序被映射到第一周期中的多个随机接入信道时机。
作为一个实施例，多个候选同步信号块索引中的任一候选同步信号块索引可以被映射到第一周期中的至少一个随机接入信道时机组。
作为一个实施例，多个候选同步信号块索引中的任一候选同步信号块索引可以被映射到第一周期中的至少一个随机接入信道时机。
作为一个实施例，多个候选同步信号块索引到多个随机接入信道时机组的映射是在第一周期内进行的。
作为一个实施例，第一周期可以是指PRACH配置周期。
作为一个实施例，第一周期可以是指将多个候选同步信号块索引映射到多个随机接入信道时机组的关联周期(association period)。
作为一个实施例，第一周期可以是指包含一个或多个关联周期(association period)的关联模式周期(association pattern period)。
作为一个实施例，将多个候选同步信号块索引映射到多个随机接入信道时机组的第一周期是由PRACH配置周期决定的集合中的最小值。
作为一个实施例，PRACH配置周期决定的集合可以参见表1，即第一周期的取值可以根据表1来确定。
表1
作为一个实施例，所述第一周期可以是从帧号0开始的。
如前文所述，第一同步信号块的索引、第一时机组类型和第一映射顺序被用于确定第一随机接入信道时机组，下面分别对第一时机组类型和第一映射顺序进行介绍。
第一时机组类型可以包括以下信息中的一种或多种：第一重复因子、第一跳频指示、以及第一跳频图谱。
作为一个实施例，第一时机组类型可以包括上述信息中的一种，比如，仅包括第一重复因子，或者仅包括第一跳频指示，又或者仅包括第一跳频图谱。
作为一个实施例，第一时机组类型可以包括上述信息中的多种，比如，包括第一重复因子和第一跳频指示，或者包括第一重复因子、第一跳频图谱；又或者，包括第一重复因子、第一跳频指示以及第一跳频图谱等。
作为一个实施例，第一时机组类型除了包括上述信息中的一种或多种，还可以包括其他信息，本申请实施例对此并不限定。
作为一个实施例，第一时机组类型可以包括第一重复因子，且第一随机接入信道时机组包括的所有随机接入信道时机的个数等于该第一重复因子。以第一重复因子是4为例，那么第一随机接入信道时机组包括的随机接入信道时机的个数为4，也就是说，第一随机接入信道时机组包括4个随机接入信道时机。
作为一个实施例，第一重复因子是一个正整数。比如，第一重复因子可以是任意的正整数，比如，2，4，8，16，等等。
作为一个实施例，第一重复因子可以包括哪些取值是协议预定义的，或者是网络配置的。
作为一个实施例，第一重复因子可以是2，4中的之一。
作为一个实施例，第一重复因子可以是2，4，8中的之一。
作为一个实施例，第一重复因子可以是1，2，4，8中的之一。
作为一个实施例，多个重复因子各不相等。
作为一个实施例，第一重复因子是多个重复因子中的之一。该多个重复因子可以是指多PRACH传输的重复因子，即PRACH传输的重复次数。
作为一个实施例，该多个重复因子可以至少包括2和4。例如，该多个重复因子可以仅包括2和4；或者，该多个重复因子可以包括2，4以及其他正整数。
作为一个实施例，该多个重复因子可以包括2，4和8。
作为一个实施例，该多个重复因子可以包括1，2和4。
作为一个实施例，该多个重复因子可以包括1，2，4和8。
作为一个实施例，该多个重复因子可以分别是2和4。
作为一个实施例，该多个重复因子可以分别是2，4和8。
作为一个实施例，该多个重复因子可以分别是1，2和4。
作为一个实施例，该多个重复因子可以分别是1，2，4和8。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组包括的所有随机接入信道时机的个数等于上述多个重复因子中的之一。以多个重复因子分别是2和4为例，多个随机接入信道时机组中的任一随机接入信道时机组要么包括2个随机接入信道时机，要么包括4个随机接入信道时机。
作为一个实施例，多个候选时机组类型可以包括第一候选时机组类型和第二候选时机组类型，第一候选时机组类型与第二候选时机组类型不同。
作为一个实施例，第一候选时机组类型与第二候选时机组类型不同可以包括：第一候选时机组类型包括的重复因子与第二候选时机组类型包括的重复因子不同。
作为一个实施例，第一时机组类型属于不同的候选时机组类型时，第一时机组类型包括的第一重复因子不同。例如，当第一时机组类型是第一候选时机组类型时，第一重复因子为上述多个重复因子中的其中一个；当第一时机组类型是第二候选时机组类型时，第一重复因子为多个重复因子中的除第一候选时机组类型包括的重复因子之外的其他重复因子。作为一个具体示例，当第一时机组类型是第一候选时机组类型时，第一重复因子可以是2；当第一时机组类型是第二候选时机组类型时，第一重复因子可以是4。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组对应于多个候选时机组类型中的之一。例如，多个随机接入信道时机组包括A、B、C、D共4个随机接入信道时机组，候选时机组类型包括第一候选时机组类型和第二候选时机组类型，其中A随机接入信道时机组和B随机接入信道时机组对应于第一候选时机组类型，C随机接入信道时机组和D随机接入信道时机组对应于第二候选时机组类型。
作为一个实施例，多个候选时机组类型分别包括上述多个重复因子。以上述多个重复因子包括2和4为例，多个候选时机组类型中的第一候选时机组类型可以包括重复因子2，第二候选时机组类型可以包括重复因子4。
作为一个实施例，第二随机接入信道时机组包括的所有随机接入信道时机的个数等于第二随机接入信道时机组所对应的一个候选时机组类型所包括的重复因子，其中，第二随机接入信道时机组为多个随机接入信道时机组中的任一随机接入信道时机组。示例性地，如果第二随机接入信道时机组对应的候选时机组类型为第一候选时机组类型，且第一候选时机组类型包括重复因子2，则第二随机接入信道时机组包括的随机接入信道时机的个数等于2；如果第二随机接入信道时机组对应的候选时机组类型为第二候选时机组类型，且第二候选时机组类型包括重复因子4，则第二随机接入信道时机组包括的随机接入信道时机的个数等于4。
作为一个实施例，多个候选时机组类型分别包括上述多个重复因子，多个随机接入信道时机组中的任一随机接入信道时机组包括的所有随机接入信道时机的个数等于上述多个重复因子中的一个重复因子。例如，多个随机接入信道时机组中的任一随机接入信道时机组包括的所有随机接入信道时机的个数可以等于1，2，4，8中的之一。
作为一个实施例，第一时机组类型可以包括第一跳频指示。第一跳频指示可以被用于确定第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。或者说，第一跳频指示可以被用于确定第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否相同。
作为一个实施例，多个候选时机组类型可以包括第一候选时机组类型和第二候选时机组类型，第一候选时机组类型与第二候选时机组类型不同。
作为一个实施例，第一候选时机组类型与第二候选时机组类型不同可以包括：第一候选时机组类型包括的跳频指示与第二候选时机组类型包括的跳频指示不同。
作为一个实施例，第一时机组类型属于不同的候选时机组类型时，第一时机组类型包括的第一跳频指示不同。例如，当第一时机组类型是第一候选时机组类型时，第一跳频指示可以用于指示第一随机接入信道时机组中的所有随机接入信道时机所占用的频域资源相同；当第一时机组类型是第二候选时机组类型时，第一跳频指示可以用于指示第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源不同。
作为一个实施例，第一时机组类型可以包括第一跳频图谱。第一跳频图谱被用于确定第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源。
作为一个实施例，第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于第一跳频图谱。
作为一个实施例，多个候选时机组类型可以包括第一候选时机组类型和第二候选时机组类型，第一 候选时机组类型与第二候选时机组类型不同。
作为一个实施例，第一候选时机组类型与第二候选时机组类型不同可以包括：第一候选时机组类型包括的跳频图谱与第二候选时机组类型包括的跳频图谱不同。
作为一个实施例，第一时机组类型属于不同的候选时机组类型时，第一时机组类型包括的第一跳频图谱不同。例如，当第一时机组类型属于第一候选时机组类型时，第一时机组类型包括的第一跳频图谱为A跳频图谱；当第一时机组类型属于第二候选时机组类型时，第一时机组类型包括的第一跳频图谱为B跳频图谱，其中，A跳频图谱与B跳频图谱至少部分不同。
作为一个实施例，多个候选时机组类型可以分别包括多个跳频图谱。多个随机接入信道时机组中的任一随机接入信道时机组所占用的频域资源对应于该多个跳频图谱中的一个跳频图谱。
作为一个实施例，多个随机接入信道时机组中的任一随机接入信道时机组对应于多个候选时机组类型中的之一，该多个候选时机组类型分别包括多个跳频图谱，该多个随机接入信道时机组中的任一随机接入信道时机组所占用的频域资源对应于所述多个跳频图谱中的一个跳频图谱。
作为一个实施例，第一时机组类型是多个候选时机组类型中的之一，因此多个候选时机组类型可以包括以下信息中的一种或多种：重复因子、跳频指示、以及跳频图谱。关于多个候选时机组类型包括的信息的具体内容，类似于第一时机组类型包括的信息，具体介绍可以参见前文对第一时机组类型包括的信息的介绍，为了简洁，此处不再赘述。
本申请实施例中，利用多个候选时机组类型(比如，多个重复因子)将多个随机接入信道时机分为多个随机接入信道时机组，使得多PRACH传输所占用的随机接入信道时机数目可变。
下面对第一映射顺序进行详细介绍。
作为一个实施例，第一映射顺序与以下信息中的一种或多种关联：随机接入信道时机组内的前导索引、多个随机接入信道时机组的频域资源、以及多个随机接入信道时机组的时域资源。
作为一个实施例，第一映射顺序可以包括：按照多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引的变化顺序，比如前导索引递增的顺序或前导索引递减的顺序等。换句话说，多个候选同步信号块索引可以按照多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引的变化顺序(比如，递增的顺序)进行排列。
作为一个实施例，第一映射顺序可以包括：按照多个随机接入信道时机组的频域资源的变化顺序，比如频域资源递增的顺序或频域资源递减的顺序等。换句话说，多个候选同步信号块索引可以按照多个随机接入信道时机组的频域资源的变化顺序(比如，递增的顺序)对频分复用的多个随机接入信道时机组进行排列。
作为一个实施例，第一映射顺序可以包括：按照多个随机接入信道时机组的时域资源的变化顺序，比如时域资源递增的顺序或时域资源递减的顺序等。换句话说，多个候选同步信号块索引可以按照多个随机接入信道时机组的时域资源的变化顺序(比如，递增的顺序)对时分复用的多个随机接入信道时机组进行排列。
作为一个实施例，第一映射顺序可以包括以下顺序中的一项或多项：按照多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；按照多个随机接入信道时机组的频域资源递增的顺序；以及按照多个随机接入信道时机组的时域资源递增的顺序。
作为一个实施例，第一映射顺序可以包括：先按照多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照多个随机接入信道时机组的频域资源递增的顺序；再次按照多个随机接入信道时机组的时域资源递增的顺序。
不过本申请实施例并不限定于此，第一映射顺序包括的上述几项顺序可以随机排列组合，其之间的先后顺序也可以进行调换。例如，第一映射顺序可以包括：先按照多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照多个随机接入信道时机组的时域资源递增的顺序；再次按照多个随机接入信道时机组的频域资源递增的顺序，等等。
作为一个实施例，多个随机接入信道时机组可以包括多个随机接入信道时机，该多个随机接入信道时机组包括的多个随机接入信道时机中的每个随机接入信道时机可以仅属于多个随机接入信道时机组中的一个随机接入信道时机组。换句话说，多个随机接入信道时机组不会重复，即多个随机接入信道时机组占用的资源(比如，随机接入信道时机)不会重叠。
下面结合图4给出多个随机接入信道时机中的每个随机接入信道时机仅属于一个随机接入信道时机组的示例。
如图4所示，假设多个候选时机组类型包括的多个重复因子分别为1，2和4，其中4为最大重复因子Qmax，或者说，多PRACH传输的最大重复因子Qmax为4。作为一种实现方式，在第一周期内，可以将第一周期内的所有随机接入信道时机依次按照多个候选时机组类型包括的多个重复因子划分为 多个随机接入信道时机组。
在图4的示例中，第一周期内的所有随机接入信道时机是依次按照多个候选时机组类型包括的多个重复因子递减的顺序划分为多个随机接入信道时机组的。
在图4的示例中，每个虚线框代表一个随机接入信道时机组，该随机接入信道时机组是依次按照多个重复因子(1，2和4)递减的顺序划分的。
在图4的示例中，该多个随机接入信道时机组包括多个随机接入信道时机。针对多个随机接入信道时机组包括的任一随机接入信道时机而言，其仅属于一个随机进入信道时机组。例如，随机接入信道时机1(图中的RO1)仅属于一个随机接入信道(图中的ROG1)，随机接入信道时机8(图中的RO8)仅属于一个随机接入信道(图中的ROG2)，等等。
在图4的示例中，该多个随机接入信道时机组包括多个随机接入信道时机。对于多个随机接入信道时机组包括的每个随机接入信道时机而言，不同的候选同步信号块索引被映射到该每个随机接入信道时机包括的多个前导中的不同前导。例如，以随机接入信道时机1为例，候选同步信号块索引0和候选同步信号块索引1均被映射到随机接入信道时机1，但候选同步信号块索引0和候选同步信号块索引1被映射到随机接入信道时机1中的不同前导中，比如候选同步信号块索引0被映射到随机接入信道时机1中的前导0-21，候选同步信号块索引1被映射到随机接入信道时机1中的前导22-43。
作为一个实施例，多个随机接入信道时机组可以包括多个随机接入信道时机，该多个随机接入信道时机组包括的多个随机接入信道时机中的每个随机接入信道时机可以被多个随机接入信道时机组中的至少两个随机接入信道时机组共用。换句话说，多个随机接入信道时机组占用的资源(比如，随机接入信道时机)可能会重叠。
下面结合图5给出多个随机接入信道时机中的每个随机接入信道时机被多个随机接入信道时机组中的至少两个随机接入信道时机组共用的示例。
如图5所示，假设多个候选时机组类型包括的多个重复因子分别为1，2和4，其中4为最大重复因子Qmax，或者说，多PRACH传输的最大重复因子Qmax为4。作为一种实现方式，在第一周期内，可以将第一周期内的所有随机接入信道时机分别按照多个候选时机组类型包括的多个重复因子划分为多个随机接入信道时机组。
在图5的示例中，第一周期内的所有随机接入信道时机是分别按照多个候选时机组类型包括的多个重复因子划分为多个随机接入信道时机组的。
在图5的示例中，每个虚线框代表一个随机接入信道时机组，该随机接入信道时机组是分别按照多个重复因子(1，2和4)划分的。其中，虚线的椭圆框和虚线的方框分别代表按照不同的重复因子划分得到的随机接入信道时机组。例如，虚线的椭圆框代表按照重复因子为4划分得到的随机接入信道时机组，虚线的方框代表按照重复因子为2划分得到的随机接入信道时机组。
在图5的示例中，该多个随机接入信道时机组包括多个随机接入信道时机。针对多个随机接入信道时机组包括的任一随机接入信道时机而言，其被多个随机接入信道时机组中的至少两个随机接入信道时机组共用。例如，随机接入信道时机1(图中的RO1)被两个随机接入信道时机组共用(图中的ROG1和ROG7共用)，随机接入信道时机8(图中的RO8)被两个随机接入信道时机组共用(图中的ROG2和ROG8共用)，等等。
在图5的示例中，该多个随机接入信道时机组包括多个随机接入信道时机。对于多个随机接入信道时机组包括的每个随机接入信道时机而言，共用该随机接入信道时机的至少两个随机接入信道时机组被映射到该随机接入信道时机包括的多个前导中的不同前导。例如，以随机接入信道时机1为例，随机接入信道时机组1和随机接入信道时机组7共用随机接入信道时机1，其均被映射到随机接入信道时机1，但随机接入信道时机组1和随机接入信道时机组7被映射到随机接入信道时机1中的不同前导中，比如随机接入信道时机组1被映射到随机接入信道时机1中的前导0-21，随机接入信道时机组7被映射到随机接入信道时机1中的前导22-43。
图6为多个随机接入信道时机中的每个随机接入信道时机被多个随机接入信道时机组中的至少两个随机接入信道时机组共用的另一示例。图6的方案可以理解为图4和图5所示的实现方式的结合(或混合)。
如图6所示，假设多个候选时机组类型包括的多个重复因子分别为1，2和4，其中4为最大重复因子Qmax，或者说，多PRACH传输的最大重复因子Qmax为4。作为一种实现方式，在第一周期内，可以将第一周期内的所有随机接入信道时机先依次按照多个候选时机组类型包括的多个重复因子划分为多个随机接入信道时机组(即，先按照图4所示的实现方式划分为多个随机接入信道时机组)。然后针对该多个随机接入信道时机组中的前导未被使用完的随机接入信道时机组，对该前导未被使用完的随机接入信道时机组进行二次划分，这两次划分对应的候选时机组类型(比如，重复因子)不同，例如， 可以按照图5所示的实现方式进行二次划分。
在图6的示例中，每个虚线框代表一个随机接入信道时机组，其中，虚线椭圆框代表先依次按照多个候选时机组类型包括的多个重复因子划分得到的多个随机接入信道时机组，虚线方框代表对前导未被使用完的随机接入信道时机组进行二次划分得到的随机接入信道时机组。
在图6的示例中，该多个随机接入信道时机组包括多个随机接入信道时机。针对多个随机接入信道时机组包括的任一随机接入信道时机而言，其可以仅属于一个随机接入信道时机组，也可以被多个随机接入信道时机组中的至少两个随机接入信道时机组共用。例如，随机接入信道时机1(图中的RO1)仅属于随机接入信道时机组1(中的ROG1)，随机接入信道时机13(图中的RO13)被两个随机接入信道时机组共用(图中的ROG4和ROG12共用)，等等。
在图6的示例中，该多个随机接入信道时机组包括多个随机接入信道时机。对于多个随机接入信道时机组包括的每个随机接入信道时机而言，如果该随机接入信道时机仅属于一个随机接入信道时机组，则不同的候选同步信号块索引可以被映射到该每个随机接入信道时机包括的多个前导中的不同前导。例如，以随机接入信道时机1为例，候选同步信号块索引0和候选同步信号块索引1均被映射到随机接入信道时机1，但候选同步信号块索引0和候选同步信号块索引1被映射到随机接入信道时机1中的不同前导中，比如候选同步信号块索引0被映射到随机接入信道时机1中的前导0-21，候选同步信号块索引1被映射到随机接入信道时机1中的前导22-43。如果该随机接入信道时机被至少两个随机接入信道时机组共用，则共用该随机接入信道时机的至少两个随机接入信道时机组可以被映射到该随机接入信道时机包括的多个前导中的不同前导。例如，以随机接入信道时机13为例，随机接入信道时机组4和随机接入信道时机组12共用随机接入信道时机13，其均被映射到随机接入信道时机13，但随机接入信道时机组4和随机接入信道时机组12被映射到随机接入信道时机13中的不同前导中，比如随机接入信道时机组4被映射到随机接入信道时机13中的前导0-21，随机接入信道时机组12被映射到随机接入信道时机13中的前导22-43。
图7为本申请另一实施例提供的用于无线通信的节点中的方法的流程示意图。图7所示的方法可以包括步骤S710至步骤S730。
在步骤S710，第一节点接收第一同步信号块。
在步骤S720，第一节点发送第一前导组。
关于步骤S710和步骤S720的相关描述，可以参见前文对步骤S310和步骤S320的描述，此处不再赘述。
在步骤S730，作为发送第一前导组的响应，第一节点在第一时间窗内接收第一随机接入响应。
作为一个实施例，第一随机接入信道时机组可以被用于确定以下中的一项或多项：确定第一时间窗的起始，以及确定第一随机接入响应的加扰序列。
作为一个具体的实施例，第一随机接入信道时机组被用于第一时间窗的起始。
作为另一个具体的实施例，第一随机接入信道时机组被用于第一时间窗的起始和第一随机接入响应的加扰序列。
上文结合图1至图7，详细描述了本申请的方法实施例，下面结合图8至图10，详细描述本申请的装置实施例。应理解，方法实施例的描述与装置实施例的描述相互对应，因此，未详细描述的部分可以参见前面方法实施例。
图8为本申请实施例提供的第一节点的结构示意图。图8所示的第一节点800可以包括第一接收机810和第一发射机820。
第一接收机810可以用于接收第一同步信号块，该第一同步信号块的索引是多个候选同步信号块索引中的之一。
第一发射机820可以用于发送第一前导组，第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
作为一个实施例，所述多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
作为一个实施例，所述第一时机组类型包括第一重复因子，所述第一随机接入信道时机组包括的随机接入信道时机的个数等于所述第一重复因子，所述第一重复因子是多个重复因子中的之一。
作为一个实施例，所述多个随机接入信道时机组中的任一随机接入信道时机组对应于所述多个候选时机组类型中的之一；所述多个候选时机组类型分别包括所述多个重复因子，第二随机接入信道时机组包括的随机接入信道时机的个数等于所述第二随机接入信道时机组所对应的候选时机组类型所包括的重复因子，其中，所述第二随机接入信道时机组为所述多个随机接入信道时机组中的任一随机接入信道时机组。
作为一个实施例，所述第一时机组类型包括第一跳频指示；所述第一跳频指示被用于确定所述第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。
作为一个实施例，所述第一时机组类型包括第一跳频图谱；所述第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于所述第一跳频图谱。
作为一个实施例，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：按照所述第一映射顺序，所述第一同步信号块的所述索引被映射到所述多个随机接入信道时机组中的至少两个随机接入信道时机组，所述至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，所述第一时机组类型被用于从所述至少两个随机接入信道时机组中确定所述第一随机接入信道时机组。
作为一个实施例，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：所述第一时机组类型被用于从所述多个随机接入信道时机组中确定至少L个随机接入信道时机组，所述第一同步信号块的所述索引和所述第一映射顺序被用于从所述至少L个随机接入信道时机组中确定所述第一随机接入信道时机组，L是大于1的正整数。
作为一个实施例，所述第一映射顺序包括以下顺序中的一项或多项：按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；按照所述多个随机接入信道时机组的频域资源递增的顺序；按照所述多个随机接入信道时机组的时域资源递增的顺序。
作为一个实施例，所述第一映射顺序包括：先按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照所述多个随机接入信道时机组的频域资源递增的顺序；再次按照所述多个随机接入信道时机组的时域资源递增的顺序。
作为一个实施例，所述多个随机接入信道时机组包括多个随机接入信道时机，所述多个随机接入信道时机组包括的所述多个随机接入信道时机中的每个随机接入信道时机仅属于所述多个随机接入信道时机组中的一个随机接入信道时机组；或者所述每个随机接入信道时机被所述多个随机接入信道时机组中的至少两个随机接入信道时机组共用。
作为一个实施例，所述多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。
作为一个实施例，第一节点800还包括：第二接收机，用于作为发送所述第一前导组的响应，在第一时间窗内接收第一随机接入响应；其中，所述第一随机接入信道时机组被用于确定所述第一时间窗的起始；所述第一随机接入信道时机组被用于确定所述第一随机接入响应的加扰序列。
作为一个实施例，第一接收机810和第一发射机820可以为收发器1030。第一节点800还可以包括处理器1010和存储器1020，具体如图10所示。
图9为本申请实施例提供的第二节点的结构示意图。图9所示的第二节点900可以包括第一发射机910和第一接收机920。
第一发射机910可以用于发送一个或多个同步信号块，第一同步信号块是所述一个或多个同步信号块中的之一，所述第一同步信号块的索引是多个候选同步信号块索引中的之一。
第一接收机920可以用于接收第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于传输所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
作为一个实施例，所述多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
作为一个实施例，所述第一时机组类型包括第一重复因子，所述第一随机接入信道时机组包括的随机接入信道时机的个数等于所述第一重复因子，所述第一重复因子是多个重复因子中的之一。
作为一个实施例，所述多个随机接入信道时机组中的任一随机接入信道时机组对应于所述多个候选时机组类型中的之一；所述多个候选时机组类型分别包括所述多个重复因子，第二随机接入信道时机 组包括的随机接入信道时机的个数等于所述第二随机接入信道时机组所对应的候选时机组类型所包括的重复因子，其中，所述第二随机接入信道时机组为所述多个随机接入信道时机组中的任一随机接入信道时机组。
作为一个实施例，所述第一时机组类型包括第一跳频指示；所述第一跳频指示被用于确定所述第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。
作为一个实施例，所述第一时机组类型包括第一跳频图谱；所述第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于所述第一跳频图谱。
作为一个实施例，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：按照所述第一映射顺序，所述第一同步信号块的所述索引被映射到所述多个随机接入信道时机组中的至少两个随机接入信道时机组，所述至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，所述第一时机组类型被用于从所述至少两个随机接入信道时机组中确定所述第一随机接入信道时机组。
作为一个实施例，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：所述第一时机组类型被用于从所述多个随机接入信道时机组中确定至少L个随机接入信道时机组，所述第一同步信号块的所述索引和所述第一映射顺序被用于从所述至少L个随机接入信道时机组中确定所述第一随机接入信道时机组，L是大于1的正整数。
作为一个实施例，所述第一映射顺序包括以下顺序中的一项或多项：按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；按照所述多个随机接入信道时机组的频域资源递增的顺序；按照所述多个随机接入信道时机组的时域资源递增的顺序。
作为一个实施例，所述第一映射顺序包括：先按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照所述多个随机接入信道时机组的频域资源递增的顺序；再次按照所述多个随机接入信道时机组的时域资源递增的顺序。
作为一个实施例，所述多个随机接入信道时机组包括多个随机接入信道时机，所述多个随机接入信道时机组包括的所述多个随机接入信道时机中的每个随机接入信道时机仅属于所述多个随机接入信道时机组中的一个随机接入信道时机组；或者所述每个随机接入信道时机被所述多个随机接入信道时机组中的至少两个随机接入信道时机组共用。
作为一个实施例，所述多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。
作为一个实施例，第二节点900包括：第二发射机，用于作为接收所述第一前导组的响应，在第一时间窗内发送第一随机接入响应；其中，所述第一随机接入信道时机组被用于确定所述第一时间窗的起始；所述第一随机接入信道时机组被用于确定所述第一随机接入响应的加扰序列。
作为一个实施例，第一发射机910和第一接收机920可以为收发器1030。第二节点900还可以包括处理器1010和存储器1020，具体如图10所示。
图10是本申请实施例的通信装置的示意性结构图。图10中的虚线表示该单元或模块为可选的。该装置1000可用于实现上述方法实施例中描述的方法。装置1000可以是芯片、用户设备或网络设备。
装置1000可以包括一个或多个处理器1010。该处理器1010可支持装置1000实现前文方法实施例所描述的方法。该处理器1010可以是通用处理器或者专用处理器。例如，该处理器可以为中央处理单元(central processing unit，CPU)。或者，该处理器还可以是其他通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现成可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
装置1000还可以包括一个或多个存储器1030。存储器1030上存储有程序，该程序可以被处理器1010执行，使得处理器1010执行前文方法实施例所描述的方法。存储器1030可以独立于处理器1010也可以集成在处理器1010中。
装置1000还可以包括收发器1030。处理器1010可以通过收发器1030与其他设备或芯片进行通信。例如，处理器1010可以通过收发器1030与其他设备或芯片进行数据收发。
为了便于理解，下面对第一节点和第二节点的通信设备的硬件模块进行简单介绍。
参见图11，图11为本申请实施例提供的通信设备的硬件模块示意图。具体地，图11示出了接入网络中相互通信的第一通信设备450以及第二通信设备410的框图。
第一通信设备450包括控制器/处理器459，存储器460，数据源467，发射处理器468，接收处理器456，多天线发射处理器457，多天线接收处理器458，发射器/接收器454和天线452。
第二通信设备410包括控制器/处理器475，存储器476，数据源477，接收处理器470，发射处理 器416，多天线接收处理器472，多天线发射处理器471，发射器/接收器418和天线420。
在从所述第二通信设备410到所述第一通信设备450的传输中，在所述第二通信设备410处，来自核心网的上层数据包或者来自数据源477的上层数据包被提供到控制器/处理器475。核心网和数据源477表示L2层之上的所有协议层。控制器/处理器475实施L2层的功能性。在从所述第二通信设备410到所述第一通信设备450的传输中，控制器/处理器475提供标头压缩、加密、包分段和重排序、逻辑与输送信道之间的多路复用，以及基于各种优先级量度对所述第一通信设备450的无线资源分配。控制器/处理器475还负责丢失包的重新发射，和到所述第一通信设备450的信令。发射处理器416和多天线发射处理器471实施用于Ll层(即，物理层)的各种信号处理功能。发射处理器416实施编码和交错以促进所述第二通信设备410处的前向错误校正，以及基于各种调制方案(例如，二元相移键控、正交相移键控、M相移键控、M正交振幅调制)的信号群集的映射。多天线发射处理器471对经编码和调制后的符号进行数字空间预编码，包括基于码本的预编码和基于非码本的预编码，和波束赋型处理，生成一个或多个空间流。发射处理器416随后将每一空间流映射到子载波，在时域和/或频域中与参考信号(例如，导频)多路复用，且随后使用快速傅立叶逆变换以产生载运时域多载波符号流的物理信道。随后多天线发射处理器471对时域多载波符号流进行发送模拟预编码/波束赋型操作。每一发射器418把多天线发射处理器471提供的基带多载波符号流转化成射频流，随后提供到不同天线420。
在从所述第二通信设备410到所述第一通信设备450的传输中，在所述第一通信设备450处，每一接收器454通过其相应天线452接收信号。每一接收器454恢复调制到射频载波上的信息，且将射频流转化成基带多载波符号流提供到接收处理器456。接收处理器456和多天线接收处理器458实施Ll层的各种信号处理功能。多天线接收处理器458对来自接收器454的基带多载波符号流进行接收模拟预编码/波束赋型操作。接收处理器456使用快速傅立叶变换将接收模拟预编码/波束赋型操作后的基带多载波符号流从时域转换到频域。在频域，物理层数据信号和参考信号被接收处理器456解复用，其中参考信号将被用于信道估计，数据信号在多天线接收处理器458中经过多天线检测后恢复出以所述第一通信设备450为目的地的任何空间流。每一空间流上的符号在接收处理器456中被解调和恢复，并生成软决策。随后接收处理器456解码和解交错所述软决策以恢复在物理信道上由所述第二通信设备410发射的上层数据和控制信号。随后将上层数据和控制信号提供到控制器/处理器459。控制器/处理器459实施L2层的功能。控制器/处理器459可与存储程序代码和数据的存储器460相关联。存储器460可称为计算机可读媒体。在从所述第二通信设备410到所述第一通信设备450的传输中，控制器/处理器459提供输送与逻辑信道之间的多路分用、包重组装、解密、标头解压缩、控制信号处理以恢复来自第二通信设备410的上层数据包。随后将上层数据包提供到L2层之上的所有协议层。也可将各种控制信号提供到L3以用于L3处理。
在从所述第一通信设备450到所述第二通信设备410的传输中，在所述第一通信设备450处，使用数据源467将上层数据包提供到控制器/处理器459。数据源467表示L2层之上的所有协议层。类似于在从所述第二通信设备410到所述第一通信设备450的传输中所描述所述第二通信设备410处的发送功能，控制器/处理器459实施标头压缩、加密、包分段和重排序以及逻辑与输送信道之间的多路复用，实施用于用户平面和控制平面的L2层功能。控制器/处理器459还负责丢失包的重新发射，和到所述第二通信设备410的信令。发射处理器468执行调制映射、信道编码处理，多天线发射处理器457进行数字多天线空间预编码，包括基于码本的预编码和基于非码本的预编码，和波束赋型处理，随后发射处理器468将产生的空间流调制成多载波/单载波符号流，在多天线发射处理器457中经过模拟预编码/波束赋型操作后再经由发射器454提供到不同天线452。每一发射器454首先把多天线发射处理器457提供的基带符号流转化成射频符号流，再提供到天线452。
在从所述第一通信设备450到所述第二通信设备410的传输中，所述第二通信设备410处的功能类似于在从所述第二通信设备410到所述第一通信设备450的传输中所描述的所述第一通信设备450处的接收功能。每一接收器418通过其相应天线420接收射频信号，把接收到的射频信号转化成基带信号，并把基带信号提供到多天线接收处理器472和接收处理器470。接收处理器470和多天线接收处理器472共同实施Ll层的功能。控制器/处理器475实施L2层功能。控制器/处理器475可与存储程序代码和数据的存储器476相关联。存储器476可称为计算机可读媒体。在从所述第一通信设备450到所述第二通信设备410的传输中，控制器/处理器475提供输送与逻辑信道之间的多路分用、包重组装、解密、标头解压缩、控制信号处理以恢复来自第一通信设备450的上层数据包。来自控制器/处理器475的上层数据包可被提供到核心网或者L2层之上的所有协议层，也可将各种控制信号提供到核心网或者L3以用于L3处理。
作为一个实施例，所述第一通信设备450装置包括：至少一个处理器以及至少一个存储器，所述至少一个存储器包括计算机程序代码；所述至少一个存储器和所述计算机程序代码被配置成与所述至少 一个处理器一起使用，所述第一通信设备450装置至少：接收第一同步信号块，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；发送第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
作为一个实施例，所述第一通信设备450装置包括：一种存储计算机可读指令程序的存储器，所述计算机可读指令程序在由至少一个处理器执行时产生动作，所述动作包括：接收第一同步信号块，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；发送第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
作为一个实施例，所述第一通信设备450对应本申请中的第一节点。
作为一个实施例，所述第二通信设备410对应本申请中的第二节点。
作为一个实施例，所述第一通信设备450是一个UE。
作为一个实施例，所述第一通信设备450是一个支持V2X的用户设备。
作为一个实施例，所述第一通信设备450是一个支持D2D的用户设备。
作为一个实施例，所述第一通信设备450是一个网络控制中继。
作为一个实施例，所述第一通信设备450是一个中继。
作为一个实施例，所述第二通信设备410是一个基站。
作为一个实施例，所述天线452，所述接收器454，所述多天线接收处理器458，所述接收处理器456，所述控制器/处理器459被用于接收本申请中的第一同步信号块。
作为一个实施例，所述天线420，所述发射器418，所述多天线发射处理器471，所述发射处理器416，所述控制器/处理器475被用于发送本申请中的一个或多个同步信号块，所述第一同步信号块是所述一个或多个同步信号块中的之一。
作为一个实施例，所述天线452，所述发射器454，所述多天线发射处理器457，所述发射处理器468，所述控制器/处理器459被用于发送本申请中的第一前导组。
作为一个实施例，所述天线420，所述接收器418，所述多天线接收处理器472，所述接收处理器470，所述控制器/处理器475被用于接收本申请中的第一前导组。
本申请实施例还提供一种计算机可读存储介质，用于存储程序。该计算机可读存储介质可应用于本申请实施例提供的终端或网络设备中，并且该程序使得计算机执行本申请各个实施例中的由终端或网络设备执行的方法。
本申请实施例还提供一种计算机程序产品。该计算机程序产品包括程序。该计算机程序产品可应用于本申请实施例提供的终端或网络设备中，并且该程序使得计算机执行本申请各个实施例中的由终端或网络设备执行的方法。
本申请实施例还提供一种计算机程序。该计算机程序可应用于本申请实施例提供的终端或网络设备中，并且该计算机程序使得计算机执行本申请各个实施例中的由终端或网络设备执行的方法。
应理解，本申请中术语“系统”和“网络”可以被可互换使用。另外，本申请使用的术语仅用于对本申请的具体实施例进行解释，而非旨在限定本申请。本申请的说明书和权利要求书及所述附图中的术语“第一”、“第二”、“第三”和“第四”等是用于区别不同对象，而不是用于描述特定顺序。此外，术语“包括”和“具有”以及它们任何变形，意图在于覆盖不排他的包含。
在本申请的实施例中，提到的“指示”可以是直接指示，也可以是间接指示，还可以是表示具有关联关系。举例说明，A指示B，可以表示A直接指示B，例如B可以通过A获取；也可以表示A间接指示B，例如A指示C，B可以通过C获取；还可以表示A和B之间具有关联关系。
在本申请实施例中，“与A相应的B”表示B与A相关联，根据A可以确定B。但还应理解，根据 A确定B并不意味着仅仅根据A确定B，还可以根据A和/或其它信息确定B。
在本申请实施例中，术语“对应”可表示两者之间具有直接对应或间接对应的关系，也可以表示两者之间具有关联关系，也可以是指示与被指示、配置与被配置等关系。
本申请实施例中，“预定义”或“预配置”可以通过在设备(例如，包括用户设备和网络设备)中预先保存相应的代码、表格或其他可用于指示相关信息的方式来实现，本申请对于其具体的实现方式不做限定。比如预定义可以是指协议中定义的。
本申请实施例中，所述“协议”可以指通信领域的标准协议，例如可以包括LTE协议、NR协议以及应用于未来的通信系统中的相关协议，本申请对此不做限定。
本申请实施例中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
在本申请的各种实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够读取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，数字通用光盘(digital video disc，DVD))或者半导体介质(例如，固态硬盘(solid state disk，SSD))等。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (59)

  1. 一种用于无线通信的第一节点中的方法，其特征在于，包括：
    接收第一同步信号块，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；
    发送第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；
    其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
  2. 根据权利要求1所述的方法，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
  3. 根据权利要求1或2所述的方法，其特征在于，所述第一时机组类型包括第一重复因子，所述第一随机接入信道时机组包括的随机接入信道时机的个数等于所述第一重复因子，所述第一重复因子是多个重复因子中的之一。
  4. 根据权利要求3所述的方法，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组对应于所述多个候选时机组类型中的之一；所述多个候选时机组类型分别包括所述多个重复因子，第二随机接入信道时机组包括的随机接入信道时机的个数等于所述第二随机接入信道时机组所对应的候选时机组类型所包括的重复因子，其中，所述第二随机接入信道时机组为所述多个随机接入信道时机组中的任一随机接入信道时机组。
  5. 根据权利要求1-4中任一项所述的方法，其特征在于，所述第一时机组类型包括第一跳频指示；所述第一跳频指示被用于确定所述第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。
  6. 根据权利要求1-5中任一项所述的方法，其特征在于，所述第一时机组类型包括第一跳频图谱；所述第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于所述第一跳频图谱。
  7. 根据权利要求1-6中任一项所述的方法，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    按照所述第一映射顺序，所述第一同步信号块的所述索引被映射到所述多个随机接入信道时机组中的至少两个随机接入信道时机组，所述至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，所述第一时机组类型被用于从所述至少两个随机接入信道时机组中确定所述第一随机接入信道时机组。
  8. 根据权利要求1-6中任一项所述的方法，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    所述第一时机组类型被用于从所述多个随机接入信道时机组中确定至少L个随机接入信道时机组，所述第一同步信号块的所述索引和所述第一映射顺序被用于从所述至少L个随机接入信道时机组中确定所述第一随机接入信道时机组，L是大于1的正整数。
  9. 根据权利要求1-8中任一项所述的方法，其特征在于，所述第一映射顺序包括以下顺序中的一项或多项：
    按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；
    按照所述多个随机接入信道时机组的频域资源递增的顺序；
    按照所述多个随机接入信道时机组的时域资源递增的顺序。
  10. 根据权利要求9所述的方法，其特征在于，所述第一映射顺序包括：先按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照所述多个随机接入信道时机组的频域资源递增的顺序；再次按照所述多个随机接入信道时机组的时域资源递增的顺序。
  11. 根据权利要求1-10中任一项所述的方法，其特征在于，所述多个随机接入信道时机组包括多个随机接入信道时机，所述多个随机接入信道时机组包括的所述多个随机接入信道时机中的每个随机接入信道时机仅属于所述多个随机接入信道时机组中的一个随机接入信道时机组；或者所述每个随机接入信道时机被所述多个随机接入信道时机组中的至少两个随机接入信道时机组共用。
  12. 根据权利要求1-11中任一项所述的方法，其特征在于，所述多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。
  13. 根据权利要求1-12中任一项所述的方法，其特征在于，包括：
    作为发送所述第一前导组的响应，在第一时间窗内接收第一随机接入响应；
    其中，所述第一随机接入信道时机组被用于确定所述第一时间窗的起始；所述第一随机接入信道时机组被用于确定所述第一随机接入响应的加扰序列。
  14. 一种用于无线通信的第二节点中的方法，其特征在于，包括：
    发送一个或多个同步信号块，第一同步信号块是所述一个或多个同步信号块中的之一，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；
    接收第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于传输所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；
    其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
  15. 根据权利要求14所述的方法，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
  16. 根据权利要求14或15所述的方法，其特征在于，所述第一时机组类型包括第一重复因子，所述第一随机接入信道时机组包括的随机接入信道时机的个数等于所述第一重复因子，所述第一重复因子是多个重复因子中的之一。
  17. 根据权利要求16所述的方法，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组对应于所述多个候选时机组类型中的之一；所述多个候选时机组类型分别包括所述多个重复因子，第二随机接入信道时机组包括的随机接入信道时机的个数等于所述第二随机接入信道时机组所对应的候选时机组类型所包括的重复因子，其中，所述第二随机接入信道时机组为所述多个随机接入信道时机组中的任一随机接入信道时机组。
  18. 根据权利要求14-17中任一项所述的方法，其特征在于，所述第一时机组类型包括第一跳频指示；所述第一跳频指示被用于确定所述第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。
  19. 根据权利要求14-18中任一项所述的方法，其特征在于，所述第一时机组类型包括第一跳频图谱；所述第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于所述第一跳频图谱。
  20. 根据权利要求14-19中任一项所述的方法，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    按照所述第一映射顺序，所述第一同步信号块的所述索引被映射到所述多个随机接入信道时机组中的至少两个随机接入信道时机组，所述至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，所述第一时机组类型被用于从所述至少两个随机接入信道时机组中确定所述第一随机接入信道时机组。
  21. 根据权利要求14-19中任一项所述的方法，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    所述第一时机组类型被用于从所述多个随机接入信道时机组中确定至少L个随机接入信道时机组，所述第一同步信号块的所述索引和所述第一映射顺序被用于从所述至少L个随机接入信道时机组中确定所述第一随机接入信道时机组，L是大于1的正整数。
  22. 根据权利要求14-21中任一项所述的方法，其特征在于，所述第一映射顺序包括以下顺序中的一项或多项：
    按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；
    按照所述多个随机接入信道时机组的频域资源递增的顺序；
    按照所述多个随机接入信道时机组的时域资源递增的顺序。
  23. 根据权利要求22所述的方法，其特征在于，所述第一映射顺序包括：先按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照所述多个随机接入信道时机组的频域资源递增的顺序；再次按照所述多个随机接入信道时机组的时域资源递增的顺序。
  24. 根据权利要求14-23中任一项所述的方法，其特征在于，所述多个随机接入信道时机组包括多个随机接入信道时机，所述多个随机接入信道时机组包括的所述多个随机接入信道时机中的每个随机接入信道时机仅属于所述多个随机接入信道时机组中的一个随机接入信道时机组；或者所述每个随机接入信道时机被所述多个随机接入信道时机组中的至少两个随机接入信道时机组共用。
  25. 根据权利要求14-24中任一项所述的方法，其特征在于，所述多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。
  26. 根据权利要求14-25中任一项所述的方法，其特征在于，包括：
    作为接收所述第一前导组的响应，在第一时间窗内发送第一随机接入响应；
    其中，所述第一随机接入信道时机组被用于确定所述第一时间窗的起始；所述第一随机接入信道时机组被用于确定所述第一随机接入响应的加扰序列。
  27. 一种用于无线通信的第一节点，其特征在于，包括：
    第一接收机，用于接收第一同步信号块，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；
    第一发射机，用于发送第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于发送所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；
    其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
  28. 根据权利要求27所述的第一节点，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
  29. 根据权利要求27或28所述的第一节点，其特征在于，所述第一时机组类型包括第一重复因子，所述第一随机接入信道时机组包括的随机接入信道时机的个数等于所述第一重复因子，所述第一重复因子是多个重复因子中的之一。
  30. 根据权利要求29所述的第一节点，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组对应于所述多个候选时机组类型中的之一；所述多个候选时机组类型分别包括所述多个重复因子，第二随机接入信道时机组包括的随机接入信道时机的个数等于所述第二随机接入信道时机组所对应的候选时机组类型所包括的重复因子，其中，所述第二随机接入信道时机组为所述多个随机接入信道时机组中的任一随机接入信道时机组。
  31. 根据权利要求27-30中任一项所述的第一节点，其特征在于，所述第一时机组类型包括第一跳频指示；所述第一跳频指示被用于确定所述第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。
  32. 根据权利要求27-31中任一项所述的第一节点，其特征在于，所述第一时机组类型包括第一跳频图谱；所述第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于所述第一跳频图谱。
  33. 根据权利要求27-32中任一项所述的第一节点，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    按照所述第一映射顺序，所述第一同步信号块的所述索引被映射到所述多个随机接入信道时机组中的至少两个随机接入信道时机组，所述至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，所述第一时机组类型被用于从所述至少两个随机接入信道时机组中确定所述第一随机接入信道时机组。
  34. 根据权利要求27-32中任一项所述的第一节点，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    所述第一时机组类型被用于从所述多个随机接入信道时机组中确定至少L个随机接入信道时机组，所述第一同步信号块的所述索引和所述第一映射顺序被用于从所述至少L个随机接入信道时机组中确定所述第一随机接入信道时机组，L是大于1的正整数。
  35. 根据权利要求27-34中任一项所述的第一节点，其特征在于，所述第一映射顺序包括以下顺序中的一项或多项：
    按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；
    按照所述多个随机接入信道时机组的频域资源递增的顺序；
    按照所述多个随机接入信道时机组的时域资源递增的顺序。
  36. 根据权利要求35所述的第一节点，其特征在于，所述第一映射顺序包括：先按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照所述多个随机接入信道时机组的频域资源递增的顺序；再次按照所述多个随机接入信道时机组的时域资源递增的顺序。
  37. 根据权利要求27-36中任一项所述的第一节点，其特征在于，所述多个随机接入信道时机组包括多个随机接入信道时机，所述多个随机接入信道时机组包括的所述多个随机接入信道时机中的每个随机接入信道时机仅属于所述多个随机接入信道时机组中的一个随机接入信道时机组；或者所述每个随机接入信道时机被所述多个随机接入信道时机组中的至少两个随机接入信道时机组共用。
  38. 根据权利要求27-37中任一项所述的第一节点，其特征在于，所述多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。
  39. 根据权利要求27-38中任一项所述的第一节点，其特征在于，包括：
    第二接收机，用于作为发送所述第一前导组的响应，在第一时间窗内接收第一随机接入响应；
    其中，所述第一随机接入信道时机组被用于确定所述第一时间窗的起始；所述第一随机接入信道时机组被用于确定所述第一随机接入响应的加扰序列。
  40. 一种用于无线通信的第二节点，其特征在于，包括：
    第一发射机，用于发送一个或多个同步信号块，第一同步信号块是所述一个或多个同步信号块中的之一，所述第一同步信号块的索引是多个候选同步信号块索引中的之一；
    第一接收机，用于接收第一前导组，所述第一前导组包括多个前导；第一随机接入信道时机组包括多个随机接入信道时机，所述第一随机接入信道时机组中的所述多个随机接入信道时机分别被用于传输所述第一前导组中的所述多个前导；所述第一随机接入信道时机组中的任意两个随机接入信道时机在时域上是正交的；
    其中，所述多个候选同步信号块索引按照第一映射顺序被映射到多个随机接入信道时机组，所述第一随机接入信道时机组是所述多个随机接入信道时机组中的之一；所述第一随机接入信道时机组对应于第一时机组类型，所述第一时机组类型是多个候选时机组类型中的之一；所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组。
  41. 根据权利要求40所述的第二节点，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组属于第一周期。
  42. 根据权利要求40或41所述的第二节点，其特征在于，所述第一时机组类型包括第一重复因子，所述第一随机接入信道时机组包括的随机接入信道时机的个数等于所述第一重复因子，所述第一重复因子是多个重复因子中的之一。
  43. 根据权利要求42所述的第二节点，其特征在于，所述多个随机接入信道时机组中的任一随机接入信道时机组对应于所述多个候选时机组类型中的之一；所述多个候选时机组类型分别包括所述多个重复因子，第二随机接入信道时机组包括的随机接入信道时机的个数等于所述第二随机接入信道时机组所对应的候选时机组类型所包括的重复因子，其中，所述第二随机接入信道时机组为所述多个随机接入信道时机组中的任一随机接入信道时机组。
  44. 根据权利要求40-43中任一项所述的第二节点，其特征在于，所述第一时机组类型包括第一跳频指示；所述第一跳频指示被用于确定所述第一随机接入信道时机组中的至少两个随机接入信道时机所占用的频域资源是否不同。
  45. 根据权利要求40-44中任一项所述的第二节点，其特征在于，所述第一时机组类型包括第一跳频图谱；所述第一随机接入信道时机组中的任一随机接入信道时机所占用的频域资源对应于所述第一跳频图谱。
  46. 根据权利要求40-45中任一项所述的第二节点，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    按照所述第一映射顺序，所述第一同步信号块的所述索引被映射到所述多个随机接入信道时机组中的至少两个随机接入信道时机组，所述至少两个随机接入信道时机组分别对应于至少两个不同的候选时机组类型，所述第一时机组类型被用于从所述至少两个随机接入信道时机组中确定所述第一随机接入信道时机组。
  47. 根据权利要求40-45中任一项所述的第二节点，其特征在于，所述第一同步信号块的所述索引，所述第一时机组类型和所述第一映射顺序被用于确定所述第一随机接入信道时机组，包括：
    所述第一时机组类型被用于从所述多个随机接入信道时机组中确定至少L个随机接入信道时机组，所述第一同步信号块的所述索引和所述第一映射顺序被用于从所述至少L个随机接入信道时机组中确定所述第一随机接入信道时机组，L是大于1的正整数。
  48. 根据权利要求40-47中任一项所述的第二节点，其特征在于，所述第一映射顺序包括以下顺序中的一项或多项：
    按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；
    按照所述多个随机接入信道时机组的频域资源递增的顺序；
    按照所述多个随机接入信道时机组的时域资源递增的顺序。
  49. 根据权利要求48所述的第二节点，其特征在于，所述第一映射顺序包括：先按照所述多个随机接入信道时机组中的一个随机接入信道时机组内的前导索引递增的顺序；其次按照所述多个随机接入信道时机组的频域资源递增的顺序；再次按照所述多个随机接入信道时机组的时域资源递增的顺序。
  50. 根据权利要求40-49中任一项所述的第二节点，其特征在于，所述多个随机接入信道时机组包括多个随机接入信道时机，所述多个随机接入信道时机组包括的所述多个随机接入信道时机中的每个随机接入信道时机仅属于所述多个随机接入信道时机组中的一个随机接入信道时机组；或者所述每个随机接入信道时机被所述多个随机接入信道时机组中的至少两个随机接入信道时机组共用。
  51. 根据权利要求40-50中任一项所述的第二节点，其特征在于，所述多个随机接入信道时机组中的至少一个随机接入信道时机组中的至少两个随机接入信道时机属于两个不同的时隙。
  52. 根据权利要求40-51中任一项所述的第二节点，其特征在于，包括：
    第二发射机，用于作为接收所述第一前导组的响应，在第一时间窗内发送第一随机接入响应；
    其中，所述第一随机接入信道时机组被用于确定所述第一时间窗的起始；所述第一随机接入信道时机组被用于确定所述第一随机接入响应的加扰序列。
  53. 一种用于无线通信的第一节点，其特征在于，包括存储器、处理器和收发器，所述存储器用于存储程序，所述处理器用于调用所述存储器中的程序，以使所述第一节点执行如权利要求1-13中任一项所述的方法。
  54. 一种用于无线通信的第二节点，其特征在于，包括存储器、处理器和收发器，所述存储器用于存储程序，所述处理器用于调用所述存储器中的程序，以使所述第二节点执行如权利要求14-26中任一项所述的方法。
  55. 一种装置，其特征在于，包括处理器，用于从存储器中调用程序，以使所述装置执行如权利要求1-26中任一项所述的方法。
  56. 一种芯片，其特征在于，包括处理器，用于从存储器调用程序，使得安装有所述芯片的设备执行如权利要求1-26中任一项所述的方法。
  57. 一种计算机可读存储介质，其特征在于，其上存储有程序，所述程序使得计算机执行如权利要求1-26中任一项所述的方法。
  58. 一种计算机程序产品，其特征在于，包括程序，所述程序使得计算机执行如权利要求1-26中任一项所述的方法。
  59. 一种计算机程序，其特征在于，所述计算机程序使得计算机执行如权利要求1-26中任一项所述的方法。
PCT/CN2023/076510 2023-02-16 2023-02-16 用于无线通信的节点中的方法和装置 Ceased WO2024168703A1 (zh)

Priority Applications (9)

Application Number Priority Date Filing Date Title
CN202380082659.3A CN120359788A (zh) 2023-02-16 2023-02-16 用于无线通信的节点中的方法和装置
PCT/CN2023/076510 WO2024168703A1 (zh) 2023-02-16 2023-02-16 用于无线通信的节点中的方法和装置
EP23921859.7A EP4529304A4 (en) 2023-02-16 2023-02-16 METHOD AND APPARATUS FOR USE IN WIRELESS COMMUNICATION NODES
KR1020257005633A KR102934625B1 (ko) 2023-02-16 2023-02-16 무선 통신을 위해 사용되는 노드를 위한 방법 및 장치
JP2024576833A JP7769154B2 (ja) 2023-02-16 2023-02-16 ワイヤレス通信のために使用されるノードのための方法および装置
KR1020267006396A KR20260036619A (ko) 2023-02-16 2023-02-16 무선 통신을 위해 사용되는 노드를 위한 방법 및 장치
US18/402,452 US12143922B2 (en) 2023-02-16 2024-01-02 Method and apparatus for node used for wireless communication
US18/940,966 US20250071664A1 (en) 2023-02-16 2024-11-08 Method and apparatus for node used for wireless communication
JP2025183801A JP2026035595A (ja) 2023-02-16 2025-10-30 ワイヤレス通信のために使用されるノードのための方法および装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2023/076510 WO2024168703A1 (zh) 2023-02-16 2023-02-16 用于无线通信的节点中的方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/402,452 Continuation US12143922B2 (en) 2023-02-16 2024-01-02 Method and apparatus for node used for wireless communication

Publications (1)

Publication Number Publication Date
WO2024168703A1 true WO2024168703A1 (zh) 2024-08-22

Family

ID=92303941

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/076510 Ceased WO2024168703A1 (zh) 2023-02-16 2023-02-16 用于无线通信的节点中的方法和装置

Country Status (6)

Country Link
US (2) US12143922B2 (zh)
EP (1) EP4529304A4 (zh)
JP (2) JP7769154B2 (zh)
KR (2) KR102934625B1 (zh)
CN (1) CN120359788A (zh)
WO (1) WO2024168703A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12238659B2 (en) * 2021-07-06 2025-02-25 Electronics And Telecommunications Research Institute Method and apparatus for transmitting and receiving multi synchronization signal block in communication system
WO2025000427A1 (zh) * 2023-06-30 2025-01-02 上海移远通信技术股份有限公司 被用于无线通信的节点中的方法和装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112788762A (zh) * 2019-11-05 2021-05-11 诺基亚技术有限公司 随机接入信道时机和ss/pbch块关联的增强
US20220046724A1 (en) * 2020-08-07 2022-02-10 Nokia Technologies Oy Methods for ul rach coverage extension
US20220061099A1 (en) * 2020-08-19 2022-02-24 Qualcomm Incorporated Synchronization signal block to physical random access channel mapping with multiple resource block sets
WO2022071755A1 (ko) * 2020-09-29 2022-04-07 엘지전자 주식회사 무선 통신 시스템에서 무선 신호 송수신 방법 및 장치

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111279784B (zh) * 2017-09-11 2023-08-29 苹果公司 物理随机接入信道(prach)格式配置
WO2019139299A1 (ko) * 2018-01-12 2019-07-18 엘지전자 주식회사 물리 임의 접속 채널을 송수신하는 방법 및 이를 위한 장치
EP4236184A3 (en) * 2018-01-12 2023-11-22 ZTE Corporation Efficient signaling based on associations of configuration parameters
JP7158174B2 (ja) 2018-05-10 2022-10-21 シャープ株式会社 基地局装置、端末装置、通信方法、および、集積回路
CN114916086A (zh) * 2018-08-07 2022-08-16 华为技术有限公司 随机接入方法、通信装置、芯片及存储介质
EP3834547A1 (en) * 2018-08-09 2021-06-16 Sharp Kabushiki Kaisha Base station coordinated synchronization block transmissions in integrated access and backhaul network
US11330571B2 (en) * 2018-08-20 2022-05-10 Qualcomm Incorporated Random access techniques in beamformed wireless communications
JP7298683B2 (ja) * 2018-09-26 2023-06-27 富士通株式会社 Ｌｂｔ監視失敗の処理方法、装置及びシステム
US11246160B2 (en) * 2019-02-28 2022-02-08 Samsung Electronics Co., Ltd. Method and apparatus for valid RACH occasion determination in NR unlicensed
CN118695397A (zh) * 2019-03-22 2024-09-24 迪朵无线创新有限公司 一种被用于无线通信的节点中的方法和装置
US11412550B2 (en) * 2019-05-02 2022-08-09 Ofinno, Llc Random access response reception for a two-step random access procedure
US11290147B2 (en) * 2019-08-23 2022-03-29 Qualcomm Incorproated Frequency hopping with slot bundling
JP7659556B2 (ja) * 2019-12-05 2025-04-09 クゥアルコム・インコーポレイテッド 複数の周波数領域スタガランダムアクセスチャネル（ｒａｃｈ）リソースとのサウンディング基準信号（ｓｒｓ）の関連付け
WO2021231811A1 (en) * 2020-05-15 2021-11-18 Nazanin Rastegardoost Initial access enhancements for multi-beam operation
US12363763B2 (en) * 2020-08-25 2025-07-15 Ofinno, Llc Beam management for random access procedures
US20240064756A1 (en) * 2021-01-04 2024-02-22 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for configured grant based transmission
EP4378247A4 (en) * 2021-07-28 2025-03-26 QUALCOMM Incorporated DISPLAY OF A REPEAT FACTOR FOR A THIRD MESSAGE OF A DIRECT ACCESS PROCEDURE
US20240032107A1 (en) * 2022-07-14 2024-01-25 Samsung Electronics Co., Ltd. Initial access with multiple prach transmissions
CN116347648B (zh) 2023-02-16 2025-12-12 上海移远通信技术股份有限公司 用于无线通信的节点中的方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112788762A (zh) * 2019-11-05 2021-05-11 诺基亚技术有限公司 随机接入信道时机和ss/pbch块关联的增强
US20220046724A1 (en) * 2020-08-07 2022-02-10 Nokia Technologies Oy Methods for ul rach coverage extension
US20220061099A1 (en) * 2020-08-19 2022-02-24 Qualcomm Incorporated Synchronization signal block to physical random access channel mapping with multiple resource block sets
WO2022071755A1 (ko) * 2020-09-29 2022-04-07 엘지전자 주식회사 무선 통신 시스템에서 무선 신호 송수신 방법 및 장치

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
NTT DOCOMO, INC.: "Maintenance for NR random access", 3GPP DRAFT; R1-1809135_MAINTENANCE FOR NR RANDOM ACCESS FINAL, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Gothenburg, Sweden; 20180820 - 20180824, 10 August 2018 (2018-08-10), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , XP051516505 *
See also references of EP4529304A4 *

Also Published As

Publication number Publication date
KR20260036619A (ko) 2026-03-17
US20240284304A1 (en) 2024-08-22
JP7769154B2 (ja) 2025-11-12
KR102934625B1 (ko) 2026-03-04
US12143922B2 (en) 2024-11-12
JP2025528315A (ja) 2025-08-28
EP4529304A4 (en) 2025-08-27
CN120359788A (zh) 2025-07-22
US20250071664A1 (en) 2025-02-27
EP4529304A1 (en) 2025-03-26
JP2026035595A (ja) 2026-03-04
KR20250039457A (ko) 2025-03-20

Similar Documents

Publication Publication Date Title
CN116347648B (zh) 用于无线通信的节点中的方法和装置
US20250071664A1 (en) Method and apparatus for node used for wireless communication
US20250203670A1 (en) Method for node used for wireless communication and apparatus
US20260107327A1 (en) Method and device for wireless communication
US20260040296A1 (en) Method for node used for wireless communication and apparatus
US20250176037A1 (en) Method and device for use in nodes for wireless communication
WO2025000427A1 (zh) 被用于无线通信的节点中的方法和装置
CN121078562A (zh) 用于无线通信的节点中的方法和装置
WO2025019996A1 (zh) 用于无线通信的节点中的方法和装置
US12250728B2 (en) Method applied at node for wireless communication and apparatus
EP4716333A1 (en) Method and apparatus in node used for wireless communication
JP2026515441A (ja) ワイヤレス通信のための方法及び装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23921859

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2023921859

Country of ref document: EP

Ref document number: 23921859.7

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2023921859

Country of ref document: EP

Effective date: 20241216

WWE Wipo information: entry into national phase

Ref document number: 2024576833

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 202547007703

Country of ref document: IN

WWP Wipo information: published in national office

Ref document number: 202547007703

Country of ref document: IN

ENP Entry into the national phase

Ref document number: 20257005633

Country of ref document: KR

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 1020257005633

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 1020257005633

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 202380082659.3

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 202380082659.3

Country of ref document: CN

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112025016683

Country of ref document: BR

NENP Non-entry into the national phase

Ref country code: DE