CN101179819A - Method, system and device for sequence allocation in multi-cell system - Google Patents

Abstract

The invention provides a sequence distribution method, system and devices in a multi-cell system. The method includes: different cells are distributed with different sequence groups by a network side, and the sequences in the sequence groups are determined according to a time-frequency resource way of bearing sequences which is supported by the system. The technical proposal in the invention leads to a good correlation of sequences between groups ,and to guarantee that the occupied time-frequency resources of the sequence modulation signals in different cells are not total identical, and to reduce interference between cells.

Description

Method, system and device for sequence allocation in multi-cell system

technical field

The present invention relates to the communication field, in particular to a method, system and device for sequence allocation in a multi-cell system.

Background technique

In recent years, in communication, constant amplitude zero autocorrelation (CAZAC, constant amplitude zero auto-correlate) sequence has gradually received attention. The characteristics of this sequence are as follows:

The modulus of the amplitude is a constant value, for example, it can be normalized to 1;

■Zero-period autocorrelation, except for the maximum correlation value with itself, other cyclic shift autocorrelation values of the sequence itself are zero.

Due to its above-mentioned properties, after Fourier transform, its sequence in the frequency domain is also a CAZAC sequence, that is, it also has constant amplitude and zero autocorrelation characteristics in the frequency domain.

In communication systems, signals carrying CAZAC sequences are generally widely used. For example, in a single-carrier frequency-division multiple access (SC-FDMA) system, within a symbol time, the elements of the CAZAC sequence are transmitted on multiple subcarriers in the order of subcarrier numbers, and the signal transmitted on each subcarrier is a CAZAC sequence If the sequence of the transmitted signal is known, the receiver can use the received signal to estimate the channel. Since the CAZAC sequence has constant amplitude in both the time domain and the frequency domain, the peak-to-average ratio of the waveform in the time domain is small, which is easy for the transmitter to transmit. At the same time, since the transmitted signal has the same amplitude on each subcarrier in the frequency domain, the receiver can fairly estimate the channel fading on each subcarrier, and will not affect the estimation because the signal amplitude on a subcarrier is relatively small performance.

There are many ways to generate sequences with the above characteristics. The more common one is called Zadoff-Chu sequence, which is generated as follows:

${\mathrm{<span\; class="notranslate">\; a</span>}}_{\mathrm{<span\; class="notranslate">\; r</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; W</span>}}_{\mathrm{<span\; class="notranslate">\; N</span>}}^{\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; N</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; qn</span>}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0,1</span>}<span\; class="notranslate">\; ,</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; N</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>$

a _r (.) means the sequence generated by r, n means the nth element of the sequence, N means the length of the sequence, where W _N =exp(±j2πr/N), r is the A prime number, q is any integer.

For ease of description and illustration below, formula (1) can be expressed as:

In the above formula, when different r values are taken, different sequences are obtained. For two different r values, such as r=u and r=v, when the absolute value of uv is relatively prime to N, the cross-correlation properties of the two sequences are very good, that is to say, all cyclic shifts of the two sequences The correlation values of the bits are all low. Especially when N itself is a prime number, r=1, 2, . For example, in the above formula, when N is a prime number, the absolute value of the cross-correlation of any two generated sequences is

More generally, there is the GCL sequence (Generalized Chirplike Sequence), which can also generate several sets of CAZAC sequences with good cross-correlation properties.

The GCL sequence is represented as follows:

c(n)=a(n)b(nmodm), n=0, 1,..., N-1. (2)

Wherein N=sm ² , s and m are both positive integers, {b(n)} is a "modulation" sequence, and its m elements are all complex numbers with a modulus of 1, such as a DFT sequence, $b_i\left(\mathrm{no}\right)=W_m^{\mathrm{in}},i,\mathrm{no}=\mathrm{0,1},...,m-1.$ And {a(n)} in (2) is a special "carrier" sequence, which is the Zadoff-Chu sequence defined in (1) above.

{b(n)} can also be a Hadarmard sequence, which is the row of the Hadamard matrix. The Hadamard matrix H _m of order m is a matrix of order m×m, and the elements of the matrix are composed of 1 and -1, satisfying H _m H _m ^T =mI. where I is the identity matrix and T represents the transpose of the matrix. For m=2 ⁿ , n is a positive integer, then the Hadamard sequence is:

