Sequence transmission method and device

Abstract

A sequence transmission method and device can be applied to scenes such as downlink synchronization, random access, perception, radar or communication perception integration, and can increase the design diversity of sequences and improve the flexibility of sequence design and the accuracy of target detection. The method comprises the following steps: a sending end device determines N first sequences and sends the N first sequences; wherein the nth first sequence in the N first sequences is determined according to the nth second sequence in the N second sequences, and the formula (I) is shown in the specification, am is a prime number, M is a positive integer greater than 1, and n is equal to 0, 1,..., N-1. Each second sequence is a sequence in a Gray Complementary Pair (GCP). The N second sequences comprise first sub-sequence sets shown in the formula (II), each first sub-sequence set comprises am second sub-sequence sets, each second sub-sequence set comprises second sequences shown in the formula (III), m = 0, 1,..., M-1, a-1 = 1. In each first subsequence set, any two adjacent second subsequence sets are the same, or second sequences with the same indexes in any two adjacent second subsequence sets form the GCP.

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, the current design method of the multiple sequences has some limitations, for example, the number of sequences needs to be a power of 2, which is not flexible enough.

[0005] Summary of the Invention

[0006] The present application provides a sequence transmission method and apparatus, which can increase the design diversity of sequences and improve the flexibility of sequence design.

[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, or by a logic module or software that can implement all or part of the functions of the transmitting device. The method includes: determining N first sequences and transmitting the 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. a m is a prime number, M is a positive integer greater than 1, n=0,1,…,N-1, N is a positive integer greater than 1;

[0008] Each second sequence is a sequence in a Golay complementary pair GCP. The N second sequences include First subsequence sets. Each first subsequence set includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1= 1. In each first subsequence set, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have the same second sequence index, forming a GCP.

[0009] Based on this plan, a m is a prime number. Therefore, compared to the solution where the number of sequences is a power of 2, the present application supports more values ​​for the number of sequences, thereby supporting the flexible selection of an appropriate value for N based on different low ambiguity zone requirements and detection accuracy requirements. In addition, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets with the same second sequence index constitute a GCP. Therefore, the present application supports the flexible design of the relationship between the second subsequence sets based on different low ambiguity zone requirements and detection accuracy requirements. In other words, the solution of the present application increases the diversity of sequence design and improves the flexibility of sequence design, thereby supporting the flexible design of N first sequences according to actual needs and improving detection performance.

[0010] In one possible design, N first sequences constitute a first sequence set; determining the N first sequences includes: determining the first sequence set from multiple sequence sets based on a first threshold, wherein within a low ambiguity region of the ambiguity function corresponding to the first sequence set, a value of the ambiguity function corresponding to the first sequence set is less than or equal to the first threshold.

[0011] In a second aspect, a sequence receiving 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, or by a logic module or software that can realize all or part of the functions of the receiving device. The method includes: receiving a first signal, and processing the first signal according to N first sequences or N second sequences. The first signal is a signal after the N first sequences are transmitted, and the nth first sequence among the N first sequences is determined according to the nth second sequence among the N second sequences. a m is a prime number, M is a positive integer greater than 1, n=0,1,…,N-1, N is a positive integer greater than 1.

[0012] Each second sequence is a sequence in a Golay complementary pair GCP. The N second sequences include First subsequence sets. Each first subsequence set includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1 = 1. In each first subsequence set, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have the same second sequence index, forming a GCP.

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

[0014] In combination with the first aspect or the second aspect, in one possible design, the N second sequences include sequence groups, There are at least two different sequence groups in the sequence groups. Indicates rounding down. When N is an odd number, The sequence groups are composed of the first N-1 second sequences among the N second sequences. Each sequence group includes two second sequences, and the two second sequences are adjacent among the N second sequences.

[0015] Based on this possible design, since at least two of the multiple sequence groups included in the N second sequences are different, the N second sequences are not generated based on the repetition of the first two second sequences. This avoids the issue of a lack of a clear low-ambiguity region in the ambiguity function caused by the repetition of the first two second sequences. In other words, based on this design of N second sequences, a clear low-ambiguity region in the ambiguity function can be achieved below a certain threshold, thereby improving detection performance compared to solutions that use repeated GCPs.

[0016] In combination with the first aspect or the second aspect, in a possible design, a m ,m=0,1,…,M-1consists of a=[a0,…,a M-1 ], there is at least one odd number a in a j , a j In the corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP, and j is an integer from 0 to M-1.

[0017] Based on this possible design, since there is at least one odd number a j , so the number of sequences N is not limited to only contain factors 2, and can support more values ​​of the number of sequences. In the above design, the odd factor a j Among the multiple second subsequence sets included in the corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP. This design increases the diversity and flexibility of sequence design, allowing for the flexible design of multiple sequences based on actual needs and improving detection performance.

[0018] In combination with the first aspect or the second aspect, in a possible design, a m ,m=0,1,…,M-1consists of a=[a0,…,a M-1], there is at least one a in a k , a k In the corresponding first subsequence sets, any two adjacent second subsequence sets are the same, and k is an integer from 1 to M-1.

[0019] Based on this possible design, for factors other than the first one, any two adjacent second subsequence sets are identical within the first subsequence set corresponding to at least one factor. This increases the diversity and flexibility of sequence design, allowing for the flexible design of multiple sequences based on actual needs and improving detection performance.

[0020] In combination with the first aspect or the second aspect, in a possible design, a=[a0,…,a M-1 ], there is at least one a in a k , a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same; and there is at least one a in a q , a q In each corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP. k, q are integers from 1 to M-1, where M is greater than 2. Optionally, q is greater than k or q is less than k.

[0021] Based on this possible design, the number of sequences N can include at least three factors. The number of sequences N is not limited to just the factor 2 and can support a wider range of sequence numbers. For factors other than the first factor, there exists at least one factor in the first subsequence set where any two adjacent second subsequence sets are identical; and there exists at least one factor in the first subsequence set where any two adjacent second subsequence sets have the same index, forming a GCP. This design increases the diversity and flexibility of sequence design, allowing for the flexible design of multiple sequences based on actual needs and improving detection performance.

[0022] In combination with the first or second aspect, in one possible design, the N second sequences correspond to the first extended sequence. When the nth element of the first extended sequence is a first value, the nth second sequence in the N second sequences is a sequence x in the GCP; or, when the nth element of the first extended sequence is a second value, the nth second sequence in the N second sequences is a sequence y in the GCP.

[0023] Among them, the nth element of the first extended sequence is Related, b m satisfy: a -1 =1,bm =0,1,…,a m -1, c m Equal to 1 or -1, m=0,1,…,M-1, n=0,1,…,N-1.

[0024] In combination with the first aspect or the second aspect, in one possible design, the first extended sequence includes element groups, There are at least two different element groups in each element group. Indicates rounding down; when N is an odd number, The element groups are composed of the first N-1 elements in the first extended sequence, wherein each element group contains two elements, and the two elements are adjacent in the first extended sequence.

[0025] Based on this possible design, at least two different element groups exist among the multiple element groups, allowing the multiple sequence groups included in the N second sequences to contain at least two different sequence groups. This avoids the issue of a lack of a clear low-ambiguity region in the ambiguity function caused by the repetition of the first two second sequences. In other words, based on this design of N second sequences, a clear low-ambiguity region can be created in the ambiguity function below a certain threshold, thereby improving detection performance compared to solutions that use repeated GCPs.

[0026] In combination with the first aspect or the second aspect, in a possible design, a=[a0,…,a M-1 ], there is at least one odd number a in a j , a j The corresponding c j Equal to -1, j is an integer from 0 to M-1.

[0027] Based on this possible design, a j The corresponding c j Equal to -1 can make the odd factor a j In each corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP, which increases the diversity and flexibility of sequence design, thereby supporting the flexible design of multiple sequences according to actual needs and improving detection performance.

[0028] In combination with the first aspect or the second aspect, in a possible design, a=[a0,…,a M-1 ], there is at least one a in a k , a k The corresponding c k is equal to 1, and k is an integer from 1 to M-1.

[0029] Based on this possible design, the factor ak The corresponding c k Equal to 1 can make a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same, thereby increasing the diversity of sequence design and improving the flexibility of sequence design, thereby supporting the flexible design of multiple sequences according to actual needs and improving detection performance.

[0030] In combination with the first aspect or the second aspect, in a possible design, a=[a0,…,a M-1 ], there is at least one a in a k , a k The corresponding c k is equal to 1, and there is at least one a in a q , a q The corresponding c q = -1. k, q are integers from 1 to M-1, where M is greater than 2. q can be greater than k or less than k.

[0031] Based on this possible design, the factor a k The corresponding c k Equal to 1 can make a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same, factor a q The corresponding c q Equal to -1 can make a q In each corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP; this increases the diversity and flexibility of sequence design, thereby supporting the flexible design of multiple sequences according to actual needs and improving detection performance.

[0032] In combination with the first aspect or the second aspect, in one possible design, the nth element of the first extended sequence satisfies at least one of the following:

[0033]

[0034]

[0035] Among them, s ext (n) represents the nth element of the first extended sequence.

[0036] In combination with the first aspect or the second aspect, in one possible design, the first extended sequence is composed of the first N elements of the second extended sequence, and the length of the second extended sequence is Q times the length of the first extended sequence, where Q is greater than 1; and / or the third extended sequence is composed of the first N / Q elements of the first extended sequence, and the length of the first extended sequence is Q times the length of the third extended sequence.

[0037] In combination with the first aspect or the second aspect, in a possible design, a=[a0,…,a M-1 ],c=[c0,…,c M-1 ], a and c satisfy at least one of the following:

[0038] When N is 10, a = [2, 5], c = [-1, -1];

[0039] When N is 12, a = [2, 2, 3], c = [-1, -1, -1];

[0040] When N is 12, a = [3, 2, 2], c = [-1, 1, -1];

[0041] When N is 14, a = [2, 7], c = [-1, -1];

[0042] When N is 16, a = [2, 2, 2, 2], c = [-1, -1, 1, 1];

[0043] When N is 16, a = [2, 2, 2, 2], c = [-1, -1, -1, 1];

[0044] When N is 18, a = [2, 3, 3], c = [-1, -1, 1];

[0045] When N is 18, a = [2, 3, 3], c = [-1, -1, -1];

[0046] When N is 18, a = [3, 3, 2], c = [-1, 1, -1];

[0047] When N is 20, a = [2, 2, 5], c = [-1, -1, -1];

[0048] When N is 20, a = [2, 5, 2], c = [-1, -1, 1];

[0049] When N is 22, a = [2, 11], c = [-1, -1];

[0050] When N is 24, a=[2,3,2,2], c=[-1,-1,1,1]; or

[0051] When N is equal to 24, a=[3,2,2,2], c=[-1,1,-1,1].

[0052] In combination with the first aspect or the second aspect, in one possible design, the first value is 1, the second value is -1, and the first extended sequence is at least one of the following:

[0053] When N is 10, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1];

