CN101262255A

CN101262255A - Sequence allocation and processing method and device for communication system

Info

Publication number: CN101262255A
Application number: CN 200710112774
Authority: CN
Inventors: 曲秉玉; 何玉娟; 冯瑄
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2007-03-07
Filing date: 2007-06-17
Publication date: 2008-09-10
Anticipated expiration: 2027-06-17
Also published as: CN101262255B; CN103220109B; CN103220109A

Abstract

The embodiment of the invention provides a sequence distribution and processing method in a communication system and a corresponding device thereof. Sequences in each sequence group are divided into a plurality of subgroups; the sequences in each subgroup are obtained by selecting from a candidate sequence set corresponding to the subgroup according to a certain rule; definite sequences are distributed to a subarea by the system. As for the subgroup i, a function fi (question mark) corresponding to the subgroup is determined and a domain of definition of the function is the candidate sequence set corresponding to the subgroup; the sequences in the subgroup i of the sequence group k are determined by selecting n sequences in the candidate sequence set while the sequences cause values of a function d (fi (question mark), Gk) to be smaller, wherein, k is a group number of the sequence group, i is a sequence number of the subgroup, n is a natural number, d(a, b) is a binary function and Gk is a value determined by the group number k. The occurrence of the sequence highly correlative to a certain length of the sequence can be avoided in other sequence groups, thus reducing strong interference. No substantial tables of the sequence group are required to be stored so as to reduce the complexity of the system.

Description

Method and device for sequence allocation and processing in communication system

Technical Field

The present invention relates to the field of communications, and in particular, to a sequence allocation technique in a communication system.

Background

In a communication system, a constant amplitude zero auto-correlation (CAZAC) sequence is a very important communication resource. The characteristics are as follows:

■ the amplitude is modulo a constant value, for example, can be normalized to 1.

■ zero period autocorrelation, the other cyclic shift autocorrelation of the sequence itself is zero except that the correlation with itself is the largest.

Since the CAZAC sequence has the above properties, the sequence in the frequency domain is also a CAZAC sequence after Fourier transform. The sequence having this characteristic is suitable as a reference signal in communication, for example, for channel estimation.

For example, in a single carrier frequency division multiple access (SC-FDMA) system, the elements of a CAZAC sequence are sequentially transmitted on a plurality of subcarriers within one symbol time, and a receiver can perform channel estimation using a received signal if the sequence of the transmitted signal is known. Since the amplitude of the transmitted signal is equal on each subcarrier in the frequency domain, the receiver can estimate the channel fading on each subcarrier fairly. Meanwhile, due to the constant amplitude characteristic of the CAZAC sequence in the time domain, the peak-to-average ratio of a transmitted waveform is small, and the transmitting of a transmitter is easy.

For another example, in the random access preamble signal in the SC-FDMA system, a CAZAC sequence may be used. The preamble sequence of the random access signal can be modulated on a frequency domain subcarrier and transformed to a time domain through Fourier transform for transmission. Thus, by utilizing the good autocorrelation and cross correlation of the CAZAC sequence, the interference between the random access preamble signals of different cells and different users is small.

Because the CAZAC signal is a CAZAC signal in both time domain and frequency domain, the CAZAC signal can also be directly modulated to signal transmission in time domain occupying a certain bandwidth.

There are many CAZAC sequences, one of the more commonly used is the Zadoff-Chu (Zadoff-Chu) sequence. In addition to the Zadoff-Chu Sequence, there are GCL Sequence (Generalized Chirpike Sequence), Milewski Sequence, and the like. Taking the Zadoff-Chu sequence as an example, the generation mode of the Zadoff-Chu sequence, or the expression of the Zadoff-Chu sequence is as follows:

formula (1)

Where r is a parameter of sequence generation and is a number prime to N, and q is an arbitrary integer. When different values of r are taken, different sequences are obtained. r is called base sequence index, q corresponds to different cyclic shifts, namely, the r value determines the base sequence, and the q value determines different cyclic shifts of the same base sequence. Sequences generated by different cyclic shifts of one sequence are referred to as cyclic shifted sequences generated from the same base sequence. For aThe same two r values, e.g., r-u and r-v, when (u-v) is interdependent with N, the cross-correlation of the two sequences is small and has good cross-correlation. When N itself is a prime number,

r

1, 2, N-1 different CAZAC sequences are generated, and the cross-correlation between these sequences is good. In the above example, where N is a prime number, the absolute value of the normalized cross-correlation between the two sequences isThe conjugate of the Zadoff-Chu sequence is also a CAZAC sequence.

In a typical cellular communication system, when one cell selects a sequence modulated transmission, another cell selects another sequence with low cross-correlation properties. For example: when the Zadoff-Chu sequence is used, when N is prime number, different cells select different r values, low cross correlation can be ensured, and interference is small.

The modulated signal transmitted by a cell can also adopt fragments of the original sequence or repeat circularly, and can basically keep the good self-correlation and cross-correlation characteristics of the original sequence. Particularly, when the number of the sub-carriers carrying the sequences in the cell is not a prime number, the sequences with prime number length around the number of the sub-carriers are selected, the desired sequences are obtained by a method of truncation or cyclic extension of the sequences, and then the sequences are transmitted. In the following description, the operation of truncation or cyclic extension of the sequence is omitted.

When signals of multiple sequences transmitted by different cells occupy the same time-frequency resource, referring to fig. 1, the sequences transmitted by cell a and cell B have the same length. For example, two different Zadoff-Chu sequences of prime N length may be selected, where the correlation between the two sequences is low when the base sequence indices of the two sequences are different, and thus the interference between the transmitted signals of different cells is small.

Referring to fig. 2, when the signals of the modulated sequences occupy different time-frequency resources, some users of cell a transmit the sequence-modulated signals on the radio resource with the bandwidth of B1, and some users of cell B transmit the sequence-modulated signals on the radio resource with the bandwidth of B2 at the same time, and the two portions of time-frequency resources are partially overlapped. Each cell in the system of fig. 2 has the same subcarrier width, 36 subcarriers are provided in the B1 bandwidth, 144 subcarriers are provided in the B2 bandwidth, and since the sequences are mapped on the subcarriers and the length of the subcarriers corresponds to the length of the sequences, it is obvious that two cells need to select sequences with different lengths respectively. In this case, the long sequence and the short sequence may interfere with each other relatively strongly. The planning of the sequence becomes relatively complex. In the example of fig. 2, there are only two sequences of different lengths, and in practice, there are more sequences of different lengths and complexity according to different sizes of radio resources occupied by user transmission.

The above-mentioned modulated signals of sequences occupying different time-frequency resources often occur in SC-FDMA systems. Since the sequence serves as a reference signal providing channel estimation required for data demodulation, it is transmitted along with the bandwidth resources of the data. The data bandwidth of a user often has different bandwidths and positions at different times according to a certain scheduling rule, so the way that the sequences of the reference signals of different cells occupy time-frequency resources also changes at all times, resulting in that the interference among the cells is affected by the correlation of the sequences with different lengths. More seriously, because the system usually utilizes the shift correlation property of the sequences to obtain multiple orthogonal sequences of code division through different cyclic time shifts, and the orthogonal sequences are allocated to different users, once strong interference occurs between the sequences of two lengths, the users using the sequences of two lengths will mutually strongly interfere.

Of course, the manner in which the sequences occupy the time-frequency resources is not limited to the above example. For example, if different length sequences can be modulated at the same sampling frequency in the time domain, the problem of correlation between long and short sequences can also occur. It may also be the case that the sequence occupies the frequency domain subcarriers at different subcarrier intervals, or occupies the time samples at different time sample intervals. In other words, the sequence is not modulated on all subcarriers/samples, but on every fixed number of subcarriers/samples.

In summary, the problem of interference between cells is relatively complex when sequences occupy time-frequency resources in different ways. In particular, when there are sequences of different lengths, not only is the sequence of each length planned separately, but also the problem of interference between the sequences of different lengths in a multi-cell system is considered.

Disclosure of Invention

The technical problem to be solved by the present invention is to provide a method and an apparatus for sequence allocation in a communication system, which avoid strong interference generated by sequences occupying different time-frequency resources between different sequence groups.

Another problem to be solved by the present invention is: a method and apparatus for sequence processing in a communication system are provided, which do not need to store a pre-stored list consisting of sequences of sequence groups to be allocated, thereby saving communication resources.

To solve the above problem, an embodiment of the present invention provides a method for allocating sequences in a communication system, where the method includes:

dividing the sequences in the sequence group into a plurality of subgroups, wherein each subgroup corresponds to a respective time-frequency resource occupation mode;

the sequence in each subgroup is selected from the candidate sequence set corresponding to the subgroup, and the selecting method specifically comprises the following steps: the sequences in subgroup i in sequence group k are selected from the candidate sequence set such that function d (f)_i(·)，G_k) Is selected from the smallest, next smallest and smaller n sequences, wherein k is the group number of the sequence group, i is the serial number of the subgroup, n is a natural number, d (a, b) is a binary function, G_kIs a quantity, function f, determined by the group number k_i() a function corresponding to the subgroup i, the function defining a set of candidate sequences corresponding to the subgroup i;

the sequence groups are allocated to cells/users/channels.

The embodiment of the invention also provides a method for processing the sequence, which comprises the following steps:

receiving a group number k of a sequence group allocated by a system;

selecting the function d (f) from the candidate sequence set_i(·)，G_k) N sequences of minimum, second minimum, or even smaller values of (a) constitute sequences in subgroup i in sequence group k, where i is the subgroup's serial number, n is a natural number, d (a, b) is a binary function, G is a binary function_kIs a quantity, function f, determined by the group number k_i() a function corresponding to the subgroup i, the function defining a set of candidate sequences corresponding to the subgroup i;

and generating corresponding sequences according to the sequences in the formed subgroups, and transmitting or receiving on the time-frequency resources corresponding to the subgroup i.

The embodiment of the invention also provides a sequence processing device, which comprises

A sequence selection unit: for receiving the group number k of the sequence group assigned by the system, selecting the function d (f) in the candidate sequence set_i(·)，G_k) N sequences of the smallest, second smallest, or even smaller values of (a) constitute sequences in subgroup i in sequence group k, where i is the serial number of the subgroup, n is a natural number, where d (a, b) is a binary function, k is the group number of the sequence group, G_kIs a quantity, function f, determined by the group number k_i() a function corresponding to the subgroup i, the function defining a set of candidate sequences corresponding to the subgroup i;

a sequence processing unit: and the sequence generator is used for generating a corresponding sequence according to the formed sequence of the subgroup i and processing the sequence on the time-frequency resource corresponding to the subgroup i.

The embodiment of the invention also provides a method for distributing the sequence in the communication system, which comprises the following steps:

the sequence in each subgroup is selected from the candidate sequence set corresponding to the subgroup, and the selecting method specifically comprises the following steps: at least one sequence group k, wherein the sequences of at least two subgroups i, j are selected from the candidate sequence set such that the function d (f)_i(·)，f_j(. DEG)) values of the smallest, next smallest, and up to smaller n sequences are selected, where i, j is the sequence number of the subgroup, n is a natural number, and d (f)_i(·)，f_j(. -) is a binary function, function f_i(. or f)_j(. h) is a function corresponding to the subgroup i or j, and the function definition domain is the candidate sequence set corresponding to the subgroup i or j;

the sequence groups are allocated to cells/users/channels.

The embodiment of the invention also provides a device for processing the sequence in the communication system, which comprises:

a second sequence selection unit: a group number k for receiving a system-assigned sequence group, the sequences of at least two subgroups i, j in the sequence group k being such that a function d (f) is given by the candidate sequence set corresponding to the subgroup_i(·)，f_j(. DEG)) values of the smallest, next smallest, and up to smaller n sequences are selected, where i, j is the sequence number of the subgroup, n is a natural number, and d (f)_i(·)，f_j(. -) is a binary function, function f_i(. or f)_j(. h) is a function corresponding to the subgroup i or j, and the function definition domain is the candidate sequence set corresponding to the subgroup i or j;

a second sequence processing unit: and the device is used for selecting or generating a corresponding sequence according to the formed sequence and transmitting or receiving the corresponding sequence on a corresponding time-frequency resource.

The embodiment of the invention also provides a method for distributing the communication sequence, which comprises the following steps:

the sequence in each subgroup is selected and generated from a candidate sequence set corresponding to the subgroup, where the candidate sequence set is specifically a cyclic shift sequence generated by a base sequence in time or frequency, and the selecting method specifically includes: determining a cyclic shift sequence by a distance of a time-frequency resource position occupied by the cyclic shift sequence relative to a reference time-frequency resource position;

the sequence groups are allocated to cells/users/channels.

a third sequence selection unit: the method for selecting the cyclic shift sequence in time or frequency generated by a base sequence includes the steps of: determining the cyclic shift sequence by the distance of the time frequency resource positions occupied by different cyclic shift sequences relative to a reference time frequency resource position;

a third sequence processing unit: and the device is used for selecting or generating a corresponding sequence according to the formed sequence and transmitting or receiving the corresponding sequence on a corresponding time-frequency resource.

the sequence in each subgroup is selected from the candidate sequence set corresponding to the subgroup to generate, and the generating method specifically comprises the following steps: when the sequences in the subgroup need to carry out cyclic shift expansion or truncation on the sequences in the candidate sequence set, a symmetric expansion or symmetric truncation method is adopted;

the sequence groups are allocated to cells/users/channels.

In the sequence allocation method, the transmitting method and the receiving method and the device, the sequences in each sequence group are divided into a plurality of subgroups, and each subgroup corresponds to a time-frequency resource occupation mode; the sequences in each subgroup are selected and generated from the candidate sequence set corresponding to the subgroup, and the selected rule ensures that the correlation of the sequences among different groups is relatively low, so that the interference among the sequences with different lengths is small. On the other hand, in the methods and devices of the present invention, the sequence is determined by a calculation selection method at the time of reception or transmission, so that it is not necessary to store a large-scale table composed of sequences of sequence groups, thereby reducing the complexity of the system.

Drawings

FIG. 1 is a diagram illustrating a prior art technique for transmitting sequences of different cells occupying the same time-frequency resources and using sequences of the same length;

FIG. 2 is a diagram illustrating a prior art technique in which different cell transmission sequences occupy partially overlapping time-frequency resources and use different-length sequences;

