Random access methods, communication apparatuses and storage medium

Abstract

Provided are random access methods, communication apparatuses and a storage medium. A random access method is applied to a first node. The method comprises: sending a plurality of random access preambles to a second node, wherein the plurality of random access preambles are used for jointly determining a random access preamble corresponding to a random access process; and receiving a random access response message sent by the second node.

Description

Random access method, communication device, and storage medium

[0001] This disclosure claims priority to Chinese patent application No. 202311444826.2, filed on October 31, 2023, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present disclosure relates to the field of communication technology, and in particular to a random access method, a communication device, and a storage medium. Background Art

[0003] Cell-free systems are a potential future network deployment model. This means that the network consistently provides a UE-centric service network for user equipment (UE). This eliminates performance differences between the cell edge and the cell center, while also minimizing the impact of mobility issues such as handovers and cell reselection on user experience. In a cell-free system, a reasonable working assumption is that the UE enters a "cell-free" network mode during the initial access phase. This means that connections between the UE and multiple wireless access points (APs) within the cell-free system are established during the initial access phase.

[0004] Summary of the Invention

[0005] In one aspect, a random access method is provided, which is applied to a first node. The random access method includes:

[0006] Sending multiple random access preambles to the second node, where the multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process;

[0007] receiving a random access response message sent by the second node.

[0008] In another aspect, a random access method is provided, which is applied to a second node. The random access method includes:

[0009] receiving a plurality of random access preambles sent by the first node, where the plurality of random access preambles are used to jointly determine a random access preamble corresponding to a random access process;

[0010] A random access response message is sent to the first node.

[0011] In another aspect, a communication device is provided, which is applied to a first node. The communication device includes:

[0012] a sending unit, configured to send a plurality of random access preambles to the second node, where the plurality of random access preambles are used to jointly determine a random access preamble corresponding to a random access process;

[0013] The receiving unit is configured to receive a random access response message sent by the second node.

[0014] In another aspect, a communication device is provided, which is applied to a second node. The communication device includes:

[0015] a receiving unit, configured to receive multiple random access preambles sent by the first node, where the multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process;

[0016] The sending unit is configured to send a random access response message to the first node.

[0017] In another aspect, a communication device is provided, comprising: a processor and a memory, wherein the memory stores instructions executable by the processor; and when the processor is configured to execute the instructions, the communication device implements the method provided in any of the above aspects.

[0018] In yet another aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the computer executes the method provided in any one of the above aspects.

[0019] In yet another aspect, a computer program product comprising computer instructions is provided. When the computer instructions are executed on a computer, the computer is caused to execute the method provided in any one of the above aspects. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings are used to provide a further understanding of the technical solution of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the technical solution of the present disclosure and do not constitute a limitation to the technical solution of the present disclosure.

[0021] FIG1 is a schematic diagram showing the composition of a decellularization system according to some embodiments of the present disclosure.

[0022] FIG2 is a schematic diagram of a random access process of a 5G NR system according to some embodiments of the present disclosure.

[0023] FIG3 is a schematic structural diagram of a communication system according to some embodiments of the present disclosure.

[0024] FIG4 is a schematic flow chart of a random access method according to some embodiments of the present disclosure.

[0025] FIG5 is a schematic diagram of sending multiple random access preamble codes according to some embodiments of the present disclosure.

[0026] FIG6 is a schematic diagram of a data structure according to some embodiments of the present disclosure.

[0027] FIG7 is a schematic diagram of another data structure according to some embodiments of the present disclosure.

[0028] FIG8 is a schematic flow chart of another random access method according to some embodiments of the present disclosure.

[0029] FIG9 is a schematic diagram showing the composition of a communication device according to some embodiments of the present disclosure.

[0030] FIG10 is a schematic diagram showing the composition of another communication device according to some embodiments of the present disclosure.

[0031] FIG11 is a schematic structural diagram of a communication device according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0032] To enable those skilled in the art to better understand the technical solutions of the embodiments of the present disclosure, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by those of ordinary skill in the art without making any creative efforts shall fall within the scope of protection of the present disclosure.

[0033] Unless the context requires otherwise, throughout the specification and claims, the term "comprise" and its other forms, such as the third person singular form "comprises" and the present participle form "comprising", are to be interpreted as open and inclusive, that is, "including, but not limited to". In the description of the specification, the terms "one embodiment", "some embodiments", "exemplary embodiments", "example", "specific example" or "some examples" are intended to indicate that the particular features, structures, materials or characteristics associated with the embodiment or example are included in at least one embodiment or example of the present disclosure. The schematic representation of the above terms does not necessarily refer to the same embodiment or example. In addition, the particular features, structures, materials or characteristics may be included in any one or more embodiments or examples in any appropriate manner.

[0034] The terms "first," "second," and the like are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of the technical features being referred to. Thus, a feature qualified by the terms "first," "second," and the like may explicitly or implicitly include one or more of such features. Throughout this disclosure, unless otherwise specified, "plurality" means two or more.

[0035] In the embodiments of the present disclosure, words such as "exemplarily" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplarily" or "for example" in the embodiments of the present disclosure should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplarily" or "for example" is intended to present the relevant concepts in a concrete manner.

[0036] Additionally, the use of “based on” is meant to be open and inclusive, as a process, step, calculation, or other action “based on” one or more stated conditions or values ​​may, in practice, be based on additional conditions or values ​​beyond those stated.

[0037] Cell splitting in traditional cellular systems is currently considered an effective way to increase wireless system capacity. However, with the deployment of various low-power network nodes, including microcells, small cells, home base stations, and relay nodes, cellular systems are becoming increasingly heterogeneous and dense. This leads to severe inter-cell interference, and frequent handoffs during UE mobility also reduce system capacity and user experience. Furthermore, the system capacity and interference of densely populated cells in traditional cellular systems are limited. As the cell radius decreases, the system capacity reaches a clear inflection point, which means that the practice of increasing system capacity per unit coverage area by splitting cells is approaching its upper limit.

[0038] For example, as shown in FIG1 , a schematic diagram of the composition of a decellularized system provided by an embodiment of the present disclosure is shown. Referring to FIG1 , the decellularized system includes multiple central processing units (CPUs), such as CPU1, CPU2, and CPU3, multiple UEs, such as UE1, UE2, and UE3, and multiple APs, such as AP1-AP 20In a de-cellularized system, multiple APs equipped with one or more antennas are distributed in a larger area, and data is transmitted to the CPU via a fronthaul link, using the same time domain resources and frequency domain resources to provide services to multiple UEs. Continuing with Figure 1, in a de-cellularized system, each UE in a connected state has a cell centered on the UE itself, and the cell moves with the UE as it moves. This can minimize the impact of inter-cell interference, frequent switching, and other issues on the UE. For example, for UE1 shown in Figure 1, AP1-AP6 near UE1 can be understood as a cell centered on UE1.