[0054] When N is 12, the first extended sequence is: [1,-1,-1,1,-1,1,-1,-1,-1,-1,1];

[0055] When N is 12, the first extended sequence is: [1,-1,1,1,-1,1,-1,-1,-1,1,-1];

[0056] When N is 14, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1];

[0057] When N is 16, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1];

[0058] When N is 16, the first extended sequence is: [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1];

[0059] When N is 18, the first extended sequence is: [1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,-1,1,-1];

[0060] When N is 18, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1];

[0061] When N is 18, the first extended sequence is: [1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,-1];

[0062] When N is 20, the first extended sequence is: [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,1,-1,-1,1];

[0063] When N is 20, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1];

[0064] When N is 22, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1];

[0065] When N is 24, the first extended sequence is: [1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1]; or,

[0066] When N is equal to 24, the first extended sequence is: [1,-1,1,1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1].

[0067] In combination with the first aspect or the second aspect, 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 multiple items:

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

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

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

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

[0072] In combination with the first aspect or the second aspect, in a possible design, when the nth first sequence is obtained by cyclically extending the nth second sequence:

[0073] d 1,n (i) = d 2,n [(i+Δ)mod L2],i=0,1,…,L1-1

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

[0075] In combination with the first aspect or the second aspect, in one possible design, the N second sequences are at least one of the following:

[0076] When N is 10, the N second sequences are: {x, y, y, x, x, y, y, x, x, y};

[0077] When N is 12, the N second sequences are: {x, y, y, x, y, x, x, x, y, x, y, x};

[0078] When N is 12, the N second sequences are: {x,y,x,x,y,x,y,x,y,x,y};

[0079] When N is 14, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,x,x,y};

[0080] When N is 16, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,y,x,x,y,x,y,x};

[0081] When N is 16, the N second sequences are: {x,y,y,x,y,x,x,y,x,y,x,y,x,x,x,x};

[0082] When N is 18, the N second sequences are: {x,y,y,x,x,y,x,y,y,x,x,y,x,y,x,y,x,y};

[0083] When N is 18, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,y,x,x,y,x,y,x,x};

[0084] When N is 18, the N second sequences are: {x,y,x,x,y,x,x,y,x,y,x,y,x,y,x,y,x,y};

[0085] When N is 20, the N second sequences are: {x,y,y,x,y,x,x,y,x,y,x,y,x,y,x,x,y,x,y,x};

[0086] When N is 20, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,x,y,x,y,x,y,x,y,x,x};

[0087] When N is equal to 22, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,y,x,x,y,y,x,x,y,x,y,x,x,y};

[0088] When N is 24, the N second sequences are: {x,y,y,x,x,y,x,y,y,x,x,y,x,y,x,y,x,y,x,y,x,y,x,y}; or,

[0089] When N is 24, the N second sequences are: {x,y,x,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y};

[0090] Where x represents sequence x in GCP; y represents sequence y in GCP.

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

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

[0093] In some possible designs, the communication device may include a processing module and a transceiver module. The transceiver module may include a transmitting module and a receiving module, respectively configured to implement the transmitting and 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.

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

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

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

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

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

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

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

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

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

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

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

[0105] 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0123] In this application, unless otherwise specified, the same or similar parts between the various embodiments can be referenced to each other. In the various embodiments of this application, unless otherwise specified and there is no logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships. The following description of the embodiments of this application does not constitute a limitation on the scope of protection of this application.

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

[0125] 1) Correlation: A correlation operation is a process between two sequences, including multiplication and addition operations between different elements of the two sequences. Correlation operations can include periodic or non-periodic correlation operations.

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

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

[0128] 4) Aperiodic Autocorrelation: When calculating sequence autocorrelation, the correlation value of the overlapping elements of the two sequences is calculated by the relative shift between the sequences. If the sequence length is L, the relative shift between the sequences can be -L+1, -L+2, ..., -1, 0, 1, ..., L-2, L-1, a total of 2L-1 possible cases. Therefore, the aperiodic autocorrelation operation has a total of 2L-1 possible results.

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

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

[0131] 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:

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

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

[0134] 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:

[0135]

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

[0137] 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, due to C x +C y =[8,0,0,0], so the sequence x and y is a GCP.

[0138] 6) Ambiguity function:

[0139] The ambiguity function can be used to measure the impact of Doppler shift and transmission delay on the transmitted sequence. Doppler shift is caused by the motion of the target object and can be roughly equivalent to a continuous phase rotation of the time-domain continuous signal sent by the transmitter.

[0140] 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 Doppler shift, so the receiver can use an ambiguity function to measure the impact of Doppler shift on the transmitted signal (or the multiple sequences transmitted).

[0141] 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):

[0142]

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

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

[0145] 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):

[0146]

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

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

[0149] 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 as the low ambiguity area of ​​the equivalent ambiguity function.

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

[0151] Each of the multiple sequences sent can be sequence x or sequence y in the GCP. In some possible implementations, it can be determined whether a sequence is sequence x or sequence y in the following two ways:

[0152] Method 1: Determination based on Prouhet–Thue–Morse (PTM) sequence:

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

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

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

[0156] 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]. The corresponding 16-bit sequence to be sent is [x,y,y,x,y,x,x,y,x,y,x,y,x,y,x].

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

[0158] For example, 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 fuzzy area near the value of the abscissa of 0. When the abscissa is 0, the value of v is 0. A v of 0 indicates that the target's moving speed is 0, or that the target is stationary.

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

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

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