FIG. 3 is a schematic flow chart of a transmitting method according to an embodiment of the present invention;

FIG. 4 is a diagram illustrating a calculation process for u, v determination according to an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a transmitting device according to an embodiment of the present invention;

fig. 6 is a flow chart illustrating a receiving method according to an embodiment of the present invention;

FIG. 7 is a flow chart of a receiving apparatus according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of a non-centrosymmetric time-frequency resource occupation manner in an embodiment of the present invention;

FIG. 9 is a diagram illustrating a central symmetric time-frequency resource occupation manner according to an embodiment of the present invention;

FIG. 10 is a diagram illustrating an occupation manner of high-frequency truncated time-frequency resources according to an embodiment of the present invention;

FIG. 11 is a diagram illustrating a time-frequency resource occupation manner of low frequency truncation in an embodiment of the present invention;

FIG. 12 is a schematic diagram of the occupation of the time-frequency resources by the high-frequency cyclic extension according to the embodiment of the present invention;

fig. 13 is a schematic diagram of a time-frequency resource occupation manner of low-frequency cyclic expansion in the embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the accompanying drawings.

The 30 th 2006 of Huashi technology Limited, provides a technical scheme in the patent application with the patent application number 200610173364.5, which is applied by the national intellectual property office of the people's republic of China and is not yet published, and can solve the problem of sequence interference caused by different time-frequency resource occupation modes by using a sequence grouping method. The method comprises the following steps: the sequences in one group are composed of a plurality of sequences corresponding to different time frequency resource occupation modes; sequences with strong correlation are classified into one group, correlation between different groups is relatively low, and then distribution and use of the sequence group are carried out among cells. Because the sequences with strong correlation are in the same group, the sequences in the same group are only used in the cell, and the correlation between the sequence groups used by different cells is low, the strong correlation is avoided when different cells use the sequences with different lengths.

Sequences with strong correlations are grouped into a group, and generally, the composition of all sequences of each group can be stored. When a cell user or a channel needs to use a certain sequence which is allocated to the cell user or the channel and corresponds to a certain time-frequency resource occupation mode in a sequence group, finding out the used sequence in the stored corresponding sequence group. However, the formation of the sequence group requires a pre-stored table, and when the size of the sequence group becomes large, the storage takes a lot of space and the search is time-consuming. These additional stores add complexity and waste hardware resources.

Detailed description of the invention

In the embodiment of the invention, the system allocates sequence groups to cells/users/channels, wherein the sequences in each sequence group are divided into a plurality of sequence subgroups; each sequence subgroup corresponds to a time frequency resource occupation mode, and the time frequency resource occupation modes in the communication system correspond to the sequence subgroups one by one; and the sequence in each subgroup is selected and generated from the candidate sequence set corresponding to the subgroup according to a certain rule. And selecting the sequences in the sequence subgroups corresponding to the time-frequency resource occupation modes of the transmission signals in the distributed sequence groups for transmission or reception by the user or the channel according to the distributed sequence groups and the adopted specific time-frequency resource occupation mode of the transmission signals.

The above-mentioned certain rule is specifically: for any subgroup i, determining a function f corresponding to the subgroup_i(. The function defines the domain as the set of candidate sequences corresponding to the subgroup; wherein the function d (f) is derived from the candidate sequence set_i(·)，G_k) N sequences of the smallest, next smallest, or smaller values of (a) determine the sequence in subgroup i in sequence group k, where i is the sequence number of the subgroup, k is the group number of the sequence group, n is a natural number, d (a, b) is a binary function, G_kIs a quantity determined by the group number k. The rule is to select n sequences from the candidate sequence set such that d (f) of all other sequences_i(·)，G_k) D (f) of all n sequences_i(·)，G_k) Large).

The following Zadoff-Chu sequence a in the CAZAC sequence_r，N(z) illustrates the above sequence assignment rule:

each sequence group consists of M subgroups, wherein the candidate sequence sets of M are respectively N in length₁，N₂，...，N_MThe Zadoff-Chu sequence of (1). Wherein the length is N_iZadoff-Chu sequence of

a_{r_{i}, N_{i}} (z), z = 0,1, . . ., N_{i} - 1

Total N

_i1 different base sequences consisting of_i＝1，2，...，N_i-1 determining. In particular, subgroup i (i.e. of length N)_iCorresponding to a subgroup i) of Zadoff-Chu sequences as

<math> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <msub> <mrow> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>}</mo> </mrow> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow> </math>

This function definition field is the set of candidate sequences corresponding to the subgroup i, where r_iIs an indicator of the Zadoff-Chu sequence in the candidate sequence set, N_iIs the length of the Zadoff-Chu sequence in the candidate sequence set.

For the sequence set

k

1, 2₁As a reference subgroup, define the aforementioned G_kIs composed of

G_{k} = f_{p_{1}} ({a_{c_{k}, N_{p_{1}}} (z)}_{z = 0,1, . . ., N_{1} - 1}) = c_{k} / N_{p_{1}},

Is the length of the reference subgroup sequence, c_kIs determined by the sequence set k

Base sequence index for long sequences. In particular, c can be selected_kWhen k, then G_kIs as follows

G_{k} = f_{p_{1}} ({a_{k, N_{p_{1}}}}) = k / N_{p_{1}} .

If the function d (a, b) is defined as | a-b |, then the index p in the sequence set k is₁In a subgroup of

The smallest sequence is indicated by

r_{p_{1}} = k

Of a length of

Of (2) a

At this time

The sequence of subgroup i ═ m in sequence group k is of length N_mOf (1) satisfyA minimum, next to minimum, or even smaller n sequences, i.e.satisfy

Smaller n ordersColumn, n is a natural number dependent on k and m.

The above embodiments also describe at least one sequence group k, in which the sequences of at least two subgroups i, j are, as above, i ═ m, j ═ p₁A function d (f) from the set of candidate sequences_i(·)，f_j(. DEG)) as above

The minimum, the second minimum, or even smaller n sequences are selected and generated, and n is a natural number depending on k, i and j.

Next, the present embodiment will be described by taking a non-CAZAC sequence as an example. For example, gaussian (Gauss) sequences also have good auto-and cross-correlation properties. The generation formula of the Gauss sequence is as follows:

formula (2)

N in formula (2)^lIs the highest order term of the Gauss sequence, and l is the highest order. When l is 2, α may be taken₂r/N, where N is an integer. When N is 2N₁，α₁＝r(N₁mod 2)/N +2 r/N.p, the Gauss sequence is equivalent to the index r, N₁Zadoff-Chu sequence of

When l > 2, different α_lr/(Nl),

r

1, 2, N-1 corresponds to different groups of Gauss sequences, each group having a plurality of sequences, formed by a low order coefficient α_l-1，α_l-2,.. it was determined that the Gauss sequence is not a CAZAC sequence but has good auto-and cross-correlation properties as well. In the embodiment of the invention with a_r，N(n) represents alpha_lMultiple sequences of r/(lN)

One of the sequences is defined as a base sequence.

For Gauss sequence a_r，N(z) the function corresponding to subgroup i can be defined as

This function definition field is the set of candidate sequences corresponding to the subgroup i, where r_iIs an index of Gauss sequences in the candidate sequence set, N_iIs the length of the Gauss sequences in the set of candidate sequences.

The function d (a, b) corresponding to the Gauss sequence may be d (a, b) ═ i (a-b) modu 1|, where the modu1 operation is defined such that the modulo value belongs to (-1/2, 1/2 ].

In particular, for Zadoff-Chu sequences (corresponding to a specific example of Gauss sequences), when the base sequence index r ═ N-1/2., -1, 0, 1., (N-1)/2, the modu1 operation may not be adopted since | a-b | < 1.

But for a general Gauss sequence, for example, r 1, 3, 5₁-2，N₁+2，...，2N₁-1，N＝2N₁，l＝2，α₂＝r/(2N₁)，α₁＝0，

a_{r, N} {(z)}_{z = - (N_{1} - 1) / 2, . . ., - 1,0,1,2, . . ., (N_{1} - 1) / 2}

The Gauss sequence of (a) needs to adopt d (a, b) ═ i (a-b) modu1 i. Namely alpha₂＝r_i/(2N_i) Corresponding sequences and alpha₂＝r_j/(2N_j) D (f) of the corresponding sequence_i，f_j) Is composed of

d (f_{i}, f_{j}) = | r_{i} / N_{i} - r_{j} / N_{j} \mod u 1 | = | \frac{(r_{i} N_{j} - r_{j} N_{i}) \mod u N_{i} N_{j}}{N_{i} N_{j}} |,

Therein moduN_iN_jThe operation is defined such that the modulo value belongs to (-1/(2N)_iN_j)，1/(2N_iN_j)]. When l is 3, alpha₃＝r_i/(3N_i) Corresponding sequences and alpha₃＝r_j/(3N_j) D (f) of the corresponding sequence_i，f_j) Is d (f)_i，f_j)＝|(r_i/N_i-r_j/N_j) modu 1|, l ═ 4, 5.. similar treatment. Gauss sequence can also have another definition, when alpha is_l＝r_iwhen/N is, use

Representing the corresponding Gauss sequence, the function is f_iIs defined as

<math> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <msub> <mi>a</mi> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow> </math>

The function d (a, b) is defined as d (a, b) | (a-b) modu 1/l | where modu 1/l operates such that-1/(2 l) < (a-b) modu 1/l ≦ 1/(2 l). The definitions of the two Gauss sequences generate the same sequence group。

In another embodiment, the time-frequency resource is occupied by sequence modulation on a radio resource with a subcarrier interval (or time-domain sampling interval) of s, and then the function corresponding to the subgroup with the interval of s is:

<math> <mrow> <msub> <mi>f</mi> <msub> <mi>N</mi> <mi>i</mi> </msub> </msub> <mo>:</mo> <msub> <mrow> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msup> <mi>s</mi> <mn>2</mn> </msup> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>}</mo> </mrow> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow> </math>

where s is the subcarrier (or time domain sample) interval size of the radio resource. For Gauss sequences, the function is

<math> <mrow> <msub> <mi>f</mi> <msub> <mi>N</mi> <mi>i</mi> </msub> </msub> <mo>:</mo> <msub> <mrow> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msup> <mi>s</mi> <mi>l</mi> </msup> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>}</mo> </mrow> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow> </math>

l is the highest order in the Gauss sequence.

The reference subgroup is set according to various factors, and a subgroup of a certain sequence length may be selected as the reference subgroup. Preferably, the subgroup with the smallest sequence length in the system can be selected as the reference subgroup. The number of available sequence sets in the system is the same as the number of sequences at that length, so that shorter sequences do not repeat in different sequence sets. For example, if the shortest sequence length corresponding to the resource occupation method in the system is 11, the method described above

N_{p_{1}} = N_{1} = 11,

At this point, 10 sequence groups are available in the system.

The subgroup with the longest sequence length in the sequence group can also be selected as the reference subgroup. For example, the longest sequence in the sequence group is 37, and a sub-group with a sequence length of 37 is selected as the reference sub-group, in which case

N_{p}

_{1} = N_{2} = 37,

There are 36 sequence sets available. Due to when r is₂Satisfies the formula-1/(2N)₁)＜r₂/N₂＜1/(2N₁) When it is not limited to r₁Is taken as₁＝1，2，...，N ₁1, then | r₂/N₂-r₁/N₁R with minimum |₁Is 0, and in fact r₁Is 0 does not correspond to a Zadoff-Chu sequence, and can therefore be eliminated such that-1/(2N)₁)＜r₂/N₂＜1/(2N₁) R of₂I.e. r needs to be removed₂+1, -1, thus giving a total of 34 sequences. Since the number of the shortest sequences in the sequence group is less than 36, the shortest sequence is used a plurality of times.

The reference subgroup may be a default of the system, or may be set by the system as needed and notified to the user. After a sequence of the reference subgroup j is selected, the sequences within subgroup i are such that d (f)_i(·)，f_j(. -)) the smaller n sequences, and the selected sequence of the reference subgroup j, belong to the same sequence group. Selecting different sequences of the reference subgroup j results in different sequence groups.

The sequence set constituted by the above method is exemplified below.

In this embodiment, there are 3 subgroups, and the sequence candidate sets are Zadoff-Chu sequences with lengths of 11, 23, and 37, respectively, and correspond to three resource occupation manners. Selecting

N_{p_{1}} = N_{1} = 11,

There are a total of 10 sequence groups. Choose 1_m/N_m-r₁/N₁) The sequence with the minimum absolute value is respectively arranged in each sequence group, each subgroup has only one sequence, and the sequence is expressed by the index of the base sequence, so that the method can be obtainedTo the following table:

TABLE 1

N₁＝11 N₂＝23 N₃＝37 N₁＝11 N₂＝23 N₃＝37

Group number k base sequence

Index r₂Index r₃Index r₂Index r₃

1 2 3 6 13 20

2 4 7 7 15 24

3 6 10 8 17 27

4 8 13 9 19 30

5 10 17 10 21 34

The above grouping method is such that

r_{m} / N_{m} - r_{1} / N_{1} = (N_{1} r_{m} - N_{m} r_{1}) / (N_{1} N_{m})

The absolute value is minimum, i.e. is obtained

The absolute value is minimal. By verification, the correlation between the sequences in each sequence group in table 1 was high.

In the above embodiment, the function d (a, b) is defined as d (a, b) ═ a-b |, and in other embodiments, it may be defined as

Infinity in the definition of function d (a, b) may ensure that some sequences are removed.

It is noted that the aforementioned function

Different sequence groups or different subgroups of the same sequence group may be different. For example, one d (a, b) function is used for all subgroups of one sequence group, and another d (a, b) function is used for all subgroups of another sequence group. Or one subgroup may use one d (a, b) function and another subgroup may use another d (a, b) function.

Specifically, u and v in the function take different values, so that different metric functions are obtained. For example, u ═ 0, v ═ infinity, or u ═ infinity, v ═ 0, or u ═ 1/(2 × 11) +1/(23 × 4), v ═ 1/(2 × 11) -1/(23 × 4), or u ═ a, v ═ b, a, b are determined by the sequence group k and the subgroup i, and so on.

In particular to

