# US 2004/0057414 A1 · Comma free codes for fast cell search using tertiary synchronization channel

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

- Number: US 2004/0057414 A1
- Document ID: US20040057414A1
- Status: Published application
- Kind: A1
- Application number: 10/658,902
- Filed: 2003-09-10
- Published: 2004-03-25
- Earliest claimed: 1998-10-16
- Assignees: Texas Instruments Incorporated
- Inventors: Sundararajan Sriram
- Web page: https://patentgrep.com/patent/US20040057414A1

## CPC

- H04B 1/70735: {Code identification (H04B1/7083 takes precedence)}
- H04B 1/7083: Cell search, e.g. using a three-step approach
- H04B: TRANSMISSION

## Abstract

A method of processing data comprises the receiving a frame of data having a predetermined number of time slots (502,504,506). Each time slot comprises a respective plurality of data symbols (520). The method further comprises a primary (508), a secondary (510) and a tertiary (512) synchronization code in each said predetermined number of time slots.

## Claims

### Claim 1

A method, comprising the steps of:
receiving a frame of data having a predetermined number of time slots;
receiving a plurality of data symbols in each respective time slot; and
receiving a primary, a secondary and a tertiary synchronization code in each said predetermined number of time slots.

### Claim 2 (depends on 1)

A method as in claim 1, wherein the secondary and the tertiary synchronization codes identify a subset of codes.

### Claim 3 (depends on 2)

A method as in claim 2, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of synchronization code elements, the predetermined order corresponding to the subset of codes.

### Claim 4 (depends on 1)

A method as in claim 1, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of common synchronization code elements.

### Claim 5 (depends on 1)

A method as in claim 1, wherein a mobile receiver identifies a first time slot of the frame by the tertiary synchronization code.

### Claim 6 (depends on 1)

A method as in claim 1, further comprising the steps of:
matching the tertiary synchronization code with a predetermined code;
producing a match signal in response to the step of matching;
comparing the match signal to a threshold signal;
identify a first time slot of the frame by the tertiary synchronization code in response to a first state of the match signal; and
identifying the first time slot of the frame by the secondary synchronization code in response to a second state of the match signal that is different from the first state.

### Claim 7

A method, comprising the steps of:
receiving a plurality of frames of data, each frame having a predetermined number of time slots;
receiving a primary synchronization code in each said predetermined number of time slots;
receiving a secondary synchronization code in each said predetermined number of time slots;
receiving a tertiary synchronization code in each said predetermined number of time slots, wherein at least two of the plurality of frames comprise different tertiary synchronization codes.

### Claim 8 (depends on 7)

A method as in claim 7, wherein the secondary and the tertiary synchronization codes identify a subset of codes.

### Claim 9 (depends on 8)

A method as in claim 8, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of synchronization code elements, the predetermined order corresponding to the subset of codes.

### Claim 10 (depends on 7)

A method as in claim 7, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of common synchronization code elements.

### Claim 11 (depends on 7)

A method as in claim 7, wherein a mobile receiver identifies a first time slot of the frame by the tertiary synchronization code.

### Claim 12 (depends on 7)

A method as in claim 7, further comprising the steps of:
matching the tertiary synchronization code with a predetermined code;
producing a match signal in response to the step of matching;
comparing the match signal to a threshold signal;
identifying a first time slot of the frame by the tertiary synchronization code in response to a first state of the match signal; and
identifying the first time slot of the frame by the secondary synchronization code in response to a second state of the match signal that is different from the first state.

### Claim 13

A method, comprising the steps of:
transmitting a frame of data having a predetermined number of time slots;
transmitting a plurality of data symbols in each respective time slot; and
transmitting a primary, a secondary and a tertiary synchronization code in each said predetermined number of time slots.

### Claim 14 (depends on 13)

A method as in claim 13, wherein the secondary and the tertiary synchronization codes identify a subset of codes.

### Claim 15 (depends on 14)

A method as in claim 14, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of synchronization code elements, the predetermined order corresponding to the subset of codes.

### Claim 16 (depends on 13)

A method as in claim 13, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of common synchronization code elements.

### Claim 17 (depends on 13)

A method as in claim 13, wherein the tertiary synchronization code order corresponds to an order of time slots in the frame.

### Claim 18 (depends on 13)

A method as in claim 13, further comprising the steps of:
transmitting the secondary and tertiary synchronization codes when a number of long code groups exceeds a predetermined number; and
transmitting the secondary synchronization code and not the tertiary synchronization code in response when the number of long code groups is less than or equal to the predetermined number.

### Claim 19

A method, comprising the steps of:
transmitting a plurality of frames of data, each frame having a predetermined number of time slots;
transmitting a primary synchronization code in each said predetermined number of time slots;
transmitting a secondary synchronization code in each said predetermined number of time slots;
transmitting a tertiary synchronization code in each said predetermined number of time slots, wherein at least two of the plurality of frames comprise different tertiary synchronization codes.

### Claim 20 (depends on 19)

A method as in claim 19, wherein the secondary and the tertiary synchronization codes identify a subset of codes.

### Claim 21 (depends on 20)

A method as in claim 20, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of synchronization code elements, the predetermined order corresponding to the subset of codes.

### Claim 22 (depends on 19)

A method as in claim 19, wherein the secondary and tertiary synchronization codes are formed from a predetermined order of common synchronization code elements.

### Claim 23 (depends on 19)

A method as in claim 19, wherein the tertiary synchronization code order corresponds to an order of time slots in the frame.

### Claim 24 (depends on 19)

A method as in claim 19, further comprising the steps of:
transmitting the secondary and tertiary synchronization codes when a number of long code groups exceeds a predetermined number; and
transmitting the secondary synchronization code and not the tertiary synchronization code in response when the number of long code groups is less than or equal to the predetermined number.