${\mathrm{<span\; class="notranslate">\; b</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>}^{\underset{\mathrm{<span\; class="notranslate">\; l</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0</span>}}{\overset{\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; i</span>}}_{\mathrm{<span\; class="notranslate">\; l</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; l</span>}}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 0,1</span>}<span\; class="notranslate">\; ,</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>$

Wherein, i _l , n _l is the lth bit of the m-bit long binary representation of i, n.

In communication, not only the signals of the own cell, but also the interference between signals transmitted by different cells should be considered. When a cell allocates a CAZAC sequence to modulate transmission, another cell needs to allocate another CAZAC sequence with good cross-correlation characteristics. For example, when N is a prime number, different cells are assigned different r values to generate their respective CAZAC sequences. .

The modulated signal transmitted by a cell may also use CAZAC sequence fragments, or cyclically repeat, more generally, various combinations of various fragments, which can also retain the characteristics of the CAZAC sequence. Especially when the number of subcarriers carrying CAZAC sequences in a cell is not a prime number, or each cell in a cellular system needs to use a longer CAZAC sequence to obtain more different CAZAC sequences, the sequence fragment can be used Or the combination of fragments forms the sequence to be transmitted.

When signals of CAZAC sequences transmitted by different cells occupy exactly the same time-frequency resource, by determining different sequences for different cells, the interference between signals can be relatively small. As shown in FIG. 1 , time-frequency resources of sequences carried by different cells overlap, and each cell uses sequences of the same length for transmission. The CAZAC sequences or CAZAC sequence fragments of the two cells, or a combination of fragments, can be obtained through two different CAZAC sequences of the same length. For example, two different CAZAC sequences of length N, that is, r=u, r=v, u and v are not equal, can each arbitrarily intercept a sequence of length L for transmission, where L is a constant less than or equal to N. Since segments of two sequences with good cross-correlation also have good cross-correlation, the interference between different cells is relatively small.

When the modulated CAZAC sequence signals occupy different time-frequency resources, there will be mutual interference. As shown in FIG. 2 , part of the time-frequency resources of signals transmitted by different cells overlap, and each cell uses sequences of different lengths for transmission. In Fig. 2, the transmitting signal of one cell occupies a bandwidth of 1.25 MHz, and the other cell occupies a bandwidth of 5 MHz to transmit a signal modulated by CAZAC, and the time-frequency resources of the two parts are partially overlapped. If it is assumed that there are 37 subcarriers carrying CAZAC sequences in the 1.25MHZ bandwidth, and there are 150 subcarriers with the same subcarrier spacing in 5MHZ, it is obvious that the lengths of the CAZAC sequences that need to be determined by the two cells are different. At this time It will happen that the above two fragments of the long CAZAC sequence and the fragment of the short CAZAC sequence interfere with each other.

At the same time, when allocating the sequences of a cell, the surrounding cells may be signals of CAZAC sequences with a bandwidth of 1.25MHz or signals with a bandwidth of 5MHz. Therefore, the allocation of sequences can take into account that no matter how wide the signals of the surrounding cells are, mutual The correlation is small. No matter how many cells are around, the resource occupation mode supported by the system is limited, so that reasonable sequence allocation and planning can be performed.

A cell's signal modulating the CAZAC sequence may also occupy a part of subcarriers in a certain bandwidth, for example, only occupy subcarriers sampled at equal intervals. In this case, the correlation with surrounding cell signals also needs to be considered. As shown in Figure 3, this situation is reflected. FIG. 3 shows that the time-frequency resources of signals transmitted by different cells are partially overlapped, and each cell transmits using a sequence of the same length. In FIG. 3 , a cell transmits signals occupying all subcarriers within a 5MHz bandwidth, and another cell transmits signals occupying even subcarriers in a 10MHz bandwidth.

Of course, the two resource occupation modes shown in Figure 2 and Figure 3 above may occur at different times, that is, the resource occupation modes of the two cells at a certain moment are as shown in Figure 2, and the resource occupation modes of the two cells at the next moment are as follows Figure 3 shows. For the occupation of the above three resource transmission sequences, fragments of different CAZAC sequences will interfere with each other at each moment, so it is better to ensure the correlation between them by assigning sequences.

The situation that the modulated signals for transmitting CAZAC sequences occupy different time-frequency resources often occurs in SC-FDMA systems. When the terminal devices in the system have different scheduled transmission bandwidths, each terminal transmits signals within its own scheduling bandwidth, which may occupy all subcarriers of the scheduling bandwidth for transmission, or may occupy equally spaced subcarriers for transmission. However, the ways in which sequences of different cells occupy time-frequency resources are not always the same at all times, so there will be a problem of correlation of segments of different CAZAC sequences. Therefore, the sequence allocated to each cell must be obtained after considering various possible interference conditions around it.

In the prior art, it may be required that the time-frequency resources allocated by all cells to carry CAZAC sequences are always the same, that is, the time-frequency resources for which a cell modulates a CAZAC sequence signal, and the time-frequency resources for a CAZAC sequence signal modulated by another cell must completely overlap, so that different CAZAC sequences of equal length can be allocated to different cells. Of course, the truncation operation can also be performed, because the same time-frequency resources are occupied, and the good correlation between the sequences ensures the good correlation of the transmitted signals.

However, the above solution can only support the allocation of fixed CAZAC sequence resources, and the time-frequency resources occupied by the CAZAC sequences of all cells can only be the same at any time, and resources cannot be effectively used for each cell.

Contents of the invention

In view of this, embodiments of the present invention provide a method, system and device for sequence allocation in a multi-cell system, which are used to reduce interference between cells when the time-frequency resources occupied by sequence-modulated signals of different cells are different.

An embodiment of the present invention provides a method for allocating sequences on the network side in a multi-cell system. The method includes: the network side allocates different sequence groups for different cells, and the sequences in the sequence groups are based on the time-frequency resources of the bearer sequences supported by the system. way to determine.

The embodiment of the present invention also provides a method for determining and sending a sequence by a terminal in a multi-cell system, the method including:

The user terminal in the cell determines the sequence group assigned to the cell by the network side according to the information of the cell;

The user terminal determines the sequence to be sent from the above sequence group according to the time-frequency resource mode occupied by the bearer sequence.

The embodiment of the present invention also provides a method for allocating sequences in a multi-cell system, the method comprising:

The network side allocates different sequence groups for different cells, and the sequences in the sequence group are determined according to the time-frequency resource mode of the bearer sequences supported by the system;

The user terminal in the cell determines the sequence group assigned to the cell by the network side according to the information of the cell;

The user terminal determines the sequence to be sent from the sequence group according to the time-frequency resources occupied by the bearer sequence.

The embodiment of the present invention also provides a multi-cell allocation sequence system, the system includes:

The sequence allocation unit is used to allocate different sequence groups for different cells, and the sequences in the group are determined according to the time-frequency resource mode of the bearer sequences supported by the system;

A cell sequence determination unit, configured to determine the sequence group used according to the cell information;

A time-frequency resource sequence determining unit, configured to determine the sequence to be generated from the above sequence group according to the time-frequency resource occupation mode;

a sequence generating unit for generating the sequence; and

The transmitting unit is configured to transmit the sequence on the corresponding time-frequency resource.

The embodiment of the present invention also provides a device on the wireless communication network side, which is used to allocate sequences to different cells. The device includes a sequence allocation unit, which is used to allocate different sequence groups to different cells. The resource mode determines the sequences within the sequence group.

The embodiment of the present invention also provides a wireless communication terminal for determining and sending a sequence, and the terminal includes:

A cell sequence determination unit, configured to determine the sequence group used according to the cell information;

A time-frequency resource sequence determining unit, configured to determine the sequence to be generated from the above sequence group according to the time-frequency resource occupation mode;

a sequence generating unit for generating the sequence; and

The transmitting unit is configured to transmit the sequence on the corresponding time-frequency resource.

The technical solution provided by the embodiment of the present invention allocates different sequence groups for different cells through the network side, and the sequences in the sequence groups are determined according to the time-frequency resource mode of the bearing sequence supported by the system, so that the sequences between groups have good correlation , to ensure that when the time-frequency resources occupied by signals modulated by different cell sequences are not exactly the same, the interference between cells is relatively small.

Description of drawings

FIG. 1 is a schematic diagram of overlapping time-frequency resources of different cells and using sequences of the same length in the prior art;

Fig. 2 is a schematic diagram of overlapping time-frequency resources in different cells and using sequences of different lengths in the prior art;

FIG. 3 is a schematic diagram of sequences of the same length in which some time-frequency resources of different cells overlap in the prior art;

FIG. 4 is a schematic flowchart of a sequence allocation method in a multi-cell system according to the present invention;

Fig. 5 is a schematic diagram of the correlation between short sequences and long sequence fragments in the specific embodiment of the present invention;

6 is a schematic diagram of the correlation between sequence fragments and sequence sampling in a specific embodiment of the present invention;

Fig. 7 is a schematic structural diagram of a specific embodiment of the system of the present invention.

Detailed ways

The specific implementation manners of the present invention will be described below in conjunction with the accompanying drawings.

As shown in Figure 4, it is a schematic flow chart of the specific implementation of the sequence allocation method in the multi-cell system. As can be seen from the figure, it mainly includes the following contents:

Network side:

Step 401, the network side allocates different sequence groups for different cells, and the sequences in the sequence group are determined according to the time-frequency resource mode of the bearer sequences supported by the system.

For the different time-frequency resources that may be occupied by the sequences to be transmitted, the scheme of the present invention provides multiple sequences while ensuring that these sequences have the following characteristics:

When the corresponding time-frequency resources are occupied, the correlation values between them are relatively large.

These sequences that meet the above characteristics are grouped into one group, and different groups are constructed according to the above principles to ensure that the correlation value of the sequences between different groups is relatively small after occupying their corresponding time-frequency resources for modulation.

Through the above solution, the devices in the wireless communication system can generate such multiple sets of sequences, and determine the sequence groups according to the information of the cell.

For example, according to the cell ID, a cell-specific pseudo-random sequence is generated, and the sequence group for transmission used by the user in each transmission time is determined by the pseudo-random sequence. The generation of the pseudo-random sequence may adopt a shift register generation method, such as a commonly used m-sequence or Gold sequence. The k states of the shift register (a ₁ , a ₂ ,..., a _k ) correspond to the number of the sequence group. Every time the shift register rotates, the state of the register changes to generate a new state, corresponding to the next time sequence group.

These pseudo-random sequences are different and specific to each cell, and of course they can also be specific to a cell group under some conditions. For example, three sectors under a Node B can use the same pseudo-random number to select sequence groups, and different sectors can obtain orthogonalized transmission signals through different time shifts of the selected sequences. Different pseudo-random sequences are used between different Node Bs.

Terminal side:

Step 402, the user terminal determines the sequence group allocated to the cell by the network side according to the cell information, and determines the sequence to be transmitted from the sequence group according to the time-frequency resource mode occupied by the sequence carried by the user terminal.

After the group is determined, the sequence in the group is determined according to the time-frequency resources occupied by users in the cell for transmission, and the sequence is generated.

Step 403, the user terminal in the cell sends the sequence generated above.

In the above solution, the network side generates different sequence groups, and then allocates one or more sequence groups to different cells, and the user terminals in each cell are assigned according to the identification (ID) of the cell or the sequence group assigned to the cell. The identification of the group determines the sequence in the corresponding sequence group according to the occupation mode of the respective time-frequency resources, and then generates and sends the sequence. The above-mentioned network side generates different sequence groups according to the correlation between the sequences, so that the cross-correlation value of the sequences in different groups can be larger, while the cross-correlation value of the sequences between different groups is relatively small. Therefore, when different cells use different sequence groups, the interference between cells is guaranteed to be small.

The sequences used in the specific embodiments of the present invention have CAZAC characteristics, such as Zadoff-Chu sequences and GCL sequences.

According to the generation expression of the Zadoff-Chu sequence, sequences of different lengths are controlled by the parameter N, and the generation of different sequences of the same length is controlled by the parameter r, and q corresponds to the cyclic shift of Zadoff-Chu, which can also be considered to correspond to different the sequence of.

The following are specific examples of constructing sequence groups in different time-frequency resource occupation situations:

Specific embodiment one

In the environment shown in Figure 2, assuming that there are a total of 150 available subcarriers in the 5MHz bandwidth, the system supports 5MHz divided into four 1.25MHz CAZAC sequence transmission bandwidths, or only one 5MHz transmission bandwidth. Two resource occupation methods , then for the 5MHz transmission bandwidth, the length of the CAZAC sequence occupying all 150 subcarriers is the prime number N=151, which is intercepted to 150, and the prime number N=37 is taken for the 1.25MHz transmission bandwidth and the number of subcarriers is 37. The CAZAC sequence is constructed according to the above-mentioned time-frequency resource occupation manner, for example, a Zadoff-Chu sequence may be used. According to the resource occupation mode supported by the system, there are two sequences in the same group, corresponding to the two cases of occupying 1.25MHz and 5MHz time-frequency resources, that is to say, the two Zadoff-Chu sequences in the same group are:

37 long Zadoff-Chu sequence fragments, take r=k, where k=1, 2, ..., 36;

And the 150-long Zadoff-Chu sequence fragment, that is, the original 151-long Zadoff-Chu sequence fragment, take r=4*k, k=1, 2,..., 150, when k>38, r has been It is greater than 150. According to the generation method of Zadoff-Chu, the actual calculation is equivalent to the calculation of r modulo N. The long sequence can generate 150 sequences, but since there are only 36 sequences available for the short sequence, after the intersection of the two cases, there are only 36. Of course, short sequences can also be allowed to be used repeatedly, and there are 150 groups at this time.

Two sequences with the same k are taken as a group, and different k constitute different CAZAC sequence groups.

In addition, if the two CAZAC sequences in the same group are carried in the frequency domain, different CAZAC sequences can also be generated by cyclic shifting on the time domain waveform obtained by discrete inverse Fourier transform, and allocated as needed.

The above cyclic shift is to copy the latter part of the original array to the front of the array. For example, if the original CAZAC sequence is transformed into the time domain to form a time domain waveform of length s {a ₀ , a ₁ , a ₂ ,..., a _s-1 }, after cyclic shift, becomes {a _p+1 , a _p+2 ,..., a _s-1 ,..., a ₀ , a ₁ ,..., a _p }, where p can be an integer between 0, 1, ..., s-1.

When the sequence generated by the cyclic shift of a sequence is allocated to different cells, it can be regarded as multiple sequences, so that different shifts also correspond to different sequence groups.

The four 1.25MHz transmission bandwidths occupy the same bandwidth, but the positions of frequency resource blocks are different. Therefore, it can also be considered as four different time-frequency resource occupation methods, corresponding to different CAZAC sequences, such a There are 5 sequences in the CAZAC sequence group. The composition of these five sequences can be carried out according to the following rules:

r _i =a _i ·k+b _i , _ri =a _i ·k+b _i , where a _i , i=1, 2, 3, and 4 correspond to four 1.25M bandwidths, and i distinguishes different time-frequency resources. Four 1.25M bandwidths can choose a ₁ = 1, a ₂ = 2, a ₃ = 3, a ₄ = 5, and a ₅ = 4 can be selected for 5MHz bandwidth, and all b _i are equal to zero, that is, b ₁ =0, b ₂ =0, b ₃ =0, b ₄ =0, b ₅ =0

When the four sequences used in the four 1.25MHz transmission bandwidths are completely the same, it becomes a case where there are two sequences in one CAZAC sequence group.

Specific embodiment two

In the environment shown in Figure 3, the system supports two resource occupation methods: the 10MHz bandwidth is divided into two 5MHz bandwidths, and the time-frequency resources occupied by the CAZAC sequence signal in the 5MHz bandwidth are all 150 subcarriers, and the CAZAC sequence of the 10MHz bandwidth The time-frequency resources occupied by the signal are 150 or 151 subcarriers extracted from every other subcarrier in the 301 subcarriers. At this time, the CAZAC sequence in the same group takes Zadoff-Chu as an example, which is:

Take N=151, r=k, cut into 150, and generate a Zadoff-Chu sequence corresponding to a 5MHz bandwidth;

Take N=151, r=4k, truncate to 150, and generate a Zadoff-Chu sequence corresponding to a bandwidth of 10MHz.

The value of k above can be from 1 to 150.

Therefore, there are two CAZAC sequences in a group. Of course, more sequences can be generated from these two CAZAC sequences by cyclic shifting. The cyclic shifting can be regarded as a class. Only different k can correspond to different group.

When CAZAC sequences of the same group are generated by Zadoff-Chu sequences, r=a*k is selected, where a is a factor for different time-frequency resource allocation methods and is an integer. CAZAC sequences with the same k are one group, and CAZAC sequences with different k are different groups. The choice of a needs to satisfy $\frac{r_i{\&Center\; Dot;g}_i^2}{r_j{\&Center\; Dot;g}_j^2}=\frac{b_j}{b_i},$ Among them, g _{i and} g _j represent two resource occupation modes, each sub-carrier is extracted at intervals of g _i and g _j sub-carriers in frequency, and b _j /b _i represents the ratio of the actual occupied bandwidth under the two resource occupation modes, usually It may specifically be the ratio of the number of subcarriers carrying the sequence. That is to say, the numbers of the sequences corresponding to the two resources are inversely proportional to the square of the sampling interval g.

Generally, according to the well-known CAZAC sequence theory, a CAZAC sequence a i of length M, _i =0,...,M-1, if the sampling interval is s, and M and s are mutually prime, then a _{(si ) mod M} , i=0, 1, . . . , M-1 is a CAZAC sequence. Therefore, the two sequences may respectively correspond to two sequences in a group with different sampling intervals of time-frequency resources. The above Zadoff-Chu sequence is just one example.

Specific embodiment three

Since each cell knows the possible resource occupation mode in the system at a certain moment, according to the selection requirement of a above, as long as each cell is satisfied with the sequence selection according to its own time-frequency resources, there is no need to distinguish what the surrounding cells are The resource occupation mode can ensure that the interference between surrounding cells is relatively small. For example, the current system supports three ways of resource occupation at a certain moment, which are the subcarriers shown in Figure 2 and Figure 3 that occupy a bandwidth of 1.25MHz for sequence transmission, subcarriers that occupy a bandwidth of 5M for sequence transmission, and subcarriers that occupy a bandwidth of 10M for sequence transmission. The subcarriers are extracted one by one in the bandwidth. Therefore, when assigning sequence groups to each cell:

The way of subcarriers occupying 1.25MHz bandwidth takes N=37, and r=k can be taken, wherein the maximum possible k is 36; compared with the other two resource ways, this way satisfies $\frac{r_i{\&Center\; Dot;g}_i^2}{r_j{\&Center\; Dot;g}_j^2}=\frac{b_j}{b_i}$ When the selection of a, it will be obtained: the sub-carrier mode occupying 5M bandwidth needs to take r=4k, where k is at most 150; r=16k, where k is 150 at most.

当小区A分配的序列组为k＝2，并且序列发射占用5M带宽的子载波，它只能由N＝151生成r＝8的序列，加以必要的截断后进行发射；如果序列发射占用1.25M带宽的子载波，则由N＝37生成r＝2的序列进行发射；如果序列发射占用10M带宽中隔一个抽一个的子载波，则由N＝151生成r＝32的序列中进行发射。其它小区也采用相同的序列生成方式，只不过每个小区分配的序列组k不同，并且各自的资源占用方式也未必相同，所以可能会出现两个小区资源占用方式不同，但是r相同，使用同一个序列，但是由于资源不同，并且是满足了上述要求的，既使在重叠的资源上也不会有很强的干扰的。Each cell determines the sequence within the allocated sequence group k according to the resource occupation method assigned to it. The interference in each resource mode needs to be considered, for example, assuming that the default sequence relationship of each cell is

When the sequence group allocated by cell A is k=2, and the sequence transmission occupies a subcarrier with a bandwidth of 5M, it can only generate a sequence of r=8 from N=151, and transmit after necessary truncation; if the sequence transmission occupies 1.25M If the subcarriers of the bandwidth are subcarriers, N=37 generates a sequence of r=2 for transmission; if the sequence transmission occupies every other subcarrier in the 10M bandwidth, then N=151 generates a sequence of r=32 for transmission. Other cells also use the same sequence generation method, but the sequence group k assigned by each cell is different, and their respective resource occupation methods may not be the same, so there may be two cells with different resource occupation methods, but the r is the same, using the same A sequence, but because the resources are different and the above requirements are met, there will be no strong interference even on overlapping resources.

In the various resource occupation modes supported by the system, the default sequence relationship of each cell can also be other relationships that meet the requirements of selection a, for example

Through simulation verification, the sequences in different sequence groups designed by the present invention have little correlation when occupying corresponding time-frequency resources, and the correlation between sequences in the same group is relatively large. Therefore, for the planning of the cellular system, as long as the sequence groups determined by different cells are different, the cross-correlation and interference can be guaranteed to be small. For the same cell, one or more sets of sequences can be determined according to the number of sequences required.

When there are multiple resource occupation modes, there are more than two sequences in each sequence group. For example, the resource occupation mode of two cells at a certain moment is shown in Figure 2, and the resource occupation mode at the next moment is as follows The situation shown in Fig. 3 and so on.

)。而N为37的序列中的一部分片段与N为151的序列中的一部分片段的相关性，与确定序列的r值有关。可以看到当k＝1时，N为37的第1个序列与N为151的第4个序列就具有较高的互相关值，最大处达28左右，因为它们实际上是属于同一组的序列，而与N为151的第2个序列的互相关值就比较低，大约在11左右，因为这个序列实际上是属于k＝2组中的序列。这就说明了不同组中的序列之间的相关性较好。Figure 5 verifies the correlation between the two groups with k=1 and k=2. Where (N, r) represents the rth sequence in the length N sequence. It can be seen that the sequence of N is 37, its autocorrelation (except for the correlation value of 37 at zero shift, the correlation value at other shifts is 0) and cross-correlation are very good (correlation at any shift value is

). The correlation between a part of the fragments in the sequence where N is 37 and a part of the fragments in the sequence where N is 151 is related to determining the r value of the sequence. It can be seen that when k=1, the first sequence with N of 37 and the fourth sequence with N of 151 have a high cross-correlation value, with a maximum of about 28, because they actually belong to the same group sequence, and the cross-correlation value with the second sequence whose N is 151 is relatively low, about 11, because this sequence actually belongs to the sequence in the k=2 group. This indicates a better correlation between sequences in different groups.

)。而N为151的序列中的长为75的片段与进行抽样后组合的片段的相关性，与确定序列的r值有关。可以看到N为151的第1个序列与N为151的第4个序列就具有较高的互相关值，会在两个移位处出现大约50的相关峰值，而与N为151的第2个序列的互相关值就比较低，在所有移位处都低于