<math> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <msub> <mrow> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>}</mo> </mrow> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </math>

In the above-mentioned embodiment, when

In this embodiment, the following is true: is selected so that

Are respectively grouped into each sequence group, and the | r is satisfied between any two sequences in different sequence groups_i/N_i-r_j/N_j|＞1/C_iIn which N is_i＜N_j. This is described in detail below:

first, u ═ 0, v ═ infinity, or u ═ infinity, v ═ 0, is a sequence that minimizes a single direction. Choosing the positive direction, being equivalent to taking

<math> <mrow> <mrow> <mo>(</mo> <msub> <mi>r</mi> <mi>m</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>m</mi> </msub> <mo>-</mo> <mi>k</mi> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>)</mo> </mrow> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow> </math>

Minimum sequence, selecting the equivalent of the negative direction

<math> <mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <msub> <mi>r</mi> <mi>m</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow> </math>

The smallest sequence. For example, at a required length of N_mThen, calculate and

the minimum positive and negative result is r with a difference of 0.036_mAnd the difference is r 'of-0.025'_mOf course, and a length ofOf (2) a

r_{p_{1}} = k

The most strongly correlated is r'_mBut if the system dictates the choice

(r_{m} / N_{m} - k / N_{p_{1}})

In the forward direction, r is selected_mIt is used. The beneficial effects are that the sequences with various lengths are

The sequences obtained after comparison, their functions being the difference | r between two_i/N_i-r_j/N_jLess.

Second, it can also select

u = - 1 / (2 N_{p_{1}}) + 1 / (4 N_{p_{2}}),

v = 1 / (2 N_{p_{1}}) - 1 / (4 N_{p_{2}}),

WhereinIs the length of the sequence of the shortest sequence,

is only greater than

The length of the sequence of (c). The following is a practical example:

in this embodiment, there are 4 subgroups, and the sequence candidate sets are N respectively₁＝11，N₂＝23，N₃＝37，N₄A Zadoff-Chu sequence of 47, chosen such that | r_i/N_i-k/N₁|＜1/(2N₁)-1/(4N₂) I.e. | r_i/N_i-k/N₁The assignment of i < 1/(2 × 11) -1/(4 × 23) sequences to subgroups in each sequence group will result in the following table, where the sequences are represented by indices of the base sequence:

TABLE 2

N₁＝11 N₂＝23 N₃＝37 N₄＝47

Group number k base sequence index r₂Base sequence index r₃Base sequence index r₄

1 2 3、4 3、4、5

2 4 6、7、8 7、8、9、10

3 6、7 9、10、11 12、13、14

4 8、9 13、14 16、17、18

5 10、11 16、17、18 20、21、22

6 12、13 19、20、21 25、26、27

7 14、15 23、24 29、30、31

8 16、17 26、27、28 33、34、35

9 19 29、30、31 37、38、39、40

10 21 33、34 42、43、44

| r is satisfied between any two sequences among different sequence groups in Table 2_i/N_i-r_j/N_j|＞1/(2N_i) In which N is_i＜N_jThe correlation between both such sequences is low.

Third, the sequence set k may be different from the subgroup i, u, v of the same sequence set.

By using

Indicates the length of the sequence of the shortest sequence,

indicates the length of the longest sequence, the length being

The index of (1) is the number q of the sequence group in which the base sequence is located₁Length of

Is indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

The index of (1) is the number q of the sequence group in which the base sequence of k is located_kLength of

Index of (2) is number q of sequence group in which base sequence of k +1 is located_k+1Length ofIs numbered p₁Length of

Is numbered p_mLength ofIs numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}} .

Step 1001, sequence group q₁Subgroup p of₁，

Wherein

For sequence groups

Subgroup p of₁，

Wherein

Sequence group q_kSubgroup p of₁Is/are as follows

And sequence set q_k+1Subgroup p of₁Is/are as follows

k＝1，Λ，

Respectively as follows:

v_{q_{k}, p_{1}} = 1 / D,

u_{q_{k + 1}, p_{1}} = - 1 / D,

wherein

Step 1002, referring to FIG. 4, sequence group q_kSubgroup p of_iIs/are as follows

And sequence set q_k+1Subgroup p of_iIs/are as follows

k＝1，Λ，i belongs to S and is respectively as follows:

{right}_{q_{k}, p_{i - 1}} = v_{q_{k}, p_{i - 1}} + k / N_{p_{1}},

{left}_{q_{k + 1}, p_{i - 1}} = u_{q_{k + 1}, p_{i - 1}} + (k + 1) / N_{p_{1}}

for the sequence length of

A base sequence of (A) according toAre taken to be different values such that

<math> <mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow> </math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}} |

When taking the minimum value

Namely, the sequence group q is obtained_k+1Of length ofClosest sequence group q_k+1Left boundary

Base sequence of (1)

When in use

<math> <mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow> </math>

When is at time

r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}}

Less than sequence group q_kRight boundary of (1)

To ensure the sequence group q_kGroup q of sequences adjacent thereto_k+1The low cross-correlation between the two,

v_{q_{k}, p_{i}} = v_{q_{k}, p_{i - 1}} + r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - {right}_{q_{k}, p_{i - 1}};

when in use

r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - {right}_{q_{k}, p_{i - 1}} > 0

When is at time

r_{q_{k + 1,} p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}}

Greater than sequence group q_kRight boundary of (1)

v_{q_{k}, p_{i}} = v_{q_{k}, p_{i - 1}};

For the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

<math> <mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow> </math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{k}, p_{i - 1}} |

When taking the minimum value

Namely, the sequence group q is obtained_kOf length ofClosest sequence group q_kRight border

Base sequence of (1)

When in use

<math> <mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>+</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow> </math>

When is at time

r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + / C_{p_{i - 1}}

Greater than sequence group q_k+1Left boundary of (1)

u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}} + r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}};

when in use

r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}} < 0

When is at time

r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}}

Less than sequence group q_k+1Left boundary of (1)

u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}} .

Sequence group

Subgroup p of_iIs/are as followsAnd sequence set q₁Subgroup p of_iIs/are as followsi belongs to S and is respectively as follows:

{right}_{q_{N_{p_{1}} - 1}, p_{i - 1}} = v_{q_{N_{p_{1}} - 1}, p_{i - 1}} + (N_{p_{1}} - 1) / N_{p_{1}},

{left}_{q_{1}, p_{i - 1}} = u_{q_{1}, p_{i - 1}} + 1 / N_{p_{1}}

<math> <mrow> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>=</mo> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>,</mo> </mrow> </math>

for the sequence length ofA base sequence of (A) according to

Are taken to be different values such that

<math> <mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow> </math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {left}_{q_{1}, p_{i - 1}} |

When taking the minimum value

When in use

<math> <mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>≤</mo> <mn>0</mn> </mrow> </math>

When the temperature of the water is higher than the set temperature,

<math> <mrow> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mi>i</mi> </msub> </mrow> </msub> <mo>=</mo> <msub> <mrow> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>+</mo> </mrow> </msub> <mi>r</mi> </mrow> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>;</mo> </mrow> </math>

when in use

<math> <mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo></mo> <mo>></mo> <mn>0</mn> </mrow> </math>

When the temperature of the water is higher than the set temperature,

v_{q_{N_{p_{1}} - 1}, p_{i}} = v_{q_{N_{p_{1}} - 1}, p_{i - 1}};

for the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

<math> <mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow> </math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{N_{p_{1}} - 1}, p_{i - 1}} |

When taking the minimum value

When in use

<math> <mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>+</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow> </math>

When the temperature of the water is higher than the set temperature,

when in use

When the temperature of the water is higher than the set temperature,

u_{q_{1}, p_{i}} = u_{q_{1}, p_{i - 1}};

in particular, can be taken

C_{p_{i - 1}} = 2 N_{p_{i - 1}} .

Step 1003, sequence group q_kSubgroup p of_iIs/are as follows

And

k＝1，Λ，

i belongs to I-S and is respectively as follows:

u_{q_{k}, p_{i}} = u_{q_{k}, p_{m}},

v_{q_{k}, p_{i}} = v_{q_{k}, p_{m}},

i and S are two sets of indexes, where the set I ═ { 2., l }, l is the number of sequence lengths in the candidate sequence set, the set S is the set I or a subset of the set I, and m is the element with the largest value in the set S.

In the following example, take δ_u＝0，δ_v＝0，

D = 2 N_{p_{1}},

C_{p_{i - 1}} = 2 N_{p_{i - 1}},

q_k＝k，p_i＝i。

Example one

In this embodiment, there are 4 subgroups, and the sequence candidate sets are N respectively₁＝11，N₂＝23，N₃＝37，N₄When the Zadoff-Chu sequence of 47 is taken as an example of the fourth sequence set, that is, when k is 4, step 1101 obtains v_4，iAnd u_5，ii belongs to {1, 2, 3, 4}, specifically:

for subgroup 1, v_4，1＝1/(2×11)，u_5，1＝-1/(2×11)。

For subgroup 2, right_4，1＝v_4，1+4/11＝1/(2×11)+4/11，left_5，1＝u_5，1+5/11 ═ 1/(2 × 11) + 5/11; r not satisfying the condition_5，1And r_4，1Thus v is_4，2＝v_4，1I.e. v_4，2＝1/(2×11)；u_5，2＝u_5，1I.e. u_5，2＝-1/(2×11)。

For subgroup 3, right_4，2＝v_4，2+4/11＝1/(2×11)+4/11，left_5，2＝u_5，2+5/11＝-1/(2×11)+5/11；

To N₂23, change r₂Obtaining when r_5，2When the value is 10 r_5，2/N₂-left_5，2> 0 and | r_5，2/N₂-left_5，2L takes the minimum value, since r_5，2/N₂-1/2(N₂)-right_4，2> 0, so v_4，3＝v_4，2I.e. v_4，3＝1/(2×11)；

To N₂23, change r₂Obtaining when r_4，2When the value is 9 r_4，2/N₂-right_4，2< 0 and | r_4，2/N₂-right_4，2L takes the minimum value, since r_4，2/N₂+1/(2N₂)-left_5，2> 0, so u_5，3＝u_5，2+r_4，2/N₂+1/(2N₂)-left_5，2＝-1/(2×11)+9/23+1/(2×23)-(-1/(2×11)+5/11)＝-21/(2×11×23)。

For subgroup 4, right_4，3＝v_4，3+4/11＝1/(2×11)+4/11，left_5，3＝u_5，3+5/11＝-21/(2×11×23)+5/11；

To N₃Change r of 37₃Obtaining when r_5，3When the value is 16 r_5，3/N₃-left_5，3> 0 and | r_5，3/N₃-left_5，3L takes the minimum value, since r_5，3/N₃-1/(2N₃)-right_4，3> 0, so v_4，4＝v_4，3I.e. v_4，4＝1/(2×11)；

To N₃Change r of 37₃Obtaining when r_4,3When the value is 15 r_4，3/N₃-right_4，3< 0 and | r_4，3/N₃-right_4，3L takes the minimum value, since r_4，3/N₃+1/(2N₃)-left_5，3> 0 so u_5，4＝u_5，3+r_4，3/N₃+1/(2N₃)-left_5，3＝-21/(2×11×23)+15/37+1/(2×37)-(-21/(2×11×23)+5/11)＝-29/(2×11×37)。

By analogy, u, v for all subgroups of the ordered group of groups are obtained, giving the following table:

TABLE 3

Step 1102, select u_k，i≤(r_i/N_i-k/N₁)≤v_k，iThe sequences are grouped in subgroup i of group k of sequences, which are represented by indices of the base sequence, the following table will be obtained:

TABLE 4

N₁＝11 N₂＝23 N₃＝37 N₄＝47

1 2、3 2、3、4、5 3、4、5、6

2 4、5 6、7、8 8、9、10

3 6、7 9、10、11 12、13、14

4 8、9 13、14、15 16、17、18、19

5 10、11 16、17、18 20、21、22、23

6 12、13 19、20、21 24、25、26、27

7 14、15 22、23、24 28、29、30、31

8 16、17 26、27、28 33、34、35

9 18、19 29、30、31 37、38、39

10 20、21 32、33、34、35 41、42、43、44

Example two

When the number of subgroups in the sequence group is more, the calculation of u and v is found, and after a certain subgroup is calculated, u and v of other subgroups with longer sequences are not changed. Specifically, for a system bandwidth of 5M, N₁＝11，N₂＝23，N₃＝37，N₄＝47，N₅＝59，N₆＝71，N₇＝97，N₈＝107，N₉＝113，N₁₀＝139，N₁₁＝179，N₁₂＝191，N₁₃＝211，N₁₄＝239，N₁₅＝283，N₁₆293. Take the fourth sequence group as an example, i.e. k is 4, v_4，iAnd u_5，ii ∈ {1, 2, 3.., 16} is obtained as follows:

for subgroup 1, v_4，1＝1/(2×11)，u_5，1＝-1/(2×11)。

To N₂23, changer₂Obtaining when r_5，2When the value is 10 r_5，2/N₂-left_5，2> 0 and | r_5，2/N₂-left_5，2L takes the minimum value, since r_5，2/N₂-1/2(N₂)-right_4，2> 0, so v_4，3＝v_4，2I.e. v_4，3＝1/(2×11)；

To N₂23, change r₂Obtaining when r_4，2When the value is 9 r_4，2/N₂-right_4，2< 0 and | r_4，2/N₂-right_4，2L takes the minimum value, since r_4，2/N₂+1/(2N₂)-left_5，2> 0, so u_5，3＝u_5,2+r_4，2/N₂+1/(2N₂)-left_5，2＝-1/(2×11)+9/23+1/(2×23)-(-1/(2×11)+5/11)＝-21/(2×11×23)。

For subgroup 4, right_4，3＝v_4，3+4/11＝1/(2×11)+4/11，left_5，3＝u_5,3+5/11＝-21/(2×11×23)+5/11；

To N₃Change r of 37₃Obtaining when r_4，3When the value is 15 r_4，3/N₃-right_4,3< 0 and | r_4，3/N₃-right_4，3L takes the minimum value, since r_4，3/N₃+1/(2N₃)-left_5，3> 0 so u_5，4＝u_5，3+r_4，3/N₃+1/(2N₃)-left_5，3＝-21/(2×11×23)+15/37+1/(2×37)-(-21/(2×11×23)+5/11)＝-29/(2×11×37)。