[0162] For example, when N=16, the corresponding spreading sequence can be [1,-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 can be [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].

[0163] In the first approach, there are limitations on the number of sequences that can be sent. For example, the number of sequences must be a power of 2 and cannot be flexibly adjusted. In the second approach, although the number of sequences can be flexibly adjusted, the ambiguity function of the sequence does not have a clear low ambiguity region, and the position and / or velocity detection performance is not ideal.

[0164] For example, taking N equal to 18 and the extended sequence in mode 2 as [1,-1,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. 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. 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 can be seen from Figure 1c, the energy of the spectral function corresponding to the extended sequence is relatively large, and there is no low ambiguity area.

[0165] Based on this, the present application provides a sequence transmission method. In this method, the transmitting end sends N first sequences. Among them, the nth first sequence is determined based on the nth second sequence among N second sequences. a m is a prime number, M is a positive integer greater than 1, and n=0, 1,…, N-1.

[0166] Wherein, each second sequence is a sequence in GCP. N second sequences include first subsequence sets, each of which includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1 = 1. In each first subsequence set, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have the same second sequence index, forming a GCP.

[0167] Based on the solution of this application, due to a m is a prime number, therefore, compared to the above-mentioned method 1, this method supports more values ​​for the number of sequences. In addition, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have the same second sequence index, which constitutes a GCP. Since the low ambiguity zone of the fuzzy function corresponding to multiple sequences is affected by the arrangement of the multiple sequences, the arrangement of the N first sequences can be flexibly adjusted by designing the relationship between the second subsequence sets, thereby flexibly adjusting the low ambiguity zone of the corresponding fuzzy function. That is, the solution of the present application increases the diversity of sequences and improves the flexibility of sequence design, so that N first sequences can be flexibly designed according to perception requirements, thereby improving detection performance.

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

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

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

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

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

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

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

[0175] Optionally, the terminal device in the embodiment 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.

[0176] Optionally, the network device in the embodiment of the present application is a device that connects a terminal device to a wireless network. The network device may be a node in a radio access network (RAN), or may be a base station, which may be referred to as a radio access network node (or device).

[0177] For example, the network device may include an evolved NodeB (eNB) or e-NodeB in a long-term evolution (LTE) system or an enhanced LTE (LTE-Advanced, LTE-A) system, such as a traditional macro eNB and a micro eNB in ​​a heterogeneous network scenario. Alternatively, it may include a next-generation node B (gNB) in an 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 baseband unit (BBU), a baseband pool, or a wireless fidelity (WiFi) access point (AP). Alternatively, it may include a base station in an NTN, which can be deployed on an aircraft or a satellite. In the NTN, the network device may function as a Layer 1 (L1) relay, a base station, or an integrated access and backhaul (IAB) node. Alternatively, the network device may be a device that implements a base station function in IoT, such as a device that implements a base station function in drone communication, V2X, D2D, or machine to machine (M2M).

[0178] A network device may also be a module or unit that implements some of the functions of a base station. For example, a 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).

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

[0180] Optionally, the CU and DU may be divided according to the protocol layers of the wireless network: for example, the functions of the packet data convergence protocol (PDCP) layer and the protocol layers above it (such as the radio resource control (RRC) layer and the service data adaptation protocol (SDAP) layer, etc.) are set in the CU, and the functions of the protocol layers below the PDCP layer (such as the radio link control (RLC) layer, the media access control (MAC) layer, or the physical (PHY) layer, etc.) are set in the DU; for another example, the functions of the protocol layers above the PDCP layer are set in the CU, and the functions of the protocol layers at and below the PDCP layer are set in the DU, without restriction.

[0181] The above division of the processing functions of CU and DU according to the protocol layer is only an example, and they can also be divided in other ways. For example, the CU or DU can be divided into functions with more protocol layers, and the CU or DU can be divided into partial processing functions with protocol layers. For example, some functions of the RLC layer and the functions of the protocol layers above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set in the DU. For another example, the functions of the CU or DU can be divided according to the service type or other system requirements, such as division by delay, and the functions whose processing time needs to meet the delay requirements are set in the DU, and the functions that do not need to meet the delay requirements are set in the CU.

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

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

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

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

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

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

[0188] The communication interface 304 may be a transceiver module for communicating with other devices or a communication network, such as Ethernet, a radio access network (RAN), or a wireless local area network (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.

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

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

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

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

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

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

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

[0196] 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:

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

[0198] Wherein, N is a positive integer greater than 1. Exemplarily, N is a composite number. a m is a prime number, and M is a positive integer greater than 1. That is, a m is a factor of N, since a m is a prime number, so it can also be called a m is a prime factor of N. For example, M a m The sequence formed by sequentially splicing the values ​​of (m=0,…,M-1) is called factor sequence a, that is, a=[a0,a1,…,a M-1 ].

[0199] It is understood that when N has at least two different factors, different arrangements of the M factors correspond to different factor sequences a. For example, when N = 18, the factor sequence can be a = [2, 3, 3], or a = [3, 2, 3], or a = [3, 3, 2]. Optionally, for a certain value of N, when the factor sequence a is different, the corresponding N first sequences may also be different.

[0200] The N first sequences correspond one-to-one to the N second sequences. Specifically, 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. 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.

[0201] Each of the N second sequences is a sequence in the GCP. That is, each second sequence is sequence x or sequence y in the GCP. The length of sequence x and sequence y can be represented by L, where L is a positive integer. In other words, any first sequence in the N first sequences is determined based on sequence x or sequence y in the GCP.

[0202] Optionally, each of the N second sequences is a sequence in the same GCP.

[0203] Optionally, N first sequences may form a first sequence set s1, in, represents the nth first sequence in the first sequence set s1, that is, the nth first sequence among N first sequences, where n = 0, 1, ..., N-1. The length of the first sequence can be represented as L1.

[0204] Optionally, N second sequences may form a second sequence set s2, in, represents the nth second sequence in the second sequence set s2, that is, the nth second sequence among N second sequences, where n = 0, 1, ..., N-1. The length of the second sequence can be expressed as L2. Since the second sequence is sequence x or sequence y in the GCP, L2 = L.

[0205] Optionally, N first sequences correspond to N second sequences one by one, that is, the first sequence set corresponds to the second sequence set, and the nth first sequence With the nth second sequence correspond.

[0206] Among them, for each a m , N second sequences include First subsequence sets. Each first subsequence set includes a m Second subsequence sets. Each second subsequence set includes A second sequence, m = 0, 1, ..., M-1, a -1 = 1. In each first subsequence set, any two adjacent second subsequence sets are identical, or any two adjacent second subsequence sets have second sequences with the same index, forming a GCP. That is, in any two adjacent second subsequence sets, two second sequences with the same index are sequence x and sequence y in the GCP.

[0207] That is, there exists a set of values ​​a0, a1, ..., a M-1 ,satisfy m=0,…,M-1. For the mth value a in the set of values m , the N second sequences can be divided into The first subsequence sets, that is, N second sequences can be composed of The first subsequence sets are spliced ​​together. Each first subsequence set includes A second sequence.

[0208] Furthermore, each first subsequence set can be divided into a m A second subsequence set, that is, the first subsequence set can be composed of a m The second subsequence sets are sequentially spliced ​​together. Each second subsequence set includes A second sequence. For the first subsequence set including a m second subsequence sets, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have second sequences with the same index that constitute a GCP.

[0209] Optionally, any two adjacent second subsequence sets with the same index constitute a GCP, which may include: the second sequence with index k in the previous subsequence set is the first sequence in the GCP, and the second sequence with index k in the next subsequence set is the second sequence in the GCP; or the second sequence with index k in the previous subsequence set is the second sequence in the GCP, and the second sequence with index k in the next subsequence set is the first sequence in the GCP. k is 0 to

[0210] Optional, can be from 0 to Sequentially For each first subsequence set, it can be numbered from 0 to a m -1 in turn to a m For each second subsequence set, it can be numbered from 0 to Sequentially A second serial number.

[0211] Optionally, based on the above partitioning of the subsequence set, we can consider the factor a of N m and The first subsequence set corresponds to a m The second subsequence set corresponds to.

[0212] For example, take N=18, factor sequence a=[2,3,3], i.e., a0=2, a1=3, a2=3, and the second sequence set (i.e., N second sequences) s2={x,y,y,x,x,y,x,y,x,y,x,y,x,y,x,y,x,y} as an example:

[0213] For a0, the second sequence set includes There are nine first subsequence sets, and the nine first subsequence sets are: {x, y}, {y, x}, {x, y}, {x, y}, {y, x}, {x, y}, {x, y}, {y, x}, {x, y}. Each first subsequence set includes a0 = 2 second subsequence sets. For example, the two second subsequence sets included in the 0th first subsequence set {x, y} are: {x}, {y}, and the two second subsequence sets included in the 1st first subsequence set {y, x} are: {y}, {x}. It can be seen that for a0 = 2, any two adjacent second subsequence sets in each first subsequence set with the same second sequence index constitute a GCP.

[0214] For a1, the second sequence set includes The three first subsequence sets are: {x, y, y, x, x, y}, {x, y, y, x, x, y}, {x, y, y, x, x, y}. Each first subsequence set includes a1=3 second subsequence sets. For example, the three second subsequence sets included in the 0th first subsequence set {x, y, y, x, x, y} are: {x, y}, {y, x}, {x, y}.

[0215] Among the three second subsequence sets, the second sequence with index 0 in the 0th second subsequence set {x, y} is sequence x, and the second sequence with index 1 is sequence y; the second sequence with index 0 in the 1st second subsequence set {y, x} is sequence y, and the second sequence with index 1 is sequence x; and the second sequence with index 0 in the 2nd second subsequence set {x, y} is sequence x, and the second sequence with index 1 is sequence y. For the adjacent 0th second subsequence set and the 1st second subsequence set, the two second sequences with index 0 form a GCP, and the two second sequences with index 1 form a GCP. The 1st second subsequence set and the 2nd second subsequence set have a characteristic of type, that is, for a1 = 3, the second sequences with the same index in any two adjacent second subsequence sets in each first subsequence set form a GCP.

[0216] For a2, the second sequence set includes A first subsequence set is identical to a second subsequence set. The first subsequence set includes a2=3 second subsequence sets, which are {x,y,y,x,x,y}, {x,y,y,x,x,y}, and {x,y,y,x,x,y}. It can be seen that for a2=3, any two adjacent second subsequence sets in each first subsequence set are identical.

[0217] Optionally, the N first sequences or the N second sequences corresponding to the N first sequences may be determined autonomously by the transmitting device, or may be indicated (or configured) to the transmitting device by another device (referred to as a third-party device) via signaling. The third-party device may be, for example, a network device.

[0218] For example, the transmitting end device may be pre-configured with multiple sequence sets (each sequence set including multiple first sequences or second sequences). The third-party device may send an index of a first sequence set consisting of N first sequences, or send an index of a second sequence set consisting of N second sequences, to the transmitting end device, thereby indicating the N first sequences. Alternatively, where a value of N corresponds to a sequence set, the third-party device may send or indicate the value of N to the transmitting end device, thereby indicating the N first sequences through the value of N.

[0219] S402: The transmitting end device transmits N first sequences. Correspondingly, the receiving end device receives the first signal.

[0220] Optionally, the transmitting end device sending the N first sequences may include: the transmitting end device sending a signal (referred to as a second signal) generated based on each of the N first sequences. Exemplarily, when the transmitting end device is a network device, the second signal may be a reference signal.

[0221] Optionally, the N first sequences are mapped and sent in the time domain.

[0222] Optionally, the N first sequences may be sent sequentially within N consecutive first time units. For example, the nth first sequence among the N first sequences is sent within the nth time unit among the N consecutive first time units. The duration of each first time unit in the N consecutive first time units is the same.

[0223] Exemplarily, the signal (i.e., the second signal) generated based on each first sequence is a time domain signal, and the nth second signal generated based on the nth first sequence is sent within the nth first time unit corresponding to the first sequence. The second signal generated based on each of the N first sequences has the same duration.

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

[0225] 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 L unit discrete points (or discrete time-domain positions).

[0226] The length of the nth first time unit is The duration of each of the N consecutive first time units is the same, so

[0227] Optionally, each of the N consecutive first time units includes at least one symbol. The symbol may be a single carrier symbol; or, may be a single carrier quadrature amplitude modulation (SC-QAM) symbol; or, may be a single carrier frequency division multiple access (SC-FDMA) symbol.

[0228] Optionally, when the symbol is a single-carrier symbol or an SC-QAM symbol, the transmitting device can perform at least one operation of upsampling, filtering, digital to analog conversion, and upconversion on the N first sequences to obtain a second signal.

[0229] Exemplarily, the nth first time unit may include single carrier symbols or 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 can be P×T s . At this time, the time domain signal of each single carrier symbol (or each SC-QAM symbol) can be obtained by performing at least one of up-sampling, filtering, digital-to-analog conversion, and up-conversion based on a value sent by the single carrier symbol.

[0230] For example, One of the single carrier symbols can transmit a value of the first sequence, i.e. L1 single carrier symbols among the single carrier symbols can transmit a first sequence with a length of L1. The second signal includes time domain signals of the L1 single carrier symbols corresponding to the first sequence.

[0231] Optionally, when the symbol is an SC-FDMA symbol, the transmitting end device may perform Fourier transform, resource mapping, and inverse Fourier transform operations on the N first sequences to obtain a second signal.

[0232] As a possible example, the nth first time unit includes one SC-FDMA symbol, and the duration of the one SC-FDMA symbol is Either the nth first time unit includes an SC-FDMA symbol and a cyclic prefix (CP) of the SC-FDMA symbol; or the nth first time unit may include an SC-FDMA symbol and zero padding (ZP) of the SC-FDMA symbol.

[0233] When the length of the nth first time unit is equal to the length of the first sequence, the duration of the second signal is the same as the duration of the first time unit. In this case, the second signal is an SC-FDMA symbol, and the nth second signal can be obtained based on the nth first sequence through Fourier transform and inverse Fourier transform; or the nth second signal can be obtained based on the nth first sequence through Fourier transform, resource mapping, and inverse Fourier transform.

[0234] The number of Fourier transform points and the number of inverse Fourier transform points can be the same or different, and this application does not impose any restrictions. The number of Fourier transform points can refer to the length of the discrete Fourier transform, that is, the number of values ​​output by the discrete Fourier transform; the number of inverse Fourier transform points can refer to the length of the inverse discrete Fourier transform, that is, the number of values ​​output by the inverse discrete Fourier transform.

[0235] As another possible example, the nth first time unit may include N scfdma SC-FDMA symbols, the duration of one SC-FDMA symbol is Or the nth first time unit includes N scfdma SC-FDMA symbols and the N scfdma N SC-FDMA symbols correspond to scfdma cyclic prefix; or the nth first time unit includes N scfdma SC-FDMA symbols and the N scfdma N SC-FDMA symbols correspond to scfdma N zero padding. scfdma is a positive integer greater than 1.

[0236] For example, a first sequence of length L1 can be divided into N scfdma first subsequences, each of which includes L sub,1 N elements. scfdma The first subsequences include N scfdma L sub,1 elements, N scfdma L sub,1 ≥L1. Where, N scfdmaThe first L1 elements of the sequence obtained by sequentially concatenating the first subsequences constitute the first sequence.

[0237] When N scfdma L sub,1 >L1, N scfdma The end of the last first subsequence in the first subsequences N scfdma L sub,1 -L1 elements are 0. Among them (N scfdma -1)l sub,1 <L1。

[0238] N in the first time unit scfdma SC-FDMA symbols and N scfdma Specifically, the i′th SC-FDMA symbol can be obtained based on the i′th first subsequence through Fourier transform and inverse Fourier transform; or based on the i′th first subsequence through Fourier transform, resource mapping and inverse Fourier transform; i′=0, 1, …, N scfdma -1.

[0239] The first signal received by the receiving device can be understood as a signal after N first sequences (or N second signals) are transmitted.

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

[0241] S403: The receiving end device processes the first signal according to the N first sequences or the N second sequences.

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

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

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

[0245] Optionally, when the transmitting apparatus and the receiving apparatus are different devices, the transmitting apparatus may indicate to the receiving apparatus the N first sequences it transmitted or the second sequences corresponding to the N first sequences. Exemplarily, multiple sequence sets may be preconfigured in the transmitting apparatus and the receiving apparatus, and the transmitting apparatus may send an index of the first sequence set consisting of the N first sequences to the receiving apparatus, thereby indicating the N first sequences. Alternatively, where a value of N corresponds to a sequence set, the transmitting apparatus may send or indicate the value of N to the receiving apparatus, thereby indicating the N first sequences through the value of N.

[0246] Based on the above scheme, a m is a prime number. Therefore, compared to the first method described above, the present application supports more values ​​for the number of sequences, thereby supporting the flexible selection of an appropriate value for N based on different low ambiguity zone requirements and detection accuracy requirements. In addition, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets with the same second sequence index constitute a GCP. Therefore, the present application supports the flexible design of the relationship between the second subsequence sets based on different low ambiguity zone requirements and detection accuracy requirements. In other words, the solution of the present application increases the diversity of sequence design and improves the flexibility of sequence design, thereby supporting the flexible design of N first sequences according to actual needs and improving detection performance.

[0247] Illustratively, the second sequence set (ie, N second sequences) may be an item in Table 1, that is, possible values ​​of the second sequence set may be part or all of the rows in Table 1.

[0248] Table 1

[0249] N second sequence set s210{x,y,y,x,x,y,y,x,x,y}12{x,y,y,x,y,x,x,y,x,y,y,x}12{x,y,x,x,y,x,y,x,y,y,x,y}1 4{x,y,y,x,x,y,y,x,x,y,y,x,x,y}16{x,y,y,x,x,y,y,x,x,y,y,x,x,y,y,x}16{x,y,y,x,y,x,x,y,x,y ,y,x,y,x,x,y}18{x,y,y,x,x,y,x,y,y,x,x,y,x,y,y,x,x,y}18{x,y,y,x,x,y,y,x,x,y,y,x,x,y,y,x ,x,y}18{x,y,x,x,y,x,x,y,x,y,x,y,y,x,y,y,x,y}20{x,y,y,x,y,x,x,y,x,y,y,x,y,x,x,y,x,y,y,x}

[0250] 20{x,y,y,x,x,y,y,x,x,y,x,y,y,x,x,y,y,x,x,y}22{x,y,y,x,x,y,y,x,x,y,y,x,x,y,y,x,x,y,y,x,x,y}24{x,y ,y,x,x,y,x,y,y,x,x,y,x,y,y,x,x,y,x,y,y,x,x,y}24{x,y,x,x,y,x,y,x,y,y,x,y,x,y,x,x,y,x,y,x,y,y,x,y}

[0251] Optionally, when the transmitting end device is a terminal device, in the above step S401, the network device may indicate the second sequence set to the transmitting end device through signaling. The signaling may be RRC signaling or downlink control signaling (DCI). Exemplarily, the 14 possible values ​​of the second sequence set in Table 1 may be indicated by 4-bit RRC signaling. For example, 14 possible values ​​of the 16 possible values ​​of the 4 bits may correspond one-to-one to the 14 possible values ​​of the second sequence set shown in Table 1. The network device may send a certain value of the 4 bits to the transmitting end device, and the second sequence set indicated by the network device is the second sequence set corresponding to the value.

[0252] Optionally, all possible values ​​of the second sequence set may be part or all of the possible values ​​in Table 1.

[0253] It should be noted that the present application does not limit the presence of a corresponding factor sequence a for each second sequence set in Table 1. That is, for each second sequence set shown in Table 1, factor sequence a may or may not exist. For example, when factor sequence a exists, the factor sequences a corresponding to the second sequence sets shown in Table 1 from top to bottom may be: [2,5], [2,2,3], [3,2,2], [2,7], [2,2,2,2], [2,2,2,2], [2,3,3], [2,3,3], [3,3,2], [2,2,5], [2,5,2], [2,11], [2,3,2,2], [3,2,2,2].

[0254] In some embodiments, the N second sequences may include sequence groups, the There are at least two different sequence groups in the sequence groups. Indicates rounding down. When N is an even number, the A sequence group is composed of the N second sequences; when N is an odd number, the The sequence group is composed of the first N-1 second sequences among the N second sequences.

[0255] That is to say, each two second sequences in the N second sequences can be divided into a group in units of 2, and the obtained When N is an odd number, the last second sequence does not participate in the division of sequence groups.

[0256] For example, assuming that N is 10 and the N second sequences are {x, y, y, x, x, y, y, x, x, y}, the 10 second sequences can be divided into the following five sequence groups: {x, y}, {y, x}, {x, y}, {y, x}, {x, y}. Different sequence groups exist among the five sequence groups.

[0257] In other words, the N second sequences are not obtained by repeating the first two second sequences among the N second sequences.

[0258] For example, taking N equal to 8, if the starting two second sequences are sequence x and sequence y in the GCP sequence, then the N second sequences are not obtained based on the repetition of {x, y}, that is, the N second sequences are not {x, y, x, y, x, y, x, y}.

[0259] Optionally, when N is an odd number, the N second sequences are not obtained by repeating the first two second sequences among the N second sequences. This can be understood as: the first N-1 second sequences among the N second sequences are not obtained by repeating the first two second sequences, or the last second sequence among the N second sequences is not the first second sequence among the N second sequences.

[0260] For example, taking N equal to 9, if the first two second sequences are sequence x and sequence y in the GCP sequence, then the first N-1 of the N second sequences are not obtained based on the repetition of {x, y}, and the last second sequence is not sequence x, that is, the N second sequences are not {x, y, x, y, x, y, x, y, x}.

[0261] Based on this solution, since the N second sequences include Since at least two of the sequence groups are different, the N second sequences are not generated based on the repetition of the first two second sequences. This avoids the issue of a less distinct low-ambiguity region in the ambiguity function caused by the repetition of the first two second sequences. In other words, based on this design of N second sequences, a distinct low-ambiguity region in the ambiguity function can be achieved below a certain threshold, thereby improving detection performance compared to the second approach described above.

[0262] In some embodiments, there is at least one odd number a in the factor sequence a. j , a jIn each corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP, and j is an integer from 0 to M-1.

[0263] That is, there is at least one odd number a j , so that the N second sequences include first subsequence sets, each of which includes a j second subsequence sets, each of which includes Furthermore, in each first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP.

[0264] For example, in the example shown in step S401 above, N=18, factor sequence a=[2,3,3], i.e., a0=2, a1=3, a2=3, and N second sequences are {x,y,y,x,x,y,x,y,x,x,y,x,y,x,y,x,x,y}, j=1, a j =3.

[0265] Based on this scheme, since there is at least one odd number a j , so the number of sequences N is not limited to only containing factors of 2, and can support more values ​​of the number of sequences. In addition, although N in the second method can have odd factors, after the subsequence set is divided according to the method in step S401 above, any two adjacent second subsequence sets included in the multiple second subsequence sets corresponding to the odd factor are the same, that is, the relationship between any two adjacent second subsequence sets is fixed and cannot be flexibly adjusted. In the above design, the odd factor a j Among the multiple second subsequence sets included in the corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP. This design, compared to approach 2, increases the diversity and flexibility of sequence design, thereby supporting the flexible design of multiple sequences based on actual needs and improving detection performance.

[0266] In some embodiments, there is at least one a in the factor sequence a. k , a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same, and k is an integer from 1 to M-1.

[0267] That is, there is at least one integer k between 1 and M-1, and the a corresponding to this integer k is k , so that the N second sequences include first subsequence sets, each of which includes a ksecond subsequence sets, each of which includes Furthermore, in each first subsequence set, any two adjacent second subsequence sets are the same.

[0268] For example, in the example shown in step S401 above, N=18, factor sequence a=[2,3,3], i.e., a0=2, a1=3, a2=3, and N second sequences are {x,y,y,x,x,y,x,y,x,x,y,x,y,x,y,x,x,y}, k=2, a k =3.

[0269] When the number of sequences N only contains factor 2 (for example, N=8 contains 3 factors, all of which are 2), among the multiple sequences determined by method 1, after the subsequence sets are divided according to the method in step S401 above, in the two second subsequence sets included in the first subsequence set corresponding to a certain factor 2, the second sequences with the same index in any two adjacent second subsequence sets constitute a GCP, that is, the relationship between any two adjacent second subsequence sets is fixed and cannot be flexibly adjusted. In the above design of the present application, among the factors other than the first factor, there is at least one factor corresponding to the first subsequence set, and any two adjacent second subsequence sets are the same. In other words, based on this design, compared with method 1, the diversity of sequence design is increased, and the flexibility of sequence design is improved, so that it can support the flexible design of multiple sequences according to actual needs and improve detection performance.

[0270] In some embodiments, a=[a0,…,a M-1 ], there is at least one a in a k , a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same; and there is at least one a in sequence a q , a q In each corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute a GCP. k, q are integers from 1 to M-1, and M is greater than 2.

[0271] For example, in the example shown in step S401 above, N=18, factor sequence a=[2,3,3], i.e., a0=2, a1=3, a2=3, and N second sequences are {x,y,y,x,x,y,x,y,x,x,y,x,y,x,y,x,x,y}, k=2, a k =3,q=1,a q =3.

[0272] Based on this solution, the number of sequences N can include at least 3 factors, and the number of sequences N is not limited to only including the factor 2, and can support more values ​​of the number of sequences. Among the factors other than the first factor, there is at least one factor corresponding to the first subsequence set, and any two adjacent second subsequence sets are the same; and there is at least one factor corresponding to the first subsequence set, and any two adjacent second subsequence sets with the same index constitute a GCP. In other words, based on this design, compared to the solution of determining multiple sequences based on the PTM sequence, the diversity of sequence design is increased, the flexibility of sequence design is improved, and it can support the flexible design of multiple sequences according to actual needs and improve detection performance.

[0273] The above describes the appearance characteristics of the N second sequences from a macro perspective. The following describes how to determine the N second sequences.

[0274] Optionally, N second sequences and the first extended sequence s ext The first extended sequence includes N elements, and the nth element is denoted as s ext (n). When the nth element of the first extended sequence is a first numerical value, the nth second sequence among the N second sequences is a sequence x in the GCP; or, when the nth element of the first extended sequence is a second numerical value, the nth second sequence among the N second sequences is a sequence y in the GCP, where n = 0, 1, …, N-1.

[0275] That is, the N second sequences correspond one-to-one to the N elements of the first extended sequence. Once the values ​​of the N elements of the first extended sequence are determined, the N second sequences can be determined.

[0276] 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, or 0 and 1, or 1 and 0, 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.

[0277] 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 N second sequences are {x,y,y,x,x,y,x,y,x,y,x,y,x,y,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]; when the first value and the second value are 0 and 1 respectively, the first extended sequence is s ext =[0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1].

[0278] Optionally, the first extended sequence may include element groups, the There are at least two different element groups in the element groups. When N is an even number, the The element group consists of N elements of the first sequence; when N is an odd number, the The element group consists of the first N-1 elements in the first extended sequence.

[0279] That is, every two elements in the N elements in the first extended sequence can be divided into a group in units of 2, and the obtained When N is an odd number, the last element of the first extended sequence does not participate in the division of the element groups.

[0280] For example, N is equal to 10, and the first extended sequence is s ext =[1,-1,-1,1,1,-1,-1,1,1,-1] as an example, the 10 elements of the first extended sequence can be divided into the following 5 element groups: [1,-1], [-1,1], [1,-1], [-1,1], [1,-1]. Different element groups exist in the 5 element groups.

[0281] In other words, the first extended sequence is not obtained by repeating the first two elements of the first extended sequence. For example, taking N equal to 8, if the first two elements of the first extended sequence are 1 and -1, respectively, the first extended sequence is not obtained by repeating [1, -1]. That is, the first extended sequence is not [1, -1, 1, -1, 1, -1, 1, -1, 1, -1].

[0282] Optionally, when N is an odd number, the first extended sequence is not obtained by repeating the first two elements of the first extended sequence. This can be understood as: the first N-1 elements in the first extended sequence are not obtained by repeating the first two elements, or the last element in the first extended sequence is not the first element of the first extended sequence.

[0283] Exemplarily, taking N equal to 9 as an example, if the first two elements of the first extended sequence are 1 and -1 respectively, then the first N-1 elements of the first extended sequence are not obtained based on the repetition of [1, -1], or the last element is not 1, that is, the first extended sequence is not [1, -1, 1, -1, 1, -1, 1, -1, 1, 1].

[0284] Optional, the There are at least two different element groups in the element group, which can make the N second sequences include There are at least two different sequence groups in the sequence groups.

[0285] For example, taking the first value and the second value as 1 and -1 respectively, under certain values ​​of N, some first extended sequences provided by the present application may be as shown in Table 2.

[0286] Table 2

[0287] N first spreading sequence s ext10[1,-1,-1,1,1,-1,-1,1,-1]12[1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1]12[1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,-1]14[1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1]16[1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1, 1,1,-1,-1,1]16[1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,-1]18[1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1]18[1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1]18[1,-1,1,1, -1,1,1,-1,1,-1,-1,-1,-1,-1,-1,1,-1]20[1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1]20[1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,1,-1]22[1,-1,-1,1,-1,-1,-1, 1,1,-1,-1,1,1,-1,-1,-1,-1,1,-1,-1,1,-1]24[1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1]24[1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1]

[0288] It is understood that the first extended sequence shown in Table 2 can be modified to obtain a first extended sequence when the first value and the second value have other values. For example, 1 in Table 2 can be replaced with another value for the first value, and correspondingly, -1 in Table 2 can be replaced with another value for the second value. For example, when the first value and the second value are 0 and 1, respectively, 1 in Table 2 can be replaced with 0, and -1 can be replaced with 1, thereby obtaining another form of the first extended sequence.

[0289] Optionally, based on the first extended sequence of each row in Table 2, the second sequence set s2 of the corresponding row in Table 1 can be obtained. For example, based on the first extended sequence [1,-1,-1,1,1,-1,-1,1,1,-1] in the first row of Table 2, the second sequence set {x,y,y,x,x,y,y,x,x,y} in the first row of Table 1 can be obtained, and so on.

[0290] For example, taking N as 18 and the first extended sequence as [1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1,-1] shown in Table 2, 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. Taking the threshold of -35dB as an example, it can be seen from Figure 5 and Figure 1b that, compared with the scheme of determining multiple sequences based on the PTM sequence, the scheme of the present application can send fewer sequences and generate a larger low ambiguity area. That is, while improving the detection performance, it can also reduce the number of sequences sent, thereby saving resources.

[0291] For example, taking N equal to 18 and the first extended sequence as shown in Table 2 as [1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1], the spectral function of the first extended sequence obtained according to formula (2) is shown in Figure 6. 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. Taking the threshold of -35dB as an example, it can be seen from Figure 6 that a low ambiguity zone can be generated near the non-zero Doppler frequency domain through the first extended sequence. In other words, the solution of the present application can generate a low ambiguity zone at the Doppler frequency shift corresponding to a certain speed range, thereby realizing the detection of mobile targets within the speed range, that is, if the speed of the mobile target is within the speed range, the mobile target can be detected, thereby improving the flexibility and detection performance of the detection. Optionally, as a possible implementation, whether the value of the nth element of the first extended sequence is the first value or the second value can be determined in a structured manner. For example:

[0292] The nth element of the first extended sequence (or the value of the nth element) is Among them, b m satisfy: a -1 =1,b m =0,1,…,a m -1, c m Equal to 1 or -1, m=0,1,…,M-1, n=0,1,…,N-1.

[0293] Based on the above relationship, we can get b0, b1, ..., b through the factor sequence a and index n. M-1 . And, according to b0,b1,…,b M-1 and c0,c1,…,c M-1 (ie c m) to get the value of the nth element. Among them, b0, b1,…, b M-1 It can be expressed as a sequence b, that is, b=[b0,b1,…,b M-1 ]. c0,c1,…,c M-1 It can be expressed as a sequence c, that is, c=[c0,c1,…,c M-1 ]. Thus, by determining the values ​​of the factor sequence a and the sequence c, the value of the first extended sequence can be determined.

[0294] Optionally, there is at least one odd number a in the factor sequence a j , a j The corresponding c j Equal to -1, j is an integer from 0 to M-1.

[0295] Optional, odd factor a j The corresponding c j Equal to -1 can make the odd factor a j In each corresponding first subsequence set, any two adjacent second subsequence sets with the same index as the second sequence constitute a GCP. j The description of the corresponding first subsequence set and second subsequence set will not be repeated here.

[0296] Optionally, there is at least one a in the factor sequence a k , a k The corresponding c k is equal to 1, k is an integer from 1 to M-1. That is, there is at least one integer k between 1 and M-1, and the factor a corresponding to this integer k is k Corresponding c k is equal to 1.

[0297] Optional, factor a k The corresponding c k Equal to 1 can make a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same. Refer to the aforementioned factor a k The description of the corresponding first subsequence set and second subsequence set will not be repeated here.

[0298] Optionally, there is at least one a in the factor sequence a k , a k The corresponding c k is equal to 1, and there is at least one a in a q , a q The corresponding c q = -1. k, q are integers from 1 to M-1, where M is greater than 2.

[0299] Optional, factor ak The corresponding c k Equal to 1 can make a k In each corresponding first subsequence set, any two adjacent second subsequence sets are the same, factor a q The corresponding c q Equal to -1 can make a q In each corresponding first subsequence set, any two adjacent second subsequence sets with the same index as the second sequence constitute a GCP. k , a q The description of the corresponding first subsequence set and second subsequence set will not be repeated here.

[0300] Optionally, the first element of the factor sequence a can be an even number. In this case, the low ambiguity area of ​​the ambiguity function of the corresponding N second sequences is located near 0 Doppler shift (i.e., Doppler shift equals 0), and the N second sequences can be used to detect stationary or slow-moving target objects. Of course, the first element of the factor sequence a can also be an odd number. In this case, the low ambiguity area of ​​the ambiguity function of the corresponding N second sequences is located near a Doppler shift greater than 0. The N second sequences can be used to detect target objects moving within a certain speed range (the lowest speed of the speed range is greater than 0).

[0301] Optionally, the first element of sequence c can have the value -1.

[0302] Illustratively, Table 3 shows the values ​​of the factor sequence a and sequence c for certain values ​​of N provided in this application.

[0303] Table 3

[0304] N factor sequence a sequence c10[2,5][-1,-1]12[2,2,3][-1,-1,-1]12[3,2,2][-1,1,-1]14[2,7][-1,-1]16[2,2,2,2][-1,-1,1,1]16[2,2,2,2][-1,-1,-1,1]18[2,3,3][-1,-1, 1]18[2,3,3][-1,-1,-1]18[3,3,2][-1,1,-1]20[2,2,5][-1,-1,-1]20[2,5,2][-1,-1,1]22[2,11][-1,-1]24[2,3,2,2][-1,-1,1,1]24[3,2,2,2][-1,1,-1,1]

[0305] Optionally, the values ​​of the factor sequence a and sequence c in Table 3 can be obtained through a search. For example, the extended sequences corresponding to all possible values ​​and combinations of the factor sequence a and sequence c, as well as the N second sequences corresponding to the extended sequences, can be determined. The low ambiguity regions of the ambiguity functions for the N second sequences are then calculated for all cases. Given a given low ambiguity region threshold, the factor sequence a and sequence c corresponding to the N second sequences with the largest low ambiguity regions are selected.

[0306] Optionally, since all elements in the factor sequence a are factors of N and are prime numbers, and the elements of the sequence c are either -1 or 1, when the value of N is determined, the number of possible values ​​and combinations of the factor sequence a and the sequence c is relatively small, and the complexity of searching for the values ​​in Table 3 is relatively low.

[0307] Optional, by b m satisfy It can be seen that the index n corresponds to a sequence b, and different values ​​of n correspond to different sequences b. For example, taking N = 18, that is, n = 0, 1, ..., 17, and a = [2, 3, 3] as an example, the sequences b corresponding to various values ​​of n can be shown in Table 4.

[0308] Table 4

[0309] nb=[b0,b1,b2]nb=[b0,b1,b2]0[0,0,0]9[1,1,1]1[1,0,0]10[0,2,1]

[0310] 2[0,1,0]11[1,2,1]3[1,1,0]12[0,0,2]4[0,2,0]13[1,0,2]5[1,2,0]14[0,1,2]6[0,0,1]15[1,1,2]7[1,0,1]16[0,2,2]8[0,1,1]17[1,2,2]

[0311] Optionally, the nth element s of the first extended sequence ext (n) with Related, may include:

[0312]

[0313] In this scenario, one of the first value and the second value is 1, and the other is -1.

[0314] Alternatively, the nth element s of the first extended sequence ext (n) with Related, may include:

[0315]

[0316] Wherein, C and D are real numbers. C and D can be the same, for example, both equal to 1 / 2, in which case one of the first value and the second value is 0 and the other is 1; or C and D can be different, which is not specifically limited in this application.

[0317] Optionally, the first extended sequence shown in each row of Table 2 may be determined based on the factor sequence a and sequence c in the corresponding row of Table 3, according to the formula related to the first extended sequence. Of course, it may also be determined by other means, which is not specifically limited in this application.

[0318] Optionally, as another possible implementation, regarding whether the value of the nth element of the first extended sequence is the first value or the second value:

[0319] The first value and the second value may be phase values, or in other words, the phase of each value in the first extended sequence is the first value or the second value, and the amplitude of each value in the first extended sequence is the same. For example, the first value and the second value may be expressed as For example, or,

[0320] Optionally, the first extended sequence may be composed of the first N elements of the second extended sequence. The length of the second extended sequence is Q times the length of the first extended sequence, that is, the length of the second extended sequence is N×Q (denoted as N1, that is, N1=N×Q), and Q is greater than 1.

[0321] The second extended sequence corresponds to the N1 second sequences, and the corresponding relationship between the two is the same as the corresponding relationship between the first extended sequence and the N second sequences. That is, when the value of the nth element of the second extended sequence is a first value, the nth second sequence in the N1 second sequences is sequence x in the GCP. When the value of the nth element of the second extended sequence is a second value, the nth second sequence in the N1 second sequences is sequence y in the GCP.

[0322] Exemplarily, taking N equal to 12 and Q equal to 2, that is, N1=24 as an example, as shown in Table 2, the extended sequence with a length of 12 is composed of the first 12 elements of the extended sequence with a length of 24.

[0323] Optionally, the third extended sequence may be composed of the first N / Q elements of the first extended sequence. The length of the first extended sequence is Q times the length of the third extended sequence, that is, the length of the third extended sequence is (denoted as N2, i.e. ).

[0324] The third extended sequence corresponds to N2 second sequences, and the corresponding relationship between the two is the same as the corresponding relationship between the first extended sequence and the N second sequences. Please refer to the relevant description of the corresponding relationship between the first extended sequence and the N second sequences, which will not be repeated here.

[0325] For example, taking N2=10, and N equals 18 or 20 (i.e., Q is greater than 1), as shown in Table 2, an extended sequence of length 10 is composed of the first 10 elements of an extended sequence of length 18 or 20. Furthermore, among the extended sequences shown in Table 2, when N equals 14, 16, or 22, the aforementioned relationship between the third extended sequence and the first extended sequence is also satisfied.

[0326] That is, when the two extended sequences have different lengths, the shorter extended sequence can be composed of the first part of the elements of the longer extended sequence, or the longer extended sequence can be composed by splicing at least one element at the end of the shorter extended sequence.

[0327] Exemplarily, when the lengths of two extended sequences satisfy a relationship that is an integer multiple greater than 1, the longer extended sequence may be a repetition of the shorter extended sequence.

[0328] Optionally, when the lengths of the first extended sequence and the second extended sequence are multiples of greater than 1, and the extended sequences are generated based on the above-described structured approach, the first element of the factor sequence corresponding to the first extended sequence and the first element of the factor sequence corresponding to the second extended sequence are the same. Similarly, the first element of the factor sequence corresponding to the first extended sequence and the first element of the factor sequence corresponding to the third extended sequence are the same.

[0329] Based on this solution, since the two spreading sequences are related, if one spreading sequence is known, the complexity of determining the other spreading sequence can be reduced. For example, the known spreading sequence can be repeated to obtain the other spreading sequence. Furthermore, if the low-ambiguity region of the ambiguity functions of the multiple second sequences corresponding to the known spreading sequence is large, the low-ambiguity region of the ambiguity functions of the multiple second sequences corresponding to the other spreading sequence may also be good based on the relationship between the two spreading sequences, thereby improving detection performance.

[0330] Optionally, each extended sequence and the sequence set corresponding to each extended sequence (including multiple second sequences or multiple first sequences corresponding to the multiple second sequences) may be associated with a threshold. Within the low ambiguity region of the ambiguity function corresponding to a certain extended sequence or its corresponding sequence set, the value of the ambiguity function is less than or equal to the corresponding threshold. Exemplarily, the threshold may be -35dB, -45dB, -50dB, -55dB, or -60dB. This threshold may be referred to as the low ambiguity region threshold.

[0331] Optionally, the extended sequence and sequence set of the extended sequence can be designed based on their corresponding thresholds. For example, given a threshold, the extended sequence and sequence set corresponding to the threshold can be determined based on the threshold. Within the low ambiguity region of the ambiguity function corresponding to the extended sequence or sequence set designed based on the threshold, the value of the ambiguity function is less than or equal to the threshold.

[0332] Optionally, in a scenario where each extended sequence and its corresponding sequence set corresponds to a threshold, in step S401 above, when the transmitting end device autonomously determines N first sequences, the transmitting end device may pre-configure multiple sequence sets (for example, each sequence set includes multiple first sequence sets). In this case, the transmitting end device may determine the first sequence set (i.e., the N first sequences) from the multiple sequence sets based on the first threshold. Within the low ambiguity region of the ambiguity function corresponding to the first sequence set, the value of the ambiguity function corresponding to the first sequence set is less than or equal to the first threshold.

[0333] Optionally, the first threshold value may be determined according to detection requirements or accuracy. When the detection accuracy is high, the first threshold value may be a larger threshold value, and when the detection accuracy is low, the first threshold value may be a smaller threshold value.

[0334] Optionally, the transmitting end device may select, from multiple sequence sets, a sequence set whose corresponding threshold is less than or equal to the first threshold as the first sequence set.

[0335] Optionally, the above description uses the example of each sequence set pre-configured by the transmitting device including multiple first sequences. Furthermore, the multiple sequence sets pre-configured in the transmitting device may also include multiple second sequences. The transmitting device may select a second sequence set based on a first threshold, and then determine the first sequence set based on the second sequence set. Alternatively, the transmitting device may pre-configure multiple extended sequences. The transmitting device may select a first extended sequence based on a first threshold, determine a second sequence set based on the first extended sequence, and then determine the first sequence set based on the second sequence set. This application does not specifically limit this.

[0336] 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:

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

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

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

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

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

[0342] 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:

[0343]

[0344]

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

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

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

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

[0349] Optionally, the i-th element of the n-th first sequence and the i-th element of the n-th second sequence may satisfy the following relationship:

[0350] d 1,n (i) = d 2,n[(i+Δ)mod L2],i=0,1,…,L1-1

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

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

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

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

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

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

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

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

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

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

[0361] 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 transceiver module 702.

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

[0363] In some embodiments, the transceiver module 702, which may also be referred to as a transceiver unit, is used to implement the sending and / or receiving functions. The transceiver module 702 may be composed of a transceiver circuit, a transceiver, a transceiver, or a communication interface.

[0364] In some embodiments, the transceiver module 702 may include a receiving module and a sending module, which are respectively used to execute the receiving and sending steps performed by the sending end device in the above method embodiments, and / or used to support other processes of the technology described in this document; 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 in this document.

[0365] Exemplarily, the processing module 701 is configured to determine N first sequences. The transceiver module 702 is configured to send the 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. a m is a prime number, M is a positive integer greater than 1, n=0,1,…,N-1;

[0366] Each second sequence is a sequence in a Golay complementary pair GCP. The N second sequences include First subsequence sets. Each first subsequence set includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1 = 1. In each first subsequence set, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have the same second sequence index, forming a GCP.

[0367] Optionally, the processing module 701 is specifically configured to: determine, according to a first threshold, a first sequence set from multiple sequence sets, where, within a low ambiguity region of the ambiguity function corresponding to the first sequence set, a value of the ambiguity function corresponding to the first sequence set is less than or equal to the first threshold.

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

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

[0370] 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 transceiver module 702 in FIG7 can be implemented by the communication interface 304 in the communication device 30 shown in FIG3.

[0371] In some embodiments, when the transmitting device 70 in Figure 7 is a chip or a chip system, the function / implementation process of the transceiver 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.

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

[0373] 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 transceiver module 802.

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

[0375] In some embodiments, the transceiver module 802, which may also be referred to as a transceiver unit, is used to implement the sending and / or receiving functions. The transceiver module 802 may be composed of a transceiver circuit, a transceiver, a transceiver, or a communication interface.

[0376] In some embodiments, the transceiver module 802 may include a receiving module and a sending module, which are respectively used to execute the receiving and 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.

[0377] Exemplarily, the transceiver module 802 is configured to receive a first signal. The processing module 801 is configured to process the first signal according to N first sequences or N second sequences. The first signal is a signal after the N first sequences are transmitted, and the nth first sequence among the N first sequences is determined based on the nth second sequence among the N second sequences. a m is a prime number, M is a positive integer greater than 1, and n=0, 1,…, N-1.

[0378] Each second sequence is a sequence in a Golay complementary pair GCP. The N second sequences include First subsequence sets. Each first subsequence set includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1 = 1. In each first subsequence set, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have the same second sequence index, forming a GCP.

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

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

[0381] 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 transceiver module 802 in FIG8 can be implemented by the communication interface 304 in the communication device 30 shown in FIG3.

[0382] In some embodiments, when the receiving device 80 in Figure 8 is a chip or a chip system, the function / implementation process of the transceiver 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0401] 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)). In the embodiment of the present application, the computer may include the aforementioned device.

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

