Communication method and apparatus

Abstract

A communication method and apparatus. The method comprises: a terminal device determining a first physical root sequence on the basis of a first logical root sequence number and a mapping relationship between logical root sequence numbers and physical root sequence numbers, and sending a first sequence; and a network device determining a first physical root sequence on the basis of the first logical root sequence number and the mapping relationship between the logical root sequence numbers and the physical root sequence numbers, and receiving the first sequence on the basis of the first logical root sequence number, wherein the first sequence is determined on the basis of the first physical root sequence and belongs to a first physical root sequence set, and the first physical root sequence set corresponds to the same cubic metric interval, the same maximum round-trip delay interval and the same maximum Doppler frequency shift interval. Even if the terminal device moves at a high speed, no hopping occurs in available sequences in the first physical root sequence set. Compared with a situation in which one physical root sequence set corresponds to a plurality of maximum Doppler frequency shift intervals, the present application can improve the sequence utilization rate.

Description

A communication method and apparatus Technical Field

[0001] This application relates to the field of communication technology, specifically to a communication method and apparatus. Background Technology

[0002] In systems such as Long Term Evolution (LTE) and New Radio (NR), reference signals and random access preambles are generated based on root sequences. Sequence numbers from multiple root sequences are divided into multiple root sequence number sets, and different root sequence number sets can be assigned to different cells. Currently, the same root sequence number set supports multiple different maximum mobile speeds, resulting in low sequence resource utilization.

[0003] Summary of the Invention

[0004] This application provides a communication method and apparatus for improving the utilization rate of sequence resources.

[0005] To achieve the above objectives, the embodiments of this application adopt the following technical solutions:

[0006] In a first aspect, embodiments of this application provide a communication method that can be executed by a first communication device. The first communication device can be a terminal device, or it can be a component used to implement the functions of the terminal device. For example, the first communication device can be a unit / module, circuit, or chip within the terminal device. The method provided in the first aspect will be described below using the terminal device itself as an example.

[0007] The communication method includes: a terminal device determining a first physical root sequence based on a first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number, and sending the first sequence. The first sequence is determined based on the first physical root sequence, the first physical root sequence belongs to a set of first physical root sequences, and the root sequences within the set of first physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval.

[0008] Accordingly, in a second aspect, embodiments of this application provide a communication method that can be executed by a second communication device. The second communication device can be a network device, or it can be a component used to implement the functions of a network device. For example, the second communication device can be a unit / module, circuit, or chip within the network device. The method provided in the second aspect will be described below using the network device itself as an example.

[0009] The communication method includes: a network device receiving a first sequence, and determining the first sequence based on the mapping relationship between logical root sequence numbers and physical root sequence numbers, and the first logical root sequence number. The first logical root sequence number indicates a first physical root sequence, and the first sequence is determined based on the first physical root sequence. The first physical root sequence belongs to a set of first physical root sequences, and root sequences within the set of first physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval.

[0010] In the methods provided in the first and second aspects, the root sequences within the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval. Since the root sequences within the first physical root sequence set correspond to the same maximum Doppler frequency shift interval, even if the terminal device moves at high speed, the sequences available to the terminal device within the first physical root sequence set will not change. In other words, all physical root sequences within the first physical root sequence set are available to the terminal device. It is understandable that if the root sequences within a physical root sequence set correspond to multiple maximum Doppler frequency shift intervals, when the terminal device moves at high speed, it is inevitable that there will be root sequences within that physical root sequence set that are unusable by the terminal device. Therefore, in this embodiment, the root sequences within the first physical root sequence set correspond to the same maximum Doppler frequency shift interval, which can improve sequence utilization.

[0011] Thirdly, embodiments of this application provide a communication method that can be executed by a communication device. This communication device can be a terminal device or a component for implementing the functions of a terminal device. For example, the communication device can be a unit / module, circuit, or chip within the terminal device. Alternatively, the communication device can also be a network device or a component for implementing the functions of a network device. For example, the communication device can be a unit / module, circuit, or chip within a network device.

[0012] The communication method includes: the communication device sorting all physical root sequence numbers, assigning logical root sequence numbers to each sorted physical root sequence number, and obtaining the mapping relationship between logical root sequence numbers and physical root sequence numbers. Specifically, multiple consecutive physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively. The logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

[0013] The third aspect essentially provides a mapping method from logical root sequence numbers to physical root sequence numbers. Based on this mapping method, multiple consecutive physical root sequence numbers can correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively. The method provided in the third aspect can improve sequence utilization, and is particularly suitable for high-speed mobile scenarios.

[0014] In one implementation of the first aspect, the method further includes: the terminal device sorting all physical root sequence numbers, assigning logical root sequence numbers to each sorted physical root sequence number, and obtaining a mapping relationship between logical root sequence numbers and physical root sequence numbers. Wherein, multiple consecutive physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively. The logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

[0015] The terminal device can obtain the mapping relationship between logical root sequence numbers and physical root sequence numbers through the mapping method to physical root sequence numbers provided by the third party, and thus determine the physical root sequence to be used to send the first sequence based on the mapping relationship. Based on this mapping method, all physical root sequences in each physical root sequence set can be used by the terminal device, resulting in high sequence utilization. In one implementation, this mapping relationship is (pre)configured.

[0016] In one implementation of the second aspect, the method further includes: the network device sorting all physical root sequence numbers, assigning logical root sequence numbers to each sorted physical root sequence number, and obtaining the mapping relationship between logical root sequence numbers and physical root sequence numbers. Wherein, multiple consecutive physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval, respectively. The logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

[0017] The network device obtains the mapping relationship between the logical root sequence number and the physical root sequence number according to the mapping method from logical root sequence number to physical root sequence number provided by the third party, and then determines the first sequence received from the terminal device based on the mapping relationship. In one implementation, the mapping relationship is (pre)configured.

[0018] In one implementation of the third aspect, the communication device is a terminal device, and the method further includes: the terminal device determining a first physical root sequence number based on the first logical root sequence number of the cell and the mapping relationship, the first physical root sequence number indicating a first physical root sequence; and sending a first sequence, the first sequence being generated based on the first physical root sequence.

[0019] Accordingly, in one implementation of the third aspect, the communication device is a network device, and the method further includes: the network device determining a first physical root sequence number based on the first logical root sequence number of the cell and the mapping relationship, the first physical root sequence number indicating a first physical root sequence; and receiving a first sequence based on the first physical root sequence number, the first sequence being generated based on the first physical root sequence.

[0020] In one implementation of the first or third aspect, the communication device is a terminal device, and the method further includes: the terminal device receiving indication information, the indication information indicating a first logical root sequence number, the first logical root sequence number being used to indicate the sequence number of a first physical root sequence.

[0021] Accordingly, in one implementation of the second or third aspect, the communication device is a network device, and the method further includes: the network device sending indication information indicating a first logical root sequence number, the first logical root sequence number being used to indicate the sequence number of a first physical root sequence.

[0022] The network device can send the first logical root sequence number to the terminal device so that the terminal device and the network device are aligned on the first logical root sequence number, thereby enabling the network device to correctly parse the first sequence received from the terminal device.

[0023] In any implementation of any of the first to third aspects, all physical root sequence numbers are divided into multiple sets of physical root sequence numbers, which are obtained according to the following partitioning rules:

[0024] The physical root sequence numbers are divided into a low cubic metric group and a high cubic metric group, with the first cubic metric as the boundary. In the low cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers does not exceed the first cubic metric, and in the high cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers exceeds the first cubic metric.

[0025] For the low cubic metric group and the high cubic metric group, all physical root sequence numbers within the group are divided into multiple physical root sequence number sets by using the maximum round-trip time delay and the maximum Doppler frequency shift as boundaries.

[0026] The physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order.

[0027] In any implementation of any of the first to third aspects, the physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order, including: first sorting the physical root sequence number sets in the low cubic metric group, and then sorting the physical root sequence number sets in the high cubic metric group; wherein, for the low cubic metric group, starting from the last physical root sequence number set, they are arranged alternately in ascending and descending cubic metric order, with the cubic metric of the last physical root sequence number set arranged in ascending order; for the high cubic metric group, starting from the first physical root sequence number set, they are arranged alternately in ascending and descending cubic metric order, with the cubic metric of the first physical root sequence number set arranged in ascending order.

[0028] This scheme provides a way to divide and sort all physical root sequence numbers so that all physical root sequence numbers in each set of physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval. As a result, within a certain cell radius and a certain moving speed, the mutual interference between any two sequences that the terminal device can use is small, and the sequence utilization rate is high.

[0029] In any implementation of the first to third aspects, the method further includes: determining candidate peak points of the fuzzy function of the physical root sequence corresponding to each physical root sequence number. Wherein, in the time-delay Doppler coordinate system, the candidate peak points satisfy: the time delay distance between the candidate peak point and the origin in the time-delay Doppler coordinate system is not greater than the time delay distance between any other peak point and the origin (excluding the origin); and / or, the Doppler distance between the candidate peak point and the origin in the time-delay Doppler coordinate system is not greater than the Doppler distance between any other peak point and the origin (excluding the origin). The horizontal axis in the time-delay Doppler coordinate system indicates the time delay domain, and the vertical axis in the time-delay Doppler coordinate system indicates the Doppler domain.

[0030] In this scheme, for the ambiguity function of the root sequence, among all peak points within a given region, if the time delay distance between a certain peak point and the origin is not greater than the time delay distance between any other peak point and the origin in the time-delay Doppler coordinate system (excluding the origin), and / or, the Doppler distance between a certain peak point and the origin is not greater than the Doppler distance between any other peak point and the origin in the time-delay Doppler coordinate system (excluding the origin), then this peak point is determined as a candidate peak point, and the final peak point corresponding to the root sequence is determined from the candidate peak points. This scheme ensures that the root sequence corresponding to the finally selected peak point corresponds to a larger maximum round-trip time delay interval and / or a larger maximum Doppler frequency shift interval, thus maximizing the maximum cell radius and / or maximum moving speed supported by the root sequence corresponding to the finally selected peak point.

[0031] In any implementation of any of the first to third aspects, the set of candidate peak point coordinates of the fuzzy function satisfy:

[0032] Where N represents the sequence length of the first physical root sequence, u represents the sequence number of the first physical root, and τ i This represents the set of coordinates of candidate peak points of the fuzzy function. The time delay coordinate of the i-th candidate peak point in the data, v i This represents the set of coordinates of candidate peak points of the fuzzy function. The Doppler coordinates of the i-th candidate peak point in the data. The operator |·| represents the cardinality of a set. In ±uτ mod N, the sign operation is performed first, followed by the modulo operation; in ±un mod N, the sign operation is performed first, followed by the modulo operation.

[0033] In any implementation of the first to third aspects, the method further includes: based on the set The coordinates of the i-th candidate peak point are <τ i ,v i > Determine the set of candidate physical root sequence numbers for the i-th digit. Based on each candidate physical root sequence number set, determine the physical root sequence number set corresponding to the physical root sequence number [Δ]. T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ), where k∈{0,1,…K-1}, l∈{0,1,…L-1}. The corresponding maximum round-trip delay interval and the maximum Doppler frequency shift interval satisfy:

[0034] [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 (,+∞) represents the K maximum round-trip time intervals preset in the physical root sequence number set, [Δ F,0 ,Δ F,1 ),[Δ F,1 ,Δ F,2 ),…,[Δ F,L-1 (, +∞) represents the L maximum Doppler frequency shift intervals preset in the physical root sequence number set, 0 ≤ k i ≤K-1, 0≤l i ≤L-1,

[0035] This scheme maps candidate peak points onto a two-dimensional plane containing the time-delay Doppler coordinate system, and sorts the mapped candidate peak points to obtain [Δ T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ).

[0036] In any implementation of any of the first to third aspects, each physical root sequence number can be mapped to the corresponding set of physical root sequence numbers according to specific rules [Δ]. T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 This ensures that all root sequences in any set of physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval. A specific rule can also be understood as a rule that maps a physical root sequence to a particular set of physical root sequences. Specific rules include, but are not limited to, the following first through fourth rules.

[0037] First rule:

[0038] When the number of maximum round-trip time intervals K and the number of maximum Doppler frequency shift intervals L are equal, the arrangement order of multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; where, when max{k,l} is the same and even, k is sorted in ascending order, and for any k, l is sorted in descending order; or, when max{k,l} is the same and odd, l is sorted in ascending order, and for any l, k is sorted in descending order.

[0039] The first rule, which is to map each physical root sequence number to the corresponding physical root sequence number set by synchronously / alternatingly increasing the maximum round-trip time delay and the maximum Doppler frequency shift, and initially increasing the maximum round-trip time delay.

[0040] Under the first rule, the set of physical root sequence numbers is determined based on the sets of candidate physical root sequence numbers, including: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i If the numbers are the same and even, then l i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k iThe largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i If the numbers are the same and odd, then k i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers.

[0041] Second rule:

[0042] When the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the arrangement order of the multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; wherein, when max{k,l} is the same and even, l is sorted in ascending order, and for any l, k is sorted in descending order; or, when max{k,l} is the same and odd, k is sorted in ascending order, and for any k, l is sorted in descending order.

[0043] The second rule, which is to map each physical root sequence number to the corresponding physical root sequence number set by synchronously / alternatingly increasing the maximum round-trip time delay and the maximum Doppler frequency shift, and initially increasing the maximum Doppler frequency shift.

[0044] Under the second rule, the physical root sequence number set is determined based on each candidate physical root sequence number set, including: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where,

[0045] When the max{k} of multiple candidate physical root sequence number sets i ,l i If the numbers are the same and even, then k... i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers; or,

[0046] When the max{k} of multiple candidate physical root sequence number sets i ,l i If the numbers are the same and odd, then l i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers.

[0047] Third rule:

[0048] The arrangement order of multiple physical root sequence number sets satisfies the following: K×L physical root sequence number sets are sorted in ascending order of k; where, when k is the same and even, l is sorted in ascending order; or, when k is the same and odd, l is sorted in descending order.

[0049] The third rule, which maps each physical root sequence number to its corresponding physical root sequence number set with a monotonically increasing maximum round-trip delay, is as compatible as possible with the sorting rules of existing protocols. This makes it relatively simple to implement and reduces processing complexity.

[0050] Under the third rule, the set of physical root sequence numbers is determined based on the sets of candidate physical root sequence numbers, including: from Select k from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when k of multiple candidate physical root sequence number sets... i If the numbers are the same and even, then l i The largest i is determined to be the set of physical root sequence numbers; or, when k of multiple candidate physical root sequence number sets... i If the numbers are the same and odd, then l i The smallest i is determined as the set of physical root sequence numbers.

[0051] Fourth rule:

[0052] The arrangement order of multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order of l; where, when l is the same and even, k is sorted in ascending order; or, when l is the same and odd, k is sorted in descending order.

[0053] The fourth rule, which maps each physical root sequence number to its corresponding physical root sequence number set using the rule of monotonically increasing maximum Doppler frequency shift, is relatively simple to implement and reduces processing complexity.

[0054] Under the fourth rule, the set of physical root sequence numbers is determined based on the sets of candidate physical root sequence numbers, including: from Select l from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when the l of multiple candidate physical root sequence number sets... i If the numbers are the same and even, then k i The largest i is determined to be the set of physical root sequence numbers; or, when the l of multiple candidate physical root sequence number sets is... i If the numbers are the same and odd, then k i The smallest i is determined as the set of physical root sequence numbers.

[0055] Any one of the first to fourth rules described above can ensure that all root sequences in any set of physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively. This application does not limit the choice of which rule to use.

[0056] Fourthly, embodiments of this application provide a communication device that has the functionality to implement the behaviors described in the method examples of the first to third aspects. The beneficial effects can be found in the relevant descriptions of the first to third aspects and will not be repeated here. For example, the communication device can be a terminal device or a network device as described in the first to third aspects. Alternatively, the communication device can be an apparatus capable of supporting the terminal device in implementing the functions required by the methods provided in the first to third aspects. For example, the communication device can be a chip or chip system in a terminal device, or it can be a chip or chip system in a network device.

[0057] In one possible design, the communication device includes a baseband device and a radio frequency device.

[0058] In one possible design, the communication device includes corresponding means or modules (e.g., chips, chip systems, or circuits) for performing the methods of any of the first to third aspects. For example, the communication device includes a processing unit (sometimes also called a processing module or processor) and / or a transceiver unit (sometimes also called a transceiver module or transceiver). The transceiver unit is capable of both transmitting and receiving functions. When the transceiver unit performs the transmitting function, it may be called a transmitting unit (sometimes also called a transmitting module), and when it performs the receiving function, it may be called a receiving unit (sometimes also called a receiving module). The transmitting unit and the receiving unit may be the same functional unit, referred to as the transceiver unit, which performs both transmitting and receiving functions; or, the transmitting unit and the receiving unit may be different functional units, with "transceiver unit" being a collective term for these functional units. These units (modules) can perform the corresponding functions in the method examples of any of the first to third aspects described above, as detailed in the method examples, and will not be repeated here.

[0059] Fifthly, embodiments of this application provide a communication device, which can be the communication device described in the fourth aspect of the above embodiments, or a chip or chip system disposed in the communication device described in the fourth aspect. The communication device includes a communication interface and a processor, and optionally, a memory. The memory is used to store computer programs, instructions, or data, and the processor is coupled to the memory and the communication interface. When the processor reads the computer program, instructions, or data, it causes the communication device to execute the method executed by the terminal device in the above method embodiments. For example, the communication device can be a terminal device or a functional module within a terminal device, such as a baseband chip and a radio frequency chip. Alternatively, when the processor reads the computer program, instructions, or data, it causes the communication device to execute the method executed by the network device in the above method embodiments. For example, the communication device can be a network device or a functional module within a network device, such as a baseband chip and a radio frequency chip.

[0060] Sixthly, embodiments of this application provide a chip system including a processor and a communication interface for implementing the methods described in any of the first to third aspects. Optionally, the chip system further includes a memory. The memory stores a computer program (also referred to as code or instructions). The processor calls and runs the computer program from the memory, causing a device with the chip system installed to perform the methods of the first aspect and any possible implementation thereof, or to perform the methods of the second aspect and any possible implementation thereof, or to perform the methods of the third aspect and any possible implementation thereof. The chip system may be composed of chips or may include chips and other discrete devices.

[0061] In a seventh aspect, embodiments of this application provide a communication device including an input / output interface and logic circuitry. The input / output interface is used for inputting and / or outputting information. The input / output interface may be an interface circuit, an output circuit, an input circuit, a pin, or related circuitry, etc. The logic circuitry is used to execute the methods described in any of the first to third aspects.

[0062] In practical implementation, the aforementioned communication device can be a chip, the input circuit can be an input pin, the output circuit can be an output pin, and the logic circuit can be a transistor, gate circuit, flip-flop, and various other logic circuits. The input signal received by the input circuit can be received and input by, for example, but not limited to, a receiver, and the signal output by the output circuit can be, for example, but not limited to, output to and transmitted by a transmitter. Furthermore, the input circuit and the output circuit can be the same circuit, which is used as both the input circuit and the output circuit at different times. This application does not limit the specific implementation of the input / output interface and the logic circuit.

[0063] In one implementation, when the communication device is a wireless communication device, the wireless communication device can be a terminal device such as a mobile phone. The interface circuit can be a radio frequency processing chip in the wireless communication device, and the processing circuit can be a baseband processing chip in the wireless communication device.

[0064] Eighthly, embodiments of this application provide a communication system comprising a terminal device and a network device, wherein the terminal device is used to implement the function of the method described in the first aspect, and the network device is used to implement the function of the method described in the second aspect. Alternatively, the terminal device is used to implement the function of the method described in the third aspect, and the network device is used to implement the function of the method described in the third aspect.

[0065] Ninthly, embodiments of this application provide a computer-readable storage medium for storing a computer program or instructions that, when executed, enable the implementation of the methods described in the first aspect and any of its possible implementations, or enable the implementation of the methods described in the second aspect and any of its possible implementations, or enable the implementation of the methods described in the third aspect and any of its possible implementations.

[0066] In a tenth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, cause the method described in the first aspect and any of its possible implementations to be implemented, or cause the method described in the second aspect and any of its possible implementations to be implemented, or cause the method described in the third aspect and any of its possible implementations to be implemented.

[0067] The beneficial effects of the fourth to tenth aspects and their implementation methods can be referred to the description of the beneficial effects of the first to third aspects and any possible implementation methods. Attached Figure Description

[0068] Figure 1 is a schematic diagram of the architecture of the communication system provided in an embodiment of this application;

[0069] Figure 2 is a schematic diagram of a ZC root sequence mapped to a time-delay Doppler coordinate system provided in an embodiment of this application;

[0070] Figure 3 is a schematic diagram of mapping the first rule ZC root sequence to the time-delay Doppler coordinate system provided in an embodiment of this application;

[0071] Figure 4 is a schematic diagram of mapping the second rule ZC root sequence to the time-delay Doppler coordinate system provided in an embodiment of this application;

[0072] Figure 5 is a schematic diagram of mapping the third rule ZC root sequence to the time-delay Doppler coordinate system provided in an embodiment of this application;

[0073] Figure 6 is a schematic diagram of mapping the fourth rule ZC root sequence to the time-delay Doppler coordinate system provided in an embodiment of this application;

[0074] Figure 7 is a flowchart illustrating the communication method 700 provided in an embodiment of this application;

[0075] Figure 8 is a schematic diagram of a communication device provided in an embodiment of this application;

[0076] Figure 9 is a schematic diagram of another structure of the communication device provided in an embodiment of this application. Detailed Implementation

[0077] In the communication method provided in this application embodiment, the physical root sequences within an arbitrary set of physical root sequences assigned to a cell support the same maximum moving speed / maximum Doppler frequency shift interval, which can improve the utilization rate of the sequences. The solution provided in this application embodiment will be further described below with reference to the accompanying drawings.

[0078] The technical solutions provided in the embodiments of this application can be applied to various wireless communication systems. For example, the methods provided in the embodiments of this application can be applied to communication systems related to the 3rd Generation Partnership Project (3GPP), such as LTE communication systems, 5th generation (5G) mobile communication systems, or they can also be applied to other next-generation mobile communication systems, such as 6th generation (6G) communication systems, or other similar communication systems. Other similar communication systems may include wireless fidelity (WIFI), vehicle-to-everything (V2X), internet of things (IoT) systems, narrowband internet of things (NB-IoT) systems, and so on.

[0079] Please refer to Figure 1, which illustrates a communication system applicable to an embodiment of this application. The communication system includes a wireless access network 100 and a core network 200. Optionally, the communication system may also include an Internet 300.

[0080] The wireless access network 100 may include at least one network device and at least one terminal device. For example, the wireless access network 100 includes two network devices, 110a and 110b, and terminal devices 120a to 120j. The network architecture shown in Figure 1 is only schematic; the number of terminal devices and / or network devices may be fewer or more. The communication system described in the embodiments of this application is for the purpose of more clearly illustrating the technical solutions of the embodiments of this application and does not constitute a limitation on the communication system to which the embodiments of this application are applicable. For example, the communication system may also include other devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Figure 1. As those skilled in the art will know, with the evolution of network architecture, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems. When applying the technical solutions of the embodiments of this application to other communication systems, the devices, components, modules, etc. in the embodiments can be replaced with corresponding devices, components, modules in other communication systems without limitation.

[0081] The network devices involved in the embodiments of this application are mainly access network devices. Therefore, unless otherwise specified, the term "network device" in the following text refers to radio access network (RAN) devices, which can be simply referred to as access network devices. RAN can be a 3GPP-related cellular system, such as a 5G mobile communication system, or a future-oriented evolution system (such as a 6G mobile communication system). RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a virtualized RAN (vRAN), etc. RAN can also be a communication system that integrates two or more of the above systems. RAN devices can also be called RAN nodes, RAN entities, or access nodes, etc.

[0082] In one possible scenario, a RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a next-generation base station in a 6G mobile communication system, or a base station in a future mobile communication system. A RAN node can also be a macro base station, a micro base station, an indoor station, a relay node, a donor / host node, or a radio controller. RAN nodes can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, in V2X technology, a RAN node can be a roadside unit (RSU).

[0083] In another possible scenario, a RAN node can be a module or unit that performs some of the functions of a base station; or multiple RAN nodes can collaborate to assist terminal devices in achieving wireless access, with different RAN nodes performing some of the functions of the base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The functions of a CU can be implemented by a single entity or by different entities. For example, the functions of a CU can be further divided, separating the control plane and the user plane and implementing them through different entities, namely the control plane CU entity (i.e., CU-control plane (CP) entity) and the user plane CU entity (i.e., CU-user plane (UP) entity). This CU-CP entity and CU-UP entity can be coupled with a DU to jointly complete the functions of the RAN node. The CU and DU can be set up separately or included in the same network element, such as in a baseband unit (BBU).

[0084] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0085] The CU and DU can be configured according to the protocol layer functions of the wireless network they implement. For example, the CU can be configured to implement the functions of the Packet Data Convergence Protocol (PDCP) layer and above (e.g., the Radio Resource Control (RRC) layer and / or the Service Data Adaptation Protocol (SDAP) layer); the DU can be configured to implement the functions of protocol layers below the PDCP layer (e.g., the Radio Link Control (RLC) layer, the MAC layer, and / or the Physical (PHY) layer). Alternatively, the CU can be configured to implement the functions of protocol layers above the PDCP layer (e.g., the RRC layer and / or the SDAP layer), and the DU can be configured to implement the functions of protocol layers below the PDCP layer (e.g., the RLC layer, the MAC layer, and / or the PHY layer). For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications or the technical specifications of other applicable communication protocols. The above division of the processing functions of CU and DU according to protocol layers is merely an example; other division methods are also possible, and this application does not limit this. For example, in one design, CU or DU can be further divided into processing functions with protocol layers. In one design, some functions of the RLC layer and the functions of the protocol layer above the RLC layer are located in the CU, while the remaining functions of the RLC layer and the functions of the protocol layer below the RLC layer are located in the DU.

[0086] In the embodiments of this application, the means for implementing the functions of the network device can be the network device itself, or it can be a means that supports the network device in implementing the functions, such as a chip system or a combination of devices or components that can implement the functions of the network device. This means can be installed in the network device. The embodiments of this application do not limit the specific technology or specific device form used in the network device.

[0087] In this application embodiment, any device capable of data communication with a base station can be considered a terminal device. Terminal devices are also called terminals, user equipment (UE), mobile stations, or mobile terminals. Terminal devices can be widely used in various scenarios, such as D2D communication, V2X communication, machine-type communication (MTC), IoT, virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, or smart cities. For example, terminal devices can be: mobile phones, computers, mobile internet devices (MID), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, robotic arms, cameras, robots, or smart home devices (such as televisions, air conditioners, robot vacuums, speakers, set-top boxes), relays, customer premises equipment (CPE), etc.

[0088] The various terminal devices described above, if located on a vehicle (e.g., placed / installed inside the vehicle), can all be considered in-vehicle terminal devices. In-vehicle terminal devices can be built into a vehicle's in-vehicle module, in-vehicle component, in-vehicle chip, or in-vehicle unit as one or more components or units. The vehicle can implement the methods of this application through the built-in in-vehicle module, in-vehicle component, in-vehicle chip, or in-vehicle unit. In-vehicle terminal devices can be vehicle equipment, in-vehicle modules, vehicles, on-board units (OBU), roadside units (RSU), in-vehicle systems (or in-vehicle transmitting units) (telematics boxes, T-boxes), chips, or systems on chips (SOCs), etc. These chips or SOCs can be installed in the vehicle, OBU, RSU, or T-box.

[0089] In the embodiments of this application, the device for implementing the functions of the terminal device can be the terminal device itself, or a device capable of supporting the terminal device in implementing the functions, such as a chip system or a combination of devices or components capable of implementing the functions of the terminal device. This device can be installed in the terminal device. The embodiments of this application do not limit the specific technology or specific device form used in the terminal device.

[0090] Terminal equipment can also be referred to as a terminal, terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiments of this application do not limit the specific technologies or device forms used in the terminals.

[0091] In this embodiment, the roles of network devices and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device, and 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol. In this case, relative to 110a, 120i is also a network device. Therefore, in this embodiment, network devices and terminal devices can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be referred to as communication devices with network device functions, and 120a-120j in Figure 1 can also be referred to as communication devices with terminal functions.

[0092] The reference signals (e.g., demodulation reference signal (DMRS) and sounding reference signal (SRS) or random access preamble sequences) sent by terminal devices to network devices can be generated from a root sequence. The root sequence can be a (Zadoff-Chu, ZC) root sequence or other possible sequences. For ease of understanding, some relevant information about the root sequence will be introduced first. In the following description, we will use a ZC sequence as an example.

[0093] The zero-correlation region can be constructed using different cyclic shifts (CS) of the root sequence. The zero-correlation region refers to the region where, in the absence of Doppler shift, the correlation function is equal to zero within the maximum round-trip time delay interval. In the zero-correlation region, the cyclic shift autocorrelation of the ZC root sequence is equal to 0.

[0094] For example, given a ZC root sequence, performing a cyclic shift on it yields a cyclically shifted sequence with a correlation function of zero, where the correlation function between any two sequences in this cyclically shifted sequence is zero. The cyclically shifted sequence s obtained by performing a cyclic shift on the ZC root sequence is shown below. u,k (n) satisfies the following formula (1):

[0095] In formula (1), N is the sequence length, u is the root sequence index, u = 1, 2, ..., N-1, Δ T The zero-correlation zone or maximum round-trip time, where k is the cyclic shift index. Operators This indicates rounding down to the nearest integer. ZC sequences In the time-delay domain, shift multiplexing forms a zero-correlation region.

[0096] When Doppler frequency shift exists, s u，k The fuzzy function A(τ,v) will exhibit multiple peaks. The fuzzy function A(τ,v) satisfies formula (2).

[0097] In formula (2), τ represents the propagation delay, v represents the Doppler frequency shift, and the meanings of the other parameters are given in formula (1).

[0098] To enhance the ZC sequence's ability to combat Doppler frequency shift, LTE and NR protocols further restrict the cyclic shift of the ZC root sequence, limiting different cyclic shifts within the zero-ambiguity region. The zero-ambiguity region refers to the region where the ambiguity function is zero within both the maximum round-trip time (RTD) and maximum Doppler frequency shift intervals. It's understood that the maximum RTD is related to the terminal device's location, and the maximum Doppler frequency shift is related to the terminal device's speed. Within a certain cell radius, if the terminal's speed satisfies the maximum Doppler frequency shift constraint, the mutual interference between any two sequences in the cyclic shift sequence is minimized, or, in other words, the mutual interference between any two sequences is zero.

[0099] For a ZC root sequence, by further restricting the cyclic shift of the ZC root sequence, a cyclically shifted sequence with a fuzzy function equal to zero can be obtained, where the fuzzy function of any two sequences in this cyclically shifted sequence is equal to zero. The restricted set of cyclically shifted ZC sequences s u,k (n) satisfies the following formula (3):

[0100] In formula (3), C k This represents the cyclic shift of the root sequence; the meanings of the other parameters are given in formula (1).

[0101] In Release 8 (Rel-8), Restricted Sets Type A was proposed to combat frequency offsets of ±1 subcarrier spacing, with the number of usable cyclic shifts not exceeding 1 / 3 of the unrestricted set. In Release 14 (Rel-14), Restricted Sets Type B was proposed to combat frequency offsets of ±2 subcarrier spacing, with the number of usable cyclic shifts not exceeding 1 / 5 of the unrestricted set.

[0102] A cell's random access preamble set is obtained by cyclically shifting the ZC root sequence, or the random access preamble set is formed by cyclically shifting one or more root sequences. The random access preamble can also be called a random access preamble, access preamble, random access sequence, access sequence, etc. The terminal device can randomly select a random access preamble from at least one random access preamble included in the random access preamble set configured for the cell, and then transmit the random access preamble to the network device on the physical random access channel.

[0103] A cell can be configured with a specific set of random access preambles for terminal devices within its coverage area to access the cell's network devices. Each cell's random access preamble set can be formed by cyclically shifting multiple (e.g., 64) ZC sequences, with each ZC sequence corresponding to a random access preamble identifier (ID). For example, the network device broadcasts the starting root sequence number and determines the 64 ZC sequences sequentially according to the principle of "first traversing the cyclic shifts, then traversing the root sequence number."

[0104] One sorting rule for root sequence numbers is as follows:

[0105] 1) The root sequences are divided into a low-cubic-metric group and a high-cubic-metric group based on a certain cubic metric CM (e.g., called the first cubic metric). In the low-cubic-metric group, the cubic metric of all physical root sequences indicated by all physical root sequence numbers does not exceed the first cubic metric, while in the high-cubic-metric group, the cubic metric of all physical root sequences indicated by all physical root sequence numbers exceeds the first cubic metric. The cubic metric CM reflects the degree of signal power fluctuation over time. Optionally, the CM satisfies: Where rms(·) represents the root mean square and t represents the time variable.