For subgroup 5, v_4，5＝v_4，4I.e. v_4,5＝1/(2×11)；u_5，5＝u_5，4I.e. u_5，5＝-29/(2×11×37)。

For subgroup 6, v_4，6＝v_4，5I.e. v_4，6＝1/(2×11)；u_5，6＝u_5，5I.e. u_5，6＝-29/(2×11×37)。

For subgroup 7, v_4，7＝v_4，6I.e. v_4，7＝1/(2×11)；u_5，7＝u_5，6I.e. u_5，7＝-29/(2×11×37)。

Further calculations found that for sub-groups 8, 9, 10.

By analogy, u, v of all subgroups of other sequence groups can be obtained. V is obtained by calculation for any subgroup i of the sequence group five_5，i1/(2 × 11), in combination with u calculated as described above_5，iIs selected so that u_5，i≤(r_i/N_i-5/N₁)≤v_5，iThe sequences are grouped in subgroup i of the fifth sequence group, the sequences are represented by indices of the base sequences, and the following table will be obtained:

TABLE 5

N₁Group number k 5 ═ 11

N₂Base sequence index r of 23₂ 10、11

N₃Base sequence index r of 37₃ 16、17、18

N₄Base sequence index r of 47₄ 20、21、22、23

N₅Base sequence index r of 59₅ 25、26、27、28、29

N₆Base sequence index r of 71₆ 30、31、32、33、34、35

N₇Base sequence index r ═ 97₇ 41、42、43、44、45、46、47、48

N₈Base sequence index r of 107₈ 45、46、47、48、49、50、51、52、53

N₉Base sequence index r of 113₉ 48、49、50、51、52、53、54、55、56

N₁₀Base sequence index r of 139₁₀ 59、60、61、62、63、64、65、66、67、68、69

N₁₁Base sequence index r of 179₁₁ 75、76、77、78、79、80、81、82、83、84、85、

86、87、88、89

N₁₂Base sequence index r of 191₁₂ 81、82、83、84、85、86、87、88、89、90、91、

92、93、94、95

N₁₃Base sequence index r of 211₁₃ 89、90、91、92、93、94、95、96、97、98、99、

100、101、102、103、104、105

N₁₄Base sequence index r of 239₁₄ 101、102、103、104、105、106、107、108、109、

110、111、112、113、114、115、116、117、118、

119

N₁₅283 base sequence index r₁₅ 119、120、121、123、124、125、126、127、128、

129、130、131、132、133、134、135、136、137、

138、139、140、141

N₁₆Base sequence index r of 293₁₆ 123、124、125、126、127、128、129、130、131、

132、133、134、135、136、137、138、139、140、

141、142、143、144、145、146

According to the above u_k，i，v_k，iThe calculation of (2) found that only N is calculated₄47, i.e., S ═ {2, 3, 4}, and is calculated to N₁₆293, i.e., S ═ I ═ 2, 3.., 16}, the same u can be determined_k，i，v_k，i. It is therefore possible to calculate only up to the fourth subgroup, i.e. using S ═ {2, 3, 4}, and obtain u, v for all subgroups of the ordered set, to reduce the amount of calculation.

The actual u, v used can quantify the results obtained according to the above algorithm to achieve the required accuracy.

In the above embodiment, the n sequences are selected, specifically, there are the following two cases:

preferably, n is 1, that is, in the above example, (r) is selected_m/N_m-k/N₁) The smallest one belongs to subgroup m.

Preferably, N is a natural number greater than 1, the value of N being according to subgroup N_mAnd a reference subgroup N₁Is determined.That is, (r)_m/N_m-k/N₁) Minimum r_mThe sequences corresponding to a plurality of nearby base sequence indexes are grouped into a subgroup, and the minimum r is generally_mThe nearest N in the vicinity, and the particular N is selected by considering N₁，N_mThe length of (c) is different. For example, when N is_mIs N₁About 4 times of the total number of the cells, 2r can be selected_mFall into this group. In general, it is optional

And for example can select

Wherein

Denotes the largest integer not greater than z. In this case, there may be more than one sequence of a certain length in the sequence subgroup. After the system has been so allocated, the user, when using the sequences, can select any of the n sequences allocated for transmission, for example such that (r)_m/N_m-k/N₁) A minimum, a next-to-minimum.

Preferably, n may be a quantity determined by the sequence set k and the sub-set i. For example, n ≦ Q, where Q is satisfied

The number of the sequences of (a) and (b),

is the length of the reference subgroup sequence, c_kIs determined by the sequence set kBase sequence index for long sequences. Wherein u_k，i＝-1/(2N₁)，v_k，i＝1/(2N₁) Or u is_k，i＝-1/(2N₁)+1/(4N₂)，v_k，i＝1/(2N₁)-1/(4N₂) Or u is_k，i＝-1/2^θ，v_k，i＝1/2^θAnd theta is an integer, etc. When u is_k，iAnd v_k，iRelatively small, e.g. u_k，i＝-1/(2N₁)+1/(4N₂)，v_k，i＝1/(2N₁)-1/(4N₂) It can be ensured that the correlation between any two sequences between different groups of sequences is low.

In a specific implementation, | r is sought_m/N_m-k/N₁R of_mThe index can be generalized to a general method. I.e. the known integer N₁，N₂E, integer f is required to make | e/N₁-f/N₂F with the smallest value, | obviously being the sum e.N₂/N₁The nearest integer w is the lower rounding

Or get the whole from aboveA fewer n are w ± 1, w ± 2. The transmitter and receiver may be computed from this method rather than stored.

Because the correlation of two sequences with different Zadoff-Chu sequences is strong, | r_m/N_m-r₁/N₁L must be smaller. In the above allocation method, | r between two sub-group i, j sequences of different groups is guaranteed_i/N_i-r_j/N_jThe value of | is certain to be larger, so that the correlation of sequences among different groups is lower and the interference is small. Further, for some length sequences, we can choose a part of them to allocate, and other sequences are not used in the system, so that the sequence which is next strongly related to the sequence of the reference subgroup can be avoided from appearing in other sequence groups, thereby reducing strong interference.

In the above specific implementation of the allocation of each sequence group, the sequence group may be generated for a sequence corresponding to a part of time-frequency resource occupation manners in the system, that is, not all the sequences may be generated. For example, the time-frequency resource occupation mode may be divided into a plurality of levels according to the length of the sequence, each level includes sequences within a certain length range, and the sequence group is generated and allocated for each level of the sequences.

In the above specific implementation of assigning each sequence group, specifically, a dynamic assignment manner may be adopted, that is, a sequence used is changed with time and other variables; a static allocation may also be used, i.e. the sequence used is not changed. Specifically, the static allocation method may be used alone, or the dynamic allocation method may be used alone, or both the dynamic and static allocation methods may be used. This is described in detail below:

preferably, when the sequence occupies less radio resources, a dynamic sequence group allocation method can be adopted. Since the length of the sequence is smaller in this case, the number of sequence groups is smaller. For example, in the embodiment of the Zadoff-Chu sequence, the number r of a reference sequence group is randomly selected at the time of transmitting the pilot frequency in a pseudo-random manner₁Then, the index r of the sequence in the subgroup with the required length belonging to the same sequence group is calculated according to the rule_kThe sequence of (a).

Preferably, when the sequence occupies more radio resources, a static allocation mode can be adopted. For example, in the above embodiment taking Zadoff-Chu sequences as an example, if the number N of sequence groups is sufficient to meet the requirement, then N sequence groups are allocated to each cell for use, and the requirement of inter-cell interference averaging can be met without changing over time. Preferably, the system may divide the occupied radio resources into two levels, one level is a sequence of a large number of occupied radio resources, different sequence groups are statically allocated, and the other level is a sequence of a small number of occupied radio resources, and the sequence groups are allocated in a dynamic pseudo-random manner. For example, sequences occupying more than 144 subcarriers, generally sequences with a sequence length of 144 or more, are statically allocated different sequence groups; the sequence in each sequence group corresponds to a radio resource smaller than 144 subcarriers, and the sequence group is allocated in a dynamic pseudo-random manner, wherein the sequence length is usually smaller than 144.

When there are multiple sequences in a subgroup, the sequences including the base sequence and different time cyclic shifts may be allocated to different cells, for example, different sectors under a base station, in addition to being allocated to different users. In particular, when a cell needs more sequences, for example, when supporting multi-antenna transmission, each antenna needs a different sequence, the minimum length of the used sequences can be limited to increase the number of base sequences in the subgroup, so that more base sequences in the subgroup or cyclic shifts of the base sequences can be allocated to the cell. Further, when there are multiple sequences in a subset of the sequence groups, the sequence groups may be further grouped and assigned to different cells/users/channels.

The above sequence is not limited to the Zadoff-Chu sequence, but can also be applied to Gauss sequence, other CAZAC sequence, base sequence and/or delay sequence of CAZAC sequence.

Detailed description of the invention

In accordance with the method for allocating sequence groups to cells according to a certain rule by the network, a communication sequence transmitting method is described below, with reference to fig. 3, and the specific process is as follows:

step 201 receives a group number k of a sequence group assigned by the system.

Step 202 selects from the set of candidate sequences such that the function d (f) is_i(·)，G_k) N sequences of the smallest, next smallest, or even smaller values of (a) constitute sequences in subgroup i in sequence group k, where n is a natural number, where i is the subgroup number, d (a, b) is a binary function, and G_kIs a quantity, function f, determined by the group number k_i(. h) a function for a systematically determined subgroup i, this function defining a set of said candidate sequences for this subgroup i.

Step 203 generates a corresponding transmission sequence according to the sequence of the formed subgroup i, and transmits the transmission sequence on a corresponding time-frequency resource.

The above sequence is not limited to the Zadoff-Chu sequence, but can also be applied to Gauss sequence, other CAZAC sequence, base sequence and/or delay sequence of CAZAC sequence. The transmission mode of the sequence can be frequency domain transmission or time domain transmission. The functions in the method may be specifically consistent with those in the allocation method, and are not described herein again.

In the implementation method, after the resources occupied by the sequences are determined, the sequences of the subgroups corresponding to the resources of the current group can be generated in real time according to rules without storage, and the implementation is simple.

Those skilled in the art will appreciate that all or part of the steps in the method according to the above embodiments may be implemented by hardware related to instructions of a program, where the program may be stored in a computer-readable storage medium, and when the program is executed, the program includes steps corresponding to the steps 201 to 203, and the storage medium, such as: ROM/RAM, magnetic disk, optical disk, etc.

Detailed description of the invention

The following provides a transmitting apparatus applying the above sequence transmitting method, and referring to fig. 5, the apparatus includes:

a sequence selection unit: the group number k of the sequence group assigned by the receiving system is selected from the candidate sequence set so that the function d (f)_i(·)，G_k) N sequences of the smallest, second smallest, or even smaller values of (a) constitute sequences in subgroup i in sequence group k, where i is the serial number of the subgroup, n is a natural number, where d (a, b) is a binary function, k is the group number of the sequence group, G_kIs a quantity, function f, determined by the group number k_i(. h) a function for a systematically determined subgroup i, this function defining a set of said candidate sequences for this subgroup i.

A sequence transmitting unit: and the transmitter is used for selecting or generating a corresponding transmitting sequence according to the sequence of the formed subgroup i and transmitting on a corresponding time frequency resource.

The relevant functions in the apparatus may be the same as those discussed in the foregoing allocation method, and are not described in detail here. The above sequence is not limited to the Zadoff-Chu sequence, but can also be applied to Gauss sequence, other CAZAC sequence, base sequence and/or delay sequence of CAZAC sequence. The transmission mode of the sequence can be frequency domain transmission or time domain transmission.

Detailed description of the invention

In accordance with the method for allocating sequence groups to cells according to a certain rule by the network, a communication sequence receiving method is described below, with reference to fig. 6, as follows:

in step 401, the reception apparatus receives a group number k of a sequence group assigned by the system.

Step 402 selects from the set of candidate sequences such that the function d (f) is_i(·)，G_k) In a value ofThe smallest, next smallest, or even smaller n sequences form the sequences in subgroup i in sequence group k, where n is a natural number dependent on i, where i is the subgroup number, d (a, b) is a binary function, G_kIs a quantity, function f, determined by the group number k_i(. h) a function for a systematically determined subgroup i, this function defining a set of said candidate sequences for this subgroup i.

Step 403 generates a corresponding sequence according to the sequence of the subgroup i and receives the sequence on a corresponding time-frequency resource. The processing of the reception generally comprises a correlation of the generated sequence and the received signal.

In the implementation method, after the resources occupied by the sequences are determined, the sequences of the subgroups corresponding to the resources of the current group can be generated in real time according to the rules without storing the corresponding relationship between the resources and the sequences of the subgroups, and the implementation is simple.

Those skilled in the art will appreciate that all or part of the steps in the method according to the above embodiments may be implemented by hardware related to instructions of a program, where the program may be stored in a computer-readable storage medium, and when the program is executed, the program includes steps corresponding to the steps 401 to 403 described above, and the storage medium includes, for example: ROM/RAM, magnetic disk, optical disk, etc.

Detailed description of the invention

There is provided a receiving apparatus using the above sequence receiving method, referring to fig. 7, the apparatus comprising

A sequence selection unit: a group number k for the receiving apparatus to receive the systematically assigned sequence group; by the order of candidatesSelecting in the column set such that function d (f)_i(·)，G_k) N sequences of the smallest, next smallest, or even smaller values of (a) constitute sequences in subgroup i in sequence group k, where n is a natural number, where i is the subgroup number, d (a, b) is a binary function, and G_kIs a quantity, function f, determined by the group number k_iSmall (-) is the function for the subgroup i determined by the system, and this function defines the set of candidate sequences for the subgroup i.

A sequence receiving unit: and generating a corresponding sequence according to the formed sequence of the subgroup i and receiving the corresponding sequence on a corresponding time frequency resource. The processing of the reception generally comprises a correlation of the generated sequence and the received signal.

