CN100558011C - Method and system for frame synchronization and acquiring cell group information - Google Patents

Abstract

The invention discloses a method for frame synchronization and obtaining cell group information, another method for frame synchronization and obtaining cell group information, a system for realizing frame synchronization and cell group information acquisition, and a coding method in cell search , a coding device for cell search, a decoding method in cell search, another decoding method in cell search, and a decoding device for cell search. The present invention encodes the combination of multiple elements corresponding to different SSCs to obtain codewords with different element arrangement orders, thereby realizing the multiplexing of multiple SSCs in one S-SCH symbol; the receiving side according to the element arrangement order The values of the elements in the combination of elements can obtain frame synchronization and cell group information, and at the same time obtain diversity gain, thereby shortening the time of cell search and improving the feasibility of cell search. Moreover, the technical scheme of the present invention also increases the number of cell groups and cells that may be detected during the cell search process.

Description

Method and system for frame synchronization and acquiring cell group information

technical field

The present invention relates to a synchronization detection technology in a mobile communication system, in particular to a frame synchronization and a method for acquiring cell group information, a system for realizing frame synchronization and cell group information acquisition, a coding method in cell search, a coding device for cell search, A decoding method in cell search and a decoding device for cell search.

Background technique

In the mobile communication system, the user terminal (User Equipment) as the signal receiver realizes synchronization with the signal sender on the network side in time and frequency through the process of cell search, and at the same time obtains the cell identity (Identity, ID). FIG. 1 is a schematic flow chart of an existing cell search process. As shown in Figure 1, the cell search process generally includes the following steps:

Step 101, using the Primary-Synchronization Channel (P-SCH) to complete symbol timing synchronization and frequency offset estimation, thereby realizing symbol-level synchronization and frequency synchronization in time.

Step 102, utilize Secondary-Synchronization Channel (S-SCH) to complete frame timing synchronization, and obtain cell group ID by decoding from S-SCH symbols.

In some mobile communication systems, such as long-term evolution (LTE) systems based on Orthogonal Frequency Division Multiplexing (OFDM) technology, each radio frame includes multiple S-SCH symbols. Therefore, in this step, the S-SCH symbols used to achieve frame synchronization and obtain the cell group ID are multiple OFDM symbols, that is, use multiple S-SCH symbols to complete frame synchronization and detection of cell group information.

Wherein, the multiple S-SCH symbols included in each radio frame are the same, but the specific content carried by the multiple S-SCH symbols in the same radio frame may be different from each other.

Step 103, using the information included in the reference signal, ie, the pilot, to finally determine the cell ID and complete the cell search.

However, in some cases, in step 102 of the above process, there will be the following problems:

Taking the LTE system as an example, the system needs to perform Inter-RAT handover with other mobile communication systems (such as GSM system). For the specific requirements and implementation process of Inter-RAT handover, please refer to: "Siemens, "Interworking between LTE and GSM -Monitoring LTE fromGSM”, 3GPP Tdoc RAN1, R1-070081, Sorrento, Italy, 15-19 Jan., 2007.”. However, the signal frame lengths in the two systems may be different, therefore, frame synchronization cannot be guaranteed after Inter-RAT handover is realized.

For example, the frame length in the LTE system can be 10ms (there are 2 S-SCH symbols in each radio frame, that is, the interval between every two S-SCH symbols is 5ms), while the frame length of a frame in the GSM system Short, at this time, according to the requirements mentioned in the previous references, it is necessary to ensure that the LTE system must complete the entire process of step 102 within 5ms. However, if two identical S-SCH symbols are used in one radio frame, the receiving end cannot determine which S-SCH symbol within 5 ms is the real frame start time.

In this case, since the existing method of using multiple S-SCH symbols for frame synchronization detection cannot guarantee the realization of Inter-RAT handover, the feasibility is low. Moreover, it takes a long time to perform frame synchronization and obtain cell group information by using multiple S-SCHs, and the detection efficiency is not high, so that the cell search takes more time and the search efficiency is low.

Contents of the invention

In view of this, a main purpose of the present invention is to provide a method for frame synchronization and obtaining cell group information, which can shorten the time of cell search and improve the feasibility of cell search.

Another main purpose of the present invention is to provide another method for frame synchronization and cell group information acquisition, which can shorten cell search time and improve cell search feasibility.

Another main purpose of the present invention is to provide a system for realizing frame synchronization and cell group information acquisition, which can shorten the time of cell search and improve the feasibility of cell search.

Another main purpose of the present invention is to provide a coding method in cell search, which can shorten the time of cell search and improve the feasibility of cell search.

Another main purpose of the present invention is to provide a coding device for cell search, which can shorten the time of cell search and improve the feasibility of cell search.

Another main purpose of the present invention is to provide a decoding method in cell search, which can shorten the time of cell search and improve the feasibility of cell search.

Another main purpose of the present invention is to provide another decoding method in cell search, which can shorten the time of cell search and improve the feasibility of cell search.

Another main purpose of the present invention is to provide a decoding device for cell search, which can shorten the time of cell search and improve the feasibility of cell search.

According to the above-mentioned main purpose, the embodiment of the present invention provides a method for frame synchronization and obtaining cell group information, including:

Set at least one group of codewords according to the preset element arrangement rules, each codeword in each group includes the same element but has a different arrangement order of elements, and the elements included in each group of codewords are different from the elements included in other groups of codewords at least one is different;

The sender selects a group from the at least one group of codewords and sends it to the receiver;

The receiver detects the received codewords, and according to the detection result and the preset element arrangement rule, performs diversity combination on the continuously received codewords, and combines the diversity combined codewords with at least one of the set Group codewords are compared to determine the actual values of the elements in the codewords after the diversity combination, and to obtain frame synchronization information and cell group information.

According to another main purpose above, the embodiment of the present invention provides another method for frame synchronization and obtaining cell group information, including:

Set at least one group of codewords according to the preset element arrangement rules, each codeword in each group includes the same element but has a different arrangement order of elements, and the elements included in each group of codewords are different from the elements included in other groups of codewords at least one is different;

The sender selects a group from the at least one group of codewords and sends it to the receiver;

The receiver detects the received codewords, compares the detection results with the set at least one set of codewords, determines the actual value of the detection results, and obtains frame synchronization information and cell group information.

According to another main objective above, the embodiment of the present invention provides a system for realizing frame synchronization and cell group information acquisition, including: a sender and a receiver, wherein,

The sender is used to store at least one group of codewords, each codeword in each group includes the same element but has a different arrangement order of elements, and the elements included in each group of codewords are at least at least the same as the elements included in other groups of codewords There is one difference; select a group from at least one group of stored codewords and send it to the receiver;