，这就说明了不同组中的序列之间的相关性较好。Likewise, Figure 6 verifies the correlation between the two groups of k=1 and k=2. Where (N, r) represents the rth sequence in the length N sequence. It can be seen that the sequence of N is 151, its autocorrelation (except for the correlation value of 151 at zero shift, the correlation value at other shifts is 0) and cross correlation are very good (correlation at any shift value is

). However, the correlation between the segment with a length of 75 in the sequence where N is 151 and the segment combined after sampling is related to determining the r value of the sequence. It can be seen that the first sequence with N of 151 and the fourth sequence with N of 151 have a higher cross-correlation value, and there will be a correlation peak of about 50 at the two shifts, and the first sequence with N of 151 The cross-correlation value of the two sequences is relatively low, lower than

, which shows that the correlation between sequences in different groups is better.

Specific embodiment four

When there are multiple transmission signals with different bandwidths in the system, the sequences used by the different bandwidths in a sequence group can be constructed according to the following rules. The method for this construction is as follows:

Two CAZAC sequences, namely a ₀ , a ₁ , ..., a _M-1 of length M and b ₀ , b ₁ , ..., b _N-1 of length N, use M length and N length Two CAZAC sequences, constructing an MN-long CAZAC sequence c _i =a _imodM ·b _imodN , i=0, 1, . . . , MN-1. When M and N are mutually prime, the sequence constructed in this way still satisfies the CAZAC property. Sequence b _i corresponds to a manner of occupying time-frequency resources of N subcarriers, and sequence c _i corresponds to a manner of occupying time-frequency resources of M*N subcarriers. Sequences b _i , _ci belong to the same group. Its specific application is shown in Figure 2. The 1.25MHz bandwidth of one cell uses a Zadoff-Chu sequence b _i with a sequence length of 37, while the other cell uses a 148-long sequence constructed by a 37-long sequence b _i and a 4-length Zadoff-Chu sequence a _i (In order to match the number of subcarriers, there may be some necessary sequence truncation or padding). If two cells use the same sequence corresponding to b _i , or a sequence within a group, the correlation value is large. If two cells use different sequences corresponding to b _i , or sequences of different groups, the correlation value is small.