[0106] For example, if the root sequence length N = 839 and the first cubic metric CM = 1.2 dB, all root sequence numbers are divided into a low cubic metric group and a high cubic metric group, with CM = 1.2 dB as the boundary. The low cubic metric group can contain 456 root sequences, and the high cubic metric group can contain 382 root sequences. CM = 1.2 dB corresponds to the cubic metric of quadrature phase shift keying (QPSK) signals.

[0107] 2) For the low cubic metric group or the high cubic metric group, the root sequence within the group supports the maximum cell radius against ±1 subcarrier frequency offset. Divided into 16 groups by boundaries, including:

[0108] 3) Within each group, the cube measures are arranged in descending order: For the low cube measure group, odd-numbered groups are arranged in descending order of cube measures, and even-numbered groups are arranged in ascending order of cube measures; for the high cube measure group, odd-numbered groups are arranged in ascending order of cube measures, and even-numbered groups are arranged in descending order of cube measures. This can also be understood as follows: For the low cube measure group, starting from the last physical root sequence number set, the cube measures are arranged alternately in ascending and descending order, and the cube measures of the last physical root sequence number set are arranged in ascending order; for the high cube measure group, starting from the first physical root sequence number set, the cube measures are arranged alternately in ascending and descending order, and the cube measures of the first physical root sequence number set are arranged in ascending order. The first physical root sequence number set in the high cube measure group is the last physical root sequence number set in the low cube measure group.

[0109] The root sequences are obtained sequentially according to the above sorting rules. By assigning logical root sequence numbers to the sorted root sequences, or by numbering the sorted root sequences sequentially starting from 0, the relationship between logical root sequence numbers and physical root sequence numbers, as shown in Table 1, can be obtained. It can be understood that the physical root sequence numbers in Table 1 are the actual numbers of the root sequences. The logical root sequence number represents the position of the corresponding physical root sequence number among all physical root sequence numbers. That is, the logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers. Network devices or terminal devices can determine the physical root sequence number corresponding to the logical root sequence number based on the logical root sequence number and Table 1, and then determine the physical root sequence. A cyclic shift of the physical root sequence yields the random access preamble.

[0110] Table 1