The receiver is used to store at least one set of codewords and the element arrangement rules of the codewords that are the same as those in the sender; detect the received codewords, and arrange the elements according to the detection results and the stored element arrangement rules , performing diversity combination on continuously received codewords, comparing the codewords after diversity combination with at least one set of stored codewords, determining the actual values of elements in the codewords after diversity combination, and obtaining frame synchronization information and cell group information.

According to yet another main purpose above, an embodiment of the present invention provides a coding method in cell search, including:

set at least one element group containing multiple elements;

The set element groups are encoded according to the preset element arrangement rules, and all encoding results of each element group form a set of codewords, and each codeword in each group includes the same elements but has different element arrangement orders.

According to another main objective above, the embodiment of the present invention provides a coding device for cell search, including: an element information unit and a coding operation unit, wherein,

The element information unit is used to store element arrangement rules and at least one element group containing multiple elements; provide the stored element arrangement rules and at least one element group to the encoding operation unit;

The encoding operation unit is configured to encode the at least one group of element groups according to a preset element arrangement rule, and all the encoding results of each element group form a group of codewords, and each codeword in each group includes the same element but with a different order of elements.

According to another main purpose above, the embodiment of the present invention provides a decoding method in cell search, including:

Set at least one group of codewords identical to those of the sender according to preset element arrangement rules, each codeword in each group includes the same elements but has a different element arrangement order, and the elements included in each group of codewords are different from other group codewords Words include at least one element that is different;

Detecting the received codewords that include the same number of elements as the set codewords, and performing diversity combination of the continuously received codewords according to the detection results and the preset element arrangement rules, and combining the diversity Comparing the codewords with at least one set of codewords to determine the actual values of the elements in the codewords after the diversity combination, and to obtain frame synchronization information and cell group information.

According to yet another main purpose above, the embodiment of the present invention provides another decoding method in cell search, including:

Set at least one group of codewords identical to those of the sender according to preset element arrangement rules, each codeword in each group includes the same elements but has a different element arrangement order, and the elements included in each group of codewords are different from other group codewords Words include at least one element that is different;

Detecting the received codeword that includes the same number of elements as the set codeword, and comparing the detection result with at least one set of codewords, determining the actual value of the detection result, and obtaining frame synchronization information and Information about the cell group.

According to another main objective above, the embodiment of the present invention provides a decoding device for cell search, including: a decoding information unit, a diversity combining unit and a decoding operation unit, wherein,

The decoding information unit is used to store the same element arrangement rules and at least one group of codewords as in the codeword sender, each codeword in each group includes the same elements but has a different element arrangement order, and each group of codewords At least one of the elements included in is different from the elements included in other groups of codewords; at least one group of codewords stored is provided to the decoding operation unit; the stored element arrangement rules are provided to the diversity combining unit and the decoding operation unit;

The diversity merging unit is configured to detect the received codewords that include the same number of elements as the stored codewords, and combine the continuously received codewords according to the detection results and the element arrangement rules provided by the decoding information unit performing diversity combining; providing the codeword after diversity combining to the decoding operation unit;

The decoding operation unit is used to compare the code word after diversity combining provided by the diversity combining unit with at least one group of code words provided by the decoding information unit, and determine the actual value of the element in the code word after diversity combining, according to the stored Arrangement rules of the elements to obtain frame synchronization information and cell group information.

It can be seen that the technical solutions of the embodiments of the present invention have the following beneficial effects:

By encoding the combination of multiple elements corresponding to different SSCs (Secondary Synchronization Code, secondary synchronization code or S-SCH sequence), codewords with the same elements but in different order are obtained, thereby realizing multiple SSCs It is used in one S-SCH symbol; the receiving side obtains frame synchronization and cell group information according to the element arrangement order and element values in the element combination, and obtains diversity gain at the same time. Therefore, the technical solution of the embodiment of the present invention improves the efficiency of frame synchronization and cell group information acquisition, and makes the scheme of frame synchronization and cell group information acquisition more feasible, thereby shortening the time of cell search and improving the efficiency of cell search. feasibility. Moreover, the encoding method provided by the embodiment of the present invention also increases the number of cell groups and cells that may be detected during the cell search process, further improving the feasibility of cell search.

Description of drawings

FIG. 1 is a schematic flow chart of an existing cell search process.

Fig. 2 is an exemplary flowchart of an encoding method in an embodiment of the present invention.

Fig. 3 is an exemplary flowchart of a decoding method in an embodiment of the present invention.

FIG. 4 is a structural diagram of a system for realizing frame synchronization and cell group information acquisition in an embodiment of the present invention.

Fig. 5 is a flowchart of a method for frame synchronization and obtaining cell group information in an embodiment of the present invention.

Fig. 6 is a schematic diagram of the effect of the cell search process in the embodiment of the present invention.

Detailed ways

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and examples.

The basic idea of the embodiments of the present invention is to multiplex multiple SSCs in one S-SCH symbol for frame synchronization and cell group information acquisition; Diversity gain.

Specifically, it is to set M different elements corresponding to M SSCs, that is, the element set {1, 2, ..., M}, and multiplex multiple elements of the M elements in one S -in the SCH symbol, and transmit the SSC set representing frame synchronization information and cell group information in one S-SCH symbol by rearranging multiple elements.