[0403] 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: determining N first sequences, wherein an nth first sequence among the N first sequences is determined based on an nth second sequence among the N second sequences; a m is a prime number, M is an integer greater than 1, n=0,1,…,N-1, N is a positive integer greater than 1; Sending the N first sequences; Wherein, each of the second sequences is a sequence in a Golay complementary pair GCP; the N second sequences include first subsequence sets, each of which includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1 =1; in each of the first subsequence sets, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have second sequences with the same index that constitute a GCP.

2. The method according to claim 1, characterized in that The N first sequences constitute a first sequence set; and determining the N first sequences includes: The first sequence set is determined from multiple sequence sets according to a first threshold, and within a low ambiguity region of the ambiguity function corresponding to the first sequence set, a value of the ambiguity function corresponding to the first sequence set is less than or equal to the first threshold.

3. A sequence receiving method, characterized in that: The method comprises: receiving a first signal, where the first signal is a signal of N first sequences that have been transmitted, and an nth first sequence among the N first sequences is determined based on an nth second sequence among the N second sequences; a m is a prime number, M is a positive integer greater than 1, n=0,1,…,N-1; Processing the first signal according to the N first sequences or the N second sequences; Wherein, each of the second sequences is a sequence in a Golay complementary pair GCP; the N second sequences include first subsequence sets, each of which includes a m second subsequence sets, each of which includes A second sequence, m = 0, 1, ..., M-1, a -1 =1; in each of the first subsequence sets, any two adjacent second subsequence sets are the same, or any two adjacent second subsequence sets have second sequences with the same index that constitute the GCP.

