WO2018201894A1 - 一种辅同步序列的生成方法、检测方法、基站及用户设备 - Google Patents

一种辅同步序列的生成方法、检测方法、基站及用户设备 Download PDF

Info

Publication number
WO2018201894A1
WO2018201894A1 PCT/CN2018/083547 CN2018083547W WO2018201894A1 WO 2018201894 A1 WO2018201894 A1 WO 2018201894A1 CN 2018083547 W CN2018083547 W CN 2018083547W WO 2018201894 A1 WO2018201894 A1 WO 2018201894A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
secondary synchronization
value
integer
sequences
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2018/083547
Other languages
English (en)
French (fr)
Inventor
赵铮
达人
任斌
郑方政
潘学明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Telecommunications Technology CATT
Original Assignee
China Academy of Telecommunications Technology CATT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN201710531829.8A external-priority patent/CN108811077B/zh
Application filed by China Academy of Telecommunications Technology CATT filed Critical China Academy of Telecommunications Technology CATT
Publication of WO2018201894A1 publication Critical patent/WO2018201894A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements

Definitions

  • 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.
  • 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.
  • 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.
  • 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:
  • 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:
  • 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;
  • 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
  • c i is a preset constant.
  • the step of generating an m sequence according to a predetermined primitive polynomial includes:
  • the step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence include:
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence include:
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 5
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence include:
  • the value of i is an integer of 0 to 2
  • the value of v is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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.
  • 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;
  • 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 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
  • the integer of 2 the value of k is an integer of 0 to N-1
  • N represents the preset length
  • c i is a preset constant.
  • the first m sequence generation module includes:
  • 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 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);
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 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)
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 5
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 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);
  • the value of i is an integer of 0 to 2
  • the value of v is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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.
  • 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:
  • 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.
  • 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:
  • 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;
  • a secondary synchronization sequence is generated according to the scrambling code sequence of the primary synchronization signal and the m sequence.
  • An embodiment of the present disclosure further provides a method for detecting a secondary synchronization sequence, including:
  • the m sequence pair formed by the m sequence is a preferred pair of m sequences
  • 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
  • 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 m sequence pair formed by the m sequence is a preferred pair of m sequences
  • 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:
  • the m sequence pair formed by the m sequence is a preferred pair of m sequences
  • 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.
  • 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.
  • FIG. 1 is a flowchart showing a method of generating a secondary synchronization sequence according to a first embodiment of the present disclosure
  • FIG. 2 is a flowchart showing a method of generating a secondary synchronization sequence according to a second embodiment of the present disclosure
  • FIG. 3 is a flowchart showing a method of generating a secondary synchronization sequence according to a third embodiment of the present disclosure
  • FIG. 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.
  • FIG. 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.
  • B corresponding to A means that B is associated with A, and B can be determined from A.
  • 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.
  • 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.
  • 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.
  • the user equipment may receive the secondary synchronization sequence sent by the base station, thereby performing a subsequent synchronization process.
  • a scrambling code sequence of the primary synchronization signal needs to be applied.
  • a scrambling code sequence of the primary synchronization signal needs to be generated before the secondary synchronization sequence is generated.
  • 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.
  • 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.
  • the polynomial is usually expressed in the form of a binary vector ⁇ a 0 , a 1 , . . . , a n ⁇ , and the vector is represented as an octal or a decimal number.
  • 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.
  • SSS NR secondary synchronization signal
  • m-sequences Corresponding m-sequence pairs are referred to as m-sequences (or polynomial) preferred pairs.
  • 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.
  • the cross-correlation values of each preferred pair are [-1, -17, 15].
  • the set of m-sequences is referred to as a connected set.
  • 18 primitive polynomials may have multiple connected sets, and the maximum number of elements of these connected sets is 6.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • a second embodiment of the present disclosure provides a method for generating a secondary synchronization sequence.
  • 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.
  • step 21 comprises:
  • 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;
  • 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
  • c i is a preset constant.
  • a synchronization (PSS) sequence which is used as a scrambling sequence, is generated as follows:
  • c i 0, 1, 2; c 0 ⁇ c 1 ⁇ c 2
  • PAPR peak power to average power ratio
  • 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.
  • 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.
  • the polynomial is usually expressed in the form of a binary vector ⁇ a 0 , a 1 , . . . , a n ⁇ , and the vector is represented as an octal or a decimal number.
  • 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.
  • SSS NR secondary synchronization signal
  • m-sequences Corresponding m-sequence pairs are referred to as m-sequences (or polynomial) preferred pairs.
  • 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.
  • the cross-correlation values of each preferred pair are [-1, -17, 15].
  • the set of m-sequences is referred to as a connected set.
  • 18 primitive polynomials may have multiple connected sets, and the maximum number of elements of these connected sets is 6.
  • 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.
  • 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.
  • step 22 comprises:
  • any three primitive polynomials having a degree of freedom of 7 are selected in advance from the connected set.
  • the specific generation method is:
  • the following initial values can be used:
  • 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).
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • the value of r is an integer of 0 to N-1
  • 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.
  • 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 n -1 through c (1 ⁇ c ⁇ 2 n -1) bits will constitute another m sequence of length 2 n -1.
  • a primitive polynomial with a degree of freedom of n can generate 2 n -1 different m sequences.
  • 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.
  • NR should support at least 1000 PSS scrambled secondary synchronization sequences, at least 334 SSS m sequences are required.
  • each primitive polynomial 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.
  • each m sequence needs to be shifted 112 times, that is, the cyclic shift c needs to have 112 values.
  • 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.
  • 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.
  • 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.
  • a third embodiment of the present disclosure provides a method for generating a secondary synchronization sequence.
  • 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.
  • step 31 comprises:
  • 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;
  • 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
  • c i is a preset constant.
  • the sequence, which is used as a scrambling sequence, is generated as follows:
  • c i 0, 1, 2; c 0 ⁇ c 1 ⁇ c 2
  • PAPR peak power to average power ratio
  • Step 32 Generate an m sequence according to a predetermined primitive polynomial.
  • 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.
  • the polynomial is usually expressed in the form of a binary vector ⁇ a 0 , a 1 , . . . , a n ⁇ , and the vector is represented as an octal or a decimal number.
  • 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.
  • SSS NR secondary synchronization signal
  • m-sequences Corresponding m-sequence pairs are referred to as m-sequences (or polynomial) preferred pairs.
  • 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.
  • the cross-correlation values of each preferred pair are [-1, -17, 15].
  • the set of m-sequences is referred to as a connected set.
  • 18 primitive polynomials may have multiple connected sets, and the maximum number of elements of these connected sets is 6.
  • 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.
  • 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.
  • step 32 comprises:
  • 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.
  • six m sequences of length 127 can be generated according to the predetermined six primitive polynomials, that is, m 0 (0) to m 0 (126), m 1 (0) to m 1 (126) m 2 (0) to m 2 (126), m 3 (0) to m 3 (126), m 4 (0) to m 4 (126), and m 5 (0) to m 5 (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) Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 5
  • 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
  • the value of w is an integer of 0 to N-1
  • the value of r is an integer of 0 to N-1
  • 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.
  • 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 n -1 through c (1 ⁇ c ⁇ 2 n -1) bits will constitute another m sequence of length 2 n -1.
  • a primitive polynomial with a degree of freedom of n can generate 2 n -1 different m sequences.
  • 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.
  • NR should support at least 1000 PSS scrambled secondary synchronization sequences, at least 334 SSS m sequences are required.
  • each primitive polynomial 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.
  • each m sequence needs to be shifted 56 times, that is, the cyclic shift c needs to have 56 values.
  • 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.
  • 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.
  • 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.
  • a fourth embodiment of the present disclosure provides a method for generating a secondary synchronization sequence.
  • 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.
  • step 41 comprises:
  • 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;
  • 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
  • c i is a preset constant.
  • three m sequences s i (k) of length 127 are represented by three PSSs.
  • the sequence, which is used as a scrambling sequence, is generated as follows:
  • c i 0, 1, 2; c 0 ⁇ c 1 ⁇ c 2
  • PAPR peak power to average power ratio
  • Step 42 Generate an m sequence according to a predetermined primitive polynomial.
  • 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.
  • the polynomial is usually expressed in the form of a binary vector ⁇ a 0 , a 1 , . . . , a n ⁇ , and the vector is represented as an octal or a decimal number.
  • 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.
  • SSS NR secondary synchronization signal
  • m-sequences Corresponding m-sequence pairs are referred to as m-sequences (or polynomial) preferred pairs.
  • 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.
  • the cross-correlation values of each preferred pair are [-1, -17, 15].
  • the set of m-sequences is referred to as a connected set.
  • 18 primitive polynomials may have multiple connected sets, and the maximum number of elements of these connected sets is 6.
  • 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.
  • 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.
  • step 42 comprises:
  • any two primitive polynomials having a degree of freedom of 7 are selected in advance from the connected set.
  • the specific generation method is:
  • the following initial values can be used:
  • 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 0 (w) and m 1 (w) Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);
  • the value of i is an integer of 0 to 2
  • the value of v is an integer of 0 to 2
  • 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
  • k is in turn an integer from 0 to N-1
  • the value of w is 0 to 0
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the scrambling code sequence generating module 501 includes:
  • a first calculating unit 5011 configured to follow 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 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 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
  • c i is a preset constant.
  • the first m sequence generation module 502 includes:
  • a fifth calculating unit 5022 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 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) Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 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) Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r)
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 5
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 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 0 (w) and m 1 (w) Perform scrambling and cyclic shift to generate a secondary synchronization sequence S L (r);
  • the value of i is an integer of 0 to 2
  • the value of v is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 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.
  • 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.
  • 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:
  • 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 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.
  • the first processor 700 When generating the scrambling sequence of the primary synchronization signal, the first processor 700 is specifically configured 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;
  • 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 first processor 700 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:
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 first processor 700 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:
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 5
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 first processor 700 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:
  • the value of i is an integer of 0 to 2
  • the value of v is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 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.
  • 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.
  • 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:
  • 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:
  • 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;
  • 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 step of generating an m sequence according to a predetermined primitive polynomial includes:
  • n is the degree of freedom of the primitive polynomial
  • t is an integer value of order of 1 ⁇ n
  • y ( w) represents the wth element in the third reference sequence
  • the step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence include:
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence include:
  • the value of i is an integer of 0 to 2
  • the value of j is an integer of 0 to 5
  • 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
  • the value of w is an integer of 0 to N-1
  • 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 step of generating a secondary synchronization sequence according to the scrambling code sequence of the primary synchronization signal and the m sequence include:
  • the value of i is an integer of 0 to 2
  • the value of v is an integer of 0 to 2
  • 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
  • the value of w is an integer of 0 to N-1
  • 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.
  • 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.
  • 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.
  • the generation of the secondary synchronization sequence is performed by the base station.
  • 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.
  • 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.
  • 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.
  • the primitive polynomials are applied in the process of generating 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.
  • 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.
  • 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
  • the secondary synchronization sequence is detected to obtain the second partial cell identification information
  • the first partial cell identification information and the second partial cell identification information are used to obtain a complete cell. Identification information.
  • 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.
  • the ninth embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence.
  • 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.
  • 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.
  • 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.
  • the generation of the secondary synchronization sequence is performed by the base station.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the first partial cell identification information is obtained after the user equipment detects the primary synchronization signal in advance.
  • Step 92 Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.
  • the primitive polynomials are applied in the process of generating 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.
  • 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.
  • 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.
  • the value of j is an integer of 0 to 2
  • 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
  • M f (g) represents the gth element in the fth m sequence to be detected.
  • 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.
  • 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.
  • 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.
  • the three m sequences are cyclically shifted to generate 336 m sequences to be detected.
  • 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.
  • 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.
  • 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.
  • 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.
  • the primary synchronization signal is detected to obtain the first partial cell identification information
  • the secondary synchronization sequence is detected to obtain the second partial cell identification information
  • the first partial cell identification information and the second partial cell identification information are used to obtain a complete cell. Identification information.
  • 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.
  • a tenth embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence.
  • 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.
  • 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.
  • 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.
  • the generation of the secondary synchronization sequence is performed by the base station.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the first partial cell identification information is obtained after the user equipment detects the primary synchronization signal in advance.
  • Step 102 Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.
  • the primitive polynomials are applied in the process of generating 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.
  • 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.
  • 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.
  • the value of j is an integer of 0 to 5
  • 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
  • M f (g) represents the gth element in the fth m sequence to be detected.
  • 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.
  • 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.
  • 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.
  • the six m sequences are cyclically shifted to generate 336 m sequences to be detected.
  • Step 104 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.
  • the descrambling signal is at least one
  • 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.
  • 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.
  • the primary synchronization signal is detected to obtain the first partial cell identification information
  • the secondary synchronization sequence is detected to obtain the second partial cell identification information
  • the first partial cell identification information and the second partial cell identification information are used to obtain a complete cell. Identification information.
  • 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.
  • an eleventh embodiment of the present disclosure provides a method for detecting a secondary synchronization sequence.
  • 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.
  • 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.
  • 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.
  • the generation of the secondary synchronization sequence is performed by the base station.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the first partial cell identification information is obtained after the user equipment detects the primary synchronization signal in advance.
  • Step 112 Generate an m sequence according to a primitive polynomial applied in the process of generating the secondary synchronization sequence.
  • the primitive polynomials are applied in the process of generating 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.
  • 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.
  • 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 113 According to the m sequence m j (w), according to the tenth preset formula Generate a sequence of m to be detected.
  • the value of j is an integer of 0 to 1
  • the value of v is an integer of 0 to 2
  • b v is a pre- a constant is set, and 0 ⁇ b v ⁇ N, and b 0 ⁇ b 1 ⁇ b 2
  • w is sequentially an integer of 0 to N-1
  • 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
  • M f (g) represents the gth element in the fth m sequence to be detected.
  • 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.
  • 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.
  • 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.
  • the two m sequences are cyclically shifted to generate 336 m sequences to be detected.
  • Step 114 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.
  • the descrambling signal is at least one
  • 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.
  • 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.
  • the primary synchronization signal is detected to obtain the first partial cell identification information
  • the secondary synchronization sequence is detected to obtain the second partial cell identification information
  • the first partial cell identification information and the second partial cell identification information are used to obtain a complete cell. Identification information.
  • 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.
  • 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.
  • 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.
  • the second m sequence generation module 122 includes:
  • An eighth calculating unit 1222 configured to preset initial values and formulas corresponding to each of the primitive polynomials 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 cyclic shift module 123 includes:
  • the value of j is an integer of 0 to 2
  • w is an integer of 0 to N-1
  • 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.
  • the cyclic shift module 123 includes:
  • the value of j is an integer from 0 to 5
  • w is an integer of 0 to N-1
  • 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.
  • 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;
  • the value of j is an integer of 0 to 1
  • the value of v is an integer of 0 to 2
  • b v is a preset constant, and 0 ⁇ b v ⁇ N, and b 0 ⁇ b 1 ⁇ b 2 ;
  • w is an integer of 0 to N-1
  • 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.
  • the descrambling signal is at least one.
  • 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.
  • 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.
  • 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.
  • 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.
  • the second processor 1410 calls and executes the programs and data stored in the second memory 1430, the following process is performed:
  • the m sequence pair formed by the m sequence is a preferred pair of m sequences
  • 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:
  • 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:
  • the second processor 1410 cyclically shifts the m sequence to generate an m sequence to be detected, specifically Used for:
  • the value of j is an integer of 0 to 2
  • w is an integer of 0 to N-1
  • 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.
  • the second processor 1410 cyclically shifts the m sequence to generate an m sequence to be detected, specifically Used for:
  • the value of j is an integer from 0 to 5
  • w is an integer of 0 to N-1
  • 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.
  • the second processor 1410 cyclically shifts the m sequence to generate an m sequence to be detected, specifically Used for:
  • the value of j is an integer of 0 to 1
  • the value of v is an integer of 0 to 2
  • b v is a preset constant, and 0 ⁇ b v ⁇ N, and b 0 ⁇ b 1 ⁇ b 2 ;
  • w is an integer of 0 to N-1
  • 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.
  • 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:
  • 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.
  • 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.
  • 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.
  • 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.
  • the storage medium may be any known storage medium or any storage medium developed in the future.
  • various components or steps may be decomposed and/or recombined.
  • 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:
  • the m sequence pair formed by the m sequence is a preferred pair of m sequences
  • 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 secondary synchronization sequence is descrambled by using the target scrambling code sequence to obtain a descrambling signal.
  • the step of generating an m sequence according to the primitive polynomial applied in the process of generating the secondary synchronization sequence includes:
  • the step of cyclically shifting the m sequence to generate an m sequence to be detected includes:
  • the value of j is an integer of 0 to 2
  • w is an integer of 0 to N-1
  • 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.
  • the step of cyclically shifting the m sequence to generate an m sequence to be detected includes:
  • the value of j is an integer from 0 to 5
  • w is an integer of 0 to N-1
  • 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.
  • 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:
  • the value of j is an integer of 0 to 1
  • the value of v is an integer of 0 to 2
  • b v is a preset constant, and 0 ⁇ b v ⁇ N, and b 0 ⁇ b 1 ⁇ b 2 ;
  • w is an integer of 0 to N-1
  • 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.
  • 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:

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Synchronisation In Digital Transmission Systems (AREA)