Generally, the above-mentioned receiving operation is specifically a correlation operation or the like to obtain a channel estimation value or to obtain time synchronization. The above sequence is not limited to the Zadoff-Chu sequence, but can also be applied to Gauss sequence or other CAZAC sequence, base sequence and \ or delay sequence of CAZAC sequence. The transmission mode of the sequence can be frequency domain transmission or time domain transmission. The functions in the apparatus may be specifically consistent with those in the allocation method, and are not described herein again.

Detailed description of the invention

Unlike the sequence assignment method of the first group of embodiments, the present embodiment groups cyclic shift sequences of one or more base sequences.

When allocating sequences, generally, one sequence group includes a plurality of cyclic shift sequences of a plurality of base sequences, and the cyclic shift sequences may be obtained by cyclically shifting the base sequences in time or frequency. In this case, when different cyclic shift sequences need to be allocated to different cells (e.g. multiple sectors of a base station) or different users/channels of a cell, the cyclic shift signals of the base sequences need to be further grouped, so that different cyclic shift sequences of the same base sequence belong to different groups, and any two sequences in different groups are approximately orthogonal, thereby reducing interference between cells/users/channels.

The allocation method of the present embodiment specifically includes:

the sequences in each sequence group are divided into a plurality of subgroups, each subgroup corresponds to a time-frequency resource occupation mode (for example, occupies different numbers of subcarriers or occupies different positions of frequency resources), the sequence groups are allocated to the cells, the sequences in each subgroup are selected from a candidate sequence set corresponding to the subgroup, and the selecting method specifically comprises the following steps: at least one sequence group k, wherein the sequences of at least two subgroups i, j are selected from the candidate sequence set such that the function d (f)_i(·)，f_j(. DEG)) values of the smallest, next smallest, and up to smaller n sequences are selected, where i, j is the sequence number of the subgroup, n is a natural number, d (a, b) is a binary function, and f is a function_m(. cndot.) is a function corresponding to the subgroup m, and the definition domain of the function is the set of candidate sequences corresponding to the subgroup m.

The details will be described below by taking the example of the Zadoff-Chu sequence. It is noted that the present scheme is also applicable to Gauss sequences.

In practice, there are many cases of the occupied ways of the time-frequency resources by the transmitted sequences, and in order to explain the scheme of the present invention in detail, the following will first explain the occupied ways of different time-frequency resources by way of example.

Taking the situation shown in fig. 9 as an example, the time-frequency resource occupation manner is as follows: the sequences are mapped on the frequency resources in the center from left to right, the short sequences and the long sequences both occupy the subcarriers positioned in the center, and the occupation mode is simply summarized as a mode of occupation of the time-frequency resources in central symmetry. In the mode a in the figure, a sequence occupies one resource Block (RB, resource Block for short), for example, when 1RB correspondingly includes 12 subcarriers, a Zadoff-Chu sequence with a length of 11 is correspondingly used; in the B mode of the figure, when the sequence occupies 2 RBs, i.e. occupies 24 subcarriers, a Zadoff-Chu sequence with a length of 23 is correspondingly adopted.

Taking the case shown in fig. 8 as an example, the 12 subcarriers occupying one RB may be 12 subcarriers occupying the low frequency shown in the light gray portion on the left side of fig. 8 (hereinafter, referred to as the occupying mode of the left RB), or may be 12 subcarriers occupying the high frequency shown in the dark gray portion on the right side of fig. 8 (hereinafter, referred to as the occupying mode of the right RB).

When the length is N_iThe base sequence index is r_iFor a centrally symmetric resource occupancy pattern, the function f is_m(. cndot.) is specifically f in this embodiment_i(x)＝((2·x·r_i)modN_i)/N_iWhere x is a cyclic shift index, and represents a shifted sequence obtained by cyclically shifting a base sequence by an amount x corresponding to a sequence with a cyclic shift amount x, the cyclic shift index x and the sequence with the cyclic shift x are in one-to-one correspondence. That is, when the cyclic shift index x is determined, a sequence corresponding to the cyclic shift amount x is determined. The candidate sequence set is a cyclically shifted sequence generated by the base sequence. The following describes a sequence allocation method specifically for the case where the above-mentioned sequences occupy different frequency resource manners. When the sequence is modulated in the frequency domain, the index of cyclic shift in the function is in the frequency domain and the transform domain is in the time domain. When the sequence is modulated in the time domain, the index of cyclic shift in the function is in the time domain and the transform domain is in the frequency domain. The following description will be given taking sequence modulation in the frequency domain as an example.

In the first case: referring to fig. 9, the case of the centrosymmetric resource occupation mode, in this case, the distance F with respect to the centrosymmetric resource occupation mode_iIs 0 (subcarrier). Thus, the function f_iSpecifically ((2. Offset)_i·r_i)modN_i)/N_iOf Offset therein_iNamely the cyclic shift index of the frequency domain; when r is_i，r_jIs different, d (f) is selected from the candidate sequence sets of the two subgroups i, j_i，f_j) The smallest sequences are grouped in the same sequence group, and the function d (a, b) is specifically

For example, for a length of N₁And N₂The criterion for determining the sequences in a group is such that | ((2 · Offset)₁·r₁)mod N₁)/N₁-((2·Offset₂·r₂)mod N₂)/N₂And | is minimal. Wherein Offset₁Is of length N in the resource occupying mode of FIG. 9₁The base sequence index is r₁Of the sequence of (1), Offset₂Is of length N in the resource occupying mode of FIG. 9₂The base sequence index is r₂The frequency domain cyclic shift index of the sequence of (1). Obviously, Offset₁＝Offset₂0 is such that | ((2 · Offset)₁·r₁)mod N₁)/N₁-((2·Offset₂·r₂)mod N₂)/N₂And | is minimum, zero.

Generally, when r is₁，r₂When parity is the same, i.e. both are odd, or both are even, it is chosen such that | ((2 · (Offset)₁·r₁)mod N₁)/N₁-((2·(Offset₂·r₂)mod N₂)/N₂Cyclic shift amount Offset with minimum value of | zero₁，Offset₂. When r is₁，r₂Parity is different, chosen such that | ((2 · (Offset)₁)·r₁)mod N₁)/N₁-((2·(Offset₂)·r₂)mod N₂)/N₂| is the smallest cyclic shift amount Offset among non-zero values₁，Offset₂. This is because, when the parity is the same, two Zadoff-Chu sequences of different lengths are strongly correlated in the frequency domain without any shift, and when the parity is different, the shift is performed in the frequency domain.

When the index r of the base sequence of the same group₁，r₂Satisfy certain characteristics, e.g. | r₁N₁-R₂N₁|＞N₁N₂/2，r₁，r₂When parity is the same, the adopted cyclic shift amount satisfies the minimum value of the function reaching nonzero, when parity is different, Offset is adopted₁＝Offset₂0, e.g. r₁＝1，r₂＝5，N₁＝11，N₂23 and r₁＝2，r₂＝7，N₁＝11，N₂When it is 23. Can restrict adoption in the system such that | r₁N₂-r₂N₁|＜N₁N₂Those base sequence indices of/2.

Where the index of the base sequence has a value in the range r_i＝1，2，...，N_i-1, or r_i＝-(N_i-1)/2，...，-1，0，1，...，(N_i-1)/2。

When the index of the base sequence is arbitrarily taken as r_i+nN_iN is one of 0, ± 1, ± 2, and the function d (a, b) isWherein modu1 operates such that-1/2 < a-b ≦ 1/2.

Make | ((2 · (Offset) by₁)·r₁)mod N₁)/N₁-((2·(Offset₂)·r₂)mod N₂)/N₂Minimum Offset in | non-zero values₁，Offset₂By comparison, i.e. calculating different offsets₁，Offset₂A value of (c), which makes | ((2 · (Offset)₁)·r₁)mod N₁)/N₁-((2·(Offset₂)·r₂)mod N₂)/N₂The smallest non-zero value is obtained. Utilizing, fixing an Offset₁Offset to minimize non-zero values₂Can be obtained by simple calculation. Specifically, three integers N are known₁，N₂E, such that | e/N₁-f/N₂The integer f with the smallest | value is the sum e.N₂/N₁The nearest integer being lower rounding

Or get the whole from above

The transmitter and receiver may be computed from this method rather than stored.

The above rule can be differentiated into the following steps:

0601) is determined such that (a mod N)₁)/N₁-(b mod N₂)/N₂The smallest a, b:

0602) according to Offset₁-F₁＝a/2/r₁ mod N₁，Offset₂-F₂＝b/2/r₂mod N₂Determining Offset₁，Offset₂Wherein the operation of (-) is performed in the reduced residual system when N is₁，N₂In reciprocal prime, the non-zero minimum is 1/(N)₁N₂)。

Function f as described above_m(. specifically) is f_i(x)＝((2·(x-F_i)·r_i)mod N_i)/N_iIn N₁，N₂In reciprocal terms, step 0601 is calculated using the first-order number theory as follows. The specific process is as follows: obtaining m, N by rolling phase division method, so that m.N₂+nN ₁1, then a equals m mod N₁，b＝-n₂ mod N₂。

As a practical example, in FIG. 9, assume that the sequence occupying 1RB is of length N ₁11, base sequence index r ₁6; sequence occupying 2 RBs is of length N₂23, base sequence index r₂13. Then, according to step 0601, using the rolling phase division, a is 10 and b is 21, so that (a mod N)₁)·N₂-(b mod N₂)·N ₁1. Then according to step 0602, 10/2/6mod11 is calculated to be 10, 14/2/13mod23 is calculated to be 7, and thus Offset₁＝10，Offset₂7. That is, in the resource occupation scheme with central symmetry, the cyclic shift amounts of a sequence with length 11 and base sequence index 6 and a sequence with length 23 and base sequence index 13 are respectively 10 and 7. Obviously, -10, -7 is another pair of cyclic shifts, satisfying | ((2 · Offset)₁·r₁)mod N₁)/N₁-((2·Offset₂·r₂)mod N₂)/N₂And | is minimal. The transmitter and receiver may use a rolling phase division to determine the cyclic shift, also avoiding a large amount of memory.

In the second case: referring to fig. 8, for a non-centrosymmetric time-frequency resource occupation mode, its distance F relative to a centrosymmetric resource occupation mode_iAnd if not, adding the adjustment quantity of the cyclic shift to a pair of cyclic shift sequences obtained in the central symmetric resource occupation mode to generate sequences of two subgroups in the same sequence group. The adjustment amount of the cyclic shift is determined by the distance between the non-centrosymmetric resource and the centrosymmetric resource.

The following is an actual example of the resource occupying manner of occupying the left RB in fig. 8. Cyclic shift of 11 long sequences of RBs on the left side of FIG. 8 to Offset₁In FIG. 8, the cyclic shift sequence corresponding to the occupancy pattern of 2RB is Offset₂，F₁Is the signed distance between the time-frequency resource position corresponding to the left RB and the resource position with central symmetry as shown in fig. 9, where the positive and negative indicate different directions, and the unit is subcarrier. In the example of FIG. 8F₁-6, meaning left-shifted by 6 subcarriers, or F₁It is also possible that-5 is,this is due to the possible flexibility resulting from the mismatch of the length 11 of the Zadoff-Chu sequence and the number of one RB subcarrier 12. F₂Is the signed distance of the occupancy of 2RB relative to the centrosymmetric resource, specifically, the cyclic shift Offset of the 11 long sequences of the left RB of FIG. 8₁Cyclic shift of length 23 sequence of 10, 2 RBs as Offset₂7- (-6) ═ 13. That is, the amount of cyclic shift corresponding to 2 RBs with respect to the resource of the center pair is increased by-F₁-6 sub-carriers.

Offset determined by the method_iThe frequency domain shift is generally realized by a transform domain (time domain) shift, and Offset_iThe corresponding time domain shift is Offset_i·r₁/N₁. This is because a frequency domain shift must be equivalent to a time domain shift. The frequency domain shift represents a shift of the index and the time domain shift represents a shift of the element. For example, a₁，a₂，a₃，a₄，a₅Index shift by 1 unit, a₂，a₃，a₄，a₅，a₁Element shift by 1 unit of a₅，a₁，a₂，a₃，a₄。

Due to when r is_i，r_jParity differences, d (f)_i，f_j) Is not zero-valued, and therefore, can be further fine-tuned in the time domain, i.e. one of the sequences is shifted by 1/(2N) again_iN_j) E.g. f_i-f_k＝±1/(N_iN_j) When r is_iCorresponding sequence alignment μ l/(2N)_iN_j) The correlation value of the long and short sequences after the shift is made the largest, and the sequences thus generated are sequences of two subgroups of the same sequence group.

The amount of time-domain adjustment due to truncation or cyclic extension of the sequence may be further considered. In a practical system, the size of a radio resource block may be, for example, 12 sub-carriers, and is not a prime number. If, it is desired to use prime numbers longDegree Zadoff-Chu sequences, truncation of Zadoff-Chu sequences of prime length, e.g., 13, or cyclic extension, e.g., 11, may be required. Specifically, for the Zadoff-Chu sequence (a) with the length of 13₀，a₁，...，a₁₂) After cutting off is (a)₀，a₁，...，a₁₁). For the length of 11 Zadoff-Chu sequence (b)₀，b₁，...，b₁₀) Cyclically expand to (b)₀，b₁，...，b₁₀，b₀). Due to truncation or cyclic extension, the determined cyclic shift of the sequences of the same group in the time domain may be fine-tuned to generate sequences of different subgroups of the same sequence group.

The method for determining the adjustment amount comprises the following steps: let r₁，N₁，r₂，N₂Two determined Zadoff-Chu sequences, Offset₁，Offset₂The adjustment amount is determined as- (((r) when the frequency domain shift amount of the two sequences is not truncated or extended when the two sequences are placed on the centrosymmetric frequency domain resources, which is obtained according to the rule of minimum function₁·a)mod N₁)/N₁+(r₂·b)mod N₂/N₂)/2. Wherein b is due to r after truncation or expansion₁，N₁The distance of mirror resource mapping of the corresponding sequence, a is r₁，N₁A difference in a frequency domain cyclic shift amount between the sequences mapped with the mirror resources of the decided sequences.