[0111] In Table 1, for both low and high cubic metric groups, the root sequences within a group are divided by the maximum cell radius supported against ±1 subcarrier frequency offset, resulting in multiple physical root sequence number sets. This ensures that root sequences within the same physical root sequence number set support the same maximum cell radius, cubic metric, and maximum mobility speed. However, the protocol supports dividing the root sequences within the same group by the maximum cell radius supported against multiple subcarrier frequency offsets. This results in root sequences within the same physical root sequence number set supporting the same maximum cell radius and cubic metric, but supporting multiple different maximum mobility speeds. In other words, root sequences within the same physical root sequence number set may correspond to the same maximum round-trip time interval and cubic metric, but multiple different maximum Doppler shift intervals. For high-speed mobile scenarios, the maximum mobility speed may inevitably jump between adjacent sequences, leading to unusable root sequences within a physical root sequence number set and low sequence utilization.

[0112] To address the aforementioned technical problems, this application provides a solution based on its embodiments. In this embodiment, multiple consecutive physical root sequence numbers in all physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time (RTD) interval, and the same maximum Doppler shift interval. Multiple consecutive physical root sequence numbers in all physical root sequences can be considered as a set of physical root sequence numbers or a group of physical root sequence numbers. From this perspective, the correspondence between multiple consecutive physical root sequence numbers in all physical root sequences and the same cubic metric interval, the same maximum RTD interval, and the same maximum Doppler shift interval can be replaced with: root sequence numbers in any set of physical root sequence numbers corresponding to the same cubic metric interval, the same maximum RTD interval, and the same maximum Doppler shift interval. Thus, even if the terminal device moves at high speed, the maximum moving speed will not change in adjacent sequences, thereby ensuring that all physical root sequences within a set of physical root sequences are available for use by the terminal device, improving sequence utilization. In this embodiment of the application, the root sequence numbers in a set of physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively. This can be understood as the root sequence numbers in a set of physical root sequence numbers supporting the same maximum cell radius, the same cubic metric, and the same maximum moving speed.

[0113] To ensure that root sequences within a physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip time (RTD) interval, and the same maximum Doppler shift (MFD) interval, this application provides a method for sorting physical root sequences. By sorting all physical root sequences according to this method and assigning logical root sequences to each sorted physical root sequence number, a mapping relationship between logical root sequences and physical root sequences can be obtained. Here, the logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequences. In this mapping relationship, any root sequence number within a physical root sequence number set corresponds to the same cubic metric interval, the same maximum RTD interval, and the same maximum Doppler shift interval. Unless otherwise specified, in the embodiments of this application, the concepts of "set" and "group" are equivalent and can be substituted for each other.

[0114] The following first introduces the sorting method for physical root sequence numbers provided in the embodiments of this application. According to this sorting method, all physical root sequence numbers can be divided into multiple physical root sequence number sets. Specifically, the multiple physical root sequence number sets are obtained according to the following partitioning rules:

[0115] 1) Divide all physical root sequence numbers into low-cubic-metric and high-cubic-metric groups, using the first cubic metric as the boundary. In the low-cubic-metric group, the cubic metric of all physical root sequences indicated by all physical root sequence numbers does not exceed the first cubic metric, while in the high-cubic-metric group, the cubic metric of all physical root sequences indicated by all physical root sequence numbers exceeds the first cubic metric. For example, the first cubic metric can be the cubic metric of a QPSK signal (i.e., 1.2 dB). Alternatively, the first cubic metric can also be the cubic metric corresponding to other coding and modulation schemes. This application embodiment does not limit the coding and modulation scheme corresponding to the first cubic metric. Taking 1) as an example, dividing all physical root sequence numbers into low-cubic-metric and high-cubic-metric groups (i.e., two cubic-metric groups) using the first cubic metric as the boundary. This application embodiment does not limit the specific number of cubic-metric groups into which all physical root sequence numbers are divided. For example, based on two cubic metrics as the boundary, all physical root sequence numbers can be divided into three cubic-metric groups. These three cubic metric groups can be: low cubic metric group, medium cubic metric group, and high cubic metric group.

[0116] 2) Each cubic metric group is divided into multiple physical root sequence number sets by using the maximum round-trip time and maximum Doppler shift as boundaries. Taking the low cubic metric group and the high cubic metric group as examples, for both groups, the maximum round-trip time and maximum Doppler shift are used as boundaries to divide all physical root sequence numbers into multiple physical root sequence number sets.

[0117] 3) The physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order. For example, the physical root sequence number sets in the low cubic metric group are sorted first, and then the physical root sequence number sets in the high cubic metric group are sorted. The first physical root sequence number set in the high cubic metric group is also the last physical root sequence number set in the low cubic metric group.

[0118] Specifically, for the low cubic metric group, starting from the last physical root sequence number set, the sequences are arranged alternately in ascending and descending order of cubic metric, with the cubic metric of the last physical root sequence number set arranged in ascending order. For the high cubic metric group, starting from the first physical root sequence number set, the sequences are arranged alternately in ascending and descending order of cubic metric, with the cubic metric of the first physical root sequence number set arranged in ascending order. Alternatively, for the low cubic metric group, the cubic metric of the odd-numbered groups is arranged in descending order, and the cubic metric of the even-numbered groups is arranged in ascending order; for the high cubic metric group, the cubic metric of the odd-numbered groups is arranged in ascending order, and the cubic metric of the even-numbered groups is arranged in descending order.

[0119] Furthermore, for both the low cubic metric group and the high cubic metric group, all physical root sequence numbers within the group are divided into multiple physical root sequence number sets, with the maximum round-trip time and the maximum Doppler shift as the boundaries. Compared to the method in Table 1 above, which divides all physical root sequence numbers within the group into multiple physical root sequence number sets with the most supported maximum cell radius as the boundary, this method ensures that root sequence numbers within any physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval.

[0120] The following details how to sort all physical root sequence numbers.

[0121] As mentioned earlier, when Doppler frequency offset exists, the ambiguity function of the physical root sequence will exhibit multiple peaks, meaning the ambiguity function of the physical root sequence has multiple peak values. To reduce interference, candidate peak values ​​of the ambiguity function of the physical root sequence can first be determined. The peak value of the ambiguity function corresponds to the time delay domain dimension and the Doppler domain dimension. Therefore, mapping the peak value of the ambiguity function to the time delay Doppler coordinate system, the peak value of the ambiguity function is represented as a point in the time delay Doppler coordinate system. Correspondingly, the candidate peak value of the ambiguity function of the physical root sequence is also called the candidate peak point of the ambiguity function in the time delay Doppler coordinate system. Here, the horizontal axis in the time delay Doppler coordinate system indicates the time delay domain, and the vertical axis indicates the Doppler domain.

[0122] In this embodiment, among all peak points in a given region, if the time delay distance and Doppler distance between a peak point and the origin of the fuzzy function of any physical root sequence (e.g., the first physical root sequence) are not simultaneously greater than the time delay distance and Doppler distance between any other peak point and the origin of the fuzzy function in the two-dimensional plane (excluding the origin), then that peak point is a candidate peak point. In other words, in the time-delay Doppler coordinate system, the time delay distance between a candidate peak point of the fuzzy function of the first physical root sequence and the origin of the time-delay Doppler coordinate system is not greater than the time delay distance between any other peak point and the origin (excluding the origin). Alternatively, the Doppler distance between a candidate peak point of the fuzzy function of the first physical root sequence and the origin of the time-delay Doppler coordinate system is not greater than the Doppler distance between the other arbitrary peak points and the origin. Alternatively, the time delay distance between the candidate peak point of the ambiguity function of the first physical root sequence and the origin in the time-delay Doppler coordinate system is not greater than the time delay distance between any other peak point and the origin, and the Doppler distance between the candidate peak point of the ambiguity function of the first physical root sequence and the origin in the time-delay Doppler coordinate system is not greater than the Doppler distance between any other peak point and the origin. It is understood that the final peak point corresponding to the root sequence is determined from the candidate peak points. The method of determining candidate peak points according to the embodiments of this application can make the root sequence corresponding to the finally selected peak point correspond to a larger maximum round-trip time delay interval and / or a larger maximum Doppler frequency shift interval, thus making the maximum cell radius and / or maximum moving speed supported by the root sequence corresponding to the finally selected peak point as large as possible.

[0123] For example, the set of candidate peak point coordinates for a fuzzy function is: Where, τ i This represents the set of coordinates of candidate peak points of the fuzzy function. The time delay coordinate of the i-th candidate peak point in the data, v i This represents the set of coordinates of candidate peak points of the fuzzy function. The Doppler coordinates of the i-th candidate peak point in the data. The operator |·| denotes the cardinality of a set. Taking the first physical root sequence as an example, it represents the set of coordinates of the candidate peak points of the fuzzy function of the first physical root sequence. satisfy: Where N represents the sequence length of the first physical root sequence, and u represents the sequence number of the first physical root sequence. In ±uτ mod N, the sign operation is performed first, followed by the modulo operation; in ±un mod N, the sign operation is performed first, followed by the modulo operation.

