Sequence transmission method and device

Abstract

The invention discloses a sequence transmission method and device, which can improve sensing or detection performance. The method comprises: a transmitting end device determines N first sequences, the nth first sequence in the N first sequences being determined according to the nth second sequence in N second sequences, and the nth second sequence being determined according to the nth element in a first extended sequence. Wherein n is equal to 0, 1,..., N-1, and N is a positive integer greater than 1. A first solution of the equal power sum can be determined according to the first extension sequence, and the degree of the first solution of the equal power sum is larger than or equal to 1. The sending end device sends N1 first sequences in the N first sequences, each second sequence in N1 second sequences corresponding to the N1 first sequences is one sequence in Gray Complementary Pairs (GCP), and N1 is smaller than or equal to N. And the receiving end device receives the transmitted first signal of the N1 first sequences, and processes the first signal according to the N1 first sequences or the N1 second sequences corresponding to the N1 first sequences.

Description

A sequence transmission method and device Technical Field

[0001] The embodiments of the present application relate to the field of communications, and in particular to a sequence transmission method and apparatus. Background Art

[0002] In downlink synchronization, random access, perception, radar, or communication-perception integration systems, it is usually necessary to acquire, perceive (or detect) the position and / or speed of a target object.

[0003] Currently, a transmitting device can transmit a time-domain signal generated based on multiple sequences (referred to as a sequence train). After the time-domain signal is transmitted and received by a receiving device, the receiving device can perform detection based on the received signal. Alternatively, the time-domain signal can be reflected by a target to generate an echo signal, which the transmitting device can receive and perform detection based on. For example, the receiving or transmitting device can calculate an ambiguity function corresponding to the received signal and detect the position and / or velocity of the target object based on the ambiguity function.

[0004] However, there is still room for improvement in the detection performance of the currently designed time domain signals generated based on multiple sequences.

[0005] Summary of the Invention

[0006] The present application provides a sequence transmission method and apparatus, which can improve the performance of sequence-based detection.

[0007] In a first aspect, a sequence transmission method is provided. The method can be performed by a transmitting device, or by a component of the transmitting device, such as a processor, chip, or chip system of the transmitting device. It can also be implemented by a logic module or software that implements all or part of the functions of the transmitting device. The method includes: determining N first sequences. The nth first sequence among the N first sequences is determined based on the nth second sequence among N second sequences, and the nth second sequence is determined based on the nth element of a first extended sequence, where n = 0, 1, ..., N-1, and N is a positive integer greater than 1; a first solution of an idempotent sum can be determined based on the first extended sequence, and the degree of the first solution is greater than or equal to 1. N1 first sequences among the N first sequences are output, where each of the N1 second sequences corresponding to the N1 first sequences is a sequence in a Gray complementary pair (GCP), and N1 is less than or equal to N.

[0008] Based on this solution, the first solution of the idempotent sum can be determined according to the first extended sequence, and the degree of the first solution of the idempotent sum is greater than or equal to 1. Since the degree of the first solution of the idempotent sum is greater than or equal to 1, the spectral function corresponding to the first extended sequence has a low ambiguity zone, so the position and / or velocity of the target object can be detected more accurately, and multiple target objects can be distinguished more accurately. Moreover, as the degree of the first solution of the idempotent sum increases, the low ambiguity zone of the spectral function corresponding to the first extended sequence will also expand accordingly, and the corresponding detection performance can also be improved, that is, the detection performance can be improved. For example, the position and / or velocity of the target object can be detected more accurately, or multiple target objects can be distinguished more accurately, that is, the position and / or velocity of multiple target objects can be detected. In addition, the degree of the first solution can be flexibly designed to meet the requirements of different low ambiguity zone sizes or low ambiguity zone thresholds, thereby flexibly designing a suitable first extended sequence, thereby improving the design freedom of the extended sequence.

[0009] In a second aspect, a sequence processing method is provided. The method can be executed by a receiving device, or by a component of the receiving device, such as a processor, chip, or chip system of the receiving device. It can also be implemented by a logic module or software that can implement all or part of the functions of the receiving device. The method includes: receiving a first signal, where the first signal is a signal obtained by transmitting N1 first sequences among N first sequences, where N1 is less than or equal to N and N is a positive integer greater than 1; determining the nth first sequence among the N first sequences based on the nth second sequence among N second sequences; each of the N1 second sequences corresponding to the N1 first sequences is a sequence in a Gray complementary pair (GCP), where n = 0, 1, ..., N-1; and processing the first signal based on the N1 first sequences or the N1 second sequences. The nth second sequence is determined based on the nth element of a first extended sequence, and a first solution of an idempotent sum can be determined based on the first extended sequence, where the degree of the first solution is greater than or equal to 1.

[0010] Among them, the technical effects brought about by the second aspect can refer to the technical effects brought about by the above-mentioned first aspect, and will not be repeated here.

[0011] The method described in the first or second aspect includes but is not limited to the following possible designs:

[0012] In a possible design, the first extended sequence is determined according to the first base sequence, and a second solution of the idempotent sum can be determined according to the first base sequence, where the degree of the second solution is less than or equal to the degree of the first solution.

[0013] Based on this possible design, since a second solution to the idempotent sum can be determined based on the first basis sequence, when the degree of the second solution is greater than or equal to 1, the spectral function corresponding to the first basis sequence has a low ambiguity region. Furthermore, the first extension determined based on the first basis sequence can retain the properties of the first basis sequence, so that a solution to the idempotent sum (i.e., the first solution) can also be obtained based on the first extension sequence, and this idempotent sum solution has a larger degree, thereby making the spectral function corresponding to the first extension sequence have a larger low ambiguity region, thereby improving detection performance.

[0014] In one possible design, the second solution is determined based on a first index sequence and a second index sequence, wherein the first index sequence includes indices of first-category elements in the first basis sequence, the first-category elements corresponding to sequence x in the GCP; and the second index sequence includes indices of second-category elements in the first basis sequence, the second-category elements corresponding to sequence y in the GCP.

[0015] In one possible design, the first-category elements are elements with values ​​equal to a first value, and the second-category elements are elements with values ​​equal to a second value. Alternatively, the first-category elements are elements with amplitudes greater than 0 and phases equal to a first phase; and the second-category elements are elements with amplitudes greater than 0 and phases equal to a second phase.

[0016] In one possible design, the first base sequence further includes an element whose value is equal to a third numerical value.

[0017] In one possible design, the first index sequence l base，1 and the second index sequence l base，2 It is the second solution of the idempotent sum. After raising the elements in the first index sequence and the second index sequence to the same power (power) and adding them together, the results are equal. For example, the first index sequence and the second index sequence satisfy:

[0018] Among them, N base，1 is the length of the first index sequence, l base，1 (i) represents the i-th element in the first index sequence; N base，2 is the length of the second index sequence, l base，2 (j) represents the j-th element in the second index sequence; P is the degree of the second solution, and P is a natural number.

[0019] In one possible design, the second solution is determined based on a first index sequence, a second index sequence, a first weight sequence, and a second weight sequence; the first weight sequence includes amplitudes of first-category elements, and the second weight sequence includes amplitudes of second-category elements.

[0020] In one possible design, the first index sequence l base，1 , the second index sequence lbase，2 , the first weight sequence q base，1 , and the second weight sequence q base，2 is the second solution of the idempotent sum, where the result obtained by applying the power operation to the elements of the first index sequence, multiplying them by the elements of the first weight sequence, and adding them together is the same as the result obtained by applying the power operation to the elements of the second index sequence, multiplying them by the elements of the second weight sequence, and adding them together. For example, the first index sequence, the second index sequence, the first weight sequence, and the second weight sequence satisfy:

[0021] Among them, N base，1 is the length of the first index sequence, q base，1 (i) represents the i-th element in the first weight sequence, l base，1 (i) represents the i-th element in the first index sequence; N base，2 is the length of the second index sequence, q base，2 (j) represents the jth element in the second weight sequence, l base，2 (j) represents the j-th element in the second index sequence; P is the degree of the second solution, and P is a natural number.

[0022] In one possible design, the first extended sequence is identical to the first base sequence. Based on this possible design, after determining the first base sequence, the first extended sequence can be determined without further calculation, which can reduce computational complexity and computing resource overhead of the transmitting device.

[0023] In one possible design, the first extended sequence is determined based on the first base sequence and the offset sequence, and the length of the offset sequence is M, where M is a positive integer;

[0024] Among them, the length of the first extended sequence N, the length of the first base sequence N base , and the elements in the offset sequence satisfy:

[0025] Wherein, t(m) represents the mth element in the offset sequence, and t(m) is a positive integer.

[0026] Based on this possible design, the first extension determined based on the first base sequence and the offset sequence can retain the properties of the first base sequence, so that the first extended sequence can also obtain an equal idempotent sum solution (i.e., the first solution), and the equal idempotent sum solution has a larger degree (i.e., P+M), so that the spectral function corresponding to the first extended sequence has a larger low ambiguity zone, thereby improving detection performance. In addition, in response to different requirements for low ambiguity zone sizes or low ambiguity zone thresholds, different offset sequences and / or different first base sequences can be flexibly selected to determine the first extended sequence that meets the requirements, thereby increasing the design freedom of the extended sequence.

[0027] In one possible design, the nth element of the first extended sequence is the same as the sequence s M-1 The nth element of the sequence s is the same; M-1 Satisfaction: s M-1 =[s M-2 , 0 1×t(M-1) ]+[0 1×t(M-1) , -s M-2 ] s m =[s m-1 , 0 1×t(m) ]+[0 1×t(m) , -s m-1 ], m = 0, 1, ..., M-1

[0028] Among them, s -1 Same as the first base sequence, 0 1×t(m) represents a row vector consisting of t(m) zeros, s m include elements.

[0029] In one possible design, the nth element of the first extended sequence is the same as the sequence s M-1 The nth element of the sequence s is the same; M-1 Satisfaction: s M-1 (i) = s M-2 (i)-s M-2 (it(M-1))

[0030] s m (i) = s m-1 (i)-s m-1 (it(m)), m=0, 1,..., M-1

[0031] Among them, s -1 Same as the first base sequence, s m include elements,

[0032] in, When m-1 (i)=0;it(m)<0,s m-1 (it(m))=0.

[0033] In one possible design, the nth element of the first extended sequence is the difference between the first number and the second number, and the first number is sequence A. M-1 The number of elements with value n in the sequence B. M-1 The number of elements with value n in sequence A; M-1 and sequence BM-1 Satisfaction: A M-1 =[A M-2 , B M-2 +t(M-1)] B M-1 =[B M-2 , A M-2 +t(M-1)] A m =[A m-1 , B m-1 +t(m)], m=0, 1,..., M-1 B m =[B m-1 , A m-1 +t(m)], m=0, 1,..., M-1

[0034] Among them, A -1 q base，1 (i) l base，1 (i) a sequence of components, i = 0, 1, ..., N base，1 -1; B -1 q base，2 (j) l base，2 (j) is a sequence composed of j = 0, 1, ..., N base，2 -1;

[0035] Among them, q base，1 (i) represents the i-th element in the first weight sequence, l base，1 (i) represents the i-th element in the first index sequence; q base，2 (j) represents the jth element in the second weight sequence, l base，2 (j) represents the j-th element in the second index sequence.

[0036] Based on the above three possible designs, the above three methods are provided for determining the first extended sequence according to the first base sequence. In actual applications, any method can be flexibly selected to determine the first extended sequence according to needs or the capabilities of the transmitting device, which has high flexibility and wide applicability.

[0037] In one possible design, the degree of the second solution is P, and the degree of the first solution is P+M. Based on this possible design, the solution of the idempotent sum corresponding to the first extended sequence (i.e., the first solution) has a larger degree (i.e., P+M), so that the spectral function corresponding to the first extended sequence has a larger low ambiguity area, thereby improving the detection performance. In one possible design, the first solution is determined based on the first extended index sequence and the second extended index sequence. The first extended index sequence includes the index of the first type of elements in the first extended sequence, and the second sequence corresponding to the first type of elements is the sequence x in the GCP; the second extended index sequence includes the index of the second type of elements in the first extended sequence, and the second sequence corresponding to the second type of elements is the sequence y in the GCP.

[0038] In one possible design, the first extended index sequence l ext，1 and the second extended index sequence l ext，2 It is the first solution of the idempotent sum. After the elements in the first extended index sequence and the second extended index sequence are raised to the same power (power) and added together, the results are equal. Exemplarily, the first extended index sequence and the second extended index sequence satisfy:

[0039] Among them, N ext，1 is the length of the first extended index sequence, l ext，1 (i) represents the i-th element in the first extended index sequence; N ext，2 is the length of the second extended index sequence, l ext，2 (j) represents the j-th element in the second extended index sequence; P is the degree of the second solution, P is a natural number, and P+M is the degree of the first solution.

[0040] In one possible design, the first solution is determined based on a first extended index sequence, a second extended index sequence, a first extended weight sequence, and a second extended weight sequence; the first extended weight sequence includes the amplitudes of the first category elements, and the second extended weight sequence includes the amplitudes of the second category elements.

[0041] In one possible design, the first extended index sequence l ext，1 , the second extended index sequence l ext，2 , the first extended weight sequence q ext，1 , and the second extended weight sequence q ext，2 is the first solution of the idempotent sum, where the result obtained by applying the exponential operation to the elements of the first extended index sequence, multiplying them by the elements of the first extended weight sequence, and adding them together is the same as the result obtained by applying the exponential operation to the elements of the second extended index sequence, multiplying them by the elements of the second extended weight sequence, and adding them together. Exemplarily, the first extended index sequence, the second extended index sequence, the first extended weight sequence, and the second extended weight sequence satisfy:

[0042] Among them, N ext，1 is the length of the first extended index sequence, q ext，1 (i) represents the i-th element in the first extended weight sequence, l ext，1 (i) represents the i-th element in the first extended index sequence; N ext，2 is the length of the second extended index sequence, q ext，2 (j) represents the jth element in the second extended weight sequence, l ext，2(j) represents the j-th element in the second extended index sequence; P is the degree of the second solution, P is a natural number, and P+M is the degree of the first solution.

[0043] In one possible design, the nth element s of the first extended sequence ext (n) Satisfy:

[0044] Wherein, mod represents a modulo operation. Based on this possible design, the first extended sequence can be structured to reduce the complexity of determining the first extended sequence.

[0045] In one possible design, when the nth element of the first extended sequence is a first value, the nth second sequence among the N second sequences is sequence x in the GCP; when the nth element of the first extended sequence is a second value, the nth second sequence among the N second sequences is sequence y in the GCP. Alternatively, when the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is a first phase, the nth second sequence among the N second sequences is sequence x in the GCP; when the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is a second phase, the nth second sequence among the N second sequences is sequence y in the GCP.

[0046] In a possible design, when the n-th element of the first extended sequence is a third value, the elements in the n-th second sequences in the N second sequences are all the same.

[0047] In one possible design, the power of the nth first sequence in the N first sequences is calculated based on the power of the nth first sequence in the first spreading sequence. n elements are determined.

[0048] In one possible design, the ratio of the power of the nth first sequence to the power of the n′th first sequence among the N first sequences is equal to |s ext (n)| / |s ext (n′)|. Alternatively, the ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence is equal to [s ext (n)] 2 / [s ext (n′)] 2 Among them, |s ext (n)| represents the amplitude of the nth element in the first extended sequence, |s ext (n′)| represents the n′th element in the first extended sequence and |s ext (n′)|≠0; n and n′ are any integers from 0 to N-1, and n≠n′.

[0049] Based on the above possible design, the power of the N first sequences sent by the transmitting device can be determined by the amplitude of the elements of the first extended sequence, so that the property of the first extended sequence including the first solution of the equal power sum is not destroyed, thereby making the low ambiguity area of ​​the spectral function corresponding to the first extended sequence maintain good performance, thereby improving the detection performance.

[0050] In one possible design, the nth first sequence among the N first sequences and the nth second sequence among the N second sequences satisfy one of the following:

[0051] The nth first sequence and the nth second sequence are the same;

[0052] The nth first sequence is composed of the nth second sequence and at least one 0;

[0053] The nth first sequence is obtained by cyclically extending the nth second sequence; or,

[0054] The nth first sequence is formed by concatenating a result obtained by cyclically extending the nth second sequence and at least one 0.

[0055] In combination with the first aspect, in one possible design, outputting N1 first sequences includes: sending N1 first sequences sequentially within N1 first time units in N consecutive time units, the length of each time unit in the N time units is equal, and the length of the time unit is greater than or equal to the length of the first sequence.

[0056] In combination with the first aspect, in a possible design, the index of the N1 first sequences in the N first sequences is the same as the index of the N1 first time units in the N consecutive time units.

[0057] In a third aspect, a communication device is provided for implementing the various methods described above. The communication device may be the transmitting device described in the first aspect, or a device included in the transmitting device, such as a chip; or the communication device may be the receiving device described in the second aspect, or a device included in the receiving device, such as a chip.

[0058] The communication device includes modules, units, or means corresponding to the above-mentioned method, which can be implemented by hardware, software, or hardware executing corresponding software implementation. The hardware or software includes one or more modules or units corresponding to the above-mentioned functions.

[0059] In some possible designs, the communication device may include a processing module and a communication module. The communication module may include an output module (or a sending module) and an input module (or a receiving module), respectively configured to implement the output (or sending) and input (or receiving) functions of any of the above aspects and any possible designs thereof. The processing module may be configured to implement the processing functions of any of the above aspects and any possible designs thereof.

