WO2018201894A1

WO2018201894A1 - Generation method and detection method for secondary synchronization sequence, base station, and user equipment

Info

Publication number: WO2018201894A1
Application number: PCT/CN2018/083547
Authority: WO
Inventors: 赵铮; 达人; 任斌; 郑方政; 潘学明
Original assignee: 电信科学技术研究院有限公司
Priority date: 2017-05-05
Filing date: 2018-04-18
Publication date: 2018-11-08

Abstract

Provided in the present disclosure are a generation method and detection method for a secondary synchronization sequence, base station, and user equipment. The generation method for a secondary synchronization sequence comprises: generating a scrambling sequence for a primary synchronization signal; generating, according to predetermined primitive polynomials, m-sequences, wherein the predetermined primitive polynomials comprise at least two primitive polynomials, and an m-sequence pair consisting of m-sequences generated from any two primitive polynomials is a preferred m-sequence pair; and generating, according to the scrambling sequence of the primary synchronization signal and the m-sequences, a secondary synchronization sequence.

Description

Method for generating auxiliary synchronization sequence, detection method, base station and user equipment

Cross-reference to related applications

The present application claims the priority of Chinese Patent Application No. 2017 10313805.5 filed on May 5, 2017 in China, and claims the entire content of the priority of the Chinese Patent Application No. 201710531829.8 filed on June 28, 2017 in China. It is hereby incorporated by reference.

Technical field

The present disclosure relates to the field of communications technologies, and in particular, to a method, a detection method, a base station, and a user equipment for generating a secondary synchronization sequence.

Background technique

In LTE, the secondary synchronization sequence is generated by two 31-length m sequences, and 168 sequences can be generated, and three primary synchronization sequences are combined, and 504 different physical layer cell identifiers can be correspondingly distinguished. The advantage of using two short sequences is that more joints can be represented by joint detection of the two sequences, and the detection complexity is low. However, the detection accuracy of joint detection is low.

In addition, in the NR system, the primary and secondary synchronization sequences are all 127 long. Compared to the 63-point synchronization sequence of LTE, the synchronization sequence of NR is doubled. Furthermore, in the NR system, the synchronization sequence has a long period. Therefore, if the NR system is also combined with the synchronization signal of several cycles in the LTE system, the delay is made longer. Therefore, in order to reduce the delay of the synchronous detection, synchronous detection is required to improve the accuracy of one detection as much as possible.

Summary of the invention

The embodiments of the present disclosure provide a method for generating a secondary synchronization sequence, a detection method, a base station, and a user equipment, which are capable of generating a secondary synchronization sequence with a low cross-correlation, thereby improving the accuracy of one detection.

An embodiment of the present disclosure provides a method for generating a secondary synchronization sequence, including:

Generating a scrambling sequence of the primary synchronization signal;

Generating an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are preferred pairs of m sequences;

A secondary synchronization sequence is generated according to the scrambling code sequence of the primary synchronization signal and the m sequence.

The step of generating a scrambling code sequence of the primary synchronization signal includes:

According to the first preset formula

Calculating a first reference sequence x(h), where x(h) represents the hth element in the first reference sequence, and the value of h is an integer of 0 to N-1 in turn.

The values are in the order of 0 to N-8, and the binary consists of x(0), x(1), x(2), x(3), x(4), x(5), and x(6). The sequence is a non-zero sequence constant;

According to the first reference sequence x(h), according to the second preset formula

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

According to the third preset formula

Generating a scrambling code sequence of three primary synchronization signals having a length of a preset length, where s _i (k) represents the kth element in the scrambling sequence of the i-th primary synchronization signal, and the value of i is 0 to 0 The integer of 2, the value of k is an integer of 0 to N-1, N represents the preset length, and c _i is a preset constant.

The step of generating an m sequence according to a predetermined primitive polynomial includes:

Determining with each of the predetermined primitive polynomials g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ The formula corresponding to the original polynomial used to calculate the third reference sequence y(w):

Where n is the degree of freedom of the primitive polynomial, a ₀ = a _n =1, a ₁ ~ a _n-1 respectively take a value of 0 or 1, and the value of t is an integer of 1 to n, y ( w) represents the wth element in the third reference sequence;

Based on preset initial values and formulas corresponding to each of the primitive polynomials

Calculating the third reference sequence y(w) corresponding to each of the primitive polynomials, wherein the preset initial value is y(0) to y(n-1), and y(0) to y The binary sequence composed of (n-1) is a non-zero sequence constant, and the value of w is in turn an integer of 0 to N-1.

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Generating, according to the fourth preset formula m(w)=1-2y(w), according to the third reference sequence y(w) corresponding to each of the primitive polynomials, corresponding to each of the primitive polynomials The m sequence, where m(w) represents the wth element in an m sequence.

Wherein, when the scrambling code sequence of the primary synchronization signal is three, and the m sequence is three, the step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence, include:

According to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w), according to a fifth preset formula

Perform scrambling and cyclic shift to generate a secondary synchronization sequence S _L (r);

Wherein, the value of i is an integer of 0 to 2, the value of j is an integer of 0 to 2, and the value of c is an integer of 0 to 111, L=112*(3*i+j)+ c;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S _L (r) represents the rth element of the Lth secondary synchronization sequence.

Wherein, when the scrambling sequence of the primary synchronization signal is three and the m sequence is six, the step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence, include:

According to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w), according to the sixth preset formula

Perform scrambling and cyclic shift to generate a secondary synchronization sequence S _L (r)

Wherein, the value of i is an integer of 0 to 2, and the value of j is an integer of 0 to 5, and the value of c is an integer of 0 to 55, L=56*(6*i+j)+ c;

Wherein, when the scrambling sequence of the primary synchronization signal is three and the m sequence is two, the step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence, include:

According to the seventh predetermined formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequences m ₀ (w) and m ₁ (w)

Wherein, the value of i is an integer of 0 to 2, the value of v is an integer of 0 to 2, and the value of c is an integer of 0 to 55, L=112*(3*i+v)+ c;

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

An embodiment of the present disclosure further provides a base station, including:

a scrambling code sequence generating module, configured to generate a scrambling code sequence of the primary synchronization signal;

a first m sequence generating module, configured to generate an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and m of the m sequences generated by any two primitive polynomials Sequence pairs are preferred pairs of m sequences;

And a secondary synchronization sequence generating module, configured to generate a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence.

The scrambling code sequence generating module includes:

a first calculating unit for using the first preset formula

a second calculating unit, configured to follow the second preset formula according to the first reference sequence x(h)

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

a third calculating unit for using the third preset formula

The first m sequence generation module includes:

a fourth calculating unit, configured to: according to each of the predetermined primitive polynomials g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ , Determining a formula for calculating a third reference sequence y(w) corresponding to each of the primitive polynomials:

Wherein, n is the degree of freedom of the primitive _{_{polynomial, a 0 = a n = 1}} , a 1 ~ a n-1 , respectively, the value 0 or 1, t is an integer value of order of 1 ~ n, y ( w) represents the wth element in the third reference sequence;

a fifth calculating unit, configured to preset initial values and formulas corresponding to each of the primitive polynomials

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

a sixth calculating unit, configured to generate, according to the fourth preset formula m(w)=1-2y(w) according to the third reference sequence y(w) corresponding to each of the primitive polynomials An m-sequence corresponding to the primitive polynomial, where m(w) represents the wth element in an m-sequence.

Wherein, when the scrambling sequence of the primary synchronization signal is three and the m sequence is three, the secondary synchronization sequence generating module includes:

a first processing unit, configured to follow a fifth preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w)

Wherein, when the scrambling sequence of the primary synchronization signal is three, and the m sequence is six, the secondary synchronization sequence generating module includes:

a second processing unit, configured to follow a sixth preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w)

Wherein, when the scrambling sequence of the primary synchronization signal is three and the m sequence is two, the secondary synchronization sequence generating module includes:

a third processing unit, configured to use the seventh preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequences m ₀ (w) and m ₁ (w)

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

Embodiments of the present disclosure also provide a base station including a first memory, a first processor, and a computer program stored on the first memory and executable on the first processor; the first process The following steps are implemented when the program is executed:

Generating a scrambling sequence of the primary synchronization signal;

Embodiments of the present disclosure also provide a computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the following steps:

Generating a scrambling sequence of the primary synchronization signal;

Generating an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are m pairs of preferred pairs;

An embodiment of the present disclosure further provides a method for detecting a secondary synchronization sequence, including:

Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, wherein the secondary synchronization sequence is based on the m sequence and the scrambling sequence of the primary synchronization signal One of the generated secondary synchronization sequences generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial includes at least two primitive polynomials, and any two primitive polynomials are generated The m sequence pair formed by the m sequence is a preferred pair of m sequences;

Generating an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

Performing cyclic shift on the m sequence to generate an m sequence to be detected;

Performing correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information;

And obtaining cell identity information according to the first partial cell identity information and the second partial cell identity information.

An embodiment of the present disclosure further provides a user equipment, including:

a descrambling module, configured to perform descrambling on the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, where the secondary synchronization sequence is based on the m sequence and the primary One of the secondary synchronization sequences generated by the scrambling sequence of the synchronization signal, the m sequence being generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and any two The m-sequence pair formed by the m-sequence generated by the primitive polynomial is a preferred pair of m-sequences;

a second m sequence generating module, configured to generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

a cyclic shifting module, configured to cyclically shift the m sequence to generate an m sequence to be detected;

a correlation detecting module, configured to perform correlation detection on the descrambling signal by using the to-be-detected m sequence, to obtain a second partial cell identification information;

And an information acquiring module, configured to obtain cell identity information according to the first partial cell identity information and the second partial cell identity information.

An embodiment of the present disclosure also provides a user equipment including a second memory, a second processor, and a computer program stored on the second memory and operable on the second processor; The processor implements the following steps when executing the program:

The cell identification information is obtained according to the first partial cell identification information and the second partial cell identification information.

The user equipment receives the synchronization signal sent by the base station, descrambles the signal with the primary synchronization sequence, and then performs correlation detection on the descrambled signal, thereby obtaining time-frequency synchronization and cell identification information.

