# US 2015/0311947 A1 · Method and Device for Searching Cell

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0311947 A1
- Document ID: US20150311947A1
- Status: Published application
- Kind: A1
- Application number: 14/654,634
- Filed: 2013-10-22
- Published: 2015-10-29
- Earliest claimed: 2012-12-21
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Hui LEI
- Web page: https://patentgrep.com/patent/US20150311947A1

## CPC

- H04B 1/70735: {Code identification (H04B1/7083 takes precedence)}
- H04B 1/7083: Cell search, e.g. using a three-step approach
- H04J 13/0003: {Code application, i.e. aspects relating to how codes are applied to form multiplexed channels}
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- H04B 2201/7073: Direct sequence modulation synchronisation
- H04J 2013/0096: {Network synchronisation}
- H04B: TRANSMISSION
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Provided are a method and device for searching a cell, and the method comprises: timeslot synchronization is performed; a primary scrambling code group is identified and a frame synchronization is performed according to hashed values of code numbers of secondary synchronization codes (SSCs) in any several consecutive timeslots; and a primary scrambling code is obtained in the primary scrambling code group according to the primary scrambling code group, so as to complete cell searching.

## Claims

### Claim 1

A method for searching a cell, comprising:
performing times lot synchronization;
identifying a primary scrambling code group and performing frame synchronization according to hashed values of code numbers of Secondary Synchronization Codes (SSCs) in any several consecutive timeslots; and
obtaining a primary scrambling code in the primary scrambling code group according to the primary scrambling code group to complete cell searching.

### Claim 2 (depends on 1)

The method for searching the cell according to claim 1, wherein a Primary Synchronization Code (P-SCH) is used for capturing the primary synchronisation code by matching a peak value of a filtered output signal to determine a timeslot boundary, so as to complete timeslot synchronization.

### Claim 3 (depends on 1)

The method for searching the cell according to claim 1, wherein identifying the primary scrambling code group and performing frame synchronization according to the hashed values of code numbers of SSCs in any several consecutive timeslots comprises:
obtaining code numbers of the SSCs in any five consecutive timeslots, which are marked as CP, P=0, 1, 2, 3, 4;
recording the CP, P=0, 1, 2, 3, 4 as Fk=(Ck, Ck+1, Ck+2) k=0, 1, 2, wherein when k=0, a hashed value F0 is calculated according to a hash formula;
judging whether or not there is a value Di,j which is equal to F0 in a lookup table D obtained in advance by calculating according to the hash formula; if yes, determining that the primary scrambling code group number is i and Ck actually represents the (j×3)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculating a hashed value F1 when k=1 by the hash formula and further judging whether or not there is a value Di,j which is equal to F1 in the lookup table D; if yes, determining that the primary scrambling code group number is i and Ck actually represents the (j×3+1)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculating a hashed value F2 when k=2 by the hash formula and finally judging whether or not there is a value Di,j which is equal to F2 in the lookup table D; if yes, determining that the primary scrambling code group number is i and Ck actually represents the (j×3+2)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; and if no, ending a flow.

### Claim 4 (depends on 3)

The method for searching the cell according to claim 3, wherein obtaining the lookup table D in advance by calculating according to the hash formula comprises:
dividing the SSCs in 64 rows and 15 columns into 64×5 groups in a manner of dividing the columns into 5 groups by forming every three columns into one group, obtaining a numerical value Di,j by calculating the code numbers of SSCs in each group according to the hash formula, and accordingly obtaining a lookup table D with 64×5.

### Claim 5 (depends on 3)

The method for searching the cell according to claim 3, wherein the hash formula is:
Di,j=α·gi,j·3+0+β·gi,j·3+1+δ·gi,j·3+2,i=0, . . . ,63,j=0, . . . ,4;
where i represents the primary scrambling code group number in the table, represents the jth hash in each primary scrambling code group, gi,j·3+0 represents the code number of the SSC corresponding to the j·3+0th timeslot in the ith scrambling code group in the table, and α, β, and δ are coefficients.

### Claim 6

A device for searching a cell, comprising:
a timeslot synchronization component configured to perform timeslot synchronization;
a primary scrambling code group identification and frame synchronization component configured to identify a primary scrambling code group and perform frame synchronization according to hashed values of code numbers of secondary synchronization codes (SSCs) in any several consecutive timeslots; and
a cell searching component configured to obtain a primary scrambling code in the primary scrambling code group according to the primary scrambling code group to complete cell searching.

### Claim 7 (depends on 6)

The device for searching the cell according to claim 6, wherein the timeslot synchronization component uses a Primary Synchronization Code (P-SCH) to capture a primary synchronisation code by matching a peak value of a filtered output signal to determine a timeslot boundary, so as to complete timeslot synchronization.