Among them, M is a positive integer; each SSC is a unique sequence, that is, each SSC is different from other SSCs; for multiplexing the nth S-SCH symbol (n=1,...,N, where N is a plurality of (K, K is a positive integer less than M) elements in the number of S-SCH symbols in a radio frame, which can be expressed as the following codewords:

C(n)=(c ₁ (n), c ₂ (n), . . . , c _K (n)), c ₁ (n)∈{1, 2, . . . , M}.

The element value set and arrangement order of the elements included in the above codeword represent the cell group information and the frame synchronization information respectively.

The codewords including different elements correspond to different, that is, unique cell group information, such as cell group ID and other information that can uniquely identify the cell group, and the value of the cell group ID is g (1≤g≤G), corresponding to and the codeword C _g (n) in the nth S-SCH symbol, C _g (n) can be expressed as:

${\mathrm{<span\; class="notranslate">\; C</span>}}_{\mathrm{<span\; class="notranslate">\; g</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; g</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; g</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; K</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; g</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>$ ${\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; g</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&Element;</span><span\; class="notranslate">\; \{</span>\mathrm{<span\; class="notranslate">\; 1,2</span>}<span\; class="notranslate">\; ,</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; m</span>}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; ,</span>$

That is, a codeword composed of elements c ₁ ^(g) (n), c ₂ ^(g) (n), ..., c _K ^(g) (n) represents a cell group ID whose value is g.

In this way, the S-SCH symbol in a radio frame can represent the cell group ID by multiplexing the value of the internal elements, and represent the frame synchronization information by multiplexing the sequence of the internal elements.

For G cell group IDs, G types of element combinations are required; for each cell group ID, that is, each element combination, N codewords are required to be allocated to N S-SCH symbols. Therefore, there are a total of N×G codewords that may be obtained after encoding.

Wherein, G and N are positive integers.

During decoding, the elements inside the received codeword can be detected, for example, the received codeword signal is permuted and combined with all possible elements for correlation calculation.

In this embodiment, it is only necessary to ensure that the same element appears in corresponding positions of multiple codewords (carried by multiple S-SCH symbols), and diversity combining can be realized. Therefore, the correlation values of the same element obtained from multiple S-SCH symbols, that is, from multiple codewords, can be combined to improve detection performance. Of course, one codeword cannot be simply repeated in multiple S-SCH symbols in one radio frame, so as not to generate multiple frame synchronization points and fail to complete frame synchronization.

The prerequisites for realizing diversity combining in this embodiment include at least:

The code word C _g (n) (n>1) is obtained by rearranging the elements in the code word C _g (1); all the code words are different from each other to ensure complete frame synchronization. And the rearrangement construction must ensure that: C _g (n) is different for all n; the same one corresponding to the SSC is transmitted on all N symbols to ensure time-diversity combining, and/or multiple Elements corresponding to the SSC are transmitted on different frequency locations to ensure frequency diversity combining.

In the following, the system for realizing frame synchronization and obtaining cell group information in this embodiment, and the method for frame synchronization and obtaining cell group information will be described in general.

The system for achieving frame synchronization and cell group information acquisition in this embodiment includes: a sender and a receiver.

The sender stores G groups of codewords, each group includes N codewords and the K elements included in each codeword are not exactly the same as the K elements in other groups of codewords, and the N codewords in the same group include the same elements, but the arrangement order of the elements is different from each other; select a group from the stored G groups of codewords and send it to the receiver.

The receiving side stores the same G codewords and the element arrangement rules of the codewords in the sender; detects the received codewords, and performs the continuous codewords received according to the detection results and the stored element arrangement rules Diversity combining: compare the codewords after diversity combining with the stored G group codewords, determine the actual value of elements in the codewords after diversity combining according to the stored element arrangement rules, and obtain frame synchronization information and cell group information.

In the above system, each of the G groups of codewords corresponds to the information of a cell group, such as the cell group ID; each element included in the codewords in each group corresponds to an SSC; the receiver decodes the received codewords , to achieve diversity combining, so that while obtaining frame synchronization and obtaining cell group information, diversity combining gain is also obtained.

In the above system, the N×G codewords stored in the sender and the receiver are obtained through the encoding method in this embodiment.

In practical applications, the receiver may not perform diversity combining, but directly compares the detection result with the stored G group codewords to obtain frame synchronization information and cell group information. However, compared with the way of diversity combining, this scheme cannot obtain diversity gain.

Fig. 2 is an exemplary flowchart of an encoding method in an embodiment of the present invention. As shown in Figure 2, the encoding method in this embodiment includes the following steps:

Step 201, setting G element groups, each element group includes K elements, and is not identical with elements in other element groups;

In this step, the K elements in each codeword are selected from preset M (M>K) mutually different elements; each of the G element groups corresponds to the information of a cell group, such as cell Group ID and other information that can uniquely identify a cell group; each of the M elements corresponds to an SSC, that is, M elements are set according to M unique SSCs;

Step 202, encode the set G element groups according to the preset element arrangement rules to obtain G groups of codewords, each group includes N codewords, and the N codewords in the same group include the same elements but the elements are arranged in different order Are not the same;

In this step, the N codewords in each group of codewords are used for the transmission of N time slots in a wireless frame, and the N time slots can be continuous time slots, equally spaced time slots or non-equally spaced time slots The time slot; the element arrangement rule is an arbitrary rule that ensures that the arrangement orders of the elements in the encoded N codewords are different from each other.

After encoding, the encoded N×G codewords are respectively set on the sender and the receiver. The sender selects a set of codewords to send to the receiver according to the cell group ID of the cell to which the service data currently sent by the traffic channel belongs; Words are decoded to achieve frame synchronization and detection of cell group information.

Fig. 3 is an exemplary flowchart of a decoding method in an embodiment of the present invention. As shown in Figure 3, the decoding method in this embodiment includes the following steps:

Step 301, set the same G group of codewords as the sender, each group includes N codewords and the K elements included in each codeword are not all the same as the K elements in other groups of codewords, and the N codewords in the same group The codewords include the same elements but the elements are arranged in different order;

Step 302, detecting the received codewords comprising K elements, and performing diversity combination of the received continuous codewords according to the detection result and the element arrangement rules of the preset G group of codewords;

In this step, continuous codewords refer to codewords in continuous S-SCH symbols, that is, codewords received several times in a row, rather than meaning that received codewords must be continuous in time; pre-set The element arrangement rules are the same as those used in encoding;

Step 303, compare the codewords after the diversity combination with the set N×G codewords, determine the actual value of the elements in the codewords after the diversity combination according to the preset element arrangement rules, and obtain the frame synchronization information and Information about the cell group.

In this step, the frame synchronization information is determined according to the preset element arrangement rules and the arrangement order of the elements whose actual values are determined in the codeword; according to the actual values of the elements included in the codeword, the information of the cell group is determined, such as the cell group Information such as a group ID that can uniquely identify a cell group.

In practical applications, in steps 302 to 303, diversity combining may not be performed, but the detection result is directly compared with the set G codewords to obtain frame synchronization information and cell group information. However, compared with the way of diversity combining, this scheme cannot obtain diversity gain.

Next, the frame synchronization detection system and method in this embodiment will be described in detail.

FIG. 4 is a structural diagram of a system for realizing frame synchronization and cell group information acquisition in an embodiment of the present invention. As shown in FIG. 4 , the system for realizing frame synchronization and cell group information acquisition in this embodiment includes: a sender and a receiver.

The sender includes: a code word storage unit, a main control unit and a signal transmitting unit.

The codeword storage unit stores preset G groups of codewords, each group includes N codewords and the K elements included in each codeword are not completely the same as the K elements in other groups of codewords, and the N elements of the same group The codewords include the same elements but the arrangement orders of the elements are different from each other; the stored G groups of codewords are provided to the main control unit.

The main control unit, according to the cell group ID of the cell to which the traffic data currently sent by the traffic channel belongs, selects one group from the G groups of codewords stored in the codeword storage unit to provide to the signal transmitting unit.

The signal transmitting unit maps the code word of the main control unit to the sub-carrier of the S-SCH and sends it to the receiver.

Specifically, the signal transmitting unit can map elements in the code word from the main control unit to continuous subcarriers in the S-SCH, so that the receiver can obtain better results in non-coherent detection; it can also map to the equally spaced subcarriers of the S-SCH, so that the receiver can obtain better results during coherent detection.

In this embodiment, the sender may include one or more antennas. In this way, the signal transmitting unit may transmit through the antennas in a time switched transmit diversity (TSTD) manner, that is, the S-SCH symbols are transmitted in different time slots. Different antennas can be used for transmission, but only one transmit antenna is used for each time slot; frequency switched transmit diversity (FSTD) can also be used for transmission, that is, different parts of the S-SCH symbol Different antennas are used for transmission, and multiple antennas can be used for frequency multiplexing in each time slot.

The receiver is a device with a decoding function, including: a decoding information unit, a signal receiving unit, a diversity combining unit, and a decoding operation unit.

The decoding information unit stores the same G element groups and element arrangement rules as the sender; provides the stored G element groups to the decoding operation unit; provides the stored element arrangement rules to the diversity combining unit and the decoding operation unit.

The signal receiving unit receives the code word on the S-SCH subcarrier and provides it to the diversity combining unit.

The diversity merging unit detects the codewords from the signal receiving unit, and performs diversity merging on the received continuous codewords according to the detection result and the element arrangement rule provided by the decoding information unit; provides the codewords after the diversity merging to the decoder computing unit.

The decoding operation unit compares the code word after the diversity combination provided by the diversity combination unit with the G element groups provided by the decoding information unit, and determines the actual value of the element in the code word after the diversity combination; according to the stored element arrangement rules and The code word of the actual value of the element is determined, and the frame synchronization information and the information of the cell group are obtained.

In practical applications, the above system may further include encoding equipment, which is used to generate G groups of codewords and provide them to the sender and receiver. The encoding device includes: an element information unit, an encoding operation unit and a signal transmitting unit.

The element information unit stores element arrangement rules and G element groups including K elements, and the K elements included in each element group are not all the same; the stored element arrangement rules and the G element groups are provided to the Encoding operation unit.

Among them, each element corresponds to a unique SSC.

The encoding operation unit encodes the G element groups provided by the element information unit according to the element arrangement rules provided by the element information unit to obtain G groups of codewords, each group includes N codewords, and the N codewords of the same group Each of them includes the same elements but the arrangement order of the elements is different from each other; the obtained G groups of codewords are provided to the codeword storage unit of the sender and the decoding information unit of the receiver.

Wherein, each of the G element groups corresponds to the information of a cell group, such as a cell group ID, therefore, selection is made from the generated G element groups according to the corresponding cell group ID.

In the frame synchronization detection system of this embodiment, the internal functional units of the sender and the receiver are only a preferred implementation, and can also be realized through the combination of other functional units; the antenna can be a physical antenna, or a fixed preset A virtual antenna obtained by encoding vector matrix (precoding vector switching diversity); the encoding device can also be used as a functional unit inside the transmitter and/or receiver.

The above is a detailed description of the system for realizing frame synchronization and cell group information acquisition in this embodiment. Next, the method for frame synchronization and cell group information acquisition in this embodiment will be described in detail.

Fig. 5 is a flowchart of a method for frame synchronization and obtaining cell group information in an embodiment of the present invention. As shown in Figure 5, the method for frame synchronization and obtaining cell group information in this embodiment includes the following steps:

Step 501, setting M mutually different elements and element arrangement rules.

In this step, the set M elements correspond to M SSCs respectively.

In this embodiment, the element arrangement rule can be:

c _i (n) = c _k (n+1), and c _k (n) = c _i (n+1) (1.1)

This element arrangement rule, that is, the element arrangement rule 1, can ensure the diversity combination during the frame synchronization detection process, no matter what the slot order n is at this time, the receiver can combine the same elements in two consecutive symbols , thereby improving the detection performance. The above formula (1.1) is combined to obtain c _i (n)= _ci (n+2), which means that the repetition period of the codeword is 2. In the case of encoding with element arrangement rule 1, suppose that in any time slot n+1, the position of a certain element c _k (n+1) in the codeword in the previous time slot n is known, so When the receiver detects a complete codeword in a time slot, it can know the position of the same element in the front and back time slots through the known element arrangement rule 1 and perform diversity combination, and further infer the frame of the wireless frame head position.

In this embodiment, the element arrangement rule can also be expressed as an arrangement matrix, that is, the element arrangement rule 2:

P ^N =I

P ⁿ ≠ I, 1 ≤ n < N and C(n+1) ^T = PC(n) ^T (1.2)

Among them, T represents the transpose transformation of the matrix, and I is the identity matrix.

Element permutation rule 2 also ensures diversity during frame sync detection. That is to say, when the receiver detects a complete codeword in a certain time slot, it can know the position of the same element in the front and back time slots through the known element arrangement rule 2 and perform diversity combination, and further infer that the wireless The frame header position of the frame.

Step 502, according to M mutually different elements, set G element groups including K elements, respectively corresponding to G cell group IDs, and the K elements included in each element group are the same as the K elements in other element groups ( K<M) elements are not all the same.

In step 503, the G element groups are encoded according to the set element arrangement rules, and each element group is encoded to obtain N codewords, that is, to obtain N×G codewords in total. The N codewords in the same group include the same elements but the arrangement orders of the elements are different from each other.

In this embodiment, after step 502, the set G element groups and the element arrangement rules set in step 501 can be stored in the sender and receiver at the same time, and the sender and receiver can simultaneously generate the same N×G Codewords; also after step 503, directly store the acquired N×G codewords in the sender and the receiver at the same time. In this way, the sender can select a corresponding group of codewords to send to the receiver according to different cell group IDs; The positions of the same elements are combined, and the frame header position of the wireless frame can be deduced further based on this, and the N×G codewords are correlated with the received codewords to realize detection.

In the above steps 502-503, in order to realize the diversity combination of frame synchronization detection, it must be ensured that for a specific cell group ID, the corresponding codeword transmitted in a radio frame must include the same element c _i ^(g) (n).

Coding example 1: set M=32, namely element set {1, 2, ..., 32} (setting and 32 SSCs), K=2 (choose 2 from 32 SSCs, multiplex in one in S-SCH symbols), N=2 (2 S-SCH symbols exist in each radio frame). Since it is necessary to ensure that the elements in each element group and the encoded codeword are unique, that is, they are different from each other, therefore, in the case of K=2, all the following combinations (1, 1), (2, 2), (3, 3), ..., (32, 32), the number of remaining element combinations is (32×32-32)/2=496, namely G= 496. The detection of 496 cell group IDs and frame synchronization may be completed through one S-SCH symbol. Assuming that the element group corresponding to a specific cell group ID includes 5 and 21, the element group is encoded using a preset element arrangement rule. If the element arrangement rule 1 of this embodiment is adopted, the encoding process can be as follows: set the code word corresponding to the first S-SCH symbol in a radio frame as C(1)=(21,5), and then rearrange For this codeword, C(2)=(5, 21) is obtained. In this way, any codeword including 5 and 21 corresponds to a specific cell group ID, where the frame synchronization (for example, number n) can be determined by the order of 5 and 21 in the received codewords detected.

Coding example 2: set M=16, namely element set {1, 2, ..., 16} (setting and 16 SSC one-to-one correspondence), K=4 (choose 4 from 16 SSCs, complex used in one S-SCH symbol), N=2 (2 S-SCH symbols exist in each radio frame). Since it is necessary to ensure that each element group and the elements in the encoded codeword are unique, that is, they are different from each other, therefore, in the case of K=4, the number of possible element combinations is 1820, that is, G=1820 , the detection of 1820 cell group IDs and frame synchronization can be completed through one S-SCH symbol. Assuming that the element group corresponding to a specific cell group ID includes 2, 5, 11, and 15, the element group is encoded using a preset element arrangement rule. If the element arrangement rule 2 of the present embodiment is adopted, the encoding process can be as follows: Suppose we set the code word corresponding to the first S-SCH symbol in a wireless frame as C(1)=(11, 2, 15 , 5), and then rearrange the code word C(2) ^T =PC(1) ^T to obtain C(2)=(15, 5, 11, 2).

in, $P=\left[\begin{array}{cccc}0& 0& 1& 0\\ 0& 0& 0& 1\\ 1& 0& 0& 0\\ 0& 1& 0& 0\end{array}\right]$

It can be seen from the above coding example, assuming that the code word corresponding to the first S-SCH symbol in a radio frame is C _g (1), when n>1, the code word C _g (n) can be obtained according to different arrangements . The first codeword {1≤g≤G: C _g (1)} among the N codewords can be set by some specific design criteria, such as maximizing the minimum distance between all codewords. Moreover, the above coding example can realize more cell group IDs, far more than the 170 required in the existing cell search, so that the technical solution of this embodiment can realize the detection of more cell groups and cells, have high feasibility.

Among them, maximizing the minimum distance between all codewords refers to: making each element in the codeword C _g1 (1) corresponding to each cell group ID, relative to the codeword C _gi (1) corresponding to other cell group IDs ) for each element at the corresponding position, the difference of the actual value is maximized.

i.e. to make as much as possible $\underset{k=\mathrm{1,1}\&le;\mathrm{gi},\mathrm{gj}\&le;G}{\overset{K}{\mathrm{\&Sigma;}}}|c_k^{\left(\mathrm{gi}\right)}\left(1\right)-c_k^{\left(\mathrm{gj}\right)}\left(1\right)|$ The value of is the largest.

In this way, it can be ensured that the codewords corresponding to different cell group IDs have a large difference in the actual values of the elements. Even if the codewords are interfered during transmission, the receiver can easily and accurately distinguish the codewords corresponding to different cell group IDs. Corresponding to different codewords.

Step 504, the sender selects one group from the set G codewords according to the cell group ID of the cell to which the service data currently sent by the traffic channel belongs, and sends it to the receiver through the antenna.

In this step, multiple elements in one codeword correspond to multiple SSCs, and these elements need to be multiplexed into one S-SCH symbol for transmission. According to different ways of mapping SSC to subcarriers, different arrangements can obtain different degrees of frequency diversity, for example: mapping elements corresponding to SSC to continuous subcarriers in S-SCH, or mapping elements corresponding to SSC to S-SCH on K subcarriers at equal intervals in the SCH. When non-coherent detection is performed, the way of mapping to continuous subcarriers can achieve greater beneficial effects; when coherent detection is performed, the way of mapping to K subcarriers at equal intervals can achieve greater beneficial effects.

In addition, relative to time-frequency diversity, antenna diversity can also be obtained by using all S-SCH symbols or part of S-SCH symbols on different antennas during transmission. The antenna in this embodiment refers to: a physical antenna or A virtual antenna obtained by a fixed precoding vector matrix (precoding vector switching diversity), and the antenna diversity method may include:

Time switched transmit diversity (TSTD), that is, S-SCH symbols can use the same antenna for transmission in different time slots, but only one transmit antenna is used in each time slot.

Frequency switched transmit diversity (FSTD), that is, different parts of the S-SCH symbol use different antennas for transmission, and multiple antennas can be used for frequency multiplexing in each time slot.

For the coding example 1 in steps 502 to 503, 2 transmit antennas of TSTD can be used, for example, antenna 1 is used for all odd time slots, and antenna 2 is used for all even time slots; 2 transmit antennas of FSTD can also be used, Two antennas can be used to transmit one S-SCH symbol at the same time, but each antenna is set to transmit a part of the S-SCH symbol. If there are S subcarriers in one S-SCH symbol, only the S-SCH is used on each antenna. Half of the subcarriers in a symbol, that is, S/2 subcarriers, are transmitted.

Step 505, the receiver detects the received codewords, and performs diversity combination of the received consecutive codewords according to the detection result and the preset element arrangement rule.

Wherein, the continuous codewords refer to: codewords in consecutive S-SCH symbols, not that the two codewords must be consecutive in time.

After step 504, but before this step, the receiver can obtain symbol synchronization and frequency synchronization according to the operation in step 101 in the existing cell search as shown in FIG. 1 .

Since the sender reuses the codeword obtained by encoding an element group in the S-SCH, that is, the codeword sent by the sender is: ......, C(1), ......, C(N ), C(1), C(2),..., C(N),..., which ensures that the cycle of the code word and the repetition cycle of the S-SCH symbol is one The frame length of the radio frames is the same. This enables the receiver to ensure that all codewords corresponding to a cell group ID, ie, C(1)-C(N), are received within a repetition period of an S-SCH symbol when frame synchronization is not achieved.

In this step, the receiver's detection process can be as follows: all candidate sequences, that is, the set N×G codewords, are correlated with the received codewords to obtain the i-th received in the nth time slot The codewords include the correlation value of element k in a certain codeword (one of the set N×G codewords).

In this way, it can be avoided that the element combination in the finally decoded codeword is not any one of the set G element groups due to the interference of the codeword during transmission, thereby avoiding the situation that the receiver cannot obtain the cell group ID .

In this step, the detection method adopted may be coherent detection or non-coherent detection.

The frequency domain signal of the jth subcarrier received by the receiver (that is, corresponding to an element in a certain codeword) is:

Y _j =H _j X _j +N _j ,

Among them, H _j is the channel response, X _j is the original information symbol sent (that is, the elements in the codeword sent by the sender), and N _j is noise.

In this embodiment, assuming that the length of the transmitted codeword is P, the actual value of the i-th codeword can be expressed as:

${\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; .</span>$

Moreover, the receiver has already known the G codewords representing different cell group information and the arrangement rules of the elements, so the received signal can be correlated with all N×G codewords in order to achieve detection.

When coherent detection is used, the correlation value of element k in time slot n relative to the i-th sequence, that is, the i-th element, can be obtained through the following process:

${\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; ik</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span><span\; class="notranslate">\; |</span>\underset{\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; P</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; Y</span>}}}_{\mathrm{<span\; class="notranslate">\; j</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; |</span><span\; class="notranslate">\; ,</span>$

Wherein, ρ _ik (n) is the correlation value as detection result; ${\tilde{Y}}_j=\frac{Y_j{\hat{h}}_j^{*}}{{\hat{h}}_j^{*}{\hat{h}}_j};$ is the channel estimation value of H _j , and the channel estimation is used to eliminate the influence of the fading channel on the transmitted data; 1≤i≤P, P is the codeword length received by the receiver in one cycle.

When non-coherent detection is used, the correlation value of element k in time slot n relative to the i-th sequence, that is, the i-th element, can be obtained through the following process:

${\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; ik</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span><span\; class="notranslate">\; |</span>\underset{\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; P</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; Y</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}^{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; |</span><span\; class="notranslate">\; .</span>$

Wherein, ρ _ik (n) is the correlation value as the detection result; 1≤i≤P, and P is the codeword length received by the receiver within one cycle.

It can be seen from the above detection method that the receiver performs correlation calculations on the received codewords and all the set N×G codewords of the elements at corresponding positions, and accumulates the correlation values of all elements at corresponding positions, thus obtaining the received Correlation values between the obtained codeword and all N×G codewords.

Based on the above-mentioned detection methods, for the coding example 1 in steps 502 to 503, the process of performing diversity merging according to the element arrangement rules and detection results can be as follows:

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.4</span>}<span\; class="notranslate">\; )</span>$

Based on the above-mentioned detection methods, for the coding example 2 in steps 502 to 503, the process of performing diversity merging according to the element arrangement rules and detection results can be as follows:

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 4</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 4</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 4</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.5</span>}<span\; class="notranslate">\; )</span>$

为分集合并之后的相关矩阵。in,

is the correlation matrix after diversity combination.

This diversity combining method can also be extended. For example, when more S-SCH symbols are included in one radio frame, that is, when more S-SCH symbols can be used for correlation value accumulation, for the coding examples in steps 502 to 503 1. The process can be:

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; .</span>\mathrm{<span\; class="notranslate">\; 6</span>}<span\; class="notranslate">\; )</span>$

For the coding example 2 in step 502～step 503, this process can be:

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 4</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

${\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 4</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 4</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; .</span>\mathrm{<span\; class="notranslate">\; 7</span>}<span\; class="notranslate">\; )</span>$

In step 506, the receiver compares the codeword after diversity combination with all preset codewords, and determines the actual values of elements in the codeword after diversity combination.

This step can be a decoding process of maximum likelihood estimation, expressed as:

${\mathrm{<span\; class="notranslate">\; C</span>}}^{<span\; class="notranslate">\; *</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; arg</span>}\underset{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&Element;</span>\mathrm{<span\; class="notranslate">\; \&Omega;</span>}}{\mathrm{<span\; class="notranslate">\; max</span>}}\underset{\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; K</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\stackrel{<span\; class="notranslate">\; ~</span>}{\mathrm{<span\; class="notranslate">\; \&rho;</span>}}}_{{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; no</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.8</span>}<span\; class="notranslate">\; )</span>$

Wherein, C ^* (n) is a codeword that determines the actual value of the element; the set Ω includes N×G codewords.

In this way, the codeword corresponding to the maximum correlation peak can be determined as C ^* (n).

Step 507: Obtain frame synchronization information and cell group information according to the preset element arrangement rule and the code word that determines the actual value of the element.

In this step, the cell group information, such as the cell group ID, is determined according to the values of the elements in C ^* (n), and the frame synchronization information is determined according to the arrangement order of the elements in C ^* (n).

So far, this process ends.

FIG. 6 is a schematic diagram of the effect of the frame synchronization detection method in the embodiment of the present invention. As shown in Figure 6, the frame synchronization detection scheme of this embodiment is used for cell search, and 170 cell group IDs and SSCs are used as Hadamard (Hadamard) sequences modulated by Gray (Golay) complementary sequences, M=32 , K=2, and the cell search time when the signal-to-noise ratio (SNR)=10dB is taken as an example, the cell search process after diversity combining in this embodiment is obviously shortened compared to the scheme without diversity combining The time of the cell search.

The embodiment encodes the combination of elements corresponding to different SSCs to obtain codewords with different element arrangement orders, thereby realizing the multiplexing of multiple SSCs in one S-SCH symbol; the receiving side according to the element arrangement order and Combining elements can obtain frame synchronization and cell group information while obtaining diversity gain. At the same time, the technical solution of the above embodiment further shortens the time for cell search, and improves the efficiency and feasibility of cell search. Moreover, the encoding method provided by the embodiment of the present invention also increases the number of cells or cell groups that may be detected during the cell search process, further improving the feasibility of cell search.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the protection scope of the present invention. Any modifications, equivalent replacements and improvements made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.

Claims (37)

1. A method for frame synchronization and cell group information acquisition, comprising the steps of:

setting at least one group of code words according to a preset element arrangement rule, wherein each code word in each group comprises the same elements but has different element arrangement sequences, and the elements in each group of code words are different from the elements in other groups of code words;

the sender selects a group from the at least one group of code words and sends the selected group to the receiver;

and the receiver detects the received code words, performs diversity combination on the continuously received code words according to the detection result and the preset element arrangement rule, compares the code words after the diversity combination with at least one set of code words, determines the actual values of the elements in the code words after the diversity combination, and obtains the frame synchronization information and the cell group information.

2. The method for frame synchronization and cell group information acquisition as claimed in claim 1, wherein said setting at least one group of codewords is:

setting at least one element group comprising a plurality of elements;

and coding the set element groups according to a preset element arrangement rule, wherein all coding results of each element group form a group of code words, and each code word in each group comprises the same elements but has different element arrangement sequences.

3. The method for frame synchronization and cell group information acquisition as claimed in claim 2, wherein the number of cell groups is set to G, and the at least one element group is set to: respectively setting G element groups corresponding to the information of each cell group according to the number of the cell groups; wherein G is a positive integer.

4. The method for frame synchronization and cell group information acquisition of claim 3, wherein the cell group information is a cell group identity ID.

5. The method for frame synchronization and cell group information acquisition as claimed in claim 2, wherein each element in the element group corresponds to a different sequence from each other.

6. The method for frame synchronization and cell group information acquisition as claimed in any one of claims 3 to 5, wherein, assuming that the number of codewords in each group is N, N is a positive integer, and the N codewords in each group are respectively used for N time slot transmissions in a radio frame;

the encoding of the set G element groups according to the preset element arrangement rule is as follows: the code words transmitted by the (N +1) th time slot of the N time slots are obtained by rearranging the code words transmitted by the nth time slot according to the element arrangement rule;

wherein N is a positive integer greater than or equal to 1 and less than N.

7. The method for frame synchronization and cell group information acquisition according to claim 6, wherein the element arrangement rule is: the kth element in the codeword transmitted by the nth time slot is the same as the ith element in the codeword transmitted by the (n +1) th time slot, and the ith element in the codeword transmitted by the nth time slot is the same as the kth element in the codeword transmitted by the (n +1) th time slot;

i and k are positive integers which are greater than or equal to 1 and less than or equal to the number of elements in each codeword, and i and k are different from each other.

8. The method for frame synchronization and cell group information acquisition according to claim 6, wherein the element arrangement rule is: the product of the transpose matrix of the code word transmitted by the nth time slot and the preset permutation is the same as the transpose matrix of the code word transmitted by the (n +1) th time slot;

the power N of the permutation matrix is an identity matrix, and the power N of the permutation matrix is not equal to the identity matrix;

wherein N is a positive integer greater than or equal to 1 and less than N.

9. The method for frame synchronization and cell group information acquisition as claimed in claim 6, wherein the transmitting side transmits the codeword to the receiving side: different antennas are used for transmission in different time slots, and only one antenna is used in the same time slot.

10. The method for frame synchronization and cell group information acquisition as claimed in claim 6, wherein the transmitting side transmits the codeword to the receiving side: different antennas are used for transmission in a time slot.

11. The method for frame synchronization and cell group information acquisition according to claim 9 or 10, wherein the one antenna is: a physical antenna, or a virtual antenna obtained by a fixed precoding vector matrix or precoding vector switching diversity.

12. The method for frame synchronization and cell group information acquisition as claimed in claim 6, wherein the receiver performs detection on the received codeword as: and respectively carrying out correlation calculation on elements in the code words received by the nth time slot and the elements in the set NxG code words to obtain correlation values of the code words and the NxG code words, and taking the obtained correlation values as detection results.

13. The method for frame synchronization and cell group information acquisition as claimed in claim 12, wherein the diversity combining of the received consecutive codewords is performed according to the detection result and a preset element arrangement rule as follows: and according to a preset element arrangement rule, combining correlation values obtained by calculating elements at corresponding positions in the code words transmitted by the nth time slot with correlation values corresponding to elements at corresponding positions in the continuous code words of the code words.

14. The method for frame synchronization and cell group information acquisition as claimed in claim 12, wherein the comparing of the diversity-combined codeword with the preset nxg codewords identical to the sender: and determining the code word corresponding to the highest value in all the combined correlation values as the received code word by adopting a maximum likelihood mode.

15. A method for frame synchronization and cell group information acquisition, comprising the steps of:

setting at least one group of code words according to a preset element arrangement rule, wherein each code word in each group comprises the same elements but has different element arrangement sequences, and the elements in each group of code words are different from the elements in other groups of code words;

the sender selects a group from the at least one group of code words and sends the selected group to the receiver;

and the receiver detects the received code words, compares the detection result with the set at least one group of code words, determines the actual value of the detection result and obtains the frame synchronization information and the cell group information.

16. A system for implementing frame synchronization and cell information acquisition, comprising: a sender and a receiver, wherein,

the sender is used for storing at least one group of code words, each code word in each group comprises the same elements but has different element arrangement sequences, and the elements in each group of code words are different from the elements in other groups of code words; selecting one group from at least one group of stored code words and sending the selected group to the receiving party;

the receiver is used for storing at least one group of code words which are the same as the code words in the sender and the element arrangement rules of the code words; detecting the received code words, diversity combining the continuously received code words according to the detection result and the stored element arrangement rule, comparing the code words after diversity combining with at least one group of stored code words, determining the actual value of the elements in the code words after diversity combining, and obtaining the frame synchronization information and the information of the cell group.

17. The system of claim 16, wherein the sender comprises: a code word storage unit, a main control unit and a signal transmitting unit, wherein,

the code word storage unit is used for storing at least one group of preset code words, each code word in each group comprises the same elements but has different element arrangement sequences, and the elements in each group of code words are different from the elements in other groups of code words; providing the stored at least one set of codewords to a master control unit;

the main control unit is used for selecting one group from at least one group of code words stored in the code word storage unit and providing the selected group to the signal transmitting unit;

and the signal transmitting unit is used for transmitting the code words from the main control unit to a receiving party.

18. The system of claim 17, wherein the sender further comprises: more than one antenna;

the signal transmitting unit is further used for transmitting through one antenna in each time slot and transmitting through different antennas in different time slots; or in each time slot, transmitting a plurality of elements in the coded code word through different antennas.

19. The system of claim 16, wherein the receiving party comprises: a decoding information unit, a signal receiving unit, a diversity combining unit and a decoding operation unit, wherein,

the decoding information unit is used for storing at least one group of code words and element arrangement rules which are the same as those in the encoding equipment; providing the stored at least one group of code words to a decoding arithmetic unit; providing the stored element arrangement rule to a diversity combining unit and a decoding operation unit;

the signal receiving unit is used for receiving the code words on the sub-carrier wave of the sub-synchronous channel S-SCH and providing the code words to the diversity combining unit;

the diversity combining unit is used for detecting the received code words and carrying out diversity combining on the received continuous code words according to the detection result and the element arrangement rule provided by the decoding information unit; providing the code word after diversity combination to a decoding arithmetic unit;

the decoding operation unit is used for comparing the diversity-combined code word provided by the diversity-combining unit with at least one group of code words provided by the decoding information unit and determining the actual value of the element in the diversity-combined code word; and obtaining frame synchronization information and cell group information according to the stored element arrangement rule and the code word determining the actual value of the element.

20. The system of claim 16, further comprising an encoding device for storing the element arrangement rule and at least one element group including a plurality of elements; coding the at least one group of element groups according to a preset element arrangement rule, wherein all coding results of each element group form a group of code words, and each code word in each group comprises the same elements but has different element arrangement sequences; and providing the at least one group of code words to the sender and the receiver.

21. The system of claim 20, wherein the encoding device comprises: an element information unit and an encoding operation unit, wherein,

the element information unit is used for storing element arrangement rules and at least one element group containing a plurality of elements; providing the stored element arrangement rule and at least one element group to the encoding arithmetic unit;

the encoding arithmetic unit is used for encoding the at least one group of element groups according to a preset element arrangement rule, all encoding results of each element group form a group of code words, and each code word in each group comprises the same elements but has different element arrangement sequences; and providing the obtained at least one group of code words to the sender and the receiver.

22. A coding method in cell search, comprising the steps of:

setting at least one element group comprising a plurality of elements;

and coding the set element groups according to a preset element arrangement rule, wherein all coding results of each element group form a group of code words, and each code word in each group comprises the same elements but has different element arrangement sequences.

23. The encoding method of claim 22, wherein the number of cell groups is set to G, and wherein at least one element group is set to: respectively setting G element groups corresponding to the information of each cell group according to the number of the cell groups; wherein G is a positive integer.

24. The encoding method of claim 23, wherein the cell group information is a cell group identity ID.

25. The encoding method of claim 22, wherein each element in the element group corresponds to a different sequence.

26. The encoding method according to any one of claims 23 to 25, wherein the number of codewords in each group is N, N is a positive integer, and the N codewords in each group are respectively used for N time slot transmissions in a radio frame;

the encoding of the set G element groups according to the preset element arrangement rule is as follows: the code words transmitted by the (N +1) th time slot of the N time slots are obtained by rearranging the code words transmitted by the nth time slot according to the element arrangement rule;

wherein N is a positive integer greater than or equal to 1 and less than N.

27. The encoding method of claim 26, wherein the element arrangement rule is: the kth element in the codeword transmitted by the nth time slot is the same as the ith element in the codeword transmitted by the (n +1) th time slot, and the ith element in the codeword transmitted by the nth time slot is the same as the kth element in the codeword transmitted by the (n +1) th time slot;

i and k are positive integers which are greater than or equal to 1 and less than or equal to the number of elements in each codeword, and i and k are different from each other.

28. The encoding method of claim 26, wherein the element arrangement rule is: the product of the transpose matrix of the code word transmitted by the nth time slot and the preset permutation is the same as the transpose matrix of the code word transmitted by the (n +1) th time slot;

the power N of the permutation matrix is an identity matrix, and the power N of the permutation matrix is not equal to the identity matrix;

wherein N is a positive integer greater than or equal to 1 and less than N.

29. The encoding method of claim 26, wherein the codewords for transmission in the 1 st slot are determined according to a criterion of maximizing a minimum distance between the codewords.

30. An encoding device for cell search, comprising: an element information unit and an encoding operation unit, wherein,

the element information unit is used for storing element arrangement rules and at least one element group containing a plurality of elements; providing the stored element arrangement rule and at least one element group to the encoding arithmetic unit;

the encoding arithmetic unit is used for encoding the at least one group of element groups according to a preset element arrangement rule, all encoding results of each element group form a group of code words, and each code word in each group comprises the same elements but has different element arrangement sequences.

31. A decoding method in cell search, comprising the steps of:

setting at least one group of code words identical to the sender according to a preset element arrangement rule, wherein each code word in each group comprises identical elements but has different element arrangement sequences, and the elements included in each group of code words are different from the elements included in other groups of code words;

detecting the received code words with the same number of elements as the set code words, diversity combining the continuously received code words according to the detection result and the preset element arrangement rule, comparing the code words after diversity combining with at least one set of code words, determining the actual values of the elements in the code words after diversity combining, and obtaining the frame synchronization information and the information of the cell group.

32. The decoding method of claim 31, wherein assuming that the number of codewords in each group is N, where N is a positive integer, the detecting the received codewords is: and respectively carrying out correlation calculation on elements in the code words received by the nth time slot and the elements in at least one set of code words to obtain correlation values of the code words and the at least one set of code words, and taking the obtained correlation values as detection results.

33. The decoding method of claim 32, wherein the diversity combining of the received consecutive codewords is performed according to the detection result and a preset element arrangement rule as follows: and combining the correlation value obtained by calculating the corresponding position element in the code word transmitted by the nth time slot with the correlation value obtained by calculating the corresponding position element in the code word continuous to the code word according to a preset element arrangement rule.

34. The decoding method of claim 32, wherein the comparing the diversity-combined codeword with the preset nxg codewords identical to the transmission side comprises: and determining the code word corresponding to the highest value in all the combined correlation values as the received code word by adopting a maximum likelihood mode.

35. A decoding method in cell search, comprising the steps of:

setting at least one group of code words identical to the sender according to a preset element arrangement rule, wherein each code word in each group comprises identical elements but has different element arrangement sequences, and the elements included in each group of code words are different from the elements included in other groups of code words;

and detecting the received code words with the same element number as the set code words, comparing the detection result with at least one set of code words, determining the actual value of the detection result, and acquiring the frame synchronization information and the cell group information.

36. A decoding device for cell search, comprising: a decoding information unit, a diversity combining unit and a decoding arithmetic unit, wherein,

the decoding information unit is used for storing the same element arrangement rule and at least one group of code words as those in the code word sender, each code word in each group comprises the same elements but has different element arrangement sequences, and the elements in each group of code words are different from at least one of the elements in other groups of code words; providing the stored at least one group of code words to a decoding arithmetic unit; providing the stored element arrangement rule to a diversity combining unit and a decoding operation unit;

the diversity combining unit is used for detecting the received code words which comprise the same number of elements as the stored code words and carrying out diversity combining on the continuously received code words according to the detection result and the element arrangement rule provided by the decoding information unit; providing the code word after diversity combination to a decoding arithmetic unit;

and the decoding operation unit is used for comparing the diversity-combined code word provided by the diversity-combining unit with at least one group of code words provided by the decoding information unit, determining the actual value of the element in the diversity-combined code word, and acquiring the frame synchronization information and the cell group information according to the stored element arrangement rule.

37. The decoding device of claim 36, wherein the device further comprises: and the signal receiving unit is used for receiving the code words on the sub-carrier of the S-SCH of the secondary synchronization channel and providing the code words to the diversity combining unit.

Images