Random access method and device and storage medium

Abstract

The embodiment of the invention provides a random access method and device and a storage medium, relates to the technical field of communication, and is used for expanding a random access resource. The method is applied to a first node, and comprises the following steps: sending a plurality of random access preambles to a second node, the plurality of random access preambles being 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

Technical Field

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

[0002] A cell-free system is a potential deployment form of future networks, that is, the network always provides a UE-centric service network for user equipment (UE). This eliminates the performance difference between the cell edge and the cell center, and avoids the impact of mobility issues such as handover / cell reselection on user experience. In a cell-free system, a reasonable working assumption is that the UE enters the "cell-free" network mode in the initial access phase, that is, the UE establishes a link between the UE and multiple wireless access points (Access Point, AP) in the cell-free system in the initial access phase. To achieve the goal of completing initial access in the "cell-free" network mode, it is necessary to expand the capacity of random access resources to improve the performance of the UE during the initial access process. Summary of the invention

[0003] Embodiments of the present disclosure provide a random access method, device, and storage medium for expanding random access resources.

[0004] In order to achieve the above objectives, the present disclosure adopts the following technical solutions:

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

[0006] 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;

[0007] A random access response message sent by the second node is received.

[0008] In a second aspect, a random access method is provided. The method is applied to a second node, and the 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] According to a third aspect, a communication device is provided. The device is applied to a first node, and the device includes:

[0012] A sending unit, configured to send a plurality of random access preambles to the second node, wherein 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 a fourth aspect, a communication device is provided, where the device is applied to a second node, and the device includes:

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

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

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

[0018] In a sixth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first aspect or the second aspect.

[0019] In a seventh aspect, a computer program product comprising computer instructions is provided. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first aspect or the second aspect.

[0020] In an embodiment of the present disclosure, a first node sends multiple random access preamble codes to a second node, and the multiple random access preamble codes are used to jointly determine a random access preamble code corresponding to a random access process, thereby expanding the capacity of random access resources and helping to improve the performance of the first node in the initial access process. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0022] Figure 1 A schematic diagram of the composition of a decellularization system provided in an embodiment of the present disclosure;

[0023] Figure 2 A schematic diagram of a random access process of a 5G NR system provided in an embodiment of the present disclosure;

[0024] Figure 3 A schematic diagram of the structure of a communication system provided by an embodiment of the present disclosure;

[0025] Figure 4 A schematic diagram of a random access method provided by an embodiment of the present disclosure;

[0026] Figure 5 A schematic diagram of sending multiple random access preamble codes provided by an embodiment of the present disclosure;

[0027] Figure 6 A schematic diagram of a data structure provided for an embodiment of the present disclosure;

[0028] Figure 7 Another data structure diagram provided for an embodiment of the present disclosure;

[0029] Figure 8 A schematic diagram of a flow chart of another random access method provided by an embodiment of the present disclosure;

[0030] Fig. 9 A schematic diagram of the composition of a communication device provided in an embodiment of the present disclosure;

[0031] Fig.10 A schematic diagram of another communication device provided in an embodiment of the present disclosure;

[0032] Fig.11 A schematic diagram of the structure of a communication device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0033] The following will be combined with the drawings in the embodiments of the present disclosure to clearly and completely describe the technical solutions 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 in the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present disclosure.

[0034] Unless the context requires otherwise, throughout the specification and claims, the term "comprise" and other forms thereof, such as the third person singular form "comprises" and the present participle form "comprising", are to be interpreted as open, 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" and the like are intended to indicate that specific 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 specific features, structures, materials or characteristics may be included in any one or more embodiments or examples in any appropriate manner.

[0035] The terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of the present disclosure, unless otherwise specified, "plurality" means two or more.

[0036] In the embodiments of the present disclosure, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present disclosure should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0037] 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.

[0038] The cell splitting technology in traditional cellular systems is currently considered to be an effective way to increase the capacity of wireless systems. However, with the deployment of various low-power network nodes including microcells, small cells, home base stations and relay nodes in traditional cellular systems, cellular systems are becoming more and more heterogeneous and dense, which will cause serious interference between cells. Frequent switching of UEs during mobility also reduces system capacity and user experience. Moreover, the system capacity interference in traditional cellular systems when cells are densely networked is limited. As the cell radius decreases, the system capacity has an obvious inflection point, which also means that the practice of increasing the system capacity per unit coverage area by splitting cells is getting closer and closer to the upper limit.