[0060] In a fourth aspect, a communication device is provided, comprising: at least one processor configured to cause the communication device to perform the method described in any of the above aspects by executing computer instructions stored in a memory or through a logic circuit. The communication device may be the transmitting device described in the first aspect, or a device included in the transmitting device, such as a chip; or the communication device may be the receiving device described in the second aspect, or a device included in the receiving device, such as a chip.

[0061] In some possible designs, the communication device further includes a memory for storing computer instructions and / or configuration files of logic circuits. Optionally, the memory is integrated with the processor, or the memory is independent of the processor.

[0062] In a fifth aspect, a communication device is provided, comprising: a processor and a communication interface; the communication interface is configured to input and / or output signals; and the processor is configured to execute a computer program or instruction to cause the communication device to perform the method described in any of the above aspects. The communication device may be the transmitting device described in the first aspect, or a device included in the transmitting device, such as a chip; or the communication device may be the receiving device described in the second aspect, or a device included in the receiving device, such as a chip.

[0063] In some possible designs, the communication interface is an interface circuit for reading and writing computer instructions. For example, the interface circuit is used to receive computer execution instructions (computer execution instructions are stored in a memory, may be read directly from the memory, or may pass through other devices) and transmit them to the processor.

[0064] In some possible designs, the communication interface is used to communicate with modules outside the communication device.

[0065] In some possible designs, the communication device may be a chip or a chip system. When the device is a chip system, the chip system may include the chip or may include the chip and other discrete devices.

[0066] In a sixth aspect, a communication device is provided, comprising: a logic circuit and an interface circuit; the interface circuit is configured to input and / or output information; and the logic circuit is configured to execute the method described in any of the above aspects, processing the input information and / or generating output information. The communication device may be the transmitting device described in the first aspect, or a device included in the transmitting device, such as a chip; or the communication device may be the receiving device described in the second aspect, or a device included in the receiving device, such as a chip.

[0067] In a seventh aspect, a computer-readable storage medium is provided, in which a computer program or instruction is stored. When the computer program or instruction is executed by a processor, the method described in any one of the above aspects is executed.

[0068] In an eighth aspect, a computer program product is provided, which, when executed by a processor, enables the method described in any one of the above aspects to be executed.

[0069] It can be understood that when the communication device provided in any one of the third to eighth aspects is a chip, the above-mentioned sending action / function can be understood as output information, and the above-mentioned receiving action / function can be understood as input information.

[0070] Among them, the technical effects brought about by any design method in the third to eighth aspects can refer to the technical effects brought about by different design methods in the above-mentioned first or second aspects, and will not be repeated here.

[0071] In a ninth aspect, a communication system is provided, which includes the transmitting end device described in the first aspect and the receiving end device described in the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0072] Figure 1a is a schematic diagram of the relative positions of sequences provided in this application;

[0073] FIG1b is a simulation diagram of a spectral function corresponding to a Prohet-Su-Morse PTM sequence provided in the present application;

[0074] FIG1c is a schematic diagram of a spectrum function simulation of an extended sequence corresponding to a Golay complementary pair GCP repeat sequence provided by the present application;

[0075] FIG2 is a schematic structural diagram of a communication system provided by the present application;

[0076] FIG3 is a schematic structural diagram of a communication device provided by the present application;

[0077] FIG4 is an interactive diagram of a sequence transmission method provided by the present application;

[0078] FIG5 is a schematic diagram of a simulation of a spectral function corresponding to a first extended sequence provided by the present application;

[0079] FIG6 is a schematic diagram of the positions of N1 first time units in N consecutive time units provided by the present application;

[0080] FIG7 is a schematic structural diagram of a transmitting end device provided by the present application;

[0081] FIG8 is a schematic structural diagram of a receiving end device provided by the present application;

[0082] FIG9 is a schematic structural diagram of another communication device provided in the present application. DETAILED DESCRIPTION

[0083] In the description of this application, unless otherwise specified, " / " indicates that the objects associated before and after are in an "or" relationship, for example, A / B can represent A or B; "and / or" in this application is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0084] In the description of this application, unless otherwise specified, "plurality" means two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or plural.

[0085] In addition, to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that the words "first" and "second" do not limit the quantity or execution order, and the words "first" and "second" do not necessarily mean different.

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

[0087] It will be understood that the “embodiment” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, the various embodiments throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It will be understood that in the various embodiments of the present application, the size of the sequence number of each process 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 embodiment of the present application.

[0088] It can be understood that in this application, "when" and "if" both mean that corresponding processing will be taken under certain objective circumstances, and do not limit the time, nor do they require any judgment action when implementing, nor do they mean that there are other limitations.

[0089] It is understood that some optional features in the embodiments of the present application may, in certain scenarios, be implemented independently of other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects. They may also be combined with other features in certain scenarios as needed. Accordingly, the devices provided in the embodiments of the present application may also implement these features or functions accordingly, which will not be described in detail here.

[0090] In this application, unless otherwise specified, the same or similar parts between the various embodiments can refer to each other. In the various embodiments in this application, and the various implementation methods / implementation methods / implementation methods in each embodiment, if there is no special explanation and logical conflict, the terms and / or descriptions between different embodiments and the various implementation methods / implementation methods / implementation methods in each embodiment are consistent and can be referenced to each other. The technical features in different embodiments and the various implementation methods / implementation methods / implementation methods in each embodiment can be combined to form new embodiments, implementation methods, implementation methods, or implementation methods according to their inherent logical relationships. The implementation methods of this application described below do not constitute a limitation on the scope of protection of this application.

[0091] In order to facilitate understanding of the technical solutions of the embodiments of the present application, a brief introduction to the relevant technologies of the present application is first given as follows.

[0092] 1) Correlation operation: A correlation operation refers to the processing between two sequences, including multiplication and / or addition operations between different elements of the two sequences. Correlation operations can include periodic correlation operations or non-periodic correlation operations.

[0093] Exemplarily, correlation operations can be used to detect delay, distance, and the like. For example, a transmitter can send a sequence to a receiver. After receiving the sequence from the transmitter (referred to as a received sequence), the receiver performs a correlation operation on the received sequence and a local sequence generated locally by the receiver. Based on the peak position of the correlation operation, the transmission delay between the transmitter and the receiver is determined, thereby determining the distance between the receiver and the transmitter.

[0094] 2) Autocorrelation: If two sequences are identical, then the correlation operation between them is called autocorrelation (or autocorrelation operation).

[0095] 3) Cross-correlation: If two sequences are different, then the correlation operation between them is called cross-correlation (or cross-correlation operation).

[0096] 4) Non-periodic autocorrelation: When calculating the autocorrelation of a sequence, the correlation value of the overlapping elements of the two sequences is calculated by the relative displacement between the sequences.

[0097] If the sequence length is L, then the relative displacement between sequences may be -L+1, -L+2, ..., -1, 0, 1, ..., L-2, L-1, a total of 2L-1 situations, so the non-periodic autocorrelation operation has a total of 2L-1 results.

[0098] For example, for the sequence [1, 2, 3], when the relative displacement between sequences is -2, the relative positions between sequences may be as shown in (a) of FIG1a , and the non-periodic autocorrelation result is 1×3=3.

[0099] When the relative shift between sequences is -1, the relative positions between sequences can be shown as (b) in Figure 1a. In this case, the aperiodic autocorrelation result is 1×2+2×3=8. Similarly, when the relative shift between sequences is -2, -1, 0, 1, and 2, the aperiodic autocorrelation results of the sequences are 3, 8, 14, 8, and 3, respectively.

[0100] Optionally, the relative shift of the non-periodic autocorrelation operation can also be 0, 1, ..., L-2, L-1, a total of L cases. For example, when a sequence q1 of length L is subjected to a non-periodic autocorrelation operation, the kth value obtained based on the non-periodic autocorrelation operation (or the value when the relative shift is k) can be expressed as:

[0101] It can be understood that the processing of the non-periodic cross-correlation operation is similar to that of the non-periodic autocorrelation operation.

[0102] 5) Golay complementary pair (GCP):

[0103] GCP, also known as Gray complementary pair, Gray complementary sequence or GCP sequence, is a type of perfect aperiodic autocorrelation sequence. It is defined as: a pair of sequences x and y with code length L, if the sum of their aperiodic autocorrelation functions (AACF) is 0 at all shifts except 0, then the two sequences are a GCP. For the sequence x = [x(0), x(1), ..., x(L-1)], its AACF can be defined as:

[0104] Where k represents the displacement, and k equal to 0 represents zero displacement. The AACF of sequence y (denoted as C y (k)) is similar to the AACF of sequence x, which can be referred to C x The description of (k) will not be repeated here.

[0105] For example, for the sequence x = [1, 1, 1, -1] and y = [1, 1, -1, 1], since the AACF of the sequence x is C x =[4, 1, 0, -1], k = 0, ..., 3, the AACF of sequence y is C y =[4,-1,0,1],k=0,..,3,C x +C y =[8, 0, 0, 0], so the sequence x and y is a GCP.

[0106] 6) Ambiguity function:

[0107] The ambiguity function can be used to measure the impact of Doppler shift and transmission delay on the transmitted signal. Doppler shift is caused by the motion of the target object and can be roughly equivalent to a continuous phase rotation of the continuous time-domain signal transmitted by the transmitter. For example, the ambiguity function can be derived from a correlation operation, but with Doppler shift incorporated into the ambiguity function.

[0108] In scenarios where multiple sequences need to be sent, the transmitter can sequentially generate and transmit a time-domain continuous signal carrying multiple sequences based on the multiple sequences. The time-domain continuous signal received by the receiver may be affected by the Doppler frequency domain. Therefore, the receiver can use an ambiguity function to measure the impact of the Doppler frequency shift on the transmitted signal (or the multiple sequences transmitted).

[0109] Sending multiple sequences can create a low ambiguity zone in the ambiguity function of the multiple sequences. The low ambiguity zone of the ambiguity function can be determined by a threshold. Within the low ambiguity zone of the ambiguity function, all ambiguity function values ​​are less than or equal to the threshold. In other words, the low ambiguity zone of the ambiguity function is the area where the ambiguity function values ​​are less than or equal to a certain threshold.

[0110] A low ambiguity zone allows the receiver to more accurately detect the position and / or velocity of a target object. Furthermore, within this zone, multiple targets can be more accurately distinguished, and the position and / or velocity of each can be detected separately. Generally speaking, the larger the low ambiguity zone, the wider the detectable speed range. Furthermore, within a given speed range, a greater number of target objects can be distinguished.

[0111] For example, when each of the multiple sequences sent is a sequence x or a sequence y in the GCP, the ambiguity function A can be approximately expressed as the following formula (1):

[0112] Where τ is a discrete index in the time domain (or delay domain), which can range from 0 to L-1, and L is the sequence length. v is a discrete index in the Doppler domain, which can range from 0 to N-1, and N is the number of sequences sent. x (τ) and C y (τ) are the autocorrelation results of sequence x and sequence y (e.g., non-periodic autocorrelation results). j2πvn / N is the phase factor introduced by the Doppler shift.

[0113] s ext (n) represents the nth element of the extended sequence. The extended sequence is used to determine whether each sequence in the multiple sequences is sequence x or sequence y. For example, when the value of an element in the extended sequence is 1, the nth sequence in the multiple sequences is sequence x; and when the value of an element in the extended sequence is -1, the nth sequence in the multiple sequences is sequence y.

[0114] Since GCP has perfect aperiodic autocorrelation properties, The influence on the fuzzy function can be ignored. In addition, when τ takes different values, Both In other words, the fuzzy function is mainly affected by Therefore, the extended sequence s can be defined ext The Doppler-based spectral function B satisfies the following formula (2):

[0115] It can be understood that since the ambiguity functions of multiple sequences are mainly affected by formula (2), the low ambiguity area of ​​the spectral function shown in formula (2) can be used to be equivalent to the low ambiguity area of ​​the ambiguity functions of multiple sequences.

[0116] In addition, since the extended sequence is used to determine whether each sequence in the multiple sequences is sequence x or sequence y, it can also be understood that the low ambiguity region of the ambiguity function of the multiple transmitted sequences is affected by the arrangement of the multiple sequences (that is, whether each sequence is sequence x or sequence y).

[0117] 7) Equal sums of powers (ESP or equal sums of like powers, ESLP):

[0118] Idempotence sum can mean that when the elements of two unequal sequences are raised to the same power (power) and added together, the results are equal.

[0119] In other words, the idempotent sum problem is to find a set of solutions (or two sequence solutions) S0 and S1. Where S0 = [s0(0), s0(1), ..., s0(N0-1)], S1 = [s1(0), s1(1), ..., s1(N1-1)], N0 and N1 are positive integers greater than or equal to 1. The set of solutions S0 and S1 satisfies:

[0120] Here, K can be called the degree, or the degree of the idempotent sum, or the degree of the idempotent sum solution, or the degree of the solution.

[0121] Optionally, the values ​​of the solutions S0 and S1 of the idempotent sum are generally integers. Of course, the values ​​of S0 and S1 can also be extended to real numbers. In addition, the value range of k in the above formula (3) can also be from 0 to K. When k = 0, N0 = N1.

[0122] Optionally, in addition to the above formula (3), the present application also provides another extended idempotent sum. In this extended idempotent sum, each element in two unequal sequences is raised to the same power (power) and then multiplied by a weight value and added, and the obtained results are equal.

[0123] In other words, the extended idempotent sum problem is to find a set of solutions S0, q0, S1, q1. Where S0 = [s0(0), s0(1), ..., s0(N0-1)], S1 = [s1(0), s1(1), ..., s1(N1-1)], q0 = [q0(0), q0(1), ..., q0(N0-1)], q1 = [q1(0), q1(1), ..., q1(N1-1)], and N0 and N1 are positive integers greater than 1. The set of solutions S0, q0, S1, q1 satisfies:

[0124] Optionally, the idempotent sum shown in formula (4) above can also be called a weighted idempotent sum. It is understood that when every element in sequence q0 is identical, every element in sequence q1 is identical, and q0 and q1 are exactly the same, formula (4) above can be simplified to formula (3) above. In this case, the solution to the weighted idempotent sum is the same as the solution to the traditional idempotent sum (as shown in formula (3)).

[0125] The transmitter can send multiple sequences, and the receiver can sense or detect the position and / or velocity of the target object based on the multiple sequences. Generally, each of the multiple sequences sent by the transmitter can be sequence x or sequence y in the GCP. In some possible implementations, determining whether a sequence is sequence x or sequence y can be done in the following two ways:

[0126] Method 1: Determination based on Prouhet-Thue-Morse (PTM) sequence:

[0127] The PTM sequence is a binary sequence, that is, the value of each element in the PTM sequence is 1 or -1, or the value of each element is 0 or 1.

[0128] When multiple sequences are determined to be sent based on the PTM sequence, the PTM sequence is the extended sequence corresponding to the multiple sequences. The N elements of the PTM sequence correspond one to one with the N sequences. The number of sequences N is a power of 2, that is, N = 2 M , M is a positive integer.

[0129] For example, it can be defined that when the value of an element in the PTM sequence is 1, the corresponding sequence is sequence x in the GCP, and correspondingly, when the value of an element in the PTM sequence is -1, the corresponding sequence is sequence y in the GCP; or, it can be defined that when the value of an element in the PTM sequence is 0, the corresponding sequence is sequence x in the GCP, and correspondingly, when the value of an element in the PTM sequence is 1, the corresponding sequence is sequence y in the GCP.

[0130] For example, the PTM sequence for M=4 and N=16 is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1] or [0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0]. In this case, the corresponding 16-bit sequences sent should be [x,y,y,x,y,x,x,y,x,y,x,y,x,y,x,y,x].

[0131] It should be noted that, in the examples of this application, unless otherwise specified, x represents sequence x in GCP, and y represents y in GCP. This is a unified description and will not be repeated in subsequent examples.

[0132] Method 2: Repeat determination based on GCP:

[0133] In this method, the sequence x and sequence y in the GCP can be repeated to obtain N sequences. For example, when N=16, the corresponding 16 sequences may be [x, y, x, y, x, y, x, y, x, y, x, y, x, y, x, y]; when N=15, the corresponding 15 sequences may be [x, y, x, y, x, y, x, y, x, y, x, y, x, y, x].

[0134] Analogously to the first method, an extended sequence can also be defined in the second method. When the element of the extended sequence is 1 (or 0), the corresponding sequence is the sequence x in the GCP. When the element of the extended sequence is -1 (or 1), the corresponding sequence is the sequence y in the GCP.

[0135] For example, when N=16, the corresponding spreading sequence may be [1,-1,1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1] or [0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1]. When N=15, the corresponding spreading sequence may be [1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1] or [0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1].

[0136] Although the above two methods can determine whether each sequence sent by the transmitter is sequence x or sequence y in the GCP, the detection performance corresponding to the above two methods still has room for improvement.

[0137] For example, for the above-mentioned method 1, when M is equal to 5 and N is equal to 32, the spectrum function of the PTM sequence of length 32 obtained according to formula (2) is shown in Figure 1b. The ordinate is the energy (or value) of the spectrum function, in dB. The abscissa is 2v / N, -N / 2≤v≤N / 2, and v is a real number. Taking the threshold of -35dB as an example, it can be seen from Figure 1b that there is an area where the energy of the spectrum function is less than or equal to -35dB near the value of the abscissa of 0, that is, there is a low ambiguity zone near the value of the abscissa of 0. When the abscissa is 0, the value of v is 0. v being 0 means that the discrete index of the Doppler domain is 0, and further indicates that the corresponding target movement speed is 0, or that the target is stationary. Although there is a low ambiguity zone when multiple sequences are sent based on method 1, it can be seen from Figure 1b that the range of the low ambiguity zone is not large, so the detection performance may not be ideal.

