A communication method and apparatus

Abstract

A communication method and device, the communication method comprising: a terminal device determining a first physical root sequence according to 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; a network device determining a first physical root sequence according to a first logical root sequence number and a mapping relationship between logical root sequence numbers and physical root sequence numbers, and receiving the first sequence according to the first logical root sequence number. The first sequence is determined according to the first physical root sequence and belongs to a first physical root sequence set, and the first physical root sequence set corresponds to a same cubic metric interval, a same maximum round trip delay interval and a same maximum Doppler shift interval. Even if the terminal device moves at a high speed, the available sequences in the first physical root sequence set will not jump. Compared with a physical root sequence set corresponding to multiple maximum Doppler shift intervals, the sequence utilization rate can be improved.

Description

Communication method and device Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a communication method and device. Background Art

[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. The sequence numbers of 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] Embodiments of the present application provide a communication method and apparatus for improving sequence resource utilization.

[0005] To achieve the above objectives, the present invention adopts the following technical solutions:

[0006] In a first aspect, embodiments of the present application provide a communication method that can be performed by a first communication device. The first communication device can be a terminal device, or the first communication device 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 is described below using the first communication device as an example, wherein the first communication device is the terminal device itself.

[0007] The communication method includes: a terminal device determining a first physical root sequence based on a first logical root sequence number and a 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 first physical root sequence set, and the root sequences in the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval.

[0008] Accordingly, in a second aspect, embodiments of the present application provide a communication method that can be performed by a second communication device. The second communication device can be a network device, or the second communication device can be a component used to implement the functions of the 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 is described below using the second communication device being 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 a mapping relationship between a logical root sequence number and a physical root sequence number, 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 first physical root sequence set, and the root sequences in the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip delay 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 delay interval, and the same maximum Doppler shift interval. Because the root sequences within the first physical root sequence set correspond to the same maximum Doppler shift interval, even if the terminal device moves at high speed, the sequences within the first physical root sequence set available to the terminal device will not jump. 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 shift intervals, when the terminal device moves at high speed, it is inevitable that there will be root sequences within the physical root sequence set that cannot be used by the terminal device. Therefore, in an embodiment of the present application, the root sequences within the first physical root sequence set correspond to the same maximum Doppler shift interval, which can improve sequence utilization.

[0011] In a third aspect, embodiments of the present application provide a communication method that can be performed by a communication device. The communication device can be a terminal device, or a component used to implement the functions of the terminal device. For example, the communication device is a unit / module, circuit, or chip within the terminal device. Alternatively, the communication device can be a network device, or a component used to implement the functions of a network device. For example, the communication device is a unit / module, circuit, or chip within the network device.

[0012] The communication method includes: a communication device sorting all physical root sequence numbers, setting a logical root sequence number for each sorted physical root sequence number, and obtaining a mapping relationship between the logical root sequence number and the physical root sequence number. Multiple consecutive physical root sequence numbers among all the physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. The logical root sequence number is an index of the position of the corresponding physical root sequence number among all the physical root sequence numbers.

[0013] The third aspect essentially provides a method for mapping logical root sequence numbers to physical root sequence numbers. This mapping method ensures that multiple consecutive physical root sequence numbers within all physical root sequence numbers correspond to the same cubic metric range, maximum round-trip delay range, and maximum Doppler shift range. This method improves sequence utilization, making it particularly suitable for high-speed mobility scenarios.

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

[0015] The terminal device can obtain a mapping relationship between the logical root sequence number and the physical root sequence number using the mapping method for mapping logical root sequence numbers to physical root sequence numbers provided in the third aspect, and thereby determine the physical root sequence to be used for sending the first sequence based on this mapping relationship. This mapping method ensures that all physical root sequences in each physical root sequence set are available to 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, setting a logical root sequence number for each sorted physical root sequence number, and obtaining a mapping relationship between the logical root sequence number and the physical root sequence number. Multiple consecutive physical root sequence numbers among all the physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. The logical root sequence number is an index of the position of the corresponding physical root sequence number among all the physical root sequence numbers.

[0017] The network device obtains a mapping relationship between the logical root sequence number and the physical root sequence number according to the mapping method of the third aspect, thereby determining the first sequence received from the terminal device based on the mapping relationship. In one implementation, the mapping relationship is (pre)configured.

[0018] In an implementation of the third aspect, the communication device is a terminal device, and the method further includes: the terminal device determines a first physical root sequence number based on the first logical root sequence number of the cell and the mapping relationship, where the first physical root sequence number indicates a first physical root sequence; and sends a first sequence, where the first sequence is generated based on the first physical root sequence.

[0019] Accordingly, in an implementation of the third aspect, the communication device is a network device, and the method further includes: the network device determines a first physical root sequence number based on the first logical root sequence number of the cell and the mapping relationship, where the first physical root sequence number indicates a first physical root sequence; and receives a first sequence based on the first physical root sequence number, where the first sequence is generated based on the first physical root sequence.

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

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

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

[0023] In an implementation of any one of the first to third aspects, all physical root sequence numbers are divided into multiple physical root sequence number sets, and the multiple physical root sequence number sets are obtained according to the following division rule:

[0024] Dividing all the physical root sequence numbers into a low cubic metric group and a high cubic metric group based on a first cubic metric, wherein the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the low cubic metric group do not exceed the first cubic metric, and the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the high cubic metric group exceed the first cubic metric;

[0025] For the low cubic metric group and the high cubic metric group, all physical root sequence numbers in the group are divided into multiple physical root sequence number sets based on the maximum round-trip delay and the maximum Doppler shift;

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

[0027] In an implementation of any aspect from the first aspect to the third aspect, the physical root sequence numbers in each physical root sequence number set in 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, the cubic metric is alternately arranged in ascending and descending order, and the cubic metric of the last physical root sequence number set is arranged in ascending order; for the high cubic metric group, starting from the first physical root sequence number set, the cubic metric is alternately arranged in ascending and descending order, and the cubic metric of the first physical root sequence number set is arranged in ascending order.

[0028] This solution provides a way to divide and sort all physical root sequence numbers so that all physical root sequence numbers in each physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler frequency shift interval. In this way, within a certain cell radius and a certain mobile speed, the mutual interference between any two sequences that can be used by the terminal device is small, and the sequence utilization rate is high.

[0029] In an implementation of any of the first to third aspects, the method further includes: determining candidate peak points of the ambiguity function of the physical root sequence corresponding to each physical root sequence number. In the Delay Doppler coordinate system, the candidate peak points satisfy the following conditions: the delay spacing between the candidate peak point and the coordinate origin of the Delay Doppler coordinate system is not greater than the delay spacing between any other peak point other than the coordinate origin and the coordinate origin; and / or the Doppler spacing between the candidate peak point and the coordinate origin of the Delay Doppler coordinate system is not greater than the Doppler spacing between any other peak point other than the coordinate origin and the coordinate origin. The horizontal axis of the Delay Doppler coordinate system indicates the delay domain, and the vertical axis of the Delay Doppler coordinate system indicates the Doppler domain.

[0030] In this solution, among all peak points of the root sequence's ambiguity function within a given area, if the delay distance between a peak point and the coordinate origin is no greater than the delay distance between any other peak point in the Delay-Doppler coordinate system, excluding the coordinate origin, and / or the Doppler distance between a peak point and the coordinate origin is no greater than the Doppler distance between any other peak point in the Delay-Doppler coordinate system, excluding the coordinate origin, then that peak point is identified as a candidate peak point. The final peak point corresponding to the root sequence is then determined from the candidate peak points. This solution ensures that the root sequence corresponding to the final selected peak point corresponds to a maximum round-trip delay interval and / or a maximum Doppler shift interval, thereby maximizing the maximum cell radius and / or maximum mobile speed supported by the root sequence corresponding to the final selected peak point.

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

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

[0033] In an implementation of any aspect of the first to third aspects, the method further includes: The coordinates of the i-th candidate peak point in <τ i ,v i >, determine the i-th candidate physical root sequence number set According to 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}. Corresponding maximum round-trip delay range and the maximum Doppler shift interval satisfy:

[0034] [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 ,+∞) represents the K maximum round trip delay intervals preset by 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 by the physical root sequence number set, 0≤k i ≤K-1, 0≤l i ≤L-1,

[0035] The scheme maps the candidate peak points to the two-dimensional plane where the delay-Doppler coordinate system is located, and sorts the mapped candidate peak points to obtain [Δ T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ).

[0036] In an implementation of any aspect of the first to third aspects, each physical root sequence number may be mapped to a corresponding physical root sequence number set [Δ T,k ,Δ T,k+1 )×[Δ F,l ,Δ F,l+1 ) to ensure that all root sequence numbers in any physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. Specific rules can also be understood as rules for mapping physical root sequence numbers to which physical root sequence number set. Specific rules include, but are not limited to, the following rules 1 to 4.

[0037] First rule:

[0038] When the number of maximum round-trip delay intervals K and the number of maximum Doppler shift intervals L are equal, the 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}; 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 odd, l is sorted in ascending order, and for any l, k is sorted in descending order.

