US5960048A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and an arrangement for receiving a symbol sequence
Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1997-03-25
•
Granted: 1999-09-28
•
Expires: 2017-03-25
Abstract
Abstract The invention relates to synchronizing in communication systems by using a sequential correlation technique. A digital sequence known to the receiver, a so-called signature, is allocated a plurality of segments. The segments are correlated, segment for segment, in a correlator (300) which is equally as long as the segment. The segments may have the same or different bit patterns. When a first segment is received in the correlator (300) and the correlation value of this segment exceeds an associated threshold value, the segment is accepted as received and is saved in a memory (308) in response to a signal from the control unit (311). A timer (319) is set to a time point that corresponds to the length of the segments. There is then correlated a second segment whose correlation value on the signal from the timer (319) is added (304) to the value stored in the memory (308). If the sum exceeds an associated threshold value, the sum is stored in the memory (308). Detection continues in this way. When the sum of the correlation values of all segments have exceeded the threshold value of the last segment, there is generated a sync. time pulse signal (Ts). Should a threshold value not be exceeded, it is assumed that a wrong signature has been received, and detection of the first segment is recommenced.
Inventors
- 👤 Jacobus Cornelis Haartsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 15:27
CPC Classifications
H; H04; H04L; H04L7/00; H04L7/04; H04L7/041; H04L7/042
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
183 words
A method of detecting a symbol sequence in asynchronous reception, using a known digital sequence, comprising the steps of: a) dividing the known digital sequence into at least two separate segments; b) allocating a number of specific threshold values equal to the number of said segments; c) correlating said received symbol sequence and the first segment of the known digital sequence, therewith to obtain a first correlation value; d) storing said first correlation value at least when said value exceeds a first of said threshold value; e) setting a certain first time point in accordance with the length of the second segment; f) correlating said received symbol sequence and the second segment of the known digital sequence at said first time point, therewith to obtain a second correlation value; g) adding said second correlation value to the stored first correlation value so as to obtain a first summation value; and h) comparing said first summnation value with a second of said threshold values, wherewith an indication that said symbol sequence has been detected is obtained when said sum exceeds said second threshold value.
Claim 2
Independent Claim
183 words
A method of detecting a symbol sequence in asynchronous reception, using a known digital sequence, comprising the steps of: a) dividing the known digital sequence into at least two separate segments; b) allocating a number of specific threshold values equal to the number of said segments; c) correlating said received symbol sequence and the first segment of the known digital sequence, therewith to obtain a first correlation value; d) storing said first correlation value at least when said value exceeds a first of said threshold value; e) setting a certain first time point in accordance with the length of the second segment; f) correlating said received symbol sequence and the second segment of the known digital sequence at said first time point, therewith to obtain a second correlation value; g) adding said second correlation value to the stored first correlation value so as to obtain a first summation value; and h) comparing said first summnation value with a second of said threshold values, wherewith an indication that said symbol sequence has been detected is obtained when said sum exceeds said second threshold value.
Claim 3
Dependent Claim
147 words
A method according to claim 1, in which said known digital sequence is divided into more than two segments and further comprising the steps of: repeating step d) with storing of said first summation value at least when said value exceeds the threshold values of the second threshold value; repeating step e) by setting a second time point in accordance with the length of the third segment; repeating step f) for the third segment at said second time point, therewith to obtain a third correlation value; repeating step g) by adding said third correlation value to said first summation value, such as to obtain a second summation value; repeating step h) for said second summation value and a third threshold value; and repeating said steps d), e), f), g) and h) for a number of times corresponding to the number of divided segments in said digital sequence.
Claim 4
Dependent Claim
48 words
A method according to claim 1, further comprising: repeating step d) up to and including step h) until the last segment in the digital sequence has been correlated; and generating a sync. time pulse signal in conjunction with a last summation value having exceeded a last threshold value.
Claim 5
Dependent Claim
28 words
A method according to claim 1, further comprising: dividing the known digital sequence into segments of mutually different lengths; and allotting new correlation coefficients prior to each correlation.
Claim 6
Dependent Claim
19 words
A method according to claim 1, further comprising: dividing the known digital sequence into segments of mutually equal lengths.
Claim 7
Dependent Claim
24 words
A method according to claim 1, further comprising: allocating different bit patterns to said segments; and allocating new correlation coefficients prior to each correlation.
Claim 8
Dependent Claim
19 words
A method according to claim 5, further comprising the step of: allocating the same bit patterns to said segments.
Claim 9
Dependent Claim
43 words
A method according to claim 5, further comprising the step of: allocating a certain bit pattern to a portion of the segments; and allocating an inverted version of the same bit pattern to remaining segments, such as to obtain a specific segment sequence.
Claim 10
Dependent Claim
16 words
A method according to claim 8, wherein the segment sequence is a so-called maximum length code.
Claim 11
Dependent Claim
15 words
A method according to claim 8, wherein the segment sequence is a so-called Gold sequence.
Claim 12
Dependent Claim
15 words
A method according to claim 8, wherein the segment sequence is a so-called Barker sequence.
Claim 13
Dependent Claim
131 words
A method according to claim 7, wherein when at least the first correlation value has exceeded the first threshold value of said threshold values, characterized by the steps of effecting a new correlation in accordance with steps c) and f) in another part of the received symbol sequence that is received later than that part of the symbol sequence for which correlation has already commenced in accordance with steps c) and f), wherein repeated correlation values are obtained, these values being stored and added in accordance with steps d) and g) and compared in accordance with step h) with respective threshold values subsequent to having set said time point in accordance with step e), whereby attention is paid to any true symbol sequence received after an earlier detected false symbol sequence.
Claim 14
Dependent Claim
26 words
A method according to claim 12, further comprising the step of: zero-setting (1402) at least one timer subsequent to generation of the sync. time pulse signal.
Claim 15
Dependent Claim
19 words
A method according to claim 1, wherein the bit pattern of the segments is a so-called maximum length code.
Claim 16
Dependent Claim
18 words
A method according to claim 1, wherein the bit pattern of the segments is a so-called Gold sequence.
Claim 17
Dependent Claim
18 words
A method according to claim 1, wherein the bit pattern of the segments is a so-called Barker sequence.
Claim 18
Dependent Claim
160 words
An arrangement for detecting a symbol sequence in asynchronous reception, using a known digital sequence, comprising: at least one correlator which functions to correlate the received symbol sequence and the segments of the known digital sequence, therewith to obtain first and second correlation values; at least one memory for storing the first correlation value, at least when said correlation value exceeds a first threshold value; at least one adder which functions to add the second correlation value to said stored correlation value, such as to obtain a first summation value; at least one timer for setting a certain time point; and a control unit which functions to compare the first correlation value with the first of said threshold values for setting said timer, and for comparison of the first summation value with a second of said threshold values, wherewith an indication is obtained that said symbol sequence has been detected when the first summation value exceeds said second threshold value.
Claim 19
Dependent Claim
160 words
An arrangement for detecting a symbol sequence in asynchronous reception, using a known digital sequence, comprising: at least one correlator which functions to correlate the received symbol sequence and the segments of the known digital sequence, therewith to obtain first and second correlation values; at least one memory for storing the first correlation value, at least when said correlation value exceeds a first threshold value; at least one adder which functions to add the second correlation value to said stored correlation value, such as to obtain a first summation value; at least one timer for setting a certain time point; and a control unit which functions to compare the first correlation value with the first of said threshold values for setting said timer, and for comparison of the first summation value with a second of said threshold values, wherewith an indication is obtained that said symbol sequence has been detected when the first summation value exceeds said second threshold value.
Claim 20
Dependent Claim
162 words
An arrangement according to claim 17, wherein in that said correlator functions to correlate the received symbol sequence and the segments of the known digital sequence subsequent to said first and said second correlation values having been obtained, therewith to obtain third and fourth correlation values; in that said memory functions to store the summation values of said correlation values, at least when the summation values exceed said threshold value; in that said adder functions to add said correlation values to said stored summation values such as to obtain new summation values, said new summation values being stored in said memory; in that at least one timer is included for setting certain time points; and in that the arrangement includes a control unit for setting said timer and for comparison of said new summation values with said threshold values and indicating when said symbol sequence has been detected, which is obtained when the threshold values have been exceeded by respective summation values.
Claim 21
Dependent Claim
20 words
An arrangement according to claim 18, wherein the control unit functions to allocate new correlation coefficients prior to each correlation.
Claim 22
Dependent Claim
25 words
An arrangement according to claim 17, wherein a multiplier for multiplying the correlation values with a specified coefficient such as to obtain a segment correlator.
Claim 23
Dependent Claim
51 words
An arrangement according to claim 17, wherein an adder-memory-multiplier unit and a timer unit which function to support simultaneous correlation of possible symbol sequences; and in that the arrangement includes an address bus which is arranged so that an address given by the control unit controls the selection of active units.
Claim 24
Dependent Claim
31 words
An arrangement according to claim 21, wherein the function unit also functions to set to zero at least one timer in the timer unit when the symbol sequence has been detected.
References Cited (Backward Citations)
US4347606A
Cited
US4920546A
Cited
US4930140A
Cited
US5539751A
Cited
US5422916A
Cited
US5428647A
Cited
EP0676874A2
Cited
EP0680167A2
Cited
US5598429A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-09-27 | 2003-03-29 | 2003-09-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-09-27 | 2007-03-29 | 2007-09-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-09-27 | 2011-03-29 | 2011-09-28 | $7700.00 | Window Closed / Lapsed |