Especially for the Zadoff-Chu sequence, it can be proved that if M and N are mutually prime, two Zadoff-Chu sequences of length M and N, the sequence obtained by the above operation is a Zadoff-Chu sequence of length MN. The proof is as follows:

${\mathrm{<span\; class="notranslate">\; a</span>}}_{\mathrm{<span\; class="notranslate">\; m</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span>\frac{\mathrm{<span\; class="notranslate">\; 2</span>}\mathrm{<span\; class="notranslate">\; \&pi;</span>}{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; \&Center\; Dot;</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; m</span>}}<span\; class="notranslate">\; ]</span>$

${\mathrm{<span\; class="notranslate">\; b</span>}}_{\mathrm{<span\; class="notranslate">\; no</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span>\frac{\mathrm{<span\; class="notranslate">\; 2</span>}\mathrm{<span\; class="notranslate">\; \&pi;</span>}{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; \&Center\; Dot;</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; N</span>}}<span\; class="notranslate">\; ]</span>$

${\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; a</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; m</span>}}<span\; class="notranslate">\; \&Center\; Dot;</span>{\mathrm{<span\; class="notranslate">\; b</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; N</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span>\frac{\mathrm{<span\; class="notranslate">\; 2</span>}\mathrm{<span\; class="notranslate">\; \&pi;j</span>}<span\; class="notranslate">\; \&Center\; Dot;</span><span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; N</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; \}</span>}{\mathrm{<span\; class="notranslate">\; MN</span>}}<span\; class="notranslate">\; ]</span>$

$<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span>\frac{\mathrm{<span\; class="notranslate">\; 2</span>}\mathrm{<span\; class="notranslate">\; \&pi;j</span>}<span\; class="notranslate">\; \&CenterDot;</span><span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; Nr</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Mr.</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; N</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; \}</span>}{\mathrm{<span\; class="notranslate">\; MN</span>}}<span\; class="notranslate">\; ]</span>$