4. The method according to any one of claims 1 to 3, characterized in that The N second sequences include sequence groups, the There are at least two different sequence groups in the sequence groups. Indicates rounding down; When N is an odd number, the The sequence group consists of the first N-1 second sequences among the N second sequences.

5. The method according to any one of claims 1 to 4, characterized in that The a m ,m=0,1,…,M-1consists of a=[a0,…,a M-1 ], there is at least one odd number a in the a j , the a j In the corresponding first subsequence set, any two adjacent second subsequence sets with the same second sequence index constitute the GCP, and j is an integer from 0 to M-1.

6. The method according to any one of claims 1 to 5, characterized in that The a m ,m=0,1,…,M-1consists of a=[a0,…,a M-1 ], there is at least one a in the a k , the a k In the corresponding first subsequence sets, any two adjacent second subsequence sets are the same, and k is an integer from 1 to M-1.

7. The method according to any one of claims 1 to 6, characterized in that The N second sequences correspond to the first extended sequence; 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; or 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; The nth element of the first extended sequence is Related, b m satisfy: c m Equal to 1 or -1, m=0,1,…,M-1, n=0,1,…,N-1.

8. The method according to claim 7, characterized in that The first spreading sequence includes element groups, the There are at least two different element groups in each element group. Indicates rounding down; When N is an odd number, the The element groups are composed of the first N-1 elements in the first spreading sequence.