[0039] In a decellularized system, one assumption is that the UE operates in decellularized mode only after a radio resource control (RRC) connection has been established. Prior to this, the UE still needs to establish an RRC connection with a cell in the cellular system, following the cellular system model, and then handover or migration from the cellular system to the decellularized system. However, a drawback of this approach is that the cellular and decellularized systems are designed based on two different philosophies: the cellular system is base station-centric, while the decellularized system is UE-centric. By combining these two systems, the UE still faces severe inter-cell interference and frequent cell selection / reselection when accessing a coexisting system where both the cellular system and the decellularized system coexist. Therefore, a more reasonable working assumption is to enter the decellularized network mode during the initial access phase, meaning that the UE establishes connections with multiple APs during the initial access phase. Achieving initial access in the decellularized network mode requires addressing numerous issues, one of which is how to expand the random access resource capacity.

[0040] The reasons why the random access resources need to be expanded are as follows: Continuing with Figure 1, the multiple APs connected to each CPU are distributed and responsible for communicating with the UE in a larger area. In a traditional cellular system, this area may be the coverage area of ​​several or more base stations, but in a de-cellularized system, there is only one master control unit such as CPU1, CPU2 or CPU3. The random access resources of a cellular system are allocated in a cell-specific manner. Each cell independently configures the time domain resources, frequency domain resources and code domain resources for random access. The time domain resources and frequency domain resources correspond to random access occasions (RO), and the code domain resources correspond to random access preambles (preambles). After the introduction of the de-cellularized system, since the coverage control area of ​​the CPU is the coverage area of ​​the original multiple base stations, and the design requirement for the sixth generation mobile communication technology (6G) is that the connection density per square kilometer is 106 ~10 8 The connection density per square kilometer required by the fifth generation mobile communication technology (5G) is more than 10 times that of six million UEs, so it is necessary to expand the capacity of random access resources.

[0041] The expansion of random access resources involves a random access process. For ease of understanding, the following first illustrates the random access process of a 5G New Radio (NR) system.

[0042] As shown in FIG2 , a schematic diagram of a random access process of a 5G NR system provided by an embodiment of the present disclosure is shown in FIG2 . First, the UE sends a random access preamble on an appropriate RO according to the physical random access channel (PRACH) transmission parameters configured by the base station (e.g., the next generation base station (gNB)) and the synchronization signal block (SSB) selected by the UE, that is, message (msg) 1 shown in FIG1 . During the process of sending the random access preamble, if the transmit-receive (Tx-Rx) reciprocity on the UE side can be guaranteed, there will be a fixed mapping between the UE's receive beam (Rx beam) and the UE's transmit beam (Tx beam). The UE can then determine a unique Tx beam based on the UE's reception of the SSB. Specifically, the UE can try to use different Rx beams to receive the SSB from the base station and determine the best or appropriate Rx beam (e.g., one with the highest reference signal received power (RSRP) value or an RSRP value higher than a predefined threshold). Then, based on the best or suitable Rx beam, the corresponding Tx beam is determined. The Ro used to transmit the PRACH is determined based on the relationship between the SSB and the Ro. Based on this relationship, the gNB can implicitly determine the index of the SSB selected by the UE. The gNB can then use the beam that is quasi co-located (QCL) with the SSB to transmit subsequent downlink (DL) transmissions, including msg2 and msg4 shown in Figure 2. Msg2 can also be called a random access response (RAR), and msg4 is a downlink channel with a UE contention resolution indicator. It should be noted that msg1-msg4 shown in Figure 2 are messages corresponding to the four-step method in the random access process. For the detailed description of msg1-msg4, please refer to the description of the four-step method in the random access process in some technologies and will not be repeated here. In Figure 2, Best DL Rx beam represents the best downlink receive beam, Best UL Tx beam represents the best uplink transmit beam, and Beam correspondent represents the beam channel.

[0043] The 5G NR system configures the resources of random access preamble from three aspects. For example, in the time domain, the parameter PRACH configuration index (PRACH-ConfigurationIndex) is used to configure the available random access opportunities in the time domain. The time domain density is adjusted according to the number of UE accesses within the coverage area. In extreme scenarios, all time slots in a 10ms frame can be used for random access opportunities. In the frequency domain, the parameters message 1-frequency start (msg1-FrequencyStart) and msg1-frequency division multiplexing (msg1-FDM) are used to configure the available random access opportunities in the frequency domain, where msg1-FDM is the multiplexing coefficient of the frequency domain PRACH, which determines the frequency domain capacity of the PRACH, with a maximum of 8. In the code domain, the parameters prach-root sequence index (PRACH-Root SequenceIndex) and zero correlation zone configuration (zero Correlation Zone Config) are used to configure the root sequence and N of the random access preamble code in the cell. CS , and N CS A complex algorithm determines the maximum number of available random access preambles within a root sequence. The current limitation is that a root sequence can generate no more than 64 random access preambles.

[0044] Considering the continuity of technology and inheriting more available features, the expansion of random access resources should also be carried out from the above three aspects.

[0045] The above is an example of a random access process for a 5G NR system. The following describes the solution of the embodiment of the present disclosure in conjunction with the accompanying drawings.

[0046] The technical solutions provided by the embodiments of the present disclosure can be applied to various mobile communication networks, for example, NR mobile communication networks using 5G, future mobile communication networks (such as 6G wireless communication systems), or multiple communication convergence systems (for example, coexistence systems in which cellular systems and de-cellularized systems coexist), etc., and the embodiments of the present disclosure are not limited to this.

[0047] In the embodiments of the present disclosure, the network architecture of the mobile communication network (including but not limited to 3G, 4G, 5G and future mobile communication networks) may include network-side devices (for example, including but not limited to base stations) and receiving-side devices (for example, including but not limited to terminals). And it should be understood that, in this example, in the downlink, the first communication node (also referred to as the first communication node device) may be a base station-side device, and the second communication node (also referred to as the second communication node device) may be a terminal-side device. Of course, in the uplink, the first communication node may also be a terminal-side device, and the second communication node may also be a base station-side device. In the device-to-device communication between the two communication nodes, the first communication node and the second communication node may both be base stations or terminals. The first communication node and the second communication node may be referred to as the first node and the second node, respectively.