[0138] For the second method described above, taking N equal to 18 and the extended sequence in method 2 as [1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1], the spectral function of the extended sequence obtained according to formula (2) is shown in Figure 1c. Assuming the threshold is -35dB, that is, the energy of the spectral function is less than -35dB, it is considered to be a low ambiguity area. However, as shown in Figure 1c, the energy of the spectral function corresponding to this extended sequence is relatively large, and there is no low ambiguity area.

[0139] Based on this, the present application provides a sequence transmission method based on the following analysis: Let 2πv / N=θ in formula (2), then the phase in the spectrum function B can be expressed as e j2πvn / N =e jnθ After Taylor expansion of the spectrum function B based on θ=0, the spectrum function B can be approximately expressed as:

[0140] Where t is the order of Qinle expansion, that is, is the tth order (or tth term) of Qin Le's expansion.

[0141] According to formula (5), when When , the tth order of the Zinle expansion of the spectral function B is 0. Assuming that the first K+1 (i.e., t=0, 1, ..., K) orders of the Zinle expansion of the spectral function B are 0, then the larger the value of K, the larger the phase e in the Doppler domain. jnθ The closer θ is to 0, the smaller the value of spectral function B (i.e., the closer it is to 0), and the more likely it is to produce a larger low-ambiguity area. In other words, the expansion sequence needs to be designed so that the first K+1 orders of the Zinle expansion of spectral function B (based on θ=0) are 0, and the value of K needs to be greater than or equal to 1.

[0142] In this application, the extended sequence that makes the first K+1 orders of the Zinle expansion of the spectral function B equal to 0 can be obtained by the idempotent sum problem. For example, the solution S0 of the idempotent sum shown in formula (3) can be composed of the index of the elements in the extended sequence corresponding to the sequence x, and S1 can be composed of the index of the elements in the extended sequence corresponding to the sequence y. ext For example, if the value of an element in is 1, it corresponds to the sequence x, and if it is -1, it corresponds to the sequence y, then the solution S0 of the idempotent sum is the extended sequence s ext The index of the element with value 1 in the idempotent sum, the solution S1 is the extended sequence s ext The index of the element with value -1 in . Therefore, the extended sequence can be determined based on the correspondence between the element value and the sequence and the solution of the idempotent sum.

[0143] In other words, the sequence transmission method provided by this application can flexibly design an extended sequence based on the solution of idempotent sum, thereby meeting the design requirements of different goals and improving detection performance as much as possible. The subsequent embodiments will describe the sequence transmission method in detail and will not be repeated here.

[0144] The technical solutions of the embodiments of the present application can be used in various communication systems, which may be a third generation partnership project (3GPP) communication system, for example, a fourth generation (4G), fifth generation (5G) mobile communication system, or a sixth generation (6G) mobile communication system evolved after 5G, a vehicle to everything (V2X) system, or a device to device (D2D) communication system, a machine to machine (M2M) communication system, an Internet of Things (IoT), a narrowband Internet of Things (NB-IoT), other next-generation communication systems, a perception communication integrated system, a satellite communication system, etc. The communication system may also be a non-3GPP communication system, such as a wireless local area network (WLAN) system such as wireless fidelity (WiFi), without limitation.

[0145] The technical solutions of the embodiments of the present application can be applied to various communication scenarios, for example, it can be applied to scenarios such as perception and downlink synchronization.

[0146] The above-mentioned communication systems and communication scenarios applicable to the present application are merely examples. The communication systems and communication scenarios applicable to the present application are not limited thereto, and the above description does not impose any limitation on the solutions of the present application.

[0147] Figure 2 shows a schematic diagram of the structure of a communication system provided by this application. The communication system includes a transmitting device and a receiving device. The transmitting device is used to transmit a sequence, and the receiving device is used to receive the signal formed by the transmitted sequence and process the signal.

[0148] As a possible implementation, the transmitting device and the receiving device may be the same device. For example, the transmitting device and the receiving device may be the same network device or the same terminal device. In this case, the sequence transmitted by the transmitting device is reflected by the target object and reaches the receiving device. The receiving device may process the received signal to detect the position and / or velocity of the target object.

[0149] As another possible implementation, the transmitting device and the receiving device can be different devices. For example, one of the transmitting device and the receiving device is a network device, and the other is a terminal device. Alternatively, the transmitting device and the receiving device are two different terminal devices or two different network devices, which is not specifically limited in this application. In this scenario, the target object can be understood as the transmitting device or the receiving device. The sequence sent by the transmitting device is transmitted to the receiving device, and the receiving device can process the received signal to detect the position of the receiving device relative to the transmitting device and / or the relative movement speed between the receiving device and the transmitting device.

[0150] Exemplarily, in a downlink synchronization scenario, the transmitting device may be a network device, and the receiving device may be a terminal device. The network device may send multiple sequences, and the terminal device may receive signals formed by the transmission of multiple sequences, and process the signals to detect the relative position between the terminal device and the network device, thereby determining the transmission delay between the terminal device and the network device based on the relative position, and then performing downlink synchronization based on the transmission delay.

[0151] The terminal device in the embodiments of the present application may be a user-side device for implementing wireless communication functions, such as a terminal or a chip that can be used in a terminal. The terminal may be a user equipment (UE), an access terminal, a terminal unit, a terminal station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a wireless communication device, a terminal agent, or a terminal device in a 5G network or a public land mobile network (PLMN) evolved after 5G. The access terminal can be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a drone, a robot, a smart point of sale (POS) machine, customer-premises equipment (CPE) or a wearable device, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Alternatively, the terminal may be a terminal with communication functionality in IoT, such as a terminal in V2X (e.g., a vehicle-to-everything (V2X) device), a terminal in D2D communication, or a terminal in M2M communication. The terminal may be mobile or fixed.

[0152] The network device in the embodiments of the present application is a device that connects a terminal device to a wireless network. The network device can be referred to as a node in a radio access network (RAN), or as a radio access network node (or device). A communication system may include multiple network devices, which can be nodes of the same type or different types.

[0153] In some possible scenarios, the network device may include an evolved base station (NodeB or eNB or e-NodeB, evolutionary Node B) in a long term evolution (LTE) system or an enhanced LTE (LTE-advanced, LTE-A) system, such as a traditional macro base station eNB and a micro base station eNB in ​​a heterogeneous network scenario. Alternatively, it may include a next generation node B (gNB) in a new radio (NR) system. Alternatively, it may include a transmission reception point (TRP), a home base station (e.g., a home evolved NodeB, or home Node B, HNB), a base band unit (BBU), a base band pool (BBU pool), or a wireless fidelity (WiFi) access point (AP), etc. Alternatively, it may include a base station in a non-terrestrial network (NTN), which can be deployed on an aircraft or satellite. In the NTN, the network device can function as a Layer 1 (L1) relay, a base station, or an integrated access and backhaul (IAB) node. Alternatively, the network device can be a device that implements base station functions in the IoT, such as drone communications, V2X, D2D, or machine-to-machine (M2M) devices.

[0154] In some possible scenarios, the network device may also be a module or unit that can implement some of the functions of the base station. For example, the network device may be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU may be configured separately or included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0155] 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, the network device may be a network device or a module of a network device in an open radio access network (open RAN, ORAN) system. In the ORAN system, CU may also be referred to as open (open, O)-CU, DU may also be referred to as O-DU, CU-CP may also be referred to as O-CU-CP, CU-UP may also be referred to as O-CU-UP, and RU may also be referred to as O-RU. Any of the CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0156] Optionally, the base station in the embodiment of the present application may include various forms of base stations, such as: macro base stations, micro base stations (also called small stations), relay stations, access points, home base stations, TRPs, transmitting points (TPs), mobile switching centers, etc., and the embodiments of the present application do not make specific limitations on this.

[0157] It should be noted that the communication system described in the embodiment of the present application is intended to more clearly illustrate the technical solution of the embodiment of the present application, and does not constitute a limitation on the technical solution provided in the embodiment of the present application. Ordinary technicians in this field can know that with the evolution of network architecture and the emergence of new business scenarios, the technical solution provided in the embodiment of the present application is also applicable to similar technical problems.

[0158] Optionally, the relevant functions of the transmitting end device or the receiving end device involved in this application can be implemented by the communication device 30 in Figure 3. Referring to Figure 3, the communication device 30 includes one or more processors 301. Furthermore, the communication device 30 may also include a communication bus 302 and at least one communication interface (Figure 3 is only exemplary, and the communication device 30 includes a communication interface 304 and a processor 301 as an example). Optionally, the communication device 30 may also include a memory 303.

[0159] Processor 301 can be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program of the present application, or a processing core for processing data (e.g., computer program instructions). The processor can be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor.

[0160] In a specific implementation, as an embodiment, the processor 301 may include one or more CPUs, such as CPU0 and CPU1 in FIG. 3 .

[0161] Communication bus 302 may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, for example. This bus can be classified as an address bus, a data bus, a control bus, and the like. For ease of illustration, FIG3 shows only one thick line, but this does not imply a single bus or type of bus. Communication bus 302 is used to connect the various components within communication device 30, enabling communication and interaction between the various components within communication device 30.

[0162] The communication interface 304 may be a transceiver module for communicating with other devices or a communication network, such as Ethernet, RAN, or WLAN. For example, the communication interface 304 may be a device such as a transceiver or a transceiver. Alternatively, the communication interface 304 may be a transceiver circuit within the processor 301, configured to implement signal input and output to the processor.

[0163] The memory 303 may be a device having a storage function. For example, it may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory may exist independently and be connected to the processor via the communication bus 302. The memory may also be integrated with the processor.

[0164] Exemplarily, the memory 303 is used to store computer-executable instructions for executing the solution of the present application, and the execution is controlled by the processor 301. The processor 301 is used to execute the computer-executable instructions stored in the memory 303, thereby implementing the method provided in the embodiment of the present application.

[0165] Alternatively, optionally, in an embodiment of the present application, the processor 301 may also perform processing-related functions in the method provided in the following embodiments of the present application, and the communication interface 304 is responsible for communicating with other devices or communication networks, which is not specifically limited in the embodiments of the present application.

[0166] Optionally, the computer-executable instructions in the embodiments of the present application may also be referred to as application code, which is not specifically limited in the embodiments of the present application.

[0167] In a specific implementation, as an embodiment, the communication device 30 may further include an output device 305 and an input device 306. The output device 305 communicates with the processor 301 and can display information in a variety of ways. For example, the output device 305 can be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector. The input device 306 communicates with the processor 301 and can receive user input in a variety of ways. For example, the input device 306 can be a mouse, a keyboard, a touch screen device, or a sensor device.

[0168] It should be noted that the composition structure shown in Figure 3 does not constitute a limitation on the communication device. In addition to the components shown in Figure 3, the communication device may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.

[0169] The following will be combined with the accompanying drawings to expand the sequence transmission method provided by the embodiment of the present application. It is understood that in the embodiment of the present application, the transmitting end device or the receiving end device can perform some or all of the steps in the embodiment of the present application. These steps or operations are only examples. The embodiment of the present application can also perform other operations or variations of various operations. In addition, the various steps can be performed in a different order than those presented in the embodiment of the present application, and it is possible that not all operations in the embodiment of the present application need to be performed.

[0170] As shown in FIG4 , a sequence transmission method provided by the present application is shown. Referring to FIG4 , the sequence transmission method includes the following steps:

[0171] S401: The transmitting end device determines N first sequences.

[0172] The nth first sequence among the N first sequences is determined based on the nth second sequence among the N second sequences, where n=0, 1, ..., N-1, and N is a positive integer greater than 1. That is, the 0th first sequence among the N first sequences is determined based on the 0th second sequence among the N second sequences, the 1st first sequence among the N first sequences is determined based on the 1st second sequence among the N second sequences, and so on. The N-1th first sequence among the N first sequences is determined based on the N-1th second sequence among the N second sequences.

[0173] Optionally, the second sequence may be a sequence x in the GCP, or may be a sequence y in the GCP, or may be a sequence including all the same elements. For example, the second sequence may be a 0 sequence, that is, all elements in the second sequence are 0.

[0174] The second sequence is determined based on the nth element in the first extended sequence, where n=0, 1, ..., N-1. That is, the first extended sequence includes N elements, and the nth element among the N elements is used to determine the nth second sequence among the N second sequences. In other words, the nth element among the N elements corresponds to the nth second sequence among the N second sequences.

[0175] The first solution of the idempotent sum can be determined according to the first extended sequence, or in other words, the first extended sequence can be determined according to the first solution of the idempotent sum.

[0176] Optionally, in the embodiment of the present application, the solution to the idempotent sum may also be referred to as the solution to the idempotent sum problem, and the two may be interchangeable, and the present application does not impose any specific limitation on this.

[0177] The degree of the first solution is greater than or equal to 1. For example, the degree of the first solution can be determined based on the requirements for detection performance. For example, if the detection performance requires a large low fuzzy region of the spectral function, the degree of the first solution can be relatively large.

[0178] Optionally, when the first solution of the idempotent sum can be determined based on the first extended sequence, the first Y orders (i.e., the 0th, 1st, ..., Yth orders) of the spectral function (or fuzzy function) corresponding to the first extended sequence based on the Zinler expansion with θ=0 (θ=2πv / N, v=0) are 0. Y represents the degree of the first solution of the idempotent sum.

[0179] Optionally, the correspondence between the nth element in the N elements of the first extended sequence and the nth second sequence in the N second sequences may be in the following four ways:

[0180] Method 1: When the nth element of the first extended sequence is a first value, the nth second sequence among the N second sequences is sequence x in the GCP; when the nth element of the first extended sequence is a second value, the nth second sequence among the N second sequences is sequence y in the GCP.

[0181] The first value and the second value are two different values. For example, the first value and the second value can be 1 and -1, or -1 and 1, respectively. Of course, the first value and the second value can also be other values, for example, the first value and the second value can be 1 and 5, respectively.

[0182] For example, taking the first value as A and the second value as B as an example, when N=18, if the first extended sequence is s ext =[A, B, B, A, A, B, A, B, B, A, A, B, B, A, A, B], then the corresponding N second sequences are {x, y, y, x, x, y, x, y, x, x, y, x, x, y, x, x, y, x, y). When the first value and the second value are 1 and -1 respectively, the first extended sequence is s ext =[1,-1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1].

[0183] Method 2: When the nth element of the first extended sequence is a first value, the nth second sequence among the N second sequences is sequence x in the GCP; when the nth element of the first extended sequence is a second value, the nth second sequence among the N second sequences is sequence y in the GCP; when the nth element of the first extended sequence is a third value, the elements in the nth second sequence among the N second sequences are all the same, for example, the nth second sequence is a 0 sequence.

[0184] That is, when the nth element of the first extended sequence is the third value, the nth second sequence among the N second sequences is not a sequence in the GCP. That is, the nth second sequence is neither sequence x nor sequence y. For example, the third value may be equal to 0.

[0185] Method 3: When the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the first phase, the nth second sequence among the N second sequences is sequence x in the GCP; when the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the second phase, the nth second sequence among the N second sequences is sequence y in the GCP.

[0186] Optional, for numeric values |F1| is the amplitude of the value F, F1 can be positive or negative, is the phase of the value F, The j in is the imaginary number symbol.

[0187] The first phase and the second phase are two different phases. For example, the first phase and the second phase can be 0 and π, respectively, or π and 0, respectively. Of course, the first phase and the second phase can also be other values.

[0188] For example, taking the first phase and the second phase as 0 and π respectively, the phase of the nth element of the first extended sequence is the first phase (ie 0), which means that the nth element is a real number greater than 0 (because e j0 =1, then F = |F1|), the phase of the nth element of the first extended sequence is the second phase (ie, π), which means that the nth element is a real number less than 0 (because e jπ =-1, at this time F = -|F1|).

[0189] That is, when the nth element of the first extended sequence is greater than 0, the nth second sequence among the N second sequences is sequence x in the GCP; when the nth element of the first extended sequence is less than 0, the nth second sequence among the N second sequences is sequence y in the GCP.

[0190] Method 4: When the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the first phase, the nth second sequence among the N second sequences is sequence x in the GCP; when the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the second phase, the nth second sequence among the N second sequences is sequence y in the GCP; when the nth element of the first extended sequence is a third value, the elements in the nth second sequence among the N second sequences are all the same, for example, the nth second sequence is a 0 sequence.

[0191] Exemplarily, the third value may be 0, in which case the amplitude of the third value may be considered equal to 0 and the phase may be 0. As a possible implementation, when the nth element of the first extended sequence is 0, the nth second sequence among the N second sequences may be a 0 sequence.

[0192] S402: The transmitting end device outputs N1 first sequences among the N first sequences. Correspondingly, the receiving end device receives the first signal.

[0193] Each of the N1 second sequences corresponding to the N1 first sequences is a sequence in the GCP. N1 is less than or equal to N.

[0194] That is, if the nth second sequence among the N second sequences is a sequence in the GCP, then the transmitting end device outputs the first sequence corresponding to the nth second sequence; if the nth second sequence among the N second sequences is not a sequence in the CGP, for example, the nth second sequence is sequence 0, then the transmitting end device does not output the first sequence corresponding to the nth second sequence.

[0195] For example, if the second sequence is not a sequence in the GCP, that is, if the elements included in the second sequence are all the same, then the elements included in the first sequence determined based on the second sequence may also be the same. In this case, the transmitting device does not transmit the first sequence. In other words, it can be considered that each of the N1 first sequences includes at least two different elements.