The foregoing technical solution of the present disclosure has the beneficial effects of: generating a secondary synchronization sequence according to the scrambling code sequence and the m sequence of the primary synchronization signal, so that the generated secondary synchronization sequence includes the scrambling code sequence of the primary synchronization sequence, so that the synchronization detection process can be performed. The main synchronization signal is detected based on the scrambling code sequence to avoid misjudgment of the main synchronization signal, and the detection accuracy is improved. In addition, since the m sequence used to generate the secondary synchronization sequence is generated by the primitive polynomial having the preferred pair characteristics, the cross-correlation of the finally generated secondary synchronization sequence is low, thereby avoiding sequence detection during the synchronization detection process. The misjudgment further improves the detection accuracy.

DRAWINGS

1 is a flowchart showing a method of generating a secondary synchronization sequence according to a first embodiment of the present disclosure;

2 is a flowchart showing a method of generating a secondary synchronization sequence according to a second embodiment of the present disclosure;

3 is a flowchart showing a method of generating a secondary synchronization sequence according to a third embodiment of the present disclosure;

4 is a flowchart showing a method of generating a secondary synchronization sequence according to a fourth embodiment of the present disclosure;

FIG. 5 is a block diagram showing the structure of a base station according to a fifth embodiment of the present disclosure;

6 is a second structural block diagram of a base station according to a fifth embodiment of the present disclosure;

FIG. 7 is a block diagram showing the structure of a base station according to a sixth embodiment of the present disclosure;

FIG. 8 is a flowchart showing a method of detecting a secondary synchronization sequence according to an eighth embodiment of the present disclosure;

FIG. 9 is a flowchart showing a method of detecting a secondary synchronization sequence according to a ninth embodiment of the present disclosure;

FIG. 10 is a flowchart showing a method of detecting a secondary synchronization sequence according to a tenth embodiment of the present disclosure;

Figure 11 is a flowchart showing a method of detecting a secondary synchronization sequence in the eleventh embodiment of the present disclosure;

FIG. 12 is a block diagram showing the structure of a user equipment according to a twelfth embodiment of the present disclosure;

FIG. 13 is a second structural block diagram of a user equipment according to a twelfth embodiment of the present disclosure;

Figure 14 is a block diagram showing the structure of a user equipment according to a thirteenth embodiment of the present disclosure.

detailed description

The technical problems, the technical solutions, and the advantages of the present invention will be more clearly described in the following description. In the following description, specific details such as specific configurations and components are provided only to assist in a comprehensive understanding of the embodiments of the present disclosure. It will be apparent to those skilled in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the disclosure. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

It is to be understood that the phrase "one embodiment" or "an embodiment" or "an" or "an" Thus, "in one embodiment" or "in an embodiment" or "an" In addition, these particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

In the various embodiments of the present disclosure, it should be understood that the size of the serial numbers of the following processes does not mean the order of execution, and the order of execution of each process should be determined by its function and internal logic, and should not be implemented by the present disclosure. The implementation of the examples constitutes any limitation.

In the embodiments provided herein, it should be understood that "B corresponding to A" means that B is associated with A, and B can be determined from A. However, it should also be understood that determining B from A does not mean that B is only determined based on A, and that B can also be determined based on A and/or other information.

Specifically, the embodiment of the present disclosure provides a method for generating a secondary synchronization sequence, which solves the problem that the detection accuracy of the synchronization detection in the related art is low.

First embodiment

As shown in FIG. 1 , an embodiment of the present disclosure provides a method for generating a secondary synchronization sequence, which specifically includes the following steps:

Step 11: Generate a scrambling code sequence of the primary synchronization signal.

The generation of the secondary synchronization sequence is performed by the base station. Specifically, the base station may generate the secondary synchronization sequence once every preset time interval and send it out, or the base station generates a secondary synchronization sequence by configuration and sends it out. When the user equipment needs to be synchronized with the system network, or when the user equipment downlinks (ie, downlink out-of-synchronization) during use, the user equipment may receive the secondary synchronization sequence sent by the base station, thereby performing a subsequent synchronization process.

In the embodiment of the present disclosure, in the process of generating a secondary synchronization sequence by the base station, a scrambling code sequence of the primary synchronization signal needs to be applied. Thus, a scrambling code sequence of the primary synchronization signal needs to be generated before the secondary synchronization sequence is generated.

In the embodiment of the present disclosure, the scrambling code sequence of the primary synchronization signal is applied in the process of generating the secondary synchronization sequence, so the finally generated secondary synchronization sequence includes the scrambling code sequence of the primary synchronization sequence, so that in the synchronous detection process. The main synchronization signal can be detected according to the scrambling code sequence, the misjudgment of the main synchronization signal is avoided, and the detection precision is improved.

Step 12: Generate an m sequence according to a predetermined primitive polynomial.

Wherein, the predetermined primitive polynomial includes at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are preferred pairs of m sequences.

In addition, the m-sequence with a period of N=2 ⁿ -1 can be a primitive polynomial with a degree of freedom of g(x)=a ₀ x ⁿ +a ₁ x ^n-1 +...+a _n-1 x ¹ +a _n Generated, where a ₀ = a _n =1, and other a _i (i=1, 2...n-1) take values between 0 and 1. Wherein, the polynomial is usually expressed in the form of a binary vector {a ₀ , a ₁ , . . . , a _n }, and the vector is represented as an octal or a decimal number.

For generating m sequences of length 2 ⁿ -1, primitive polynomials with different degrees of freedom n can be selected. These primitive polynomials have different cross-correlation properties. The result of the cross-correlation of the m-sequences will exhibit at least three different values. In order to ensure the detection characteristics of the NR secondary synchronization signal (SSS), a primitive polynomial with a small cross-correlation value should be selected.

Where, for two m sequences, if their cross-correlation exhibits the smallest three values [-1, -t(n), t(n)-2],

Corresponding m-sequence pairs are referred to as m-sequences (or polynomial) preferred pairs. Among them, in the NR system, the length of the m sequence is 127, and for the m sequence of length 127, a total of 18 primitive polynomials can be used to generate the m sequence. Moreover, the cross-correlation values of each preferred pair are [-1, -17, 15]. Furthermore, for a set of m-sequences of degree n, if each pair of m-sequences is a preferred pair, then the set of m-sequences is referred to as a connected set.

In addition, for a m sequence of length 127, 18 primitive polynomials may have multiple connected sets, and the maximum number of elements of these connected sets is 6. For example, the primitive polynomial {137, 143, 191, 211, 131, 171} (decimal) forms the largest connected set of m sequences of length 127. The primitive polynomial {145, 131, 171, 185, 247, 229} constitutes another largest connected set. For an embodiment of the present disclosure, a preferred pair of primitive polynomials is used to generate an SSS sequence. If more than two primitive polynomials are needed to generate the NR SSS, then the primitive polynomial should be chosen from the same connected set.

It can be seen from the above that in the embodiment of the present disclosure, the m sequence to which the secondary synchronization sequence is generated is generated from at least two primitive polynomials selected from the same connected set, and therefore, the m sequence applied in the embodiment of the present disclosure. The m-sequence pair composed of any two m-sequences is a preferred pair of m-sequences, that is, the cross-correlation of any two m-sequences in the m-sequence applied in the embodiment of the present disclosure exhibits a minimum value. Therefore, in the embodiment of the present disclosure, the last generated secondary synchronization sequence has a lower cross-correlation, thereby avoiding misjudgment of sequence detection during the synchronization detection process, and improving detection accuracy.

Step 13: Generate a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence.

On the user side, the user equipment receives the signal sent by the base station, uses the primary synchronization signal to descramble the signal, and then uses the local sequence to correlate the descrambled signal, and the local sequence number with the largest correlation value is the detected partial cell. ID information. The local sequence here is the sequence of the descrambling sequence generated by step 13 using the primary synchronization sequence. Fine time offset and fine frequency offset estimation can be further performed by generating a secondary synchronization sequence.

As can be seen from the above, the embodiment of the present disclosure generates a secondary synchronization sequence according to the scrambling code sequence and the m sequence of the primary synchronization signal, so that the generated secondary synchronization sequence includes the scrambling code sequence of the primary synchronization sequence, so that the synchronization detection process can be performed according to The scrambling code sequence performs error detection on the main synchronization signal, avoids misjudgment of the main synchronization signal, and improves detection accuracy. In addition, since the m sequence used to generate the secondary synchronization sequence is generated by the primitive polynomial having the preferred pair characteristics, the cross-correlation of the finally generated secondary synchronization sequence is low, thereby avoiding sequence detection during the synchronization detection process. The misjudgment further improves the detection accuracy.

Second embodiment

As shown in FIG. 2, a second embodiment of the present disclosure provides a method for generating a secondary synchronization sequence. When the scrambling sequence of the primary synchronization signal is three and the m sequence is three, the disclosure implements The method for generating the secondary synchronization sequence of the example specifically includes:

Step 21: Generate a scrambling code sequence of the primary synchronization signal.

Preferably, step 21 comprises:

According to the first preset formula

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

According to the third preset formula

In the NR system, the primary and secondary synchronization sequences are all 127 long. Therefore, the length of the scrambling sequence of the primary synchronization signal generated in step 21 is 127, that is, N=127.

Specifically, for example, three m sequences s _i (k) of length 127 (k=0, 1, . . . , N-1; i=0, 1, 2; N=127) are represented by three mains. A synchronization (PSS) sequence, which is used as a scrambling sequence, is generated as follows:

Where i = 0, 1, 2; k = 0, 1, ..., 126, where c _i (i = 0, 1, 2; c ₀ ≠ c ₁ ≠ c ₂ ) is the m sequence used to generate the PSS The cyclic shift value. For example, c _i (i=0, 1, 2) may be selected to minimize the peak power to average power ratio (PAPR) of the NR PSS, and may alternatively be c _i = {0, 43, 86}.

In addition,

(h=0,1,...,126), where x(h) is generated as follows:

among them,

Preferably, the initial value is x(0)=0, x(1)=1, x(2)=1, x(3)=0, x(4)=1, x(5)=1, x( 6)=1.

Substituting the initial value into the formula

Obtain x(0)~x(126), and then substitute x(0)~x(126) into the formula.

In, get

Further, when i=0, c ₀ and

Into the formula

Obtaining the first scrambling sequence; when i=1, c ₁ and

Into the formula

Obtaining a second scrambling code sequence; when i=2, c ₂ and

Into the formula

A third scrambling sequence is obtained.

It should be noted that the manner of generating the scrambling code of the primary synchronization signal is not limited thereto.

Step 22: Generate an m sequence according to a predetermined primitive polynomial.

