US7103085B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Wireless communications system with secondary synchronization code based on values in primary synchronization code
Assignee: Intel Corp
•
Filing: 2000-06-16
•
Granted: 2006-09-05
•
Expires: 2020-06-16
Abstract
Abstract A wireless communication system. The system comprises transmitter circuitry (BST 1 ), the transmitter circuitry comprising encoder circuitry ( 50 ) for transmitting a plurality of frames (FR). Each of the plurality of frames comprises a primary synchronization code (PCS) and a secondary synchronization code (SSC). The encoder circuitry comprises of circuitry ( 50 1 ) for providing the primary synchronization code in response to a first sequence ( 32 ). The encoder circuitry further comprises circuitry ( 50 2 ) for providing the secondary synchronization code in response to a second sequence ( 54 ) and a third sequence ( 56 ). The second sequence is selected from a plurality of sequences. Each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences. The third sequence comprises a subset of bits from the first sequence.
Inventors
- 👤 Anand G. Dabak
- 👤 Sundararajan Sriram
- 👤 Srinath Hosur
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 15:09
CPC Classifications
H; H04; H04B; H04B1/00; H04B1/69; H04B1/707; H04B1/7073; H04B1/7083; H04B1/70735; H04J; H04J13/00; H04J13/10; H04J13/12
Claims Analysis
Total Claims: 78
Claim 1
Independent Claim
135 words
A wireless communication system, comprising: a transmitter circuit comprising an encoder circuit for transmitting a plurality of frames; wherein each of the plurality of frames comprises a primary synchronization code and a secondary synchronization code; and wherein the encoder circuit comprises: a circuit for providing the primary synchronization code in response to a first sequence; and a circuit for providing the secondary synchronization code in response to a second sequence and a third sequence; wherein the second sequence is selected from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences; and wherein the third sequence comprises a sequence of bits from the first sequence, wherein the sequence of bits from the first sequence is consecutively repeated in the third sequence.
Claim 2
Dependent Claim
135 words
A wireless communication system, comprising: a transmitter circuit comprising an encoder circuit for transmitting a plurality of frames; wherein each of the plurality of frames comprises a primary synchronization code and a secondary synchronization code; and wherein the encoder circuit comprises: a circuit for providing the primary synchronization code in response to a first sequence; and a circuit for providing the secondary synchronization code in response to a second sequence and a third sequence; wherein the second sequence is selected from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences; and wherein the third sequence comprises a sequence of bits from the first sequence, wherein the sequence of bits from the first sequence is consecutively repeated in the third sequence.
Claim 3
Dependent Claim
13 words
The system of claim 1 wherein the first sequence comprises a hierarchical sequence.
Claim 4
Dependent Claim
13 words
The system of claim 1 wherein the first sequence comprises a Golay sequence.
Claim 5
Dependent Claim
33 words
The system of claim 1 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 6
Dependent Claim
16 words
The system of claim 4 wherein the second sequence consists of fifteen of the code words.
Claim 7
Dependent Claim
20 words
The system of claim 5 wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences.
Claim 8
Dependent Claim
35 words
The system of claim 6 : wherein the 256 Walsh sequences have a defined order; and wherein the plurality of Hadamard sequences comprise sixteen Hadamard sequences selected as every sixteenth sequence in the defined order.
Claim 9
Dependent Claim
35 words
The system of claim 6 : wherein the 256 Walsh sequences have a defined order; and wherein the plurality of Hadamard sequences comprise seventeen Hadamard sequences selected as every eighth sequence in the defined order.
Claim 10
Dependent Claim
16 words
The system of claim 4 wherein the second sequence consists of sixteen of the code words.
Claim 11
Dependent Claim
19 words
The system of claim 9 the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences.
Claim 12
Dependent Claim
47 words
The system of claim 1 wherein the circuit for providing the secondary synchronization code comprises: a circuit for performing an exclusive OR operation between the second sequence and the third sequence; and a circuit for providing the secondary synchronization code in response to the exclusive OR operation.
Claim 13
Dependent Claim
98 words
The system of claim 1 : wherein the primary synchronization code comprises 8-bit values A and B and complements of the values A and B; wherein the value A comprises a sequence A={1, 1, 1, 1, 1, 1, 1, −1, −1}; wherein the value B comprises a sequence B={1, −1, 1, −1, 1, −1, −1, 1}; and wherein the primary synchronization code comprises a 256-bit sequence {A, B, A, B, A, B, −A, −B, −A, −B, A, B, −A, −B, −A, −B, A, B, A, B, A, B, −, −B, A, B, −A, −B, A, B, A, B}.
Claim 14
Dependent Claim
26 words
The system of claim 12 : wherein the second sequence comprises 256 bits; and wherein the third sequence comprises 32 repeated instances of the value A.
Claim 15
Dependent Claim
47 words
The system of claim 13 wherein the circuit for providing the secondary synchronization code comprises: a circuit for performing an exclusive OR operation between the second sequence and the third sequence; and a circuit for providing the secondary synchronization code in response to the exclusive OR operation.
Claim 16
Dependent Claim
33 words
The system of claim 14 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 17
Dependent Claim
65 words
The system of claim 12 : wherein the second sequence comprises 256 bits; wherein a complement of the value A is represented as −A; and wherein the third sequence comprises a 256-bit sequence {−A, −A, −A, −A, A, −A, −A, A, −A, A, A, −A, −A, A, A, A, A, A, −A, −A, −A, A, A, −A, A, A, A, −A, A, −A, A, −A}.
Claim 18
Dependent Claim
47 words
The system of claim 16 wherein the circuit for providing the secondary synchronization code comprises: a circuit for performing an exclusive OR operation between the second sequence and the third sequence; and a circuit for providing the secondary synchronization code in response to the exclusive OR operation.
Claim 19
Dependent Claim
33 words
The system of claim 17 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 20
Dependent Claim
50 words
The system of claim 18 : wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences; wherein the 256 Walsh sequences have a defined order; and wherein the plurality of Hadamard sequences comprise seventeen Hadamard sequences selected as every eighth sequence in the defined order.
Claim 21
Dependent Claim
90 words
The system of claim 1 : wherein the primary synchronization code consists of 8-bit values A and B and complements of the values A and B; wherein the value A comprises a sequence A={1, 1, 1, 1, 1, −1, −1}; wherein the value B comprises a sequence B={1, −1, 1, −1, 1, −1, −1, 1}; wherein a value C is defined as a sequence C={A, −B}; wherein the third sequence comprises a 256-bit sequence {C, C, C, −C, C, C, −C, −C, C, −C, C, −C, −C, −C, −C, −C}.
Claim 22
Dependent Claim
47 words
The system of claim 20 wherein the circuit for providing the secondary synchronization code comprises: a circuit for performing an exclusive OR operation between the second sequence and the third sequence; and a circuit for providing the secondary synchronization code in response to the exclusive OR operation.
Claim 23
Dependent Claim
33 words
The system of claim 21 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 24
Dependent Claim
50 words
The system of claim 22 : wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences; wherein the 256 Walsh sequences have a defined order; and wherein the plurality of Hadamard sequences comprise sixteen Hadamard sequences selected as every sixteenth sequence in the defined order.
Claim 25
Dependent Claim
13 words
The system of claim 1 wherein the transmitter circuit comprises a CDMA transmitter.
Claim 26
Dependent Claim
24 words
The system of claim 1 wherein the circuit for providing the secondary synchronization code comprises a storage circuit for storing the secondary synchronization code.
Claim 27
Dependent Claim
30 words
The system of claim 25 wherein the secondary synchronization code stored by the storage circuit is derived from an exclusive OR operation between the second sequence and the third sequence.
Claim 28
Independent Claim
118 words
A method of forming a primary synchronization code and a secondary synchronization code for communication in a plurality of frames in a wireless communication system, comprising the steps of: providing the primary synchronization code in response to a first sequence; and providing the secondary synchronization code in response to a second sequence and a third sequence; and wherein the second sequence is selected from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences; and wherein the third sequence comprises a sequence of bits from the first sequence, wherein the sequence of bits from the first sequence is consecutively repeated in the third sequence.
Claim 29
Independent Claim
118 words
A method of forming a primary synchronization code and a secondary synchronization code for communication in a plurality of frames in a wireless communication system, comprising the steps of: providing the primary synchronization code in response to a first sequence; and providing the secondary synchronization code in response to a second sequence and a third sequence; and wherein the second sequence is selected from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences; and wherein the third sequence comprises a sequence of bits from the first sequence, wherein the sequence of bits from the first sequence is consecutively repeated in the third sequence.
Claim 30
Dependent Claim
13 words
The method of claim 27 wherein the first sequence comprises a hierarchical sequence.
Claim 31
Dependent Claim
13 words
The method of claim 27 wherein the first sequence comprises a Golay sequence.
Claim 32
Dependent Claim
33 words
The method of claim 27 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 33
Dependent Claim
16 words
The method of claim 30 wherein the second sequence consists of fifteen of the code words.
Claim 34
Dependent Claim
20 words
The method of claim 31 wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences.
Claim 35
Dependent Claim
35 words
The method of claim 32 : wherein the 256 Walsh sequences have a defined order; and wherein the plurality of Hadamard sequences comprise sixteen Hadamard sequences selected as every sixteenth sequence in the defined order.
Claim 36
Dependent Claim
16 words
The method of claim 30 wherein the second sequence consists of sixteen of the code words.
Claim 37
Dependent Claim
35 words
The method of claim 34 : wherein the 256 Walsh sequences have a defined order, and wherein the plurality of Hadamard sequences comprise seventeen Hadamard sequences selected as every eighth sequence in the defined order.
Claim 38
Dependent Claim
41 words
The method of claim 27 wherein the step of providing the secondary synchronization code comprises: performing an exclusive OR operation between the second sequence and the third sequence; and providing the secondary synchronization code in response to the exclusive OR operation.
Claim 39
Dependent Claim
98 words
The method of claim 27 : wherein the primary synchronization code comprises 8-bit values A and B and complements of the values A and B; wherein the value A comprises a sequence A={1, 1, 1, 1, 1, 1, −1, −1}; wherein the value B comprises a sequence B={1, −1, 1, −1, 1, −1, −1, 1}; and wherein the primary synchronization code comprises a 256 bit sequence {A, B, A, B, A, B, −A, −B, −A, −B, A, B, −A, −B, −A, −B, A, B, A, B, A, B, −A, −B, A, B, −A, −B, A, B, A, B}.
Claim 40
Dependent Claim
26 words
The method of claim 37 : wherein the second sequence comprises 256 bits; and wherein the third sequence comprises 32 repeated instances of the value A.
Claim 41
Dependent Claim
41 words
The method of claim 38 wherein the step of providing the secondary synchronization code comprises: performing an exclusive OR operation between the second sequence and the third sequence; and providing the secondary synchronization code in response to the exclusive OR operation.
Claim 42
Dependent Claim
33 words
The method of claim 39 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 43
Dependent Claim
65 words
The method of claim 37 : wherein the second sequence comprises 256 bits; wherein a complement of the value A is represented as −A; and wherein the third sequence comprises a 256-bit sequence {−A, −A, −A, −A, A, −A, −A, A, −A, A, A, −A, −A, A, A, A, A, A, −A, −A, −A, A, A, −A, A, A, A, −A, A, −A, A, −A}.
Claim 44
Dependent Claim
41 words
The method of claim 41 wherein the step of providing the secondary synchronization code comprises: performing an exclusive OR operation between the second sequence and the third sequence; and providing the secondary synchronization code in response to the exclusive OR operation.
Claim 45
Dependent Claim
33 words
The method of claim 42 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 46
Dependent Claim
50 words
The method of claim 43 : wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences; wherein the 256 Walsh sequences have a defined order; and wherein the plurality of Hadamard sequences comprise seventeen Hadamard sequences selected as every eighth sequence in the defined order.
Claim 47
Dependent Claim
91 words
The method of claim 27 : wherein the primary synchronization code consists of 8-bit values A and B and complements of the values A and B; wherein the value A comprises a sequence A{1, 1, 1, 1, 1, 1, −1, −1}; wherein the value B comprises a sequence B={1, −1, 1, −1, 1, −1, −1, 1); wherein a value C is defined as a sequence C={A, −B}; wherein the third sequence comprises a 256-bit sequence {C, C, C, −C, C, C, −C, −C, C, −C, C, −C, −C, −C, −C, −C}.
Claim 48
Dependent Claim
41 words
The method of claim 45 wherein the step of providing the secondary synchronization code comprises: performing an exclusive OR operation between the second sequence and the third sequence; and providing the secondary synchronization code in response to the exclusive OR operation.
Claim 49
Dependent Claim
33 words
The method of claim 46 : wherein the second sequence comprises a plurality of code words; and wherein each of the plurality of code words is selected form a plurality of Hadamard sequences.
Claim 50
Dependent Claim
50 words
The method of claim 47 : wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences; wherein the 256 Walsh sequences have a defined order, and wherein the plurality of Hadamard sequences comprise sixteen Hadamard sequences selected as every sixteenth sequence in the defined order.
Claim 51
Dependent Claim
24 words
The method of claim 27 wherein the step of providing the secondary synchronization code comprises providing the secondary synchronization code from a storage circuit.
Claim 52
Independent Claim
102 words
A method of encoding a synchronization code, comprising the steps of: producing a primary synchronization code comprising a first code sequence; producing a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence comprises a sequence of bits of the first code sequence wherein the sequence of bits of the first code sequence is consecutively repeated in the third code sequence.
Claim 53
Independent Claim
102 words
A method of encoding a synchronization code, comprising the steps of: producing a primary synchronization code comprising a first code sequence; producing a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence comprises a sequence of bits of the first code sequence wherein the sequence of bits of the first code sequence is consecutively repeated in the third code sequence.
Claim 54
Dependent Claim
33 words
The method of claim 50 wherein the second code sequence comprises 256 bits, and wherein the third code sequence comprises 32 repeated instances of a subset of bits from the first code sequence.
Claim 55
Dependent Claim
30 words
The method of claim 51 wherein the step of producing the secondary synchronization code comprises performing an exclusive OR operation of the second code sequence with the third code sequence.
Claim 56
Dependent Claim
35 words
The method of claim 52 wherein the second code sequence comprises a plurality of code words, and wherein each code word of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 57
Dependent Claim
45 words
The method of claim 50 wherein each of the second and third code sequences comprise 256 bits, and wherein a subset of bits from the first code sequence comprises a fourth code sequence of bits and a complement of the fourth code sequence of bits.
Claim 58
Dependent Claim
30 words
The method of claim 54 wherein the step of producing the secondary synchronization code comprises performing an exclusive OR operation of the second code sequence with the third code sequence.
Claim 59
Dependent Claim
35 words
The method of claim 55 wherein the second code sequence comprises a plurality of code words, and wherein each code word of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 60
Dependent Claim
49 words
The method of claim 56 wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences, wherein the 256 Walsh sequences have a defined order, and wherein the plurality of Hadamard sequences comprise seventeen Hadamard sequences selected as every eighth sequence in the defined order.
Claim 61
Independent Claim
102 words
A method of decoding a synchronization code, comprising the steps of: identifying a primary synchronization code comprising a first code sequence; identifying a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence comprises a sequence of bits of the first code sequence, wherein the sequence of bits of the first code sequence is consecutively repeated in the third code sequence.
Claim 62
Independent Claim
102 words
A method of decoding a synchronization code, comprising the steps of: identifying a primary synchronization code comprising a first code sequence; identifying a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence comprises a sequence of bits of the first code sequence, wherein the sequence of bits of the first code sequence is consecutively repeated in the third code sequence.
Claim 63
Dependent Claim
33 words
The method of claim 58 wherein the second code sequence comprises 256 bits, and wherein the third code sequence comprises 32 repeated instances of a subset of bits from the first code sequence.
Claim 64
Dependent Claim
35 words
The method of claim 59 wherein the second code sequence comprises a plurality of code words, and wherein each code word of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 65
Dependent Claim
45 words
The method of claim 58 wherein each of the second and third code sequences comprise 256 bits, and wherein a subset of bits from the first code sequence comprises a fourth code sequence of bits and a complement of the fourth code sequence of bits.
Claim 66
Dependent Claim
35 words
The method of claim 61 wherein the second code sequence comprises a plurality of code words, and wherein each code word of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 67
Dependent Claim
49 words
The method of claim 62 wherein the plurality of Hadamard sequences are selected form a set of 256 Walsh sequences, wherein the 256 Walsh sequences have a defined order, and wherein the plurality of Hadamard sequences comprise seventeen Hadamard sequences selected as every eighth sequence in the defined order.
Claim 68
Independent Claim
108 words
A method of encoding a synchronization code, comprising the steps of: producing a primary synchronization code comprising a first code sequence; producing a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence includes a plurality of subsets of bits, each subset including a fourth sequence of bits from the first code sequence and a complement of a fifth sequence of bits from the first code sequence.
Claim 69
Independent Claim
108 words
A method of encoding a synchronization code, comprising the steps of: producing a primary synchronization code comprising a first code sequence; producing a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence includes a plurality of subsets of bits, each subset including a fourth sequence of bits from the first code sequence and a complement of a fifth sequence of bits from the first code sequence.
Claim 70
Dependent Claim
30 words
The method of claim 64 wherein the step of producing the secondary synchronization code comprises performing an exclusive OR operation of the second code sequence with the third code sequence.
Claim 71
Dependent Claim
33 words
The method of claim 65 wherein the second code sequence comprises a plurality of code words, and wherein each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 72
Dependent Claim
49 words
The method of claim 66 wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences, wherein the 256 Walsh sequences have a defined order, and wherein the plurality of Hadamard sequences comprise sixteen Hadamard sequences selected as every sixteenth sequence in the defined order.
Claim 73
Dependent Claim
91 words
The method of claim 67 : wherein the primary synchronization code consists of 8-bit values A and B and complements of the values A and B; wherein the value A comprises a sequence A={1, 1, 1, 1, 1, 1, −1, −1}; wherein the value B comprises a sequence B={1, −1, 1, −1, 1, −1, 1} wherein a value C is defined as a sequence C {A, −B}; wherein the third sequence comprises a 256-bit sequence {C, C, C, −C, C, C, −C, −C, C, −C, C, −C, −C, −C, −C, −C}.
Claim 74
Independent Claim
108 words
A method of decoding a synchronization code, comprising the steps of: identifying a primary synchronization code comprising a first code sequence; identifying a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence includes a plurality of subsets of bits, each subset including a fourth sequence of bits from the first code sequence and a complement of a fifth sequence of bits from the first code sequence.
Claim 75
Independent Claim
108 words
A method of decoding a synchronization code, comprising the steps of: identifying a primary synchronization code comprising a first code sequence; identifying a secondary synchronization code comprising a second code sequence combined with a third code sequence, wherein the second code sequence is from a plurality of sequences, wherein each of the plurality of sequences is orthogonal with respect to all other sequences in the plurality of sequences, and wherein the third code sequence includes a plurality of subsets of bits, each subset including a fourth sequence of bits from the first code sequence and a complement of a fifth sequence of bits from the first code sequence.
Claim 76
Dependent Claim
33 words
The method of claim 69 wherein the second code sequence comprises a plurality of code words, and wherein, each of the plurality of code words is selected from a plurality of Hadamard sequences.
Claim 77
Dependent Claim
49 words
The method of claim 70 wherein the plurality of Hadamard sequences are selected from a set of 256 Walsh sequences, wherein the 256 Walsh sequences have a defined order, and wherein the plurality of Hadamard sequences comprise sixteen Hadamard sequences selected as every sixteenth sequence in the defined order.
Claim 78
Dependent Claim
91 words
The method of claim 71 : wherein the primary synchronization code consists of 8-bit values A and B and complements of the values A and B; wherein the value A comprises a sequence A=1, 1, 1, 1, 1, −1, −1}; wherein the value B comprises a sequence B {1, −1, 1, −1, 1, −1, −1, 1}; wherein a value C is defined as a sequence C={A, −B}; wherein the third sequence comprises a 256-bit sequence {C, C, C, −C, C, C, −C, −C, C, −C, C, −C, −C, C, −C, −C}.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2009-09-04 | 2010-03-06 | 2010-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2013-09-04 | 2014-03-06 | 2014-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2017-09-04 | 2018-03-06 | 2018-09-05 | $7700.00 | Window Closed / Lapsed |