[0196] Optionally, the transmitting end device outputs N1 first sequences, which may include the transmitting end device sending the N1 first sequences. Exemplarily, the N1 first sequences may be mapped and sent in the time domain.

[0197] Optionally, the transmitting end device may output the N1 first sequences in sequence. Outputting the N1 first sequences in sequence may be understood as outputting the N1 first sequences in sequence according to the arrangement order of the N1 first sequences. For example, the end time domain position of the 0th first sequence in the N1 first sequences is before the start time domain position of the 1st first sequence in the N1 first sequences, the end time domain position of the 1st sequence in the N1 first sequences is before the start time domain position of the 2nd first sequence in the N1 first sequences, and so on, the end time domain position of the N1-2th sequence in the N1 first sequences is before the start time domain position of the N1-1th first sequence in the N1 first sequences.

[0198] Optionally, the transmitting end device outputting N1 first sequences may include: the transmitting end device outputting N1 time domain signals (referred to as second signals) sequentially generated based on the N1 first sequences. Exemplarily, when the transmitting end device is a network device, the second signal may be a reference signal.

[0199] The first signal received by the receiving device can be understood as the signal after N1 first sequences (or N1 second signals) are transmitted. For example, the first signal can be the signal received by the receiving device after N1 second signals are wirelessly transmitted.

[0200] Optionally, when the transmitting end device and the receiving end device are the same device, the first signal can be understood as an echo signal of N1 second signals.

[0201] S403: The receiving end device processes the first signal according to the N1 first sequences or the N1 second sequences corresponding to the N1 first sequences.

[0202] Optionally, the receiving device may sample the first signal to obtain a received sequence, which may be understood as the N1 received first sequences. The receiving device may then calculate an ambiguity function between the N1 first sequences (or the N1 second sequences corresponding to the N1 first sequences) and the received sequence, thereby performing detection or perception based on the ambiguity function.

[0203] Exemplarily, when the transmitting device and the receiving device are the same network device, the network device may detect the position and / or speed of the target object (eg, the terminal device) based on the fuzzy function.

[0204] In the case where the transmitting device is a network device and the receiving device is a terminal device, the terminal device can detect the transmission delay between the terminal device and the network device according to the fuzzy function, and thus perform downlink synchronization according to the transmission delay.

[0205] Optionally, when the transmitting device and the receiving device are different devices, the transmitting device may indicate N first sequences or N second sequences corresponding to the N first sequences to the receiving device, wherein the N first sequences include N1 first sequences sent by the transmitting device.

[0206] For example, one or more sequence sets (each sequence set includes N sequences) may be pre-configured in the transmitting device and the receiving device. The transmitting device may send an index of a first sequence set consisting of N first sequences to the receiving device, thereby indicating the N first sequences. Alternatively, where a value of N corresponds to a sequence set, the transmitting device may send or indicate the value of N to the receiving device, thereby indicating the N first sequences through the value of N.

[0207] Similarly, multiple base sequence sets (each base sequence set may include N second sequences) may be pre-configured in the transmitting device and the receiving device, and the transmitting device may indicate the N second sequences to the receiving device. The indication method of the N first sequences may be referred to and will not be repeated here.

[0208] It is understandable that after the transmitting device indicates N first sequences to the receiving device, the receiving device can learn the second sequences corresponding to the N first sequences. Because each of the N1 second sequences corresponding to the N1 first sequences sent by the transmitting device is a sequence in the GCP, the receiving device can determine the N1 first sequences sent by the transmitting device based on the N second sequences it has learned. The N1 first sequences are, namely, the first sequences corresponding to the N1 sequence x or sequence y among the N second sequences.

[0209] Similarly, after the transmitting device indicates N second sequences corresponding to N first sequences to the receiving device, the receiving device can also determine N1 first sequences sent by the transmitting device based on the N second sequences. Please refer to the relevant description in the previous paragraph and will not be repeated here.

[0210] Based on this solution, the first solution of the idempotent sum can be determined according to the first extended sequence, and the degree of the first solution of the idempotent sum is greater than or equal to 1. Since when the degree of the first solution of the idempotent sum is greater than or equal to 1, the spectral function corresponding to the first extended sequence has a low ambiguity area, so the position and / or speed of the target object can be detected more accurately, and multiple target objects can be distinguished more accurately. Moreover, as the degree of the first solution of the idempotent sum increases, the low ambiguity area of ​​the spectral function corresponding to the first extended sequence will also expand accordingly, and the corresponding detection performance can also be improved, that is, the detection performance can be improved. In addition, for different requirements of low ambiguity area sizes or low ambiguity area thresholds, the degree of the first solution can be flexibly designed, so that the appropriate first extended sequence can be flexibly designed, thereby improving the design freedom of the extended sequence.

[0211] The above describes the overall process of the sequence transmission method provided by the present application. The following describes the design of the first extended sequence.

[0212] Optionally, the first solution of the idempotent sum is based on the first extended index sequence l ext，1 and the second extended index sequence l ext，2 Determined, or in other words, based on the first extended index sequence l ext，1 and the second extended index sequence l ext，2 Able to determine the first solution of an idempotent sum.

[0213] Among them, the first extended index sequence l ext，1 The index of the first-category element in the first extended sequence is included, and the second sequence corresponding to the first-category element is sequence x in the GCP. Exemplarily, when the correspondence between the nth element of the first extended sequence and the nth second sequence of the N second sequences is in the first or second manner described in S401 above, the value of the first-category element is a first value. When the correspondence is in the third or fourth manner described in S401 above, the amplitude of the first-category element is greater than 0 and the phase is a first phase.

[0214] Among them, the second extended index sequence l ext，2 The index of the second-type element in the first extended sequence is included, and the second sequence corresponding to the second-type element is the sequence y in the GCP. Exemplarily, when the correspondence between the nth element of the first extended sequence and the nth second sequence of the N second sequences is in the first or second manner described in S401 above, the value of the second-type element is the second value. When the correspondence is in the third or fourth manner described in S401 above, the amplitude of the second-type element is greater than 0 and the phase is the second phase.

[0215] Optionally, the elements in the first extended index sequence may be arranged in ascending order according to the size of the index of the first type of element. The elements in the second extended index sequence may be arranged in ascending order according to the size of the index of the second type of element.

[0216] For example, with N=14, the first extended sequence s ext =[1,-1,-1,0,1,1,-1,-1,1,1,0,-1,-1,1], the value of the first type element is 1, and the value of the second type element is -1, for example, the first extended index sequence l ext，1 l ext，1 =[0, 4, 5, 8, 9, 13], the second extended index sequence l ext，2 l ext，2 =[1, 2, 6, 7, 11, 12].

[0217] As a possible implementation, the first extended index sequence l ext，1 and the second extended index sequence l ext，2 It is the first solution of the idempotent sum, satisfying:

[0218] Among them, N ext，1 is the length of the first extended index sequence, or the number of first-category elements in the first extended sequence. ext，1 (i) represents the i-th element in the first extended index sequence. N ext，2 is the length of the second extended index sequence, or the number of the second type of elements in the first extended sequence, l ext，2 (j) represents the jth element in the second extended index sequence. Y represents the degree of the first solution.

[0219] As another possible implementation, the first solution of the idempotent sum is based on the first extended index sequence l ext，1 , the second extended index sequence l ext，2 , the first extended weight sequence q ext，1 , and the second extended weight sequence q ext，2 Sure.

[0220] The first extended weight sequence includes the amplitude of the first type of elements. The elements in the first extended weight sequence correspond to the elements in the first extended index sequence one by one, that is, the i-th element in the first extended weight sequence qext，1 (i) and the i-th element l in the first extended index sequence ext，1 (i) Correspondingly, these two elements constitute a first-category element in the first extended sequence. The first-category element can be referred to the above related description and will not be repeated here.

[0221] The second extended weight sequence includes the amplitude of the second type of elements. The elements in the second extended weight sequence correspond to the elements in the second extended index sequence one by one, that is, the i-th element q in the second extended weight sequence ext，2 (i) and the i-th element l in the second extended index sequence ext，2 (i) Correspondingly, these two elements constitute a second type of element in the first extended sequence. The second type of element can refer to the above related description and will not be repeated here.

[0222] Optionally, the elements in the first extended weight sequence and the second extended weight sequence may be real numbers, that is, the amplitudes of the elements in the first extended sequence may be real numbers.

[0223] For example, with N=9, the first extended sequence s ext=[1, -1, -2, 1, 2, 1, -2, -1, 1], the amplitude of the first type of element is greater than 0 and the phase is 0, the amplitude of the second type of element is greater than 0 and the phase is π, for example, the first extended index sequence l ext，1 for l ext，1 =[0, 3, 4, 5, 8], the second extended index sequence l ext，2 for l ext，2 =[1, 2, 6, 7], the first extended weight sequence q ext，1 q ext，1 =[1, 1, 2, 1, 1], the second extended weight sequence q ext，2 q ext，2 =[1, 2, 2, 1].

[0224] In this possible implementation, optionally, the first extended index sequence l ext，1 , the second extended index sequence l ext，2 , the first extended weight sequence q ext，1 , and the second extended weight sequence q ext，2 It is the first solution of the idempotent sum, satisfying:

[0225] Among them, N ext，1 is the length of the first extended index sequence, q ext，1 (i) represents the i-th element in the first extended weight sequence, l ext，1 (i) represents the i-th element in the first extended index sequence; N ext，2 is the length of the second extended index sequence, q ext，2 (j) represents the jth element in the second extended weight sequence, l ext，2 (j) represents the jth element in the second extended index sequence. Y represents the degree of the first solution.

[0226] Optionally, when the amplitudes of the elements in the first extended sequence are the same (e.g., all equal to 1), it can be considered that there is no extended weight sequence. In other words, in this case, the first extended weight sequence and the second extended weight sequence are the same. Further, when the first extended weight sequence and the second extended weight sequence are the same, the first solution of the idempotent sum can be independent of the first extended weight sequence and the second extended weight sequence. For example, the first solution of the idempotent sum is the first extended index sequence l ext，1 and the second extended index sequence l ext，2 , and satisfies the above formula (6).

[0227] Optionally, in the presence of an extended weight sequence, the above formula (7) can be understood as the solution of the extended idempotent sum (ie, weighted idempotent sum).

[0228] In addition, this application also provides several specific examples of the first extended sequence. As an example, the first extended sequence may satisfy the following relationship:

[0229] Among them, s ext (n) represents the nth element of the first extended sequence. N is the length of the first extended sequence. n mod 2 represents n modulo 2.

[0230] As another example, the first spreading sequence is [1, -4, 7, -8, 8, -8, 8, -8, 8, -8, 7, -4, 1].

[0231] As another example, possible implementations of the first spreading sequence may be as shown in Table 1 or Table 2.

[0232] Table 1

[0233] Optionally, the degrees of the first solutions of the idempotent sums obtained based on the first extended sequences in each row from top to bottom shown in Table 1 are 3, 4, 5, 4, 5, 5, 5, and 6 respectively.

[0234] It should be noted that, in the first extended sequence shown in Table 1, the second sequence corresponding to the element with a value of 1 is the sequence x in the GCP, the second sequence corresponding to the element with a value of -1 is the sequence y in the GCP, and the second sequence corresponding to the element with a value of 0 is not a sequence in the GCP.

[0235] Table 2

[0236] Optionally, the degrees of the first solutions of the idempotent sums obtained based on the first extended sequences in each row from top to bottom shown in Table 2 are: 3, 3, 4, 2, 4, 2, 3, 2, 2, 3, 1, 2, 2 respectively.

[0237] It should be noted that the second sequence corresponding to the elements with values ​​greater than 0 in the first extended sequence shown in Table 2 is the sequence x in the GCP, the second sequence corresponding to the elements with values ​​less than 0 is the sequence y in the GCP, and the second sequence corresponding to the elements with values ​​0 is not a sequence in the GCP.

[0238] Optionally, all possible values ​​of the first extended sequence may be part or all of the possible values ​​in Table 1, or may be part or all of the possible values ​​in Table 2.

[0239] Optionally, when the transmitting device and the receiving device are different devices, before the above-mentioned step S402, the transmitting device may indicate the first extended sequence to the receiving device, so that the receiving device determines N second sequences, thereby determining N1 first sequences sent by the transmitting device or N1 second sequences corresponding to the N1 first sequences, and then processing the first signal according to the N1 first sequences or the N1 second sequences.

[0240] Exemplarily, the transmitting device and the receiving device may preconfigure (or store) some or all of the first extended sequences shown in Table 1 or Table 2. The transmitting device may send signaling to the receiving device to indicate a first extended sequence in Table 1 or Table 2. For example, the transmitting device may send the index of the first extended sequence in Table 1 or Table 2 to the receiving device to indicate the first extended sequence.

[0241] The above describes the features possessed or satisfied by the first extended sequence. The following describes a method for determining the first extended sequence.

[0242] Optionally, the first extended sequence is determined based on a first base sequence. A second solution of the idempotent sum can be determined based on the first base sequence, or in other words, the first base sequence can be determined based on the second solution of the idempotent sum. The degree of the second solution of the idempotent sum is less than or equal to the degree of the first solution of the idempotent sum.

[0243] Optionally, when the second solution of the idempotent sum can be determined based on the first basis sequence, the first P orders of the spectral function (or fuzzy function) corresponding to the first basis sequence based on the Zinler expansion with θ=0 (θ=2πv / N) are 0. P represents the degree of the second solution of the idempotent sum.

[0244] Optionally, the elements in the weight sequence corresponding to the first basis sequence may be symmetric. The weight sequence corresponding to the first basis sequence is composed of the amplitude of each element of the first basis sequence. Symmetry of elements in a sequence means that two elements in the sequence whose sum of indices is equal to N-1 are equal. For example, taking N as 4, when the elements in the sequence are symmetric, elements with indices 0 and 3 are equal, and elements with indices 1 and 2 are equal.

[0245] Optionally, the second solution of the idempotent sum is based on the first index sequence l base，1 and the second index sequence l base，2 Determined, or in other words, based on the first index sequence l base，1 and the second index sequence l base，2 A second solution to the idempotent sum can be determined. The degree of the second solution is greater than or equal to 0.

[0246] Among them, the first index sequence l base，1The index of the first type element in the first basis sequence corresponds to the sequence x in the GCP. Exemplarily, the value of the first type element is a first numerical value, or the amplitude of the first type element is greater than 0 and the phase is a first phase. For example, the first numerical value can be 1 and the first phase can be 0.

[0247] Among them, the second index sequence l base，2 The index of the second type element in the first basis sequence corresponds to the sequence y in the GCP. Exemplarily, the value of the second type element is the second numerical value, or the amplitude of the second type element is greater than 0 and the phase is the second phase. For example, the second numerical value can be -1, and the second phase can be π.

[0248] Optionally, the elements in the first index sequence may be arranged in ascending order according to the size of the index of the first type of element, and the elements in the second index sequence may be arranged in ascending order according to the size of the index of the second type of element.

[0249] Optionally, the first base sequence further includes an element having a value equal to a third numerical value. Exemplarily, the third numerical value may be 0. When an element of the first base sequence has the third numerical value, it may correspond to a sequence having the same elements, such as a sequence of 0s.

[0250] For example, the length of the first base sequence is 8, the first base sequence s base =[1,-1,-1,1,1,-1,-1,1], the value of the first type element is 1, and the value of the second type element is -1, for example, the first index sequence l base，1 l base，1 =[0, 3, 4, 7], the second extended index sequence l ext，2 l ext，2 =[1, 2, 5, 6]. Alternatively, the length of the first base sequence is 12, and the first base sequence s base =[1,-1,-1,0,1,0,0,1,0,-1,-1,1], the value of the first type element is 1, and the value of the second type element is -1, for example, the first index sequence l base，1 l base，1 =[0, 4, 7, 11], the second extended index sequence l ext，2 l ext，2 =[1, 2, 9, 10].

[0251] As a possible implementation, the first index sequence l base，1 and the second index sequence l base，2 It is the second solution of the idempotent sum, satisfying:

[0252] Among them, N base，1is the length of the first index sequence, or the number of first-category elements in the first base sequence. base，1 (i) represents the i-th element in the first index sequence. N base，2 is the length of the second index sequence, or the number of the second type elements in the first base sequence, l base，2 (j) represents the jth element in the second index sequence. P represents the degree of the second solution, and P is a natural number.

[0253] Illustratively, when the first index sequence and the second index sequence corresponding to the first base sequence of length 8 are used as the second solution of the idempotent sum, the degree P of the second solution is equal to 1. When the first index sequence and the second index sequence corresponding to the first base sequence of length 12 are used as the second solution of the idempotent sum, the degree P of the second solution is equal to 3.

[0254] As another possible implementation, the second solution of the idempotent sum is based on the first index sequence l base，1 , the second index sequence l base，2 , the first weight sequence q base，1 , and the second weight sequence q base，2 Sure.

[0255] The first weight sequence includes the amplitude of the first type of elements. The elements in the first weight sequence correspond to the elements in the first index sequence one by one, that is, the i-th element q in the first weight sequence base，1 (i) with the i-th element l in the first index sequence base，1 (i) Correspondingly, these two elements constitute a first-category element in the first basis sequence. The first-category element can be referred to the above related description and will not be repeated here.

[0256] The second weight sequence includes the amplitude of the second type of elements. The elements in the second weight sequence correspond to the elements in the second index sequence one by one, that is, the i-th element q in the second weight sequence base，2 (i) and the i-th element l in the second index sequence base，2 (i) Correspondingly, these two elements constitute a second type element in the first basis sequence. The second type element can refer to the above related description and will not be repeated here.

