# US 6,731,673 B1 · Synchronization channel with cyclic hierarchical sequences and method for cell site search with low detector complexity

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

- Number: US 6,731,673 B1
- Document ID: US6731673B1
- Status: Granted
- Kind: B1
- Application number: 09/504,548
- Filed: 2000-02-15
- Granted: 2004-05-04
- Earliest claimed: 1999-02-19
- Assignees: Nortel Networks Limited
- Inventors: Anatoli V. Kotov; Farideh Khaleghi; Norman Secord
- Web page: https://patentgrep.com/patent/US6731673B1

## CPC

- H04B 1/7083: Cell search, e.g. using a three-step approach
- H04B: TRANSMISSION

## Abstract

A CDMA system in which the base stations transmit a synchronization channel comprising a primary subchannel from which slot synchronization is determinate and a secondary subchannel containing a cyclic hierarchical code unique for each base station and for each slot in a frame. The cyclic code is derived from a first code unique to a base station and a different cyclic shift of a second code also unique to the base station in each slot of a frame. Mobile stations quickly and with low-complexity detectors determine slot synchronization from the primary subchannel and then determine base station identification and frame synchronization by correlating samples of signal received on the secondary subchannel with a set of first codes and cyclic shifts of corresponding second codes.

## Claims

### Claim 1

In a communication system, a method for determining a
synchronization code, comprising:
selecting a number of a first predetermined length from a set of numbers;
selecting a second number of a second predetermined length from said set of numbers;
determining a bit in said synchronization code by
selecting a digit from said number,
selecting a digit from said second number,
adding the digits together using modulo addition and,
cyclically shifting digits of the second number after determining a plurality of bits in said synchronization code having a total length equal to said first length.

### Claim 2 (depends on 1)

The method according to claim 1 further comprising
transmitting the synchronization code from a base station, receiving the synchronization code in a mobile station, and synchronizing the mobile station with the base station by correlating in the mobile station samples of the synchronization code with combinations of each value of a number of a first predetermined length selected from said set of numbers and all cyclic shifts of another number of a second predetermined length to produce a plurality of decision variables, and
identifying a maximum decision variable, wherein the corresponding number of first predetermined length in the mobile station equals the number of first predetermined length in the base station, and the number of cyclic shifts of the corresponding number of second predetermined length in the mobile station is indicative of number of cyclic shifts of a number of second predetermined length in the base station.

### Claim 3 (depends on 2)

The method according to claim 2 wherein the numbers in said set of numbers are chosen to produce synchronization codes having low cross-correlation and auto-correlation properties.

### Claim 4 (depends on 2)

The method according to claim 2 wherein said number and said second number are binary numbers.

### Claim 5 (depends on 4)

The method according to claim 4 wherein said number and said second number are identical.

### Claim 6 (depends on 5)

The method according to claim 5 wherein said set of numbers includes
0001 1101 1001 0100, 0100 1010 0010 0010, 0100 1000 1100 0001, 0001 111 1011 10111, 0010 1110 1010 0111, 0111 0110 0001 1110, 0111 1011 1111 0010, 0010 0010 0100 1011, 0001 0010 1001 1011, 1110 0110 0101 0011, 0100 0111 1100 1110, 1011 0011 0000 0110, 0010 0001 1010 1000, 1101 0101 1001 1111, 0111 0100 1111 1101, 1000 0000 1100 1010, 0010 1110 0101 1000, 1000 1100 0111 1110, 0111 1011 0000 1101, 1101 1001 0010 1011, 1011 1110 0001 0101, 1000 0011 0111 0001, 1110 1011 0100 0000, 1101 0110 0010 0100, 0111 0110 1110 0001, 1011 0000 0100 0010, 0010 0011 1011 0100, 1110 0101 0001 0111, 0111 1001 0001 0001, 1000 1100 1000 0001, 0010 1100 0100 0100, and 1101 1001 1101 0100.

### Claim 7

In a CDMA radio system a method for synchronizing a mobile station and a base station comprising:
said base station transmitting a synchronization code cp(n) over a synchronization channel wherein said synchronization code cp(n) is defined by the equation
cp(n)=(X2(n mod n2)+X1(n div n1)) mod 2
for n=0, 1, . . . , (n1*n2)−1
where: n1 is the length of X1
n2 is the length of X2
X1 and X2 are sequences,
and said base station transmitting a second synchronization code csm,k(n) over a second synchronization channel wherein the second synchronization code csm,k(n) is defined by the equation:
csm,k(n)=(Y2,m(n mod n2)+Y1,m,k(n div n1)) mod 2
for n=0, 1, . . . , (n1*n2)−1
where: n1 is the length of Y1
n2 is the length of Y2
Y1,m and Y2,m are selected from a set of M numbers
Y1,m,k are K cyclic shifts of Y1,m for k=0 to K−1.