[0039] For example, Figure 1 FIG. 1 is a schematic diagram of a decellularization system provided by an embodiment of the present disclosure. Figure 1 The decellularized system includes a plurality of central processing units (CPUs), such as CPU 1 、CPU 2 and CPU 3 , multiple UEs, such as UE 1 ,UE 2 and UE 3 , and multiple APs, such as AP 1 -AP 20 In a decellularized 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. Figure 1 As shown in FIG. 1 , in a decellularized system, each UE in a connected state has a cell centered on the UE itself, and the cell moves with the UE during its movement, which can minimize the impact of inter-cell interference, frequent switching and other issues on the UE. Figure 1 The UE shown in 1 , in UE 1 Nearby APs 1 -AP 6 It can be understood as UE 1 The central area.

[0040] In the decellularized system, one assumption is that the UE works in the decellularized mode only after the radio resource control (RRC) connection has been established. Before that, the UE still needs to establish an RRC connection with a cell in the cellular system in the form of a cellular system, and then switch or migrate from the cellular system to the decellularized system. However, the defect of the solution based on this assumption is that the cellular system and the decellularized system are designed based on two different design concepts. The cellular system is centered on the base station, and the decellularized system is centered on the UE. When the two systems with different design concepts are pieced together, the UE still faces serious inter-cell interference and the need for frequent cell selection / cell reselection when accessing the coexistence system of the cellular system and the decellularized system. Therefore, it is a more reasonable working assumption to enter the "decellularized" network mode in the initial access stage, that is, the UE establishes links with multiple APs in the initial access stage. To achieve the goal of completing initial access in the "decellularized" network mode, there are many problems that need to be solved. One of the problems that needs to be solved is how to expand the capacity of random access resources.

[0041] The reasons why random access resources need to be expanded are as follows: 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 of several or more base stations, but in a decellular system, there is only one main control unit such as CPU 1 、CPU 2 or CPU 3 etc. The random access resources of the 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 the random access occasion (RO), and the code domain resources correspond to the random access preamble (preamble). After the introduction of the decellularized system, since the coverage control area of ​​the CPU is the coverage range of the original multiple base stations, and the design requirement for the sixth generation mobile communication technology (6th generation mobile networks, 6G) is that the connection density per square kilometer is 10 6 ~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.

[0042] 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.