[0048] For example, taking a base station as the network-side device and a terminal as the receiving-side device, FIG3 shows a schematic diagram of the structure of a communication system provided by an embodiment of the present disclosure. As shown in FIG3 , the communication system 10 includes a base station 110 and a terminal 120. The base station 110 and the terminal 120 can be communicatively connected.

[0049] In some embodiments, base station 110 is configured to provide wireless access services to multiple terminals 120. Specifically, a base station provides a service coverage area (also referred to as a cell). Terminals 120 that enter this area can communicate with base station 110 via wireless signals, thereby receiving the wireless access services provided by base station 110.

[0050] In some embodiments, the base station 110 may be any of an evolution nodeB (eNB), a next-generation nodeB (gNB), a transmission receive point (TRP), a transmission point (TP), and some other access node. Based on the size of the service coverage area provided, base stations can be further divided into macro base stations for providing macro cells, micro base stations for providing pico cells, and femto base stations for providing femto cells. With the continuous evolution of wireless communication technology, future base stations may also adopt other names.

[0051] In some embodiments, the terminal 120 can be a device with wireless transceiver capabilities, which can be deployed on land, including indoors or outdoors, handheld, wearable, or vehicle-mounted; it can also be deployed on the water (such as a ship, etc.); it can also be deployed in the air (for example, on an airplane, a balloon, and a satellite, etc.). The terminal can be a mobile phone, a tablet computer, a computer with wireless transceiver capabilities, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical care, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. The embodiments of the present disclosure do not limit the application scenarios. The terminal may sometimes also be referred to as a user, user equipment, access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication equipment, UE agent or UE device, etc., which is not limited to the embodiments of the present disclosure.

[0052] It should be understood that FIG3 is an exemplary structural diagram, and the number of devices included in the communication system shown in FIG3 is not limited, for example, the number of base stations and terminals is not limited. Moreover, in addition to the devices shown in FIG3, the communication system shown in FIG3 may also include other devices, which is not limited.

[0053] Next, as shown in FIG4 , an embodiment of the present disclosure provides a random access method, which is applied to a first node. The first node may be the terminal 120 shown in FIG3 . The method may include the following S101 - S102 .

[0054] S101. Send multiple random access preambles to a second node.

[0055] In some embodiments, when the first node is in a random access process, the first node sends multiple random access preamble codes to the second node, wherein the multiple random access preamble codes are used to jointly determine the random access preamble code corresponding to a random access process. The second node can be the base station 110 in the communication system shown in Figure 3 above.

[0056] As an example, sending multiple random access preambles to the second node may be sending an index of each random access preamble in the multiple random access preambles to the second node.

[0057] As another example, sending multiple random access preambles to the second node may be sending a random access preamble (RAP) message to the second node, where the RAP message includes the multiple random access preambles.

[0058] In some embodiments, the RAP message may include an index of each random access preamble.

[0059] In some embodiments, the first node may send multiple random access preambles to the second node in any of the following states:

[0060] Radio resource control (RRC) idle state (RRC_IDLE);

[0061] RRC inactive state (RRC_INACTIVE);

[0062] RRC connection state (RRC_CONNECTED).

[0063] In some embodiments, each random access preamble corresponds to a random access opportunity.

[0064] It should be understood that a conventional random access signal (PRACH or msg1) is transmitted by selecting a random access preamble (or a random access preamble index) based on an RO. Its characteristic is that the first node only transmits a random access preamble once during a random access process. A random access preamble can only be randomly selected from a maximum of 64 random access preambles (or random access preamble indexes) for transmission, and the selectable capacity of random access preambles does not exceed 64.

[0065] If the random access preamble is sent multiple times, the first node randomly selects a random access preamble on each of the multiple ROs in the group, and then sends multiple random access preambles. It should be understood that the selection requirements of the random access preamble on each RO may be different, that is, for different ROs in the group, the first node selects the random access preamble independently and randomly, and the optional capacity of the two random access preamble selections increases to 64. 2 , the optional capacity of the random access preamble code is increased to 64 by four random selections 4 By analogy, sending more random access preambles can increase the optional capacity of the random access preambles at an exponential level, thereby expanding the capacity of the random access resources in the code domain, that is, realizing the expansion of the random access resources.

[0066] For example, as shown in FIG5 , FIG5 is a schematic diagram of sending multiple random access preambles provided by an embodiment of the present disclosure. Referring to FIG5 , for example, if the first node selects a random access preamble to send on an RO, the random access preamble can be randomly selected from 64 random access preambles, and the capacity of random access preambles in the code domain is 64. For another example, if the first node selects a random access preamble to send on RO1 and RO2 respectively, the first node can randomly select a random access preamble twice, and the capacity of random access preambles in the code domain is expanded to 64. 2 For another example, if the first node selects a random access preamble to send on RO1, RO2, RO3 and RO4 respectively, the first node can randomly select the random access preamble four times, and the capacity of the random access preamble in the code domain is expanded to 64. 4 .

[0067] Therefore, the first node sends multiple random access preambles to the second node, and the multiple random access preambles are used to jointly determine the random access preamble in a random access process, thereby achieving expansion of random access resources.

[0068] In some embodiments, a group of multiple random access opportunities (ROs) is called a random access opportunity group (RO group). The configuration or determination of the time domain resources and frequency domain resources of the random access opportunity group must be aligned on both the first node and the second node (for example, a base station, a central control unit, etc.). The second node can explicitly configure the time domain resources and frequency domain resources of the random access opportunity group to the terminal, and the first node can also implicitly infer the time domain resources of the random access opportunity group through other parameters and signaling.

[0069] It should be noted that, when multiple random access preambles are used to jointly determine the random access preamble corresponding to a random access process, the first node regards the multiple random access preambles sent on multiple random access opportunities within the random access opportunity group as the sending of a complete random access preamble, and the second node regards the multiple random access preambles received on multiple random access opportunities within the random access opportunity group as the reception of a complete random access preamble.