Abstract

本公开提供了一种辅同步序列的生成方法、检测方法、基站及用户设备，该辅同步序列的生成方法包括：生成主同步信号的扰码序列；根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。

Description

一种辅同步序列的生成方法、检测方法、基站及用户设备
相关申请的交叉引用
本申请主张在2017年5月5日在中国提交的中国专利申请号No.201710313805.5的优先权，并主张2017年6月28日在中国提交的中国专利申请号No.201710531829.8的优先权其全部内容通过引用包含于此。
技术领域
本公开涉及通信技术领域，尤其涉及一种辅同步序列的生成方法、检测方法、基站及用户设备。
背景技术
在LTE中，辅同步序列通过由两个31长的m序列生成，可以生成168个序列，结合3个主同步序列，可以对应区分504个不同的物理层小区标识。采用两个短序列的好处是通过两个序列的联合检测可以表示更多的ID，另外检测复杂度低。但是，联合检测的检测精度较低。
此外，在NR系统中，主辅同步序列都是127长。相对LTE的63点长的同步序列，NR的同步序列增加了一倍，此外，在NR系统中，同步序列具有较长的周期。所以，如果在NR系统中也像LTE系统中联合若干周期的同步信号进行检测，会使得延迟更长。因此，为了降低同步检测的延迟，需要同步检测尽可能提高一次检测的精度。
发明内容
本公开的实施例提供了一种辅同步序列的生成方法、检测方法、基站及用户设备，能够生成互相关较低的辅同步序列，从而提高一次检测的精度。
本公开的实施例提供了一种辅同步序列的生成方法，包括：
生成主同步信号的扰码序列；
根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序 列对为m序列优选对；
根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，所述生成主同步信号的扰码序列的步骤，包括：
按照第一预设公式
Figure PCTCN2018083547-appb-000001
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000002
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000003
计算第二参考序列
Figure PCTCN2018083547-appb-000004
其中，
Figure PCTCN2018083547-appb-000005
表示所述第二参考序列中第h个元素；
按照第三预设公式
Figure PCTCN2018083547-appb-000006
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
其中，所述根据预先确定的本原多项式生成m序列的步骤，包括：
根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000007
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000008
Figure PCTCN2018083547-appb-000009
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000010
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为三个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤， 包括：
根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
Figure PCTCN2018083547-appb-000011
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为六个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
Figure PCTCN2018083547-appb-000012
进行加扰和循环移位，生成辅同步序列S L(r)
其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为两个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
Figure PCTCN2018083547-appb-000013
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取 值依次为0～55的整数，L＝112*(3*i+v)+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
本公开的实施例还提供了一种基站，包括：
扰码序列生成模块，用于生成主同步信号的扰码序列；
第一m序列生成模块，用于根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
辅同步序列生成模块，用于根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，所述扰码序列生成模块包括：
第一计算单元，用于按照第一预设公式
Figure PCTCN2018083547-appb-000014
Figure PCTCN2018083547-appb-000015
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000016
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
第二计算单元，用于根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000017
计算第二参考序列
Figure PCTCN2018083547-appb-000018
其中，
Figure PCTCN2018083547-appb-000019
表示所述第二参考序列中第h个元素；
第三计算单元，用于按照第三预设公式
Figure PCTCN2018083547-appb-000020
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
其中，所述第一m序列生成模块包括：
第四计算单元，用于根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、 用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000021
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
第五计算单元，用于根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000022
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000023
的取值依次为0～N-n-1的整数，N＝2 n-1；
第六计算单元，用于根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为三个时，所述辅同步序列生成模块包括：
第一处理单元，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
Figure PCTCN2018083547-appb-000024
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为六个时，所述辅同步序列生成模块包括：
第二处理单元，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
Figure PCTCN2018083547-appb-000025
进行加扰和循环移位，生成辅同步序列S L(r)
其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为两个时，所述辅同步序列生成模块包括：
第三处理单元，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
Figure PCTCN2018083547-appb-000026
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
本公开的实施例还提供了一种基站，包括第一存储器、第一处理器及存储在所述第一存储器上并可在所述第一处理器上运行的计算机程序；所述第一处理器执行所述程序时实现以下步骤：
生成主同步信号的扰码序列；
根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
本公开的实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现以下步骤：
生成主同步信号的扰码序列；
根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式 包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
本公开的实施例还提供了一种辅同步序列的检测方法，包括：
利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
对所述m序列进行循环移位，生成待检测m序列；
利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
本公开的实施例还提供了一种用户设备，包括：
解扰模块，用于利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
第二m序列生成模块，用于根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
循环移位模块，用于对所述m序列进行循环移位，生成待检测m序列；
相关检测模块，用于利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
信息获取模块，用于根据所述第一部分小区标识信息和所述第二部分小 区标识信息，获得小区标识信息。
本公开的实施例还提供了一种用户设备，包括第二存储器、第二处理器及存储在所述第二存储器上并可在所述第二处理器上运行的计算机程序；所述第二处理器执行所述程序时实现以下步骤：
利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
对所述m序列进行循环移位，生成待检测m序列；
利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
本公开的实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现以下步骤：
利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
对所述m序列进行循环移位，生成待检测m序列；
利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小 区标识信息。
用户设备接收到基站发送的同步信号，用主同步序列对信号进行解扰、然后对解扰后的信号进行相关检测，从而获得时频同步，以及小区标识信息。
本公开的上述技术方案的有益效果是：根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
附图说明
图1表示本公开第一实施例的辅同步序列的生成方法的流程图；
图2表示本公开第二实施例的辅同步序列的生成方法的流程图；
图3表示本公开第三实施例的辅同步序列的生成方法的流程图；
图4表示本公开第四实施例的辅同步序列的生成方法的流程图；
图5表示本公开第五实施例的基站的结构框图之一；
图6表示本公开第五实施例的基站的结构框图之二；
图7表示本公开第六实施例的基站的结构框图；
图8表示本公开第八实施例的辅同步序列的检测方法的流程图；
图9表示本公开第九实施例的辅同步序列的检测方法的流程图；
图10表示本公开第十实施例的辅同步序列的检测方法的流程图；
图11表示本公开第十一实施例的辅同步序列的检测方法的流程图；
图12表示本公开第十二实施例的用户设备的结构框图之一；
图13表示本公开第十二实施例的用户设备的结构框图之二；
图14表示本公开第十三实施例的用户设备的结构框图。
具体实施方式
为使本公开要解决的技术问题、技术方案和优点更加清楚，下面将结合 附图及具体实施例进行详细描述。在下面的描述中，提供诸如具体的配置和组件的特定细节仅仅是为了帮助全面理解本公开的实施例。因此，本领域技术人员应该清楚，可以对这里描述的实施例进行各种改变和修改而不脱离本公开的范围和精神。另外，为了清楚和简洁，省略了对已知功能和构造的描述。
应理解，说明书通篇中提到的“一个实施例”或“一实施例”意味着与实施例有关的特定特征、结构或特性包括在本公开的至少一个实施例中。因此，在整个说明书各处出现的“在一个实施例中”或“在一实施例中”未必一定指相同的实施例。此外，这些特定的特征、结构或特性可以任意适合的方式结合在一个或多个实施例中。
在本公开的各种实施例中，应理解，下述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本公开实施例的实施过程构成任何限定。
在本申请所提供的实施例中，应理解，“与A相应的B”表示B与A相关联，根据A可以确定B。但还应理解，根据A确定B并不意味着仅仅根据A确定B，还可以根据A和/或其它信息确定B。
具体地，本公开的实施例提供了一种辅同步序列的生成方法，解决了相关技术中的同步检测的检测精度较低的问题。
第一实施例
如图1所示，本公开的实施例提供了一种辅同步序列的生成方法，具体包括以下步骤：
步骤11：生成主同步信号的扰码序列。
其中，辅同步序列的生成由基站来完成。具体地，基站可以每隔预设时间间隔生成一次辅同步序列并发送出去，或者基站通过配置生成一次辅同步序列并发送出去。当用户设备开机启动需要与系统网络同步时，或者用户设备在使用过程中下行掉线(即下行失步)时，用户设备则可以接收基站发送的辅同步序列，从而执行后续的同步过程。
而本公开的实施例中，对于基站生成辅同步序列的过程中，需要应用主同步信号的扰码序列。因而，在生成辅同步序列之前，需要生成主同步信号 的扰码序列。
其中，由于本公开实施例中，生成辅同步序列的过程中应用了主同步信号的扰码序列，所以，最终生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。
步骤12：根据预先确定的本原多项式生成m序列。
其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
另外，周期为N＝2 n-1的m序列可由自由度为n的本原多项式g(x)＝a 0x n+a 1x n-1+…+a n-1x 1+a n生成，其中，a 0＝a n＝1，其他的a i(i＝1、2…n-1)在0和1间取值。其中，通常将该多项式表示为二进制向量{a 0，a 1，…，a n}的形式，并将该向量表示八进制或十进制数。
对于生成长度为2 n-1的m序列，有不同的自由度为n的本原多项式可以选择。这些本原多项式具有不同的互相关特性。m序列的互相关的结果最少会呈现出三个不同的值。为了保证NR辅同步信号(SSS)的检测特性，应选择互相关值较小的本原多项式。
其中，对于两个m序列，如果他们的互相关呈现出最小的三个值[-1,-t(n),t(n)-2]，其中
Figure PCTCN2018083547-appb-000027
相应的m序列对被称为m序列(或多项式)优选对。其中，在NR系统中，m序列的长度为127，则对于长度为127的m序列，共有18个本原多项式可以用来生成m序列。而且每个优选对的互相关值都为[-1，-17，15]。此外，对于自由度为n的m序列构成的集合，如果每对m序列都是优选对，那么这个m序列构成的集合则被称为连通集。
另外，对于长度为127的m序列，18个本原多项式可以有多个连通集，这些连通集的最大元素个数为6。比如，本原多项式{137,143,191,211,131,171}(十进制)形成了长度为127的m序列最大的连通集。而本原多项式{145,131,171,185,247,229}构成另一个最大连通集。对于本公开的实施例中，采用本原多项式的优选对来生成SSS序列。如果需要多于两个的本原多项式来生成NR SSS，那么本原多项式则应从同一个连通集中选取。
由上述可知，本公开的实施例中，生成辅同步序列所应用的m序列是从同一个连通集中选取的至少两个本原多项式生成的，因此，本公开的实施例中所应用的m序列中任意两个m序列构成的m序列对为m序列优选对，即本公开的实施例中所应用的m序列中任意两个m序列的互相关呈现出最小值。因此，本公开的实施例中，最后生成的辅同步序列具有较低的互相关性，从而避免在同步检测过程中对序列检测的误判，提高了检测精度。
步骤13：根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
在用户侧，用户设备接收到基站发送的信号，利用主同步信号对信号进行解扰，然后对解扰后信号，利用所有本地序列进行相关，相关值最大的本地序列序号即为检测到部分小区ID信息。这里的本地序列就是利用主同步序列，对步骤13生成序列解扰后的所有序列。利用生成辅同步序列可以进一步进行精时偏和精频偏估计。
由上述可知，本公开的实施例，根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
第二实施例
如图2所示，本公开的第二实施例提供了一种辅同步序列的生成方法，当所述主同步信号的扰码序列为三个，所述m序列为三个时，本公开实施例的辅同步序列的生成方法具体包括：
步骤21：生成主同步信号的扰码序列。
优选地，步骤21包括：
按照第一预设公式
Figure PCTCN2018083547-appb-000028
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000029
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、 x(6)组成的二进制序列为非零的序列常量；
根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000030
计算第二参考序列
Figure PCTCN2018083547-appb-000031
其中，
Figure PCTCN2018083547-appb-000032
表示所述第二参考序列中第h个元素；
按照第三预设公式
Figure PCTCN2018083547-appb-000033
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
其中，在NR系统中，主辅同步序列都是127长，因此，步骤21中生成的主同步信号的扰码序列的长度为127，即N＝127。
具体地，举例来说，令3个长度为127的m序列s i(k)(k＝0,1,…,N-1；i＝0,1,2；N＝127)表示3个主同步(PSS)序列，被用作扰码序列，则这三个扰码序列按照如下方式生成：
Figure PCTCN2018083547-appb-000034
其中，i＝0,1,2；k＝0,1,…,126，其中c i(i＝0,1,2；c 0≠c 1≠c 2)为用于生成PSS的m序列的循环移位值。例如,c i(i＝0,1,2)可选为使NR PSS的峰值功率与平均功率比(PAPR)最小的值，也可选为c i＝{0,43,86}。
另外，
Figure PCTCN2018083547-appb-000035
(h＝0,1,…,126),其中x(h)按照如下方式生成：
Figure PCTCN2018083547-appb-000036
其中，
Figure PCTCN2018083547-appb-000037
优选地，初始值为x(0)＝0,x(1)＝1,x(2)＝1,x(3)＝0,x(4)＝1,x(5)＝1,x(6)＝1。
即将初始值代入公式
Figure PCTCN2018083547-appb-000038
得到x(0)～x(126)，从而将x(0)～x(126)依次代入公式
Figure PCTCN2018083547-appb-000039
中，得到
Figure PCTCN2018083547-appb-000040
进而将在i＝0时，将c 0和
Figure PCTCN2018083547-appb-000041
代入公式
Figure PCTCN2018083547-appb-000042
Figure PCTCN2018083547-appb-000043
得到第一个扰码序列；在i＝1时，将c 1和
Figure PCTCN2018083547-appb-000044
代入公式
Figure PCTCN2018083547-appb-000045
得到第二个扰码序列；在i＝2时，将c 2和
Figure PCTCN2018083547-appb-000046
代入公式
Figure PCTCN2018083547-appb-000047
得到第三个扰码序列。
其中，需要注意的是，对于主同步信号的扰码的生成方式并不局限于此。
步骤22：根据预先确定的本原多项式生成m序列。
其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本 原多项式生成的m序列构成的m序列对为m序列优选对。
另外，周期为N＝2 n-1的m序列可由自由度为n的本原多项式g(x)＝a 0x n+a 1x n-1+…+a n-1x 1+a n生成，其中，a 0＝a n＝1，其他的a i(i＝1、2…n-1)在0和1间取值。其中，通常将该多项式表示为二进制向量{a 0，a 1，…，a n}的形式，并将该向量表示八进制或十进制数。
对于生成长度为2 n-1的m序列，有不同的自由度为n的本原多项式可以选择。这些本原多项式具有不同的互相关特性。m序列的互相关的结果最少会呈现出三个不同的值。为了保证NR辅同步信号(SSS)的检测特性，应选择互相关值较小的本原多项式。
其中，对于两个m序列，如果他们的互相关呈现出最小的三个值[-1,-t(n),t(n)-2]，其中
Figure PCTCN2018083547-appb-000048
相应的m序列对被称为m序列(或多项式)优选对。其中，在NR系统中，m序列的长度为127，则对于长度为127的m序列，共有18个本原多项式可以用来生成m序列。而且每个优选对的互相关值都为[-1，-17，15]。此外，对于自由度为n的m序列构成的集合，如果每对m序列都是优选对，那么这个m序列构成的集合则被称为连通集。
另外，对于长度为127的m序列，18个本原多项式可以有多个连通集，这些连通集的最大元素个数为6。比如，本原多项式{137,143,191,211,131,171}(十进制)形成了长度为127的m序列最大的连通集。而本原多项式{145,131,171,185,247,229}构成另一个最大连通集。对于本公开的实施例中，采用本原多项式的优选对来生成SSS序列。如果需要多于两个的本原多项式来生成NR SSS，那么本原多项式则应从同一个连通集中选取。
优选地，步骤22包括：
根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000049
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000050
Figure PCTCN2018083547-appb-000051
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000052
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
具体地，举例而言，预先从连通集中选择任意3个自由度为7的本原多项式。比如预先选择本原多项式{137,143,191}(十进制)来生成3个长度为127的m序列m j(w)，(j＝0,1,2；w＝0,1,…,126)。具体生成方式为：
m j(w)＝1-2y j(w)，其中，w＝0,1,…,126。
其中，由于预先选择的本原多项式137＝2 7+2 3+2 0、143＝2 7+2 3+2 2++2 1+2 0、191＝2 7+2 5+2 4+2 3+2 2+2 1+2 0，所以，分别可以得到如下三个公式：
Figure PCTCN2018083547-appb-000053
Figure PCTCN2018083547-appb-000054
Figure PCTCN2018083547-appb-000055
其中，初始值{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)为非零序列。例如，可采用如下初始值：
y 0(0)＝y 0(1)＝y 0(2)＝y 0(3)＝y 0(4)＝y 0(5)＝0,y 0(6)＝1；
y 1(0)＝y 1(1)＝y 1(2)＝y 1(3)＝y 1(4)＝y 1(5)＝0,y 1(6)＝1；
y 2(0)＝y 2(1)＝y 2(2)＝y 2(3)＝y 2(4)＝y 2(5)＝0,y 2(6)＝1。
即根据预先确定的本原多项式{137,143,191}(十进制)，生成了3个长度为127的m序列m 0(0)～m 0(126)、m 1(0)～m 1(126)、m 2(0)～m 2(126)。
步骤23：根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
Figure PCTCN2018083547-appb-000056
进行加扰和循环移位，生成辅同步序列S L(r)。
其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，一个m序列可以通过n级二进制线性反馈移位寄存器实现，该寄存器的初始值为长度为n的二进制非零序列。一个长度为2 n-1的m序列经过c(1≤c<2 n-1)位的循环移位将构成了另一个长度为2 n-1的m序列。因此一个自由度为n的本原多项式可以生成2 n-1个不同的m序列。
对于NR辅同步序列，m序列的长度为127。因此，产生辅同步序列的m序列的本原多项式自由度应为7(2 7-1＝127)。对于m序列的循环移位c(1≤c<2 n-1)，本原多项式自由度为7的本原多项式可以产生127个不同的m序列用作辅同步序列。考虑到NR应该至少支持1000个经过PSS扰码后的辅同步序列，所以至少需要334个SSS m序列。
其中，当预先确定的本原多项式中包括三个本原多项式时，每一个本原多项式按照对应的初始值生成一个对应的m序列时，当采用主同步信号的3个序列进行扰码时，根据这三个m序列生成辅同步序列时，每一个m序列需要进行至少112次循环移位，才能生成至少1000个辅同步序列。
因此，当所述主同步信号的扰码序列为三个，所述m序列为三个时，每一个m序列需要进行112次移位，即循环移位c需要有112个取值。
即在i＝0,j＝0,c分别取0～111时，分别将前面生成的三个扰码序列s i(k)和m序列m j(w)，代入公式
Figure PCTCN2018083547-appb-000057
中，生成112个辅同步序列；同理，在i＝0,j＝1,c分别取0～111时、i＝0,j＝2,c分别取0～111时、i＝1,j＝0,c分别取0～111时、i＝1,j＝1,c分别取0～111时、i＝1,j＝2,c分别取0～111时、i＝2,j＝0,c分别取0～111时、i＝2,j＝1,c分别取0～111时、i＝2,j＝2,c分别取0～111时、分别将前面生成的三个扰码序列s i(k)和所述m序列m j(w)，代入公式
Figure PCTCN2018083547-appb-000058
Figure PCTCN2018083547-appb-000059
中，在每种情况下分别生成112个辅同步序列，因此，最终生成了9×112＝1008个辅同步序列。
由上述可知，本公开的实施例中，加扰后的辅同步序列的总数为1008。 因此，本公开的实施例中生成的辅同步序列可支持1008个物理层小区标识。相对与LTE系统中只能区分504个不同的物理层小区标识，本公开的实施例，增加了对物理层小区标识的识别数量，从而提升了检测精度。
综上所述，本公开的实施例，根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
第三实施例
如图3所示，本公开的第三实施例提供了一种辅同步序列的生成方法，当所述主同步信号的扰码序列为三个，所述m序列为六个时，本公开实施例的辅同步序列的生成方法具体包括：
步骤31：生成主同步信号的扰码序列。
优选地，步骤31包括：
按照第一预设公式
Figure PCTCN2018083547-appb-000060
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000061
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000062
计算第二参考序列
Figure PCTCN2018083547-appb-000063
其中，
Figure PCTCN2018083547-appb-000064
表示所述第二参考序列中第h个元素；
按照第三预设公式
Figure PCTCN2018083547-appb-000065
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
其中，在NR系统中，主辅同步序列都是127长，因此，步骤21中生成的主同步信号的扰码序列的长度为127，即N＝127。
具体地，举例来说，令3个长度为127的m序列s i(k)(k＝0,1,…,N-1； i＝0,1,2；N＝127)表示3个PSS序列，被用作扰码序列，则这三个扰码序列按照如下方式生成：
Figure PCTCN2018083547-appb-000066
其中，i＝0,1,2；k＝0,1,…,126，其中c i(i＝0,1,2；c 0≠c 1≠c 2)为用于生成PSS的m序列的循环移位值。例如,c i(i＝0,1,2)可选为使NR PSS的峰值功率与平均功率比(PAPR)最小的值，也可选为c i＝{0,43,86}。
另外，
Figure PCTCN2018083547-appb-000067
(h＝0,1,…,126),其中x(h)按照如下方式生成：
Figure PCTCN2018083547-appb-000068
其中，
Figure PCTCN2018083547-appb-000069
优选地，初始值为x(0)＝0,x(1)＝1,x(2)＝1,x(3)＝0,x(4)＝1,x(5)＝1,x(6)＝1。
即将初始值代入公式
Figure PCTCN2018083547-appb-000070
得到x(0)～x(126)，从而将x(0)～x(126)依次代入公式
Figure PCTCN2018083547-appb-000071
中，得到
Figure PCTCN2018083547-appb-000072
进而将在i＝0时，将c 0和
Figure PCTCN2018083547-appb-000073
代入公式
Figure PCTCN2018083547-appb-000074
Figure PCTCN2018083547-appb-000075
得到第一个扰码序列；在i＝1时，将c 1和
Figure PCTCN2018083547-appb-000076
代入公式
Figure PCTCN2018083547-appb-000077
得到第二个扰码序列；在i＝2时，将c 2和
Figure PCTCN2018083547-appb-000078
代入公式
Figure PCTCN2018083547-appb-000079
得到第三个扰码序列。
步骤32：根据预先确定的本原多项式生成m序列。
其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
另外，周期为N＝2 n-1的m序列可由自由度为n的本原多项式g(x)＝a 0x n+a 1x n-1+…+a n-1x 1+a n生成，其中，a 0＝a n＝1，其他的a i(i＝1、2…n-1)在0和1间取值。其中，通常将该多项式表示为二进制向量{a 0，a 1，…，a n}的形式，并将该向量表示八进制或十进制数。
对于生成长度为2 n-1的m序列，有不同的自由度为n的本原多项式可以选择。这些本原多项式具有不同的互相关特性。m序列的互相关的结果最少会呈现出三个不同的值。为了保证NR辅同步信号(SSS)的检测特性，应选择互相关值较小的本原多项式。
其中，对于两个m序列，如果他们的互相关呈现出最小的三个值[-1,-t(n),t(n)-2]，其中
Figure PCTCN2018083547-appb-000080
相应的m序列对被称为m序列 (或多项式)优选对。其中，在NR系统中，m序列的长度为127，则对于长度为127的m序列，共有18个本原多项式可以用来生成m序列。而且每个优选对的互相关值都为[-1，-17，15]。此外，对于自由度为n的m序列构成的集合，如果每对m序列都是优选对，那么这个m序列构成的集合则被称为连通集。
另外，对于长度为127的m序列，18个本原多项式可以有多个连通集，这些连通集的最大元素个数为6。比如，本原多项式{137,143,191,211,131,171}(十进制)形成了长度为127的m序列最大的连通集。而本原多项式{145,131,171,185,247,229}构成另一个最大连通集。对于本公开的实施例中，采用本原多项式的优选对来生成SSS序列。如果需要多于两个的本原多项式来生成NR SSS，那么本原多项式则应从同一个连通集中选取。
优选地，步骤32包括：
根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000081
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000082
Figure PCTCN2018083547-appb-000083
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000084
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
具体地，举例而言，预先从连通集中选择任意六个自由度为7的本原多项式，例如预先确定的六个本原多项式为{137,143,191,211,131,171}(十进制)。其中，根据每一个本原多项式生成一个对应的m序列的过程均相同。例如，根据本原多项式：137(十进制)，生成一个长度为127的m序列m(w)， (w＝0,1,…,126)，其具体生成方式为：
m(w)＝1-2y(w)。
其中，由于预先选择的本原多项式137＝2 7+2 3+2 0，所以，可以得到如下公式：
Figure PCTCN2018083547-appb-000085
其中，可采用如下初始值：
y(0)＝y(1)＝y(2)＝y(3)＝y(4)＝y(5)＝0,y(6)＝1。
因此，按照上述方法，可以根据预先确定的六个本原多项式生成六个长度为127的m序列，即m 0(0)～m 0(126)、m 1(0)～m 1(126)、m 2(0)～m 2(126)、m 3(0)～m 3(126)、m 4(0)～m 4(126)、m 5(0)～m 5(126)。
步骤33：根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
Figure PCTCN2018083547-appb-000086
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，一个m序列可以通过n级二进制线性反馈移位寄存器实现，该寄存器的初始值为长度为n的二进制非零序列。一个长度为2 n-1的m序列经过c(1≤c<2 n-1)位的循环移位将构成了另一个长度为2 n-1的m序列。因此一个自由度为n的本原多项式可以生成2 n-1个不同的m序列。
对于NR辅同步序列，m序列的长度为127。因此，产生辅同步序列的m序列的本原多项式自由度应为7(2 7-1＝127)。对于m序列的循环移位c(1≤c<2 n-1)，本原多项式自由度为7的本原多项式可以产生127个不同的m序列用作辅同步序列。考虑到NR应该至少支持1000个经过PSS扰码后的辅同步序列，所以至少需要334个SSS m序列。
其中，当预先确定的本原多项式中包括六个本原多项式时，每一个本原多项式按照对应的初始值生成一个对应的m序列时，根据这六个m序列生成 辅同步序列时，并且当采用主同步信号的3个序列进行扰码时，每一个m序列需要进行至少56次循环移位，才能生成至少1000个辅同步序列。
因此，当所述主同步信号的扰码序列为三个，所述m序列为六个时，每一个m序列需要进行56次移位，即循环移位c需要有56个取值。
即在i＝0,j＝0,c分别取0～55时，分别将前面生成的三个扰码序列s i(k)和所述m序列m j(w)，代入公式
Figure PCTCN2018083547-appb-000087
中，生成56个辅同步序列。其中，由于i和j的组合方式共有3×6＝18种，所以，在每种情况下分别生成56个辅同步序列，因此，最终生成了18×56＝1008个辅同步序列。
由上述可知，本公开的实施例中，加扰后的辅同步序列的总数为1008。因此，本公开的实施例中生成的辅同步序列可支持1008个物理层小区标识。相对与LTE系统中只能区分504个不同的物理层小区标识，本公开的实施例，增加了对物理层小区标识的识别数量，从而提升了检测精度。
综上所述，本公开的实施例，根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
第四实施例
如图4所示，本公开的第四实施例提供了一种辅同步序列的生成方法，当所述主同步信号的扰码序列为三个，所述m序列为两个时，本公开实施例的辅同步序列的生成方法具体包括：
步骤41：生成主同步信号的扰码序列。
优选地，步骤41包括：
按照第一预设公式
Figure PCTCN2018083547-appb-000088
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000089
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、 x(6)组成的二进制序列为非零的序列常量；
根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000090
计算第二参考序列
Figure PCTCN2018083547-appb-000091
其中，
Figure PCTCN2018083547-appb-000092
表示所述第二参考序列中第h个元素；
按照第三预设公式
Figure PCTCN2018083547-appb-000093
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
其中，在NR系统中，主辅同步序列都是127长，因此，步骤21中生成的主同步信号的扰码序列的长度为127，即N＝127。
具体地，举例来说，令3个长度为127的m序列s i(k)(k＝0,1,…,N-1；i＝0,1,2；N＝127)表示3个PSS序列，被用作扰码序列，则这三个扰码序列按照如下方式生成：
Figure PCTCN2018083547-appb-000094
其中，i＝0,1,2；k＝0,1,…,126，其中c i(i＝0,1,2；c 0≠c 1≠c 2)为用于生成PSS的m序列的循环移位值。例如,c i(i＝0,1,2)可选为使NR PSS的峰值功率与平均功率比(PAPR)最小的值，也可选为c i＝{0,43,86}。
另外，
Figure PCTCN2018083547-appb-000095
(h＝0,1,…,126),其中x(h)按照如下方式生成：
Figure PCTCN2018083547-appb-000096
其中，
Figure PCTCN2018083547-appb-000097
优选地，初始值为x(0)＝0,x(1)＝1,x(2)＝1,x(3)＝0,x(4)＝1,x(5)＝1,x(6)＝1。
即将初始值代入公式
Figure PCTCN2018083547-appb-000098
得到x(0)～x(126)，从而将x(0)～x(126)依次代入公式
Figure PCTCN2018083547-appb-000099
中，得到
Figure PCTCN2018083547-appb-000100
进而将在i＝0时，将c 0和
Figure PCTCN2018083547-appb-000101
代入公式
Figure PCTCN2018083547-appb-000102
Figure PCTCN2018083547-appb-000103
得到第一个扰码序列；在i＝1时，将c 1和
Figure PCTCN2018083547-appb-000104
代入公式
Figure PCTCN2018083547-appb-000105
得到第二个扰码序列；在i＝2时，将c 2和
Figure PCTCN2018083547-appb-000106
代入公式
Figure PCTCN2018083547-appb-000107
得到第三个扰码序列。
步骤42：根据预先确定的本原多项式生成m序列。
其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
另外，周期为N＝2 n-1的m序列可由自由度为n的本原多项式g(x)＝a 0x n+a 1x n-1+…+a n-1x 1+a n生成，其中，a 0＝a n＝1，其他的a i(i＝1、2…n-1)在0和1间取值。其中，通常将该多项式表示为二进制向量{a 0，a 1，…，a n}的形式，并将该向量表示八进制或十进制数。
对于生成长度为2 n-1的m序列，有不同的自由度为n的本原多项式可以选择。这些本原多项式具有不同的互相关特性。m序列的互相关的结果最少会呈现出三个不同的值。为了保证NR辅同步信号(SSS)的检测特性，应选择互相关值较小的本原多项式。
其中，对于两个m序列，如果他们的互相关呈现出最小的三个值[-1,-t(n),t(n)-2]，其中
Figure PCTCN2018083547-appb-000108
相应的m序列对被称为m序列(或多项式)优选对。其中，在NR系统中，m序列的长度为127，则对于长度为127的m序列，共有18个本原多项式可以用来生成m序列。而且每个优选对的互相关值都为[-1，-17，15]。此外，对于自由度为n的m序列构成的集合，如果每对m序列都是优选对，那么这个m序列构成的集合则被称为连通集。
另外，对于长度为127的m序列，18个本原多项式可以有多个连通集，这些连通集的最大元素个数为6。比如，本原多项式{137,143,191,211,131,171}(十进制)形成了长度为127的m序列最大的连通集。而本原多项式{145,131,171,185,247,229}构成另一个最大连通集。对于本公开的实施例中，采用本原多项式的优选对来生成SSS序列。如果需要多于两个的本原多项式来生成NR SSS，那么本原多项式则应从同一个连通集中选取。
优选地，步骤42包括：
根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000109
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000110
Figure PCTCN2018083547-appb-000111
计算与每一个所述本原多项式对应的所述第三参 考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000112
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
具体地，举例而言，预先从连通集中选择任意两个个自由度为7的本原多项式。比如预先选择本原多项式{137,143}(十进制)来生成两个个长度为127的m序列m j(w)，(j＝0,1；w＝0,1,…,126)。具体生成方式为：
m j(w)＝1-2y j(w)，其中，w＝0,1,…,126。
其中，由于预先选择的本原多项式137＝2 7+2 3+2 0、143＝2 7+2 3+2 2++2 1+2 0，所以，分别可以得到如下两个公式：
Figure PCTCN2018083547-appb-000113
Figure PCTCN2018083547-appb-000114
其中，初始值{y j(0),y j(1),y j(2),y j(3),y j(4),y j(5),y j(6)}(j＝0,1)为非零序列。例如，可采用如下初始值：
y 0(0)＝y 0(1)＝y 0(2)＝y 0(3)＝y 0(4)＝y 0(5)＝0,y 0(6)＝1；
y 1(0)＝y 1(1)＝y 1(2)＝y 1(3)＝y 1(4)＝y 1(5)＝0,y 1(6)＝1。
即根据预先确定的本原多项式{137,143}(十进制)，生成了两个长度为127的m序列m 0(0)～m 0(126)、m 1(0)～m 1(126)。
步骤43：根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
Figure PCTCN2018083547-appb-000115
Figure PCTCN2018083547-appb-000116
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示 第L个辅同步序列中第r个元素。
其中，在公式
Figure PCTCN2018083547-appb-000117
中，i的取值为0～2的整数，v的取值为0～2的整数，c的取值为0～111的整数，则i存在3种取值情况，v存在3种取值情况，c存在112中取值情况，因此本公开的实施例中，最终可以生成3×3×112＝1008个辅同步序列。
由上述可知，本公开的实施例中，加扰后的辅同步序列的总数为1008。因此，本公开的实施例中生成的辅同步序列可支持1008个物理层小区标识。相对与LTE系统中只能区分504个不同的物理层小区标识，本公开的实施例，增加了对物理层小区标识的识别数量，从而提升了检测精度。
综上所述，本公开的实施例，根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
第五实施例
以上第一实施例～第四实施例分别就本公开的辅同步序列的生成方法做出介绍，下面本实施例将结合附图对其对应的基站做进一步说明。
具体地，如图5所示，本公开实施例还提供了一种基站500，包括：
扰码序列生成模块501，用于生成主同步信号的扰码序列；
第一m序列生成模块502，用于根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
辅同步序列生成模块503，用于根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
优选地，如图6所示，所述扰码序列生成模块501包括：
第一计算单元5011，用于按照第一预设公式
Figure PCTCN2018083547-appb-000118
Figure PCTCN2018083547-appb-000119
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中 第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000120
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
第二计算单元5012，用于根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000121
计算第二参考序列
Figure PCTCN2018083547-appb-000122
其中，
Figure PCTCN2018083547-appb-000123
表示所述第二参考序列中第h个元素；
第三计算单元5013，用于按照第三预设公式
Figure PCTCN2018083547-appb-000124
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
优选地，如图6所示，所述第一m序列生成模块502包括：
第四计算单元5021，用于根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000125
Figure PCTCN2018083547-appb-000126
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
第五计算单元5022，用于根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000127
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000128
的取值依次为0～N-n-1的整数，N＝2 n-1；
第六计算单元5023，用于根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
优选地，当所述主同步信号的扰码序列为三个，所述m序列为三个时，如图6所示，所述辅同步序列生成模块503包括：
第一处理单元5031，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
Figure PCTCN2018083547-appb-000129
进行加扰和 循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
优选地，当所述主同步信号的扰码序列为三个，所述m序列为六个时，如图6所示，所述辅同步序列生成模块503包括：
第二处理单元5032，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
Figure PCTCN2018083547-appb-000130
进行加扰和循环移位，生成辅同步序列S L(r)
其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
优选地，当所述主同步信号的扰码序列为三个，所述m序列为两个时，如图6所示，所述辅同步序列生成模块503包括：
第三处理单元5033，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
Figure PCTCN2018083547-appb-000131
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
由上述可知，本公开的实施例，根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
第六实施例
本公开的实施例提供了一种基站，包括：第一存储器720、第一处理器700及存储在所述第一存储器720上并可在所述处理器上运行的计算机程序；第一处理器700，用于读取第一存储器720中的程序，执行下列过程：
生成主同步信号的扰码序列；
根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，在图7中，总线架构可以包括任意数量的互联的总线和桥，具体由第一处理器700代表的一个或多个处理器和第一存储器720代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口提供接口。第一收发机710可以是多个元件，即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元。第一处理器700负责管理总线架构和通常的处理，第一存储器720可以存储第一处理器700在执行操作时所使用的数据。
第一处理器700负责管理总线架构和通常的处理，第一存储器720可以存储第一处理器700在执行操作时所使用的数据。
第一处理器700在生成主同步信号的扰码序列时，具体用于：
按照第一预设公式
Figure PCTCN2018083547-appb-000132
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000133
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000134
计算第二参考序列
Figure PCTCN2018083547-appb-000135
其中，
Figure PCTCN2018083547-appb-000136
表示所述第二参考序列中第h个元素；
按照第三预设公式
Figure PCTCN2018083547-appb-000137
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
第一处理器700在根据预先确定的本原多项式生成m序列时，具体用于：
根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000138
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000139
Figure PCTCN2018083547-appb-000140
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000141
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
当所述主同步信号的扰码序列为三个，所述m序列为三个时，第一处理器700在根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列时，具体用于：
根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
Figure PCTCN2018083547-appb-000142
进行加扰和循环移位，生成辅同步 序列S L(r)；
其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
当所述主同步信号的扰码序列为三个，所述m序列为六个时，第一处理器700在根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列时，具体用于：
根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
Figure PCTCN2018083547-appb-000143
进行加扰和循环移位，生成辅同步序列S L(r)
其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
当所述主同步信号的扰码序列为三个，所述m序列为两个时，第一处理器700在根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列时，具体用于：
根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
Figure PCTCN2018083547-appb-000144
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值 依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
综上所述，本公开的实施例，根据主同步信号的扰码序列和m序列生成辅同步序列，使得生成的辅同步序列中包含主同步序列的扰码序列，从而在同步检测过程中可以根据该扰码序列对主同步信号进行检错，避免对主同步信号的误判，提高了检测精度。此外，由于生成辅同步序列所采用的m序列是由具有优选对特性的本原多项式生成的，所以，最终生成的辅同步序列的互相关性较低，从而避免在同步检测过程中对序列检测的误判，进一步提高了检测精度。
第七实施例
本公开的实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现以下步骤：
生成主同步信号的扰码序列；
根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，所述生成主同步信号的扰码序列的步骤，包括：
按照第一预设公式
Figure PCTCN2018083547-appb-000145
计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000146
的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
根据所述第一参考序列x(h)，按照第二预设公式
Figure PCTCN2018083547-appb-000147
计算第二参考序列
Figure PCTCN2018083547-appb-000148
其中，
Figure PCTCN2018083547-appb-000149
表示所述第二参考序列中第h个元素；
按照第三预设公式
Figure PCTCN2018083547-appb-000150
生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
其中，所述根据预先确定的本原多项式生成m序列的步骤，包括：
根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000151
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000152
Figure PCTCN2018083547-appb-000153
计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000154
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为三个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
Figure PCTCN2018083547-appb-000155
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为六个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
Figure PCTCN2018083547-appb-000156
进行加扰和循环移位，生成辅同步序列S L(r)
其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
其中，当所述主同步信号的扰码序列为三个，所述m序列为两个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
Figure PCTCN2018083547-appb-000157
进行加扰和循环移位，生成辅同步序列S L(r)；
其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
第八实施例
本公开的实施例提供了一种辅同步序列的检测方法，如图8所示，具体包括以下步骤：
步骤81：利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号。
其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成 的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
即所述辅同步序列按照如下过程生成：首先，生成主同步信号的扰码序列；其次，根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；最后，根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，上述过程可以生成多个辅同步序列，而本公开的实施例中，是对上述生成过程中生成的多个辅同步序列中的其中一个进行检测的过程。
另外，辅同步序列的生成由基站来完成。具体地，基站可以每隔预设时间间隔生成一次辅同步序列并发送出去，或者基站通过配置生成一次辅同步序列并发送出去。当用户设备开机启动需要与系统网络同步时，或者用户设备在使用过程中下行掉线(即下行失步)时，用户设备则可以接收基站发送的辅同步序列，并对接收到的辅同步序列进行检测。
其中，基站一次生成多个辅同步序列，但是基站具体将哪一个辅同步序列发送给哪一个用户设备，由用户设备的ID决定。
此外，所述第一部分小区标识信息是用户设备预先对主同步信号进行检测后获得的。
步骤82：根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列。
其中，生成辅同步序列的过程中应用的哪些本原多项式，则在对该辅同步序列的检测过程中，同样应用哪些本原多项式生成对应的m序列。因而，当生成辅同步序列所采用的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对时，对辅同步序列进行检测时所应用的本原多项式同样包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对，即步骤82中生成的m序列中任意两个m序列的互相关呈现出最小值。
另外，可通过系统配置的方式，为基站和用户设备配置相同的本原多项式，从而使得基站生成辅同步序列时默认采用配置的本原多项式生成辅同步 序列，且用户设备在对辅同步序列的检测过程中默认采用配置的本原多项式对辅同步序列进行检测。
步骤83：对所述m序列进行循环移位，生成待检测m序列。
其中，辅同步序列是对根据预先确定的本原多项式生成的m序列进行循环移位，并加上主同步信号的扰码序列后生成的。而本公开实施例中，生成的待检测m序列即为基站生成的所有辅同步序列解扰后的序列，因此，步骤83中进行循环移位的方法与生成辅同步序列的过程中所采用的循环移位方法相同。
步骤84：利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息。
其中，对辅同步序列的检测过程，即为确定出用户设备所接收到的辅同步序列是基站生成的多个辅同步序列中的哪一个。而待检测m序列为基站生成的所有辅同步序列解扰后的序列，且解扰信号是用户设备对接收到的辅同步序列解扰后的序列，因而利用待检测m序列对解扰信号进行相关检测，可以确定出解扰信号与待检测m序列中的哪一个序列最相关，从而获得第二部分小区标识信息。
步骤85：根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
其中，对主同步信号进行检测获得第一部分小区标识信息，对辅同步序列进行检测获得第二部分小区标识信息，则由第一部分小区标识信息和第二部分小区标识信息，则可以得到完整的小区标识信息。
综上所述，本公开实施例的辅同步序列的检测方法，利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，然后根据该辅同步序列的生成过程中所应用的本原多项式生成m序列，进而对生成的m序列进行循环移位，生成待检测m序列，从而利用待检测m序列对辅同步序列解扰后的信号进行相关检测，获得第二部分小区标识信息，进而由第一部分小区标识信息和第二部分小区标识信息，获得完整的小区标识信息。
其中，由于辅同步序列中添加了主同步序列的扰码序列，所以，在对该辅同步序列的检测过程中，可以首先利用预先对主同步信号检测获得的第一 部分小区标识信息对辅同步序列进行解扰，获得解扰信号，提高了检测精度。
第九实施例
如图9所示，本公开的第九实施例提供了一种辅同步序列的检测方法，当辅同步序列的生成过程中所应用的本原多项式包括三个本原多项式时，具体包括以下步骤，
步骤91：利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号。
其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
即所述辅同步序列按照如下过程生成：首先，生成主同步信号的扰码序列；其次，根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；最后，根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，上述过程可以生成多个辅同步序列，而本公开的实施例中，是对上述生成过程中生成的多个辅同步序列中的其中一个进行检测的过程。
另外，辅同步序列的生成由基站来完成。具体地，基站可以每隔预设时间间隔生成一次辅同步序列并发送出去，或者基站通过配置生成一次辅同步序列并发送出去。当用户设备开机启动需要与系统网络同步时，或者用户设备在使用过程中下行掉线(即下行失步)时，用户设备则可以接收基站发送的辅同步序列，并对接收到的辅同步序列进行检测。
其中，基站一次生成多个辅同步序列，但是基站具体将哪一个辅同步序列发送给哪一个用户设备，由用户设备的ID决定。
优选地，步骤91包括：根据第一部分小区标识信息与扰码序列的对应关系，确定与预先对主同步信号进行检测获得的第一部分小区标识信息对应的目标扰码序列；利用所述目标扰码序列对辅同步序列进行解扰，获得解扰信号。
其中，系统中的扰码序列存在九个或者三个，当然，并不局限于此。当系统中当然扰码序列存在九个时，这九个扰码序列被分为三组，分组三个，则第一部分小区标识信息可有三个取值{0，1，2}，每个第一部分小区标识信息分别对应了一组扰码序列。若对主同步信号进行检测获得的第一部分小区标识信息为2，则从扰码序列的第三个组中选出所有的三个扰码序列，分别对辅同步序列信号进行解扰，则会得到三个解扰信号。
另外，当系统中当然扰码序列存在三个时，每个第一部分小区标识信息分别对应了一个扰码序列。若对主同步信号进行检测获得的第一部分小区标识信息为2，则选择第三个扰码序列对辅同步序列信号进行解扰，则会得到一个解扰信号。
此外，所述第一部分小区标识信息是用户设备预先对主同步信号进行检测后获得的。
步骤92：根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列。
其中，生成辅同步序列的过程中应用的哪些本原多项式，则在对该辅同步序列的检测过程中，同样应用哪些本原多项式生成对应的m序列。因而，当生成辅同步序列所采用的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对时，对辅同步序列进行检测时所应用的本原多项式同样包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对，即步骤82中生成的m序列中任意两个m序列的互相关呈现出最小值。
另外，可通过系统配置的方式，为基站和用户设备配置相同的本原多项式，从而使得基站生成辅同步序列时默认采用配置的本原多项式生成辅同步序列，且用户设备在对辅同步序列的检测过程中默认采用配置的本原多项式对辅同步序列进行检测。
优选地，步骤92包括：根据生成所述辅同步序列的过程中所应用的每一个本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第四参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000158
Figure PCTCN2018083547-appb-000159
其中，n为所述本原多项式的自由度，a 0＝a n＝1， a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第四参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000160
Figure PCTCN2018083547-appb-000161
计算与每一个所述本原多项式对应的所述第四参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000162
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第四参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，在本实施例中，辅同步序列的生成过程中所应用的本原多项式的数量可以为三个，则在对辅同步序列的检测过程中生成m序列也应用三个本原多项式。其中，对于根据每一个本原多项式生成一个对应的m序列的过程，与辅同步序列的生成方法中的过程相同，此处不再举例进行赘述。
步骤93：根据所述m序列m j(w)，按照第八预设公式M f(g)＝m j((g+c)modN)，生成待检测m序列。
其中，j的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*j+c；w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
另外，辅同步序列是对根据预先确定的本原多项式生成的m序列进行循环移位，并加上主同步信号的扰码序列后生成的。而本公开实施例中，生成的待检测m序列即为基站生成的所有辅同步序列解扰后的序列，因此，步骤93中进行循环移位的方法与生成辅同步序列的过程中所采用的循环移位方法相同。
此外，当辅同步序列的生成过程中所应用的本原多项式包括三个本原多项式时，本公开的实施例的步骤92中则生成三个m序列。而步骤93中，对这三个m序列进行循环移位，可生成336个待检测m序列。
即在j＝0,c分别取0～111时，f分别取0～111，则将m序列m 0(w)，代入 公式M f(g)＝m j((g+c)modN)中，生成112个待检测m序列M 0(g)～M 111(g)；
同理，在j＝1,c分别取0～111时，f分别取112～223，则将m序列m 1(w)，代入公式M f(g)＝m j((g+c)modN)中，生成112个待检测m序列M 112(g)～M 223(g)；
在j＝2,c分别取0～111时，f分别取224～335，则将m序列m 2(w)，代入公式M f(g)＝m j((g+c)modN)中，生成112个待检测m序列M 224(g)～M 335(g)；
因此，最终生成了3×112＝336个待检测m序列。
步骤94：利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息。
其中，对辅同步序列的检测过程，即为确定出用户设备所接收到的辅同步序列是基站生成的多个辅同步序列中的哪一个。而待检测m序列为基站生成的所有辅同步序列解扰后的序列，且解扰信号是用户设备对接收到的辅同步序列解扰后的序列，因而利用待检测m序列对解扰信号进行相关检测，可以确定出解扰信号与待检测m序列中的哪一个序列最相关，从而获得第二部分小区标识信息。
优选地，所述解扰信号至少为一个，步骤94包括：利用每一个所述待检测m序列依次对每一个所述解扰信号进行相关检测，获得对应的相关值；从获得的相关值中，确定最大相关值对应的待检测m序列；根据所述最大相关值对应的待检测m序列在所有所述待检测m序列中的序号，获得第二部分小区标识信息。
即步骤93中得到336个待检测m序列，则利用这336个待检测m序列分别对每一个解扰信号进行相关检测，然后从获得的所有相关值中确定出最大相关值，从而确定出该最大相关值对应的待检测m序列在所有待检测m序列中的序号，该序号即为第二部分小区标识信息。
步骤95：根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
其中，对主同步信号进行检测获得第一部分小区标识信息，对辅同步序列进行检测获得第二部分小区标识信息，则由第一部分小区标识信息和第二部分小区标识信息，则可以得到完整的小区标识信息。
综上所述，本公开实施例的辅同步序列的检测方法，利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，然后根据该辅同步序列的生成过程中所应用的本原多项式生成m序列，进而对生成的m序列进行循环移位，生成待检测m序列，从而利用待检测m序列对辅同步序列解扰后的信号进行相关检测，获得第二部分小区标识信息，进而由第一部分小区标识信息和第二部分小区标识信息，获得完整的小区标识信息。
其中，由于辅同步序列中添加了主同步序列的扰码序列，所以，在对该辅同步序列的检测过程中，可以首先利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，获得解扰信号，提高了检测精度。
第十实施例
如图10所示，本公开的第十实施例提供了一种辅同步序列的检测方法，当辅同步序列的生成过程中所应用的本原多项式包括六个本原多项式时，具体包括以下步骤，
步骤101：利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号。
其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
即所述辅同步序列按照如下过程生成：首先，生成主同步信号的扰码序列；其次，根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；最后，根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，上述过程可以生成多个辅同步序列，而本公开的实施例中，是对上述生成过程中生成的多个辅同步序列中的其中一个进行检测的过程。
另外，辅同步序列的生成由基站来完成。具体地，基站可以每隔预设时间间隔生成一次辅同步序列并发送出去，或者基站通过配置生成一次辅同步序列并发送出去。当用户设备开机启动需要与系统网络同步时，或者用户设 备在使用过程中下行掉线(即下行失步)时，用户设备则可以接收基站发送的辅同步序列，并对接收到的辅同步序列进行检测。
其中，基站一次生成多个辅同步序列，但是基站具体将哪一个辅同步序列发送给哪一个用户设备，由用户设备的ID决定。
优选地，步骤101包括：根据第一部分小区标识信息与扰码序列的对应关系，确定与预先对主同步信号进行检测获得的第一部分小区标识信息对应的目标扰码序列；利用所述目标扰码序列对辅同步序列进行解扰，获得解扰信号。
其中，系统中的扰码序列存在九个或者三个，当然，并不局限于此。当系统中当然扰码序列存在九个时，这九个扰码序列被分为三组，分组三个，则第一部分小区标识信息可有三个取值{0，1，2}，每个第一部分小区标识信息分别对应了一组扰码序列。若对主同步信号进行检测获得的第一部分小区标识信息为2，则从扰码序列的第三个组中选出所有的三个扰码序列，分别对辅同步序列信号进行解扰，则会得到三个解扰信号。
另外，当系统中当然扰码序列存在三个时，每个第一部分小区标识信息分别对应了一个扰码序列。若对主同步信号进行检测获得的第一部分小区标识信息为2，则选择第三个扰码序列对辅同步序列信号进行解扰，则会得到一个解扰信号。
此外，所述第一部分小区标识信息是用户设备预先对主同步信号进行检测后获得的。
步骤102：根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列。
其中，生成辅同步序列的过程中应用的哪些本原多项式，则在对该辅同步序列的检测过程中，同样应用哪些本原多项式生成对应的m序列。因而，当生成辅同步序列所采用的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对时，对辅同步序列进行检测时所应用的本原多项式同样包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对，即步骤102中生成的m序列中任意两个m序列的互相关呈现出最小值。
另外，可通过系统配置的方式，为基站和用户设备配置相同的本原多项式，从而使得基站生成辅同步序列时默认采用配置的本原多项式生成辅同步序列，且用户设备在对辅同步序列的检测过程中默认采用配置的本原多项式对辅同步序列进行检测。
优选地，步骤102包括：根据生成所述辅同步序列的过程中所应用的每一个本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第四参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000163
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第四参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000164
Figure PCTCN2018083547-appb-000165
计算与每一个所述本原多项式对应的所述第四参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000166
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第四参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，在本实施例中，辅同步序列的生成过程中所应用的本原多项式的数量可以为六个，则在对辅同步序列的检测过程中生成m序列也应用六个本原多项式。其中，对于根据每一个本原多项式生成一个对应的m序列的过程，与辅同步序列的生成方法中的过程相同，此处不再举例进行赘述。
步骤103：根据所述m序列m j(w)，按照第九预设公式M f(g)＝m j((g+2c)modN)，生成待检测m序列。
其中，j的取值依次为0～5的整数，c的取值依次为0～55的整数，f＝56*j+c；w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
另外，辅同步序列是对根据预先确定的本原多项式生成的m序列进行循 环移位，并加上主同步信号的扰码序列后生成的。而本公开实施例中，生成的待检测m序列即为基站生成的所有辅同步序列解扰后的序列，因此，步骤103中进行循环移位的方法与生成辅同步序列的过程中所采用的循环移位方法相同。
此外，当辅同步序列的生成过程中所应用的本原多项式包括三个本原多项式时，本公开的实施例的步骤102中则生成六个m序列。而步骤103中，对这六个m序列进行循环移位，可生成336个待检测m序列。
即在j＝0,c分别取0～55时，f分别取0～55，则将m序列m 0(w)，代入公式M f(g)＝m j((g+2c)modN)中，生成56个待检测m序列M 0(g)～M 55(g)；
同理，在j＝1,c分别取0～55时，f分别取56～111，则将m序列m 1(w)，代入公式M f(g)＝m j((g+2c)modN)中，生成56个待检测m序列M 56(g)～M 111(g)；
在j＝2,c分别取0～55时，f分别取112～167，则将m序列m 2(w)，代入公式M f(g)＝m j((g+2c)modN)中，生成56个待检测m序列M 112(g)～M 167(g)；
在j＝3,c分别取0～55时，f分别取168～223，则将m序列m 3(w)，代入公式M f(g)＝m j((g+2c)modN)中，生成56个待检测m序列M 168(g)～M 223(g)；
在j＝4,c分别取0～55时，f分别取224～279，则将m序列m 4(w)，代入公式M f(g)＝m j((g+2c)modN)中，生成56个待检测m序列M 224(g)～M 279(g)；
在j＝5,c分别取0～55时，f分别取280～335，则将m序列m 5(w)，代入公式M f(g)＝m j((g+2c)modN)中，生成56个待检测m序列M 280(g)～M 335(g)；；
因此，最终生成了6×56＝336个待检测m序列。
步骤104：利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息。
其中，对辅同步序列的检测过程，即为确定出用户设备所接收到的辅同步序列是基站生成的多个辅同步序列中的哪一个。而待检测m序列为基站生成的所有辅同步序列解扰后的序列，且解扰信号是用户设备对接收到的辅同步序列解扰后的序列，因而利用待检测m序列对解扰信号进行相关检测，可以确定出解扰信号与待检测m序列中的哪一个序列最相关，从而获得第二部分小区标识信息。
优选地，所述解扰信号至少为一个，步骤104包括：利用每一个所述待检测m序列依次对每一个所述解扰信号进行相关检测，获得对应的相关值；从获得的相关值中，确定最大相关值对应的待检测m序列；根据所述最大相关值对应的待检测m序列在所有所述待检测m序列中的序号，获得第二部分小区标识信息。
即步骤103中得到336个待检测m序列，则利用这336个待检测m序列分别对每一个解扰信号进行相关检测，然后从获得的所有相关值中确定出最大相关值，从而确定出该最大相关值对应的待检测m序列在所有待检测m序列中的序号，该序号即为第二部分小区标识信息。
步骤105：根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
其中，对主同步信号进行检测获得第一部分小区标识信息，对辅同步序列进行检测获得第二部分小区标识信息，则由第一部分小区标识信息和第二部分小区标识信息，则可以得到完整的小区标识信息。
综上所述，本公开实施例的辅同步序列的检测方法，利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，然后根据该辅同步序列的生成过程中所应用的本原多项式生成m序列，进而对生成的m序列进行循环移位，生成待检测m序列，从而利用待检测m序列对辅同步序列解扰后的信号进行相关检测，获得第二部分小区标识信息，进而由第一部分小区标识信息和第二部分小区标识信息，获得完整的小区标识信息。
其中，由于辅同步序列中添加了主同步序列的扰码序列，所以，在对该辅同步序列的检测过程中，可以首先利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，获得解扰信号，提高了检测精度。
第十一实施例
如图11所示，本公开的第十一实施例提供了一种辅同步序列的检测方法，当辅同步序列的生成过程中所应用的本原多项式包括两个本原多项式时，具体包括以下步骤，
步骤111：利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号。
其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对。
即所述辅同步序列按照如下过程生成：首先，生成主同步信号的扰码序列；其次，根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；最后，根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
其中，上述过程可以生成多个辅同步序列，而本公开的实施例中，是对上述生成过程中生成的多个辅同步序列中的其中一个进行检测的过程。
另外，辅同步序列的生成由基站来完成。具体地，基站可以每隔预设时间间隔生成一次辅同步序列并发送出去，或者基站通过配置生成一次辅同步序列并发送出去。当用户设备开机启动需要与系统网络同步时，或者用户设备在使用过程中下行掉线(即下行失步)时，用户设备则可以接收基站发送的辅同步序列，并对接收到的辅同步序列进行检测。
其中，基站一次生成多个辅同步序列，但是基站具体将哪一个辅同步序列发送给哪一个用户设备，由用户设备的ID决定。
优选地，步骤111包括：根据第一部分小区标识信息与扰码序列的对应关系，确定与预先对主同步信号进行检测获得的第一部分小区标识信息对应的目标扰码序列；利用所述目标扰码序列对辅同步序列进行解扰，获得解扰信号。
其中，系统中的扰码序列存在九个或者三个，当然，并不局限于此。当系统中当然扰码序列存在九个时，这九个扰码序列被分为三组，分组三个，则第一部分小区标识信息可有三个取值{0，1，2}，每个第一部分小区标识信息分别对应了一组扰码序列。若对主同步信号进行检测获得的第一部分小区标识信息为2，则从扰码序列的第三个组中选出所有的三个扰码序列，分别对辅同步序列信号进行解扰，则会得到三个解扰信号。
另外，当系统中当然扰码序列存在三个时，每个第一部分小区标识信息 分别对应了一个扰码序列。若对主同步信号进行检测获得的第一部分小区标识信息为2，则选择第三个扰码序列对辅同步序列信号进行解扰，则会得到一个解扰信号。
此外，所述第一部分小区标识信息是用户设备预先对主同步信号进行检测后获得的。
步骤112：根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列。
其中，生成辅同步序列的过程中应用的哪些本原多项式，则在对该辅同步序列的检测过程中，同样应用哪些本原多项式生成对应的m序列。因而，当生成辅同步序列所采用的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对时，对辅同步序列进行检测时所应用的本原多项式同样包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对，即步骤112中生成的m序列中任意两个m序列的互相关呈现出最小值。
另外，可通过系统配置的方式，为基站和用户设备配置相同的本原多项式，从而使得基站生成辅同步序列时默认采用配置的本原多项式生成辅同步序列，且用户设备在对辅同步序列的检测过程中默认采用配置的本原多项式对辅同步序列进行检测。
优选地，步骤112包括：根据生成所述辅同步序列的过程中所应用的每一个本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第四参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000167
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第四参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000168
Figure PCTCN2018083547-appb-000169
计算与每一个所述本原多项式对应的所述第四参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000170
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第四参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，在本实施例中，辅同步序列的生成过程中所应用的本原多项式的数量可以为六个，则在对辅同步序列的检测过程中生成m序列也应用六个本原多项式。其中，对于根据每一个本原多项式生成一个对应的m序列的过程，与辅同步序列的生成方法中的过程相同，此处不再举例进行赘述。
步骤113：根据所述m序列m j(w)，按照第十预设公式
Figure PCTCN2018083547-appb-000171
Figure PCTCN2018083547-appb-000172
生成待检测m序列。
其中，j的取值依次为0～1的整数，v的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*v+c；b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
另外，辅同步序列是对根据预先确定的本原多项式生成的m序列进行循环移位，并加上主同步信号的扰码序列后生成的。而本公开实施例中，生成的待检测m序列即为基站生成的所有辅同步序列解扰后的序列，因此，步骤113中进行循环移位的方法与生成辅同步序列的过程中所采用的循环移位方法相同。
此外，当辅同步序列的生成过程中所应用的本原多项式包括两个本原多项式时，本公开的实施例的步骤112中则生成两个m序列。而步骤113中，对这两个m序列进行循环移位，可生成336个待检测m序列。
即在v＝0,c分别取0～111时，f分别取0～111，则将b 0和m序列m 0(w)、m 1(w)代入公式
Figure PCTCN2018083547-appb-000173
中，生成112个待检测m序列M 0(g)～M 111(g)；
同理，在在v＝1,c分别取0～111时，f分别取112～223，则将b 1和m序列m 0(w)、m 1(w)代入公式
Figure PCTCN2018083547-appb-000174
中，生成112个待检测m序列M 112(g)～M 223(g)；
在v＝2,c分别取0～111时，f分别取224～335，则将b 2和m序列m 0(w)、 m 1(w)代入公式
Figure PCTCN2018083547-appb-000175
中，生成112个待检测m序列M 224(g)～M 335(g)；
因此，最终生成了3×112＝336个待检测m序列。
步骤114：利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息。
其中，对辅同步序列的检测过程，即为确定出用户设备所接收到的辅同步序列是基站生成的多个辅同步序列中的哪一个。而待检测m序列为基站生成的所有辅同步序列解扰后的序列，且解扰信号是用户设备对接收到的辅同步序列解扰后的序列，因而利用待检测m序列对解扰信号进行相关检测，可以确定出解扰信号与待检测m序列中的哪一个序列最相关，从而获得第二部分小区标识信息。
优选地，所述解扰信号至少为一个，步骤114包括：利用每一个所述待检测m序列依次对每一个所述解扰信号进行相关检测，获得对应的相关值；从获得的相关值中，确定最大相关值对应的待检测m序列；根据所述最大相关值对应的待检测m序列在所有所述待检测m序列中的序号，获得第二部分小区标识信息。
即步骤113中得到336个待检测m序列，则利用这336个待检测m序列分别对每一个解扰信号进行相关检测，然后从获得的所有相关值中确定出最大相关值，从而确定出该最大相关值对应的待检测m序列在所有待检测m序列中的序号，该序号即为第二部分小区标识信息。
步骤115：根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
其中，对主同步信号进行检测获得第一部分小区标识信息，对辅同步序列进行检测获得第二部分小区标识信息，则由第一部分小区标识信息和第二部分小区标识信息，则可以得到完整的小区标识信息。
综上所述，本公开实施例的辅同步序列的检测方法，利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，然后根据该辅同步序列的生成过程中所应用的本原多项式生成m序列，进而对生成的m序列进行循环移位，生成待检测m序列，从而利用待检测m序列对辅同步序 列解扰后的信号进行相关检测，获得第二部分小区标识信息，进而由第一部分小区标识信息和第二部分小区标识信息，获得完整的小区标识信息。
其中，由于辅同步序列中添加了主同步序列的扰码序列，所以，在对该辅同步序列的检测过程中，可以首先利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，获得解扰信号，提高了检测精度。
第十二实施例
本公开的实施例提供了一种用户设备，如图12所示，该用户设备120包括：
解扰模块121，用于利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
第二m序列生成模块122，用于根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
循环移位模块123，用于对所述m序列进行循环移位，生成待检测m序列；
相关检测模块124，用于利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
信息获取模块125，用于根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
优选地，如图13所示，所述解扰模块121包括：
扰码序列确定单元1211，用于根据第一部分小区标识信息与扰码序列的对应关系，确定与预先对主同步信号进行检测获得的第一部分小区标识信息对应的目标扰码序列；
解扰单元1212，用于利用所述目标扰码序列对辅同步序列进行解扰，获得解扰信号。
优选地，如图13所示，所述第二m序列生成模块122包括：
第七计算单元1221，用于根据生成所述辅同步序列的过程中所应用的每一个本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第四参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000176
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第四参考序列中第w个元素；
第八计算单元1222，用于根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000177
计算与每一个所述本原多项式对应的所述第四参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000178
的取值依次为0～N-n-1的整数，N＝2 n-1；
第九计算单元1223，用于根据与每一个所述本原多项式对应的所述第四参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
优选地，当生成所述辅同步序列的过程中所应用的本原多项式包括三个本原多项式时，如图13所示，所述循环移位模块123包括：
第一生成单元1231，用于根据所述m序列m j(w)，按照第八预设公式M f(g)＝m j((g+c)modN)，生成待检测m序列；
其中，j的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*j+c；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
优选地，当生成所述辅同步序列的过程中所应用的本原多项式包括六个本原多项式时，所述循环移位模块123包括：
第二生成单元1232，用于根据所述m序列m j(w)，按照第九预设公式M f(g)＝m j((g+2c)modN)，生成待检测m序列；
其中，j的取值依次为0～5的整数，c的取值依次为0～55的整数，f＝56*j+c；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
优选地，当生成所述辅同步序列的过程中所应用的本原多项式包括两个本原多项式时，如图13所示，所述循环移位模块123包括：
第三生成单元1233，用于根据所述m序列m j(w)，按照第十预设公式
Figure PCTCN2018083547-appb-000179
生成待检测m序列；
其中，j的取值依次为0～1的整数，v的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*v+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
优选地，所述解扰信号至少为一个，如图13所示，所述相关检测模块124包括：
相关值计算单元1241，用于利用每一个所述待检测m序列依次对每一个所述解扰信号进行相关检测，获得对应的相关值；
最大相关值确定单元1242，用于从获得的相关值中，确定最大相关值对应的待检测m序列；
信息获取单元1243，用于根据所述最大相关值对应的待检测m序列在所有所述待检测m序列中的序号，获得第二部分小区标识信息。
综上所述，本公开的实施例，通过解扰模块121利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，然后通过m序列生成模块122根据该辅同步序列的生成过程中所应用的本原多项式生成m序列，进而触发循环移位模块123对生成的m序列进行循环移位，生成待检测m序列，从而触发相关检测模块124利用待检测m序列对辅同步序列解扰后的信号进行相关检测，获得第二部分小区标识信息，进而使得信息获取模块125由第一部分小区标识信息和第二部分小区标识信息，获得完整的小区标识信息。
其中，由于辅同步序列中添加了主同步序列的扰码序列，所以，在对该辅同步序列的检测过程中，可以首先利用预先对主同步信号检测获得的第一部分小区标识信息对辅同步序列进行解扰，获得解扰信号，提高了检测精度。
第十三实施例
为了更好的实现上述目的，如图14所示，本公开还提供了一种用户设备，包括：
第二处理器1410；通过总线接口1420与所述第二处理器1410相连接的第二存储器1430，所述第二存储器1430用于存储所述第二处理器1410在执行操作时所使用的程序和数据，以及通过总线接口1420与所述第二处理器1410相连接的第二收发机1440，用于在第二处理器1410的控制下接收和发送数据。当第二处理器1410调用并执行所述第二存储器1430中所存储的程序和数据时，执行下列过程：
利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
对所述m序列进行循环移位，生成待检测m序列；
利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
其中，第二处理器1410在利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号时，具体用于：
根据第一部分小区标识信息与扰码序列的对应关系，确定与预先对主同步信号进行检测获得的第一部分小区标识信息对应的目标扰码序列；
利用所述目标扰码序列对辅同步序列进行解扰，获得解扰信号。
其中，第二处理器1410在根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列时，具体用于：
根据生成所述辅同步序列的过程中所应用的每一个本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第四参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000180
Figure PCTCN2018083547-appb-000181
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第四参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000182
Figure PCTCN2018083547-appb-000183
计算与每一个所述本原多项式对应的所述第四参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000184
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第四参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，当生成所述辅同步序列的过程中所应用的本原多项式包括三个本原多项式时，第二处理器1410在对所述m序列进行循环移位，生成待检测m序列时，具体用于：
根据所述m序列m j(w)，按照第八预设公式M f(g)＝m j((g+c)modN)，生成待检测m序列；
其中，j的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*j+c；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
其中，当生成所述辅同步序列的过程中所应用的本原多项式包括六个本原多项式时，第二处理器1410在对所述m序列进行循环移位，生成待检测m序列时，具体用于：
根据所述m序列m j(w)，按照第九预设公式M f(g)＝m j((g+2c)modN)，生成待检测m序列；
其中，j的取值依次为0～5的整数，c的取值依次为0～55的整数，f＝56*j+c；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
其中，当生成所述辅同步序列的过程中所应用的本原多项式包括两个本原多项式时，第二处理器1410在对所述m序列进行循环移位，生成待检测m序列时，具体用于：
根据所述m序列m j(w)，按照第十预设公式
Figure PCTCN2018083547-appb-000185
Figure PCTCN2018083547-appb-000186
生成待检测m序列；
其中，j的取值依次为0～1的整数，v的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*v+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
其中，所述解扰信号至少为一个，处理器1410在利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息时，具体用于：
利用每一个所述待检测m序列依次对每一个所述解扰信号进行相关检测，获得对应的相关值；
从获得的相关值中，确定最大相关值对应的待检测m序列；
根据所述最大相关值对应的待检测m序列在所有所述待检测m序列中的序号，获得第二部分小区标识信息。
需要说明的是，在图14中，总线架构可以包括任意数量的互联的总线和桥，具体由第二处理器1410代表的一个或多个处理器和第二存储器1430代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公 知的，因此，本文不再对其进行进一步描述。总线接口提供接口。第二收发机1440可以是多个元件，即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元。针对不同的终端，用户接口1450还可以是能够外接内接需要设备的接口，连接的设备包括但不限于小键盘、显示器、扬声器、麦克风、操纵杆等。第二处理器1410负责管理总线架构和通常的处理，第二存储器1430可以第二存储处理器1430在执行操作时所使用的数据。
本领域技术人员可以理解，实现上述实施例的全部或者部分步骤可以通过硬件来完成，也可以通过计算机程序来指示相关的硬件来完成，所述计算机程序包括执行上述方法的部分或者全部步骤的指令；且该计算机程序可以存储于一可读存储介质中，存储介质可以是任何形式的存储介质。
此外，需要指出的是，在本公开的装置和方法中，显然，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应视为本公开的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按照时间顺序执行，某些步骤可以并行或彼此独立地执行。对本领域的普通技术人员而言，能够理解本公开的方法和装置的全部或者任何步骤或者部件，可以在任何计算装置(包括处理器、存储介质等)或者计算装置的网络中，以硬件、固件、软件或者它们的组合加以实现，这是本领域普通技术人员在阅读了本公开的说明的情况下运用他们的基本编程技能就能实现的。
因此，本公开的目的还可以通过在任何计算装置上运行一个程序或者一组程序来实现。所述计算装置可以是公知的通用装置。因此，本公开的目的也可以仅仅通过提供包含实现所述方法或者装置的程序代码的程序产品来实现。也就是说，这样的程序产品也构成本公开，并且存储有这样的程序产品的存储介质也构成本公开。显然，所述存储介质可以是任何公知的存储介质或者将来所开发出来的任何存储介质。还需要指出的是，在本公开的装置和方法中，显然，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应视为本公开的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按照时间顺序执行。某些步骤可以并行或彼此独立地执行。
第十四实施例
本公开的实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现以下步骤：
利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
对所述m序列进行循环移位，生成待检测m序列；
利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
其中，其中，所述利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号的步骤，包括：
根据第一部分小区标识信息与扰码序列的对应关系，确定与预先对主同步信号进行检测获得的第一部分小区标识信息对应的目标扰码序列；
利用所述目标扰码序列对辅同步序列进行解扰，获得解扰信号。
其中，所述根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列的步骤，包括：
根据生成所述辅同步序列的过程中所应用的每一个本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第四参考序列y(w)的公式：
Figure PCTCN2018083547-appb-000187
Figure PCTCN2018083547-appb-000188
其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第四参考序列中第w个元素；
根据与每一个所述本原多项式对应的预设初始值和公式
Figure PCTCN2018083547-appb-000189
Figure PCTCN2018083547-appb-000190
计算与每一个所述本原多项式对应的所述第四参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
Figure PCTCN2018083547-appb-000191
的取值依次为0～N-n-1的整数，N＝2 n-1；
根据与每一个所述本原多项式对应的所述第四参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
其中，当生成所述辅同步序列的过程中所应用的本原多项式包括三个本原多项式时，所述对所述m序列进行循环移位，生成待检测m序列的步骤，包括：
根据所述m序列m j(w)，按照第八预设公式M f(g)＝m j((g+c)modN)，生成待检测m序列；
其中，j的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*j+c；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
其中，当生成所述辅同步序列的过程中所应用的本原多项式包括六个本原多项式时，所述对所述m序列进行循环移位，生成待检测m序列的步骤，包括：
根据所述m序列m j(w)，按照第九预设公式M f(g)＝m j((g+2c)modN)，生成待检测m序列；
其中，j的取值依次为0～5的整数，c的取值依次为0～55的整数，f＝56*j+c；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
其中，当生成所述辅同步序列的过程中所应用的本原多项式包括两个本原多项式时，所述对所述m序列进行循环移位，生成待检测m序列的步骤， 包括：
根据所述m序列m j(w)，按照第十预设公式
Figure PCTCN2018083547-appb-000192
Figure PCTCN2018083547-appb-000193
生成待检测m序列；
其中，j的取值依次为0～1的整数，v的取值依次为0～2的整数，c的取值依次为0～111的整数，f＝112*v+c；
b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
w的取值依次为0～N-1的整数，g的取值依次为0～N-1的整数；
N表示所述m序列的长度、所述待检测m序列的长度，M f(g)表示第f个待检测m序列中第g个元素。
其中，所述解扰信号至少为一个，所述利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息的步骤，包括：
利用每一个所述待检测m序列依次对每一个所述解扰信号进行相关检测，获得对应的相关值；
从获得的相关值中，确定最大相关值对应的待检测m序列；
根据所述最大相关值对应的待检测m序列在所有所述待检测m序列中的序号，获得第二部分小区标识信息。
以上所述是本公开的优选实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本公开所述原理的前提下，还可以作出若干改进和润饰，这些改进和润饰也应视为本公开的保护范围。