Specifically, as shown in fig. 10, a 13-long sequence, truncates one element at high frequency; a symmetric sequence, as shown in fig. 11, 13 long, truncates an element at low frequencies, where b is 1 and a is-1. That is, the resource occupied by the sequence of length 12 in fig. 11 is shifted downward by 1 subcarrier to obtain the resource occupied by the sequence of length 12 in fig. 10 (b is 1), the frequency domain shift amount of the re-sequence itself is increased by a-1, and the sequence of length 12 in fig. 11 becomes the sequence of length 12 in fig. 10.

When r is₁＝1，N₁＝13，r₂＝2，N₂23, when placed on a centrosymmetric frequency resource, frequencyThe rate shift amounts are 2 and 19, respectively, assuming that the IFFT length is 512, and one sample (i.e., 1/512) is used as the basic unit of shift, the IFFT length corresponds to cyclic shift 2 × 1/13 × 512 in the time domain, (19 × 2mod23)/23 × 512, and the sequence 13 is then adjusted in the time domain by-1/13/23/2 × 512-0.85 in the time domain, and the cyclic shift sequence is the strongest correlation at this time. However, for a sequence 13 long, the highest correlation is obtained by cutting off the high frequency value and adjusting the time domain to-0.85- (-1/13+2/23)/2 x 512 to-3 samples. I.e. by an adjustment amount.

It is clear that when the low frequency truncated sequence of fig. 11 is used, the corresponding a, b are exactly opposite sign compared to the high frequency truncated a, b, i.e. a is 1, b is-1, and the calculated adjustment is-0.85- (1/13-2/23)/2 is 512 is 2.

For the case of cyclic expansion, as in FIG. 13, the 11 long sequence is then high frequency expanded by one element. As shown in fig. 14 and 11, if a long sequence is extended with one element at a low frequency, the sequence in fig. 14 needs to shift the frequency domain resource one subcarrier b by-1, and then the sequence frequency domain shift amount of the sequence itself is increased by 1, and a is 1, so that the extended sequence in fig. 14 and the sequence in fig. 13 completely overlap.

Obviously, in the case of the cyclic extension at a low frequency using the sequence of fig. 14, a and b have opposite signs, a is-1 and b is +1, respectively, as compared with a and b in the case of the cyclic extension at a high frequency.

Generally, the truncation or cyclic extension may be not only one subcarrier but also a plurality of subcarriers. When a plurality of subcarriers are truncated or extended, a symmetric truncation or symmetric extension method may be adopted, that is, one more high frequency (or low frequency) is truncated or extended, and the numbers of truncation or extension of high frequency and low frequency are the closest, for example, if 3 values are truncated, the low frequency is truncated by 1, the high frequency is truncated by 2, or the low frequency is truncated by 2, and the high frequency is truncated by 1. The above-mentioned fixed pair of a, b values for truncating and extending a subcarrier still applies, i.e. a-1, b +1 for truncating and a +1, b-1 for extending. When asymmetric expansion is employed, the calculation can be performed according to the distance of mirror resource mapping. That is, a and b are determined by obtaining the identical sequence of the mirror resources by the resource shift amount b according to a which requires an increase in the cyclic shift amount of the frequency domain of the sequence itself.

Because symmetrical truncation or expansion has the same and smaller influence on the cyclic shift adjustment amount, symmetrical truncation or expansion can be adopted in a better system. The method comprises the following steps: dividing the sequences in each sequence group into a plurality of subgroups, wherein each subgroup corresponds to a mode of time-frequency resource occupation; the sequence in each subgroup is selected from the candidate sequence set corresponding to the subgroup to generate, and the generating method specifically comprises the following steps: when the sequences in the subgroup need to carry out cyclic shift expansion or truncation on the sequences in the candidate sequence set, a symmetric expansion or symmetric truncation method is adopted; the sequence groups are allocated to cells/users/channels.

In other embodiments, when there are sequences of multiple lengths in the system, any one of the sequences may be selected as a fixed sequence, and the other sequences are compared with the fixed sequence, and the cyclic shift of the sequences is determined according to the above rule (i.e., two cyclic shift sequences are determined). For example, the shortest sequence that a packet is likely to use in the system may be selected as the fixed sequence. The longest possible sequence for use by a packet in the system can also be selected as the fixed sequence.

In this embodiment, the indicator r is a fixed sequence of time-frequency resource occupancy patterns₁Length of N₁After determining the cyclic shift, the cyclic shift Offset of the sequence of the fixed time-frequency resource occupation mode₀It is fixed. Comparing other sequences with the cyclic shift sequence of the sequence with the fixed time frequency resource occupation mode to determine the cyclic shift amount, including the shift amount Offset of the sequence with the fixed time frequency resource occupation mode₁And cyclic shift amount Offset of other sequence u itself_uSequence u except for cyclic shift Offset_uIn addition, it is also necessary to reverse shift Offset in time₁′·r₁/N₁Which isIntermediate Offset₁' is the relative amount of shift of the fixed resource, i.e. Offset₁-Offset₀Offset can be fixed₀When it is 0, Offset₁′＝Offset₁. This is due to the cyclic shift of the frequency domain indices c, and the cyclic shift of the time domain elements c r₁/N₁Equivalence, therefore sequence u is reverse shifted by Offset₁′·r₁/N₁And the correlation value of the sequence of the fixed time frequency resource occupation mode, and the sequence frequency domain cyclic shift Offset of the sequence u without reverse shift and the fixed time frequency resource occupation mode₁' the correlation values of the sequences are the same.

In practice, a plurality of other cyclic shift sequence groups can be obtained by using the reference cyclic shift sequence group, which is a cyclic shift in the time domain, by using the characteristic that sequences with different lengths are approximately orthogonal in the time domain.

Next, a specific example will be given to describe the above-described determination method for determining the reference cyclic shift sequence group and the other cyclic shift sequence groups. For N₁＝11，N₂23, there are groups of 10 base sequences as in the table below. The base sequences in each group may in turn be divided into a plurality of different sets of cyclic shift sequences. Assuming that the resource occupation pattern by the sequence is a centrosymmetric resource occupation pattern as shown in fig. 9, the rule of the present invention is used to determine the metric function | ((2 · Offset)₁·r₁)mod N₁)/N₁-((2·Offset₂·r₂)mod N₂)/N₂The value of the smallest cyclic shift may be chosen such that two cyclic shifts with a metric value of-1 are chosen, or two cyclic shifts with a metric value of +1 are chosen. For example, for a sequence set of k ═ 1, r₁，r₂Representing a base sequence index, Offset₁，Offset₂Representing the amount of cyclic shift determined by the rules of the present invention, at which the two sequences can obtain the strongest correlation, the metric function has a minimum of-1 and the corresponding correlation value is 10.9256, which is very close compared to the ideal autocorrelation 11And the correlation is strong. Thus, the sequences in the set of reference cyclic shift sequences in this example are: a sequence of length 11, base sequence index 1, cyclic shift in frequency domain 6, and a sequence of length 23, base sequence index 2, cyclic shift in frequency domain 12. Having obtained the set of reference cyclic shift sequences, assuming now that there are 12 signal samples in the time domain for the sequences, then cyclically shifting the two sequences of this set by 2, 4, 6, 8, 10 in the time domain, respectively, can produce 5 additional sets of sequences. The specific time domain cyclic shift may be performed in the time domain after the sequence is mapped to the subcarrier according to the resource occupation and then the time domain signal is generated.

Measure of the strongest correlation peak

Group number k r₁，r₂ Offset₁，Offset₂Correlation value

Value of

1 1，2 6，12 -1 10.9256

2 2，4 0，0 0 10.7375

3 3，6 2，4 -1 10.4072

4 4，8 0，0 0 9.9743

5 5，10 10，7 -1 9.4193

6 6，13 1，16 -1 9.4193

7 7，15 0，0 0 9.9743

8 8，17 9，19 -1 10.4072

9 9，19 0，0 0 10.7375

10 10，21 6，22 -1 10.9256

Reuse sequence N₁＝23，N₂For example, 37, the following set of relationships are provided:

of the most strongly correlated peak

Group number k r₁，r₂ Offset₁，Offset₂Correlation value of metric value

1 1，2 14，2 -75 9.1184 12.0825

2 2，3 7，26 1 17.5056

3 3，5 0，0 0 19.3621

4 4，6 0，0 777 7.5744，11.7449

5 5，8 12，19 -1 22.7527

6 6，10 0，0 74 11.0807，12.0637

7 7，11 0，0 0 15.4330

8 8，13 19，6 -1 20.8930

9 9，14 22，32 73 6.6780 11.0861

10 10，16 0，0 0 22.0487

11 11，18 18，29 1 13.2419

12 12，19 5，8 -1 13.2419

13 13，21 0，0 0 22.0487

14 14，23 1，5 73 6.6780 11.0861

15 15，24 4，31 1 20.8930

16 16，26 0，0 0 15.4330

17 17，27 0，0 777 11.0807，12.0637

18 18，29 11，18 -1 22.7527

19 19，31 0，0 777 7.5744，11.7449

20 20，32 0，0 0 19.3621

21 21，34 16，11 -1 17.5056

22 22，35 9，35 75 9.1184 12.0825

In the column labeled "correlation value" above, there are two representations of the correlation values, and in this sequence set, the cyclic shift of the two sequences with the strongest correlation is not the pair of cyclic shifts that minimizes the metric, where the correlation value on the left is the correlation value of the pair of cyclic shifted sequences that minimizes the metric, and the maximum correlation value that can be obtained from all possible frequency domain cyclic shifts is on the right. It is clear that the correlation between two cyclic shifted sequences of the same group is not large enough for the group of sequences designed according to the method of the present invention, which is shown in bold in the table. This occurs at r as found by analysis₁/N₁-r₂/N₂When | is relatively large, e.g. r in the table₁＝1，r₂When 2, |1/23-2/37|, 9/(23 · 37), in the table when | r₁/N₁-r₂/N₂|≤7/N₁N₂In time, the sequence group designed by the invention completely meets the strong correlation requirement and is relatively close to the ideal autocorrelation value 23. Therefore, although 22 motif groups can be combined for sequences of length 23 and 37, it is possible to limit the choice of | r alone₁/N₁-r₂/N₂|≤7/N₁N₂The 14 motif group of (a), i.e., the group identified in non-bold in the table above. The grouping method of cyclic shift sequences described in the present invention is fully applicable for each selected motif group. The system may select a base sequence that satisfies the grouping rule of the cyclically shifted sequences of the present invention, i.e., such that | r₁/N₁-r₂/N₂Some motif group with smaller |. As another example, for a sequence 11 lengths, and a sequence 23 lengths, for a11 long base sequence index r₁Representing a sequence, there may be two base sequence indices r of 23 lengths₂The sequences represented are respectively such that | r₁/N₁-r₂/N₂The sequence with the smallest | and the next smallest, belonging to the same motif group, can be found only so that | r₁/N₁-r₂/N₂The least 23 sequences and the corresponding 11 sequences form a motif group, so that when cyclic shift sequences can be further grouped, the delay with the strongest correlation meets our rule. For sequences of length 11 (r for base sequence index)₁Expressed), and a sequence of length 37 (r for base sequence index)₂Expressed), the motif group may have one sequence of

length

11 and 2 sequences of length 37, the two 37 sequences being such that | r₁/N₁-r₂/N₂The sequence of the smallest and next smallest. For the cyclic shift sequences in this sequence group, further grouping is performed, and the cyclic shift sequences belonging to the same group found by using our rule are strongly correlated. Therefore, in general, in order to ensure the accuracy of the cyclic shift sequence grouping rule, it is necessary to restrict the structure of the motif sequence group.

The sequence of these non-strongly correlated peaks, obtained according to the grouping rule of the present invention, can also be considered for use in a system. The cyclic shift correspondence between these sequences, still determined by the rules of the present invention, requires the system to tolerate the interference caused by these non-strongly correlated sequences. The strong correlation between these sequences is not shown as a peak, but as a high correlation in an interval.

Compared with the prior art, the following beneficial effects are achieved in the specific implementation mode: in this embodiment, long and short sequences or general cyclic shift sequences causing strong correlation corresponding to different frequency resource occupation manners are placed in the same group, and interference between sequences in different groups is relatively small or approximately orthogonal. Thus, different groups are allocated to cells or users or channels, and the purpose of interference reduction can be achieved. By adopting the method of the invention, the transmitting and receiving machines can generate the cyclic shift sequence according to the grouped rules, thereby avoiding the transmitting party and the receiving party from storing the table of the corresponding relation of the sequence group and reducing the realization complexity.

Detailed description of the invention

In this embodiment, different from the foregoing embodiment, in this embodiment, a cyclic shift sequence corresponding to a certain time-frequency resource occupation manner is used as a reference to determine cyclic shift sequences corresponding to other time-frequency resource occupation manners in the system, for example, a cyclic shift sequence corresponding to a long sequence in a central symmetric resource occupation manner shown in fig. 9 is used as a reference to determine cyclic shift sequences corresponding to short sequences in fig. 8 on different RBs. The specific method comprises the following steps:

the sequences in each sequence group are divided into a plurality of subgroups, each subgroup corresponds to a time-frequency resource occupation mode, the sequence groups are allocated to cells, the sequences in each subgroup are selected from candidate sequence sets corresponding to the subgroup, the candidate sequence sets are cyclic shift sequences generated by a base sequence in time or frequency, and the selection method specifically comprises the following steps: determining the cyclic shift sequences by distances of time-frequency resource positions occupied by different cyclic shift sequences relative to a reference time-frequency resource position.

In this embodiment, the process of determining the cyclic shift sequence specifically includes:

c represents the distance of the time frequency resource position occupied by the cyclic shift sequence corresponding to the different time frequency resource occupation modes relative to the reference time frequency resource position, r₂，N₂A base sequence index and length representing a referenced time-frequency resource,

then select the cyclic shift amount of transform domain as- (c r)₂)mod N₂/N₂Constitutes the cyclically shifted sequence. When the sequence is modulated in the frequency domain, the transform domain is the time domain. When the sequence is modulated in the time domain, the transform domain is the frequency domain.

The reference time frequency resource location may select the time frequency resource location corresponding to the longest sequence in the system.