[0070] Since the first node selects the random access preamble code independently and randomly at different random access opportunities within the random access opportunity group, when sending multiple random access preamble codes, the first node uses the combination of multiple random access preamble codes sent at different random access opportunities as a complete random access preamble code. For example, when the number of random access opportunities in the random access opportunity group is 2, at random access opportunity 1, the first node selects random access preamble code A from 64 random access preamble codes, and at random access opportunity 2, the first node selects random access preamble code B from 64 random access preamble codes. In this complete process of sending the random access preamble code, it can also be understood that during this random access process, the random access preamble code sent by the first node is random access preamble code A concatenated with random access preamble code B, or random access preamble code B concatenated with random access preamble code A.

[0071] For example, when the random access preamble on a single RO is represented by 6 bits, in the above example, the first node needs to use 12 bits to represent the random access preamble sent in full. Similarly, when the number of random access opportunities in the random access opportunity group is 4, 24 bits are required to represent the random access preamble sent in full. When the number of random access opportunities in the random access opportunity group is 8, 48 bits are required to represent the random access preamble sent in full.

[0072] It should be understood that in the above embodiment, the first node independently randomly selects a random access preamble from 64 random access preambles on each RO in the random access opportunity group, and then sends multiple random access preambles. This is only a possible implementation scheme and does not constitute a limitation on the technical solution of the present disclosure.

[0073] As an example, at least two of the multiple random access preambles differ in at least one of the following aspects: a value range, a physical random access channel format (PRACH format), and a sequence length. As another example, at least two of the multiple random access preambles are identical in at least one of the following aspects: a value range, a PRACH format, and a sequence length.

[0074] The value range includes the root sequence, the candidate random access preamble set, and the number of candidate random access preambles.

[0075] That is, for at least two random access preambles among the multiple random access preambles, the at least two random access preambles may use the same root sequence or different root sequences. The at least two random access preambles may be uniformly selected from the 64 random access preambles included in the same candidate random access preamble set or may not be uniformly selected from the 64 random access preambles included in the same candidate random access preamble set. The number of candidate random access preambles that can be selected by the at least two random access preambles may be the same or different. The at least two random access preambles may use the same PRACH format or different PRACH formats. The at least two random access preambles may use the same sequence length or different sequence lengths.

[0076] For example, taking the example of sending two random access preambles to the second node as an example, that is, there are two ROs in the random access opportunity group provided to the first node for sending two random access preambles, it can be generally understood that this is a two-stage method for processing the transmission of random access preambles, and the transmission of the two-stage random access preambles corresponds to the transmission of the random access preambles on the first RO and the second RO, respectively. The transmission of the two-stage random access preambles is not limited to using the same root sequence; the transmission of the two-stage random access preambles is not limited to selecting from a unified set of 64 candidate preamble sequences; the number of candidate random access preambles that can be selected for the transmission of the two-stage random access preambles can also be different; the transmission of the two-stage random access preambles is not limited to using the same PRACH format; the transmission of the two-stage random access preambles is not limited to using the same sequence length.

[0077] In some embodiments, the i-th random access preamble among multiple random access preambles is used to indicate configuration parameters to be used by the i+1-th random access preamble. The configuration parameters include at least one of the following: a root sequence, a candidate sequence index range, time domain resources, and frequency domain resources; i is a positive integer. That is, when the i-th random access preamble among multiple random access preambles selects a certain random access preamble, at least one of the corresponding root sequence, candidate sequence index range, time domain resources, and frequency domain resources may be indicated for the i+1-th random access preamble. The candidate sequence index range may refer to a range outside the non-root sequence index range.

[0078] Exemplarily, taking the example of the i-th random access preamble selecting and using random access preamble X, the root sequence number to be used by the i+1-th random access preamble can be calculated according to the agreed function formula Y=F1(X), or the random access preamble X can specify the candidate sequence index range to be used by the i-th random access preamble as {Xa, X+b}, or the time-frequency resources and / or frequency domain resources to be used by the i+1-th random access preamble can be calculated according to the agreed function formula Z=F2(X), or the time-frequency resource range and / or frequency domain resource range to be used by the i+1-th random access preamble can be derived according to the interval segment in which the random access preamble X falls.

[0079] In some embodiments, the first random access preamble among the multiple random access preambles is used to indicate the type of random access. The types of random access include: four-step random access, two-step random access, random access for system information request, random access for multiple transmissions to improve coverage, random access for reduced capability (Redcap), random access for network slicing, etc.

[0080] In some embodiments, the last random access preamble among the multiple random access preambles is used to provide a collision-resolved random access preamble.

[0081] As an example, taking sending multiple random access preambles to the second node as sending two random access preambles to the second node as an example, multiple random access preambles are used to jointly determine the random access preamble corresponding to a random access process as shown in the following formula (1):

[0082] in, Two random access preambles and If the two random access preambles are selected from the same 64 random access preambles, it means that m = 2 6 =64. For the value of m, the upper limit is 64, but not limited to m=64. The value of m can be a power of 2 such as 2, 4, 8, or any positive integer, which is determined based on the value range of the second random access preamble or other factors. When m=0, the first random access preamble and the second random access preamble are regarded as directly concatenated. The flexible setting of the combination parameter m provides flexibility for the expansion of random access resources, rather than being limited to expanding the capacity of available random access preambles to 64. 2 .

[0083] As another example, taking sending multiple random access preambles to the second node as sending four random access preambles to the second node as an example, multiple random access preambles are used to jointly determine the random access preamble corresponding to a random access process as shown in the following formula (2):

[0084] in, Indicates the first random access preamble among the four random access preambles, Indicates the second random access preamble among the four random access preambles, Indicates the third random access preamble among the four random access preambles, The fourth random access preamble among the four random access preambles is represented by m, n, and p, each of which has an upper limit of 64.

[0085] It should be noted that, taking the communication system shown in FIG. 3 as a decellularized system as an example, the above embodiment can be implemented in a case where the second node in the decellularized system is unaware of the first node or the second node is not configured with an index. In a case where the second node is configured with an index and is aware of the first node, the above embodiment can still be implemented. Furthermore, multiple second nodes in the decellularized system share the same random access opportunity resource pool, but different random access root sequences are configured for different second nodes to achieve the purpose of expanding the optional capacity of random access preamble codes.

[0086] In some embodiments, the random access preamble is sent based on random access resources. In the case where a cellular system and a de-cellularized system coexist, that is, when the communication system shown in FIG3 is a coexistence system in which a cellular system and a de-cellularized system coexist, the random access resources include random access resources of the cellular system and random access resources of the de-cellularized system. The random access resources of the cellular system and the random access resources of the de-cellularized system differ in at least one of the following aspects: band, carrier, bandwidth part (BWP), physical resource block (PRB), and subcarrier.