[0257] Optionally, the elements in the first weight sequence and the second weight sequence may be symmetrical. The symmetry of the elements in the sequence can be referred to the above description and will not be repeated here.

[0258] Optionally, the elements in the first weight sequence and the second weight sequence may be real numbers, that is, the amplitudes of the elements in the first basis sequence may be real numbers.

[0259] For example, the amplitude of the first type of element is greater than 0 and the phase is 0 (ie, the value of the first type of element is greater than 0), the amplitude of the second type of element is greater than 0 and the phase is π (ie, the value of the second type of element is less than 0), the first basis sequence s base =[0.69, -4.29, 9.48, -6.23, -6.56, 7.70, 7.13, -7.92, -7.92, 7.13, 7.70, -6.56, -6.23, 9.48, -4.29, 0.69] as an example, the first index sequence l base，1 for l base，1 =[0, 2, 5, 6, 9, 10, 13, 15], the second index sequence l base，2 for l base，2 =[1, 3, 4, 7, 8, 11, 12, 14]. Accordingly, the first weight sequence q base，1 q base，1 =[0.69, 9.48, 7.70, 7.13, 7.13, 7.70, 9.48, 0.69], the second weight sequence q base，2 q base，2 =[4.29, 6.23, 6.56, 7.92, 7.92, 6.56, 6.23, 4.29] In this example, the elements in the first weight sequence and the second weight sequence are symmetrical.

[0260] Based on this scheme, when the elements in the weight sequence corresponding to the first basis sequence are symmetrical, or when the elements in the first weight sequence and the second weight sequence are symmetrical, due to the symmetry of the elements, only the amplitudes of half of the elements need to be designed during the design process; the amplitudes of the other half can be directly determined based on the symmetry, reducing the complexity of sequence design. Furthermore, most window functions (such as Hamming windows) or filters currently used in signal processing are symmetrical, so the symmetry of the elements in the designed sequence is more consistent with conventional signal processing rules and has higher compatibility.

[0261] In this possible implementation, optionally, the first index sequence l base，1 , the second index sequence l base，2 , the first weight sequence q base，1 , and the second weight sequence q base，2 It is the second solution of the idempotent sum, satisfying:

[0262] Among them, N base，1 is the length of the first index sequence, q base，1 (i) represents the i-th element in the first weight sequence, l base，1 (i) represents the i-th element in the first index sequence; N base，2 is the length of the second index sequence, q base，2(j) represents the jth element in the second weight sequence, l base，2 (j) represents the jth element in the second index sequence. P represents the degree of the second solution, and P is a natural number.

[0263] Optionally, when the amplitudes of the elements in the first basis sequence are the same (e.g., all equal to 1), it can be considered that there is no weight sequence. In other words, in this case, the first weight sequence and the second weight sequence are the same. Further, when the first weight sequence and the second weight sequence are the same, the second solution of the idempotent sum can be independent of the first weight sequence and the second weight sequence. For example, the second solution of the idempotent sum is the first index sequence l base，1 and the second index sequence l base，2 , and satisfies the above formula (8).

[0264] Optionally, in the presence of a weight sequence, the above formula (9) can be understood as the solution of an extended idempotent sum (ie, a weighted idempotent sum).

[0265] As an example, possible implementations of the first base sequence may be shown in Table 3.

[0266] Table 3

[0267] Optionally, the first basis sequence shown in Table 3 may be determined according to the method described in the above embodiment of this application. In this case, the degrees P of the second solutions corresponding to the first basis sequences in each row from top to bottom shown in Table 3 are: 1, 1, 2, 2, 3, 4, 4, 5, respectively. Alternatively, the first basis sequence shown in Table 3 may be determined according to other methods. This application does not specifically limit the method for determining the first basis sequence shown in Table 3.

[0268] As another example, possible implementations of the first base sequence may be as shown in Table 4.

[0269] Table 4

[0270] Optionally, the first basis sequence shown in Table 4 may be determined according to the method described in the above embodiment of the present application. In this case, the degrees P of the second solutions corresponding to the first basis sequence in each row from top to bottom shown in Table 4 are: 0, 1, 2, 0, 1, 0, 1, 2, 3, 0, 0, 1, 0, 0, 0. Alternatively, the first basis sequence shown in Table 4 may be determined according to other methods. The present application does not specifically limit the method for determining the first basis sequence shown in Table 4.

[0271] Optionally, the first basis sequence shown in Table 4 may be appropriately transformed to obtain a new first basis sequence. For example, each element in the first basis sequence shown in Table 4 may be multiplied by a value C to obtain a new first basis sequence. C may be any value.

[0272] As another example, possible implementations of the first base sequence may be as shown in Table 5.

[0273] Table 5

[0274] Optionally, the first basis sequence shown in Table 5 may be determined according to the method described in the above embodiment of this application. In this case, the degree P of the second solution corresponding to the first basis sequence is 1. Alternatively, the first basis sequence shown in Table 5 may be determined according to other methods. This application does not specifically limit the method for determining the first basis sequence shown in Table 5.

[0275] Optionally, when the transmitting end device is a terminal device, before step S402, the network device may indicate the first base sequence to the transmitting end device via signaling, so that the terminal device determines the first extended sequence, thereby determining N second sequences based on the first extended sequence, further determining N first sequences based on the N second sequences, and then transmitting N1 first sequences of the N first sequences. The signaling may be RRC signaling or downlink control signaling (DCI).

[0276] Exemplarily, the first base sequence shown in Table 3, Table 4, or Table 5 may be preconfigured (or stored) in the transmitting end device. The network device may use 4-bit RRC signaling to indicate the 15 possible values ​​of the first base sequence shown in Table 4. For example, 15 of the 16 possible values ​​of the 4 bits may correspond one-to-one to the 15 possible values ​​of the first base sequence shown in Table 4. The network device may send a certain value of the 4 bits to the transmitting end device, and the first base sequence indicated by the network device is the first base sequence corresponding to the value. Alternatively, the network device may use 3-bit RRC signaling to indicate the possible values ​​of the 8 first base sequences shown in Table 3, or use 1-bit RRC signaling to indicate the first base sequence shown in Table 5.

[0277] Alternatively, each first base sequence shown in Table 3, Table 4, or Table 5 may correspond to an index. For example, the index of the first base sequence shown in each row from top to bottom in Table 3 may be 1 to 8 or 0 to 7. In this case, the network device may indicate the index corresponding to the first base sequence to the terminal device, and the terminal device may determine the first base sequence corresponding to the index based on the index indicated by the network device.

[0278] Optionally, all possible values ​​of the first basis sequence may be the first basis sequences in one or more rows in Table 3, or may be the first basis sequences in one or more rows in Table 4, or may be the first basis sequences in Table 5.

[0279] Optionally, when the transmitting device and the receiving device are different devices, before the above-mentioned step S402, the transmitting device may indicate the first base sequence to the receiving device, so that the receiving device determines the N1 first sequences sent by the transmitting device or the N1 second sequences corresponding to the N1 first sequences, thereby processing the first signal according to the N1 first sequences or the N1 second sequences.

[0280] Exemplarily, the transmitting device and the receiving device may preconfigure (or store) some or all of the first base sequences shown in Table 3, Table 4, or Table 5. The transmitting device may use 3-bit signaling to indicate the 8 possible values ​​of the first base sequence shown in Table 3, or use 4-bit signaling to indicate the 15 possible values ​​of the first base sequence shown in Table 4, or use 1-bit signaling to indicate the first base sequence shown in Table 5. Reference may be made to the above-mentioned description of the network device indicating the first base sequence to the terminal device, which will not be repeated here.

[0281] Optionally, in addition to the first base sequences shown in Table 3, Table 4, or Table 5, the present application also provides two implementations of the first base sequence. In the first implementation, the length of the first base sequence is greater than 1, and the first base sequence is based on the repetition of [1, -1].

[0282] That is, the length of the first base sequence N base When it is an even number, the first basis sequence is composed of N base / 2 [1, -1] are spliced ​​in sequence. The length of the first base sequence is N base When it is an odd number, the first basis sequence is (N base -1) / 2 [1, -1] are sequentially spliced ​​and then 1 is spliced. For example, N base =6, the first base sequence can be [1, -1, 1, -1, 1, -1]; N base When =7, the first basis sequence can be [1, -1, 1, -1, 1, -1, 1].

[0283] Optionally, in this approach, the first basis sequence obtained by repeating [1, -1] may be appropriately transformed to obtain a new first basis sequence. For example, each element in the first basis sequence obtained by repeating [1, -1] may be multiplied by a value C to obtain a new first basis sequence. C may be any value.

[0284] Optionally, when the length of the first sequence is an even number and the first base sequence is based on the repetition of [1, -1], the second solution of the idempotent sum can also be determined according to the first base sequence.

[0285] In a second implementation manner, the first base sequence may be a PTM sequence.

[0286] Based on the above scheme, since a second solution of the idempotent sum can be determined based on the first basis sequence, when the degree of the second solution is greater than or equal to 1, the spectral function corresponding to the first basis sequence has a low ambiguity region. Furthermore, the first extension determined based on the first basis sequence can retain the properties of the first basis sequence, so that a solution of the idempotent sum (i.e., the first solution) can also be obtained based on the first extension sequence, and this idempotent sum solution has a larger degree, thereby making the spectral function corresponding to the first extension sequence have a larger low ambiguity region, thereby improving detection performance.

[0287] Optionally, regarding the relationship between the first extended sequence and the first base sequence, there may be the following two situations:

[0288] Case 1: The first extended sequence is identical to the first base sequence. In this case, the length of the first extended sequence is identical to the length of the first base sequence, and the degree of the second solution of the idempotent sum is identical to the degree of the first solution of the idempotent sum, ie, Y=P.

[0289] Based on the first situation, after the first base sequence is determined, the first extended sequence can be determined without further calculation, which can reduce the calculation complexity and the computing resource overhead of the transmitting end device.

[0290] Case 2: The first extended sequence is determined according to the first base sequence and the offset sequence T. The length of the offset sequence is M, where M is a positive integer.

[0291] Optionally, the length of the first extended sequence is related to the length of the first base sequence and the elements in the offset sequence. Exemplarily, the three may satisfy the following relationship:

[0292] Wherein, N is the length of the first extended sequence. base is the length of the first base sequence. t(m) represents the mth element in the offset sequence, that is, the offset sequence T = [t(0), t(1), ..., t(M-1)], where t(m) is a positive integer.

[0293] For example, possible implementations of the offset sequence may be shown in Table 6.

[0294] Table 6

[0295] Optionally, for a certain value of M, the possible values ​​of the offset sequence may be some or all of the multiple possible offset sequences corresponding to the value of M in Table 6. For example, when the length M of the offset sequence is 1, the offset sequence may be one of the six possible offset sequences [1], [2], [3], [4], [5], and [6] corresponding to the length M of 1 in Table 6.

[0296] Optionally, in this second case, the degree Y of the first solution of the idempotent sum corresponding to the first extended sequence is equal to the sum of the degree P of the second solution of the idempotent sum corresponding to the first base sequence and the length M of the offset sequence, that is, Y=P+M.

[0297] Optionally, an offset sequence can be used to extend the first base sequence to obtain a first extended sequence. The length of the offset sequence can be understood as the number of extensions. In addition, the subsequent extension can be performed based on the result of the previous extension.

[0298] Illustratively, the first base sequence may be extended in the following three ways according to the offset sequence to obtain a first extended sequence.

[0299] Method 1: Expand the first base sequence by concatenating and summing the offset sequence.

[0300] Optionally, the m-1th intermediate sequence s m-1 Then, t(m) 0s are added to get sequence 1. After t(m) 0s, the reverse sequence of the m-1th intermediate sequence is added -s. m-1 (The reverse sequence is composed of the reverse numbers of each element of the m-1th intermediate sequence) to obtain sequence 2, and then sum sequence 1 and sequence 2 to obtain the mth intermediate sequence s m .

[0301] Where m = 0, 1, ..., M-1. When m = 0, the -1th intermediate sequence s -1 and the first basis sequence s base Same. When m=M-1, the M-1th intermediate sequence s M-1 That is the first extended sequence, that is, the nth element s of the first extended sequence ext (n) and the intermediate sequence s M-1 The nth element s M-1 (n) Same.

[0302] For example, in this way, s m Satisfies the following relationship: s m =[s m-1 , 0 1×t(m) ]+[0 1×t(m) , -s m-1 ], m = 0, 1, ..., M-1

[0303] Among them, s -1 Same as the first base sequence, 0 1×t(m) Represents a row vector (or array) consisting of t(m) zeros. m include Elements. -1 and s m Represented as a row vector (or array).

[0304] For example, the amplitude of the first type element is greater than 0 and the phase is 0 (that is, the value of the first type element is greater than 0) and corresponds to the sequence x in the GCP, the amplitude of the second type element is greater than 0 and the phase is π (that is, the value of the second type element is less than 0) and corresponds to the sequence y in the GCP, and the third value is equal to 0 and corresponds to the 0 sequence. Assume that the first base sequence s base =[1,-1,-1,0,1,1,-1],N base =7, P=2, offset sequence T=[1,2], that is, M=2, then:

[0305] When m=0: s0=[s -1 , 0 1×1 ]+[0 1×1 , -s -1 ]

[0306] =[1,-1,-1,0,1,1,-1,0]+[0,-1,1,1,0,-1,-1,1]

[0307] =[1,-2,0,1,1,0,-2,1].

[0308] When m=1: s1=[s0,0 1×2 ]+[0 1×2 , -s0]

[0309] =[1,-2,0,1,1,0,-2,1,0,0]+[0,0,-1,2,0,-1,-1,0,2,-1]

[0310] =[1,-2,-1,3,1,-1,-3,1,2,-1].

[0311] That is, the first extended sequence s ext is [1, -2, -1, 3, 1, -1, -3, 1, 2, -1] (same as s1). At this time, the length of the first extended sequence is The degree of the first solution is Y=P+M=4.

[0312] Method 2: Expand the first base sequence by shifting the sequence and calculating the difference according to the offset sequence.

[0313] Optionally, the difference between the ith element of sequence 1 and the ith element of sequence 2 can be used as the ith element of the mth intermediate sequence. Wherein, sequence 1 is the m-1th intermediate sequence s m-1 ; Sequence 2 is the m-1th intermediate sequence s m-1 The sequence obtained by right shifting by t(m) positions.

[0314] Where m = 0, 1, ..., M-1. When m = 0, the -1th intermediate sequence s -1 and the first basis sequence s base Same. When m=M-1, the M-1th intermediate sequence s M-1 That is the first extended sequence, that is, the nth element s of the first extended sequence ext (n) and the intermediate sequence s M-1 The nth element s M-1 (n) Same.

[0315] For example, in the second method, s m Satisfies the following relationship: s m (i) = s m-1 (i)-s m-1 (it(m)), m=0, 1,..., M-1

[0316] Among them, s -1 Same as the first base sequence, s m include elements, namely s -1 and s m Represented as a row vector (or array).

[0317] in, When m-1 (i)=0;it(m)<0,s m-1 (it(m))=0.

[0318] Method 3: Expand the first base sequence by calculating the difference and splicing the sequence according to the offset sequence.

[0319] Optionally, the nth element of the first extended sequence is the difference between the first number and the second number. M-1 The number of elements with value n in the sequence B. M-1 The number of elements with value n, n = 0, 1, ..., N-1.

[0320] Optionally, the intermediate sequence B m-1 After adding t(m) to each element of m-1Then we get the intermediate sequence A m For the intermediate sequence A m-1 After adding t(m) to each element of m-1 Then we get the intermediate sequence B m Where m = 0, 1, ..., M-1. When m = M-1, the M-1th intermediate sequence is sequence A. M-1 , the M-1th intermediate sequence is sequence B M-1 .

[0321] For example, sequence A m and sequence B m Satisfaction: A m =[A m-1 , B m-1 +t(m)], m=0, 1,..., M-1 B m =[B m-1 , A m-1 +t(m)], m=0, 1,..., M-1

[0322] Among them, A -1 q base，1 (i) l base，1 (i) a sequence of components, i = 0, 1, ..., N base，1 -1; B -1 q base，2 (j) l base，2 (j) is a sequence composed of j = 0, 1, ..., N base，2 -1. A -1 , A m , B -1 and B m Represented as a row vector (or array).

[0323] Among them, q base，1 (i) represents the i-th element in the first weight sequence, l base，1 (i) represents the i-th element in the first index sequence. base，2 (j) represents the jth element in the second weight sequence, l base，2 (j) represents the jth element in the second index sequence. The first weight sequence, the first index sequence, the second weight sequence, and the second index are determined according to the first base sequence. For details, please refer to the above related descriptions and will not be repeated here.

[0324] For example, sequence A -1 and sequence B -1 The possible implementations can be shown in Table 7.

[0325] Table 7

[0326] Optionally, the sequence A in row q shown in Table 7 -1 and sequence B -1 It may be determined according to the first base sequence in the qth row shown in Table 3, or may be determined according to other methods, which is not specifically limited in this application.

[0327] For example, the amplitude of the first type element is greater than 0 and the phase is 0 (that is, the value of the first type element is greater than 0) and corresponds to the sequence x in the GCP, the amplitude of the second type element is greater than 0 and the phase is π (that is, the value of the second type element is less than 0) and corresponds to the sequence y in the GCP, and the third value is equal to 0 and corresponds to the 0 sequence. Assume that the first base sequence s base =[1,-2,0,2,-1],N base =5, P=2, offset sequence T=[1,3], that is, M=2, then, l base，1 =[0,3],l base，2 =[1,4],q base，1 =[1,2],q base，2 =[2,1], so A -1 =[0,3,3],B -1 =[1, 1, 4]. In this scenario:

[0328] When m=0:A0=[A -1 , B -1 +1]=[0, 3, 3, 2, 2, 5], B0=[B -1 , A -1 +1] = [1, 1, 4, 1, 4, 4].

[0329] When m=1: A1=[A0, B0+3]=[0, 3, 3, 2, 2, 5, 4, 4, 7, 4, 7, 7], B1=[B0, A0+3]=[1, 1, 4, 1, 4, 4, 3, 6, 6, 5, 5, 8].

[0330] Based on A1 and B1 in this example, the nth element of the first extended sequence is the difference between the first number and the second number, n = 0, 1, ..., N-1, the first number is the number of elements with a value of n in sequence A1, and the second number is the number of elements with a value of n in sequence B1. The first extended sequence is s ext =[1,-3,2,1,0,-1,-2,3,-1].

[0331] Optionally, for a given first base sequence and offset sequence, the first extended sequences determined respectively according to the above-mentioned methods 1, 2, and 3 are the same. That is, method 1, method 2, or method 3 can be understood as different implementations or different descriptions of the same relationship.

[0332] Optionally, when the transmitting device and the receiving device are different devices and the first extended sequence and the first base sequence satisfy the above-described second condition, before step S402, the transmitting device may indicate the first base sequence and the offset sequence to the receiving device, so that the receiving device can determine the first extended sequence based on the first base sequence and the offset sequence, thereby determining the N1 first sequences sent by the transmitting device or the N1 second sequences corresponding to the N1 first sequences, and then processing the first signal based on the N1 first sequences or the N1 second sequences. For example, the method for indicating the first base sequence can refer to the aforementioned related description, and the method for indicating the offset sequence can refer to the method for indicating the first base sequence, which will not be further described here.

[0333] Based on the above-mentioned method one, method two, or method three, the first extension determined according to the first base sequence can retain the properties of the first base sequence, so that the solution of the equal idempotent sum (i.e., the first solution) can also be obtained according to the first extended sequence, and the solution of the equal idempotent sum has a larger degree (i.e., P+M), so that the spectral function corresponding to the first extended sequence has a larger low ambiguity area, thereby improving the detection performance. In addition, in response to different requirements for low ambiguity area sizes or low ambiguity area thresholds, different offset sequences and / or different first base sequences can be flexibly selected to determine the first extended sequence that meets the requirements, thereby improving the design freedom of the extended sequence.

[0334] In addition, the embodiments of the present application provide the above three methods for determining the first extended sequence according to the first base sequence. In actual applications, any method can be flexibly selected to determine the first extended sequence according to needs or the capabilities of the transmitting device, which has high flexibility and wide applicability.

[0335] Optionally, the first extended sequence shown in Table 1 or Table 2 or relationship (A) can be determined based on the above-mentioned method 1, method 2 or method 3, or can be determined in other ways. This application does not specifically limit the determination method.

[0336] Exemplarily, when the first extended sequence shown in relationship (A) is determined based on the above-mentioned method one, method two, or method three, the length of the first base sequence for generating the first extended sequence is an even number greater than 3, the first base sequence is based on the repetition of [1, -1], and the offset sequence T = [1, 1].

[0337] For example, when the length of the first base sequence is 6 (i.e., the first base sequence is [1, -1, 1, -1, 1, -1]), and the offset sequence T = [1, 1], the corresponding first extended sequence is: [1, -3, 4, -4, 4, -4, 3, -1].

[0338] The length of the first base sequence is 8 (i.e., the first base sequence is [1, -1, 1, -1, 1, -1, 1, -1]). When the offset sequence T = [1, 1], the corresponding first extended sequence is: [1, -3, 4, -4, 4, -4, 4, -4, 3, -1].

[0339] The length of the first base sequence is 10 (i.e., the first base sequence is [1, -1, 1, -1, 1, -1, 1, -1, -1]). When the offset sequence T = [1, 1], the corresponding first extended sequence is: [1, -3, 4, -4, 4, -4, 4, -4, 4, -4, 3, -1].

[0340] In addition, the length of the first base sequence is 10 (i.e., the first base sequence is [1, -1, 1, -1, 1, -1, 1, -1, -1]), and when the offset sequence T = [1, 1, 1], the corresponding first extended sequence is: [1, -4, 7, -8, 8, -8, 8, -8, 8, -8, 7, -4, 1].

[0341] Illustratively, when the first extended sequence shown in Table 1 is determined based on the above-mentioned method 1, method 2, or method 3, the first base sequence and offset sequence for generating the first extended sequence may be as shown in Table 8.

[0342] Table 8

[0343] Illustratively, when the first extended sequence shown in Table 2 is determined based on the above-mentioned method 1, method 2, or method 3, the first base sequence and offset sequence for generating the first extended sequence may be as shown in Table 9.

[0344] Table 9

[0345] Optionally, the first extended sequence may be appropriately transformed to obtain a new extended sequence. For example, each element in the first extended sequence may be multiplied by a value D to obtain a new extended sequence. D may be any non-zero value.

[0346] Based on the above example, when the amplitudes of the elements in the first extended sequence are all identical, the signal-to-noise ratio (SNR) loss at the receiving side is low. When the amplitudes of the elements in the first extended sequence are not identical, the low-ambiguity region of the spectral function corresponding to the first extended sequence is larger. Therefore, the first extended sequence can be flexibly selected based on actual needs. For example, if a certain loss of SNR is acceptable, a first extended sequence with unequal amplitudes can be selected to increase the low-ambiguity region, thereby improving detection performance. If a higher SNR is desired, a first extended sequence with identical amplitudes can be selected to increase the SNR and thus improve detection performance.

[0347] Furthermore, based on the above example, first extended sequences of different lengths can correspond to different first base sequences and offset sequences. That is, appropriate first base sequences and offset sequences can be selected based on the length of the first extended sequence, thereby optimizing the spectral function performance corresponding to the first extended sequence. First extended sequences of the same length can correspond to different first base sequences and offset sequences, thereby meeting different performance requirements.

[0348] For example, taking the first extended sequence of length 20 shown in Table 9 above as an example, when the first base sequence is [1, -1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, 1, -1], the offset sequence is [1, -1], and the first extended sequence is [1, -3, 2, 2, -2, -2, 2, 2, -2, -2, 2, -2, -2, 2, -2, -2, 3, -1], the spectral function of the first extended sequence obtained according to formula (2) is shown in Figure 5. The ordinate is the energy (or value) of the spectral function in dB. The abscissa is 2v / N, -N / 2≤v≤N / 2, and v is a real number.

[0349] Taking the threshold of -35dB as an example, it can be seen from Figure 5 that there is an area where the energy of the spectral function is less than or equal to -35dB near the value of 0 on the horizontal axis, that is, there is a low ambiguity zone near the value of 0 on the horizontal axis. It can be seen from Figure 5 and Figure 1b that compared with the solution of determining multiple sequences based on the PTM sequence, the solution of the present application can produce a larger low ambiguity zone, thereby improving the detection performance. In addition, compared with the PTM solution corresponding to Figure 1b, while improving the detection performance, the number of sequences sent can also be reduced (the number of sequences of the PTM solution corresponding to Figure 1b is 32, and the number of sequences corresponding to Figure 5 is 20), thereby saving resources. Among them, when the horizontal axis is 0, it means that the value of v is 0. v being 0 means that the discrete index of the Doppler domain is 0, and thus indicates that the corresponding target's moving speed is 0, or that the target is stationary.

[0350] It can be understood that FIG5 is only an example of a low ambiguity area generated based on the solution of the present application, using N equal to 20 and the first extended sequence being a first extended sequence in Table 9 when N=20. For the first extended sequences in other rows of Table 1 or Table 2 or Table 8 or Table 9, under the same low ambiguity area threshold and a similar number of sequences (such as the number of sequences of the PTM solution is a power of 2, and the number of sequences is a minimum value not less than N), a larger low ambiguity area can be generated compared to the PTM solution; or compared to the PTM solution, the solution of the present application can generate a low ambiguity area of ​​similar size by sending a smaller number of sequences.

[0351] The above describes the design of the first extended sequence and the first base sequence. The following describes in detail the transmission of the first sequence.

[0352] For the transmit power of N first sequences:

[0353] In some implementation scenarios, if the amplitudes of the non-zero values ​​of the first extended sequence are not completely the same, the power of the nth first sequence in the N first sequences is calculated based on the amplitude of the nth element in the first extended sequence |s ext (n)|definite.

[0354] As a possible implementation, the ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence among the N first sequences is equal to |s ext (n)| / |s ext (n′)|. Where n and n′ are any integers from 0 to N-1, and n≠n′. |s ext (n)| is the amplitude of the nth element in the first extended sequence, |s ext (n′)| is the amplitude of the n′th element in the first extended sequence, and |s ext (n′)|≠0.

[0355] Optionally, in this possible implementation, each element of the nth second sequence in the N second sequences may be multiplied by Obtain a new nth second sequence, and then determine the nth first sequence based on the new nth second sequence, so that the ratio of the power of the nth first sequence to the power of the n′th first sequence is equal to |s ext (n)| / |s ext The relationship between the second sequence and the first sequence will be explained in subsequent embodiments and will not be repeated here.