Claims (18)

  1. 一种辅同步序列的生成方法，包括：
    生成主同步信号的扰码序列；
    根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
  2. 根据权利要求1所述的方法，其中，所述生成主同步信号的扰码序列的步骤，包括：
    按照第一预设公式
    Figure PCTCN2018083547-appb-100001
    计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
    Figure PCTCN2018083547-appb-100002
    的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
    根据所述第一参考序列x(h)，按照第二预设公式
    Figure PCTCN2018083547-appb-100003
    计算第二参考序列
    Figure PCTCN2018083547-appb-100004
    其中，
    Figure PCTCN2018083547-appb-100005
    表示所述第二参考序列中第h个元素；
    按照第三预设公式
    Figure PCTCN2018083547-appb-100006
    生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
  3. 根据权利要求1所述的方法，其中，所述根据预先确定的本原多项式生成m序列的步骤，包括：
    根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
    Figure PCTCN2018083547-appb-100007
    其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
    根据与每一个所述本原多项式对应的预设初始值和公式
    Figure PCTCN2018083547-appb-100008
    Figure PCTCN2018083547-appb-100009
    计算与每一个所述本原多项式对应的所述第三参 考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
    Figure PCTCN2018083547-appb-100010
    的取值依次为0～N-n-1的整数，N＝2 n-1；
    根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
  4. 根据权利要求1所述的方法，其中，当所述主同步信号的扰码序列为三个，所述m序列为三个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
    根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
    Figure PCTCN2018083547-appb-100011
    进行加扰和循环移位，生成辅同步序列S L(r)；
    其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
    k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
    N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
  5. 根据权利要求1所述的方法，其中，当所述主同步信号的扰码序列为三个，所述m序列为六个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
    根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
    Figure PCTCN2018083547-appb-100012
    进行加扰和循环移位，生成辅同步序列S L(r)
    其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
    k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
    N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅 同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
  6. 根据权利要求1所述的方法，其中，当所述主同步信号的扰码序列为三个，所述m序列为两个时，所述根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列的步骤，包括：
    根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
    Figure PCTCN2018083547-appb-100013
    进行加扰和循环移位，生成辅同步序列S L(r)；
    其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；
    b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
    k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
    N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
  7. 一种基站，包括：
    扰码序列生成模块，用于生成主同步信号的扰码序列；
    第一m序列生成模块，用于根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    辅同步序列生成模块，用于根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
  8. 根据权利要求7所述的基站，其中，所述扰码序列生成模块包括：
    第一计算单元，用于按照第一预设公式
    Figure PCTCN2018083547-appb-100014
    Figure PCTCN2018083547-appb-100015
    计算第一参考序列x(h)，其中，x(h)表示所述第一参考序列中第h个元素，h的取值依次为0～N-1的整数，
    Figure PCTCN2018083547-appb-100016
    的取值依次为0～N-8的整数，x(0)、x(1)、x(2)、x(3)、x(4)、x(5)、x(6)组成的二进制序列为非零的序列常量；
    第二计算单元，用于根据所述第一参考序列x(h)，按照第二预设公式
    Figure PCTCN2018083547-appb-100017
    计算第二参考序列
    Figure PCTCN2018083547-appb-100018
    其中，
    Figure PCTCN2018083547-appb-100019
    表示所述第二参考序 列中第h个元素；
    第三计算单元，用于按照第三预设公式
    Figure PCTCN2018083547-appb-100020
    生成三个长度均为预设长度的主同步信号的扰码序列，其中，s i(k)表示第i个主同步信号的扰码序列中第k个元素，i的取值依次为0～2的整数，k的取值依次为0～N-1的整数，N表示所述预设长度，c i为预设的常量。
  9. 根据权利要求7所述的基站，其中，所述第一m序列生成模块包括：
    第四计算单元，用于根据每一个预先确定的所述本原多项式g＝a 0*2 n+a 1*2 n-1+…+a n-1*2 1+a n*2 0，确定与每一个所述本原多项式对应的、用于计算第三参考序列y(w)的公式：
    Figure PCTCN2018083547-appb-100021
    其中，n为所述本原多项式的自由度，a 0＝a n＝1，a 1～a n-1分别取值为0或1，t的取值依次为1～n的整数，y(w)表示所述第三参考序列中第w个元素；
    第五计算单元，用于根据与每一个所述本原多项式对应的预设初始值和公式
    Figure PCTCN2018083547-appb-100022
    计算与每一个所述本原多项式对应的所述第三参考序列y(w)，其中，所述预设初始值为y(0)～y(n-1)，且y(0)～y(n-1)组成的二进制序列为非零的序列常量，w的取值依次为0～N-1的整数，
    Figure PCTCN2018083547-appb-100023
    的取值依次为0～N-n-1的整数，N＝2 n-1；
    第六计算单元，用于根据与每一个所述本原多项式对应的所述第三参考序列y(w)，按照第四预设公式m(w)＝1-2y(w)，生成与每一个所述本原多项式对应的m序列，其中，m(w)表示一个m序列中第w个元素。
  10. 根据权利要求7所述的基站，其中，当所述主同步信号的扰码序列为三个，所述m序列为三个时，所述辅同步序列生成模块包括：
    第一处理单元，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第五预设公式
    Figure PCTCN2018083547-appb-100024
    进行加扰和循环移位，生成辅同步序列S L(r)；
    其中，i的取值依次为0～2的整数，j的取值依次为0～2的整数，c的取值依次为0～111的整数，L＝112*(3*i+j)+c；
    k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
    N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅 同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
  11. 根据权利要求7所述的基站，其中，当所述主同步信号的扰码序列为三个，所述m序列为六个时，所述辅同步序列生成模块包括：
    第二处理单元，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m j(w)，按照第六预设公式
    Figure PCTCN2018083547-appb-100025
    进行加扰和循环移位，生成辅同步序列S L(r)
    其中，i的取值依次为0～2的整数，j的取值依次为0～5的整数，c的取值依次为0～55的整数，L＝56*(6*i+j)+c；
    k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
    N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
  12. 根据权利要求7所述的基站，其中，当所述主同步信号的扰码序列为三个，所述m序列为两个时，所述辅同步序列生成模块包括：
    第三处理单元，用于根据所述主同步信号的扰码序列s i(k)和所述m序列m 0(w)和m 1(w)，按照第七预设公式
    Figure PCTCN2018083547-appb-100026
    进行加扰和循环移位，生成辅同步序列S L(r)；
    其中，i的取值依次为0～2的整数，v的取值依次为0～2的整数，c的取值依次为0～55的整数，L＝112*(3*i+v)+c；
    b v为预设的常量，且0≤b v<N，且b 0≠b 1≠b 2；
    k的取值依次为0～N-1的整数，w的取值依次为0～N-1的整数，r的取值依次为0～N-1的整数；
    N表示所述主同步信号的扰码序列的长度、所述m序列的长度、所述辅同步序列的长度，S L(r)表示第L个辅同步序列中第r个元素。
  13. 一种基站，包括第一存储器、第一处理器及存储在所述第一存储器上并可在所述第一处理器上运行的计算机程序；所述第一处理器执行所述程序时实现以下步骤：
    生成主同步信号的扰码序列；
    根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
  14. 一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现以下步骤：
    生成主同步信号的扰码序列；
    根据预先确定的本原多项式生成m序列，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    根据所述主同步信号的扰码序列和所述m序列，生成辅同步序列。
  15. 一种辅同步序列的检测方法，包括：
    利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
    对所述m序列进行循环移位，生成待检测m序列；
    利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
    根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
  16. 一种用户设备，包括：
    解扰模块，用于利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多 项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    第二m序列生成模块，用于根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
    循环移位模块，用于对所述m序列进行循环移位，生成待检测m序列；
    相关检测模块，用于利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
    信息获取模块，用于根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
  17. 一种用户设备，包括第二存储器、第二处理器及存储在所述第二存储器上并可在所述第二处理器上运行的计算机程序；所述第二处理器执行所述程序时实现以下步骤：
    利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
    对所述m序列进行循环移位，生成待检测m序列；
    利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
    根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
  18. 一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现以下步骤：
    利用预先对主同步信号进行检测获得的第一部分小区标识信息，对辅同步序列进行解扰，获得解扰信号，其中，所述辅同步序列是根据m序列和所述主同步信号的扰码序列生成的辅同步序列中的其中一个，所述m序列是根 据预先确定的本原多项式生成的，其中，预先确定的本原多项式包括至少两个本原多项式，且任意两个本原多项式生成的m序列构成的m序列对为m序列优选对；
    根据生成所述辅同步序列的过程中所应用的本原多项式生成m序列；
    对所述m序列进行循环移位，生成待检测m序列；
    利用所述待检测m序列对所述解扰信号进行相关检测，获得第二部分小区标识信息；
    根据所述第一部分小区标识信息和所述第二部分小区标识信息，获得小区标识信息。