[0087] In some embodiments, the random access preamble has a corresponding random access preamble index. In the case where a cellular system and a de-cellularized system coexist, that is, when the communication system shown in FIG. 3 is a coexistence system in which the cellular system and the de-cellularized system coexist, the random access preamble index includes a random access preamble index of the de-cellularized system and a random access preamble index of the de-cellularized system. The random access preamble used for the cellular system and the random access preamble index used for the de-cellularized system are determined based on different root sequences, or the random access preamble index used for the cellular system and the random access preamble index used for the de-cellularized system are determined based on different random access preamble indices in the same root sequence.

[0088] It should be understood that even if de-cellularized systems are introduced into mobile communication networks in the future, since the scenarios targeted by de-cellularized systems and traditional mobile communication systems are somewhat different, and the migration of network modes requires a certain amount of time, de-cellularized systems and cellular systems will coexist for a long time, and there will be a large amount of overlap in coverage areas. In this scenario, it is necessary to properly handle the mutual interference of random access signals accessing the de-cellularized systems and cellular systems, and distinguish the random access resources for the de-cellularized systems and cellular systems from the perspective of resource reuse.

[0089] Therefore, in the frequency domain, the random access resources of the cellular system and the decellularized system can use different bands, carriers, partial bandwidths, physical resource blocks, and subcarriers, respectively. In the code domain, the random access preamble used by the cellular system and the random access preamble index used by the decellularized system are determined based on different root sequences, or the random access preamble index of the cellular system and the random access preamble index of the decellularized system are determined based on different random access preamble indices within the same root sequence. This defines a new feature combination for the decellularized system, or defines an offset between the random access preamble index of the decellularized system and the random access preamble index of the cellular system.

[0090] S102: Receive a random access response message sent by the second node.

[0091] As an example, receiving the random access response message sent by the second node may be receiving the random access response message sent by the second node based on a random access response (RAR) window.

[0092] In some embodiments, the RAR window is located after a first symbol, where the first symbol is a last symbol of a last random access opportunity among multiple random access opportunities corresponding to multiple random access preambles.

[0093] In some embodiments, the starting position of the RAR window is the second symbol, where the second symbol is the first symbol in the earliest control resource set (CORESET) corresponding to the physical downlink control channel (PDCCH) in the target common search space (CSS) set, where the target CSS set is the CSS set that the first node is configured to receive for determining Type 1-PDCCH. In other words, the starting position of the RAR window is the first symbol of the earliest CORESET that the first node is configured to receive the PDCCH for the Type 1-PDCCH CSS set.

[0094] In some embodiments, the random access response message is carried in a media access control (MAC) protocol data unit (PDU), the MAC PDU includes a first MAC subheader and a second MAC subheader, the first MAC subheader includes a random access preamble identifier (RAPID), and the second MAC subheader includes RAPID and MAC RAR.

[0095] For example, as shown in Figure 6 , a MAC PDU may include: one or more MAC subPDUs (MAC sub-PDUs) and padding data. The word "consisting" in Figure 6 indicates composition.

[0096] In some embodiments, the bit width of the RAPID in the first MAC subheader is related to the number of the multiple random access preambles.

[0097] As can be seen from the above example, when 6 bits are used to represent the random access preamble on a single RO, if the number of random access opportunities in the random access opportunity group is 2, the first node needs to use 12 bits to represent the random access preamble sent in full this time. Similarly, when the number of random access opportunities in the random access opportunity group is 4, 24 bits are required to represent the random access preamble sent in full this time, and when the number of random access opportunities in the random access opportunity group is 8, 48 bits are required to represent the random access preamble sent in full this time. Therefore, when multiple random access preambles are sent, the structure of the MAC PDU in the random access response message will be adjusted accordingly.

[0098] Taking sending two random access preambles to the second node as an example, as shown in FIG7 , the bit width of the RAPID corresponding to the two random access opportunities corresponding to the two random access preambles is adjusted from 6 bits to 12 bits.

[0099] As shown in (a) of Figure 7, the MAC subPDU includes three fields:

[0100] The extension field (extension, E) is used to indicate whether other fields are included after the current MAC subPDU (that is, whether the current MAC subPDU is the last one in the MAC PDU).

[0101] The type field (type, T) is used to indicate the type of the MAC subheader; for example, when T is set to 0, it means that the MAC subheader includes a backoff indicator (BI); when T is set to 1, it means that the MAC subheader includes a RAP identifier (ID); in the structure shown in (a) of Figure 7, T should be set to 0.

[0102] The RAPID corresponds to the preamble index carried by the first node in the random access request message. Thus, the first node can determine whether the corresponding RAR is successfully received based on the RAPID. For example, if the RAPID is the same as the index carried in the random access request message sent by the first node, the corresponding RAR is considered to be successfully received.

[0103] As shown in (b) of Figure 7, the MAC subPDU includes six fields:

[0104] Extension domain (extension, E);

[0105] Type domain T;

[0106] Two RAPIDs;

[0107] Two reserved (R) bits;

[0108] Based on the embodiment shown in Figure 4, the first node sends multiple random access preamble codes to the second node, and the multiple random access preamble codes are used to jointly determine the random access preamble code corresponding to a random access process, thereby expanding the random access resources and helping to improve the performance of the first node in the initial access process.

[0109] In some embodiments, as shown in FIG8 , an embodiment of the present disclosure further provides a random access method, which is applied to a second node. The second node may be the base station 110 shown in FIG3 . The method may include the following S201 - S202 .

[0110] S201: Receive multiple random access preambles sent by a first node.

[0111] Multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process.

[0112] For the description of multiple random access preambles and how to jointly determine the random access preamble corresponding to a random access process based on the multiple random access preambles, reference may be made to the corresponding description in S101 above, which will not be repeated here.

[0113] In some embodiments, the second node is one of a plurality of second nodes included in the decellularized system.

[0114] As an example, when the multiple second nodes included in the decellularized system are unknown to the terminal or the multiple second nodes are not configured with indexes, a larger value can be directly configured for the frequency domain parameter msg1-FDM until all frequency domain resources in the bandwidth are consumed.

[0115] msg1-FDM refers to the subcarrier spacing used by the terminal when initiating the first random access message during random access. msg1-FDM indicates the number of PRACH occasions in the frequency domain at the current point in time, that is, the starting position of the PRACH channel in the frequency domain.