[0124] For easy understanding, please refer to FIG. 2, which shows a schematic diagram of mapping the ZC root sequence to the time-delay Doppler domain coordinate system. FIG. 2 takes the sequence length N = 139 and the root sequence number u = 11 as an example. In FIG. 2, the candidate peak point set includes 5 candidate peak points, that is,[ for any candidate peak point, the time-delay spacing and Doppler spacing from the coordinate origin are not simultaneously greater than the time-delay spacing and Doppler spacing between any other peak point except the coordinate origin and the coordinate origin on the two-dimensional plane of the ambiguity function.

[0125] To improve the ability of the ZC sequence to resist Doppler frequency offset, it is necessary to make the value of the ambiguity function not exceed a preset threshold, or even the ambiguity function equal to zero, within the maximum round-trip time-delay interval and the maximum Doppler frequency shift interval. Therefore, after determining the candidate peak point set of the ambiguity function of the first physical root sequence number, the candidate maximum zero-ambiguity region corresponding to each candidate peak point set can be determined. The maximum cell radius supported by the candidate maximum zero-ambiguity region corresponds to the time-delay spacing between the candidate peak point and the coordinate origin, and the maximum moving speed supported by the candidate maximum zero-ambiguity region corresponds to the Doppler spacing between the candidate peak point and the coordinate origin. Or rather, the maximum cell radius corresponds to the maximum round-trip time-delay interval, and the maximum moving speed corresponds to the maximum Doppler frequency shift interval. From this perspective, determining the candidate maximum zero-ambiguity region corresponding to each candidate peak point set means determining the candidate maximum round-trip time-delay interval and the candidate maximum Doppler frequency shift interval corresponding to each candidate peak point set.[

[0126] In the embodiment of the present application, any candidate peak point of the ambiguity function of a physical root sequence is located in the candidate maximum zero-ambiguity region. The candidate maximum zero-ambiguity region corresponds to the candidate maximum round-trip time-delay interval and the candidate maximum Doppler frequency shift interval. Taking the coordinates <τ , v i , v i > of the i-th candidate peak point in the set as an example, assume that the i-th candidate physical root sequence number set is Then the corresponding maximum round-trip time-delay interval and the maximum Doppler frequency shift interval

[0127] satisfy: T,0 , Δ T,1 ), [Δ T,1 [[ID=三十四]], Δ T,2 ), …, [Δ T,K-1 , +∞) represents the K preset maximum round-trip time-delay intervals of the physical root sequence number set, [Δ F,0 , Δ F,1 ), [Δ F,1 , Δ F,2 ), …, [ΔF,L-1 (, +∞) represents the L maximum Doppler frequency shift intervals preset in the physical root sequence number set, 0 ≤ k i ≤K-1, 0≤l i ≤L-1, For any given i, Δ T,i ×Δ F,l =τ i ×min{v1,Nv i}

[0128] For ease of understanding, please refer to Figure 2. The time-delay Doppler coordinate system shown in Figure 2 is divided into 8 intervals in the time-delay domain: [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and into 8 intervals in the Doppler domain: [0,3), [3,5), [5,7), [7,9), [9,11), [11,13), [13,15), [15,+∞). For the candidate peak point set... Correspondingly, the set of candidate physical root sequence numbers

[0129] By analogy, multiple sets of candidate physical root sequence numbers can be obtained. The candidate physical root sequence numbers in each set are sorted to determine the physical root sequence number set to which each physical root sequence number belongs [Δ]. T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ), where k∈{0,1,…K-1}, l∈{0,1,…L-1}.

[0130] This application embodiment can map the maximum cell radius and maximum mobility supported in the candidate maximum zero-ambiguity region to a time-delay Doppler coordinate system, and sort the physical root sequence numbers in each candidate physical root sequence number set according to specific rules. All sorted physical root sequence numbers can guarantee that the maximum cell radius and maximum mobility supported between adjacent physical root sequence number sets do not jump. For example, after sorting the candidate physical root sequence number sets in the candidate maximum zero-ambiguity region, the following can be obtained: The group that maps furthest from the origin in the time delay domain and / or Doppler domain among the candidate maximum zero-ambiguity regions can be selected as the maximum zero-ambiguity region. Mapped to the group's location.

[0131] This application does not impose restrictions on the sorting rules used for all physical root sequence numbers, as long as the maximum cell radius and maximum mobility supported by adjacent physical root sequence number sets do not change abruptly after sorting. Several possible sorting rules are listed below, along with how to determine the physical root sequence number set based on the candidate physical root sequence number set under each rule. In the following description, we take the existence of K maximum round-trip time delay intervals and L maximum Doppler frequency shift intervals, where K = L, as an example. It can be understood that there are a total of K × L physical root sequence number sets.

[0132] First rule: When the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, each physical root sequence number is mapped to its corresponding physical root sequence number set by synchronously / alternatingly increasing the maximum round-trip time delay and the maximum Doppler frequency shift, initially increasing with the maximum round-trip time delay. The arrangement order of the multiple physical root sequence number sets satisfies the following: K×L physical root sequence number sets are sorted in ascending order of max{k,l}; where, when max{k,l} is the same and even, k is sorted in ascending order, and for any k, l is sorted in descending order; or, when max{k,l} is the same and odd, l is sorted in ascending order, and for any l, k is sorted in descending order.

[0133] For ease of understanding, please refer to Figure 3, which shows a schematic diagram of mapping the ZC root sequence to the time-delay Doppler domain coordinate system. Figure 3 takes a sequence length N = 139 and a root sequence number u = 11 as an example. In Figure 3, the time-delay Doppler domain coordinate system is divided into 8 intervals in the time-delay domain: [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and divided into 8 intervals in the Doppler domain: [0,3), [3,5), [5,7), [7,9), [9,11), [11,13), [13,15), [15,+∞). (Candidate peak point set) Candidate physical root sequence number set Sort the sets of physical root sequence numbers according to the first rule.

[0134] Under the first rule, the set of physical root sequence numbers is determined based on the sets of candidate physical root sequence numbers, including: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l iIf the numbers are the same and even, then l i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i If the numbers are the same and odd, then k i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest *i* is determined to be the set of physical root sequence numbers. Continuing with the example in Figure 3, Δ within the largest zero-ambiguity region... T,5 ×Δ F,5 =25×3, which ultimately maps to the interval [15,+∞)×[3,5).

[0135] Understandably, by obtaining all sorted physical root sequence numbers according to the first rule, and then assigning logical root sequence numbers to these sorted physical root sequence numbers, or by sequentially numbering all sorted physical root sequences starting from 0, a mapping relationship between logical root sequence numbers and physical root sequence numbers can be obtained. Here, the logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers. This mapping relationship is similar to Table 1. For example, assuming the sequence length N = 13, and the maximum round-trip time interval Δ... T,1 =0,Δ T,2 =2,Δ T,3 =4,Δ T,4 =6, maximum Doppler frequency shift interval Δ F,1 =0,Δ F,2 =3,Δ F,3 =5,Δ F,4 =7. The mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the first rule is shown in Table 2. It should be noted that Table 2 is only an example.

[0136] Table 2

[0137] The second rule: When the number of maximum round-trip time intervals K and the number of maximum Doppler shift intervals L are equal, each physical root sequence number is mapped to its corresponding physical root sequence number set by synchronously / alternatingly increasing the maximum round-trip time delay and the maximum Doppler shift, initially increasing with the maximum Doppler shift. In other words, the arrangement order of multiple physical root sequence number sets satisfies the following: K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; where, when max{k,l} is the same and even, l is sorted in ascending order, and for any l, k is sorted in descending order; or, when max{k,l} is the same and odd, k is sorted in ascending order, and for any k, l is sorted in descending order.

[0138] For ease of understanding, please refer to Figure 4, which shows a schematic diagram of mapping the ZC root sequence to the time-delay Doppler domain coordinate system. Figure 4 uses a sequence length N = 139 and a root sequence number u = 11 as an example. In Figure 4, the time-delay Doppler domain coordinate system is divided into 8 intervals in the time-delay domain: [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and into 8 intervals in the Doppler domain: [0,3), [3,5), [5,7), [7,9), [9,11), [11,13), [13,15), [15,+∞). (Candidate peak point set) Candidate physical root sequence number set Sort the sets of physical root sequence numbers according to the second rule.

[0139] Under the second rule, the physical root sequence number set is determined based on each candidate physical root sequence number set, including: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i If the numbers are the same and even, then k... i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i If the numbers are the same and odd, then l i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, ki The largest *i* is determined to be the set of physical root sequence numbers. Continuing with the example in Figure 4, Δ within the largest zero-ambiguity region... T,5 ×Δ F,5 =38×1, which ultimately maps to the interval [15,+∞)×[0,3).

[0140] Similar to obtaining the mapping relationship between logical root sequence numbers and physical root sequence numbers based on the first rule, the mapping relationship can also be obtained based on the second rule. For example, assuming the sequence length N = 13, the maximum round-trip time interval Δ... T,1 =0,Δ T,2 =2,Δ T,3 =4,Δ T,4 =6, maximum Doppler frequency shift interval Δ F,1 =0,Δ F,2 =3,Δ F,3 =5,Δ F,4 =7. The mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the second rule is shown in Table 3. It should be noted that Table 3 is only an example.

[0141] Table 3

[0142] The third rule: Using a monotonically increasing maximum round-trip time, each physical root sequence number is mapped to its corresponding physical root sequence number set. This approach is as compatible as possible with the sorting rules of existing protocols, making implementation simpler and reducing processing complexity. In other words, the arrangement order of multiple physical root sequence number sets satisfies the following: K×L physical root sequence number sets are sorted in ascending order of k; where, when k is the same and even, l is sorted in ascending order; or, when k is the same and odd, l is sorted in descending order.

[0143] For ease of understanding, please refer to Figure 5, which shows a schematic diagram of mapping the ZC root sequence to the time-delay Doppler domain coordinate system. Figure 5 uses a sequence length N = 139 and a root sequence number u = 11 as an example. In Figure 5, the time-delay Doppler domain coordinate system is divided into 8 intervals in the time-delay domain: [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and into 8 intervals in the Doppler domain: [0,3), [3,5), [5,7), [7,9), [9,11), [11,13), [13,15), [15,+∞). (Candidate peak point set) Candidate physical root sequence number set Sort the sets of physical root sequence numbers according to the third rule.

[0144] Under the third rule, the set of physical root sequence numbers is determined based on the sets of candidate physical root sequence numbers, including: from Select k from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when k of multiple candidate physical root sequence number sets... i If the numbers are the same and even, then l i The largest i is determined to be the set of physical root sequence numbers; or, when k of multiple candidate physical root sequence number sets... i If the numbers are the same and odd, then l i The smallest i is determined as the set of physical root sequence numbers. Continuing with the example in Figure 5, Δ within the maximum zero ambiguity region... T,5 ×Δ F,5 =38×1, which ultimately maps to the interval [15,+∞)×[0,3).

[0145] Similar to obtaining the mapping relationship between logical root sequence numbers and physical root sequence numbers based on the first rule, the mapping relationship can also be obtained based on the third rule. For example, assuming the sequence length N = 13, the maximum round-trip time interval Δ... T,1 =0,Δ T,2 =2,Δ T,3 =4,Δ T,4 =6, maximum Doppler frequency shift interval Δ F,1 =0,Δ F,2 =3,Δ F,3 =5,Δ F,4 =7. The mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the third rule is shown in Table 4. It should be noted that Table 4 is only an example.

[0146] Table 4

[0147] The fourth rule: Mapping each physical root sequence number to its corresponding physical root sequence number set using the rule of monotonically increasing maximum Doppler frequency shift is relatively simple and reduces processing complexity. In other words, the arrangement order of multiple physical root sequence number sets satisfies: K×L physical root sequence number sets are sorted in ascending order of l; where, when l is the same and even, k is sorted in ascending order; or, when l is the same and odd, k is sorted in descending order.

[0148] For ease of understanding, please refer to Figure 6, which shows a schematic diagram of mapping the ZC root sequence to the time-delay Doppler domain coordinate system. Figure 6 uses a sequence length N = 139 and a root sequence number u = 11 as an example. In Figure 6, the time-delay Doppler domain coordinate system is divided into 8 intervals in the time-delay domain: [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and divided into 8 intervals in the Doppler domain: [0,3), [3,5), [5,7), [7,9), [9,11), [11,13), [13,15), [15,+∞). (Candidate peak point set) Candidate physical root sequence number set Sort the sets of physical root sequence numbers according to the fourth rule.

[0149] Under the fourth rule, the set of physical root sequence numbers is determined based on the sets of candidate physical root sequence numbers, including: from Select l from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when the l of multiple candidate physical root sequence number sets... i If the numbers are the same and even, then k i The largest i is determined to be the set of physical root sequence numbers; or, when the l of multiple candidate physical root sequence number sets is... i If the numbers are the same and odd, then k i The smallest i is determined as the set of physical root sequence numbers. Continuing with the example in Figure 6, Δ within the maximum zero ambiguity region... T,5 ×Δ F,5 =1×11, which ultimately maps to the interval [0,2)×[11,13).

[0150] Similar to obtaining the mapping relationship between logical root sequence numbers and physical root sequence numbers based on the first rule, the mapping relationship can also be obtained based on the fourth rule. For example, assuming the sequence length N = 13, the maximum round-trip time interval Δ... T,1 =0,Δ T,2 =2,Δ T,3 =4,Δ T,4 =6, maximum Doppler frequency shift interval Δ F,1 =0,Δ F,2 =3,Δ F,3 =5,Δ F,4 =7. The mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the fourth rule is shown in Table 5. It should be noted that Table 5 is only an example.

[0151] Table 5

[0152] Any of the rules from the first to the fourth mentioned above can ensure that multiple consecutive root sequence numbers in all physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval. Thus, even in high-speed moving scenarios, all physical root sequence numbers within any set are usable, thereby improving sequence utilization.

[0153] Terminal devices can determine the physical root sequence to use when initiating random access based on the mapping relationship between logical root sequence numbers and physical root sequence numbers. Correspondingly, network devices can determine the physical root sequence to use when initiating random access by the terminal device based on the mapping relationship between logical root sequence numbers and physical root sequence numbers.

[0154] Please refer to Figure 7, which exemplarily illustrates a flowchart of a communication method 700 provided in an embodiment of this application. The communication method 700 provided in Figure 7 involves interaction between two communication devices, namely a first communication device and a second communication device. For example, the first communication device is a network device, and the second communication device is a terminal device. The steps executed by the network device can be implemented by the RAN device itself, or by components within the RAN device (such as a control board (chip), baseband chip, or other processing units or processor modules). For example, the network device can be 110a or 110b in Figure 1, or it can be the chip (system) in 110a or 110b in Figure 1. The steps executed by the terminal device can be implemented by the terminal device itself, or it can be implemented by components within the terminal device (such as a chip, processing unit, or processor module). The terminal device can be any of the terminal devices 120a to 120j shown in Figure 1, or it can be the chip (system) in any of the terminal devices 120a to 120j in Figure 1. As shown in Figure 7, the method 700 shown in Figure 7 includes the following steps.

[0155] S701. The terminal device determines the first physical root sequence based on the first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number.

[0156] In this embodiment, the mapping relationship between logical root sequence numbers and physical root sequence numbers ensures that root sequences within any set of physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval. For example, root sequences within the first set of physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval. The first physical root sequence can be a physical root sequence within the first set of physical root sequences. This mapping relationship is obtained according to any of the aforementioned first to fourth rules, and details can be found in the aforementioned related content, which will not be repeated here. For example, the mapping relationship between logical root sequence numbers and physical root sequence numbers can be as shown in Tables 2, 3, 4, or 5. It is understood that Tables 2, 3, 4, or 5 are merely illustrative.

[0157] When a terminal device initiates a reference signal, it can determine the physical root sequence used to generate the reference signal (i.e., the first physical root sequence in this document). For example, the terminal device can determine the first physical root sequence number corresponding to the first logical root sequence number based on the cell's first logical root sequence number and the mapping relationship between logical root sequence numbers and physical root sequence numbers. This first physical root sequence number indicates the first physical root sequence.

[0158] Understandably, prior to S701, the terminal device could determine the first logical root sequence number. In one implementation, the first logical root sequence number could be a logical root sequence number stored by the terminal device. In another implementation, the first logical root sequence number is indicated by the network device to the terminal device. For example, the network device sends indication information to the terminal device, which may indicate the first logical root sequence number.

[0159] S702, The terminal device sends a first sequence, which is determined based on a first physical root sequence.

[0160] Accordingly, the network device receives the first sequence. This first sequence can be a random access preamble or a reference signal sequence. The terminal device determines the first physical root sequence, which can be obtained by performing operations such as cyclic shifting on the first physical root sequence. After obtaining the first sequence, the terminal device sends the first sequence to the network device.

[0161] S703. The network device determines the first sequence based on the first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number.

[0162] After receiving the first sequence, the network device can determine the content of the first sequence based on the first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number, in order to respond to the first sequence.

[0163] In a possible implementation, the network device can also send a reference signal to the terminal device based on the mapping relationship between logical root sequence numbers and physical root sequence numbers. For example, when the network device initiates a reference signal, it can determine the physical root sequence (e.g., a second physical root sequence) used to generate the reference signal. The network device can determine the second physical root sequence number corresponding to the second logical root sequence number based on the cell's second logical root sequence number and the mapping relationship between logical root sequence numbers and physical root sequence numbers, generate the reference signal based on the second physical root sequence number, and then send the reference signal.

[0164] The embodiments described above illustrate the methods provided in this application from the perspective of interaction between terminal devices and network devices. The steps executed by the terminal device can be implemented by different functional entities that make up the terminal device. Similarly, the steps executed by the network device can be implemented by different functional entities that make up the network device. For example, the network device can be a CU-DU architecture, where the CU can generate instruction information and the DU can send instruction information. To implement the functions in the methods provided in the embodiments of this application, the terminal device and the network device can include hardware structures and / or software modules, implementing the functions in the form of hardware structures, software modules, or a combination of hardware structures and software modules. Whether a particular function is executed in the form of hardware structures, software modules, or a combination of hardware structures and software modules depends on the specific application and design constraints of the technical solution.

[0165] The communication device used to implement the above method in the embodiments of this application is described below with reference to the accompanying drawings. Therefore, the content above can be used in subsequent embodiments, and repeated content will not be described again.

[0166] Figure 8 is a schematic block diagram of a communication device 800 provided in an embodiment of this application. The communication device 800 can be a network device or a terminal device as described in the above embodiments. For example, the communication device 800 can be the network device or terminal device shown in Figure 1; or, the communication device 800 can be a chip (system) in a network device or a chip (system) in a terminal device; or, the communication device 800 can be a software module of a network device or a terminal device. The communication device 800 can correspondingly implement the functions or steps implemented by the terminal device or network device in the various method embodiments described above. The communication device 800 may include a processing module 810 and a transceiver module 820. Optionally, it may also include a storage module, which can be used to store instructions (code or program) and / or data. The storage module can be, for example, a memory. The processing module 810 and the transceiver module 820 can be coupled to the storage module. For example, the processing module 810 can read instructions (code or program) and / or data from the storage module to implement the corresponding method. When the communication device 800 is a chip in a terminal device, the storage module can be a storage module within the chip, such as a register or cache. For example, the storage module can also be an external storage module located within the network device / terminal device, such as read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions, random access memory (RAM), etc. The aforementioned units can be configured independently, or partially or completely integrated.

[0167] In one possible implementation, processing module 810 may be a processor or controller, such as a general-purpose central processing unit (CPU), a general-purpose processor, a digital signal processing unit (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor may also be a combination that implements computational functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc. Transceiver module 820 is a transceiver, interface circuit, bus, pin, or other possible communication interface for receiving signals from other devices. For example, when the device is implemented as a chip, transceiver module 820 is an interface circuit for the chip to receive signals from other chips or devices, or an interface circuit for the chip to send signals to other chips or devices.

[0168] In some possible implementations, the communication device 800 can correspondingly implement the behavior and functions of the terminal device in the above method embodiments. The communication device 800 can be a terminal device, a component (e.g., a chip or circuit) applied in the terminal device, a chip or chipset in the terminal device, or a part of a chip used to perform related method functions, or a software module capable of implementing the methods executed by the terminal device in the above methods (e.g., any method in communication method 700), without limitation.

[0169] For example, the communication device 800 implements the method executed by the terminal device in the embodiment of FIG7. The transceiver module 820 may be used to execute S702 in the embodiment shown in FIG7, and / or to support other processes of the technology described herein; the processing module 810 may be used to execute S701 in the embodiment shown in FIG7, and / or to support other processes of the technology described herein.

[0170] In one implementation, processing module 810 determines a first physical root sequence based on a first logical root sequence number and the mapping relationship between logical root sequence numbers and physical root sequence numbers. Transceiver module 820 transmits a first sequence determined based on the first physical root sequence, which belongs to a first physical root sequence set. Root sequences within the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler shift interval.

[0171] In another implementation, the processing module 810 can be used to sort all physical root sequence numbers, assign logical root sequence numbers to each sorted physical root sequence number, and obtain the mapping relationship between logical root sequence numbers and physical root sequence numbers. Here, multiple consecutive physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively. The logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

[0172] In an alternative implementation, the transceiver module 820 is further configured to: receive indication information indicating a first logical root sequence number, the first logical root sequence number being used to indicate the sequence number of a first physical root sequence.

[0173] In one alternative implementation, all physical root sequence numbers are divided into multiple sets of physical root sequence numbers, which are obtained according to the following partitioning rules:

[0174] The physical root sequence numbers are divided into a low cubic metric group and a high cubic metric group, with the first cubic metric as the boundary. In the low cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers does not exceed the first cubic metric, and in the high cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers exceeds the first cubic metric.

[0175] For the low cubic metric group and the high cubic metric group, all physical root sequence numbers within the group are divided into multiple physical root sequence number sets by using the maximum round-trip time delay and the maximum Doppler frequency shift as boundaries.

[0176] The physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order.

[0177] In one optional implementation, the physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order, including: first sorting the physical root sequence number sets in the low cubic metric group, and then sorting the physical root sequence number sets in the high cubic metric group; wherein, for the low cubic metric group, starting from the last physical root sequence number set, they are arranged alternately in ascending and descending cubic metric order, with the cubic metric of the last physical root sequence number set arranged in ascending order; for the high cubic metric group, starting from the first physical root sequence number set, they are arranged alternately in ascending and descending cubic metric order, with the cubic metric of the first physical root sequence number set arranged in ascending order.

[0178] In one optional implementation, the processing module 810 is further configured to: determine candidate peak points of the fuzzy function of the physical root sequence corresponding to each physical root sequence number. Wherein, in the time-delay Doppler coordinate system, the candidate peak points satisfy: the time delay distance between the candidate peak point and the origin of the time-delay Doppler coordinate system is not greater than the time delay distance between any other peak point and the origin (excluding the origin); and / or, the Doppler distance between the candidate peak point and the origin of the time-delay Doppler coordinate system is not greater than the Doppler distance between any other peak point and the origin (excluding the origin). The horizontal axis in the time-delay Doppler coordinate system indicates the time delay domain, and the vertical axis in the time-delay Doppler coordinate system indicates the Doppler domain.

[0179] For example, the set of candidate peak point coordinates of the fuzzy function satisfy:

[0180] Where N represents the sequence length of the first physical root sequence, u represents the sequence number of the first physical root, and τ i This represents the set of coordinates of candidate peak points of the fuzzy function. The time delay coordinate of the i-th candidate peak point in the data, v i This represents the set of coordinates of candidate peak points of the fuzzy function. The Doppler coordinates of the i-th candidate peak point in the data. The operator |·| represents the cardinality of a set.

[0181] In one optional implementation, the processing module 810 is further configured to: based on the set The coordinates of the i-th candidate peak point are <τ i ,v i > Determine the set of candidate physical root sequence numbers for the i-th digit. Based on each candidate physical root sequence number set, determine the physical root sequence number set corresponding to the physical root sequence number [Δ]. T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ), where k∈{0,1,…K-1}, l∈{0,1,…L-1}. Where, where, The corresponding maximum round-trip delay interval and the maximum Doppler frequency shift interval satisfy:

[0182] [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,Kx1,+∞) represents the K maximum round-trip time intervals preset in the physical root sequence number set, [Δ F,0 ,Δ F,1 ),[Δ F,1 ,Δ F,2 ),…,[Δ F,L-1 (, +∞) represents the L maximum Doppler frequency shift intervals preset in the physical root sequence number set, 0 ≤ k i ≤K-1, 0≤l i ≤L-1,

[0183] In one optional implementation, when the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the arrangement order of the multiple physical root sequence number sets satisfies: the K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; wherein, when max{k,l} is the same and even, k is sorted in ascending order, and for any k, l is sorted in descending order; or, when max{k,l} is the same and odd, l is sorted in ascending order, and for any l, k is sorted in descending order.

[0184] Optionally, the processing module 810 is specifically used for: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and even, l will be... i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and odd, k is... i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers.

[0185] In one optional implementation, when the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the arrangement order of the multiple physical root sequence number sets satisfies: the K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; wherein, when max{k,l} is the same and even, l is sorted in ascending order, and for any l, k is sorted in descending order; or, when max{k,l} is the same and odd, k is sorted in ascending order, and for any k, l is sorted in descending order.

[0186] Optionally, the processing module 810 is specifically used for: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and even, k is... i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and odd, l will be... i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers.

[0187] In one optional implementation, the arrangement order of multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order of k; where, when k is the same and even, l is sorted in ascending order; or, when k is the same and odd, l is sorted in descending order.

[0188] Optionally, the processing module 810 is specifically used for: from Select k from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when k of multiple candidate physical root sequence number sets... i When the numbers are the same and even, l i The largest i is determined to be the set of physical root sequence numbers; or, when k of multiple candidate physical root sequence number sets... i When the numbers are the same and odd, l i The smallest i is determined as the set of physical root sequence numbers.

[0189] In one optional implementation, the arrangement order of multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order of l; wherein, when l is the same and even, k is sorted in ascending order; or, when l is the same and odd, k is sorted in descending order.

[0190] Optionally, the processing module 810 is specifically used for: from Select l from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when the l of multiple candidate physical root sequence number sets... i When the numbers are the same and even, k is... i The largest i is determined to be the set of physical root sequence numbers; or, when the l of multiple candidate physical root sequence number sets is... i When the numbers are the same and odd, k i The smallest i is determined as the set of physical root sequence numbers.

[0191] For example, the communication device 800 implements the method performed by the network device in the embodiment of FIG7. The transceiver module 820 may be used to execute S702 in the embodiment shown in FIG7, and / or to support other processes of the technology described herein; the processing module 810 may be used to execute S703 in the embodiment shown in FIG7, and / or to support other processes of the technology described herein.

[0192] [Correction based on Rule 91, 22.11.2023] In one implementation, the transceiver module 820 is used to receive a first sequence, which is determined based on a first physical root sequence. The processing module 810 is used to determine the first sequence based on a first logical root sequence number and the mapping relationship between logical root sequence numbers and physical root sequence numbers. The first logical root sequence number indicates the first physical root sequence. The first physical root sequence belongs to a first physical root sequence set, and the root sequences within the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval. In another implementation, the processing module 810 is used to: sort all physical root sequence numbers, wherein multiple consecutive physical root sequence numbers in all physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively; set logical root sequence numbers for each of the sorted physical root sequence numbers, and obtain the mapping relationship between the logical root sequence numbers and physical root sequence numbers, wherein the logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

[0193] In an alternative implementation, the transceiver module 820 is further configured to: send indication information indicating a first logical root sequence number, the first logical root sequence number being used to indicate the sequence number of a first physical root sequence.

[0194] In one alternative implementation, all physical root sequence numbers are divided into multiple sets of physical root sequence numbers, which are obtained according to the following partitioning rules:

[0195] The physical root sequence numbers are divided into a low cubic metric group and a high cubic metric group, with the first cubic metric as the boundary. In the low cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers does not exceed the first cubic metric, and in the high cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers exceeds the first cubic metric.

[0196] For the low cubic metric group and the high cubic metric group, all physical root sequence numbers within the group are divided into multiple physical root sequence number sets by using the maximum round-trip time delay and the maximum Doppler frequency shift as boundaries.

[0197] The physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order.

[0198] In one optional implementation, the physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order, including: first sorting the physical root sequence number sets in the low cubic metric group, and then sorting the physical root sequence number sets in the high cubic metric group; wherein, for the low cubic metric group, starting from the last physical root sequence number set, they are arranged alternately in ascending and descending cubic metric order, with the cubic metric of the last physical root sequence number set arranged in ascending order; for the high cubic metric group, starting from the first physical root sequence number set, they are arranged alternately in ascending and descending cubic metric order, with the cubic metric of the first physical root sequence number set arranged in ascending order.

[0199] In one optional implementation, the processing module 810 is further configured to: determine candidate peak points of the fuzzy function of the physical root sequence corresponding to each physical root sequence number. Wherein, in the time-delay Doppler coordinate system, the candidate peak points satisfy: the time delay distance between the candidate peak point and the origin of the time-delay Doppler coordinate system is not greater than the time delay distance between any other peak point and the origin (excluding the origin); and / or, the Doppler distance between the candidate peak point and the origin of the time-delay Doppler coordinate system is not greater than the Doppler distance between any other peak point and the origin (excluding the origin). The horizontal axis in the time-delay Doppler coordinate system indicates the time delay domain, and the vertical axis in the time-delay Doppler coordinate system indicates the Doppler domain.

[0200] For example, the set of candidate peak point coordinates of the fuzzy function satisfy:

[0201] Where N represents the sequence length of the first physical root sequence, u represents the sequence number of the first physical root, and τ i This represents the set of coordinates of candidate peak points of the fuzzy function. The time delay coordinate of the i-th candidate peak point in the data, v i This represents the set of coordinates of candidate peak points of the fuzzy function. The Doppler coordinates of the i-th candidate peak point in the data. The operator |·| represents the cardinality of a set.

[0202] In one optional implementation, the processing module 810 is further configured to: based on the set The coordinates of the i-th candidate peak point are <τ i ,v i > Determine the set of candidate physical root sequence numbers for the i-th digit. Based on each candidate physical root sequence number set, determine the physical root sequence number set corresponding to the physical root sequence number [Δ]. T,k ,Δ T,k+1 )×[Δ D,l ,Δ D,l+1 ), where k∈{0,1,…K-1}, l∈{0,1,…L-1}. Where, where, The corresponding maximum round-trip delay interval and the maximum Doppler frequency shift interval satisfy:

[0203] [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 (,+∞) represents the K maximum round-trip time intervals preset in the physical root sequence number set, [Δ F,0 ,Δ D,1 ),[Δ F,1 ,Δ D,2 ),…,[Δ D,L-1 (, +∞) represents the L maximum Doppler frequency shift intervals preset in the physical root sequence number set, 0 ≤ k i ≤K-1, 0≤l i ≤L-1,

[0204] In one optional implementation, when the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the arrangement order of the multiple physical root sequence number sets satisfies: the K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; wherein, when max{k,l} is the same and even, k is sorted in ascending order, and for any k, l is sorted in descending order; or, when max{k,l} is the same and odd, l is sorted in ascending order, and for any l, k is sorted in descending order.

[0205] Optionally, the processing module 810 is specifically used for: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and even, l will be... i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and odd, k is... i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers.

[0206] In one optional implementation, when the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the arrangement order of the multiple physical root sequence number sets satisfies: the K×L physical root sequence number sets are sorted in ascending order according to max{k,l}; wherein, when max{k,l} is the same and even, l is sorted in ascending order, and for any l, k is sorted in descending order; or, when max{k,l} is the same and odd, k is sorted in ascending order, and for any k, l is sorted in descending order.

[0207] Optionally, the processing module 810 is specifically used for: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and even, k is... iThe smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers; or, when the max{k} of multiple candidate physical root sequence number sets is... i ,l i When the numbers are the same and odd, l will be... i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers.

[0208] In one optional implementation, the arrangement order of multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order of k; where, when k is the same and even, l is sorted in ascending order; or, when k is the same and odd, l is sorted in descending order.

[0209] Optionally, the processing module 810 is specifically used for: from Select k from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when k of multiple candidate physical root sequence number sets... i When the numbers are the same and even, l i The largest i is determined to be the set of physical root sequence numbers; or, when k of multiple candidate physical root sequence number sets... i When the numbers are the same and odd, l i The smallest i is determined as the set of physical root sequence numbers.

[0210] In one optional implementation, the arrangement order of multiple physical root sequence number sets satisfies the following: the K×L physical root sequence number sets are sorted in ascending order of l; wherein, when l is the same and even, k is sorted in ascending order; or, when l is the same and odd, k is sorted in descending order.

[0211] Optionally, the processing module 810 is specifically used for: from Select l from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, when the l of multiple candidate physical root sequence number sets... i When the numbers are the same and even, k is... i The largest i is determined to be the set of physical root sequence numbers; or, when the l of multiple candidate physical root sequence number sets is... i When the numbers are the same and odd, k i The smallest i is determined as the set of physical root sequence numbers.

[0212] When the communication device 800 is a chip-based device or circuit, the transceiver module can be an input / output circuit and / or a communication interface; the processing module is an integrated processor, microprocessor, or integrated circuit.

[0213] Figure 9 is a schematic block diagram of a communication device 900 provided in an embodiment of this application. The communication device 900 can be a network device or a terminal device as described in the above embodiments. For example, the communication device 900 can be the network device or terminal device shown in Figure 1; or the communication device 900 can be a chip (system) within a network device or terminal device. In this embodiment, the chip system can be composed of chips or may include chips and other discrete devices. Specific functions can be found in the descriptions in the above method embodiments.

[0214] The communication device 900 includes one or more processors 901, used to implement or support the communication device 900 in implementing the functions of the terminal device or network device in the methods provided in the embodiments of this application. For details, please refer to the detailed description in the method examples, which will not be repeated here. The processor 901 can also be called a processing unit or processing module, and can implement certain control functions. The processor 901 can be a general-purpose processor or a dedicated processor, etc. For example, it includes: a baseband processor, a central processing unit, an application processor, a modem processor, a graphics processor, an image signal processor, a digital signal processor, a video codec processor, a controller, a memory, and / or a neural network processor, etc. The baseband processor can be used to process communication protocols and communication data. The central processing unit can be used to control the communication device 900 (e.g., a network device or a terminal device), execute software programs, and / or process data. Different processors can be independent devices or integrated into one or more processors, for example, integrated on one or more application-specific integrated circuits.

[0215] In one design, processor 901 may include program 903 (sometimes also referred to as code or instructions) that can be executed on processor 901 to cause communication device 900 to perform the methods described in the embodiments below. In yet another possible design, communication device 900 includes circuitry (not shown in FIG9) for implementing the network device or terminal device functions described in the above embodiments.

[0216] In one design, the communication device 900 may include one or more memories 902 storing a program 904 (sometimes referred to as code or instructions), which can be run on the processor 901 to cause the communication device 900 to perform the methods described in the above method embodiments, such as the flow shown in one or more figures in FIG7.

[0217] In one design, the processor 901 and / or memory 902 may include an artificial intelligence (AI) module 907 and an AI module 908, which are used to implement AI-related functions. The AI ​​modules may be implemented through software, hardware, or a combination of both. For example, the AI ​​module may include a RAN intelligent controller (RIC) module. For example, the AI ​​module may be a near real-time RIC or a non-real-time RIC.

[0218] In one possible design, the processor 901 and / or memory 902 may also store data. The processor and memory may be configured separately or integrated together.

[0219] In one possible design, the communication device 900 may further include a transceiver 905 and / or an antenna 906. The processor 901, sometimes referred to as a processing unit, controls the communication device 900. The transceiver 905, sometimes referred to as a transceiver unit, transceiver, transceiver circuit, or transceiver, is used to realize the transmission and reception functions of the communication device through the antenna 906.

[0220] In one possible design, the communication device 900 may further include one or more of the following components: a wireless communication module, an audio module, an external memory interface, internal memory, a universal serial bus (USB) interface, a power management module, an antenna, a speaker, a microphone, an input / output module, a sensor module, a motor, a camera, or a display screen, etc. It is understood that in some embodiments, the communication device 900 may include more or fewer components, or some components may be integrated, or some components may be separated. These components may be implemented in hardware, software, or a combination of software and hardware.

[0221] The communication device in the above embodiments can be a terminal device (or network device), a circuit, a chip applied in a terminal device (or network device), or other combined devices or components having the aforementioned terminal device (or network device). When the communication device is a terminal device (or network device), the transceiver module can be a transceiver, which may include an antenna and radio frequency circuits, etc., and the processing module can be a processor, such as a CPU. When the communication device is a component with the aforementioned terminal device (or network device) functions, the transceiver module can be a radio frequency unit, and the processing module can be a processor. When the communication device is a chip system, the communication device can be an FPGA, a dedicated ASIC, a system-on-chip (SoC), a CPU, a network processor (NP), a DSP, a microcontroller unit (MCU), a programmable logic device (PLD), or other integrated chips. The processing module can be the processor of the chip system. The transceiver module or communication interface can be the input / output interface or interface circuit of the chip system. For example, the interface circuit can be a code / data read / write interface circuit. The interface circuit can be used to receive code instructions (the code instructions are stored in memory and can be read directly from memory or through other devices) and transmit them to the processor; the processor can then execute the code instructions to perform the methods described in the above method embodiments. Alternatively, the interface circuit can also be a signal transmission interface circuit between a communication processor and a transceiver.

[0222] This application also provides a communication system, specifically, the communication system includes a network device and a terminal device. For example, the communication system includes a terminal device and a network device for implementing the functions related to Figure 7. Please refer to the relevant descriptions in the above method embodiments for details, which will not be repeated here.

[0223] This application also provides a computer-readable storage medium including instructions that, when run on a computer, cause the computer to perform the method executed by the terminal device or network device in FIG7.

[0224] This application also provides a computer program product, including instructions that, when run on a computer, cause the computer to execute the method executed by the terminal device or network device in FIG7.

[0225] This application provides a chip system including a processor and potentially a memory, for implementing the functions of the terminal device or network device described in the aforementioned methods. The chip system can be composed of chips or may include chips and other discrete components.

[0226] To achieve the functions of the communication devices shown in Figures 8 and 9, this application embodiment also provides a chip, including a processor, for supporting the communication device in implementing the functions involved in the terminal device or network device in the above method embodiments. In one possible design, the chip is connected to a memory or the chip includes a memory for storing necessary computer programs, instructions, and data for the communication device.

[0227] The technical solutions provided by the embodiments of this application are described below in conjunction with the above content and accompanying drawings.

[0228] "When…", "if", and "if" all indicate that the device will take corresponding actions under certain objective circumstances, not that there is a time limit, nor that the device must perform a judgment action when it is implemented, nor do they imply any other limitations. Unless otherwise specified, "if" and "if" are interchangeable, and "when…" and "under the circumstances" are interchangeable. "When…" is interchangeable with "if" / "if".

[0229] Regarding the number of nouns, unless otherwise specified, it refers to "singular nouns or plural nouns," that is, "one or more." "Multiple" refers to two or more. Therefore, in the embodiments of this application, "multiple" can also be understood as "at least two." "At least one" can be one or more, for example, at least one is one, two or more. For example, including at least one means including one, two or more, and is not limited to which ones are included. For example, including at least one of A, B and C, then it can include A, B, C, A and B, A and C, B and C, or A and B and C. Similarly, the understanding of descriptions such as "at least one" is similar. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single items or plural items. For example, "at least one of A, B and C" includes A, B, C, AB, AC, BC or ABC. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. In addition, the character " / ", unless otherwise specified, generally indicates that the objects before and after it are in an "or" relationship.

[0230] Unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are used to distinguish multiple objects, and are not used to limit the order, sequence, priority or importance of multiple objects, and the description of "first" and "second" does not limit the objects to necessarily being different.

[0231] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0232] Those skilled in the art will recognize that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this application.

[0233] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0234] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0235] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0236] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the essential contributing part of the technical solution of this application, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), RAM, magnetic disks, or optical disks.

[0237] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of protection of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A communication method, characterized in that, include: The first physical root sequence is determined based on the first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number; Send a first sequence, which is determined based on the first physical root sequence. The first physical root sequence belongs to a set of first physical root sequences. The root sequences in the set of first physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval.

2. A communication method, characterized in that, include: Receive a first sequence, which is determined based on a first physical root sequence. The first physical root sequence belongs to a set of first physical root sequences, and the root sequences in the set of first physical root sequences correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval. The first sequence is determined based on the first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number, wherein the first logical root sequence number indicates the first physical root sequence.

3. A communication method, characterized in that, include: Sort all physical root sequence numbers, and multiple consecutive physical root sequence numbers in the above physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively; Logical root sequence numbers are set for each of the sorted physical root sequence numbers to obtain the mapping relationship between the logical root sequence numbers and the physical root sequence numbers, wherein the logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

4. The method as described in claim 1 or 2, characterized in that, The method further includes: Sort all physical root sequence numbers, and multiple consecutive physical root sequence numbers in the above physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip time interval, and the same maximum Doppler frequency shift interval, respectively; Logical root sequence numbers are set for each of the sorted physical root sequence numbers to obtain the mapping relationship between the logical root sequence numbers and the physical root sequence numbers, wherein the logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers.

5. The method as described in claim 3, characterized in that, The method further includes: The first physical root sequence number is determined based on the first logical root sequence number of the cell and the mapping relationship, and the first physical root sequence number indicates the first physical root sequence. Send a first sequence, which is generated based on a first physical root sequence.

6. The method as described in claim 1, 3, 4 or 5, characterized in that, The method further includes: Receive indication information, the indication information indicating the first logical root sequence number, the first logical root sequence number being used to indicate the sequence number of the first physical root sequence.

7. The method as described in claim 2, 3, or 4, characterized in that, The method further includes: Send indication information, the indication information indicating the first logical root sequence number, the first logical root sequence number being used to indicate the sequence number of the first physical root sequence.

8. The method according to any one of claims 1-7, characterized in that, All physical root sequence numbers are divided into multiple physical root sequence number sets, which are obtained according to the following division rules: The physical root sequence numbers are divided into a low cubic metric group and a high cubic metric group, with the first cubic metric as the boundary. In the low cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers does not exceed the first cubic metric, and in the high cubic metric group, the cubic metric of the physical root sequence indicated by all physical root sequence numbers exceeds the first cubic metric. For the low cubic metric group and the high cubic metric group, all physical root sequence numbers within the group are divided into multiple physical root sequence number sets by using the maximum round-trip time delay and the maximum Doppler frequency shift as boundaries. The physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order.

9. The method as described in claim 8, characterized in that, The physical root sequence numbers within each of the multiple physical root sequence number sets are arranged in cubic metric order, including: First, sort the set of physical root sequence numbers in the low cubic metric group, and then sort the set of physical root sequence numbers in the high cubic metric group; wherein, For the low cubic metric group, starting from the last physical root sequence number set, the cubic metrics are arranged alternately in ascending and descending order, wherein the cubic metrics of the last physical root sequence number set are arranged in ascending order. For the high cubic metric group, starting from the first physical root sequence number set, the cubic metrics are arranged alternately in ascending and descending order, wherein the cubic metrics of the first physical root sequence number set are arranged in ascending order.

10. The method as described in claim 8 or 9, characterized in that, The method further includes: Determine the candidate peak points of the fuzzy function of the physical root sequence corresponding to each physical root sequence number; in the time-delay Doppler coordinate system, the candidate peak points satisfy: The time delay distance between the candidate peak point and the origin in the time delay Doppler coordinate system is no greater than the time delay distance between any other peak point (excluding the origin) and the origin; and / or, The Doppler distance between the candidate peak point and the origin of the time-delay Doppler coordinate system is no greater than the Doppler distance between any other peak point and the origin, excluding the origin. The horizontal axis of the time-delay Doppler coordinate system indicates the time-delay domain, and the vertical axis of the time-delay Doppler coordinate system indicates the Doppler domain.

11. The method as described in claim 10, characterized in that, The set of candidate peak point coordinates of the fuzzy function satisfy: Where N represents the sequence length of the first physical root sequence, u represents the sequence number of the first physical root sequence, and τ i This represents the set of coordinates of candidate peak points of the fuzzy function. The time delay coordinate of the i-th candidate peak point in the data, v i This represents the set of coordinates of candidate peak points of the fuzzy function. The Doppler coordinates of the i-th candidate peak point, where i ranges from 1 to 1. The operator |·| represents the cardinality of a set.

12. The method as described in claim 11, characterized in that, The method further includes: According to the set The coordinates of the i-th candidate peak point are <τ i ,v i > Determine the set of candidate physical root sequence numbers for the i-th digit. The The corresponding maximum round-trip delay interval and the maximum Doppler frequency shift interval satisfy: Among them, [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 (,+∞) represents the K maximum round-trip time intervals preset in the physical root sequence number set, [Δ F,0 ,Δ F,1 ),[Δ F,1 ,Δ F,2 ),…,[Δ F,L-1 (, +∞) represents the L maximum Doppler frequency shift intervals preset in the physical root sequence number set, 0 ≤ k i ≤K-1, 0≤l i ≤L-1, Based on each candidate physical root sequence number set, determine the physical root sequence number set corresponding to the physical root sequence number [Δ]. T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ), where k∈{0,1,…K-1}, l∈{0,1,…L-1}.

13. The method as described in claim 12, characterized in that, When the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the order of the multiple physical root sequence number sets satisfies: The set of K×L physical root sequence numbers is sorted in ascending order according to max{k,l}; where... When max{k,l} are the same and even, k is sorted in ascending order, and for any k, l is sorted in descending order; or... When max{k,l} are the same and are odd, l is sorted in ascending order, and for any l, k is sorted in descending order.

14. The method as described in claim 13, characterized in that, Based on the various candidate physical root sequence number sets, the physical root sequence number set is determined, including: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, When the max{k} of multiple candidate physical root sequence number sets i ,l i If the numbers are the same and even, then l i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers; or, When the max{k} of multiple candidate physical root sequence number sets i ,l i If the numbers are the same and odd, then k i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers.

15. The method as described in claim 12, characterized in that, When the number of maximum round-trip time delay intervals K and the number of maximum Doppler frequency shift intervals L are equal, the order of the multiple physical root sequence number sets satisfies: The set of K×L physical root sequence numbers is sorted in ascending order according to max{k,l}; where... When max{k,l} are the same and even, l is sorted in ascending order, and for any l, k is sorted in descending order; or... When max{k,l} are the same and are odd, k is sorted in ascending order, and for any k, l is sorted in descending order.

16. The method as described in claim 15, characterized in that, Based on the various candidate physical root sequence number sets, the physical root sequence number set is determined, including: from Select max{k} from the set of candidate physical root sequence numbers. i ,l i The largest i is taken as the set of physical root sequence numbers; where, When the max{k} of multiple candidate physical root sequence number sets i ,l i If the numbers are the same and even, then k... i The smallest i is determined to be the set of physical root sequence numbers. If k is a multiple candidate set of physical root sequence numbers... i The same, l i The largest i is determined to be the set of physical root sequence numbers; or, When the max{k} of multiple candidate physical root sequence number sets i ,l i If the numbers are the same and odd, then l i The smallest i is determined as the set of physical root sequence numbers. If multiple candidate physical root sequence number sets l i The same, k i The largest i is determined to be the set of physical root sequence numbers.

17. The method as described in claim 12, characterized in that, The order of the multiple physical root sequence number sets satisfies: The K×L sets of physical root sequence numbers are sorted in ascending order of k; where... When k is the same and even, l is sorted in ascending order; or... When k is the same and odd, l is sorted from largest to smallest.

18. The method as described in claim 17, characterized in that, Based on the various candidate physical root sequence number sets, the physical root sequence number set is determined, including: from Select k from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, When k of multiple candidate physical root sequence number sets i If the numbers are the same and even, then l i The largest i is determined to be the set of physical root sequence numbers; or, When k of multiple candidate physical root sequence number sets i If the numbers are the same and odd, then l i The smallest i is determined as the set of physical root sequence numbers.

19. The method as described in claim 12, characterized in that, The order of the multiple physical root sequence number sets satisfies: The K×L sets of physical root sequence numbers are sorted in ascending order of l; where... When l is the same and even, k is sorted in ascending order; or... When l is the same and odd, k is sorted from largest to smallest.

20. The method as described in claim 19, characterized in that, Based on the various candidate physical root sequence number sets, the physical root sequence number set is determined, including: from Select l from the set of candidate physical root sequence numbers i The largest i is taken as the set of physical root sequence numbers; where, When multiple candidate physical root sequence number sets l i If the numbers are the same and even, then k i The largest i is determined to be the set of physical root sequence numbers; or, When multiple candidate physical root sequence number sets l i If the numbers are the same and odd, then k i The smallest i is determined as the set of physical root sequence numbers.

21. A communication device, characterized in that, The communication device includes a processing unit and a transceiver unit, the processing unit being coupled to the transceiver unit to perform the method as described in any one of claims 1 to 20.

22. A communication device, characterized in that, The communication device includes a processor and a memory, the memory being used to store a computer program, and the processor being used to execute the computer program stored in the memory, causing the communication device to perform the method as described in any one of claims 1 to 20.

23. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program that, when run on a computer, causes the computer to perform the method as described in any one of claims 1 to 20.

24. A computer program product, characterized in that, The computer program product includes a computer program that, when run on a computer, causes the computer to perform the method as described in any one of claims 1 to 20.

25. A chip system, characterized in that, The chip system includes: A processor and an interface, the processor being configured to call and execute instructions from the interface, wherein when the processor executes the instructions, it implements the method as described in any one of claims 1 to 20.

Images