PCT/CN2018/083547 2017-05-05 2018-04-18 一种辅同步序列的生成方法、检测方法、基站及用户设备 Ceased WO2018201894A1 (zh)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201710313805.5 2017-05-05
CN201710313805 2017-05-05
CN201710531829.8A CN108811077B (zh) 2017-05-05 2017-06-28 一种辅同步序列的生成方法、检测方法、基站及用户设备
CN201710531829.8 2017-06-28

Publications (1)

Publication Number Publication Date
WO2018201894A1 true WO2018201894A1 (zh) 2018-11-08

Family

ID=64016843

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/083547 Ceased WO2018201894A1 (zh) 2017-05-05 2018-04-18 一种辅同步序列的生成方法、检测方法、基站及用户设备

Country Status (1)

Country Link
WO (1) WO2018201894A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101689930A (zh) * 2007-07-06 2010-03-31 Lg电子株式会社 在无线通信系统中执行小区搜索的方法
CN101821977A (zh) * 2007-10-11 2010-09-01 高通股份有限公司 无线通信系统中用于辅同步码的扰码
CN103442423A (zh) * 2007-07-12 2013-12-11 韩国电子通信研究院 移动站搜索小区的方法和搜索小区的设备
CN103458497A (zh) * 2012-05-31 2013-12-18 英特尔移动通信有限责任公司 通信终端设备与基站的同步以及辅同步信号的生成
US20160249308A1 (en) * 2007-06-18 2016-08-25 Texas Instruments Incorporated Mapping schemes for secondary synchronization signal scrambling

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160249308A1 (en) * 2007-06-18 2016-08-25 Texas Instruments Incorporated Mapping schemes for secondary synchronization signal scrambling
CN101689930A (zh) * 2007-07-06 2010-03-31 Lg电子株式会社 在无线通信系统中执行小区搜索的方法
CN103442423A (zh) * 2007-07-12 2013-12-11 韩国电子通信研究院 移动站搜索小区的方法和搜索小区的设备
CN101821977A (zh) * 2007-10-11 2010-09-01 高通股份有限公司 无线通信系统中用于辅同步码的扰码
CN103458497A (zh) * 2012-05-31 2013-12-18 英特尔移动通信有限责任公司 通信终端设备与基站的同步以及辅同步信号的生成