[0043] like Figure 2 As shown, a schematic diagram of a random access process of a 5G NR system provided in an embodiment of the present disclosure is shown. Figure 2 First, the UE sends a random access preamble on the appropriate RO according to the physical random access channel (PRACH) transmission parameters configured by the base station (e.g., next generation base station (generation nodeB, gNB)) and the synchronization signal block (synchronization signal and PBCH block, SSB) selected by the UE, that is, Figure 1 As shown in the message (message, msg) 1, in the process of sending the random access preamble code, 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 (for example, with the highest reference signal received power (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 send the PRACH will be 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 a beam that has a quasi co-located (QCL) relationship with the transmission of this SSB to send subsequent downlink (DL) transmissions, including Figure 2 msg2 and msg4 are shown. Among them, msg2 can also be called random access response (RAR), and msg4 is a downlink channel with a UE contention resolution indicator. It should be noted that Figure 2 The shown msg1-msg4 are messages corresponding to the four-step method in the random access process. For the specific description of msg1-msg4, reference can be made to the description of the four-step method in the random access process in the related art, which will not be repeated here. Figure 2The Best DL Rxbeam in it represents the best downlink receive beam, the Best UL Tx beam represents the best uplink transmit beam, and Beamcorrespondent represents the beam channel.

[0044] The 5G NR system configures the resources of the random access preamble from three aspects. For example, in the time domain, the parameter 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 msg1-FrequencyStart and msg1-Frequency Division Multiplexing (msg1-FDM) are used to configure the available random access opportunities in the frequency domain. 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 (zeroCorrelation 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 is used to determine 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.

[0045] 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.

[0046] The above is an example of a random access process of a 5G NR system. The following will describe the scheme of the embodiment of the present disclosure in conjunction with the accompanying drawings.

[0047] The technical solution 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 (such as coexistence systems in which cellular systems and de-cellular systems coexist), etc., and the embodiments of the present disclosure are not limited to this.

[0048] The network architecture of the mobile communication network (including but not limited to 3G, 4G, 5G and future mobile communication networks) in the embodiments of the present disclosure 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.

[0049] For example, the network side device is a base station and the receiving side device is a terminal. Figure 3 FIG. 1 is a schematic diagram showing a structure of a communication system provided by an embodiment of the present disclosure. Figure 3 As shown, the communication system 10 includes a base station 110 and a terminal 120. The base station 110 and the terminal 120 can be connected for communication.

[0050] In some embodiments, the base station 110 is used to provide wireless access services for multiple terminals 120. Specifically, a base station provides a service coverage area (also called a cell). The terminals 120 entering the area can communicate with the base station 110 through wireless signals to receive the wireless access services provided by the base station 110.

[0051] 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 nodes. According to the size of the service coverage area provided, the base station can be divided into a macro base station for providing macro cells, a micro base station for providing pico cells, and a femto base station for providing femto cells. With the continuous evolution of wireless communication technology, future base stations may also adopt other names.

[0052] In some embodiments, the terminal 120 may be a device with wireless transceiver function, which may be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; it may also be deployed on the water surface (such as a ship, etc.); it may also be deployed in the air (such as an airplane, a balloon, and a satellite, etc.). The terminal may be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver function, 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, 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 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., but the embodiments of the present disclosure are not limited to this.

[0053] It should be understood that Figure 3 is an exemplary structural diagram, Figure 3 The number of devices included in the communication system shown is not limited, for example, the number of base stations and terminals is not limited. Figure 3 In addition to the equipment shown, Figure 3 The communication system shown may also include other devices, which is not limited thereto.

[0054] Next, if Figure 4 As shown, the embodiment of the present disclosure provides a random access method, which is applied to a first node, and the first node may be Figure 3 The terminal 120 shown in FIG. 1 may include the following steps:

[0055] S101. Send multiple random access preamble codes to a second node.

[0056] In some embodiments, when the first node is in a random access process, the first node sends multiple random access preambles to the second node, wherein the multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process, and the second node may be the above Figure 3 A base station 110 is shown in the communication system.

[0057] 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.

[0058] As another example, sending a plurality of random access preamble codes to the second node may be sending a random access preamble (RAP) message to the second node, where the RAP message includes the plurality of random access preamble codes.

[0059] As one possible example, the RAP message may include an index of each random access preamble.

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

[0061] The idle state (RRC_IDLE) of the radio resource control (RRC);

[0062] RRC inactive state (RRC_INACTIVE);

[0063] RRC connection state (RRC_CONNECTED).

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

[0065] It should be understood that the conventional random access signal (PRACH or msg1) is sent based on a random access preamble (or the index of the random access preamble) selected by an RO, and its characteristic is that the first node only sends the random access preamble once in a random access process. The sending of a random access preamble can only randomly select one from a maximum of 64 random access preambles (or random access preamble indexes) for sending, and the optional capacity of the random access preamble does not exceed 64.

[0066] If the random access preamble is sent multiple times, the first node randomly selects a random access preamble on each RO based on 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 of multiple ROs, the first node selects the random access preamble independently and randomly, and the optional capacity of the random access preamble selected twice is increased to 64. 2 , the optional capacity of the four random selection random access preambles increases to 64 4By analogy, sending more random access preamble codes can increase the optional capacity of the random access preamble codes 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.

[0067] For example, Figure 5 FIG. 1 is a schematic diagram of sending multiple random access preamble codes provided by an embodiment of the present disclosure. Figure 5 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 random access preambles 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 .

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

[0069] In some embodiments, a group of multiple random access opportunities (ROs) is called a random access opportunity group (ROgroup). 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 (such as 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 calculate the time and frequency domain resources of the random access opportunity group through other parameters and signaling.

[0070] 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.

[0071] Since the first node selects the random access preamble code independently and randomly at different random access opportunities in the random access opportunity group, when sending multiple random access preamble codes, the first node uses the union 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 the random access preamble code sent by the first node during this random access process is random access preamble code A cascaded with random access preamble code B, or random access preamble code B cascaded with random access preamble code A.

[0072] Exemplarily, when 6 bits are used to represent the random access preamble on a single RO, in the above example, the first node needs to use 12 bits to represent the random access preamble sent completely this time. Similarly, when the number of random access opportunities in the random access opportunity group is 4, 24 bits are needed to represent the random access preamble sent completely this time, and when the number of random access opportunities in the random access opportunity group is 8, 48 bits are needed to represent the random access preamble sent completely this time.

[0073] 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, which is only a possible implementation scheme and does not constitute a limitation on the technical solution of the present disclosure.

[0074] As an example, at least two of 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. As another example, at least two of the multiple random access preambles are the same in at least one of the following aspects: value range, PRACH format, and sequence length.

[0075] The value range includes the root sequence, the candidate random access preamble code set, and the number of candidate random access preamble codes.

[0076] That is to say, for at least two random access preambles among multiple random access preambles, at least two random access preambles may use the same root sequence or different root sequences. 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 at least two random access preambles may be the same or different. At least two random access preambles may use the same PRACH format or different PRACH formats. At least two random access preambles may use the same sequence length or different sequence lengths.

[0077] Exemplarily, taking 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 to send two random access preambles, it can be generally understood that this is a two-stage method for processing the sending of random access preambles, and the sending of two-stage random access preambles corresponds to the sending of random access preambles on the first RO and the second RO respectively. The sending of two-stage random access preambles is not limited to the use of the same root sequence; it is not limited to the selection of two-stage random access preambles from a unified 64 candidate preamble sequences, and the number of candidate random access preambles that can be selected for the sending of two-stage random access preambles can also be different; the sending of two-stage random access preambles is not limited to the use of the same PRACH format; the sending of two-stage random access preambles is not limited to the use of the same sequence length.

[0078] In some embodiments, the i-th random access preamble among multiple random access preambles is used to indicate the configuration parameters that the i+1-th random access preamble should use. The configuration parameters include at least one of the following: a root sequence, a candidate sequence index range, a time domain resource, and a frequency domain resource; 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, the i+1-th random access preamble may indicate the use of at least one of the corresponding root sequence, candidate sequence index range, time domain resource, and frequency domain resource. The candidate sequence index range may refer to a range outside the non-root sequence index range.

[0079] Exemplarily, taking the example of the i-th random access preamble code selecting and using random access preamble code X, the root sequence number to be used by the i+1-th random access preamble code can be calculated according to the agreed function formula Y=F1(X), or the random access preamble code X can specify the candidate sequence index range to be used by the i-th random access preamble code 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 code 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 code can be derived according to the interval segment in which the random access preamble code X falls.

[0080] In some embodiments, the first random access preamble among the multiple random access preambles is used to indicate the type of random access, wherein 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.

[0081] In some embodiments, the last random access preamble of the plurality of random access preambles is used to provide a random access preamble that resolves collisions.

[0082] 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 a random access preamble corresponding to a random access process as shown in the following formula (1):

[0083]

[0084] 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 2, 4, 8, or any power of 2, or any positive integer, 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 considered to be directly cascaded. 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 the available random access preamble to 64. 2 .

[0085] 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 a random access preamble corresponding to a random access process as shown in the following formula (2):

[0086]

[0087] in, Indicates the first random access preamble of four random access preambles, Indicates the second random access preamble of the four random access preambles, Indicates the third random access preamble of the four random access preambles, It represents the fourth random access preamble code among the four random access preamble codes, where m, n, and p are all integers, and the upper limit values ​​of m, n, and p are all 64.

[0088] It should be noted that the above Figure 3 The communication system shown is a decellularized system as an example, and the above embodiment can be implemented in the decellularized system when the second node is unaware of the first node or the second node is not configured with an index. When the second node is configured with an index and the second node is aware of the first node, the above embodiment can still be implemented, and 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 the random access preamble code.

[0089] In some embodiments, the random access preamble is sent based on the random access resource. Figure 3 In the case where the communication system shown is a coexistence system in which 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, bandwidth part (BWP), physical resource block (PRB), and subcarrier.

[0090] In some embodiments, the random access preamble has a corresponding random access preamble index. In the case where the cellular system and the decellularized system coexist, that is, the above Figure 3In the case where the communication system shown is a coexistence system in which a cellular system and a de-cellular system coexist, the random access preamble index includes a random access preamble index of the de-cellular system and a random access preamble index of the de-cellular 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.

[0091] It should be understood that even if de-cellular systems are introduced into mobile communication networks in the future, since the scenarios targeted by de-cellular systems and traditional mobile communication systems are somewhat different, and the migration of network modes requires a certain amount of time, de-cellular 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-cellular systems and cellular systems, and distinguish the random access resources for the de-cellular systems and cellular systems from the perspective of resource multiplexing.

[0092] Therefore, in the frequency domain, the random access resources of the cellular system and the random access resources of 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 of 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 indexes in the same root sequence, that is, a new feature combination is defined for the decellularized system, or an offset is defined between the random access preamble index of the decellularized system and the random access preamble index of the cellular system.

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

[0094] 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 (random access response, RAR) window.

[0095] 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 preamble codes.

[0096] In some embodiments, the starting position of the RAR window is the second symbol, and 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, wherein the target CSS set is the CSS set that the first node is configured to receive for determining Type 1 Type1-PDCCH. That is, the starting position of the RAR window is the first symbol of the earliest CORESET in which the first node is configured to receive the PDCCH for the Type1-PDCCH CSS set.

[0097] 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.

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

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

[0100] It can be seen from the above example that when 6 bits are used to represent the random access preamble on a single RO, when 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 completely this time. Similarly, when the number of random access opportunities in the random access opportunity group is 4, 24 bits are needed to represent the random access preamble sent completely this time, and when the number of random access opportunities in the random access opportunity group is 8, 48 bits are needed to represent the random access preamble sent completely 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.

[0101] Take sending two random access preamble codes to the second node as an example, Figure 7As shown, the bit width of RAPID corresponding to two random access opportunities corresponding to two random access preambles is adjusted from 6 bits to 12 bits.

[0102] Among them, Figure 7 As shown in (a), the MAC subPDU includes three fields:

[0103] 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).

[0104] 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); Figure 7 In the structure shown in (a), T should be set to 0.

[0105] RAPID corresponds to the preamble index (index) carried by the first node in the random access request message. In this way, the first node can determine whether the corresponding RAR is successfully received according to RAPID. For example, if RAPID is the same as the index carried in the random access request message sent by the first node, it is considered that the corresponding RAR is successfully received.

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

[0107] Extension domain (extension, E);

[0108] type domain T;

[0109] Two RAPIDs;

[0110] Two reserved (R) bits;

[0111] based on Figure 4 In the illustrated embodiment, 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 achieving the expansion of random access resources, which helps to improve the performance of the first node in the initial access process.

[0112] In some embodiments, Figure 8As shown, the embodiment of the present disclosure also provides a random access method, which is applied to a second node, and the second node may be the above Figure 3 The base station 110 shown, the method may include the following steps:

[0113] S201. Receive multiple random access preamble codes sent by a first node.

[0114] Among them, multiple random access preambles are used to jointly determine a random access preamble corresponding to a random access process.

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

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

[0117] 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.

[0118] Among them, msg1-FDM refers to the subcarrier spacing used by the terminal when initiating the first message of random access during the random access process. msg1-FDM indicates how many PRACH occasions there are in the frequency domain at the current time point, that is, the starting position of the PRACH channel in the frequency domain.

[0119] As another example, in a de-cellular system, when multiple second nodes are configured with indexes and the multiple second nodes are known to the terminal, 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.

[0120] It should be understood that different uplink initial access partial 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 achieving expansion of random access resources in the frequency domain.

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

[0122] In some embodiments, after receiving multiple random access preamble codes 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.

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

[0124] In some embodiments, the random access response RAR window used by the first node to receive the random access response message is located after the first symbol, where 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. For the specific description of the random access response message, reference may be made to the corresponding description of the random access response message in the above step S102, which will not be repeated here.

[0125] The above embodiments respectively expand the random resources in the code domain, time domain, and frequency domain to improve the performance of the terminal during the initial access process. In some embodiments, in the 17th version (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 comprises the following steps.

[0126] S301. The second node sends configuration information to the first node; correspondingly, the first node receives the configuration information sent by the second node.

[0127] In some embodiments, when the msg3 PUSCH repetition function introduces a new function, the second node generates configuration information and then sends the configuration information to multiple first nodes. Correspondingly, the first node receives the configuration information sent by the second node. The first node may be one of the multiple first nodes. The new function may be a PRACH repetition function.

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

[0129] For example, the first repetition list is {1, 2, 3, 4, 7, 8, 12, 16}, and the second repetition list is {1, 2, 3, 4, 8, 12, 16, 32}. As can be seen from the above example, the maximum number of repetitions in the first repetition list is 16, and the maximum number of repetitions in the second repetition list is 32. The maximum number of repetitions in the first repetition list is 16, which is less than the maximum number of repetitions in the second repetition list. The first repetition list can be understood as the old repetition list, and the second repetition list can be understood as the new repetition list.

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

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

[0132] In some embodiments, when the first node determines based on its own capability information that the capabilities it supports match the capabilities corresponding to the second repetition list, the first node stores the second repetition list. When 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 list, that is, when the first node does not support the capabilities corresponding to the second repetition list, the first node does not store the second repetition list, and the first node may store the first repetition list.

[0133] 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 can determine whether to store the second repetition list based on its own capability information.

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

[0135] The above mainly introduces the solution provided by the present disclosure from the perspective of interaction between various nodes. 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. It should be easily appreciated by those skilled in the art that the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software in combination with the algorithm steps of each example described in the embodiments disclosed herein. Whether a function is executed in the form of hardware or computer software driving hardware 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.

[0136] Fig. 9 FIG. 1 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. Fig. 9 As shown, the communication device 40 includes a sending unit 401 and a receiving unit 402 .

[0137] 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 specifically used to implement the following functions.

[0138] The sending unit 401 is 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.

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

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

[0141] 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 by 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.

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

[0143] In some embodiments, the receiving unit 402 is specifically used to receive a random access response message sent by the second node based on a 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.

[0144] 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.

[0145] 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.

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

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

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

[0149] In some embodiments, the random access preamble is sent based on random access resources; when 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.

[0150] In some embodiments, the random access preamble has a corresponding random access preamble index; when a cellular system and a de-cellular 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-cellular 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.

[0151] Fig.10 FIG. 2 is a schematic diagram showing the composition of another communication device provided by an embodiment of the present disclosure. Fig.10 As shown, the communication device 50 includes a receiving unit 501 and a sending unit 502 .

[0152] 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 specifically used to implement the following functions.

[0153] 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.

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

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

[0156] 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 by 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.

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

[0158] In some embodiments, the 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 preamble codes.

[0159] 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.

[0160] 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.

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

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

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

[0164] In some embodiments, the random access preamble is received based on random access resources; when 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.

[0165] In some embodiments, the random access preamble has a corresponding random access preamble index; when a cellular system and a de-cellular 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-cellular 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.

[0166] In some embodiments, the second node is one of 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.

[0167] It should be noted that Fig. 9 and Fig.10 The units in the system may also be referred to as modules, for example, the sending unit may be referred to as a sending module. Fig. 9 and Fig.10 In the illustrated embodiment, the names of the various units may not be the names shown in the figure. For example, the sending unit may be called a communication unit, and the receiving unit may be called a communication unit.

[0168] Fig. 9 and Fig.10 If each unit in the embodiment is implemented in the form of a software function module and sold or used as an independent product, it 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. 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 methods of each embodiment of the present disclosure. The storage medium for storing computer software products includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.

[0169] When the communication device 40 or the communication device 50 implements the functions of the integrated modules in the form of hardware, the embodiment of the present disclosure provides a schematic diagram of the structure of the communication device. Fig.11 As shown, the communication device 60 includes: a processor 602 , a communication interface 603 , and a bus 604 . Optionally, the communication device 60 may further include a memory 601 .

[0170] The processor 602 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present disclosure. The 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 devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present disclosure. The processor 602 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

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

[0172] The memory 601 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or 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 codes in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0173] As a possible implementation, the memory 601 may exist independently of the processor 602, and the memory 601 may be connected to the processor 602 via a bus 604 to store 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 embodiment of the present disclosure can be implemented.

[0174] In another possible implementation, the memory 601 may also be integrated with the processor 602 .

[0175] The bus 604 may be an extended industry standard architecture (EISA) bus, etc. The bus 604 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.11 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0176] 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.

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

[0178] The embodiments of the present disclosure also provide 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.

[0179] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the present disclosure claimed for protection, 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.

[0180] "A" or "an" does not exclude a plurality of cases. 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.

[0181] Although the present disclosure has been described in conjunction with specific features and embodiments thereof, it is 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 exemplary illustrations of the present disclosure as defined by the appended claims, and are deemed to have covered 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, if these modifications and variations of the present disclosure fall within the scope of the claims of the present disclosure and their equivalents, the present disclosure is also intended to include these modifications and variations.

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

Claims

1. A random access method, characterized in that: Applied to the first node, 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, characterized in that Each of the random access preamble codes corresponds to a random access opportunity.

3. The method according to claim 1, characterized in that 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, characterized in that: 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, characterized in that 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.

6. The method according to claim 5, characterized in that 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, characterized in that At least two random access preambles among 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, characterized in that 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, characterized in that: 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, characterized in that 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, characterized in that: Applied to the second node, 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, characterized in that Each of the random access preamble codes corresponds to a random access opportunity.

13. The method according to claim 11, characterized in that 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, characterized in that 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, characterized in that 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.

16. The method according to claim 15, characterized in that 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, characterized in that At least two random access preambles among 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that 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, characterized in that: include: Processor and memory; 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, characterized in that: 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