[0039] The first rule, that is, the rule of synchronously / alternatingly increasing the maximum round-trip delay and the maximum Doppler shift, and initially increasing the maximum round-trip delay, maps each physical root sequence number to a corresponding physical root sequence number set.

[0040] Under the first rule, the physical root sequence number set is determined based on each candidate physical root sequence number set, including: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are an even number, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, k iThe largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set.

[0041] Second rule:

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

[0043] The second rule, that is, the rule of synchronously / alternatingly increasing the maximum round-trip delay and the maximum Doppler shift, and initially increasing the maximum Doppler shift, maps each physical root sequence number to a corresponding physical root sequence number set.

[0044] Under the second rule, based on each candidate physical root sequence number set, a physical root sequence number set is determined, including: Select max{k i ,l i}The largest i is used as the physical root sequence number set; among them,

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

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

[0047] Rule 3:

[0048] The arrangement order of the multiple physical root sequence number sets satisfies: the K×L physical root sequence number sets are sorted from small to large according to k; when k is the same and an even number, l is sorted from small to large; or when k is the same and an odd number, l is sorted from large to small.

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

[0050] Under the third rule, based on each candidate physical root sequence number set, determining the physical root sequence number set includes: Select k from the set of candidate physical root sequence numbers i The largest i is used as the physical root sequence number set; when k of multiple candidate physical root sequence number sets i The same and even number, l i The largest i is determined as the physical root sequence number set; or, when the k of multiple candidate physical root sequence number sets i The same and odd number, l i The smallest i is determined as the physical root sequence number set.

[0051] Rule 4:

[0052] The arrangement order of the multiple physical root sequence number sets satisfies: the K×L physical root sequence number sets are sorted from small to large according to l; when l is the same and an even number, k is sorted from small to large; or when l is the same and an odd number, k is sorted from large to small.

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

[0054] Under the fourth rule, based on each candidate physical root sequence number set, determining the physical root sequence number set includes: Select l from the set of candidate physical root sequence numbers i The largest i is used as the physical root sequence number set; when the l of multiple candidate physical root sequence number sets i The same and even number, k i The largest i is determined as the physical root sequence number set; or, when the l of multiple candidate physical root sequence number sets is i The same and odd number, k i The smallest i is determined as the physical root sequence number set.

[0055] Any of the above rules (1) to (4) can ensure that all root sequence numbers in any physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. The present embodiment does not limit the use of any of these rules.

[0056] In a fourth aspect, an embodiment of the present application provides a communication device having the function of implementing the behaviors in the method examples of the first to third aspects above. 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 may be a terminal device or a network device in the first to third aspects. For another example, the communication device may be a device that can support the terminal device to implement the functions required by the methods provided in the first to third aspects. For example, the communication device may be a chip or a chip system in a terminal device, or the communication device may be a chip or a 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 (means) or modules (such as chips or chip systems or circuits) for executing the methods of any aspect of the first aspect to the third aspect. For example, the communication device includes a processing unit (sometimes also referred to as a processing module or processor) and / or a transceiver unit (sometimes also referred to as a transceiver module or transceiver). The transceiver unit can realize the sending function and the receiving function. When the transceiver unit realizes the sending function, it can be called a sending unit (sometimes also referred to as a sending module). When the transceiver unit realizes the receiving function, it can be called a receiving unit (sometimes also referred to as a receiving module). The sending unit and the receiving unit can be the same functional unit, which is called a transceiver unit, and the functional unit can realize the sending function and the receiving function; or, the sending unit and the receiving unit can be different functional units, and the transceiver unit is a general term for these functional units. These units (modules) can perform the corresponding functions in the method examples of any aspect of the first aspect to the third aspect above. Please refer to the detailed description in the method examples for details, which will not be repeated here.

[0059] In a fifth aspect, an embodiment of the present application provides a communication device, which may be the communication device in the fourth aspect of the above-mentioned embodiment, or a chip or chip system provided in the communication device in the fourth aspect. The communication device includes a communication interface and a processor, and optionally, also includes a memory. The memory is used to store computer programs or instructions or data, and the processor is coupled to the memory and the communication interface. When the processor reads the computer program or instructions or data, the communication device executes the method executed by the terminal device in the above-mentioned method embodiment. For example, the communication device may be a terminal device or a functional module in the terminal device, such as a baseband chip and a radio frequency chip. Alternatively, when the processor reads the computer program or instructions or data, the communication device executes the method executed by the network device in the above-mentioned method embodiment. For example, the communication device may be a network device or a functional module in the network device, such as a baseband chip and a radio frequency chip.

[0060] In a sixth aspect, an embodiment of the present application provides a chip system, which includes a processor and may also include a communication interface for implementing the method described in any of the first to third aspects. Optionally, the chip system also includes a memory. The memory is used to store computer programs (also referred to as codes, or instructions). The processor is used to call and run the computer program from the memory, so that the device equipped with the chip system executes the method in the first aspect and any possible implementation thereof, or the device equipped with the chip system executes the method in the second aspect and any possible implementation thereof, or the device equipped with the chip system executes the method in the third aspect and any possible implementation thereof. The chip system can be composed of chips, or it can include chips and other discrete devices.

[0061] In a seventh aspect, embodiments of the present application provide a communication device comprising an input / output interface and a logic circuit. The input / output interface is used to input and / or output information. The input / output interface can be an interface circuit, an output circuit, an input circuit, a pin, or related circuits. The logic circuit is used to execute the method described in any of aspects 1 to 3.

[0062] In a specific implementation, the communication device may be a chip, the input circuit may be an input pin, the output circuit may be an output pin, and the logic circuit may be a transistor, a gate circuit, a trigger, or various logic circuits. The input signal received by the input circuit may be, for example, but not limited to, received and input by a receiver, and the signal output by the output circuit may be, for example, but not limited to, output to and transmitted by a transmitter. The input circuit and the output circuit may be the same circuit, which functions as an input circuit and an output circuit, respectively, at different times. This application does not limit the specific implementation of the input and output interfaces and logic circuits.

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

[0064] In an eighth aspect, an embodiment of the present application provides a communication system, the communication system comprising a terminal device and a network device, wherein the terminal device is used to implement the functions of the method described in the first aspect, and the network device is used to implement the functions of the method described in the second aspect. Alternatively, the terminal device is used to implement the functions of the method described in the third aspect, and the network device is used to implement the functions of the method described in the third aspect.

[0065] In the ninth aspect, an embodiment of the present application provides a computer-readable storage medium, which is used to store computer programs or instructions. When the computer-readable storage medium is executed, the method described in the first aspect and any possible implementation thereof is implemented, or the method described in the second aspect and any possible implementation thereof is implemented, or the method described in the third aspect and any possible implementation thereof is implemented.

[0066] In the tenth aspect, an embodiment of the present application also provides a computer program product comprising instructions, which, when run on a computer, enables the method described in the above-mentioned first aspect and any possible implementation thereof to be implemented, or enables the method described in the above-mentioned second aspect and any possible implementation thereof to be implemented, or enables the method described in the above-mentioned third aspect and any possible implementation thereof to be implemented.

[0067] The beneficial effects of the above-mentioned fourth to tenth aspects and their implementation methods can refer to the description of the beneficial effects of the first to third aspects and any possible implementation methods thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0068] FIG1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application;

[0069] FIG2 is a schematic diagram of mapping a ZC root sequence to a delay-Doppler coordinate system according to an embodiment of the present application;

[0070] FIG3 is a schematic diagram of mapping a ZC root sequence to a delay-Doppler coordinate system based on the first rule provided by an embodiment of the present application;

[0071] FIG4 is a schematic diagram of mapping a ZC root sequence to a delay-Doppler coordinate system based on the second rule provided in an embodiment of the present application;

[0072] FIG5 is a schematic diagram of mapping a ZC root sequence to a delay-Doppler coordinate system based on the third rule provided in an embodiment of the present application;

[0073] FIG6 is a schematic diagram of mapping a ZC root sequence to a delay-Doppler coordinate system based on the fourth rule provided in an embodiment of the present application;

[0074] FIG7 is a flow chart of a communication method 700 provided in an embodiment of the present application;

[0075] FIG8 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0076] FIG9 is another schematic diagram of the structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0077] In the communication method provided by the embodiment of the present application, the physical root sequences in any physical root sequence set assigned to a cell support the same maximum mobile speed / maximum Doppler shift range, which can improve sequence utilization. The solution provided by the embodiment of the present application is further described below with reference to the accompanying drawings.

[0078] The technical solutions provided in the embodiments of the present application can be applied to various wireless communication systems. For example, the method provided in the embodiments of the present application can be applied to communication systems related to the 3rd Generation Partnership Project (3GPP), such as LTE communication systems, the sixth generation (5G) mobile communication systems, or can also be applied to other next generation mobile communication systems, such as the sixth 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 the like.