Wherein, the predetermined primitive polynomial comprises at least two primitive polynomials, and the m-sequence pairs formed by the m-sequences generated by any two primitive polynomials are preferred pairs of m-sequences.

Preferably, step 22 comprises:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Specifically, for example, any three primitive polynomials having a degree of freedom of 7 are selected in advance from the connected set. For example, the primitive polynomial {137, 143, 191} (decimal) is preselected to generate three m sequences of length 127, m _j (w), (j = 0, 1, 2; w = 0, 1, ..., 126). The specific generation method is:

m _j (w) = 1-2y _j (w), where w = 0, 1, ..., 126.

Wherein, since the pre-selected primitive polynomial 137=2 ⁷ +2 ³ +2 ⁰ , 143=2 ⁷ +2 ³ +2 ² ++2 ¹ +2 ⁰ , 191=2 ⁷ +2 ⁵ +2 ⁴ +2 ³ +2 ² +2 ¹ +2 ⁰ , so, you can get the following three formulas:

Wherein, the initial value {y _j (0), y _j (1), y _j (2), y _j (3), y _j (4), y _j (5), y _j (6)} (j = 0, 1, 2) is a non-zero sequence. For example, the following initial values can be used:

y ₀ (0)=y ₀ (1)=y ₀ (2)=y ₀ (3)=y ₀ (4)=y ₀ (5)=0, y ₀ (6)=1;

y ₁ (0)=y ₁ (1)=y ₁ (2)=y ₁ (3)=y ₁ (4)=y ₁ (5)=0, y ₁ (6)=1;

y ₂ (0)=y ₂ (1)=y ₂ (2)=y ₂ (3)=y ₂ (4)=y ₂ (5)=0, y ₂ (6)=1.

That is, according to the predetermined primitive polynomial {137, 143, 191} (decimal), three m sequences of length 127, m ₀ (0) to m ₀ (126), m ₁ (0) to m ₁ (126), m are generated. ₂ (0) to m ₂ (126).

Step 23: According to the fifth preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w)

The scrambling and cyclic shift are performed to generate a secondary synchronization sequence S _L (r).

Wherein, the value of i is an integer of 0 to 2, the value of j is an integer of 0 to 2, and the value of c is an integer of 0 to 111, L=112*(3*i+j)+ The value of c; k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1, and N represents the primary synchronization. The length of the scrambling sequence of the signal, the length of the m sequence, the length of the secondary synchronization sequence, and S _L (r) represent the rth element of the Lth secondary synchronization sequence.

Wherein, an m sequence can be implemented by an n-level binary linear feedback shift register whose initial value is a binary non-zero sequence of length n. A cyclic shift of a m sequence of length 2 ⁿ -1 through c (1 ≤ c < 2 ⁿ -1) bits will constitute another m sequence of length 2 ⁿ -1. Thus a primitive polynomial with a degree of freedom of n can generate 2 ⁿ -1 different m sequences.

For the NR secondary synchronization sequence, the length of the m sequence is 127. Therefore, the primitive polynomial degree of freedom of the m-sequence that produces the secondary synchronization sequence should be 7 (2 ⁷ -1 = 127). For the cyclic shift c of the m-sequence (1 ≤ c < 2 ⁿ -1), the primitive polynomial with a degree of freedom of the primitive polynomial of 7 can produce 127 different m-sequences for use as the secondary synchronization sequence. Considering that NR should support at least 1000 PSS scrambled secondary synchronization sequences, at least 334 SSS m sequences are required.

Wherein, when the predetermined primitive polynomial includes three primitive polynomials, each primitive polynomial generates a corresponding m sequence according to the corresponding initial value, and when the three sequences of the primary synchronization signal are used for scrambling, When generating the secondary synchronization sequence according to the three m sequences, each m sequence needs to perform at least 112 cyclic shifts to generate at least 1000 secondary synchronization sequences.

Therefore, when the scrambling sequence of the primary synchronizing signal is three and the m sequence is three, each m sequence needs to be shifted 112 times, that is, the cyclic shift c needs to have 112 values.

That is, when i=0, j=0, and c take 0 to 111, respectively, the three scrambling code sequences s _i (k) and m sequences m _j (w) generated in the above are substituted into the formula.

In the process, 112 secondary synchronization sequences are generated; similarly, when i=0, j=1, c takes 0～111, i=0, j=2, and c takes 0～111, i=1, j respectively. =0,c take 0～111, i=1, j=1, c take 0～111, i=1, j=2, c take 0～111, i=2, j=0 , c respectively take 0 ~ 111, i = 2, j = 1, c take 0 ~ 111, i = 2, j = 2, c take 0 ~ 111, respectively, the three previously generated scrambling code The sequence s _i (k) and the m sequence m _j (w) are substituted into the formula

In each case, 112 secondary synchronization sequences are respectively generated, and therefore, 9×112=1008 secondary synchronization sequences are finally generated.

As can be seen from the above, in the embodiment of the present disclosure, the total number of scrambled secondary synchronization sequences is 1008. Therefore, the secondary synchronization sequence generated in the embodiment of the present disclosure can support 1008 physical layer cell identifiers. Compared with the LTE system, only 504 different physical layer cell identifiers can be distinguished. In the embodiment of the present disclosure, the number of identifications of the physical layer cell identifier is increased, thereby improving the detection precision.

In summary, the embodiment of the present disclosure generates a secondary synchronization sequence according to the scrambling code sequence and the m sequence of the primary synchronization signal, so that the generated secondary synchronization sequence includes the scrambling code sequence of the primary synchronization sequence, so that the synchronization detection process can be performed. The main synchronization signal is detected based on the scrambling code sequence to avoid misjudgment of the main synchronization signal, and the detection accuracy is improved. In addition, since the m sequence used to generate the secondary synchronization sequence is generated by the primitive polynomial having the preferred pair characteristics, the cross-correlation of the finally generated secondary synchronization sequence is low, thereby avoiding sequence detection during the synchronization detection process. The misjudgment further improves the detection accuracy.

Third embodiment

As shown in FIG. 3, a third embodiment of the present disclosure provides a method for generating a secondary synchronization sequence. When the scrambling sequence of the primary synchronization signal is three and the m sequence is six, the disclosure implements The method for generating the secondary synchronization sequence of the example specifically includes:

Step 31: Generate a scrambling code sequence of the primary synchronization signal.

Preferably, step 31 comprises:

According to the first preset formula

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

According to the third preset formula

Specifically, for example, three m sequences of length 127, _i (k) (k=0, 1, . . . , N-1; i=0, 1, 2; N=127), represent three PSSs. The sequence, which is used as a scrambling sequence, is generated as follows:

In addition,

(h=0,1,...,126), where x(h) is generated as follows:

among them,

Substituting the initial value into the formula

Obtain x(0)~x(126), and then substitute x(0)~x(126) into the formula.

In, get

Further, when i=0, c ₀ and

Into the formula

Obtaining the first scrambling sequence; when i=1, c ₁ and

Into the formula

Obtaining a second scrambling code sequence; when i=2, c ₂ and

Into the formula

A third scrambling sequence is obtained.

Step 32: Generate an m sequence according to a predetermined primitive polynomial.

Preferably, step 32 comprises:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Specifically, for example, any six primitive polynomials having a degree of freedom of 7 are selected in advance from the connected set, for example, the predetermined six primitive polynomials are {137, 143, 191, 211, 131, 171} (decimal). The process of generating a corresponding m sequence according to each primitive polynomial is the same. For example, according to the primitive polynomial: 137 (decimal), an m-sequence m(w) of length 127, (w=0, 1, ..., 126) is generated, which is specifically generated as follows:

m(w) = 1-2y(w).

Among them, since the pre-selected primitive polynomial 137=2 ⁷ +2 ³ +2 ⁰ , the following formula can be obtained:

Among them, the following initial values can be used:

y(0)=y(1)=y(2)=y(3)=y(4)=y(5)=0, y(6)=1.

Therefore, according to the above method, six m sequences of length 127 can be generated according to the predetermined six primitive polynomials, that is, m ₀ (0) to m ₀ (126), m ₁ (0) to m ₁ (126) m ₂ (0) to m ₂ (126), m ₃ (0) to m ₃ (126), m ₄ (0) to m ₄ (126), and m ₅ (0) to m ₅ (126).

Step 33: According to the sixth synchronization formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w)

Wherein, the value of i is an integer of 0 to 2, and the value of j is an integer of 0 to 5, and the value of c is an integer of 0 to 55, L=56*(6*i+j)+ The value of c; k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1, and N represents the primary synchronization. The length of the scrambling sequence of the signal, the length of the m sequence, the length of the secondary synchronization sequence, and S _L (r) represent the rth element of the Lth secondary synchronization sequence.

Wherein, when the pre-determined primitive polynomial includes six primitive polynomials, each primitive polynomial generates a corresponding m-sequence according to the corresponding initial value, and generates a secondary synchronization sequence according to the six m-sequences, and when When scrambling is performed using three sequences of the primary synchronization signal, each m sequence needs to perform at least 56 cyclic shifts to generate at least 1000 secondary synchronization sequences.

Therefore, when the scrambling sequence of the primary synchronizing signal is three and the m sequence is six, each m sequence needs to be shifted 56 times, that is, the cyclic shift c needs to have 56 values.

That is, when i=0, j=0, and c take 0 to 55 respectively, the three scrambling code sequences s _i (k) and the m sequence m _j (w) generated before are respectively substituted into the formula.

In the middle, 56 secondary synchronization sequences are generated. Among them, since there are 3×6=18 combinations of i and j, 56 secondary synchronization sequences are generated in each case, and finally, 18×56=1008 secondary synchronization sequences are finally generated.

Fourth embodiment

As shown in FIG. 4, a fourth embodiment of the present disclosure provides a method for generating a secondary synchronization sequence. When the scrambling sequence of the primary synchronization signal is three and the m sequence is two, the disclosure implements The method for generating the secondary synchronization sequence of the example specifically includes:

Step 41: Generate a scrambling code sequence of the primary synchronization signal.

Preferably, step 41 comprises:

According to the first preset formula

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

According to the third preset formula

Specifically, for example, three m sequences s _i (k) of length 127 (k=0, 1, . . . , N-1; i=0, 1, 2; N=127) are represented by three PSSs. The sequence, which is used as a scrambling sequence, is generated as follows:

In addition,

(h=0,1,...,126), where x(h) is generated as follows:

among them,