### Claim 8 (depends on 6, 7)

The device for searching the cell according to claim 6 or 7, wherein the primary scrambling code group identification and frame synchronization component is configured to
obtain code numbers of the SSCs in any five consecutive timeslots, which are marked as CP, P=0, 1, 2, 3, 4;
record the CP, P=0, 1, 2, 3, 4 as Fk=(Ck, Ck+1, Ck+2) k=0, 1, 2, wherein when k=0, a hashed value F0 is calculated according to a hash formula; and
judge whether or not there is a value Di,j which is equal to F0 in a lookup table D obtained in advance by calculating according to the hash formula; if yes, determine that the primary scrambling code group number is i, wherein Ck actually represents the (j×3)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculate a hashed value F1 when k=1 by the hash formula and further judge whether or not there is a value Di,j which is equal to F1 in the lookup table D; if yes, determine that the primary scrambling code group number is i, wherein Ck actually represents the (j×3+1)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculate a hashed value F2 when k=2 by the hash formula and finally judging whether or not there is a value Di,j which is equal to F2 in the lookup table D; if yes, determine that the primary scrambling code group number is i, wherein Ck actually represents the (j×3+2)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, end the flow.

### Claim 9 (depends on 8)

The device for searching the cell according to claim 8, wherein the primary scrambling code group identification and frame synchronization component is configured to
divide the SSCs in 64 rows and 15 columns into 64×5 groups in a manner of dividing the columns into 5 groups by forming every three columns into one group, obtain a numerical value Di,j by calculating the SSC code numbers in each group according to the hash formula, and accordingly obtain the lookup table D with 64×5.

### Claim 10 (depends on 8)

The device for searching the cell according to claim 8, wherein the hash formula is
Di,j=α·gi,j·3+0+β·gi,j·3+1+δ·gi,j·3+2,i=0, . . . ,63,j=0, . . . ,4;
where i represents the primary scrambling code group number in the table, j represents the jth hash in each primary scrambling code group, gi,j·3+0 represents the code number of the SSC corresponding to the j·3+0th timeslot in the ith scrambling code group in the table, and α, β, and δ are coefficients.

### Claim 11 (depends on 2)

The method for searching the cell according to claim 2, wherein identifying the primary scrambling code group and performing frame synchronization according to the hashed values of code numbers of SSCs in any several consecutive timeslots comprises:
obtaining code numbers of the SSCs in any five consecutive timeslots, which are marked as CP, P=0, 1, 2, 3, 4;
recording the CP, P=0, 1, 2, 3, 4 as Fk=(Ck, Ck+1, Ck+2) k=0, 1, 2, wherein when k=0, a hashed value F0 is calculated according to a hash formula;
judging whether or not there is a value Di,j which is equal to F0 in a lookup table D obtained in advance by calculating according to the hash formula; if yes, determining that the primary scrambling code group number is i and Ck actually represents the (j×3)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculating a hashed value F1 when k=1 by the hash formula and further judging whether or not there is a value Di,j which is equal to F1 in the lookup table D; if yes, determining that the primary scrambling code group number is i and Ck actually represents the (j×3+1)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculating a hashed value F2 when k=2 by the hash formula and finally judging whether or not there is a value Di,j which is equal to F2 in the lookup table D; if yes, determining that the primary scrambling code group number is i and Ck actually represents the (j×3+2)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; and if no, ending a flow.

### Claim 12 (depends on 7)

The device for searching the cell according to claim 7, wherein the primary scrambling code group identification and frame synchronization component is configured to
obtain code numbers of the SSCs in any five consecutive timeslots, which are marked as CP, P=0, 1, 2, 3, 4;
record the CP, P=0, 1, 2, 3, 4 as Fk=(Ck, Ck+1, Ck+2) k=0, 1, 2 wherein when k=0, a hashed value F0 is calculated according to a hash formula; and
judge whether or not there is a value Di,j which is equal to F0 in a lookup table D obtained in advance by calculating according to the hash formula; if yes, determine that the primary scrambling code group number is i, wherein Ck actually represents the (j×3)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculate a hashed value F1 when k=1 by the hash formula and further judge whether or not there is a value Di,j which is equal to F1 in the lookup table D; if yes, determine that the primary scrambling code group number is i, wherein Ck actually represents the (j×3+1)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, calculate a hashed value F2 when k=2 by the hash formula and finally judging whether or not there is a value Di,j which is equal to F2 in the lookup table D; if yes, determine that the primary scrambling code group number is i, wherein Ck actually represents the (j×3+2)th timeslot of one frame, so as to complete the scrambling code group identification and frame synchronization process; if no, end the flow.