[0116] As another example, in a de-cellular system, multiple second nodes are configured with indexes, and the multiple second nodes are known to the terminal, and the configuration parameters of the multiple second nodes are different in at least one of the following aspects: uplink initial access part bandwidth, random access time domain resources, and random access frequency domain resources.

[0117] It should be understood that different uplink initial access bandwidths are configured for different second nodes, thereby avoiding access interference between different second nodes and improving access capacity. Different random access time domain resources and random access frequency domain resources are configured for different second nodes. For example, different additional random access configurations (additional RACH configs) can be configured for different second nodes, thereby expanding random access resources in the frequency domain.

[0118] S202: Send a random access response message to the first node.

[0119] In some embodiments, after receiving multiple random access preambles sent by the first node, the second node generates a random access response message and then sends the random access response message to the first node.

[0120] In some embodiments, the random access response message includes identification information corresponding to a random access preamble corresponding to a random access procedure determined jointly based on multiple random access preambles. Exemplarily, the random access response message may carry a RAPID, where the RAPID corresponds to an index of the multiple random access preambles sent by the first node.

[0121] In some embodiments, a random access response RAR window used by the first node to receive the random access response message is located after a first symbol, where the first symbol is the last symbol of a last random access opportunity among multiple random access opportunities corresponding to multiple random access preambles. For a specific description of the random access response message, reference may be made to the corresponding description of the random access response message in S102 above, and is not repeated here.

[0122] The above embodiments are to expand the random resources in the code domain, time domain and frequency domain respectively to improve the performance of the terminal during the initial access process. In some embodiments, in Release 17 of the 3rd Generation Partnership Project (3GPP), a repetition function of message 3 physical uplink shared channel (msg3 PUSCH) is provided. The second node configures an optional repetition list for the first node, but in the future it is possible that the repetition number needs to be further expanded to an option that is not supported in the old repetition list. Generally speaking, the parameters in the old repetition list need to be expanded, and the reason may be that a new function is introduced. The combination of the new function and the msg3 PUSCH repetition function causes the parameters in the old repetition list to need to be expanded. Based on this, the embodiment of the present disclosure also provides a parameter expansion method that takes into account backward compatibility. The method includes the following S301-S302.

[0123] S301. A second node sends configuration information to a first node. Correspondingly, the first node receives the configuration information sent by the second node.

[0124] In some embodiments, when a new functionality is introduced in MSG3 PUSCH repetition, a second node generates configuration information and then transmits the configuration information to multiple first nodes. Accordingly, the first node receives the configuration information transmitted by the second node. The first node may be one of the multiple first nodes. The new functionality may be a PRACH repetition functionality.

[0125] In some embodiments, the configuration information includes at least one of the following: a first repetition number list and a second repetition number list. The maximum repetition number in the first repetition number list is smaller than the maximum repetition number in the second repetition number list.

[0126] For example, consider a first repetition list consisting of {1, 2, 3, 4, 7, 8, 12, 16} and a second repetition list consisting of {1, 2, 3, 4, 8, 12, 16, 32}. As can be seen from this example, the maximum number of repetitions in the first repetition list is 16, while the maximum number of repetitions in the second repetition list is 32. The maximum number of repetitions in the first repetition list, 16, is smaller than the maximum number of repetitions in the second repetition list, 32. The first repetition list can be considered the old repetition list, and the second repetition list can be considered the new repetition list.

[0127] S302: The first node determines whether to store a second repetition number list based on its own capability information.

[0128] The capability information of the first node itself is used to represent the capabilities that the first node can support.

[0129] In some embodiments, if the first node determines, based on its own capability information, that the capabilities it supports match the capabilities corresponding to the second repetition number list, the first node stores the second repetition number list. If the first node determines, based on its own capability information, that the capabilities it supports do not match the capabilities corresponding to the second repetition number list, that is, if the first node does not support the capabilities corresponding to the second repetition number list, the first node does not store the second repetition number list, and the first node may store the first repetition number list.

[0130] In this way, after the msg3 PUSCH repetition function introduces a new function, the second node generates a new repetition list, that is, the second repetition list, based on the combination of the msg3 PUSCH repetition function and the new function, and then sends configuration information to the first node. The configuration information includes at least the second repetition list, so that the first node determines whether to store the second repetition list based on its own capability information.

[0131] It should be understood that the second repetition list is generated by two nodes based on the combination of the msg3 PUSCH repetition function and the new function. If the capabilities of a first node match the capabilities corresponding to the second repetition list, it can be understood that the first node is a new first node. If the capabilities of a first node do not match the capabilities corresponding to the second repetition list, it can be understood that the first node is an old first node. In this way, each of the multiple first nodes performs the above S302. That is, the new first node and the old first node in the multiple first nodes each store their corresponding repetition list without affecting each other, thereby efficiently achieving the purpose of parameter expansion.

[0132] The above mainly introduces the solution provided by the present disclosure from the perspective of the interaction between each node. It is understandable that each node, such as the first node or the second node, includes a hardware structure and / or software module corresponding to the execution of each function in order to realize the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in a hardware or computer software driven hardware manner depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present disclosure.

[0133] FIG9 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. As shown in FIG9 , the communication device 40 includes a sending unit 401 and a receiving unit 402 .

[0134] The communication device 40 may be the first node or a chip in the first node. When the communication device 40 is used to implement the function of the first node in the above embodiment, each unit is used to implement the following functions.

[0135] The sending unit 401 is configured to send multiple random access preambles to the second node, where the multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process.

[0136] The receiving unit 402 is configured to receive a random access response message sent by the second node.

[0137] In some embodiments, each random access preamble corresponds to a random access opportunity.

[0138] In some embodiments, the i-th random access preamble among multiple random access preambles is used to indicate the configuration parameters that should be used for the i+1-th random access preamble, and the configuration parameters include at least one of the following: root sequence, candidate sequence index range, time domain resources, and frequency domain resources; i is a positive integer.

[0139] In some embodiments, the first random access preamble among the multiple random access preambles is used to indicate the type of random access.

[0140] In some embodiments, the receiving unit 402 is used to receive a random access response message sent by the second node based on the random access response RAR window; the RAR window is located after the first symbol, and the first symbol is the last symbol of the last random access opportunity among multiple random access opportunities corresponding to multiple random access preamble codes.