9. The method according to claim 7 or 8, characterized in that a=[a0,…,a M-1 ], there is at least one odd number a in the a j , the a j The corresponding c j Equal to -1, j is an integer from 0 to M-1.

10. The method according to any one of claims 7 to 9, characterized in that: a=[a0,…,a M-1 ], there is at least one a in the a k , the a k The corresponding c k is equal to 1, and k is an integer from 1 to M-1.

11. The method according to any one of claims 7 to 10, characterized in that: The nth element of the first extended sequence satisfies at least one of the following: Among them, s ext (n) represents the nth element of the first spreading sequence.

12. The method according to any one of claims 7 to 11, characterized in that: The first extended sequence is composed of the first N elements of the second extended sequence, the length of the second extended sequence is Q times the length of the first extended sequence, and Q is greater than 1; and / or, The third spreading sequence is composed of the first N / Q elements of the first spreading sequence, and the length of the first spreading sequence is Q times the length of the third spreading sequence.

13. The method according to any one of claims 7 to 12, characterized in that: a=[a0,…,a M-1 ],c=[c0,…,c M-1 ], a and c satisfy at least one of the following: When N is 10, a = [2, 5], c = [-1, -1]; When N is 12, a = [2, 2, 3], c = [-1, -1, -1]; When N is 12, a = [3, 2, 2], c = [-1, 1, -1]; When N is 14, a = [2, 7], c = [-1, -1]; When N is 16, a = [2, 2, 2, 2], c = [-1, -1, 1, 1]; When N is 16, a = [2, 2, 2, 2], c = [-1, -1, -1, 1]; When N is 18, a = [2, 3, 3], c = [-1, -1, 1]; When N is 18, a = [2, 3, 3], c = [-1, -1, -1]; When N is 18, a = [3, 3, 2], c = [-1, 1, -1]; When N is 20, a = [2, 2, 5], c = [-1, -1, -1]; When N is 20, a = [2, 5, 2], c = [-1, -1, 1]; When N is 22, a = [2, 11], c = [-1, -1]; When N is 24, a=[2,3,2,2], c=[-1,-1,1,1]; or When N is equal to 24, a=[3,2,2,2], c=[-1,1,-1,1].