Substituting the initial value into the formula

Obtain x(0)~x(126), and then substitute x(0)~x(126) into the formula.

In, get

Further, when i=0, c ₀ and

Into the formula

Obtaining the first scrambling sequence; when i=1, c ₁ and

Into the formula

Obtaining a second scrambling code sequence; when i=2, c ₂ and

Into the formula

A third scrambling sequence is obtained.

Step 42: Generate an m sequence according to a predetermined primitive polynomial.

Preferably, step 42 comprises:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Specifically, for example, any two primitive polynomials having a degree of freedom of 7 are selected in advance from the connected set. For example, the primitive polynomial {137, 143} (decimal) is preselected to generate two m sequences m _j (w) of length 127, (j=0, 1; w=0, 1, ..., 126). The specific generation method is:

m _j (w) = 1-2y _j (w), where w = 0, 1, ..., 126.

Among them, since the pre-selected primitive polynomial 137=2 ⁷ +2 ³ +2 ⁰ , 143=2 ⁷ +2 ³ +2 ² ++2 ¹ +2 ⁰ , the following two formulas can be obtained respectively:

Wherein, the initial value {y _j (0), y _j (1), y _j (2), y _j (3), y _j (4), y _j (5), y _j (6)} (j = 0,1) is a non-zero sequence. For example, the following initial values can be used:

y ₀ (0)=y ₀ (1)=y ₀ (2)=y ₀ (3)=y ₀ (4)=y ₀ (5)=0, y ₀ (6)=1;

y ₁ (0)=y ₁ (1)=y ₁ (2)=y ₁ (3)=y ₁ (4)=y ₁ (5)=0, y ₁ (6)=1.

That is, according to the predetermined primitive polynomial {137, 143} (decimal), two m sequences m ₀ (0) to m ₀ (126) and m ₁ (0) to m ₁ (126) having a length of 127 are generated.

Step 43: According to the seventh synchronization formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequences m ₀ (w) and m ₁ (w)

Wherein, the value of i is an integer of 0 to 2, the value of v is an integer of 0 to 2, and the value of c is an integer of 0 to 55, L=112*(3*i+v)+ c; b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ; k is in turn an integer from 0 to N-1, and the value of w is 0 to 0 An integer of N-1, the value of r is an integer of 0 to N-1 in sequence; N represents the length of the scrambling sequence of the primary synchronization signal, the length of the m sequence, and the length of the secondary synchronization sequence, S _L (r) represents the rth element in the Lth secondary synchronization sequence.

Among them, in the formula

The value of i is an integer from 0 to 2, the value of v is an integer from 0 to 2. The value of c is an integer from 0 to 111. There are three types of values for i, and three values for v. In the case, c has a value of 112, so in the embodiment of the present disclosure, 3×3×112=1008 secondary synchronization sequences can be finally generated.

Fifth embodiment

The above first embodiment to the fourth embodiment respectively introduce the method for generating the secondary synchronization sequence of the present disclosure. The following embodiment will further explain the corresponding base station with reference to the accompanying drawings.

Specifically, as shown in FIG. 5, an embodiment of the present disclosure further provides a base station 500, including:

a scrambling code sequence generating module 501, configured to generate a scrambling code sequence of the primary synchronization signal;

The first m sequence generation module 502 is configured to generate an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and the m sequences generated by any two primitive polynomials are composed The m sequence pair is a preferred pair of m sequences;

The secondary synchronization sequence generating module 503 is configured to generate a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence.

Preferably, as shown in FIG. 6, the scrambling code sequence generating module 501 includes:

a first calculating unit 5011, configured to follow the first preset formula

a second calculating unit 5012, configured to follow the second preset formula according to the first reference sequence x(h)

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

a third calculating unit 5013, configured to follow the third preset formula

Preferably, as shown in FIG. 6, the first m sequence generation module 502 includes:

a fourth calculating unit 5021, configured to: according to each of the predetermined primitive polynomials g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ Determining a formula for calculating a third reference sequence y(w) corresponding to each of the primitive polynomials:

a fifth calculating unit 5022, configured to preset initial values and formulas corresponding to each of the primitive polynomials

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

a sixth calculating unit 5023, configured to generate, according to the fourth preset formula m(w)=1-2y(w), according to the third reference sequence y(w) corresponding to each of the primitive polynomials An m-sequence corresponding to each of the primitive polynomials, wherein m(w) represents the wth element in an m-sequence.

Preferably, when the scrambling sequence of the primary synchronization signal is three and the m sequence is three, as shown in FIG. 6, the secondary synchronization sequence generating module 503 includes:

The first processing unit 5031 is configured to follow the fifth preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w)

Preferably, when the scrambling sequence of the primary synchronization signal is three and the m sequence is six, as shown in FIG. 6, the secondary synchronization sequence generating module 503 includes:

a second processing unit 5032, configured to follow a sixth preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequence m _j (w)

Preferably, when the scrambling sequence of the primary synchronization signal is three and the m sequence is two, as shown in FIG. 6, the secondary synchronization sequence generating module 503 includes:

a third processing unit 5033, configured to use the seventh preset formula according to the scrambling code sequence s _i (k) of the primary synchronization signal and the m sequences m ₀ (w) and m ₁ (w)

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

Sixth embodiment

An embodiment of the present disclosure provides a base station, including: a first memory 720, a first processor 700, and a computer program stored on the first memory 720 and executable on the processor; a first processor 700, for reading a program in the first memory 720, performing the following process:

Generating a scrambling sequence of the primary synchronization signal;

In FIG. 7, the bus architecture may include any number of interconnected buses and bridges, specifically linked by one or more processors represented by the first processor 700 and various circuits of the memory represented by the first memory 720. . The bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein. The bus interface provides an interface. The first transceiver 710 can be a plurality of components, including a transmitter and a transceiver, providing means for communicating with various other devices on a transmission medium. The first processor 700 is responsible for managing the bus architecture and the usual processing, and the first memory 720 can store data used by the first processor 700 when performing operations.

The first processor 700 is responsible for managing the bus architecture and the usual processing, and the first memory 720 can store data used by the first processor 700 when performing operations.

When generating the scrambling sequence of the primary synchronization signal, the first processor 700 is specifically configured to:

According to the first preset formula

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

According to the third preset formula

Generating a scrambling code sequence of three primary synchronization signals having a length of a preset length, where s _i (k) represents the kth element in the scrambling sequence of the i-th primary synchronization signal, and the value of i is 0 to 0 integer, k is an integer of value 2 is sequentially 0 ~ N-1 is, N represents a preset length, c _i is a preset constant.

The first processor 700 is specifically configured to: when generating an m sequence according to a predetermined primitive polynomial:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

When the scrambling sequence of the primary synchronization signal is three and the m sequence is three, the first processor 700 generates a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence. Specifically for:

When the scrambling sequence of the primary synchronization signal is three and the m sequence is six, the first processor 700 generates a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence. Specifically for:

When the scrambling sequence of the primary synchronization signal is three and the m sequence is two, the first processor 700 generates a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence. Specifically for:

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

Seventh embodiment

Generating a scrambling sequence of the primary synchronization signal;

According to the first preset formula

Calculating the second reference sequence

among them,

Representing the hth element in the second reference sequence;

According to the third preset formula

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

Eighth embodiment

An embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence, as shown in FIG. 8, which specifically includes the following steps:

Step 81: Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance to obtain a descrambling signal.

The secondary synchronization sequence is one of a secondary synchronization sequence generated according to the m sequence and the scrambling code sequence of the primary synchronization signal, and the m sequence is generated according to a predetermined primitive polynomial, wherein the predetermined The primitive polynomial includes at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are preferred pairs of m sequences.

That is, the secondary synchronization sequence is generated as follows: first, a scrambling code sequence of the primary synchronization signal is generated; secondly, an m sequence is generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial includes at least two primitive polynomials And the m sequence pair formed by the m sequences generated by any two primitive polynomials is a preferred pair of m sequences; finally, the secondary synchronization sequence is generated according to the scrambling code sequence of the primary synchronization signal and the m sequence.

The foregoing process may generate multiple secondary synchronization sequences, and in the embodiment of the present disclosure, the process of detecting one of the multiple secondary synchronization sequences generated in the foregoing generation process.

In addition, the generation of the secondary synchronization sequence is performed by the base station. Specifically, the base station may generate the secondary synchronization sequence once every preset time interval and send it out, or the base station generates a secondary synchronization sequence by configuration and sends it out. When the user equipment needs to be synchronized with the system network, or when the user equipment downlinks (ie, downlink out-of-synchronization) during use, the user equipment may receive the secondary synchronization sequence sent by the base station, and receive the secondary synchronization sequence. Test.

The base station generates multiple secondary synchronization sequences at a time, but which of the user equipments the base station specifically transmits to which the secondary synchronization sequence is determined by the ID of the user equipment.

In addition, the first partial cell identification information is obtained after the user equipment detects the primary synchronization signal in advance.

Step 82: Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.

Where the primitive polynomials are applied in the process of generating the secondary synchronization sequence, in the detection process of the secondary synchronization sequence, which primitive polynomials are also applied to generate the corresponding m sequence. Therefore, when the primitive polynomial used in generating the secondary synchronization sequence includes at least two primitive polynomials, and the m-sequence pairs formed by the m-sequences generated by any two primitive polynomials are the preferred pairs of the m-sequences, the secondary synchronization sequence is detected. The primitive polynomial applied at the same time also includes at least two primitive polynomials, and the m-sequence pair formed by the m-sequence generated by any two primitive polynomials is a preferred pair of m-sequences, that is, any two of the m-sequences generated in step 82. The cross-correlation of the m sequences exhibits a minimum.

In addition, the same primitive polynomial can be configured for the base station and the user equipment by means of system configuration, so that when the base station generates the secondary synchronization sequence, the configured primary polynomial is used to generate the secondary synchronization sequence by default, and the user equipment is in the secondary synchronization sequence. The secondary synchronization sequence is detected by the configured primitive polynomial by default during the detection process.

Step 83: cyclically shift the m sequence to generate an m sequence to be detected.

The secondary synchronization sequence is generated by cyclically shifting the m sequence generated according to the predetermined primitive polynomial and adding the scrambling sequence of the primary synchronization signal. In the embodiment of the present disclosure, the generated m sequence to be detected is a sequence that is descrambled by all the secondary synchronization sequences generated by the base station. Therefore, the method for performing cyclic shift in step 83 and the method used in generating the secondary synchronization sequence are used. The cyclic shift method is the same.