Taking the time-frequency resource occupation manners of fig. 8 and 9 as examples, assuming the resource occupation manner with reference to fig. 9 and the cyclic shift sequence with reference to the sequence with length 23 and cyclic shift amount 7, the cyclic shift sequence corresponding to the left RB in fig. 8 has the corresponding length 11 of the centrally symmetric RB and the determined frequency domain cyclic shift amount of Offset₁Is reversed in the time domain (c · r)₂)mod N₂/N₂Is obtained by cyclic shift of (a), wherein r₂Is a base sequence index corresponding to the sequence used in 2RB, N₂The relative distance of the time-frequency resource position is c-6, which is the sequence length corresponding to 2 RB. In the above example, with 1/32 as the unit of shift, cyclic shift 6 in the frequency domain is equivalent to shift (6 · 13) mod 23/23 · 32 in the time domain to 12.52. Since the long sequence is used as a reference sequence, i.e. the fixed cyclic shift of the long sequence is used as a reference, the short sequence is shifted backward by 12.52 sampling points in time, so that the shifted short sequence and the long sequence are strongly correlated. The thus cyclically shifted sequence in the time domain is a sequence belonging to the same group as the long sequence. In the concrete implementation, the steps are as follows: selecting a reference resource position and a cyclic shift sequence corresponding to the reference resource position to obtain the distance c between the time frequency resource position occupied by the cyclic shift sequence corresponding to the occupation mode of the current time frequency resource and the reference time frequency resource position, and obtaining the distance c according to (c.r)₂)mod N₂/N₂Calculating the cyclic shift amount of the sequence at the resource position in the time domain, and then performing a reverse shift on the time domain sequence obtained from the sequence mapped at the resource position by (c · r)₂)mod N₂/N₂. Thus, a time domain cyclic shift sequence belonging to the same group with the long sequence is obtained, and finally, the corresponding cyclic shift sequence group can be allocated according to the needs of the system.

A similar approach may be used for the determination of the cyclic shift of the sequence of the RB on the right in fig. 8, when the distance of the frequency domain resource location is c-6. Where a negative sign indicates a shift to high frequencies and a positive sign indicates a shift to low frequencies. At this time, since the right RB is obtained by shifting up 6 subcarriers from the centrally symmetric resource, the resource of the 2RB sequence should be cyclically shifted up 6 subcarriers in order to make the correlation strongest, and the index of the 2RB sequence is shifted by-6. Thus, a negative sign indicates a shift to a high frequency and a positive sign indicates a shift to a low frequency.

Thus we have determined a set of sequences comprising sequences corresponding to 2RB, sequences corresponding to the left 1RB and sequences corresponding to the right 1RB, which sequences are determined by respective amounts of cyclic shift. Typically, a set of sequences is determined, and then the other sets of sequences are determined by cyclically shifting the set of sequences in the time domain by an amount, for example, each length of sequence is cyclically shifted by 8 samples in the time domain, so that if the total number of samples is 32, 4 different sets of sequences can be generated, corresponding to 8, 16, 24 samples in cyclic shift, and the initially determined set of sequences (0 shift).

In the present invention, the shift amount may be in units of 1/S, where S is the total number of sampling points, and in particular implementations, shift amounts less than one unit may be rounded. It is also possible to consider accurate interpolation or the like to achieve an accurate shift amount, in which case 1/S is only one unit and not taken as the minimum unit of rounding, and S may take any value and be equivalent, for example S takes 1.

Detailed description of the invention

The following provides a sequence processing apparatus, for transmission or reception of a sequence, the apparatus comprising:

a second sequence selection unit: a group number k for receiving a system-assigned sequence group, the sequences of at least two subgroups i, j in the sequence group k being such that a function d (f) is given by the candidate sequence set corresponding to the subgroup_i(·)，f_j(. DEG)) values of the smallest, next smallest, and up to smaller n sequences are selected, where i, j is the sequence number of the subgroup, n is a natural number, and d (f)_i(·)，f_j(. -) is a binary function, function f_i(. or f)_j(. cndot.) is a function corresponding to the subgroup i or j, and the function definition domain is the candidate sequence set corresponding to the subgroup i or j.

In another embodiment, the second sequence selection unit may determine the cyclic shift by rolling phase division, and a large amount of memory is also avoided. Specifically, the second sequence selection unit further includes:

a cyclic shift determination module for determining a cyclic shift by a rolling phase division; and the cyclic shift sequence generation module is used for generating a corresponding cyclic shift sequence according to the determined cyclic shift.

The above sequence is not limited to the Zadoff-Chu sequence, but can also be applied to Gauss sequence, other CAZAC sequence, base sequence and/or delay sequence of CAZAC sequence. The transmission mode of the sequence can be frequency domain transmission or time domain transmission; in general, the above-described receiving operation is, specifically, a correlation operation for obtaining a channel estimation value or obtaining time synchronization, or the like. The functions in the apparatus may be specifically consistent with those in the allocation method, and are not described herein again.

Detailed description of the invention

The following provides a sequence of processing devices, characterized in that it comprises:

a third sequence selection unit: the method for selecting the cyclic shift sequence in time or frequency generated by a base sequence includes the steps of: determining the cyclic shift sequences by distances of time-frequency resource positions occupied by different cyclic shift sequences relative to a reference time-frequency resource position.

In the sequence processing devices, the sequence selection unit directly selects the sequence meeting the interference requirement by adopting a certain rule without storing a list of sequence corresponding relations, and compared with the prior art, the communication resource is saved.

While the invention has been shown and described with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention.

Claims

1. A method for sequence allocation in a communication system, the method comprising:

the sequence in each subgroup is selected from the candidate sequence set corresponding to the subgroup, and the selecting method specifically comprises the following steps: the sequences in subgroup i in sequence group k are selected from the candidate sequence set such that function d (f)_i(·)，G_k) Is the smallest, next smallest, or even smaller of the values of (A)Small n sequences are selected, where k is the group number of the sequence group, i is the serial number of the subgroup, n is a natural number, d (a, b) is a binary function, G_kIs a quantity, function f, determined by the group number k_i() a function corresponding to the subgroup i, the function defining a set of candidate sequences corresponding to the subgroup i;

the sequence groups are allocated to cells/users/channels.

2. The method of claim 1,

the sequence is a Zadoff-primary Zadoff-Chu sequence or a Gauss sequence.

3. The method of claim 2,

the function f_i(. specifically) is

<math><mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <msub> <mo>}</mo> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow></math>

Wherein r is_iIs an indicator of the base sequence in the set of candidate sequences, N_iIs the length of the sequences in the set of candidate sequences; or,

when the subgroup i is pairedThe function f should be spaced by s radio resources_iThe (DEG) is specifically:

<math><mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <mo>{</mo> <msub> <mi>a</mi> <mrow> <mrow> <msup> <mi>s</mi> <mi>l</mi> </msup> <msub> <mi>r</mi> <mi>i</mi> </msub> </mrow> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <msub> <mo>}</mo> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow></math>

wherein r is_iIs an indicator of the base sequence in the set of candidate sequences, N_iIs the length of the sequence in the candidate sequence set, s is the interval size of the radio resource, and l is the highest order of the gaussian sequence.

4. The method of claim 3,

the G is_kIs composed of

G_{k} = f_{p_{1}} ({a_{c_{k}, N_{p_{1}}} (z)}_{z = 0,1, . . ., N_{p_{1} - 1}}) = c_{k} / N_{p_{1}},

Base sequence index for long sequences; the reference subgroup is a subgroup with the minimum sequence length in the sequence group or a subgroup with the maximum sequence length in the sequence group.

5. The method of claim 1,

n is 1, or n is a quantity determined from k and i.

6. The method according to any one of claims 1 to 5,

the function d (a, b) is | a-b |;

or the function d (a, b) is | (a-b) modu1 |;

or the function

Or the function

7. The method of claim 6, further comprising determining u, v according to the following method:

u = - 1 / (2 N_{p_{1}}) + 1 / ({4 N}_{p_{2}}),

v = 1 / (2 N_{p_{1}}) - 1 / ({4 N}_{p_{2}}),

whereinIs the length of the sequence of the shortest sequence,

is only greater than

The length of the sequence of (c).

8. The method of claim 6, further comprising determining u, v according to the following method:

for sequence group q₁Subgroup p of₁，

Wherein

For sequence groupsSubgroup p of₁，

Wherein

Wherein,

indicates the length of the sequence of the shortest sequence,indicates the length of the longest sequence, the length being

Is indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

Is numbered p₁。

9. The method of claim 6, further comprising determining u, v according to the following method:

sequence group q_kSubgroup p of₁Is/are as follows

Comprises the following steps:

v_{q_{k}, p_{1}} = 1 / D;

sequence group q_k+1Subgroup p of₁Is/are as follows

Comprises the following steps:

u_{q_{k + 1}, p_{1}} = - 1 / D;

wherein,

indicates the length of the shortest sequence, the length beingIs numbered p₁Length ofThe index of (1) is the number q of the sequence group in which the base sequence of k is located_kLength of

Index of (2) is number q of sequence group in which base sequence of k +1 is located_k+1And k is 1, Λ,

10. the method of claim 6, further comprising determining said v according to the following method:

for the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mi>lef</mi> <msub> <mi>t</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}} |

When taking the minimum value

Sequence group q_kSubgroup p of_iIs/are as follows

Comprises the following steps: when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

v_{q_{k}, p_{i}} = v_{q_{k}, p_{i - 1}} + r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - righ t_{q_{k}, p_{i - 1}};

when in use

r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - righ t_{q_{k}, p_{i - 1}} > 0

When the temperature of the water is higher than the set temperature,

v_{q_{k}, p_{i}} = v_{q_{k}, p_{i - 1}};

wherein,

indicates the length of the shortest sequence, the length being

Index of (2) is number q of sequence group in which base sequence of k +1 is located_k+1Length of

Is numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

And is

{right}_{q_{k}, p_{i - 1}} = v_{q_{k}, p_{i - 1}} + k / N_{p_{1}},

{left}_{q_{k + 1}, p_{i - 1}} = u_{q_{k + 1}, p_{i - 1}} + (k + 1) / N_{p_{1}},

k＝1，Λ，

I ∈ S, S is an index set, the set S is a set I or a subset of a set I, {2, 3 …, l }, and l is the number of sequence lengths in the candidate sequence set.

11. The method of claim 6, further comprising determining u according to the following method:

for the sequence length ofA base sequence of (A) according to

Are taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{k}, p_{i - 1}} |

When taking the minimum valueSequence group q_k+1Subgroup p of_iIs/are as follows

Comprises the following steps: when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>+</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}} + r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}};

when in use

r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}} < 0

When the temperature of the water is higher than the set temperature,

u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}};

wherein,

indicates the length of the shortest sequence, the length being

Is numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

And is

{right}_{q_{k}, p_{i - 1}} = v_{q_{k}, p_{i - 1}} + k / N_{p_{1}},

l {eft}_{q_{k + 1}, p_{i - 1}} = u_{q_{k + 1}, p_{i - 1}} + (k + 1) / N_{p_{1}},

k＝1，Λ，

I ∈ S, S is an index set, the set S is a set I or a subset of a set I, {2, 3, …, l }, and l is the number of sequence lengths in the candidate sequence set.

12. The method of claim 6, further comprising determining said v according to the following method:

for the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {left}_{q_{1}, p_{i - 1}} |

When taking the minimum value

Sequence groupSubgroup p of_iIs/are as follows

Comprises the following steps: when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>≤</mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

<math><mrow> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mi>t</mi> </msub> </mrow> </msub> <mo>=</mo> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>+</mo> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>;</mo> </mrow></math>

when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>></mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

v_{q_{N_{p_{1}} - 1}, p_{i}} = v_{q_{N_{p_{1}} - 1}, p_{i - 1}};

wherein is made of

Indicates the length of the shortest sequence, the length beingThe index of (1) is the number q of the sequence group in which the base sequence is located₁Length of

Is indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

The numbering of the subgroup in which the base sequence is located is

Has a length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

And is

<math><mrow> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>=</mo> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>,</mo> </mrow></math>

{left}_{q_{1}, p_{i - 1}} = u_{q_{1}, p_{i - 1}} + 1 / N_{p_{1}},

I ∈ S, where S is a set of metrics, the set S is a set I or a subset of a set I, where the set I ═ {2, 3, …, l }, and l is the number of sequence lengths in the candidate sequence set.

13. The method of claim 6, further comprising determining u according to the following method:

sequence group q₁Subgroup p of_iIs/are as follows

Comprises the following steps:

for the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{N_{p_{1}} - 1}, p_{i} - 1} |

When taking the minimum value

Sequence group q₁Subgroup p of_iIs/are as follows

Is as follows

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>+</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

when in use

When the temperature of the water is higher than the set temperature,

u_{q_{1}, p_{i}} = u_{q_{1}, p_{i - 1}};

wherein is made of

Indicates the length of the shortest sequence, the length being

The index of (1) is the number q of the sequence group in which the base sequence is located₁Length ofIs indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

Is numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

{right}_{q_{N_{p_{1}} - 1}, p_{i - 1}} = v_{q_{N_{p_{1}} - 1}, p_{i - 1}} + (N_{p_{1}} - 1) / N_{p_{1}},

14. The method of claim 6, further comprising determining u, v according to the following method:

sequence group q_kSubgroup p of_iIs/are as followsAnd

respectively as follows:

u_{q_{k}, p_{i}} = u_{q_{k}, p_{m}},

v_{q_{k}, p_{i}} = v_{q_{k}, p_{m}},

wherein,

indicates the length of the shortest sequence, the length being

The index of (1) is the number q of the sequence group in which the base sequence of k is located_kLength ofIs numbered p_mLength ofIs numbered p_iAnd k is 1, Λ,

i belongs to I-S, the I and the S are two index sets, the set I is {2, 3, …, l }, and l is a candidate sequenceThe number of sequence lengths in the column set, where the set S is set I or a subset of set I, and m is the element with the largest value in the set S.

15. The method of claim 6,

n is less than or equal to Q, wherein Q is the following

Number of sequences of (1), u_k，iAnd v_k，iU and v for subgroup i in sequence group k.

16. A method of processing a sequence, characterized in that,

receiving a group number k of a sequence group allocated by a system;

17. The method of claim 16, wherein the sequence is a Zadoff-initial Zadoff-Chu sequence or a gaussian Gauss sequence.

18. The method of claim 17,

the function f_i(. specifically) is

<math><mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <msub> <mrow> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>}</mo> </mrow> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow></math>