14. The method according to any one of claims 7 to 13, characterized in that: The first value is 1, the second value is -1, and the first extended sequence is at least one of the following: When N is 10, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1]; When N is 12, the first extended sequence is: [1,-1,-1,1,-1,1,-1,-1,-1,-1,1]; When N is 12, the first extended sequence is: [1,-1,1,1,-1,1,-1,-1,-1,-1,1,-1]; When N is 14, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1]; When N is 16, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1]; When N is 16, the first extended sequence is: [1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,1,-1]; When N is 18, the first extended sequence is: [1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,1,-1]; When N is 18, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1]; When N is 18, the first extended sequence is: [1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; When N is 20, the first extended sequence is: [1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,1,-1,1]; When N is 20, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1]; When N is 22, the first extended sequence is: [1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,-1]; When N is 24, the first spreading sequence is: [1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1]; or, When N is equal to 24, the first extended sequence is: [1,-1,1,1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1].

15. The method according to any one of claims 1 to 14, characterized in that The nth first sequence among the N first sequences and the nth second sequence among the N second sequences satisfy one of the following: The nth first sequence and the nth second sequence are the same; The nth first sequence is formed by splicing the nth second sequence and at least one 0; The nth first sequence is obtained by cyclically extending the nth second sequence; or, The nth first sequence is formed by concatenating a result obtained by cyclically extending the nth second sequence and at least one 0.