Step 84: Perform correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information.

The process of detecting the secondary synchronization sequence is to determine which of the multiple secondary synchronization sequences generated by the base station is the secondary synchronization sequence received by the user equipment. The m sequence to be detected is a sequence descrambled by all the secondary synchronization sequences generated by the base station, and the descrambled signal is a sequence after the user equipment descrambles the received secondary synchronization sequence, and thus the descrambling signal is performed by using the m sequence to be detected. The correlation detection can determine which sequence in the m sequence to be detected is most correlated with the descrambling signal, thereby obtaining the second part of the cell identification information.

Step 85: Obtain cell identification information according to the first partial cell identity information and the second partial cell identity information.

The primary synchronization signal is detected to obtain the first partial cell identification information, and the secondary synchronization sequence is detected to obtain the second partial cell identification information, and the first partial cell identification information and the second partial cell identification information are used to obtain a complete cell. Identification information.

In summary, the method for detecting a secondary synchronization sequence in the embodiment of the present disclosure performs descrambling on the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, and then according to the generation process of the secondary synchronization sequence. The applied primitive polynomial generates an m sequence, and then cyclically shifts the generated m sequence to generate an m sequence to be detected, thereby performing correlation detection on the signal descrambled by the auxiliary synchronization sequence by using the m sequence to be detected, and obtaining a second partial cell. The identification information is further obtained by the first partial cell identification information and the second partial cell identification information to obtain complete cell identification information.

The scrambling code sequence of the primary synchronization sequence is added to the secondary synchronization sequence. Therefore, in the process of detecting the secondary synchronization sequence, the first partial cell identification information obtained by detecting the primary synchronization signal in advance may be used to the secondary synchronization sequence. De-scrambling is performed to obtain a descrambling signal, which improves the detection accuracy.

Ninth embodiment

As shown in FIG. 9, the ninth embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence. When a primitive polynomial applied in a process of generating a secondary synchronization sequence includes three primitive polynomials, the following steps are specifically included. ,

Step 91: Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, to obtain a descrambling signal.

Preferably, the step 91 includes: determining, according to the correspondence between the first partial cell identification information and the scrambling code sequence, a target scrambling code sequence corresponding to the first partial cell identification information obtained by detecting the primary synchronization signal in advance; using the target scrambling code The sequence descrambles the secondary synchronization sequence to obtain a descrambling signal.

There are nine or three scrambling code sequences in the system, of course, and are not limited thereto. When there are nine scrambling code sequences in the system, the nine scrambling code sequences are divided into three groups, and three groups are grouped. The first part of the cell identification information may have three values {0, 1, 2}, each of which is A part of the cell identification information respectively corresponds to a set of scrambling code sequences. If the first partial cell identification information obtained by detecting the primary synchronization signal is 2, all three scrambling code sequences are selected from the third group of the scrambling code sequence, and the secondary synchronization sequence signals are descrambled respectively. Three descrambling signals are obtained.

In addition, when there are three scrambling code sequences in the system, each of the first partial cell identification information respectively corresponds to one scrambling code sequence. If the first partial cell identification information obtained by detecting the primary synchronization signal is 2, the third scrambling code sequence is selected to descramble the secondary synchronization sequence signal, and a descrambling signal is obtained.

Step 92: Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.

Preferably, step 92 comprises: according to each primitive polynomial applied in the process of generating the secondary synchronization sequence g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ , determining a formula for calculating the fourth reference sequence y(w) corresponding to each of the primitive polynomials:

Where n is the degree of freedom of the primitive polynomial, a ₀ = a _n =1, a ₁ ~ a _n-1 respectively take a value of 0 or 1, and the value of t is an integer of 1 to n, y ( w) represents the wth element in the fourth reference sequence;

Calculating the fourth reference sequence y(w) corresponding to each of the primitive polynomials, wherein the preset initial value is y(0) to y(n-1), and y(0)-y The binary sequence composed of (n-1) is a non-zero sequence constant, and the value of w is in turn an integer of 0 to N-1.

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Generating, according to the fourth preset formula m(w)=1-2y(w), according to the fourth reference sequence y(w) corresponding to each of the primitive polynomials, corresponding to each of the primitive polynomials The m sequence, where m(w) represents the wth element in an m sequence.

In this embodiment, the number of primitive polynomials applied in the process of generating the secondary synchronization sequence may be three, and three primitive polynomials are also applied to generate the m sequence in the process of detecting the secondary synchronization sequence. The process of generating a corresponding m sequence according to each primitive polynomial is the same as the process in the method for generating the secondary synchronization sequence, and details are not described herein again.

Step 93: According to the m sequence m _j (w), generate an m sequence to be detected according to an eighth preset formula M _f (g)=m _j ((g+c) modN).

Wherein, the value of j is an integer of 0 to 2, and the value of c is an integer of 0 to 111, f=112*j+c; the value of w is an integer of 0 to N-1, g The value is an integer from 0 to N-1 in sequence; N represents the length of the m sequence, the length of the m sequence to be detected, and M _f (g) represents the gth element in the fth m sequence to be detected.

Further, the secondary synchronization sequence is generated by cyclically shifting the m sequence generated based on the predetermined primitive polynomial and adding the scrambling sequence of the primary synchronization signal. In the embodiment of the present disclosure, the generated m sequence to be detected is a sequence that is descrambled by all the secondary synchronization sequences generated by the base station. Therefore, the method for performing cyclic shift in step 93 and the method used in generating the secondary synchronization sequence are used. The cyclic shift method is the same.

Furthermore, when the primitive polynomial applied in the generation of the secondary synchronization sequence includes three primitive polynomials, three m sequences are generated in step 92 of the embodiment of the present disclosure. In step 93, the three m sequences are cyclically shifted to generate 336 m sequences to be detected.

That is, when j=0, c is taken from 0 to 111, f is taken from 0 to 111, respectively, and the m-sequence m ₀ (w) is substituted into the formula M _f (g)=m _j ((g+c) modN). , generating 112 m sequences to be detected M ₀ (g) ~ M ₁₁₁ (g);