### Claim 8 (depends on 7)

The method according to claim 7 wherein said mobile station receives said second synchronization codes, stores samples thereof, and correlates said samples against combinations of each value Y2 and each cyclic shift of each value of Y1 to determine a plurality of decision variables, and identifying a maximum decision variable, wherein the corresponding number of first predetermined length in the mobile station equals the value of Y2 in the base station, and the number of cyclic shifts of the corresponding number of second predetermined length in the mobile station is indicative of number of cyclic shifts of Y1 since commencement of transmission in the base station.

### Claim 9 (depends on 8)

The method according to claim 8 wherein the numbers in the set of M numbers are chosen to produce synchronization codes having low cross-correlation and auto-correlation properties.

### Claim 10 (depends on 8)

The method according to claim 8 wherein the numbers in the set of M numbers are binary numbers.

### Claim 11 (depends on 10)

The method according to claim 10 wherein Y1,m and Y2,m are identical.

### Claim 12 (depends on 11)

The method according to claim 11 wherein the set of M numbers includes
0001 1101 1001 0100, 0100 1010 0010 0010, 0100 1000 1100 0001, 0001 111 1011 10111, 0010 1110 1010 0111, 0111 0110 0001 1110, 0111 1011 1111 0010, 0010 0010 0100 1011, 0001 0010 1001 1011, 1110 0110 0101 0011, 0100 0111 1100 1110, 1011 0011 0000 0110, 0010 0001 1010 1000, 1101 0101 1001 1111, 0111 0100 1111 1101, 1000 0000 1100 1010, 0010 1110 0101 1000, 1000 1100 0111 1110, 0111 1011 0000 1101, 1101 1001 0010 1011, 1011 1110 0001 0101, 1000 0011 0111 0001, 1110 1011 0100 0000, 1101 0110 0010 0100, 0111 0110 1110 0001, 1011 0000 0100 0010, 0010 0011 1011 0100, 1110 0101 0001 0111, 0111 1001 0001 0001, 1000 1100 1000 0001, 0010 1100 0100 0100, and 1101 1001 1101 0100.

### Claim 13

In a communication system comprising one or more base stations and one or more mobile stations, wherein each base station transmits frames in a regular frame timing, each frame comprising two or more slots one of which starts simultaneously with starting of a frame; a method for a mobile station to identify a base station and to synchronize with frame timing of the identified base station, comprising:
selecting in each base station a unique first number from a first predetermined set of M numbers each of a first length N2;
selecting in each base station a second number associated with the first number from a second predetermined set of M numbers each of a second length N1 where N1 is greater than or equal to the number of slots in a frame;
transmitting from each base station a synchronization code of length N=N1×N2 digits determined in each slot by:
generating each digit position of the synchronization code by:
selecting a first digit from the first number according to a function of digit position in the synchronization code;
selecting a second digit from the second number according to a function of digit position in the synchronization code; and
adding the first and second digits in modulo arithmetic, and
cyclically shifting the second number after each slot, and
correlating in a mobile station samples of synchronization code received from a base station starting simultaneously with a start of a slot with combinations of:
M values of the first number, and
all cyclic shifts of each corresponding second number to produce M×N1 decision variables; and
identifying a maximum decision variable,
wherein a particular first number corresponding to the maximum decision variable identifies the first number selected at the base station, whereby the base station is identified; and
wherein a particular cyclic shift corresponding to the maximum decision variable identifies the slot whose start corresponds to starting of a frame.

### Claim 14

In a communication system comprising one or more base stations and one or more mobile stations, wherein each base station transmits frames in a regular frame timing, each frame comprising two or more slots one of which starts simultaneously with starting of a frame; a method of sending a synchronization code from a base station, comprising:
selecting in each base station a different first number from a first predetermined set of M numbers each of a first length N2;
selecting in each base station a second number associated with the first number from a second predetermined set of M numbers each of a second length N1 where N1 is greater than or equal to the number of slots in a frame;
transmitting from each base station a synchronization code of length N=N1×N2 digits determined in each slot by:
generating each digit position of the synchronization code by:
selecting a first digit from the first number according to a function of digit position in the synchronization code;
selecting a second digit from the second number according to a function of digit position in the synchronization code; and
adding the first and second digits in modulo arithmetic, and
cyclically shifting the second number after each slot.