[0079] 1 , which shows a communication system applicable to an embodiment of the present application. The communication system includes a radio access network 100 and a core network 200. Optionally, the communication system may also include the 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 through 120j. The network architecture shown in FIG1 is merely illustrative, and the number of terminal devices and / or network devices may be fewer or greater. The communication system described in the embodiments of the present application is intended to more clearly illustrate the technical solutions of the embodiments of the present application and does not constitute a limitation on the communication systems to which the embodiments of the present 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 FIG1. ​​Persons skilled in the art will appreciate that as network architecture evolves, the technical solutions provided in the embodiments of the present application will also be applicable to similar technical problems. When applying the technical solutions of the embodiments of the present application to other communication systems, the devices, components, modules, etc. in the embodiments may be replaced with corresponding devices, components, and modules in other communication systems without limitation.

[0081] The network devices involved in the embodiments of the present application are mainly access network devices. Therefore, in the following text, unless otherwise specified, the "network devices" referred to are radio access network (RAN) devices, which can be referred to as access network devices for short. RAN can be a 3GPP-related cellular system, for example, a 5G mobile communication system, or a future-oriented evolution system (such as a 6G mobile communication system). RAN can also be an open access network (open RAN, O-RAN or ORAN), a cloud radio access network (cloud radio access network, CRAN), or a virtualized radio access network (virtualized RAN, vRAN), etc. RAN can also be a communication system that is a fusion of two or more of the above systems. RAN devices can also be referred to as 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 be a macro base station, a micro base station, an indoor station, a relay node, a donor node / host node, or a wireless controller. A RAN node can also be a server, a wearable device, a vehicle, or an onboard device. For example, a RAN node in V2X technology can be a roadside unit (RSU).

[0083] In another possible scenario, the RAN node may be a module or unit that performs part of the functions of the base station; or multiple RAN nodes collaborate to assist terminal devices in achieving wireless access, and different RAN nodes respectively perform part of the functions of the base station. For example, the RAN node may be a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). The functions of the CU may be implemented by one entity, or by different entities. For example, the functions of the CU may be further divided, that is, the control plane and the user plane may be separated and implemented by 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). The CU-CP entity and the CU-UP entity may be coupled with the DU to jointly perform the functions of the RAN node. The CU and DU may be set separately, or may be included in the same network element, such as the baseband unit (BBU).

[0084] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0085] The CU and DU can be configured according to the protocol layer functions of the wireless network they implement: for example, the CU is configured to implement the functions of the packet data convergence protocol (PDCP) layer and the protocol layers above it (such as the radio resource control (RRC) layer and / or the service data adaptation protocol (SDAP) layer, etc.); the DU is configured to implement the functions of the protocol layers below the PDCP layer (such as the radio link control (RLC), MAC layer, and / or physical (PHY) layer, etc.). For another example, the CU is configured to implement the functions of the protocol layers above the PDCP layer (such as the RRC layer and / or the SDAP layer), and the DU is configured to implement the functions of the PDCP layer and the protocol layers below it (such as the RLC layer, the MAC layer, and / or the PHY layer, etc.). For a detailed description of each of the above protocol layers, please refer to the relevant technical specifications of 3GPP or the technical specifications of other applicable communication protocols. The above division of the processing functions of the CU and DU according to the protocol layer is only an example, and can also be divided in other ways, which is not limited by this application. For example, in one design, the CU or DU can also be divided into parts with partial processing functions of the protocol layer. In one design, part of the RLC layer functions and the functions of the protocol layers above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set in the DU.

[0086] In the embodiments of the present application, the device for implementing the functions of the network device can be the network device itself, or a device that can support the network device to implement the functions, such as a chip system or a combination of devices or components that can implement the functions of the network device, and the device can be installed in the network device. The embodiments of the present application do not limit the specific technology and specific device form used by the network device.

[0087] In the embodiments of the present application, any device capable of performing data communication with a base station can be considered a terminal device. A terminal device is also referred to as a terminal, user equipment (UE), mobile station, or mobile terminal. 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 grid, smart furniture, smart office, smart wearable, smart transportation, or smart city. For example, a terminal device can be: a mobile phone, a computer, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a robotic arm, a camera, a robot, or a smart home device (such as a TV, air conditioner, vacuum cleaner, speaker, set-top box), a relay, a customer premise equipment (CPE), etc.

[0088] The various terminal devices introduced above, if located on a vehicle (for example, placed / installed in a vehicle), can be considered as vehicle-mounted terminal devices. The vehicle-mounted terminal device can be an on-board module, on-board module, on-board component, on-board chip or on-board unit built into the vehicle as one or more components or units, and the vehicle can implement the method of the present application through the built-in on-board module, on-board module, on-board component, on-board chip or on-board unit. The on-board terminal device can be a complete vehicle device, an on-board module, a vehicle, an on-board unit (OBU), a roadside unit (RSU), a vehicle-mounted system (or a vehicle-mounted sending unit) (telematics box, T-box), a chip or a system on chip (SOC), etc. The above chip or SOC can be installed in a vehicle, OBU, RSU or T-box.

[0089] In the embodiments of the present 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, which can be installed in the terminal device. The embodiments of the present application do not limit the specific technology and specific device form used by the terminal device.

[0090] Terminal devices may also be referred to as terminals, terminal devices, user equipment (UE), mobile stations, mobile terminals, 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 grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, drone, helicopter, airplane, ship, robot, robotic arm, smart home device, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal.

[0091] In an embodiment of the present application, the roles of network devices and terminals may 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 through 120i, the terminal device 120i is a network device; but for the network device 110a, 120i is a terminal device, and communication between 110a and 120i is carried out through a wireless air interface protocol. Of course, 110a and 120i can also communicate through an interface protocol between network devices. In this case, relative to 110a, 120i is also a network device. Therefore, in an embodiment of the present application, 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 signal (e.g., a demodulation reference signal (DMRS) and a sounding reference signal (SRS)) or a random access preamble sequence sent by the terminal device to the network device can be generated by a root sequence. The root sequence can be a (Zadoff-Chu, ZC) root sequence or other possible sequences. For ease of understanding, some relevant content of the root sequence is first introduced. In the following introduction, the root sequence is taken as an example of a ZC sequence.

[0093] Different cyclic shifts (CS) of the root sequence can be used to create a zero correlation zone. This zone is defined as the region where the correlation function is zero within the maximum round-trip delay range when there is no Doppler shift. In this zone, the cyclic shift autocorrelation of the ZC root sequence is zero.

[0094] For example, for a ZC root sequence, a cyclic shift sequence with a correlation function equal to zero can be obtained by cyclically shifting the ZC root sequence. The correlation function of any two sequences in the cyclic shift sequence is equal to zero. 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 is the zero correlation zone or the maximum round trip delay, k is the cyclic shift index, Operator Indicates rounding down. ZC sequence In the delay domain, shift multiplexing forms a zero correlation zone.

[0096] When there is a Doppler frequency shift, s u，k The fuzzy function of (n) will have multiple peaks. The fuzzy function A(τ,v) satisfies formula (2)

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

[0098] In order to improve the ability of the ZC sequence to combat Doppler frequency offset, the cyclic shift of the ZC root sequence is further restricted in the LTE and NR protocols to limit the different cyclic shifts of the root sequence to the zero ambiguity zone. The zero ambiguity zone means that the value of the ambiguity function is equal to zero within the maximum round-trip delay interval and the maximum Doppler frequency shift interval. It can be understood that the maximum round-trip delay is related to the location of the terminal device, and the maximum Doppler frequency shift is related to the moving speed of the terminal device. Within a certain cell radius, if the moving speed of the terminal meets the maximum Doppler frequency shift limit, the mutual interference between any two sequences in the cyclic shift sequence is minimized, or, it is said that the mutual interference between any two sequences is equal to zero.

[0099] For a ZC root sequence, by further restricting the cyclic shift of the ZC root sequence, a cyclic shift sequence with an ambiguity function equal to zero can be obtained, and the ambiguity function of any two sequences in the cyclic shift sequence is equal to zero. u,k (n) satisfies the following formula (3):

[0100] In formula (3), C k Represents the cyclic shift of the root sequence. The meanings of the other parameters refer to formula (1).

[0101] In Release 8 (Rel-8), Restricted Sets Type A was introduced to protect against frequency deviations of ±1 subcarrier spacing, with the number of available cyclic shifts not exceeding 1 / 3 of that in the unrestricted set. In Release 14 (Rel-14), Restricted Sets Type B was introduced to protect against frequency deviations of ±2 subcarrier spacing, with the number of available cyclic shifts not exceeding 1 / 5 of that in the unrestricted set.

[0102] A random access preamble set for a cell is obtained by cyclically shifting the ZC root sequence, or the random access preamble set is formed by cyclic shifts of one or more root sequences. A random access preamble may also be referred to as a random access preamble, access preamble, random access sequence, or access sequence. A terminal device may 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 send the random access preamble to the network device on a physical random access channel.

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

[0104] A sorting rule for root serial numbers is:

[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., the first cubic metric). The cubic metrics of the physical root sequences indicated by all physical root sequence numbers in the low cubic metric group do not exceed the first cubic metric, and the cubic metrics of the physical root sequences indicated by all physical root sequence numbers in the high cubic metric group do not exceed the first cubic metric. The cubic metric CM reflects the degree of signal power fluctuation over time. Optionally, the CM satisfies: Here, 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 using 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 a quadrature phase shift keying (QPSK) signal.

[0107] 2) For low cubic metric groups or high cubic metric groups, the maximum cell radius supported by the root sequence in the group against ±1 subcarrier frequency offset The teams are divided into 16 groups, including:

[0108] 3) Arrange in cubic metric order within the group: for the low cubic metric group, the cubic metrics of the odd-numbered groups are arranged in descending order, and the cubic metrics of the even-numbered groups are arranged in ascending order; for the high cubic metric group, the cubic metrics of the odd-numbered groups are arranged in ascending order, and the cubic metrics of the even-numbered groups are arranged in descending order. It can also be understood as: 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, and 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, and the cubic metrics of the first physical root sequence number set are arranged in ascending order. Among them, the first physical root sequence number set in the high cubic metric group is the last physical root sequence number set in the low cubic metric group.

[0109] According to the above-mentioned sorting rules, a root sequence sorted in sequence is obtained. By setting a logical root sequence number for the sorted root sequence or consecutively numbering the sorted root sequence starting from 0, the relationship between the logical root sequence number and the physical root sequence number as shown in Table 1 can be obtained. It can be understood that the physical root sequence number in Table 1 is the actual number of the root sequence. The logical root sequence number can represent the position of the physical root sequence number corresponding to the logical 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. The network device or terminal device 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, and then perform a cyclic shift on the physical root sequence to obtain a random access preamble code.

[0110] Table 1

[0111] In Table 1, for the low cubic metric group or the high cubic metric group, the root sequences within the group are divided based on the maximum cell radius supported against ±1 subcarrier frequency offset to obtain multiple physical root sequence number sets, so that the maximum cell radius, cubic metric, and maximum mobile speed supported by the root sequence numbers in the same physical root sequence number set are the same. However, the protocol supports dividing the root sequences within the low cubic metric group or the high cubic metric group based on the maximum cell radius supported against multiple subcarrier frequency offsets, which results in the root sequence numbers in the same physical root sequence number set supporting the same maximum cell radius and cubic metric, but supporting multiple different maximum mobile speeds. In other words, the maximum round-trip delay interval and cubic metric corresponding to the root sequence numbers in the same physical root sequence number set are the same, but correspond to multiple different maximum Doppler frequency shift intervals. For high-speed mobile scenarios, it is inevitable that the maximum mobile speed will jump between adjacent sequences, resulting in unusable root sequences in a physical root sequence number set and low sequence utilization.

[0112] In order to solve the above technical problems, a solution of an embodiment of the present application is provided. In an embodiment of the present application, multiple consecutive physical root sequence numbers in all physical root sequences correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler frequency shift interval. Multiple consecutive physical root sequence numbers in all physical root sequences can be regarded as a physical root sequence number set or a group of physical root sequence numbers. From this perspective, multiple consecutive physical root sequence numbers in all physical root sequences correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler frequency shift interval, which can be replaced by: the root sequence numbers in any physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler frequency shift interval. In this way, even if the terminal device moves at high speed, the maximum moving speed will not jump in adjacent sequences, so that all physical root sequences in a physical root sequence set can be used by the terminal device, which can improve sequence utilization. In an embodiment of the present application, the root sequence numbers in a physical root sequence number set respectively correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler frequency shift interval. It can be understood that the root sequence numbers in a physical root sequence number set respectively support the same maximum cell radius, the same cubic metric, and the same maximum moving speed.

[0113] In order to make the root sequence numbers in a physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip delay interval and the same maximum Doppler frequency shift interval, the present application provides a physical root sequence number sorting method, according to which all physical root sequence numbers are sorted, and a logical root sequence number is set for each sorted physical root sequence number, so as to obtain a mapping relationship between the logical root sequence number and the physical root sequence number. The logical root sequence number is the position index of the corresponding physical root sequence number among all physical root sequence numbers. In the mapping relationship, the root sequence numbers in any physical root sequence number set correspond to the same cubic metric interval, the same maximum round-trip delay interval and the same maximum Doppler frequency shift interval. Unless otherwise specified, in the embodiments of the present application, the concepts of "set" and "group" are the same and the two are interchangeable.

[0114] The following first introduces the physical root sequence number sorting method provided by the embodiment of the present 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 division rules:

[0115] 1) All physical root sequence numbers are divided into low cubic metric and high cubic metric groups using the first cubic metric as a boundary, wherein the cubic metrics of the physical root sequences indicated by all physical root sequence numbers in the low cubic metric group do not exceed the first cubic metric, and the cubic metrics of the physical root sequences indicated by all physical root sequence numbers in the high cubic metric group exceed 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. The embodiment of the present application does not limit the coding and modulation scheme corresponding to the first cubic metric. In 1), the division of all physical root sequence numbers into a low cubic metric group and a high cubic metric group (i.e., two cubic metric groups) using the first cubic metric as a boundary is taken as an example. The embodiment of the present application does not limit the specific number of cubic metric groups into which all physical root sequence numbers are divided. For example, all physical root sequence numbers can be divided into three cubic metric groups based on two cubic metrics as a boundary. The three cubic metric groups may be: a low cubic metric group, a medium cubic metric group, and a high cubic metric group.

[0116] 2) Each cubic metric group divides all physical root sequence numbers within the group into multiple physical root sequence number sets based on the maximum round-trip delay and maximum Doppler shift. For example, 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 based on the maximum round-trip delay and maximum Doppler shift.

[0117] 3) The physical root sequence numbers within each of the multiple physical root sequence number sets are sorted 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] 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. Alternatively, for the low cubic metric group, the cubic metrics of the odd-numbered groups are arranged in descending order, and the cubic metrics of the even-numbered groups are arranged in ascending order; for the high cubic metric group, the cubic metrics of the odd-numbered groups are arranged in ascending order, and the cubic metrics of the even-numbered groups are arranged in descending order.

[0119] Furthermore, for the low and high cubic metric groups, all physical root sequence numbers within the group are divided into multiple physical root sequence number sets based on the maximum round-trip delay and maximum Doppler shift. Compared to the division of all physical root sequence numbers within the group into multiple physical root sequence number sets based on the most supported maximum cell radius in Table 1 above, this allows the root sequence numbers within any physical root sequence number set to correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval.

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

[0121] As mentioned above, when there is a Doppler frequency offset, the ambiguity function of the physical root sequence will have multiple peaks, that is, the ambiguity function of the physical root sequence has multiple peaks. To reduce interference, the candidate peaks of the ambiguity function of the physical root sequence can be determined first. The peaks of the ambiguity function correspond to the delay domain dimension and the Doppler domain dimension. Then, the peaks of the ambiguity function are mapped to the delay-Doppler coordinate system, and the peaks of the ambiguity function are a point in the delay-Doppler coordinate system. Accordingly, the candidate peaks of the ambiguity function of the physical root sequence are also called candidate peak points of the ambiguity function in the delay-Doppler coordinate system. The horizontal axis in the delay-Doppler coordinate system indicates the delay domain, and the vertical axis in the delay-Doppler coordinate system indicates the Doppler domain.

[0122] In an embodiment of the present application, among all peak points of the ambiguity function of any physical root sequence (e.g., the first physical root sequence) in a given area, if the delay spacing and Doppler spacing between the peak point and the coordinate origin are not simultaneously greater than the delay spacing and Doppler spacing between the ambiguity function and any other peak point other than the coordinate origin on a two-dimensional plane and the coordinate origin, then the peak point is a candidate peak point. In other words, in the delay-Doppler coordinate system, the delay spacing between the candidate peak point of the ambiguity function of the first physical root sequence and the coordinate origin in the delay-Doppler coordinate system is not greater than the delay spacing between any other peak point other than the coordinate origin and the coordinate origin. Alternatively, the Doppler spacing between the candidate peak point of the ambiguity function of the first physical root sequence and the coordinate origin in the delay-Doppler coordinate system is not greater than the Doppler spacing between the other arbitrary peak points and the coordinate origin. Alternatively, the delay spacing between the candidate peak point of the ambiguity function of the first physical root sequence and the coordinate origin in the delay-Doppler coordinate system is not greater than the delay spacing between any other peak point except the coordinate origin and the coordinate origin, and the Doppler spacing between the candidate peak point of the ambiguity function of the first physical root sequence and the coordinate origin in the delay-Doppler coordinate system is not greater than the Doppler spacing between the other arbitrary peak points and the coordinate origin. It can be understood that the final peak point corresponding to the root sequence is determined from the candidate peak points. According to the method of determining the candidate peak points in accordance with the embodiment of the present application, the root sequence corresponding to the peak point finally selected can correspond to a larger maximum round-trip delay interval and / or a larger maximum Doppler frequency shift interval as much as possible, that is, the maximum cell radius and / or maximum moving speed supported by the root sequence corresponding to the peak point finally selected is as large as possible.