[0356] As another possible implementation, the ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence among the N first sequences is equal to [s ext (n)] 2 / [s ext (n′)] 2 Where n and n' are any integers from 0 to N-1, and n≠n'. ext (n) is the nth element in the first extended sequence, s ext (n') is the n'th element in the first extended sequence, and s ext (n′)≠0.

[0357] Optionally, in this possible implementation, each element of the nth second sequence in the N second sequences may be multiplied by |s ext (n)| obtain a new nth second sequence, and then determine the nth first sequence based on the new nth second sequence, so that the ratio of the power of the nth first sequence to the power of the n′th first sequence is equal to [s ext (n)] 2 / [s ext (n′)] 2 The relationship between the second sequence and the first sequence will be explained in subsequent embodiments and will not be repeated here.

[0358] In other implementation scenarios, if the amplitudes of the non-zero values ​​of the first extended sequence are not completely the same, the transmit powers of the N first sequences may be the same. In this case, the receiving end device calculates the amplitude of the nth element in the first extended sequence |s ext (n)|Process the received nth first sequence.

[0359] As a possible implementation, the ratio of the received power of the nth first sequence among the N first sequences to the received power of the n′th first sequence among the N first sequences is equal to |s ext (n)| / |s ext (n′)|. Where n and n′ are any integers from 0 to N-1, and n≠n′. |s ext (n)| is the amplitude of the nth element in the first extended sequence, |s ext (n′)| is the amplitude of the n′th element in the first extended sequence, and |s ext (n′)|≠0.

[0360] Optionally, in this possible implementation, the receiving end device may multiply the received nth first sequence by Obtain a new nth first sequence, and then perform detection based on the new nth first sequence, so that the ratio of the received power of the received nth first sequence to the received power of the received n′th first sequence is equal to |s ext (n)| / |s ext (n′)|.

[0361] As another possible implementation, the ratio of the received power of the nth first sequence among the N first sequences to the received power of the n′th first sequence among the N first sequences is equal to [s ext (n)] 2 / [s ext (n′)] 2 Where n and n' are any integers from 0 to N-1, and n≠n'. ext (n) is the nth element in the first extended sequence, s ext (n') is the n'th element in the first extended sequence, and s ext (n′)≠0.

[0362] Optionally, in this possible implementation, the receiving end device may multiply the received nth first sequence by |s ext (n)| obtain a new nth first sequence, and then perform detection based on the new nth first sequence, so that the ratio of the received power of the received nth first sequence to the received power of the received n′th first sequence is equal to [s ext (n)] 2 / [s ext (n′)] 2 .

[0363] Based on this scheme, when the amplitudes of the non-zero values ​​of the first extended sequence are not exactly the same, the power of the N first sequences sent by the transmitting device or the received power of the N first sequences received by the receiving device can be determined by the amplitudes of the elements of the first extended sequence, so that the property of the first extended sequence including the first solution of the equal power sum is not destroyed, thereby maintaining good performance in the low ambiguity area of ​​the spectral function corresponding to the first extended sequence, thereby improving the detection performance.

[0364] For the time domain positions of N1 first sequences:

[0365] Optionally, the N1 first sequences are mapped and sent in the time domain. The transmitting end device outputs the N1 first sequences, including: the transmitting end device sequentially sends the N1 first sequences in N1 first time units in N consecutive time units.

[0366] Optionally, the positions (or indices) of the N1 first time units in the N time units are the same as the positions (or indices) of the N1 first sequences in the N first sequences. For example, taking N=14 and the first extended sequence being [1, -1, -1, 0, 1, 1, -1, -1, 1, 1, 0, -1, -1, 1] as an example, the N1 first sequences are the 0th, 1st, 2nd, 4th, 5th, 6th, 7th, 8th, 9th, 11th, 12th, and 13th first sequences in the 14 first extended sequences. In this case, as shown in FIG6 , the N1 first time units are the 0th, 1st, 2nd, 4th, 5th, 6th, 7th, 8th, 9th, 11th, 12th, and 13th time units in the 14 consecutive time units.

[0367] Optionally, a time unit may refer to a continuous period of time, or a continuous period of time domain resources. Since a time domain signal can be converted into a frequency domain signal based on Fourier transform, that is, a time domain signal transmitted within a period of time domain resources can be converted into a frequency domain signal, it can also be said that a continuous period of time domain resources corresponds to a period of frequency domain resources, and thus the time domain resources and their corresponding frequency domain resources can be collectively referred to as time-frequency resources.

[0368] Optionally, a time unit may include at least one symbol. The symbol may be a single carrier symbol; or, it may be a single carrier quadrature amplitude modulation (SC-QAM) symbol; or, it may be a single carrier frequency division multiple access (SC-FDMA) symbol.

[0369] Optionally, the duration of a time unit (or duration) can be expressed as L unit ×P×T s Among them, T s Indicates the time unit (or sampling interval). s It can be determined according to the subcarrier spacing. For example, when the subcarrier spacing is 15 kHz, T s It can be 1 / (2048×15000) seconds (s). P is a positive integer, for example, P can be 1 or 2. Exemplarily, P can be understood as a multiple of upsampling.

[0370] Among them, L unit It can be understood as the number of discrete points (or sampling points) in a time unit. The time interval between any two adjacent discrete points is P×T s That is, P×T s By dividing (or sampling) the time unit into intervals, we can get Lunit discrete points (or discrete time-domain positions).

[0371] Optional, L unit The value of can be greater than or equal to the length of the sequence sent in this time unit. unit It can also be called the length of a time unit. That is, in the embodiment of the present application, the duration of a time unit can refer to a continuous duration; the length of a time unit can refer to the number of discrete points. The length of a time unit is L unit It can also be understood that L can be sent within this time unit unit discrete values.

[0372] Optionally, the length of a time unit is L unit When the time unit can include L unit single carrier symbols or including L unit SC-QAM symbols. Each single carrier symbol or each SC-QAM symbol can send a value (such as a complex value). The duration of each single carrier symbol or each SC-QAM symbol is P×T s Alternatively, the length of a time unit is L unit When , the time unit may include at least one SC-FDMA symbol.

[0373] Optionally, the total duration of the above N consecutive time units can be PT s Sampling the time domain signal in N consecutive time units at intervals can obtain values, It can be understood as the total length of N consecutive time units.

[0374] Optionally, the transmitting end device may send the n′th first sequence among the N1 first sequences within the n′th first time unit among the N1 first time units. That is, one first sequence is sent within one first time unit, and the N1 first time units correspond to the N1 first sequences one-to-one.

[0375] Optionally, the transmitting end device may generate an n'th second signal (the second signal is a continuous time domain signal) based on the n'th first sequence among the N1 first sequences, and the n'th second signal may be transmitted within the n'th first time unit. That is, the second signal generated based on one first sequence is transmitted within one first time unit, and there is a one-to-one correspondence between the N1 first time units and the N1 second signals generated based on the N1 first sequences.

[0376] Optionally, the length (or duration) of each of the N time units is equal, the length of each time unit is greater than or equal to the length of the first sequence, or the duration of each time unit is greater than or equal to the duration of the second signal generated based on the first sequence.

[0377] Optionally, the n′th first sequence among the N1 first sequences is mapped starting from the starting position of the n′th first time unit among the N1 first time units. Of course, mapping can also be started from other positions of the first time unit, and it is only necessary to map the n′th first sequence within the n′th first time unit. This application does not make specific restrictions on this. For example, the end mapping position (or called the end time domain position) of the n′th first sequence can be the same as the end position of the n′th first time unit.

[0378] Optionally, the time domain position of the first sequence can be the starting time domain position of the first sequence, the ending time domain position of the first sequence, or the time domain position of an intermediate element of the first sequence (except the 0th element and the L1-1th element). This application does not make specific limitations on this.

[0379] Optionally, when the time domain position of the n′th first sequence is the starting time domain position of the n′th first sequence, the starting time domain position may be the starting position of the n′th first time unit, that is, the n′th first sequence among the N1 first sequences is mapped starting from the starting position of the n′th first time unit among the N1 first time units.

[0380] For example, the total length is All positions of N consecutive time units are numbered from 0 to When the starting time domain position of the nth first sequence among the N first sequences is in, Afterwards, the starting time domain position of the n′th first sequence in the N1 first sequences can be determined according to the positions (or indexes) of the N1 first sequences in the N first sequences.

[0381] Alternatively, illustratively, the ratio of the starting time domain position of the nth first sequence in the N first sequences to the length of the first sequence may be the nth element in the first position relationship sequence, and the nth element in the first position relationship sequence satisfies:

[0382] Where L1 is the length of the first sequence. It can be understood that when the length of the nth time unit When the length of the first sequence is the same as that of the first sequence, I1(n) = n. After determining the starting time domain position of the nth first sequence among the N first sequences according to the above relationship, the starting time domain position of the n′th first sequence among the N1 first sequences can be determined according to the position (or index) of the N1 first sequences among the N first sequences.

[0383] Optionally, when the time domain position of the n′th first sequence is the end time domain position of the n′th first sequence, the end time domain position may be the end position of the n′th first time unit, that is, the end time domain position of the n′th first sequence in the N1 first sequences is the same as the end position of the n′th first time unit.

[0384] For example, the total length is All positions of N consecutive time units are numbered from 0 to When the end time domain position of the nth first sequence in the N first sequences is Afterwards, the end time domain position of the n′th first sequence in the N1 first sequences can be determined according to the positions (or indexes) of the N1 first sequences in the N first sequences.

[0385] In the above solution, the nth first sequence among the N first sequences is determined based on the nth second sequence among the N second sequences. The relationship between the nth first sequence and the nth second sequence is described below. Optionally, the nth first sequence and the nth second sequence satisfy one of the following four relationships:

[0386] Relationship 1: The nth first sequence and the nth second sequence are the same.

[0387] For example, if the nth second sequence is sequence x in the GCP, then the nth first sequence is also sequence x in the GCP. If the nth second sequence is sequence y in the GCP, then the nth first sequence is also sequence y in the GCP. In addition, in this scenario, the first and second sequences have the same length.

[0388] Based on the first relationship, the nth first sequence and the nth second sequence are the same, and there is no need to perform correlation calculation on the second sequence to obtain the first sequence, which can reduce the implementation complexity of the transmitting end.

[0389] Relationship 2: The nth first sequence is formed by concatenating the nth second sequence and at least one 0.

[0390] It can be understood that in this scenario, the length L1 of the first sequence is greater than the length L2 of the second sequence. The number of zeros in the first sequence is L1-L2.

[0391] Optionally, at least one zero may be added to the beginning and / or end of the nth second sequence to obtain the nth first sequence. For example, taking the example of adding at least one zero to the end of the second sequence, when the second sequence is sequence x or sequence y in the GCP, the first sequence may be expressed as the following formulas:

[0392] Among them, d 1，n (i) represents the i-th element of the n-th first sequence. x(i) represents the i-th element of sequence x in the GCP. y(i) represents the i-th element of sequence y in the GCP.

[0393] Based on this second relationship, adding at least one zero at the beginning and / or end of the nth second sequence is equivalent to introducing zero padding (ZP), which can reduce interference between multiple transmitters. Zero padding can also be used to assist in synchronization or to detect the location of a target object.

[0394] Relation 3: The nth first sequence is obtained by cyclically extending the nth second sequence.

[0395] Optionally, in this scenario, the length L1 of the first sequence may be greater than the length L2 of the second sequence.

[0396] Optionally, the ith element of the nth first sequence and the ith element of the nth second sequence may satisfy the following relationship: 1，n (i) = d 2，n [(i+Δ)mod L2], i=0, 1,..., L1-1

[0397] Among them, d 1，n (i) represents the i-th element of the n-th first sequence; d 2，n (i) represents the i-th element of the n-th second sequence; Δ represents the offset of the cyclic extension; mod represents the modulo operation; L2 is the length of the second sequence; L1 is the length of the first sequence. It can be understood that d 2，n (i) and d 2，n [i] represents the i-th element of the n-th second sequence.

[0398] For example, taking Δ=2 and L2=128 as an example, when i=0, the 0th element d of the nth first sequence 1，n (0) = d 2，n [(2) mod 128] = d 2，n (2), that is, the 0th element of the nth first sequence is equal to the 2nd element of the nth second sequence. When i = 1, the 1st element d of the nth first sequence is equal to the 2nd element of the nth second sequence. 1，n (1) = d 2，n[(3) mod 128] = d 2，n (3), that is, the 0th element of the nth first sequence is equal to the 3rd element of the nth second sequence, and so on, all elements of the nth first sequence can be obtained.

[0399] Based on this third relationship, the length of the first sequence can be flexibly adjusted through cyclic extension, which is equivalent to introducing a cyclic prefix (CP) and / or a cyclic suffix, improving the flexibility and applicability of the solution. The cyclic prefix and / or the cyclic suffix can also be used to assist in synchronization or to assist in detecting the location of the target object.

[0400] Relationship 4: The nth first sequence is formed by concatenating the result obtained by cyclically extending the nth second sequence and at least one zero.

[0401] The cyclic extension of the second sequence may refer to the description in relation three, and the at least one 0 splicing may refer to the description in relation two, which will not be repeated here.

[0402] Based on this fourth relationship, while cyclic extension is used to flexibly adjust the length of the first sequence, a cyclic prefix and / or suffix, as well as zero padding, can also be introduced to reduce interference between multiple transmitters. Furthermore, the cyclic prefix and / or suffix, as well as zero padding, can be used to assist in synchronization or to detect the location of a target object.

[0403] It is understood that in each of the above embodiments, the methods and / or steps implemented by the transmitting device may also be implemented by components (e.g., processors, chips, chip systems, circuits, logic modules, or software such as chips or circuits) applicable to the transmitting device. The methods and / or steps implemented by the receiving device may also be implemented by components (e.g., processors, chips, chip systems, circuits, logic modules, or software such as chips or circuits) applicable to the receiving device.

[0404] The above mainly introduces the solutions provided by this application from the perspective of interaction between various devices. Accordingly, this application also provides a communication device, which is used to implement the various methods described above. The communication device can be the transmitting device in the above method embodiments, or a device including the above transmitting device, or a component that can be used for the transmitting device; alternatively, the communication device can be the receiving device involved in the above method embodiments, or a device including the receiving device, or a component that can be used for the receiving device.

[0405] It is understandable that, in order to realize the above functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. It should be easily appreciated by those skilled in the art that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0406] The embodiment of the present application can divide the functional modules of the communication device according to the above method embodiment. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical functional division. In actual implementation, there may be other division methods.

[0407] In one implementation scenario, taking the communication device as the transmitting end device in the above method embodiment as an example, FIG7 shows a schematic structural diagram of a transmitting end device 70. The transmitting end device 70 includes a processing module 701 and a communication module 702.

[0408] In some embodiments, the transmitting device 70 may further include a storage module (not shown in FIG. 7 ) for storing program instructions and data.

[0409] In some embodiments, the communication module 702 is used to implement output and / or input functions, and the communication module 702 can be composed of a communication interface. Optionally, the communication module 702 can also be a transceiver module (or called a transceiver unit) to implement sending and / or receiving functions. In this case, the communication module 702 can be composed of a transceiver circuit, a transceiver, or a transceiver.

[0410] In some embodiments, the communication module 702 may include an output module (or receiving module) and an input module (or sending module), which are respectively used to execute the output (or receiving) and input (or sending) steps performed by the sending end device in the above method embodiments, and / or used to support other processes of the technology described herein; the processing module 701 may be used to execute the processing steps (such as determination, generation, etc.) performed by the sending end device in the above method embodiments, and / or used to support other processes of the technology described herein.

[0411] Processing module 701 is configured to determine N first sequences. The nth first sequence among the N first sequences is determined based on the nth second sequence among the N second sequences, and the nth second sequence is determined based on the nth element in the first extended sequence, where n = 0, 1, ..., N-1, and N is a positive integer greater than 1. A first solution to an idempotent sum can be determined based on the first extended sequence, and the degree of the first solution is greater than or equal to 1. Communication module 702 is configured to output N1 first sequences among the N first sequences, where each second sequence among the N1 second sequences corresponding to the N1 first sequences is a sequence in a Gray complementary pair (GCP), and N1 is less than or equal to N.

[0412] Optionally, the communication module 702 is configured to output N1 first sequences among N first sequences, including: the communication module 702 is configured to send the N1 first sequences in sequence within N1 first time units among N consecutive time units.

[0413] In this application, the transmitting device 70 is presented in the form of various functional modules divided in an integrated manner. Here, "module" can refer to a specific ASIC, circuit, processor and memory that executes one or more software or firmware programs, integrated logic circuit, and / or other devices that can provide the above functions.

[0414] In some embodiments, in terms of hardware implementation, those skilled in the art may conceive that the transmitting end device 70 may take the form of the communication device 30 shown in FIG. 3 .

[0415] As an example, the functions / implementation process of the processing module 701 in FIG7 can be implemented by the processor 301 in the communication device 30 shown in FIG3 calling the computer-executable instructions stored in the memory 303. The functions / implementation process of the communication module 702 in FIG7 can be implemented by the communication interface 304 in the communication device 30 shown in FIG3.

[0416] In some embodiments, when the transmitting device 70 in Figure 7 is a chip or a chip system, the function / implementation process of the communication module 702 can be implemented through the input and output interface (or communication interface) of the chip or chip system, and the function / implementation process of the processing module 701 can be implemented through the processor (or processing circuit) of the chip or chip system.

[0417] Since the transmitting end device 70 provided in this embodiment can execute the above method, the technical effects that can be obtained can refer to the above method embodiments and will not be described in detail here.

[0418] In another implementation scenario, taking the communication device as the receiving end device in the above method embodiment as an example, FIG8 shows a schematic structural diagram of a receiving end device 80. The receiving end device 80 includes a processing module 801 and a communication module 802.

[0419] In some embodiments, the receiving device 80 may further include a storage module (not shown in FIG. 8 ) for storing program instructions and data.

[0420] In some embodiments, the communication module 802 is used to implement output and / or input functions. The communication module 802 can be composed of a communication interface. Optionally, the communication module 802 can also be a transceiver module (or transceiver unit) to implement transmission and / or reception functions. In this case, the communication module 802 can be composed of a transceiver circuit, a transceiver, or a transceiver.

[0421] In some embodiments, the communication module 802 may include an output module (or receiving module) and an input module (or sending module), which are respectively used to execute the output (or receiving) and input (or sending) steps performed by the receiving end device in the above method embodiment, and / or used to support other processes of the technology described in this document; the processing module 801 may be used to execute the processing steps (such as determination, generation, etc.) performed by the receiving end device in the above method embodiment, and / or used to support other processes of the technology described in this document.

[0422] The communication module 802 is configured to receive a first signal, where the first signal is a signal obtained by transmitting N1 first sequences among N first sequences, where N1 is less than or equal to N and N is a positive integer greater than 1; the nth first sequence among the N first sequences is determined based on the nth second sequence among the N second sequences; each second sequence among the N1 second sequences corresponding to the N1 first sequences is a sequence in a Gray complementary pair (GCP), where n = 0, 1, ..., N-1; and the processing module 801 is configured to process the first signal based on the N1 first sequences or the N1 second sequences. The nth second sequence is determined based on the nth element in the first extended sequence, and a first solution of an idempotent sum can be determined based on the first extended sequence, where the degree of the first solution is greater than or equal to 1.

[0423] In this application, the receiving device 80 is presented in the form of various functional modules divided in an integrated manner. The "module" here can refer to a specific ASIC, circuit, processor and memory executing one or more software or firmware programs, integrated logic circuit, and / or other devices that can provide the above functions.

[0424] In some embodiments, in terms of hardware implementation, those skilled in the art may conceive that the receiving device 80 may take the form of the communication device 30 shown in FIG. 3 .

[0425] As an example, the functions / implementation process of the processing module 801 in FIG8 can be implemented by the processor 301 in the communication device 30 shown in FIG3 calling the computer-executable instructions stored in the memory 303. The functions / implementation process of the communication module 802 in FIG8 can be implemented by the communication interface 304 in the communication device 30 shown in FIG3.

[0426] In some embodiments, when the receiving device 80 in Figure 8 is a chip or a chip system, the function / implementation process of the communication module 802 can be implemented through the input and output interface (or communication interface) of the chip or chip system, and the function / implementation process of the processing module 801 can be implemented through the processor (or processing circuit) of the chip or chip system.

[0427] Since the receiving device 80 provided in this embodiment can execute the above method, the technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0428] As a possible product form, the transmitting device or receiving device described in the embodiments of the present application can also be implemented using the following: one or more field programmable gate arrays (FPGAs), programmable logic devices (PLDs), controllers, state machines, gate logic, discrete hardware components, any other suitable circuits, or any combination of circuits that can perform the various functions described throughout this application.

[0429] As another possible product form, the transmitting device or receiving device described in the embodiment of the present application can be implemented by a general bus architecture. For ease of explanation, refer to Figure 9, which is a structural diagram of a communication device 900 provided in an embodiment of the present application. The communication device 900 includes a processor 901 and a transceiver 902. The communication device 900 can be a transmitting device, or a chip or module therein; or, the communication device 900 can be a receiving device, or a chip or module therein. Figure 9 only shows the main components of the communication device 900. In addition to the processor 901 and the transceiver 902, the communication device can further include a memory 903.

[0430] Optionally, the processor 901 is primarily used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data. The memory 903 is primarily used to store software programs and data. The transceiver 902 may include a radio frequency circuit and an antenna. The radio frequency circuit is primarily used to convert baseband signals into radio frequency signals and process radio frequency signals. The antenna is primarily used to transmit and receive radio frequency signals in the form of electromagnetic waves.

[0431] Optionally, the processor 901 , the transceiver 902 , and the memory 903 may be connected via a communication bus.

[0432] When the communication device is turned on, the processor 901 can read the software program in the memory 903, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor 901 performs baseband processing on the data to be sent and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then transmits the radio frequency signal to the outside in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 901. The processor 901 converts the baseband signal into data and processes the data.

[0433] In another implementation, the RF circuit and antenna may be provided independently of the processor performing baseband processing. For example, in a distributed scenario, the RF circuit and antenna may be remotely arranged independent of the communication device.

[0434] In some embodiments, the present application also provides a communication device, which includes a processor, configured to implement the method in any of the above method embodiments. The communication device may be a transmitting device or a receiving device in the above method embodiments.

[0435] As a possible implementation, the communication device further includes a memory. The memory is used to store necessary computer programs and data. The computer program may include instructions, and the processor may invoke the instructions in the computer program stored in the memory to instruct the communication device to execute any of the above-described method embodiments. Of course, the memory may not be located in the communication device.

[0436] As another possible implementation, the communication device also includes an interface circuit, which is a code / data read / write interface circuit, and the interface circuit is used to receive computer execution instructions (computer execution instructions are stored in a memory, may be read directly from the memory, or may pass through other devices) and transmit them to the processor.

[0437] As another possible implementation, the communication device further includes a communication interface, where the communication interface is used to communicate with a module outside the communication device.

[0438] It can be understood that the communication device can be a chip or a chip system. When the communication device is a chip system, it can be composed of chips or include chips and other discrete devices. The embodiments of the present application do not specifically limit this.

[0439] The present application also provides a computer-readable storage medium having a computer program or instruction stored thereon, which implements the functions of any of the above method embodiments when executed by a computer.

[0440] The present application also provides a computer program product, which implements the functions of any of the above method embodiments when executed by a computer.

[0441] Those skilled in the art will appreciate that, for the sake of convenience and brevity of description, the specific working processes of the above-described systems, devices, and units may refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0442] It is understood that the systems, devices, and methods described in this application may also be implemented in other ways. For example, the device embodiments described above are merely illustrative. 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. In addition, the coupling or direct coupling or communication connection shown or discussed may be through some interface, indirect coupling or communication connection of devices or units, and may be electrical, mechanical, or other forms.

[0443] The units described as separate components may or may not be physically separate, i.e., they may be located in one place or distributed across multiple network units. Components shown as units may or may not be physical units. Some or all of these units may be selected to achieve the objectives of this embodiment as needed.

[0444] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0445] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes (or functions) described in the embodiments of the present application are implemented. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that contains one or more media that can be integrated. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state drive (SSD)), etc. In the embodiment of the present application, the computer may include the aforementioned device.

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

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

Claims

1. A sequence transmission method, characterized in that: The method comprises: Determine N first sequences, wherein an nth first sequence among the N first sequences is determined according to an nth second sequence among the N second sequences, and the nth second sequence is determined according to an nth element in a first extended sequence, n=0, 1, ..., N-1, and N is a positive integer greater than 1; a first solution of an idempotent sum can be determined according to the first extended sequence, and the degree of the first solution is greater than or equal to 1; N1 first sequences among the N first sequences are output, each of the N1 second sequences corresponding to the N1 first sequences is a sequence in a Golay complementary pair GCP, and N1 is less than or equal to N.

2. A sequence processing method, characterized in that: The method comprises: Receive a first signal, where the first signal is a signal after N1 first sequences among N first sequences are transmitted, N1 is less than or equal to N, and N is a positive integer greater than 1; an nth first sequence among the N first sequences is determined according to an nth second sequence among N second sequences; each of the N1 second sequences corresponding to the N1 first sequences is a sequence in a Gray complementary pair GCP, where n=0, 1, …, N-1; Processing the first signal according to the N1 first sequences or the N1 second sequences; The nth second sequence is determined according to the nth element in the first extended sequence, and a first solution of an idempotent sum can be determined according to the first extended sequence, and the degree of the first solution is greater than or equal to 1.

3. The method according to claim 1 or 2, characterized in that: The first extended sequence is determined according to a first base sequence, and a second solution of an idempotent sum can be determined according to the first base sequence, wherein the degree of the second solution is less than or equal to the degree of the first solution.