Similarly, when j=1, c is taken from 0 to 111, f is taken from 112 to 223, respectively, and the m-sequence m ₁ (w) is substituted into the formula M _f (g)=m _j ((g+c) modN In the process, generating 112 m sequences to be detected M ₁₁₂ (g) ~ M ₂₂₃ (g);

When j=2 and c are respectively taken from 0 to 111, f is taken as 224 to 335, respectively, and the m-sequence m ₂ (w) is substituted into the formula M _f (g)=m _j ((g+c) modN). Generating 112 m sequences to be detected M ₂₂₄ (g) ~ M ₃₃₅ (g);

Therefore, 3 × 112 = 336 m sequences to be detected are finally generated.

Step 94: Perform correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain a second partial cell identification information.

Preferably, the descrambling signal is at least one, and step 94 includes: performing correlation detection on each of the descrambling signals by using each of the to-be-detected m sequences, to obtain a corresponding correlation value; and obtaining the correlation value. Determining a sequence of m to be detected corresponding to the maximum correlation value; obtaining a second part of cell identification information according to the sequence number of the m sequence to be detected corresponding to the maximum correlation value in all the m sequences to be detected.

That is, in step 93, 336 m sequences to be detected are obtained, and each of the 336 to-be-detected m sequences is used to perform correlation detection on each descrambling signal, and then the maximum correlation value is determined from all the obtained correlation values, thereby determining the The sequence number of the m sequence to be detected corresponding to the maximum correlation value in all m sequences to be detected, and the sequence number is the second part cell identification information.

Step 95: Obtain cell identification information according to the first partial cell identity information and the second partial cell identity information.

Tenth embodiment

As shown in FIG. 10, a tenth embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence. When a primitive polynomial applied in a process of generating a secondary synchronization sequence includes six primitive polynomials, the following steps are specifically included. ,

Step 101: Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, to obtain a descrambling signal.

Preferably, the step 101 includes: determining, according to the correspondence between the first partial cell identification information and the scrambling code sequence, a target scrambling code sequence corresponding to the first partial cell identification information obtained by detecting the primary synchronization signal in advance; using the target scrambling code The sequence descrambles the secondary synchronization sequence to obtain a descrambling signal.

Step 102: Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.

Where the primitive polynomials are applied in the process of generating the secondary synchronization sequence, in the detection process of the secondary synchronization sequence, which primitive polynomials are also applied to generate the corresponding m sequence. Therefore, when the primitive polynomial used in generating the secondary synchronization sequence includes at least two primitive polynomials, and the m-sequence pairs formed by the m-sequences generated by any two primitive polynomials are the preferred pairs of the m-sequences, the secondary synchronization sequence is detected. The primitive polynomial applied at the same time also includes at least two primitive polynomials, and the m-sequence pairs formed by the m-sequences generated by any two primitive polynomials are preferably pairs of m-sequences, ie, any two of the m-sequences generated in step 102. The cross-correlation of the m sequences exhibits a minimum.

Preferably, step 102 includes: according to each primitive polynomial applied in the process of generating the secondary synchronization sequence g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ , determining a formula for calculating the fourth reference sequence y(w) corresponding to each of the primitive polynomials:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

In this embodiment, the number of primitive polynomials applied in the generation process of the secondary synchronization sequence may be six, and six primitive polynomials are also applied to generate the m sequence in the detection process of the secondary synchronization sequence. The process of generating a corresponding m sequence according to each primitive polynomial is the same as the process in the method for generating the secondary synchronization sequence, and details are not described herein again.

Step 103: Generate a sequence of m to be detected according to the m sequence m _j (w) according to a ninth preset formula M _f (g)=m _j ((g+2c) modN).

Wherein, the value of j is an integer of 0 to 5, and the value of c is an integer of 0 to 55, f=56*j+c; the value of w is an integer of 0 to N-1, g The value is an integer from 0 to N-1 in sequence; N represents the length of the m sequence, the length of the m sequence to be detected, and M _f (g) represents the gth element in the fth m sequence to be detected.

Further, the secondary synchronization sequence is generated by cyclically shifting the m sequence generated based on the predetermined primitive polynomial and adding the scrambling sequence of the primary synchronization signal. In the embodiment of the present disclosure, the generated m sequence to be detected is a sequence that is descrambled by all the secondary synchronization sequences generated by the base station. Therefore, the method for performing cyclic shift in step 103 and the method used in generating the secondary synchronization sequence are used. The cyclic shift method is the same.

Furthermore, when the primitive polynomial applied in the generation of the secondary synchronization sequence includes three primitive polynomials, six m sequences are generated in step 102 of the embodiment of the present disclosure. In step 103, the six m sequences are cyclically shifted to generate 336 m sequences to be detected.

That is, when j=0, c is taken from 0 to 55, respectively, f is taken from 0 to 55, and the m-sequence m ₀ (w) is substituted into the formula M _f (g)=m _j ((g+2c) modN). , generating 56 m sequences to be detected M ₀ (g) ~ M ₅₅ (g);

Similarly, when j=1, c takes 0~55 respectively, f takes 56~111 respectively, then the m sequence m ₁ (w) is substituted into the formula M _f (g)=m _j ((g+2c) modN , generating 56 m sequences to be detected M ₅₆ (g) ~ M ₁₁₁ (g);

When j=2 and c are respectively taken from 0 to 55, f is taken from 112 to 167, respectively, and the m-sequence m ₂ (w) is substituted into the formula M _f (g)=m _j ((g+2c) modN). Generating 56 m sequences to be detected M ₁₁₂ (g) ~ M ₁₆₇ (g);

When j=3 and c are respectively 0 to 55, f is taken as 168 to 223, respectively, and the m-sequence m ₃ (w) is substituted into the formula M _f (g)=m _j ((g+2c) modN). Generate 56 m sequences to be detected M ₁₆₈ (g) ~ M ₂₂₃ (g);

When j=4 and c are respectively 0 to 55, f is taken as 224 to 279, respectively, and the m-sequence m ₄ (w) is substituted into the formula M _f (g)=m _j ((g+2c) modN). Generate 56 m sequences to be detected M ₂₂₄ (g) ~ M ₂₇₉ (g);

When j=5 and c are respectively 0 to 55, f is 280 to 335 respectively, and the m-sequence m ₅ (w) is substituted into the formula M _f (g)=m _j ((g+2c) modN). Generate 56 m sequences to be detected M ₂₈₀ (g) ~ M ₃₃₅ (g);;

Therefore, 6 × 56 = 336 m sequences to be detected are finally generated.

Step 104: Perform correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information.

Preferably, the descrambling signal is at least one, and the step 104 includes: performing correlation detection on each of the descrambling signals by using each of the to-be-detected m sequences, to obtain a corresponding correlation value; and obtaining the correlation value. Determining a sequence of m to be detected corresponding to the maximum correlation value; obtaining a second part of cell identification information according to the sequence number of the m sequence to be detected corresponding to the maximum correlation value in all the m sequences to be detected.

That is, in step 103, 336 m sequences to be detected are obtained, and each of the 336 to-be-detected m sequences is used to perform correlation detection on each descrambling signal, and then the maximum correlation value is determined from all the obtained correlation values, thereby determining the The sequence number of the m sequence to be detected corresponding to the maximum correlation value in all m sequences to be detected, and the sequence number is the second part cell identification information.

Step 105: Obtain cell identification information according to the first partial cell identity information and the second partial cell identity information.

Eleventh embodiment

As shown in FIG. 11 , an eleventh embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence. When a primitive polynomial applied in a process of generating a secondary synchronization sequence includes two primitive polynomials, specifically including the following step,

Step 111: Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, to obtain a descrambling signal.

Preferably, the step 111 includes: determining, according to the correspondence between the first partial cell identification information and the scrambling code sequence, a target scrambling code sequence corresponding to the first partial cell identification information obtained by detecting the primary synchronization signal in advance; using the target scrambling code The sequence descrambles the secondary synchronization sequence to obtain a descrambling signal.

In addition, when there are three scrambling code sequences in the system, each of the first partial cell identification information respectively corresponds to a scrambling code sequence. If the first partial cell identification information obtained by detecting the primary synchronization signal is 2, the third scrambling code sequence is selected to descramble the secondary synchronization sequence signal, and a descrambling signal is obtained.

Step 112: Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.

Where the primitive polynomials are applied in the process of generating the secondary synchronization sequence, in the detection process of the secondary synchronization sequence, which primitive polynomials are also applied to generate the corresponding m sequence. Therefore, when the primitive polynomial used in generating the secondary synchronization sequence includes at least two primitive polynomials, and the m-sequence pairs formed by the m-sequences generated by any two primitive polynomials are the preferred pairs of the m-sequences, the secondary synchronization sequence is detected. The primitive polynomial applied at the same time also includes at least two primitive polynomials, and the m-sequence pairs formed by the m-sequences generated by any two primitive polynomials are preferably pairs of m-sequences, ie, any two of the m-sequences generated in step 112. The cross-correlation of the m sequences exhibits a minimum.

Preferably, step 112 includes: according to each primitive polynomial applied in the process of generating the secondary synchronization sequence g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ , determining a formula for calculating the fourth reference sequence y(w) corresponding to each of the primitive polynomials:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Step 113: According to the m sequence m _j (w), according to the tenth preset formula

Generate a sequence of m to be detected.

Wherein, the value of j is an integer of 0 to 1, and the value of v is an integer of 0 to 2, and the value of c is an integer of 0 to 111, f=112*v+c; b _v is a pre- a constant is set, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ; w is sequentially an integer of 0 to N-1, and g is sequentially an integer of 0 to N-1; N represents the length of the m sequence, the length of the m sequence to be detected, and M _f (g) represents the gth element in the fth m sequence to be detected.

Further, the secondary synchronization sequence is generated by cyclically shifting the m sequence generated based on the predetermined primitive polynomial and adding the scrambling sequence of the primary synchronization signal. In the embodiment of the present disclosure, the generated m sequence to be detected is a sequence that is descrambled by all the secondary synchronization sequences generated by the base station. Therefore, the method for performing cyclic shift in step 113 and the method used in generating the secondary synchronization sequence are used. The cyclic shift method is the same.

Furthermore, when the primitive polynomial applied in the generation of the secondary synchronization sequence includes two primitive polynomials, two m sequences are generated in step 112 of the embodiment of the present disclosure. In step 113, the two m sequences are cyclically shifted to generate 336 m sequences to be detected.

That is, when v=0, c is taken from 0 to 111, f is taken from 0 to 111, respectively, and b ₀ and m sequences m ₀ (w) and m ₁ (w) are substituted into the formula.

, generating 112 m sequences to be detected M ₀ (g) ~ M ₁₁₁ (g);

Similarly, when v=1, c is taken from 0 to 111, f is taken from 112 to 223, respectively, and b ₁ and m sequences m ₀ (w) and m ₁ (w) are substituted into the formula.

, generating 112 m sequences to be detected M ₁₁₂ (g) ~ M ₂₂₃ (g);

When v=2 and c take 0~111 respectively, f takes 224~335 respectively, then substituting b ₂ and m sequences m ₀ (w) and m ₁ (w) into the formula

, generating 112 m sequences to be detected M ₂₂₄ (g) ~ M ₃₃₅ (g);

Therefore, 3 × 112 = 336 m sequences to be detected are finally generated.

Step 114: Perform correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information.

Preferably, the descrambling signal is at least one, and the step 114 includes: performing correlation detection on each of the descrambling signals by using each of the to-be-detected m sequences, to obtain a corresponding correlation value; and obtaining the correlation value. Determining a sequence of m to be detected corresponding to the maximum correlation value; obtaining a second part of cell identification information according to the sequence number of the m sequence to be detected corresponding to the maximum correlation value in all the m sequences to be detected.

That is, in step 113, 336 m sequences to be detected are obtained, and each of the 336 to-be-detected m sequences is used to perform correlation detection on each descrambling signal, and then the maximum correlation value is determined from all the obtained correlation values, thereby determining the The sequence number of the m sequence to be detected corresponding to the maximum correlation value in all m sequences to be detected, and the sequence number is the second part cell identification information.

Step 115: Obtain cell identification information according to the first partial cell identity information and the second partial cell identity information.

Twelfth embodiment

An embodiment of the present disclosure provides a user equipment. As shown in FIG. 12, the user equipment 120 includes:

The descrambling module 121 is configured to perform descrambling on the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, where the secondary synchronization sequence is based on the m sequence and the One of the secondary synchronization sequences generated by the scrambling sequence of the primary synchronization signal, the m sequence being generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and any The m-sequence pair formed by the m-sequences generated by the two primitive polynomials is a preferred pair of m-sequences;

The second m sequence generating module 122 is configured to generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

a cyclic shifting module 123, configured to cyclically shift the m sequence to generate an m sequence to be detected;

The correlation detection module 124 is configured to perform correlation detection on the descrambling signal by using the to-be-detected m sequence, to obtain a second partial cell identification information;

The information obtaining module 125 is configured to obtain cell identity information according to the first partial cell identity information and the second partial cell identity information.

Preferably, as shown in FIG. 13, the descrambling module 121 includes:

The scrambling code sequence determining unit 1211 is configured to determine, according to the correspondence between the first partial cell identification information and the scrambling code sequence, a target scrambling code sequence corresponding to the first partial cell identification information obtained by detecting the primary synchronization signal in advance;

The descrambling unit 1212 is configured to descramble the secondary synchronization sequence by using the target scrambling code sequence to obtain a descrambling signal.

Preferably, as shown in FIG. 13, the second m sequence generation module 122 includes:

a seventh calculating unit 1221, configured to: according to each primitive polynomial g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 applied in the process of generating the secondary synchronization sequence ¹ + a _n * 2 ⁰ , determining a formula for calculating a fourth reference sequence y(w) corresponding to each of the primitive polynomials:

An eighth calculating unit 1222, configured to preset initial values and formulas corresponding to each of the primitive polynomials

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

The ninth calculating unit 1223 is configured to generate, according to the fourth preset formula m(w)=1-2y(w), according to the fourth reference sequence y(w) corresponding to each of the primitive polynomials An m-sequence corresponding to each of the primitive polynomials, wherein m(w) represents the wth element in an m-sequence.

Preferably, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes three primitive polynomials, as shown in FIG. 13, the cyclic shift module 123 includes:

a first generating unit 1231, configured to generate, according to the m sequence m _j (w), an m sequence to be detected according to an eighth preset formula M _f (g)=m _j ((g+c) modN);

Wherein, the value of j is an integer of 0 to 2, and the value of c is an integer of 0 to 111, f=112*j+c;

The value of w is an integer of 0 to N-1, and the value of g is an integer of 0 to N-1.

N represents the length of the m sequence, the length of the m sequence to be detected, and M _f (g) represents the gth element in the fth m sequence to be detected.

Preferably, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes six primitive polynomials, the cyclic shift module 123 includes:

a second generating unit 1232, configured to generate, according to the m sequence m _j (w), a sequence of m to be detected according to a ninth preset formula M _f (g)=m _j ((g+2c) modN);

Wherein, the value of j is an integer from 0 to 5, and the value of c is an integer from 0 to 55, f=56*j+c;

Preferably, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes two primitive polynomials, as shown in FIG. 13, the cyclic shift module 123 includes:

a third generating unit 1233, configured to follow the tenth preset formula according to the m sequence m _j (w)

Generating a sequence of m to be detected;

Wherein, the value of j is an integer of 0 to 1, and the value of v is an integer of 0 to 2, and the value of c is an integer of 0 to 111, f=112*v+c;

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

Preferably, the descrambling signal is at least one. As shown in FIG. 13, the correlation detecting module 124 includes:

The correlation value calculation unit 1241 is configured to perform correlation detection on each of the descrambling signals by using each of the to-be-detected m sequences, to obtain a corresponding correlation value;

a maximum correlation value determining unit 1242, configured to determine, from the obtained correlation values, a sequence of m to be detected corresponding to the maximum correlation value;

The information obtaining unit 1243 is configured to obtain the second partial cell identification information according to the sequence numbers of the to-be-detected m sequences corresponding to the maximum correlation value in all the to-be-detected m sequences.

In summary, in the embodiment of the present disclosure, the secondary synchronization sequence is descrambled by the descrambling module 121 by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, and then the m-sequence generation module 122 is used according to the secondary synchronization sequence. The primitive polynomial applied in the generating process generates an m sequence, and then triggers the cyclic shift module 123 to cyclically shift the generated m sequence to generate an m sequence to be detected, thereby triggering the correlation detecting module 124 to use the m sequence to be detected. The signal after the descrambling of the synchronization sequence is correlated, and the second part of the cell identification information is obtained, so that the information acquiring module 125 obtains the complete cell identification information by using the first part of the cell identification information and the second part of the cell identification information.

Thirteenth embodiment

In order to achieve the above purpose, as shown in FIG. 14, the present disclosure further provides a user equipment, including:

a second processor 1410; a second memory 1430 connected to the second processor 1410 via a bus interface 1420, the second memory 1430 is configured to store a program used by the second processor 1410 when performing an operation And data, and a second transceiver 1440 coupled to the second processor 1410 via a bus interface 1420 for receiving and transmitting data under control of the second processor 1410. When the second processor 1410 calls and executes the programs and data stored in the second memory 1430, the following process is performed:

The second processor 1410 performs descrambling on the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance to obtain a descrambling signal, which is specifically used for:

Determining, according to the correspondence between the first part of the cell identification information and the scrambling code sequence, a target scrambling code sequence corresponding to the first partial cell identification information obtained by detecting the primary synchronization signal in advance;

The secondary synchronization sequence is descrambled by using the target scrambling code sequence to obtain a descrambling signal.

The second processor 1410 is specifically configured to: when generating an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence:

According to each of the primitive polynomials g=a ₀ *2 ⁿ +a ₁ *2 ^n-1 +...+a _n-1 *2 ¹ +a _n *2 ⁰ applied in the process of generating the secondary synchronization sequence, Determining a formula for calculating a fourth reference sequence y(w) corresponding to each of the primitive polynomials:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Wherein, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes three primitive polynomials, the second processor 1410 cyclically shifts the m sequence to generate an m sequence to be detected, specifically Used for:

Generating a sequence of m to be detected according to the m sequence m _j (w) according to an eighth preset formula M _f (g)=m _j ((g+c) modN);

Wherein, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes six primitive polynomials, the second processor 1410 cyclically shifts the m sequence to generate an m sequence to be detected, specifically Used for:

Generating a sequence of m to be detected according to the m sequence m _j (w) according to a ninth preset formula M _f (g)=m _j ((g+2c) modN);

Wherein, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes two primitive polynomials, the second processor 1410 cyclically shifts the m sequence to generate an m sequence to be detected, specifically Used for:

According to the m sequence m _j (w), according to the tenth preset formula

Generating a sequence of m to be detected;

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

The at least one of the descrambling signals is used by the processor 1410 to detect the descrambling signal by using the to-be-detected m sequence to obtain the second partial cell identification information, which is specifically used to:

Performing correlation detection on each of the descrambling signals by using each of the to-be-detected m sequences to obtain corresponding correlation values;

Determining, from the obtained correlation values, a sequence of m to be detected corresponding to the maximum correlation value;

And obtaining, according to the sequence number of the m sequence to be detected corresponding to the maximum correlation value, in all the to-be-detected m sequences, obtaining the second partial cell identification information.

It should be noted that, in FIG. 14, the bus architecture may include any number of interconnected buses and bridges, and specifically, various circuits of the memory represented by the one or more processors represented by the second processor 1410 and the second memory 1430. Linked together. The bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein. The bus interface provides an interface. The second transceiver 1440 can be a plurality of components, including a transmitter and a transceiver, providing means for communicating with various other devices on a transmission medium. For different terminals, the user interface 1450 may also be an interface capable of externally connecting the required devices, including but not limited to a keypad, a display, a speaker, a microphone, a joystick, and the like. The second processor 1410 is responsible for managing the bus architecture and normal processing, and the second memory 1430 can be second to store the data used by the processor 1430 in performing the operations.

It will be understood by those skilled in the art that all or part of the steps of implementing the above embodiments may be implemented by hardware, or may be completed by a computer program indicating related hardware, and the computer program includes instructions for performing some or all of the above steps. And the computer program can be stored in a readable storage medium, which can be any form of storage medium.

Moreover, it should be noted that in the apparatus and method of the present disclosure, it is apparent that the various components or steps may be decomposed and/or recombined. These decompositions and/or recombinations should be considered as equivalents to the present disclosure. Also, the steps of performing the above-described series of processes may naturally be performed in chronological order in the order illustrated, but need not necessarily be performed in chronological order, and some steps may be performed in parallel or independently of each other. It will be appreciated by those skilled in the art that all or any of the steps or components of the methods and apparatus of the present disclosure may be in a network of any computing device (including a processor, storage medium, etc.) or computing device, in hardware, firmware The software, or a combination thereof, is implemented by those of ordinary skill in the art using their basic programming skills while reading the description of the present disclosure.

Thus, the objects of the present disclosure can also be achieved by running a program or a set of programs on any computing device. The computing device can be a well-known general purpose device. Accordingly, the objects of the present disclosure may also be realized by merely providing a program product including program code for implementing the method or apparatus. That is to say, such a program product also constitutes the present disclosure, and a storage medium storing such a program product also constitutes the present disclosure. It will be apparent that the storage medium may be any known storage medium or any storage medium developed in the future. It should also be noted that in the apparatus and method of the present disclosure, it is apparent that various components or steps may be decomposed and/or recombined. These decompositions and/or recombinations should be considered as equivalents to the present disclosure. Also, the steps of performing the series of processes described above may naturally be performed in chronological order in the order illustrated, but need not necessarily be performed in chronological order. Certain steps may be performed in parallel or independently of one another.

Fourteenth embodiment

The step of performing descrambling on the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance to obtain a descrambling signal includes:

The step of generating an m sequence according to the primitive polynomial applied in the process of generating the secondary synchronization sequence includes:

The values are in the order of 0 to Nn-1, and N=2 ⁿ -1;

Wherein, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes three primitive polynomials, the step of cyclically shifting the m sequence to generate an m sequence to be detected includes:

Wherein, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes six primitive polynomials, the step of cyclically shifting the m sequence to generate an m sequence to be detected includes:

The step of cyclically shifting the m sequence to generate the m sequence to be detected, when the primitive polynomial applied in the process of generating the secondary synchronization sequence includes two primitive polynomials, includes:

According to the m sequence m _j (w), according to the tenth preset formula

Generating a sequence of m to be detected;

b _v is a preset constant, and 0 ≤ b _v < N, and b ₀ ≠ b ₁ ≠ b ₂ ;

The step of performing the correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain the second partial cell identification information includes:

The above is a preferred embodiment of the present disclosure, and it should be noted that those skilled in the art can also make several improvements and refinements without departing from the principles of the present disclosure. It should be considered as the scope of protection of this disclosure.

Claims

A method for generating a secondary synchronization sequence, comprising:

Generating a scrambling sequence of the primary synchronization signal;

Generating an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are preferred pairs of m sequences;

A secondary synchronization sequence is generated according to the scrambling code sequence of the primary synchronization signal and the m sequence.
The method of claim 1 wherein said step of generating a scrambling code sequence of the primary synchronization signal comprises:

According to the first preset formula
Calculating a first reference sequence x(h), where x(h) represents the hth element in the first reference sequence, and the value of h is an integer of 0 to N-1 in turn.
The values are in the order of 0 to N-8, and the binary consists of x(0), x(1), x(2), x(3), x(4), x(5), and x(6). The sequence is a non-zero sequence constant;

According to the first reference sequence x(h), according to the second preset formula
Calculating the second reference sequence
among them,
Representing the hth element in the second reference sequence;

According to the third preset formula
Generating a scrambling code sequence of three primary synchronization signals having a length of a preset length, where s i (k) represents the kth element in the scrambling sequence of the i-th primary synchronization signal, and the value of i is 0 to 0 integer, k is an integer of value 2 is sequentially 0 ~ N-1 is, N represents a preset length, c i is a preset constant.
The method of claim 1 wherein said step of generating an m sequence based on a predetermined primitive polynomial comprises:

Determining with each of the predetermined primitive polynomials g=a 0 *2 n +a 1 *2 n-1 +...+a n-1 *2 1 +a n *2 0 The formula corresponding to the original polynomial used to calculate the third reference sequence y(w):
Wherein, n is the degree of freedom of the primitive polynomial, a 0 = a n = 1 , a 1 ~ a n-1 , respectively, the value 0 or 1, t is an integer value of order of 1 ~ n, y ( w) represents the wth element in the third reference sequence;

Based on preset initial values and formulas corresponding to each of the primitive polynomials

Calculating the third reference sequence y(w) corresponding to each of the primitive polynomials, wherein the preset initial value is y(0) to y(n-1), and y(0) to y The binary sequence composed of (n-1) is a non-zero sequence constant, and the value of w is in turn an integer of 0 to N-1.
The values are in the order of 0 to Nn-1, and N=2 n -1;

Generating, according to the fourth preset formula m(w)=1-2y(w), according to the third reference sequence y(w) corresponding to each of the primitive polynomials, corresponding to each of the primitive polynomials The m sequence, where m(w) represents the wth element in an m sequence.
The method according to claim 1, wherein said scrambling code sequence according to said main synchronizing signal and said m when said scrambling code sequence of said main synchronizing signal is three and said m-sequence is three Sequence, the steps of generating a secondary synchronization sequence, including:

According to the scrambling code sequence s i (k) of the primary synchronization signal and the m sequence m j (w), according to a fifth preset formula
Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);

Wherein, the value of i is an integer of 0 to 2, the value of j is an integer of 0 to 2, and the value of c is an integer of 0 to 111, L=112*(3*i+j)+ c;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S L (r) represents the rth element of the Lth secondary synchronization sequence.
The method according to claim 1, wherein when the scrambling code sequence of said primary synchronizing signal is three and said m-sequence is six, said scrambling code sequence according to said main synchronizing signal and said m Sequence, the steps of generating a secondary synchronization sequence, including:

According to the scrambling code sequence s i (k) of the primary synchronization signal and the m sequence m j (w), according to the sixth preset formula
Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r)