16. The method according to claim 15, characterized in that When the nth first sequence is obtained by cyclically extending the nth second sequence: d 1,n (i)=d 2,n [(i+Δ)mod L2],i=0,1,…,L1-1 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.

17. The method according to any one of claims 1 to 16, characterized in that The N second sequences are at least one of the following: When N is 10, the N second sequences are: {x, y, y, x, x, y, y, x, x, y}; When N is 12, the N second sequences are: {x, y, y, x, y, x, x, x, y, x, y, x}; When N is 12, the N second sequences are: {x, y, x, x, y, x, y, x, y, x, y}; When N is 14, the N second sequences are: {x, y, y, x, x, y, y, x, x, y, x, x, y}; When N is 16, the N second sequences are: {x, y, y, x, x, y, y, x, x, y, x, x, y, x, x}; When N is 16, the N second sequences are: {x, y, y, x, y, x, x, y, x, y, x, x, x, x, y}; When N is 18, the N second sequences are: {x, y, y, x, x, y, x, y, x, x, y, x, x, y, x, x, y}; When N is 18, the N second sequences are: {x, y, y, x, x, y, y, x, x, y, x, x, y, x, x, y, x, x}; When N is 18, the N second sequences are: {x, y, x, x, y, x, x, x, y, x, y, x, y, x, y, x, y}; When N is 20, the N second sequences are: {x, y, y, x, y, x, x, y, x, y, x, y, x, x, x, x, y, x}; When N is 20, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,x,y,x,y,x,y,x,y,x,x}; When N is equal to 22, the N second sequences are: {x,y,y,x,x,y,y,x,x,y,y,x,x,y,y,x,x,y,x,y,x,y}; When N is equal to 24, the N second sequences are: {x,y,y,x,x,y,x,y,y,x,x,y,x,y,x,y,x,y,x,y,x,y,x,y}; or, When N is 24, the N second sequences are: {x,y,x,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y,x,y}; Wherein, x represents sequence x in the GCP; y represents sequence y in the GCP.

18. A communication device, characterized in that: The method comprises a module or unit for executing the method according to any one of claims 1, 2, 4-17, or a module or unit for executing the method according to any one of claims 3-17.

19. A communication device, characterized in that: The communication device includes a processor; the processor is used to run a computer program or instruction, or to use a logic circuit to enable the communication device to execute the method according to any one of claims 1, 2, 4-17, or to enable the communication device to execute the method according to any one of claims 3-17.

20. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions or programs, which, when executed on a computer, cause the method according to any one of claims 1, 2, 4-17 to be executed, or cause the method according to any one of claims 3-17 to be executed.

21. 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, 2, 4-17 is executed, or the method according to any one of claims 3-17 is executed.

22. A communication system, characterized in that: The communication system includes a transmitting device and a receiving device; wherein the transmitting device is used to execute the method according to any one of claims 1, 2, and 4-17, and the receiving device is used to execute the method according to any one of claims 3-17.

Images