[0141] In some embodiments, the starting position of the RAR window is the second symbol, the second symbol is the first symbol in the earliest control resource set corresponding to the physical downlink control channel PDCCH in the target common search space CSS set, and the target CSS set is the CSS set that the first node is configured to receive for determining Type 1 Type1-PDCCH.

[0142] In some embodiments, the random access response message is carried in a media access control protocol data unit MAC PDU, the MAC PDU includes a first MAC subheader and a second MAC subheader, the first MAC subheader includes a random access preamble identifier RAPID, and the second MAC subheader includes RAPID and MAC RAR.

[0143] In some embodiments, the bit width of the RAPID in the first MAC subheader is related to the number of the multiple random access preambles.

[0144] In some embodiments, at least two random access preambles among the multiple random access preambles are different in at least one of the following aspects: value range, physical random access channel format PRACH format, and sequence length.

[0145] In some embodiments, at least two random access preambles among the multiple random access preambles are identical in at least one of the following aspects: value range, PRACH format, and sequence length.

[0146] In some embodiments, the random access preamble is sent based on random access resources; when a cellular system and a de-cellularized system coexist, the random access resources include random access resources of the cellular system and random access resources of the de-cellularized system; the random access resources of the cellular system and the random access resources of the de-cellularized system differ in at least one of the following aspects: band, carrier, partial bandwidth, physical resource block, subcarrier.

[0147] In some embodiments, the random access preamble has a corresponding random access preamble index; when a cellular system and a de-cellularized system coexist, the random access preamble index includes the random access preamble index of the cellular system and the random access preamble index of the de-cellularized system; the random access preamble index of the cellular system and the random access preamble index of the de-cellularized system are determined based on different root sequences; or, the random access preamble index of the cellular system and the random access preamble index of the de-cellularized system are determined based on different random access preamble indices in the same root sequence.

[0148] FIG10 is a schematic diagram showing the composition of another communication device provided by an embodiment of the present disclosure. As shown in FIG10 , the communication device 50 includes a receiving unit 501 and a sending unit 502 .

[0149] The communication device 50 may be the second node or a chip in the second node. When the communication device 50 is used to implement the function of the second node in the above embodiment, each unit is used to implement the following functions.

[0150] The receiving unit 501 is configured to receive multiple random access preambles sent by a first node, where the multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process.

[0151] The sending unit 502 is configured to send a random access response message to the first node.

[0152] In some embodiments, each random access preamble corresponds to a random access opportunity.

[0153] In some embodiments, the i-th random access preamble among multiple random access preambles is used to indicate the configuration parameters that should be used for the i+1-th random access preamble, and the configuration parameters include at least one of the following: root sequence, candidate sequence index range, time domain resources, and frequency domain resources; i is a positive integer.

[0154] In some embodiments, the first random access preamble among the multiple random access preambles is used to indicate the type of random access.

[0155] In some embodiments, a random access response RAR window for the first node to receive a random access response message is located after a first symbol, where the first symbol is the last symbol of a last random access opportunity among multiple random access opportunities corresponding to multiple random access preambles.

[0156] In some embodiments, the starting position of the RAR window is the second symbol, the second symbol is the first symbol in the earliest control resource set corresponding to the physical downlink control channel PDCCH in the target common search space CSS set, and the target CSS set is the CSS set that the first node is configured to receive for determining Type 1 Type1-PDCCH.

[0157] In some embodiments, the random access response message is carried in a media access control protocol data unit MAC PDU, the MAC PDU includes a first MAC subheader and a second MAC subheader, the first MAC subheader includes a random access preamble identifier RAPID, and the second MAC subheader includes RAPID and MAC RAR.

[0158] In some embodiments, the bit width of the RAPID in the first MAC subheader is related to the number of the multiple random access preambles.

[0159] In some embodiments, at least two random access preambles among the multiple random access preambles are different in at least one of the following aspects: value range, physical random access channel format PRACH format, and sequence length.

[0160] In some embodiments, at least two random access preambles among the multiple random access preambles are identical in at least one of the following aspects: value range, PRACH format, and sequence length.

[0161] In some embodiments, the random access preamble is received based on random access resources; in the case where a cellular system and a de-cellularized system coexist, the random access resources include random access resources of the cellular system and random access resources of the de-cellularized system; the random access resources of the cellular system and the random access resources of the de-cellularized system differ in at least one of the following aspects: band, carrier, partial bandwidth, physical resource block, subcarrier.

[0162] In some embodiments, the random access preamble has a corresponding random access preamble index; when a cellular system and a de-cellularized system coexist, the random access preamble index includes the random access preamble index of the cellular system and the random access preamble index of the de-cellularized system; the random access preamble index of the cellular system and the random access preamble index of the de-cellularized system are determined based on different root sequences; or, the random access preamble index of the cellular system and the random access preamble index of the de-cellularized system are determined based on different random access preamble indices in the same root sequence.

[0163] In some embodiments, the second node is one of the multiple second nodes included in the de-cellular system; the configuration parameters of the multiple second nodes are different in at least one of the following aspects: uplink initial access part bandwidth, random access time domain resources, and random access frequency domain resources.

[0164] It should be noted that the units in Figures 9 and 10 may also be referred to as modules. For example, the sending unit may be referred to as a sending module. In addition, in the embodiments shown in Figures 9 and 10, the names of the units may not be the names shown in the figures. For example, the sending unit may be referred to as a communication unit, and the receiving unit may be referred to as a communication unit.

[0165] If the various units in Figures 9 and 10 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the various embodiments of the present disclosure. The storage medium for storing computer software products includes various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0166] When the communication device 40 or the communication device 50 implements the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present disclosure provides a structural diagram of a communication device. As shown in Figure 11, the communication device 60 includes: a memory 601, a processor 602, a communication interface 603, and a bus 604.

[0167] The memory 601 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store dynamic information and instructions, an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0168] Processor 602 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure herein. Processor 602 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Processor 602 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure herein. Processor 602 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, or a combination of a DSP and a microprocessor.

[0169] The communication interface 603 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, or wireless local area network (WLAN).

[0170] In some embodiments, the memory 601 may exist independently of the processor 602 and may be connected to the processor 602 via a bus 604 for storing instructions or program codes. When the processor 602 calls and executes the instructions or program codes stored in the memory 601, the random access method provided in the embodiments of the present disclosure can be implemented.

[0171] In some embodiments, the memory 601 may also be integrated with the processor 602 .

[0172] Bus 604 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 604 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG11 shows only one thick solid line, but this does not mean that there is only one bus or only one type of bus.