$<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span>\frac{\mathrm{<span\; class="notranslate">\; 2</span>}\mathrm{<span\; class="notranslate">\; \&pi;j</span>}<span\; class="notranslate">\; \&CenterDot;</span><span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; Nr</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Mr.</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; N</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; \}</span>}{\mathrm{<span\; class="notranslate">\; MN</span>}}<span\; class="notranslate">\; ]</span>$

$<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span>\frac{\mathrm{<span\; class="notranslate">\; 2</span>}\mathrm{<span\; class="notranslate">\; \&pi;j</span>}<span\; class="notranslate">\; \&Center\; Dot;</span><span\; class="notranslate">\; \{</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; Nr</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Mr.</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; )</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; MN</span>}\mathrm{<span\; class="notranslate">\; mod</span>}\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; \}</span>}{\mathrm{<span\; class="notranslate">\; MN</span>}}<span\; class="notranslate">\; ]</span>$

The above formula is true when both M and N are odd numbers, and it is also true when one is even and the other is odd, and there is a difference of one cyclic shift. Since r ₁ and M are coprime, r ₂ and N are coprime, so Nr ₁ +Mr ₂ and MN are coprime, so the sequence is a Zadoff-Chu sequence.

In general, for a Zadoff-Chu sequence of length M, and $m=\underset{i}{\mathrm{\&Pi;}}{p}_i^{k_i},$ p _i are distinct prime factors. Then the sequence is obtained by multiplying several Zadoff-Chu sequences whose length is p _i ^k _i . If a long sequence c is obtained by the product of a short sequence a and another short sequence b, the long sequence c and b are regarded as two sequences corresponding to different time-frequency resources in a group. Of course, the long sequence c and b can also be combined a is used as two sequences corresponding to different time-frequency resources in a group.