Wherein, the value of i is an integer of 0 to 2, and the value of j is an integer of 0 to 5, and the value of c is an integer of 0 to 55, L=56*(6*i+j)+ c;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S L (r) represents the rth element of the Lth secondary synchronization sequence.
The method according to claim 1, wherein when said scrambling code sequence of said primary synchronizing signal is three and said m-sequence is two, said scrambling code sequence according to said main synchronizing signal and said m Sequence, the steps of generating a secondary synchronization sequence, including:

According to the seventh predetermined formula according to the scrambling code sequence s i (k) of the primary synchronization signal and the m sequences m 0 (w) and m 1 (w)
Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);

Wherein, the value of i is an integer of 0 to 2, the value of v is an integer of 0 to 2, and the value of c is an integer of 0 to 55, L=112*(3*i+v)+ c;

b v is a preset constant, and 0 ≤ b v < N, and b 0 ≠ b 1 ≠ b 2 ;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S L (r) represents the rth element of the Lth secondary synchronization sequence.
A base station comprising:

a scrambling code sequence generating module, configured to generate a scrambling code sequence of the primary synchronization signal;

a first m sequence generating module, configured to generate an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and m of the m sequences generated by any two primitive polynomials Sequence pairs are preferred pairs of m sequences;

And a secondary synchronization sequence generating module, configured to generate a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence.
The base station according to claim 7, wherein the scrambling code sequence generating module comprises:

a first calculating unit for using the first preset formula

Calculating a first reference sequence x(h), where x(h) represents the hth element in the first reference sequence, and the value of h is an integer of 0 to N-1 in turn.
The values are in the order of 0 to N-8, and the binary consists of x(0), x(1), x(2), x(3), x(4), x(5), and x(6). The sequence is a non-zero sequence constant;

a second calculating unit, configured to follow the second preset formula according to the first reference sequence x(h)
Calculating the second reference sequence
among them,
Representing the hth element in the second reference sequence;

a third calculating unit for using the third preset formula
Generating a scrambling code sequence of three primary synchronization signals having a length of a preset length, where s i (k) represents the kth element in the scrambling sequence of the i-th primary synchronization signal, and the value of i is 0 to 0 integer, k is an integer of value 2 is sequentially 0 ~ N-1 is, N represents a preset length, c i is a preset constant.
The base station according to claim 7, wherein the first m sequence generation module comprises:

a fourth calculating unit, configured to: according to each of the predetermined primitive polynomials g=a 0 *2 n +a 1 *2 n-1 +...+a n-1 *2 1 +a n *2 0 , Determining a formula for calculating a third reference sequence y(w) corresponding to each of the primitive polynomials:
Wherein, n is the degree of freedom of the primitive polynomial, a 0 = a n = 1 , a 1 ~ a n-1 , respectively, the value 0 or 1, t is an integer value of order of 1 ~ n, y ( w) represents the wth element in the third reference sequence;

a fifth calculating unit, configured to preset initial values and formulas corresponding to each of the primitive polynomials
Calculating the third reference sequence y(w) corresponding to each of the primitive polynomials, wherein the preset initial value is y(0) to y(n-1), and y(0) to y The binary sequence composed of (n-1) is a non-zero sequence constant, and the value of w is in turn an integer of 0 to N-1.
The values are in the order of 0 to Nn-1, and N=2 n -1;

a sixth calculating unit, configured to generate, according to the fourth preset formula m(w)=1-2y(w) according to the third reference sequence y(w) corresponding to each of the primitive polynomials An m-sequence corresponding to the primitive polynomial, where m(w) represents the wth element in an m-sequence.
The base station according to claim 7, wherein when the scrambling sequence of the primary synchronization signal is three and the m sequence is three, the secondary synchronization sequence generating module includes:

a first processing unit, configured to follow a fifth preset formula according to the scrambling code sequence s i (k) of the primary synchronization signal and the m sequence m j (w)
Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);

Wherein, the value of i is an integer of 0 to 2, the value of j is an integer of 0 to 2, and the value of c is an integer of 0 to 111, L=112*(3*i+j)+ c;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S L (r) represents the rth element of the Lth secondary synchronization sequence.
The base station according to claim 7, wherein when the scrambling sequence of the primary synchronization signal is three and the m sequence is six, the secondary synchronization sequence generating module includes:

a second processing unit, configured to follow a sixth preset formula according to the scrambling code sequence s i (k) of the primary synchronization signal and the m sequence m j (w)
Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r)

Wherein, the value of i is an integer of 0 to 2, and the value of j is an integer of 0 to 5, and the value of c is an integer of 0 to 55, L=56*(6*i+j)+ c;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S L (r) represents the rth element of the Lth secondary synchronization sequence.
The base station according to claim 7, wherein when the scrambling sequence of the primary synchronization signal is three and the m sequence is two, the secondary synchronization sequence generating module includes:

a third processing unit, configured to use the seventh preset formula according to the scrambling code sequence s i (k) of the primary synchronization signal and the m sequences m 0 (w) and m 1 (w)
Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);

Wherein, the value of i is an integer of 0 to 2, the value of v is an integer of 0 to 2, and the value of c is an integer of 0 to 55, L=112*(3*i+v)+ c;

b v is a preset constant, and 0 ≤ b v < N, and b 0 ≠ b 1 ≠ b 2 ;

The value of k is an integer of 0 to N-1, and the value of w is an integer of 0 to N-1, and the value of r is an integer of 0 to N-1.

N represents the length of the scrambling code sequence of the primary synchronization signal, the length of the m sequence, the length of the secondary synchronization sequence, and S L (r) represents the rth element of the Lth secondary synchronization sequence.
A base station includes a first memory, a first processor, and a computer program stored on the first memory and operable on the first processor; the first processor implements the following when executing the program step:

Generating a scrambling sequence of the primary synchronization signal;

Generating an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are preferred pairs of m sequences;

A secondary synchronization sequence is generated according to the scrambling code sequence of the primary synchronization signal and the m sequence.
A computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the following steps:

Generating a scrambling sequence of the primary synchronization signal;

Generating an m sequence according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and the m sequence pairs formed by the m sequences generated by any two primitive polynomials are preferred pairs of m sequences;

A secondary synchronization sequence is generated according to the scrambling code sequence of the primary synchronization signal and the m sequence.
A method for detecting a secondary synchronization sequence, comprising:

Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, wherein the secondary synchronization sequence is based on the m sequence and the scrambling sequence of the primary synchronization signal One of the generated secondary synchronization sequences generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial includes at least two primitive polynomials, and any two primitive polynomials are generated The m sequence pair formed by the m sequence is a preferred pair of m sequences;

Generating an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

Performing cyclic shift on the m sequence to generate an m sequence to be detected;

Performing correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information;

And obtaining cell identity information according to the first partial cell identity information and the second partial cell identity information.
A user equipment comprising:

a descrambling module, configured to perform descrambling on the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, where the secondary synchronization sequence is based on the m sequence and the primary One of the secondary synchronization sequences generated by the scrambling sequence of the synchronization signal, the m sequence being generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial comprises at least two primitive polynomials, and any two The m-sequence pair formed by the m-sequence generated by the primitive polynomial is a preferred pair of m-sequences;

a second m sequence generating module, configured to generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

a cyclic shifting module, configured to cyclically shift the m sequence to generate an m sequence to be detected;

a correlation detecting module, configured to perform correlation detection on the descrambling signal by using the to-be-detected m sequence, to obtain a second partial cell identification information;

And an information acquiring module, configured to obtain cell identity information according to the first partial cell identity information and the second partial cell identity information.
A user equipment comprising a second memory, a second processor, and a computer program stored on the second memory and operable on the second processor; the second processor implementing the program The following steps:

Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, wherein the secondary synchronization sequence is based on the m sequence and the scrambling sequence of the primary synchronization signal One of the generated secondary synchronization sequences generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial includes at least two primitive polynomials, and any two primitive polynomials are generated The m sequence pair formed by the m sequence is a preferred pair of m sequences;

Generating an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

Performing cyclic shift on the m sequence to generate an m sequence to be detected;

Performing correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information;

And obtaining cell identity information according to the first partial cell identity information and the second partial cell identity information.
A computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the following steps:

Des scrambling the secondary synchronization sequence by using the first partial cell identification information obtained by detecting the primary synchronization signal in advance, wherein the secondary synchronization sequence is based on the m sequence and the scrambling sequence of the primary synchronization signal One of the generated secondary synchronization sequences generated according to a predetermined primitive polynomial, wherein the predetermined primitive polynomial includes at least two primitive polynomials, and any two primitive polynomials are generated The m sequence pair formed by the m sequence is a preferred pair of m sequences;

Generating an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence;

Performing cyclic shift on the m sequence to generate an m sequence to be detected;

Performing correlation detection on the descrambling signal by using the to-be-detected m sequence to obtain second partial cell identification information;

And obtaining cell identity information according to the first partial cell identity information and the second partial cell identity information.