### Claim 15

In a communication system comprising one or more base stations and one or more mobile stations, wherein each base station transmits frames in a regular frame timing, each frame comprising two or more slots one of which starts simultaneously with starting of a frame; a method for a mobile station to identify a base station and to synchronize with frame timing of the identified base station, comprising:
correlating in a mobile station samples of synchronization code received from a base station starting simultaneously with a start of a slot with combinations of:
each value of a first number selected sequentially from a first predetermined set of M numbers each of a first length N2, and
all cyclic shifts of a second number corresponding to the first number and of a length N1 equal to the number of slots in a frame,
to produce M×N1 decision variables; and
identifying a maximum decision variable,
wherein a particular first number corresponding to the maximum decision variable identifies a first number selected at the base station, whereby the base station is identified; and
wherein a particular cyclic shift corresponding to the maximum decision variable identifies the slot whose start corresponds to starting of a frame.

### Claim 16 (depends on 14)

The method according to claim 14 wherein the numbers in the predetermined sets of numbers are chosen to produce synchronization codes having low cross-correlation and auto-correlation properties.

### Claim 17 (depends on 14)

The method according to claim 14 wherein the numbers in the predetermined sets of numbers are binary numbers.

### Claim 18 (depends on 17)

The method according to claim 17 wherein the first and second sets of numbers are identical.

### Claim 19 (depends on 18)

The method according to claim 18 wherein the first and second sets of numbers include
0001 1101 1001 0100, 0100 1010 0010 0010, 0100 1000 1100 0001, 0001 111 1011 10111, 0010 1110 1010 0111, 0111 0110 0001 1110, 0111 1011 1111 0010, 0010 0010 0100 1011, 0001 0010 1001 1011, 1110 0110 0101 0011, 0100 0111 1100 1110, 1011 0011 0000 0110, 0010 0001 1010 1000, 1101 0101 1001 1111, 0111 0100 1111 1101, 1000 0000 1100 1010, 0010 1110 0101 1000, 1000 1100 0111 1110, 0111 1011 0000 1101, 1101 1001 0010 1011, 1011 1110 0001 0101, 1000 0011 0111 0001, 1110 1011 0100 0000, 1101 0110 0010 0100, 0111 0110 1110 0001, 1011 0000 0100 0010, 0010 0011 1011 0100, 1110 0101 0001 0111, 0111 1001 0001 0001, 1000 1100 1000 0001, 0010 1100 0100 0100, and 1101 1001 1101 0100.

### Claim 20 (depends on 15)

The method according to claim 15 wherein:
N1 is equal to N2 and both are equal to 16; and
the step of correlating in a mobile station samples of synchronization code received from a base station starting simultaneously with a start of a slot with combinations of each value of a first number selected sequentially from a first predetermined set of M numbers each of a first length N2, and all cyclic shifts of a second number corresponding to the first number and of a length N1 equal to the number of slots in a frame to produce M×N1 decision variables comprises:
storing in a buffer N1*M samples of signal from a base station beginning at a slot beginning;
for each of the M pairs of binary numbers:
correlating each of N1 equal portions of said buffer with an Mth of the first binary numbers to produce N1 common variables;
correlating each of the N1 common variables with a different successive cyclic shift of an Mth of the second binary numbers to produce N1 correlation variables;
summing the N1 correlation values into positions ((M−1)*N1)+1 through ((M−1)*N1)+N1 of the M*N1 decision variables.

### Claim 21

In a communication system comprising one or more base stations and one or more mobile stations, wherein each base station transmits frames in a regular frame timing, each frame comprising two or more slots one of which starts simultaneously with starting of a frame; a method for a mobile station to identify a base station and to synchronize with frame timing of the identified base station, comprising:
selecting in each base station a different first binary number Y2 from a first predetermined set of M numbers each of a first length N2;
selecting in each base station a second binary number Y, associated with the first number from a second predetermined set of M numbers each of a second length N1 where N1 is greater than or equal to the number of slots in a frame;
transmitting from each base station a synchronization code c of length N=N1×N2 digits determined in each slot by:
c(n)=(Y2(n mod N2)+Y1(n div N1)) mod 2
where n connotes positions 0 through N−1; and
cyclically shifting Y1 after each slot, and
correlating in a mobile station samples of synchronization code received from a base station starting simultaneously with a start of a slot with combinations of:
each value of Y2 selected from said first predetermined set, and
all cyclic shifts of each corresponding Y1,
to produce M×N1 decision variables; and
identifying a maximum decision variable,
wherein a particular Y2 position corresponding to the maximum decision variable identifies a value of Y2 selected at the base station, whereby the base station is identified; and
wherein a particular cyclic shift corresponding to the maximum decision variable identifies the slot whose start corresponds to starting of a frame.