[0123] For example, the set of candidate peak point coordinates of the fuzzy function is Among them, τ i A set of candidate peak point coordinates representing the fuzzy function The delay coordinate of the i-th candidate peak point in v i A set of candidate peak point coordinates representing the fuzzy function The Doppler coordinates of the i-th candidate peak point in, The operator |·| represents the potential of a set. Taking the first physical root sequence as an example, the set of candidate peak point coordinates of the fuzzy function of the first physical root sequence is satisfy: N represents the length of the first physical root sequence, and u represents the first physical root sequence number. In ±uτ mod N, the sign-negation operation is performed first, followed by the modulo operation; in ±un mod N, the sign-negation operation is performed first, followed by the modulo operation.

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

[0125] In order to improve the ability of the ZC sequence to resist Doppler frequency deviation, it is necessary to ensure that the value of the ambiguity function does not exceed the preset threshold within the maximum round-trip delay interval and the maximum Doppler frequency shift interval, or even the ambiguity function is equal to zero. To this end, after determining the candidate peak point set of the ambiguity function of the first physical root sequence number, the candidate maximum zero ambiguity zone corresponding to each candidate peak point set can be determined. The maximum cell radius supported by the candidate maximum zero ambiguity zone corresponds to the delay interval between the candidate peak point and the coordinate origin, and the maximum moving speed supported in the candidate maximum zero ambiguity zone corresponds to the Doppler distance between the candidate peak point and the coordinate origin. In other words, the maximum cell radius corresponds to the maximum round-trip delay interval, and the maximum moving speed corresponds to the maximum Doppler frequency shift interval. From this perspective, determining the candidate maximum zero ambiguity zone corresponding to each candidate peak point set means determining the candidate maximum round-trip 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 delay interval and the candidate maximum Doppler shift interval. The coordinates of the i-th candidate peak point in <τ i ,v i >For example, assume that the set of candidate physical root serial numbers for i is but Corresponding maximum round-trip delay range and the maximum Doppler shift interval satisfy:

[0127] Among them, [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 ,+∞) represents the K maximum round trip delay intervals preset by 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 by 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 continue to refer to Figure 2. The delay-Doppler domain coordinate system shown in Figure 2 is divided into 8 intervals in the delay domain, namely [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and is divided into 8 intervals in the Doppler domain, namely [0,3), [3,5), [5,7), [7,9), [9,11), [11,13), [13,15), [15,+∞). For the candidate peak point set Accordingly, the candidate physical root sequence number set

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

[0130] In the embodiment of the present application, the maximum cell radius and maximum mobile speed supported in the candidate maximum zero ambiguity zone can be mapped to the delay-Doppler coordinate system, and the physical root sequence numbers in each candidate physical root sequence number set can be sorted according to specific rules. All sorted physical root sequence numbers can ensure that the maximum cell radius and maximum mobile speed supported between adjacent physical root sequence number sets do not jump. For example, after sorting the candidate physical root sequence number set in the candidate maximum zero ambiguity zone, the maximum cell radius and maximum mobile speed supported by the candidate physical root sequence number set are obtained. The group of candidates for the maximum zero ambiguity zone that is farthest from the coordinate origin in the delay domain and / or Doppler domain and is mapped to the farthest end can be selected as the maximum zero ambiguity zone. Maps to the group's location.

[0131] The embodiment of the present application does not restrict the sorting rules used for sorting all physical root sequence numbers, as long as the maximum cell radius and maximum moving speed supported between adjacent physical root sequence number sets do not jump among all the sorted physical root sequence numbers. The following introduces several possible sorting rules and how to determine the physical root sequence number set based on the candidate physical root sequence number set under each arrangement rule. In the following introduction, the existence of K maximum round-trip delay intervals and L maximum Doppler shift intervals, and K=L is taken as an example. It can be understood that there are a total of K×L physical root sequence number sets.

[0132] Rule 1: When the number of maximum round-trip delay intervals, K, and the number of maximum Doppler shift intervals, L, are equal, each physical root sequence number is mapped to a corresponding physical root sequence number set, with the maximum round-trip delay and the maximum Doppler shift increasing synchronously or alternately, initially increasing with the maximum round-trip delay. The 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}; 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 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 delay-Doppler domain coordinate system. Figure 3 takes the sequence length N = 139 and the root sequence number u = 11 as an example. In Figure 3, the delay-Doppler domain coordinate system is divided into 8 intervals in the delay domain, which are [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and is divided into 8 intervals in the Doppler domain, which are [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 each physical root sequence number set according to the first rule, and the sorted

[0134] Under the first rule, the physical root sequence number set is determined based on each candidate physical root sequence number set, including: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are an even number, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, k i The largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set. Using the example of Figure 3, the Δ T,5 ×Δ F,5 =25×3, and finally mapped to the interval [15,+∞)×[3,5).

[0135] It can be understood that, by obtaining all sorted physical root sequence numbers according to the first rule, setting logical root sequence numbers for all sorted physical root sequence numbers or consecutively numbering all sorted physical root sequence numbers starting from 0, a mapping relationship between logical root sequence numbers and physical root sequence numbers can be obtained. Among them, 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 that the sequence length N = 13, the maximum round-trip delay 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 can be shown in Table 2. It should be noted that Table 2 is only an example.

[0136] Table 2

[0137] Rule 2: When the number of maximum round-trip delay 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, using the rule that the maximum round-trip delay and maximum Doppler shift increase synchronously or alternately, with the maximum Doppler shift increasing initially. In other words, the 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}; 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 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 delay-Doppler domain coordinate system. Figure 4 takes the sequence length N = 139 and the root sequence number u = 11 as an example. In Figure 4, the delay-Doppler domain coordinate system is divided into 8 intervals in the delay domain, which are [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and is divided into 8 intervals in the Doppler domain, which are [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 each physical root sequence number set according to the second rule.

[0139] Under the second rule, based on each candidate physical root sequence number set, a physical root sequence number set is determined, including: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are an even number, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, then l i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, ki The largest i is determined as the physical root sequence number set. Using the example of Figure 4, the Δ T,5 ×Δ F,5 =38×1, and finally mapped to the interval [15,+∞)×[0,3).

[0140] Similar to the mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the first rule, the mapping relationship between the logical root sequence number and the physical root sequence number can also be obtained based on the second rule. For example, assuming the sequence length N = 13, the maximum round-trip delay 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 may be shown in Table 3. It should be noted that Table 3 is only an example.

[0141] Table 3

[0142] Rule 3: Map each physical root sequence number to its corresponding physical root sequence number set based on the monotonically increasing maximum round-trip delay. This is done to maximize compatibility with existing protocol sorting rules, simplify implementation, and reduce processing complexity. In other words, the 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; 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 delay-Doppler domain coordinate system. Figure 5 takes the sequence length N = 139 and the root sequence number u = 11 as an example. In Figure 5, the delay-Doppler domain coordinate system is divided into 8 intervals in the delay domain, which are [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and is divided into 8 intervals in the Doppler domain, which are [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 each physical root sequence number set according to the third rule.

[0144] Under the third rule, based on each candidate physical root sequence number set, determining the physical root sequence number set includes: Select k from the set of candidate physical root sequence numbers i The largest i is used as the physical root sequence number set; when k of multiple candidate physical root sequence number sets i The same and even number, l i The largest i is determined as the physical root sequence number set; or, when the k of multiple candidate physical root sequence number sets i The same and odd number, l i The smallest i is determined as the physical root sequence number set. Using the example of Figure 5, the Δ T,5 ×Δ F,5 =38×1, and finally mapped to the interval [15,+∞)×[0,3).

[0145] Similar to the mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the first rule, the mapping relationship between the logical root sequence number and the physical root sequence number can also be obtained based on the third rule. For example, assuming the sequence length N = 13, the maximum round-trip delay 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 can be shown in Table 4. It should be noted that Table 4 is only an example.

[0146] Table 4

[0147] Rule 4: Map each physical root sequence number to its corresponding physical root sequence number set using the monotonically increasing maximum Doppler shift. This simplifies implementation and reduces processing complexity. In other words, the order of multiple physical root sequence number sets satisfies the following requirements: The K × L physical root sequence number sets are sorted from smallest to largest by l; when l is the same and even, k is sorted from smallest to largest; or, when l is the same and odd, k is sorted from largest to smallest.

[0148] For ease of understanding, please refer to Figure 6, which shows a schematic diagram of mapping the ZC root sequence to the delay-Doppler domain coordinate system. Figure 6 takes the sequence length N = 139 and the root sequence number u = 11 as an example. In Figure 6, the delay-Doppler domain coordinate system is divided into 8 intervals in the delay domain, which are [0,2), [2,4), [4,6), [6,8), [8,10), [10,12), [12,15), [15,+∞); and is divided into 8 intervals in the Doppler domain, which are [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 each physical root sequence number set according to the fourth rule.

[0149] Under the fourth rule, based on each candidate physical root sequence number set, determining the physical root sequence number set includes: Select l from the set of candidate physical root sequence numbers i The largest i is used as the physical root sequence number set; when the l of multiple candidate physical root sequence number sets i The same and even number, k i The largest i is determined as the physical root sequence number set; or, when the l of multiple candidate physical root sequence number sets is i The same and odd number, k i The smallest i is determined as the physical root sequence number set. Using the example of Figure 6, the Δ T,5 ×Δ F,5 =1×11, and finally mapped to the interval [0,2)×[11,13).

[0150] Similar to the mapping relationship between the logical root sequence number and the physical root sequence number obtained based on the first rule, the mapping relationship between the logical root sequence number and the physical root sequence number can also be obtained based on the fourth rule. For example, assuming the sequence length N = 13, the maximum round-trip delay 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 may be shown in Table 5. It should be noted that Table 5 is only an example.

[0151] Table 5

[0152] Any of the above rules (1-4) ensures that multiple consecutive root sequence numbers within all physical root sequence numbers correspond to the same cubic metric range, the same maximum round-trip delay range, and the same maximum Doppler shift range. This ensures that all physical root sequence numbers within a set are usable, even in high-speed mobility scenarios, thereby improving sequence utilization.

[0153] The terminal device can determine the physical root sequence to be used for initiating random access based on the mapping relationship between the logical root sequence number and the physical root sequence number. Correspondingly, the network device can determine the physical root sequence to be used for initiating random access based on the mapping relationship between the logical root sequence number and the physical root sequence number.

[0154] Please refer to Figure 7, which exemplifies a flow chart of a communication method 700 provided in an embodiment of the present 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 performed by the network device can be implemented by the RAN device itself, or by components in the RAN device (such as a control board (chip), a baseband chip, or other processing units or processor modules). For example, the network device can be 110a or 110b in 1, or it can also be the chip (system) in 110a or 110b in Figure 1. The steps performed by the terminal device can be implemented by the terminal device itself, or by components in the terminal device (such as a chip, a processing unit, or a processor module). The terminal device can be any terminal device from 120a to 120j as shown in Figure 1, or it can also be a chip (system) in any terminal device from 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 a first physical root sequence according to a first logical root sequence number and a mapping relationship between the logical root sequence number and the physical root sequence number.

[0156] In an embodiment of the present application, in the mapping relationship between the logical root sequence number and the physical root sequence number, the root sequences in any physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. For example, the root sequences in the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. The first physical root sequence can be a physical root sequence in the first physical root sequence set. This mapping relationship is obtained according to any rule from the first rule to the fourth rule mentioned above. For details, please refer to the relevant content mentioned above and will not be repeated here. For example, the mapping relationship between the logical root sequence number and the physical root sequence number can be the aforementioned Table 2, Table 3, Table 4 or Table 5. It can be understood that the aforementioned Table 2, Table 3, Table 4 or Table 5 are only for illustration.

[0157] When a terminal device initiates a reference signal, it may determine a physical root sequence (i.e., the first physical root sequence herein) used to generate the reference signal. For example, the terminal device may determine a first physical root sequence number corresponding to the first logical root sequence number based on the first logical root sequence number of the cell and a mapping relationship between the logical root sequence number and the physical root sequence number. The first physical root sequence number indicates the first physical root sequence.

[0158] It is understood that before S701, the terminal device may determine the first logical root sequence number. In one implementation, the first logical root sequence number may 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, and the indication information may indicate the first logical root sequence number.

[0159] S702: The terminal device sends a first sequence, where the first sequence is determined according to a first physical root sequence.

[0160] Accordingly, the network device receives a first sequence. The first sequence may be a random access preamble or a reference signal sequence. The terminal device determines a first physical root sequence and may perform a cyclic shift or other operation on the first physical root sequence to obtain the first sequence. After obtaining the first sequence, the terminal device sends the first sequence to the network device.

[0161] S703: The network device determines a first sequence according to the first logical root sequence number and a mapping relationship between the logical root sequence number and the physical root sequence number.

[0162] After receiving the first sequence, the network device may determine the content of the first sequence according to the first logical root sequence number and the mapping relationship between the logical root sequence number and the physical root sequence number to respond to the first sequence.

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

[0164] The embodiments provided above respectively introduce the methods provided by the embodiments of the present application from the perspective of the interaction between the terminal device and the network device. Among them, the steps performed by the terminal device can be implemented by different functional entities that constitute the terminal device. The steps performed by the network device can be implemented by different functional entities that constitute the network device. For example, the network device can be a CU-DU architecture, the CU can generate indication information, and the DU can send indication information. In order to implement the various functions in the methods provided by the above embodiments of the present application, the terminal device and the network device may include a hardware structure and / or a software module to implement the above functions in the form of a hardware structure, a software module, or a hardware structure plus a software module. Whether one of the above functions is executed in the form of a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraints of the technical solution.

[0165] The following describes the communication device used to implement the above method in the embodiment of the present application with reference to the accompanying drawings. Therefore, the above contents can be used in subsequent embodiments, and repeated contents will not be repeated.

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

[0167] In one possible implementation, the 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 (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 may implement or execute the 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 computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like. The transceiver module 820 is a transceiver, an interface circuit, a bus, a pin, or other possible communication interface for receiving signals from other devices. For example, when the device is implemented in the form of a chip, the 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 implement the behaviors and functions of the terminal device in the above-mentioned method embodiments. The communication device 800 can be a terminal device, or a component (such as a chip or circuit) used in a terminal device, or a chip or chipset in the terminal device, or a part of a chip used to perform the functions of the relevant method, or a software module capable of implementing the method performed by the terminal device in the above-mentioned method (such as any method in the communication method 700), without limitation.

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

[0170] In one implementation, the processing module 810 is configured to determine a first physical root sequence based on a first logical root sequence number and a mapping relationship between the logical root sequence number and the physical root sequence number. The transceiver module 820 is configured to transmit a first sequence, where the first sequence is determined based on the first physical root sequence, and the first physical root sequence 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 delay interval, and the same maximum Doppler shift interval.

[0171] In another implementation, processing module 810 may be configured to sort all physical root sequence numbers, set a logical root sequence number for each sorted physical root sequence number, and obtain a mapping relationship between the logical root sequence number and the physical root sequence number. Multiple consecutive physical root sequence numbers among all physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval. 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 optional implementation, the transceiver module 820 is further configured to: receive indication information, where the indication information indicates a first logical root sequence number, where the first logical root sequence number is used to indicate a sequence number of the first physical root sequence.

[0173] In an optional implementation, all physical root sequence numbers are divided into multiple physical root sequence number sets, and the multiple physical root sequence number sets are obtained according to the following division rules:

[0174] Dividing all the physical root sequence numbers into a low cubic metric group and a high cubic metric group based on a first cubic metric, wherein the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the low cubic metric group do not exceed the first cubic metric, and the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the high cubic metric group exceed the first cubic metric;

[0175] For the low cubic metric group and the high cubic metric group, all physical root sequence numbers in the group are divided into multiple physical root sequence number sets based on the maximum round-trip delay and the maximum Doppler shift;

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

[0177] In an optional implementation, the physical root sequence numbers in each physical root sequence number set in 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, the cubic metric is alternately arranged in ascending and descending order, and the cubic metric of the last physical root sequence number set is arranged in ascending order; for the high cubic metric group, starting from the first physical root sequence number set, the cubic metric is alternately arranged in ascending and descending order, and the cubic metric of the first physical root sequence number set is arranged in ascending order.

[0178] In an optional implementation, the processing module 810 is further configured to determine candidate peak points of the ambiguity function of the physical root sequence corresponding to each physical root sequence number. In the Delay-Doppler coordinate system, the candidate peak points satisfy the following conditions: the delay spacing between the candidate peak point and the coordinate origin of the Delay-Doppler coordinate system is not greater than the delay spacing between any other peak point other than the coordinate origin and the coordinate origin; and / or the Doppler spacing between the candidate peak point and the coordinate origin of the Delay-Doppler coordinate system is not greater than the Doppler spacing between any other peak point other than the coordinate origin and the coordinate origin. The horizontal axis of the Delay-Doppler coordinate system indicates the delay domain, and the vertical axis indicates the Doppler domain.

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

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

[0181] In an optional implementation, the processing module 810 is further configured to: The coordinates of the i-th candidate peak point in <τ i ,v i >, determine the i-th candidate physical root sequence number set According to 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}. Corresponding maximum round-trip delay range and the maximum Doppler shift interval satisfy:

[0182] [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,Kx1,+∞) represents the K maximum round-trip delay intervals preset by 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 by the physical root sequence number set, 0≤k i ≤K-1, 0≤l i ≤L-1,

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

[0184] Optionally, the processing module 810 is specifically configured to: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are an even number, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, k i The largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set.

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

[0186] Optionally, the processing module 810 is specifically configured to: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are even, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, k i The largest i is determined as the physical root sequence number set.

[0187] In an optional implementation, the arrangement order of multiple physical root sequence number sets satisfies: K×L physical root sequence number sets are sorted from small to large according to k; when k is the same and an even number, l is sorted from small to large; or, when k is the same and an odd number, l is sorted from large to small.

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

[0189] In an optional implementation, the arrangement order of multiple physical root sequence number sets satisfies: K×L physical root sequence number sets are sorted from small to large according to l; when l is the same and an even number, k is sorted from small to large; or when l is the same and an odd number, k is sorted from large to small.

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

[0191] For another example, the communication device 800 implements the method executed by the network device in the embodiment of Figure 7. The transceiver module 820 can be used to execute S702 in the embodiment shown in Figure 7 and / or other processes for supporting the technology described herein; the processing module 810 can be used to execute S703 in the embodiment shown in Figure 7 and / or other processes for supporting the technology described herein.

[0192] [Corrected 22.11.2023 according to Rule 91] In one implementation, the transceiver module 820 is configured to receive a first sequence, which is determined based on a first physical root sequence. The processing module 810 is configured to determine the first sequence based on a first logical root sequence number and a mapping relationship between the logical root sequence number and the physical root sequence number. 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 delay interval, and the same maximum Doppler shift interval. In another implementation, the processing module 810 is configured to: sort all physical root sequence numbers, where a plurality of consecutive physical root sequence numbers among all the physical root sequence numbers correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval; set a logical root sequence number for each of the sorted physical root sequence numbers, and obtain a mapping relationship between the logical root sequence number and the physical root sequence number, wherein the logical root sequence number is an index of the position of the corresponding physical root sequence number among all the physical root sequence numbers.

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

[0194] In an optional implementation, all physical root sequence numbers are divided into multiple physical root sequence number sets, and the multiple physical root sequence number sets are obtained according to the following division rules:

[0195] Dividing all the physical root sequence numbers into a low cubic metric group and a high cubic metric group based on a first cubic metric, wherein the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the low cubic metric group do not exceed the first cubic metric, and the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the high cubic metric group exceed the first cubic metric;

[0196] For the low cubic metric group and the high cubic metric group, all physical root sequence numbers in the group are divided into multiple physical root sequence number sets based on the maximum round-trip delay and the maximum Doppler shift;

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

[0198] In an optional implementation, the physical root sequence numbers in each physical root sequence number set in 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, the cubic metric is alternately arranged in ascending and descending order, and the cubic metric of the last physical root sequence number set is arranged in ascending order; for the high cubic metric group, starting from the first physical root sequence number set, the cubic metric is alternately arranged in ascending and descending order, and the cubic metric of the first physical root sequence number set is arranged in ascending order.

[0199] In an optional implementation, the processing module 810 is further configured to determine candidate peak points of the ambiguity function of the physical root sequence corresponding to each physical root sequence number. In the Delay-Doppler coordinate system, the candidate peak points satisfy the following conditions: the delay spacing between the candidate peak point and the coordinate origin of the Delay-Doppler coordinate system is not greater than the delay spacing between any other peak point other than the coordinate origin and the coordinate origin; and / or the Doppler spacing between the candidate peak point and the coordinate origin of the Delay-Doppler coordinate system is not greater than the Doppler spacing between any other peak point other than the coordinate origin and the coordinate origin. The horizontal axis of the Delay-Doppler coordinate system indicates the delay domain, and the vertical axis indicates the Doppler domain.

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

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

[0202] In an optional implementation, the processing module 810 is further configured to: The coordinates of the i-th candidate peak point in <τ i ,v i >, determine the i-th candidate physical root sequence number set According to 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}. Corresponding maximum round-trip delay range and the maximum Doppler shift interval satisfy:

[0203] [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 ,+∞) represents the K maximum round trip delay intervals preset by 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 by the physical root sequence number set, 0≤k i ≤K-1, 0≤l i ≤L-1,

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

[0205] Optionally, the processing module 810 is specifically configured to: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are an even number, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, k i The largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set.

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

[0207] Optionally, the processing module 810 is specifically configured to: Select max{k i ,l i}The largest i is used as the physical root sequence number set; Among them, when the max{k i ,l i} are the same and are even, k iThe smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets is i Same, l i The largest i is determined as the physical root sequence number set; or, when the max{k i ,l i} are the same and are odd, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets is i Same, k i The largest i is determined as the physical root sequence number set.

[0208] In an optional implementation, the arrangement order of multiple physical root sequence number sets satisfies: K×L physical root sequence number sets are sorted from small to large according to k; when k is the same and an even number, l is sorted from small to large; or, when k is the same and an odd number, l is sorted from large to small.

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

[0210] In an optional implementation, the arrangement order of multiple physical root sequence number sets satisfies: K×L physical root sequence number sets are sorted from small to large according to l; when l is the same and an even number, k is sorted from small to large; or when l is the same and an odd number, k is sorted from large to small.

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

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

[0213] Figure 9 is a schematic block diagram of a communication device 900 provided in an embodiment of the present application. The communication device 900 can be a network device or a terminal device in the above-mentioned embodiment. For example, the communication device 900 can be the network device or terminal device in Figure 1; or the communication device 900 is a chip (system) in the network device or terminal device. In the embodiment of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices. For specific functions, please refer to the description in the above-mentioned method embodiment.

[0214] The communication device 900 includes one or more processors 901, which are used to implement or support the communication device 900 to implement the functions of the terminal device or network device in the method provided in the embodiment of the present application. Please refer to the detailed description in the method example for details, which will not be repeated here. The processor 901 can also be called a processing unit or processing module, which can implement certain control functions. The processor 901 can be a general-purpose processor or a dedicated processor. 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. 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 (such as a network device or 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 into one or more dedicated integrated circuits.

[0215] In one design, the processor 901 may include a program 903 (sometimes also referred to as code or instructions), which may be executed on the processor 901 to cause the communication device 900 to perform the methods described in the following embodiments. In another possible design, the communication device 900 includes circuitry (not shown in FIG9 ) configured to implement 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 on which a program 904 (sometimes also referred to as code or instructions) is stored. The program 904 can be run on the processor 901, so that the communication device 900 performs the method described in the above method embodiment, such as the process shown in one or more figures in Figure 7.

[0217] In one design, the processor 901 and / or the memory 902 may include an artificial intelligence (AI) module 907 and an AI module 908, each configured to implement AI-related functions. The AI ​​module may be implemented using software, hardware, or a combination of software and hardware. 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 a possible design, data may also be stored in the processor 901 and / or the memory 902. The processor and the memory may be provided 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 may also be sometimes referred to as a processing unit, and controls the communication device 900. The transceiver 905 may also be sometimes referred to as a transceiver unit, a transceiver, a transceiver circuit, or a transceiver, and is configured to implement the transceiver function 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, an 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 will be appreciated that in some embodiments, the communication device 900 may include more or fewer components, or some components may be integrated or 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 used in a terminal device (or network device), or other combined devices or components with the above terminal device (or network device). When the communication device is a terminal device (or network device), the transceiver module can be a transceiver, which can include an antenna and a radio frequency circuit, etc., and the processing module can be a processor, such as a CPU. When the communication device is a component with the functions of the above terminal device (or network device), 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 circuit. 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 a memory and can be read directly from the memory or read from the memory via another device) and transmit them to the processor; the processor can be used to execute the code instructions to perform the method in the above method embodiment. For example, the interface circuit can also be a signal transmission interface circuit between a communication processor and a transceiver.

[0222] The present 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 FIG. For details, please refer to the relevant description in the above method embodiment, which will not be repeated here.

[0223] An embodiment of the present application also provides a computer-readable storage medium, including instructions, which, when executed on a computer, enables the computer to execute the method executed by the terminal device or network device in Figure 7.

[0224] An embodiment of the present application also provides a computer program product, including instructions, which, when executed on a computer, enables the computer to execute the method executed by the terminal device or network device in Figure 7.

[0225] The embodiment of the present application provides a chip system, which includes a processor and may also include a memory, for implementing the functions of the terminal device or network device in the above method. The chip system can be composed of a chip or include a chip and other discrete devices.

[0226] To implement the functions of the communication device shown in Figures 8 and 9, embodiments of the present application further provide a chip including a processor for supporting the communication device in implementing the functions of the terminal device or network device described in the method embodiments. In one possible design, the chip is connected to or includes a memory, which is used to store computer programs, instructions, and data necessary for the communication device.

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

[0228] "When," "if," and "if" all imply that the device will take appropriate action under certain objective circumstances. They do not limit the timeframe, do not require the device to make a judgment, and do not imply any other limitations. Unless otherwise specified, "if" and "if" are interchangeable. "When" and "under the circumstances" are interchangeable. "When" and "if" are interchangeable.

[0229] For the number of nouns, unless otherwise specified, it means "singular or plural nouns", that is, "one or more". "Multiple" means two or more. In view of this, in the embodiments of the present application, "multiple" can also be understood as "at least two". "At least one" can be one or more, for example, at least one can be one, two or more. For example, including at least one means including one, two or more, and there is no limit on which ones are included. For example, including at least one of A, B and C, then the included ones can be 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 also similar. "At least one of the following items" or similar expressions refers 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 association relationship of associated objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character “ / ”, unless otherwise specified, generally indicates that the previous and next associated objects are in an “or” relationship.

[0230] Unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the order, timing, priority or importance of multiple objects, and the descriptions of "first" and "second" do not limit the objects to be different.

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

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

[0233] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned 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, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0235] The units described as separate components may or may not be physically separate, and 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 these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0236] If the functions are implemented in the form of 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 part that essentially contributes to the technical solution of the present application or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), RAM, disk or optical disk, and other media that can store program codes.

[0237] Obviously, those skilled in the art may make various modifications and variations to this application without departing from the scope of protection of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalents, this application is intended to include these modifications and variations.

Claims

1. A communication method, characterized in that: include: Determine a first physical root sequence number according to the first logical root sequence number and a mapping relationship between the logical root sequence number and the physical root sequence number; A first sequence is sent, where the first sequence is determined according to the first physical root sequence, where the first physical root sequence belongs to a first physical root sequence set, and where root sequences in the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval.

2. A communication method, characterized in that: include: receiving a first sequence, where the first sequence is determined according to a first physical root sequence, where the first physical root sequence belongs to a first physical root sequence set, where root sequences in the first physical root sequence set correspond to the same cubic metric interval, the same maximum round-trip delay interval, and the same maximum Doppler shift interval; The first sequence is determined according to a first logical root sequence number and a mapping relationship between the logical root sequence number and the physical root sequence number, where the first logical root sequence number indicates the first physical root sequence.

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

4. The method according to claim 1 or 2, characterized in that: The method further comprises: Sorting all physical root sequence numbers, wherein a plurality of consecutive physical root sequence numbers among all the physical root sequence numbers respectively correspond to the same cubic metric interval, the same maximum round trip delay interval, and the same maximum Doppler frequency shift interval; A logical root serial number is set for each of the sorted physical root serial numbers to obtain a mapping relationship between the logical root serial number and the physical root serial number, wherein the logical root serial number is a position index corresponding to the physical root serial number in all physical root serial numbers.

5. The method according to claim 3, characterized in that The method further comprises: Determine a first physical root sequence number according to the first logical root sequence number of the cell and the mapping relationship, where the first physical root sequence number indicates a first physical root sequence; A first sequence is sent, where the first sequence is generated according to a first physical root sequence.

6. The method according to claim 1, 3, 4 or 5, characterized in that: The method further comprises: Indication information is received, where the indication information indicates the first logical root sequence number, where the first logical root sequence number is used to indicate a sequence number of the first physical root sequence.

7. The method according to claim 2, 3 or 4, characterized in that: The method further comprises: Send indication information, where the indication information indicates the first logical root sequence number, where the first logical root sequence number is used to indicate the sequence number of the first physical root sequence.

8. The method according to any one of claims 1 to 7, characterized in that: The physical root sequence numbers are divided into a plurality of physical root sequence number sets, and the plurality of physical root sequence number sets are obtained according to the following division rule: Dividing all the physical root sequence numbers into a low cubic metric group and a high cubic metric group based on a first cubic metric, wherein the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the low cubic metric group do not exceed the first cubic metric, and the cubic metrics of the physical root sequences indicated by all the physical root sequence numbers in the high cubic metric group exceed the first cubic metric; For the low cubic metric group and the high cubic metric group, all physical root sequence numbers in the group are divided into multiple physical root sequence number sets based on the maximum round-trip delay and the maximum Doppler shift; The physical root sequence numbers in each physical root sequence number set of the plurality of physical root sequence number sets are arranged in a cubic metric order.

9. The method according to claim 8, characterized in that The physical root sequence numbers in each physical root sequence number set of the plurality of physical root sequence number sets are arranged in a cubic metric order, including: Firstly, the physical root sequence number set in the low cubic metric group is sorted, and then the physical root sequence number set in the high cubic metric group is sorted; wherein, For the low cubic metric group, starting from the last physical root sequence number set, the cubic metric is alternately arranged in ascending and descending order, wherein the cubic metric of the last physical root sequence number set is arranged in ascending order; For the high cubic metric group, starting from the first physical root sequence number set, the cubic metric is alternately arranged in ascending and descending order, wherein the cubic metric of the first physical root sequence number set is arranged in ascending order.

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

11. The method according to claim 10, characterized in that The set of candidate peak point coordinates of the fuzzy function satisfy: Wherein, N represents the sequence length of the first physical root sequence, u represents the first physical root sequence number, τ i A set of candidate peak point coordinates representing the fuzzy function The time delay coordinate of the i-th candidate peak point in i A set of candidate peak point coordinates representing the fuzzy function The Doppler coordinate of the i-th candidate peak point in the range of i is The operator |·| represents the cardinality of a set.

12. The method according to claim 11, characterized in that The method further comprises: According to the collection The coordinates of the i-th candidate peak point in <τ i ,v i >, determine the i-th candidate physical root sequence number set Said The corresponding maximum round-trip delay range and the maximum Doppler shift interval satisfy: Among them, [Δ T,0 ,Δ T,1 ),[Δ T,1 ,Δ T,2 ),…,[Δ T,K-1 ,+∞) represents the K maximum round-trip delay intervals preset by 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 by the physical root sequence number set, 0≤k i ≤K-1,0≤l i ≤L-1, According to 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 according to claim 12, characterized in that: When the maximum number of round-trip delay intervals K and the maximum number of 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 from small to large according to max{k,l}; among them, When max{k,l} are the same and even, k is sorted from small to large, and for any k, l is sorted from large to small; or, When max{k,l} are the same and odd, l is sorted from small to large, and for any l, k is sorted from large to small.

14. The method according to claim 13, characterized in that According to each candidate physical root sequence number set, a physical root sequence number set is determined, including: from Select max{k i ,l i }The largest i is used as the physical root sequence number set; among them, When the max{k i ,l i } are the same and are even, i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets i Same, k i The largest i is determined as the set of physical root sequence numbers; or, When the max{k i ,l i } are the same and are odd, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets i Same, l i The largest i is determined as the physical root sequence number set.

15. The method according to claim 12, characterized in that: When the maximum number of round-trip delay intervals K and the maximum number of 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 from small to large according to max{k,l}; among them, When max{k,l} are the same and even, l is sorted from small to large, and for any l, k is sorted from large to small; or, When max{k,l} are the same and odd, k is sorted from small to large, and for any k, l is sorted from large to small.

16. The method according to claim 15, characterized in that According to each candidate physical root sequence number set, a physical root sequence number set is determined, including: from Select max{k i ,l i }The largest i is used as the physical root sequence number set; among them, When the max{k i ,l i } are the same and are even, k i The smallest i is determined as the physical root sequence number set. If the k of multiple candidate physical root sequence number sets i Same, l i The largest i is determined as the set of physical root sequence numbers; or, When the max{k i ,l i } are the same and are odd, and l i The smallest i is determined as the physical root sequence number set. If the l of multiple candidate physical root sequence number sets i Same, k i The largest i is determined as the physical root sequence number set.

17. The method according to claim 12, characterized in that: The arrangement order of the multiple physical root sequence number sets satisfies: The K×L physical root sequence number sets are sorted from small to large according to k; among them, When k is the same and even, l is sorted from small to large; or, When k is the same and an odd number, l is sorted from large to small.

18. The method according to claim 17, characterized in that According to each candidate physical root sequence number set, a 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 used as the physical root sequence number set; among them, When k of multiple candidate physical root sequence number sets i The same and even number, l i The largest i is determined as the set of physical root sequence numbers; or, When k of multiple candidate physical root sequence number sets i The same and odd, l i The smallest i is determined as the physical root sequence number set.

19. The method of claim 12, wherein: The arrangement order of the multiple physical root sequence number sets satisfies: The K×L physical root sequence number sets are sorted from small to large according to l; among them, When l is the same and even, k is sorted from small to large; or, When l is the same and an odd number, k is sorted from large to small.

20. The method of claim 19, wherein: According to each candidate physical root sequence number set, a 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 used as the physical root sequence number set; among them, When multiple candidate physical root sequence number sets are l i The same and even number, k i The largest i is determined as the set of physical root sequence numbers; or, When multiple candidate physical root sequence number sets are l i The same and odd number, k i The smallest i is determined as the physical root sequence number set.

21. A communication device, characterized in that: The communication device comprises a processing unit and a transceiver unit, wherein the processing unit is coupled to the transceiver unit to execute the method according to any one of claims 1 to 20.

22. A communication device, characterized in that: The communication device comprises a processor and a memory, wherein the memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the communication device executes the method according to 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, and when the computer program is executed on a computer, the computer is enabled to execute the method according to any one of claims 1 to 20.

24. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is run on a computer, the computer is caused to execute the method according to any one of claims 1 to 20.

25. A chip system, characterized in that: The chip system comprises: A processor and an interface, wherein the processor is used to call and run instructions from the interface, and when the processor executes the instructions, the method according to any one of claims 1 to 20 is implemented.

Images