Various methods for constructing sequence groups for different time-frequency resource occupancy situations in the above four embodiments. After the sequence group is constructed, one or more different sequence groups are allocated according to the cell identifier. Assignment can usually be made by means of randomized assignment. For example, according to the cell identifier, a cell-specific pseudo-random sequence is generated, that is, the pseudo-random sequence of each cell is different, and the sequence group used by the user for each transmission time is determined by this pseudo-random sequence. The generation of the pseudo-random sequence can adopt the shift register generation method, such as the m-sequence or Gold sequence in the commonly used binary field or multi-dimensional field GF(q), and different cells use different initial states of the register, or different sequence of shifts. The k states of the shift register (a ₁ , a ₂ ,..., a _k ) correspond to the number of the sequence group. Every time the shift register rotates, the state of the register changes to generate a new state, corresponding to the next time sequence group.

These pseudo-random sequences are different and specific to each cell, and of course they can also be specific to a cell group under some conditions. For example, three sectors under a Node B, as a group, they can use the same pseudo-random number to select the sequence group, and different sectors can obtain orthogonal transmission through different time shifts of the selected sequence Signal. Different groups, that is, different NodeBs use different pseudo-random sequences.

According to the construction method of the sequence group and the allocation method of the sequence group introduced above, the following examples illustrate:

For a 5MHz bandwidth system, its frequency band is evenly divided into 25 basic units, and the scheduling bandwidth of the pilot signal can be 1 basic unit, 2 basic units, ..., 25 basic units, So corresponding to the combination of these basic frequency band units, there are 25 sequences of lengths existing in the system. If l ₁ , l ₂ , ..., l ₂₅ represent the respective lengths of these sequences, and the number of sequences under each length l _i is represented by N _i , then the sequences under different length l _i can be numbered as r _{i, 1} , ri _{, 2} , ..., ri _{, Ni} . In this way, a sequence group contains 25 sequences, expressed as {ri _{, kmodNi} |i=1, 2, . . . , 25}, where k is the number of the sequence group. If a cell-specific randomization method is used to allocate sequence groups, the current random number is generated according to the number of the time slot where the current pilot is located, user ID and other information to correspond to the number k of the sequence group, and then according to The frequency bandwidth determines the length of the sequence used, and then use {r _{i, kmodNi} |i=1, 2, ..., 25} to get the sequence number of the selected length, and then generate or read the sequence emission.

In the above method, the sequence group is constructed according to a certain rule according to the occupancy modes of different pilot resources existing in the system. This rule applies to all cells, and can be called a common grouping method of a cell, but the use of the sequence is to select the sequence group through the cell-specific random number. Jumps occur on slots, so a certain short sequence will not always appear at the same time as a certain long sequence of an adjacent cell. In this way, from a long-term perspective, the interference is relatively random, which avoids the situation that there is always strong interference between two cells.

The above-mentioned method embodiment can be realized through the communication system shown in FIG. 7, and the system includes:

The sequence allocating unit 701 is configured to allocate different sequence groups for different cells, and determine the sequences in the sequence groups according to the time-frequency resource modes of the bearer sequences supported by the system.

A cell sequence determining unit 702, configured to determine an available sequence group according to cell information.

The time-frequency resource sequence determination unit 703 is configured to determine the sequence to be generated from the sequence group determined by the cell sequence determination unit 702 according to the time-frequency resource occupation mode.

The sequence generation unit 704 is configured to generate the sequence determined by the time-frequency resource sequence determination unit 703 .

The transmitting unit 705 is configured to transmit the sequence generated by the sequence generating unit 704 on a corresponding time-frequency resource.

The above system includes a wireless communication network side device and a wireless communication terminal, wherein,

The device on the wireless communication network side includes a sequence allocation unit 701, configured to allocate different sequence groups to different cells, and determine the sequences in the sequence group according to the time-frequency resource mode of the bearer sequences supported by the system.

The wireless communication terminal is used to determine and send a sequence, and the device includes: a cell sequence determination unit 702 , a time-frequency resource sequence determination unit 703 , a sequence generation unit 704 and a transmission unit 705 .

The protection scope of the present invention is based on the protection scope of the claims, and various changes and modifications made by those skilled in the art to the present invention without departing from the spirit and scope of the present invention are all within the protection scope of the claims of the present invention.