4. The method according to claim 3, characterized in that The second solution is determined based on the first index sequence and the second index sequence; The first index sequence includes the indexes of the first type of elements in the first base sequence, and the first type of elements corresponds to the sequence x in the GCP; the second index sequence includes the indexes of the second type of elements in the first base sequence, and the second type of elements corresponds to the sequence y in the GCP.

5. The method according to claim 4, characterized in that The first type of elements are elements whose values ​​are equal to the first numerical value, and the second type of elements are elements whose values ​​are equal to the second numerical value; Alternatively, the first type of elements are elements with amplitudes greater than 0 and phases of a first phase; and the second type of elements are elements with amplitudes greater than 0 and phases of a second phase.

6. The method according to claim 5, characterized in that The first base sequence also includes an element whose value is equal to a third numerical value.

7. The method according to any one of claims 4 to 6, characterized in that: The first index sequence l base,1 and the second index sequence l base,2 is the second solution of the equal sum, satisfying: Among them, N base,1 is the length of the first index sequence, l base,1 (i) represents the i-th element in the first index sequence; N base,2 is the length of the second index sequence, l base,2 (j) represents the j-th element in the second index sequence; P is the degree of the second solution, and P is a natural number.

8. The method according to any one of claims 4 to 6, characterized in that: The second solution is determined based on the first index sequence, the second index sequence, a first weight sequence, and a second weight sequence; the first weight sequence includes the amplitudes of the first category elements, and the second weight sequence includes the amplitudes of the second category elements.

9. The method according to claim 8, characterized in that The first index sequence l base,1 , the second index sequence l base,2 , the first weight sequence q base,1 , and the second weight sequence q base,2 is the second solution of the equal sum, satisfying: Among them, N base,1 is the length of the first index sequence, q base,1 (i) represents the i-th element in the first weight sequence, l base,1 (i) represents the i-th element in the first index sequence; N base,2 is the length of the second index sequence, q base,2 (j) represents the jth element in the second weight sequence, l base,2 (j) represents the j-th element in the second index sequence; P is the degree of the second solution, and P is a natural number.

10. The method according to any one of claims 3 to 9, characterized in that: The first extension sequence is the same as the first base sequence.

11. The method according to any one of claims 3 to 9, characterized in that: The first extended sequence is determined according to the first base sequence and an offset sequence, and the length of the offset sequence is M, where M is a positive integer; The length of the first extended sequence N and the length of the first base sequence N base , and the elements in the offset sequence satisfy: Wherein, t(m) represents the mth element in the offset sequence, and t(m) is a positive integer.

12. The method according to claim 11, characterized in that The nth element of the first extended sequence is the same as the sequence s M-1 The nth element of the sequence s is the same; M-1 Satisfaction: s m =[s m-1 ,0 1×t(m) ]+[0 1×t(m) ,-s m-1 ],m=0,1,…,M-1 Among them, s -1 Same as the first base sequence, 0 1×t(m) represents a row vector consisting of t(m) zeros, s m include elements.

13. The method according to claim 11, characterized in that The nth element of the first extended sequence is the same as the sequence s M-1 The nth element of the sequence s is the same; M-1 Satisfaction: s m (i) = s m-1 (i)-s m-1 (it(m)),m=0,1,…,M-1 Among them, s -1 Same as the first base sequence, s m include elements, in, When m-1 (i)=0;it(m)<0,s m-1 (it(m))=0.

14. The method according to claim 11, characterized in that The nth element of the first extended sequence is the difference between the first number and the second number, and the first number is sequence A M-1 The number of elements with the value n in the sequence B. M-1 The number of elements with value n in the sequence A M-1 and sequence B M-1 Satisfaction: A m =[A m-1 ,B m-1 +t(m)],m=0,1,…,M-1 B m =[B m-1 ,A m-1 +t(m)],m=0,1,…,M-1 Among them, A -1 for q base，1 (i) l base,1 (i) A sequence composed of i = 0, 1, ..., N base,1 -1; B -1 for q base,2 (j) l base,2 (j) is a sequence composed of j = 0, 1, ..., N base,2 -1; Among them, q base,1 (i) represents the i-th element in the first weight sequence, l base,1 (i) represents the i-th element in the first index sequence; q base,2 (j) represents the jth element in the second weight sequence, l base,2 (j) represents the j-th element in the second index sequence.

15. The method according to any one of claims 11 to 14, characterized in that: The degree of the second solution is P, and the degree of the first solution is P+M, where P is a natural number.

16. The method according to any one of claims 11 to 15, characterized in that: The first solution is determined based on a first extended index sequence and a second extended index sequence; The first extended index sequence includes the index of the first type of elements in the first extended sequence, and the second sequence corresponding to the first type of elements is the sequence x in the GCP; the second extended index sequence includes the index of the second type of elements in the first extended sequence, and the second sequence corresponding to the second type of elements is the sequence y in the GCP.

17. The method according to claim 16, characterized in that The first extended index sequence l ext,1 and the second extended index sequence l ext,2 is the first solution of the equal sum, satisfying: Among them, N ext,1 is the length of the first extended index sequence, l ext,1 (i) represents the i-th element in the first extended index sequence; N ext,2 is the length of the second extended index sequence, l ext,2 (j) represents the j-th element in the second extended index sequence; P is the degree of the second solution, P is a natural number, and P+M is the degree of the first solution.

18. The method according to claim 16, characterized in that The first solution is determined based on the first extended index sequence, the second extended index sequence, a first extended weight sequence, and a second extended weight sequence; the first extended weight sequence includes the amplitude of the first category elements, and the second extended weight sequence includes the amplitude of the second category elements.

19. The method according to claim 18, characterized in that The first extended index sequence l ext,1 , the second extended index sequence l ext,2 , the first extended weight sequence q ext,1 , and the second extended weight sequence q ext,2 is the first solution of the equal sum, satisfying: Among them, N ext,1 is the length of the first extended index sequence, q ext,1 (i) represents the i-th element in the first extended weight sequence, l ext,1 (i) represents the i-th element in the first extended index sequence; N ext,2 is the length of the second extended index sequence, q ext,2 (j) represents the jth element in the second extended weight sequence, l ext,2 (j) represents the j-th element in the second extended index sequence; P is the degree of the second solution, P is a natural number, and P+M is the degree of the first solution.

20. The method according to any one of claims 1 to 19, characterized in that: The nth element s of the first spreading sequence ext (n) Satisfy: Among them, mod represents the modulo operation.

21. The method according to any one of claims 1 to 20, characterized in that: When the nth element of the first extended sequence is a first value, the nth second sequence among the N second sequences is a sequence x in the GCP, and when the nth element of the first extended sequence is a second value, the nth second sequence among the N second sequences is a sequence y in the GCP; or, When the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the first phase, the nth second sequence among the N second sequences is the sequence x in the GCP; when the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the second phase, the nth second sequence among the N second sequences is the sequence y in the GCP.

22. The method according to claim 21, characterized in that When the nth element of the first extended sequence is a third value, the elements in the nth second sequence of the N second sequences are all the same.

23. The method according to any one of claims 1 to 22, characterized in that: The power of the nth first sequence among the N first sequences is determined according to the nth element in the first extended sequence.

24. The method according to claim 23, characterized in that The ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence is equal to |s ext (n)| / |s ext (n′)|; or, The ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence is equal to [s ext (n)] 2 / [s ext (n′)] 2 ; Among them, |s ext (n)| represents the amplitude of the nth element in the first spreading sequence, |s ext (n′)| represents the n′th element in the first extended sequence and |s ext (n′)|≠0; n and n′ are any integers from 0 to N-1, and n≠n′.

25. A communication device, characterized in that: The communication device comprises: a processing module and a communication module; The processing module is used to determine N first sequences, wherein an nth first sequence among the N first sequences is determined according to an nth second sequence among the N second sequences, and the nth second sequence is determined according to an nth element in a first extended sequence, where n=0, 1, ..., N-1, and N is a positive integer greater than 1; a first solution of an idempotent sum can be determined according to the first extended sequence, and the degree of the first solution is greater than or equal to 1; The communication module is used to output N1 first sequences among the N first sequences, each of the N1 second sequences corresponding to the N1 first sequences is a sequence in a Golay complementary pair GCP, and N1 is less than or equal to N.

26. A communication device, characterized in that: The communication device comprises: a processing module and a communication module; The communication module is used to receive a first signal, where the first signal is a signal after N1 first sequences among N first sequences are transmitted, N1 is less than or equal to N, and N is a positive integer greater than 1; the nth first sequence among the N first sequences is determined according to the nth second sequence among the N second sequences; each of the N1 second sequences corresponding to the N1 first sequences is a sequence in a Gray complementary pair GCP, n=0, 1, ..., N-1; The processing module is used to process the first signal according to the N1 first sequences or the N1 second sequences; The nth second sequence is determined according to the nth element in the first extended sequence, and a first solution of an idempotent sum can be determined according to the first extended sequence, and the degree of the first solution is greater than or equal to 1.

27. The communication device according to claim 25 or 26, characterized in that: The first extended sequence is determined according to a first base sequence, and a second solution of an idempotent sum can be determined according to the first base sequence, wherein the degree of the second solution is less than or equal to the degree of the first solution.

28. The communication device according to claim 27, characterized in that The second solution is determined based on the first index sequence and the second index sequence; The first index sequence includes the indexes of the first type of elements in the first base sequence, and the first type of elements corresponds to the sequence x in the GCP; the second index sequence includes the indexes of the second type of elements in the first base sequence, and the second type of elements corresponds to the sequence y in the GCP.

29. The communication device according to claim 28, characterized in that The first type of elements are elements whose values ​​are equal to the first numerical value, and the second type of elements are elements whose values ​​are equal to the second numerical value; Alternatively, the first type of elements are elements with amplitudes greater than 0 and phases of a first phase; and the second type of elements are elements with amplitudes greater than 0 and phases of a second phase.

30. The communication device according to claim 29, characterized in that The first base sequence also includes an element whose value is equal to a third numerical value.

31. The communication device according to any one of claims 28 to 30, characterized in that: The first index sequence l base,1 and the second index sequence l base，2 is the second solution of the equal sum, satisfying: Among them, N base,1 is the length of the first index sequence, l base,1 (i) represents the i-th element in the first index sequence; N base,2 is the length of the second index sequence, l base,2 (j) represents the j-th element in the second index sequence; P is the degree of the second solution, and P is a natural number.

32. The communication device according to any one of claims 28 to 30, characterized in that: The second solution is determined based on the first index sequence, the second index sequence, a first weight sequence, and a second weight sequence; the first weight sequence includes the amplitudes of the first category elements, and the second weight sequence includes the amplitudes of the second category elements.

33. The communication device according to claim 32, characterized in that: The first index sequence l base,1 , the second index sequence l base,2 , the first weight sequence q base,1 , and the second weight sequence q base,2 is the second solution of the equal sum, satisfying: Among them, N base,1 is the length of the first index sequence, q base,1 (i) represents the i-th element in the first weight sequence, l base,1 (i) represents the i-th element in the first index sequence; N base,2 is the length of the second index sequence, q base,2 (j) represents the jth element in the second weight sequence, l base,2 (j) represents the j-th element in the second index sequence; P is the degree of the second solution, and P is a natural number.

34. The communication device according to any one of claims 27 to 33, characterized in that: The first extension sequence is the same as the first base sequence.

35. The communication device according to any one of claims 27 to 33, characterized in that: The first extended sequence is determined according to the first base sequence and an offset sequence, and the length of the offset sequence is M, where M is a positive integer; The length of the first extended sequence N and the length of the first base sequence N base , and the elements in the offset sequence satisfy: Wherein, t(m) represents the mth element in the offset sequence, and t(m) is a positive integer.

36. The communication device according to claim 35, characterized in that The nth element of the first extended sequence is the same as the sequence s M-1 The nth element of the sequence s is the same; M-1 Satisfaction: s m =[s m-1 ,0 1×t(m) ]+[0 1×t(m) ,-s m-1 ],m=0,1,…,M-1 Among them, s -1 Same as the first base sequence, 0 1×t(m) represents a row vector consisting of t(m) zeros, s m include elements.

37. The communication device according to claim 35, characterized in that The nth element of the first extended sequence is the same as the sequence s M-1 The nth element of the sequence s is the same; M-1 Satisfaction: s m (i) = s m-1 (i)-s m-1 (it(m)),m=0,1,…,M-1 Among them, s -1 Same as the first base sequence, s m include elements, in, When m-1 (i)=0;it(m)<0,s m-1 (it(m))=0.

38. The communication device according to claim 35, characterized in that The nth element of the first extended sequence is the difference between the first number and the second number, and the first number is sequence A M-1 The number of elements with the value n in the sequence B. M-1 The number of elements with value n in the sequence A M-1 and sequence B M-1 Satisfaction: A m =[A m-1 ,B m-1 +t(m)],m=0,1,…,M-1 B m =[B m-1 ,A m-1 +t(m)],m=0,1,…,M-1 Among them, A -1 for q base,1 (i) l base,1 (i) A sequence composed of i = 0, 1, ..., N base,1 -1; B -1 for q base,2 (j) l base,2 (j) is a sequence composed of j = 0, 1, ..., N base,2 -1; Among them, q base,1 (i) represents the i-th element in the first weight sequence, l base,1 (i) represents the i-th element in the first index sequence; q base,2 (j) represents the jth element in the second weight sequence, l base,2 (j) represents the j-th element in the second index sequence.

39. The communication device according to any one of claims 35 to 38, characterized in that: The degree of the second solution is P, and the degree of the first solution is P+M, where P is a natural number.

40. The communication device according to any one of claims 35 to 39, characterized in that: The first solution is determined based on a first extended index sequence and a second extended index sequence; The first extended index sequence includes the index of the first type of elements in the first extended sequence, and the second sequence corresponding to the first type of elements is the sequence x in the GCP; the second extended index sequence includes the index of the second type of elements in the first extended sequence, and the second sequence corresponding to the second type of elements is the sequence y in the GCP.

41. The communication device according to claim 40, characterized in that The first extended index sequence l ext,1 and the second extended index sequence l ext，2 is the first solution of the equal sum, satisfying: Among them, N ext,1 is the length of the first extended index sequence, l ext,1 (i) represents the i-th element in the first extended index sequence; N ext,2 is the length of the second extended index sequence, l ext,2 (j) represents the j-th element in the second extended index sequence; P is the degree of the second solution, P is a natural number, and P+M is the degree of the first solution.

42. The communication device according to claim 40, characterized in that The first solution is determined based on the first extended index sequence, the second extended index sequence, a first extended weight sequence, and a second extended weight sequence; the first extended weight sequence includes the amplitude of the first category elements, and the second extended weight sequence includes the amplitude of the second category elements.

43. The communication device according to claim 42, characterized in that The first extended index sequence l ext,1 , the second extended index sequence l ext,2 , the first extended weight sequence q ext,1 , and the second extended weight sequence q ext,2 is the first solution of the equal sum, satisfying: Among them, N ext,1 is the length of the first extended index sequence, q ext,1 (i) represents the i-th element in the first extended weight sequence, l ext,1 (i) represents the i-th element in the first extended index sequence; N ext,2 is the length of the second extended index sequence, q ext,2 (j) represents the jth element in the second extended weight sequence, l ext,2 (j) represents the second expansion The j-th element in the expansion index sequence; P is the degree of the second solution, P is a natural number, and P+M is the degree of the first solution.

44. The communication device according to any one of claims 26 to 43, characterized in that: The nth element s of the first spreading sequence ext (n) Satisfy: Among them, mod represents the modulo operation.

45. The communication device according to any one of claims 26 to 44, characterized in that: When the nth element of the first extended sequence is a first value, the nth second sequence among the N second sequences is a sequence x in the GCP, and when the nth element of the first extended sequence is a second value, the nth second sequence among the N second sequences is a sequence y in the GCP; or, When the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the first phase, the nth second sequence among the N second sequences is the sequence x in the GCP; when the amplitude of the nth element of the first extended sequence is greater than 0 and the phase is the second phase, the nth second sequence among the N second sequences is the sequence y in the GCP.

46. ​​The communication device according to claim 45, characterized in that When the nth element of the first extended sequence is a third value, the elements in the nth second sequence of the N second sequences are all the same.

47. The communication device according to any one of claims 26 to 46, characterized in that: The power of the nth first sequence among the N first sequences is determined according to the nth element in the first extended sequence.

48. The communication device according to claim 47, characterized in that The ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence is equal to |s ext (n)| / |s ext (n′)|; or, The ratio of the power of the nth first sequence among the N first sequences to the power of the n′th first sequence is equal to [s ext (n)] 2 / [s ext (n′)] 2 ; Among them, |s ext (n)| represents the amplitude of the nth element in the first spreading sequence, |s ext (n′)| represents the n′th element in the first extended sequence and |s ext (n′)|≠0; n and n′ are any integers from 0 to N-1, and n≠n′.

49. A communication device, characterized in that: The communication device comprises a processor; the processor is used to run a computer program or instruction, or to enable the communication device to execute the method according to any one of claims 1 to 24 through a logic circuit.

50. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions or programs, and when the computer instructions or programs are run on a computer, the method according to any one of claims 1 to 24 is executed.

51. A computer program product, characterized in that The computer program product includes computer instructions; when part or all of the computer instructions are executed, the method according to any one of claims 1 to 24 is performed.

52. A communication system, characterized in that: The communication system comprises a transmitting device and a receiving device; wherein the transmitting device is used to execute the method as claimed in any one of claims 1 and 3-24, and the receiving device is used to execute the method as claimed in any one of claims 2-24.

Images