### Claim 22

In a communication system comprising one or more base stations and one or more mobile stations, wherein each base station transmits frames in a regular frame timing, each frame comprising two or more slots one of which starts simultaneously with starting of a frame; a method of sending a synchronization code from a base station, comprising:
selecting in each base station a different first binary number Y2 from a first predetermined set of M numbers each of a first length N2;
selecting in each base station a second binary number Y1 associated with the first number from a second predetermined set of M numbers each of a second length N1 where N1 is greater than or equal to the number of slots in a frame;
transmitting from each base station a synchronization code c of length N=N1×N2 digits determined in each slot by:
c(n)=(Y2(n mod N2)+Y1(n div N1)) mod 2
where n connotes positions 0 through N−1; and
cyclically shifting Y1 after each slot.

### Claim 23

In a communication system comprising one or more base stations and one or more mobile stations, wherein each base station transmits frames in a regular frame timing, each frame comprising two or more slots one of which starts simultaneously with starting of a frame; a method for a mobile station to identify a base station and to synchronize with frame timing of the identified base station, comprising:
correlating in a mobile station samples of synchronization code received from a base station starting simultaneously with a start of a slot with combinations of:
each value of Y2 selected from a first predetermined set of binary numbers each of length N2, and
all cyclic shifts of each corresponding Y1 selected from a second predetermined set of binary numbers each of length N1,
to produce M×N1 decision variables; and
identifying a maximum decision variable,
wherein a particular Y2 position corresponding to the maximum decision variable identifies a value of Y2 selected at the base station, whereby the base station is identified; and
wherein a particular cyclic shift corresponding to the maximum decision variable identifies the slot whose start corresponds to starting of a frame.

### Claim 24 (depends on 22)

The method according to claim 22 wherein the predetermined sets of numbers are chosen to produce synchronization codes having low cross-correlation and auto-correlation properties.

### Claim 25 (depends on 24)

The method according to claim 24 wherein the first and second sets of numbers are identical.

### Claim 26 (depends on 25)

The method according to claim 25 wherein the first and second sets of numbers include
0001 1101 1001 0100, 0100 1010 0010 0010, 0100 1000 1100 0001, 0001 111 1011 10111, 0010 1110 1010 0111, 0111 0110 0001 1110, 0111 1011 1111 0010, 0010 0010 0100 1011, 0001 0010 1001 1011, 1110 0110 0101 0011, 0100 0111 1100 1110, 1011 0011 0000 0110, 0010 0001 1010 1000, 1101 0101 1001 1111, 0111 0100 1111 1101, 1000 0000 1100 1010, 0010 1110 0101 1000, 1000 1100 0111 1110, 0111 1011 0000 1101, 1101 1001 0010 1011, 1011 1110 0001 0101, 1000 0011 0111 0001, 1110 1011 0100 0000, 1101 0110 0010 0100, 0111 0110 1110 0001, 1011 0000 0100 0010, 0010 0011 1011 0100, 1110 0101 0001 0111, 0111 1001 0001 0001, 1000 1100 1000 0001, 0010 1100 0100 0100, and 1101 1001 1101 0100.

### Claim 27 (depends on 23)

The method according to claim 23 wherein:
N1 is equal to N2 and both are equal to 16; and
the step of correlating in a mobile station samples of synchronization code received from a base station starting simultaneously with a start of a slot with combinations of each value of Y2 selected from a first predetermined set of binary numbers each of length N2, and all cyclic shifts of each corresponding Y1 selected from a second predetermined set of binary numbers each of length N1 to produce M×N1 decision variables comprises:
storing in a buffer N1*M samples of signal from a base station beginning at a slot beginning;
for each of the M pairs of binary numbers:
correlating each of N1 equal portions of said buffer with an Mth of the first binary numbers to produce N1 common variables;
correlating each of the N1 common variables with a different successive cyclic shift of an Mth of the second binary numbers to produce N1 correlation variables;
summing the N1 correlation values into positions ((M−1)*N1)+1 through ((M−1)*N1)+N1 of the M*N1 decision variables.