when the subgroup i corresponds to radio resources with an interval s, the function f_iThe (DEG) is specifically:

<math><mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo>:</mo> <msub> <mrow> <mo>{</mo> <msub> <mi>a</mi> <mrow> <msup> <mi>s</mi> <mi>l</mi> </msup> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> </mrow> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>}</mo> </mrow> <mrow> <mi>z</mi> <mo>=</mo> <mn>0,1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&RightArrow;</mo> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow></math>

19. The method of claim 18,

the G is_kIs composed of

G_{k} = f_{p_{1}} ({a_{c_{k}, N_{p_{1}}} (z)}_{z = 0,1, . . ., N_{p_{1} - 1}}) = c_{k} / N_{p_{1}},

Is the length of the reference subgroup sequence, c_kIs determined by the sequence set kBase sequence index for long sequences; the reference subgroup is a subgroup with the minimum sequence length in the sequence group or a subgroup with the maximum sequence length in the sequence group.

20. The method of claim 16,

n is 1, or n is a quantity determined from k and i.

21. The method according to any one of claims 16 to 20,

the function d (a, b) is | a-b |;

or the function d (a, b) is | (a-b) modu1 |;

or the function

Or the function

22. The method of claim 21 further comprising determining u, v according to the following:

u = - 1 / (2 N_{p_{1}}) + 1 / ({4 N}_{p_{2}}),

v = 1 / (2 N_{p_{1}}) - 1 / ({4 N}_{p_{2}}),

whereinIs the sequence of the shortest sequenceThe length of the first and second support members,

is only greater than

The length of the sequence of (c).

23. The method of claim 21 further comprising determining u, v according to the following:

for sequence group q₁Subgroup p of₁，

Wherein

For sequence groups

Subgroup p of₁，

Wherein

Wherein,

indicates the length of the sequence of the shortest sequence,

indicates the length of the longest sequence, the length being

Is indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

Is numbered p₁。

24. The method of claim 21 further comprising determining u, v according to the following:

sequence group q_kSubgroup p of₁Is/are as follows

Comprises the following steps:

v_{q_{k}, p_{1}} = 1 / D;

sequence group q_k+1Subgroup p of₁Is/are as follows

Comprises the following steps:

u_{q_{k + 1}, p_{1}} = - 1 / D;

wherein,

indicates the length of the shortest sequence, the length being

Is numbered p₁Length ofIs composed of

25. the method of claim 21, further comprising determining said v according to the following method:

for the sequence length of

A base sequence of (A) according toAre taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}} |

When taking the minimum value

Sequence group q_kSubgroup p of_iIs/are as follows

Comprises the following steps: when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mi>right</mi> </mrow> <mrow> <msub> <mi>q</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

v_{q_{k}, p_{i}} = v_{q_{k}, p_{i - 1}} + r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - {right}_{q_{k}, p_{i - 1}};

when in use

r_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} - {1 / C_{p_{i - 1}} - right}_{q_{k}, p_{i - 1}} > 0

When the temperature of the water is higher than the set temperature,

v_{q_{k}, p_{i}} = v_{q_{k}, p_{i - 1}};

wherein is made of

Indicates the length of the shortest sequence, the length being

Is numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

And is

{right}_{q_{k}, p_{i - 1}} = v_{q_{k}, p_{i - 1}} + k / N_{p_{1}},

{left}_{q_{k + 1}, p_{i - 1}} = u_{q_{k + 1}, p_{i - 1}} + (k + 1) / N_{p_{1}},

k＝1，Λ，

26. The method of claim 21 further comprising determining u according to the following method:

for the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{k}, p_{i - 1}} |

When taking the minimum value

Sequence group q_k+1Subgroup p of_iIs/are as follows

Comprises the following steps: when in use

When the temperature of the water is higher than the set temperature,

u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}} + r_{q_{k}, p_{i - 1}} / N_{p_{i - 1} +} 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}};

when in use

r_{q_{k}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}, p_{i - 1}} < 0

When the temperature of the water is higher than the set temperature,

u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}};

wherein,

indicates the length of the shortest sequence, the length beingThe index of (1) is the number q of the sequence group in which the base sequence of k is located_kLength of

Is numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

And is

{right}_{q_{k}, p_{i - 1}} = v_{q_{k}, p_{i - 1}} + k / N_{p_{1}},

{left}_{q_{k + 1}, p_{i - 1}} - u_{q_{k + 1}, p_{i - 1}} + (k + 1) / N_{p_{t}},

k＝1，Λ，

27. The method of claim 21, further comprising determining said v according to the following method:

for the sequence length of

A base sequence of (A) according to

Are taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>left</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>q</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>&GreaterEqual;</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {left}_{q_{1}, q_{i - 1}} |

When taking the minimum value

Sequence group

Subgroup p of_iIs/are as follows

Comprises the following steps: when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>≤</mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

<math><mrow> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mi>i</mi> </msub> </mrow> </msub> <mo>=</mo> <msub> <mi>v</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>+</mo> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>;</mo> </mrow></math>

when in use

<math><mrow> <msub> <mi>r</mi> <mrow> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>C</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> </mrow> <msup> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>′</mo> </msup> <mo>></mo> <mn>0</mn> </mrow></math>

When the temperature of the water is higher than the set temperature,

v_{q_{N_{p_{1}} - 1}, p_{i}} = v_{q_{N_{p_{1}} - 1}, p_{i - 1}};

wherein is made of

Indicates the length of the shortest sequence, the length being

Is indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

Is numbered p_i-1Length of

Is numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

And is

{left}_{q_{1}, p_{i - 1}} = u_{q_{1}, p_{i - 1}} + 1 / N_{p_{1}},

28. The method of claim 21 further comprising determining u according to the following method:

sequence group q₁Subgroup p of_iIs/are as follows

Comprises the following steps:

for the sequence length of

A base sequence of (A) according toAre taken to be different values such that

<math><mrow> <msub> <mi>r</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>/</mo> <msub> <mi>N</mi> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </msub> <mo>-</mo> <msub> <mi>right</mi> <mrow> <msub> <mi>q</mi> <mrow> <msub> <mi>N</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mrow> </msub> <mo>≤</mo> <mn>0</mn> </mrow></math>

And is

| r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{N_{p_{1}} - 1}, p_{i - 1}} |

When taking the minimum value

Sequence group q₁Subgroup p of_iIs/are as followsIs as follows

When the temperature of the water is higher than the set temperature,

when in use

When the temperature of the water is higher than the set temperature,

u_{q_{1}, p_{i}} = u_{q_{1}, p_{i - 1}};

wherein is made of

Indicates the length of the shortest sequence, the length being

Is indicated by

The sequence group in which the base sequence is located is numbered

Has a length of

Is numbered p_i-1Length ofIs numbered p_i，

N_{p_{i - 1}} < N_{p_{i}},

{right}_{q_{N_{p_{1}} - 1}, p_{i - 1}} = v_{q_{N_{p_{1}} - 1}, p_{i - 1}} + (N_{p_{1}} - 1) / N_{p_{1}},

29. The method of claim 21, further comprising

Determining said u, v according to the following method:

sequence group q_kSubgroup p of_iIs/are as follows

And

respectively as follows:

u_{q_{k}, p_{i}} = u_{q_{k}, p_{m}},

v_{q_{k}, p_{i}} = v_{q_{k}, p_{m}},

wherein,indicates the length of the shortest sequence, the length being

Is numbered p_mLength of

Is numbered p_iAnd k is 1, Λ,

i belongs to I-S, where I and S are two index sets, where the set I is {2, 3, …, l }, l is the number of sequence lengths in the candidate sequence set, the set S is the set I or a subset of the set I, and m is the element with the largest value in the set S.

30. The method of claim 21,

n is less than or equal to Q, wherein Q is the following

31. A sequence processing apparatus, characterized in that the apparatus comprises

A sequence selection unit: for receiving the group number k of the sequence group assigned by the system, selecting the function d (f) in the candidate sequence set_i(·)，G_k) N sequences of the smallest, second smallest, or even smaller values of (a) constitute sequences in subgroup i in sequence group k, where i is the serial number of the subgroup, and n is the serial number of the subgroupA natural number, where d (a, b) is a binary function, k is the group number of the sequence group, G_kIs a quantity, function f, determined by the group number k_i() a function corresponding to the subgroup i, the function defining a set of candidate sequences corresponding to the subgroup i;

32. The sequence processing apparatus according to claim 31,

the sequence processing unit is specifically a sequence transmitting unit, and the sequence transmitting unit is used for generating a corresponding sequence according to the formed sequence and transmitting the corresponding sequence on a corresponding time-frequency resource; or,

the sequence processing unit is specifically a sequence receiving unit, and the sequence receiving unit is configured to generate a corresponding sequence according to the formed sequence and receive the corresponding sequence on a corresponding time-frequency resource.

33. A method for sequence allocation in a communication system, the method comprising:

the sequence groups are allocated to cells/users/channels.

34. The method of claim 33,

the sequence is a Zadoff-primary Zadoff-Chu sequence or a Gauss sequence.

35. The method of claim 33,

the sequence candidate set of said subgroup is a shifted sequence with a function f_i(x)＝((2·x·r_i)modN_i)/N_i，f_j(x)＝((2·x·r_j))modN_j)/N_jX is a cyclic shift index, N_i，N_jIs the length of the sequence, r_i，r_jIs a base sequence index of the Zadoff-Chu sequence.

36. The method of any one of claims 33-35, wherein the function d (f)_i(·)，f_j(. -) is | f_i-f_jL, < or >

37. The method of any one of claims 33-35, further comprising: and for the non-centrosymmetric resource occupation mode, adding the adjustment amount of cyclic shift to the cyclic shift sequences in the obtained candidate set of the subgroup i and the subgroup j to generate the sequences of the subgroup i and the subgroup j in the same sequence group, wherein the adjustment amount of the cyclic shift is determined by the position distance between the non-centrosymmetric resource and the centrosymmetric resource.

38. The method of claim 36,

when the function is fⁱ(x)＝((2·x·r_i)modN_i)/N_iAnd when N is_i，N_jWhen the difference is prime, calculating mN by using a rolling phase division method_i+nN_j1, to obtain a-m, b-n;

in the reduction of the remainder system, a/2/r_imodN_i，b/2/r_jmodN_jThe obtained value is the cyclic shift index of the selected cyclic shift sequence.

39. The method of claim 36, wherein r is an index of the base sequence_i，r_jWhen parity is different, the sub-group i and the sub-group j are selected so that | f_i-f_jL is the cyclically shifted sequence of the minimum of the non-zero values.

40. The method of claim 35, wherein when there are more than two length sequences in the system, the method further comprises:

selecting a sequence with a certain length as a fixed sequence;

sequence u other than the fixed sequence is cyclically shifted Offset_uIn addition, the Offset is further reversely shifted in the transform domain₁′·r₁/N₁Wherein Offset₁' denotes a relative shift amount of the fixed sequence, r₁，N₁Is the base sequence index and length, Offset, of the fixed sequence_uA cyclic shift amount Offset indicating the sequence u itself_u。

41. The method of claim 40, wherein the fixed sequence is a shortest sequence in the sequence group or a longest sequence in the sequence group.

42. The method of claim 33, wherein after determining a sequence set, the method further comprises:

and performing the same cyclic shift on a transform domain on each sequence in the determined sequence group to obtain other sequence groups.

43. The method of claim 36,

the result is d (f)_i，f_j) And finally, generating the sequences of the subgroup i and the subgroup j in the same group through the cyclic shift adjustment quantity on the transform domain.

44. The method of claim 43, wherein the base sequence indicator r is_i，r_jParity is different, and f_i-f_j＝±1/(N_iN_j) The cyclic shift adjustment amount in the transform domain is [ mu ] 1/(2N)_iN_j) In which N is_i，N_jIs the length of the base sequence.

45. The method of claim 43 or 44, wherein the amount of cyclic shift adjustment in the transform domain is- (((r) when the sequence needs truncation or cyclic extension₁·a)modN₁)/N₁+(r₂·b)modN₂/N₂) B is due to the truncation or extension, r₁，N₁The distance of mirror resource mapping of the determined sequence, a being r₁，N₁A difference in cyclic shift amount between the sequences mapped to the mirror resources of the decided sequences.

47. An apparatus for processing sequences in a communication system, the apparatus comprising:

a second sequence selection unit: a group number k for receiving a system-assigned sequence group, the sequences of at least two subgroups i, j in the sequence group k being such that a function d (f) is given by the candidate sequence set corresponding to the subgroup_i(·)，f_j(. DEG)) values of the smallest, next smallest, and up to smaller n sequences are selected, where i, j is the sequence number of the subgroup, n is a natural number, and d (f)_i(·)，f_j(. -) is a binary functionFunction f_i(. or f)_j(. h) is a function corresponding to the subgroup i or j, and the function definition domain is the candidate sequence set corresponding to the subgroup i or j;

48. The apparatus of claim 47,

the second sequence selection unit further includes:

a cyclic shift determination module for determining a cyclic shift by a rolling phase division;

and the cyclic shift sequence generation module is used for generating a corresponding cyclic shift sequence according to the determined cyclic shift.

49. A method of communication sequence allocation,

the sequence groups are allocated to cells/users/channels.

50. The method of claim 49, wherein the base sequence is a base sequence of a Zadoff-Chu sequence or a base sequence of a Gauss sequence.

51. The method of claim 49, wherein the reference time frequency resource location is a time frequency resource location corresponding to a longest sequence in the system.

52. The method of claim 49,

the process of determining the cyclic shift sequence specifically includes:

selecting the cyclic shift amount on the transform domain as- (c r)₂)modN₂/N₂Wherein c represents the distance of the time frequency resource position occupied by the corresponding cyclic shift sequence relative to the reference time frequency resource position, r₂，N₂A base sequence index and length representing a sequence occupying a referenced time-frequency resource.

53. The method of claim 49, wherein after determining a set of cyclic shift sequences, the method further comprises: and performing the same cyclic shift on a transform domain on each sequence in the determined cyclic shift sequence group to obtain other cyclic shift sequence groups.

54. An apparatus for processing sequences in a communication system, the apparatus comprising:

55. A method for sequence allocation in a communication system, the method comprising:

the sequence groups are allocated to cells/users/channels.