Claims (16)

1. the method for network side assigned sequence in the multi-cell system is characterized in that,

Network side is that different districts distributes different sequence set, and the sequence in the described sequence set is determined according to the running time-frequency resource mode of the carrying sequence that system supports.

2. the method for claim 1 is characterized in that,

Network side is that different districts distributes different sequence set in pseudorandom mode.

3. the method for claim 1 is characterized in that,

The sequence set that network side distributes the described sub-district of current time with the specific pseudo random sequence in sub-district.

4. method as claimed in claim 3 is characterized in that, the specific pseudo random sequence in described sub-district is the specific pseudo random sequence of cell set.

5. the method for claim 1 is characterized in that, the running time-frequency resource mode of the carrying sequence of described system support comprises: the mode that different bandwidth, different frequency sub-carrier extract at interval or the position of different time.

6. the method for claim 1 is characterized in that, the sequence in the described sequence set is normal amplitude zero an autocorrelation performance CAZAC sequence, or makes up the sequence that generates by the CAZAC sequence fragment.

7. the method for claim 1 is characterized in that, the sequence in the described sequence set generates by pricking doffer-first Zadoff-Chu sequence, meets following generation formula:

$a_r\left(n\right)=W_N^{n(n+N\mathrm{mod}2)/2+\mathrm{qn}},$ n＝0，1，...，N-1

a _rThe sequence that (.) expression generates with r, n represents n unit of sequence, N represents the length of sequence, wherein W _N=exp (± j2 π r/N), r is the number relatively prime with N, q is an integer arbitrarily.

8. the method for sequence is determined and sent to terminal in the multi-cell system, it is characterized in that described method comprises:

User terminal is according to the information of sub-district in the sub-district, determines that network side distributes to the sequence set of this sub-district;

Described user terminal is according to the running time-frequency resource mode that takies of carrying sequence, determines the sequence that will send in the described sequence set.

9. method as claimed in claim 8 is characterized in that, the running time-frequency resource mode of described carrying sequence comprises: the mode that different bandwidth, different frequency sub-carrier extract at interval or the position of different time.

10. method as claimed in claim 9 is characterized in that, the mode that described user terminal extracts at interval according to different frequency sub-carrier is determined the sequence that will send in the described sequence set, in the following way:

The running time-frequency resource that takies when user terminal carrying sequence be to another running time-frequency resource be spaced apart that the sampling of s obtains the time, then its corresponding sequence is to the pairing sequence a of another running time-frequency resource _i, i=0 ..., M-1 is spaced apart the sequence a that the sampling of s obtains _{(si) modM}, i=0,1 ..., M-1;

When the described sampling interval, s was inequality, square being inversely proportional to of the numbering of the sequence that described sampling obtains and sampling interval.

11. method is characterized in that as claimed in claim 8 or 9, described user terminal is according to the running time-frequency resource mode that takies of carrying sequence, determines the sequence that will send in the described sequence set, in the following way:

When user terminal carrying sequence took different running time-frequency resources, the numbering of corresponding length sequence satisfied: r _i=a _iK+b _i, the group that identical k is corresponding identical, a _i, b _iDifferent running time-frequency resources by CU determine that i distinguishes different running time-frequency resources.

12. method is characterized in that as claimed in claim 8 or 9, described user terminal is according to the running time-frequency resource mode that takies of carrying sequence, determines the sequence that will send in the described sequence set, in the following way:

When user terminal carrying sequence takies two different running time-frequency resources, the corresponding relation of length sequence satisfies: long sequence c is if the product of short sequence a and the short sequence b of another one obtains, and then will grow sequence c and lack two sequences in the sequence set that sequence b is corresponding different running time-frequency resources.

13. assigned sequence method in the multi-cell system is characterized in that,

Network side is that different districts distributes different sequence set, and the sequence in the described sequence set is determined according to the running time-frequency resource mode of the carrying sequence that system supports;

User terminal is according to the information of sub-district in the sub-district, determines that network side distributes to the sequence set of this sub-district;

Described user terminal is according to the running time-frequency resource mode that takies of carrying sequence, determines the sequence that will send in the described sequence set.

14. the system of cell allocation sequence is characterized in that more than one kind, described system comprises:

The sequence allocation unit is used to different districts to distribute different sequence set, determines sequence in the described sequence set according to the running time-frequency resource mode of the carrying sequence of system's support;

The sequence of cells determining unit is used for according to the definite sequence set of using of cell information;

Running time-frequency resource sequence determining unit is used for according to the running time-frequency resource occupancy mode, determines the sequence that will generate in the described sequence set;

Sequence generating unit is used to generate described sequence; With

Transmitter unit is used for described sequence is sent on corresponding running time-frequency resource.

15. cordless communication network side device, be used to carry out the sequence allocation of different districts, it is characterized in that, described device comprises the sequence allocation unit, be used to different districts to distribute different sequence set, determine sequence in the described sequence set according to the running time-frequency resource mode of the carrying sequence of system's support.

16. a wireless communication terminal is used for determining and sending sequence, it is characterized in that described terminal comprises:

The sequence of cells determining unit is used for according to the definite sequence set of using of cell information;

Running time-frequency resource sequence determining unit is used for according to the running time-frequency resource occupancy mode, determines the sequence that will generate in the described sequence set;

Sequence generating unit is used to generate described sequence; With

Transmitter unit is used for described sequence is sent on corresponding running time-frequency resource.

Images