### Claim 28

A propagated signal divided into frames, each frame comprising two or more slots one of which starts simultaneously with starting of a frame and comprising a synchronization code determined by:
selecting a first number from a first predetermined set of M numbers each of a first length N2;
selecting a second number associated with the first number from a second predetermined set of M numbers each of a second length N1 where N1 is greater than or equal to the number of slots in a frame;
determining a synchronization code of length N=N1×N2 digits in each slot by:
generating each digit position of the synchronization code by:
selecting a first digit from the first number according to a function of digit position in the synchronization code;
selecting a second digit from the second number according to a function of digit position in the synchronization code; and
adding the first and second digits in modulo arithmetic, and
cyclically shifting the second number after each slot.

### Claim 29 (depends on 28)

The propagated signal according to claim 28 wherein the numbers in the predetermined sets of numbers are chosen to produce synchronization codes having low cross-correlation and auto-correlation properties.

### Claim 30 (depends on 28)

The propagated signal according to claim 28 wherein the numbers in the predetermined sets of numbers are binary numbers.

### Claim 31 (depends on 30)

The propagated signal according to claim 30 wherein the first and second sets of numbers are identical.

### Claim 32 (depends on 31)

The propagated signal according to claim 31 wherein the first and second sets of numbers include
0001 1101 1001 0100, 0100 1010 0010 0010, 0100 1000 1100 0001, 0001 111 1011 10111, 0010 1110 1010 0111, 0111 0110 0001 1110, 0111 1011 1111 0010, 0010 0010 0100 1011, 0001 0010 1001 1011, 1110 0110 0101 0011, 0100 0111 1100 1110, 1011 0011 0000 0110, 0010 0001 1010 1000, 1101 0101 1001 1111, 0111 0100 1111 1101, 1000 0000 1100 1010, 0010 1110 0101 1000, 1000 1100 0111 1110, 0111 1011 0000 1101, 1101 1001 0010 1011, 1011 1110 0001 0101, 1000 0011 0111 0001, 1110 1011 0100 0000, 1101 0110 0010 0100, 0111 0110 1110 0001, 1011 0000 0100 0010, 0010 0011 1011 0100, 1110 0101 0001 0111, 0111 1001 0001 0001, 1000 1100 1000 0001, 0010 1100 0100 0100, and 1101 1001 1101 0100.

### Claim 33

A propagated signal divided into frames, each frame comprising two or more slots one of which starts simultaneously with starting of a frame and comprising a synchronization code determined by:
selecting a first binary number Y2 from a first predetermined set of M numbers each of a first length N2;
selecting a second binary number Y1 associated with the first number from a second predetermined set of M numbers each of a second length N1 where N1 is greater than or equal to the number of slots in a frame;
determining a synchronization code c of length N=N1×N2 digits in each slot by:
c(n)=(Y2(n mod N2)+Y1(n div N1)) mod 2
where n connotes positions 0 through N−1; and
cyclically shifting Y1 after each slot.

### Claim 34 (depends on 33)

The propagated signal according to claim 33 wherein the numbers in the predetermined sets of numbers are chosen to produce synchronization codes having low cross-correlation and auto-correlation properties.

### Claim 35 (depends on 33)

The propagated signal according to claim 33 wherein the first and second sets of numbers are identical.

### Claim 36 (depends on 34)

The propagated signal according to claim 34 wherein the first and second sets of numbers include
0001 1101 1001 0100, 0100 1010 0010 0010, 0100 1000 1100 0001, 0001 111 1011 10111, 0010 1110 1010 0111, 0111 0110 0001 1110, 0111 1011 1111 0010, 0010 0010 0100 1011, 0001 0010 1001 1011, 1110 0110 0101 0011, 0100 0111 1100 1110, 1011 0011 0000 0110, 0010 0001 1010 1000, 1101 0101 1001 1111, 0111 0100 1111 1101, 1000 0000 1100 1010, 0010 1110 0101 1000, 1000 1100 0111 1110, 0111 1011 0000 1101, 1101 1001 0010 1011, 1011 1110 0001 0101, 1000 0011 0111 0001, 1110 1011 0100 0000, 1101 0110 0010 0100, 0111 0110 1110 0001, 1011 0000 0100 0010, 0010 0011 1011 0100, 1110 0101 0001 0111, 0111 1001 0001 0001, 1000 1100 1000 0001, 0010 1100 0100 0100, and 1101 1001 1101 0100.