[0173] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and conciseness of the description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the base station or terminal is divided into different functional modules to complete all or part of the functions described above.

[0174] The present disclosure also provides a computer-readable storage medium. All or part of the processes in the above-mentioned method embodiments can be completed by computer instructions to the relevant hardware. The program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it may include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be the internal storage unit of the first communication node or the second communication node of any of the above-mentioned embodiments, such as the hard disk or memory of the computer device. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned first communication node or the second communication node, such as a plug-in hard disk equipped on the above-mentioned first communication node or the second communication node, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. Further, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned first communication node or the second communication node and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned first communication node or the second communication node. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output. The above-mentioned computer-readable storage medium includes a non-transitory computer-readable storage medium.

[0175] An embodiment of the present disclosure further provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the random access methods provided in the above embodiments.

[0176] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the disclosure for which protection is sought, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple components. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0177] Although the present disclosure has been described with reference to specific features and embodiments thereof, it will be apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely illustrative of the present disclosure as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. Obviously, those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, the present disclosure is intended to encompass such modifications and variations if they fall within the scope of the claims of the present disclosure and their equivalents.

[0178] The above are only specific embodiments of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1. A random access method, applied to a first node, wherein: The method comprises: Sending a plurality of random access preambles to the second node, where the plurality of random access preambles are used to jointly determine a random access preamble corresponding to a random access process; receiving a random access response message sent by the second node.

2. The method according to claim 1, wherein: Each random access preamble corresponds to a random access opportunity.

3. The method according to claim 1, wherein: The i-th random access preamble among the multiple random access preambles is used to indicate the configuration parameters that the i+1-th random access preamble should use, and the configuration parameters include at least one of the following: a root sequence, a candidate sequence index range, time domain resources, and frequency domain resources; i is a positive integer.

4. The method according to claim 1, wherein: The first random access preamble code among the multiple random access preamble codes is used to indicate the type of random access.

5. The method according to claim 1, wherein: The random access response message is carried in a media access control MAC protocol data unit PDU, the MAC PDU includes a first MAC subheader and a second MAC subheader, the first MAC subheader includes a random access preamble identifier RAPID, and the second MAC subheader includes RAPID and MAC RAR.

6. The method according to claim 5, wherein: The bit width of RAPID in the first MAC subheader is related to the number of the multiple random access preamble codes.

7. The method according to claim 1, wherein: At least two random access preambles of the plurality of random access preambles are different in at least one of the following aspects: Value range, physical random access channel format PRACH format, sequence length.

8. The method according to claim 1, wherein: At least two random access preambles of the plurality of random access preambles are identical in at least one of the following aspects: Value range, PRACH format, sequence length.

9. The method according to claim 1, wherein: The random access preamble is sent based on the random access resource; In the case where a cellular system and a de-cellular system coexist, the random access resources include random access resources of the cellular system and random access resources of the de-cellular system; the random access resources of the cellular system and the random access resources of the de-cellular system are different in at least one of the following aspects: band, carrier, partial bandwidth, physical resource block, subcarrier.

10. The method according to claim 1, wherein: The random access preamble has a corresponding random access preamble index; In the case where a cellular system and a de-cellularized system coexist, the random access preamble index includes a random access preamble index of the cellular system and a random access preamble index of the de-cellularized system; The random access preamble index of the cellular system and the random access preamble index of the de-cellular system are determined based on different root sequences; or, The random access preamble index of the cellular system and the random access preamble index of the de-cellular system are determined based on different random access preamble indexes in the same root sequence.

11. A random access method, applied to a second node, wherein: The method comprises: receiving a plurality of random access preambles sent by the first node, where the plurality of random access preambles are used to jointly determine a random access preamble corresponding to a random access process; Send a random access response message to the first node.

12. The method according to claim 11, wherein: Each random access preamble corresponds to a random access opportunity.

13. The method according to claim 11, wherein: The i-th random access preamble among the multiple random access preambles is used to indicate the configuration parameters that the i+1-th random access preamble should use, and the configuration parameters include at least one of the following: a root sequence, a candidate sequence index range, time domain resources, and frequency domain resources; i is a positive integer.

14. The method according to claim 11, wherein: The first random access preamble code among the multiple random access preamble codes is used to indicate the type of random access.

15. The method according to claim 11, wherein: The random access response message is carried in a media access control MAC protocol data unit PDU, the MAC PDU includes a first MAC subheader and a second MAC subheader, the first MAC subheader includes a random access preamble identifier RAPID, and the second MAC subheader includes RAPID and MAC RAR.

16. The method according to claim 15, wherein: The bit width of RAPID in the first MAC subheader is related to the number of the multiple random access preamble codes.

17. The method according to claim 11, wherein: At least two random access preambles of the plurality of random access preambles are different in at least one of the following aspects: Value range, physical random access channel format PRACH format, sequence length.

18. The method according to claim 11, wherein: At least two random access preambles of the plurality of random access preambles are identical in at least one of the following aspects: Value range, PRACH format, sequence length.

19. The method according to claim 11, wherein: The random access preamble is received based on the random access resource; In the case where a cellular system and a de-cellular system coexist, the random access resources include random access resources of the cellular system and random access resources of the de-cellular system; the random access resources of the cellular system and the random access resources of the de-cellular system are different in at least one of the following aspects: band, carrier, partial bandwidth, physical resource block, subcarrier.

20. The method according to claim 11, wherein: The random access preamble has a corresponding random access preamble index; In the case where a cellular system and a de-cellularized system coexist, the random access preamble index includes a random access preamble index of the cellular system and a random access preamble index of the de-cellularized system; The random access preamble index of the cellular system and the random access preamble index of the de-cellular system are determined based on different root sequences; or, The random access preamble index of the cellular system and the random access preamble index of the de-cellular system are determined based on different random access preamble indexes in the same root sequence.

21. The method according to claim 11, wherein: The second node is one of a plurality of second nodes included in the decellularized system; The configuration parameters of the multiple second nodes are different in at least one of the following aspects: uplink initial access part bandwidth, random access time domain resources, and random access frequency domain resources.

22. A communication device, comprising: Processor and memory; in The memory stores instructions executable by the processor; When the processor is configured to execute the instructions, the communication device implements the method according to any one of claims 1 to 21.

23. A computer-readable storage medium, wherein: The computer-readable storage medium comprises computer instructions, which, when executed on a computer, cause the computer to perform the method according to any one of claims 1 to 21.

Images