Similar Documents

Publication Publication Date Title
TWI672967B (zh) 一種輔同步序列的生成方法、檢測方法、基地台及使用者設備
KR101575030B1 (ko) 클라우드 상의 공유 데이터에 대한 다중 서명생성방법
CN105519212B (zh) 同步信号发送方法、接收方法以及相关装置
KR101009871B1 (ko) 통신 시스템에서 인증 방법
CN115580489B (zh) 数据传输方法、装置、设备及存储介质
WO2022001427A1 (zh) 基于dsp的伪随机序列的生成方法和装置、存储介质
US20160240108A1 (en) Ciphertext comparison system, ciphertext comparison method, ciphertext generation apparatus, ciphertext comparison apparatus, and control methods and control programs of ciphertext generation apparatus and ciphertext comparison apparatus
Mandal et al. Feedback reconstruction and implementations of pseudorandom number generators from composited de Bruijn sequences
WO2022068354A1 (zh) 数据验证方法、装置、设备以及存储介质
TWI672033B (zh) 用於無線通訊系統中的同步和設備識別的序列設計方法
CN116361344A (zh) 数据查询方法、装置、设备及介质
CN114089948B (zh) 乘法执行方法、数据准备方法及装置
CN108616474A (zh) 用于粗定时和粗频率同步的设备及方法
WO2018201894A1 (zh) 一种辅同步序列的生成方法、检测方法、基站及用户设备
CN107846375A (zh) 用于检测同步信号的方法和设备
CN112217539A (zh) 一种跳频图案同步方法、装置、电子设备及存储介质
CN109547149B (zh) 数据传输方法、同步序列构造方法及装置
CN117692282A (zh) 同步块的盲检方法、装置、存储介质及电子装置
TWI731770B (zh) 運算系統
CN113806760B (zh) 获取特征间相关系数方法、装置、电子设备及存储介质
TWI753475B (zh) 同步信號發送方法、終端及裝置、電腦可讀存儲介質
TWI740564B (zh) 跨時鐘域信號傳輸方法、電路以及電子裝置
CN119834972B (zh) 抗量子攻击的密钥生成、签名方法、装置、系统、设备
Kitbumrung et al. ECC dynamic point encoding on mobile device
CN115604006B (zh) 一种数据传输方法、装置、设备及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18793891

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18793891

Country of ref document: EP

Kind code of ref document: A1