← Back to Patent Explorer
US5010559A Expired / Lapsed US ⏱️ 0.0 years remaining

System for synchronizing data frames in a serial bit stream

Assignee: STMicroelectronics lnc USA
•
Filing: 1989-06-30
•
Granted: 1991-04-23
•
Expires: 2009-06-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A synchronizer in a receiver for a serial data stream includes a shift register for temporarily storing the most recently received data. Taps at a plurality of locations on such shift register provide bit signals at regularly spaced locations. These bit signals are checked for the occurrence of predetermined patterns which indicate the occurrence of frame bit candidates. A candidate shift register indicates which bit positions currently remain as candidates for the frame bit position, and is shifted synchronously with the incoming data. The candidate shift register is N bits in length, and a modulo-N counter is connected to the serial output thereof. Each time a bit position shifted out of the candidate register contains a valid candidate, the modulo-N counter is reset. When the counter counts for a full cycle, the true frame bit position has been identified.

Inventors

  • 👤 James T. O'Connor
  • 👤 David A. Courtright

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 09:44
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 167 words
A system for determining frame alignment within a serial data stream, each frame having a frame bit, comprising: a shift register having N bit locations, said register initially having all N bits set to a first logic state; first logic means for generating a candidate signal when selected bits from the data stream match a preselected pattern; second logic means for shifting the first logic state into said shift register if a current shift register output is in the first logic state and said first logic means is generating a candidate signal, and for shifting a second logic state into said shift register otherwise; and a modulo N counter, wherein said counter is incremented each time said second logic means shifts the second logic state into said shift register, and wherein said counter generates a signal identifying a frame bit position when it counts to (N-1), and wherein said counter is reset when the first logic state is shifted into said register by said second logic means.
Claim 2
Independent Claim 167 words
A system for determining frame alignment within a serial data stream, each frame having a frame bit, comprising: a shift register having N bit locations, said register initially having all N bits set to a first logic state; first logic means for generating a candidate signal when selected bits from the data stream match a preselected pattern; second logic means for shifting the first logic state into said shift register if a current shift register output is in the first logic state and said first logic means is generating a candidate signal, and for shifting a second logic state into said shift register otherwise; and a modulo N counter, wherein said counter is incremented each time said second logic means shifts the second logic state into said shift register, and wherein said counter generates a signal identifying a frame bit position when it counts to (N-1), and wherein said counter is reset when the first logic state is shifted into said register by said second logic means.
Claim 3
Dependent Claim 14 words
The system of claim 1, wherein each frame has a length of N bits.
Claim 4
Dependent Claim 18 words
The system of claim 2, wherein the selected bits from the data stream are spaced N bits apart.
Claim 5
Dependent Claim 22 words
The system of claim 1, wherein selected bits are K*N bits apart in the data stream, wherein K is a positive integer.
Claim 6
Dependent Claim 13 words
The system of claim 4, wherein K is 4 and N is 193.
Claim 7
Dependent Claim 36 words
The system of claim 4, wherein K sets of selected bits are compared with the preselected pattern in parallel, and wherein the candidate signal is generated if any of the K sets match the preselected pattern.
Claim 8
Independent Claim 132 words
A method for synchronizing a received serial data stream having frame bits spaced N bits apart, comprising the steps of: setting all bits of an N bit shift register to a first logic state; for each received data bit, generating a candidate signal if a plurality of spaced received bits matches a preselected pattern; for each received data bit, shifting the shift register and incrementing a modulo N counter; if a bit shifted out of the shift register is in the first logic state and a candidate signal is generated, then shifting a bit having the first logic state into the shift register and resetting the counter, otherwise shifting a bit having a second logic state into the shift register; and generating a frame synchronization signal when the counter counts to (N-1).
Claim 9
Independent Claim 132 words
A method for synchronizing a received serial data stream having frame bits spaced N bits apart, comprising the steps of: setting all bits of an N bit shift register to a first logic state; for each received data bit, generating a candidate signal if a plurality of spaced received bits matches a preselected pattern; for each received data bit, shifting the shift register and incrementing a modulo N counter; if a bit shifted out of the shift register is in the first logic state and a candidate signal is generated, then shifting a bit having the first logic state into the shift register and resetting the counter, otherwise shifting a bit having a second logic state into the shift register; and generating a frame synchronization signal when the counter counts to (N-1).
Claim 10
Dependent Claim 7 words
The method of claim 7, wherein P=N.
Claim 11
Dependent Claim 28 words
The method of claim 7, wherein the plurality of spaced received bits matched with the preselected pattern are spaced K*N bits apart, wherein K is a positive integer.
Claim 12
Dependent Claim 13 words
The method of claim 9, wherein K is 4 and N is 193.
Claim 13
Independent Claim 215 words
A system for determining frame alignment in a received serial bit stream, comprising: a first shift register for receiving the serial bit stream, said first register having a plurality of data outputs spaced N bits apart; combinational logic circuitry connected to the data outputs for generating a candidate signal when a set of data outputs spaced K*N bits apart matches a preselected pattern; a second shift register having N bits, said second shift register initially having all N bits set to a first logic state, wherein said second shift register is shifted once as each bit in the bit stream is received; selector logic circuitry for shifting the first logic state into the second shift register if a current second shift register output is in the first logic state and said combinational logic circuitry is generating a candidate signal, and for shifting a second logic state into said second shift register otherwise; and a modulo N counter, wherein said counter is incremented each time said selector logic circuitry shifts the second logic state into said second shift register, and wherein said counter generates a frame alignment signal when it counts to (N-1), and wherein said counter is reset when the first logic state is shifted into said second shift register by said selector logic circuitry.
Claim 14
Independent Claim 215 words
A system for determining frame alignment in a received serial bit stream, comprising: a first shift register for receiving the serial bit stream, said first register having a plurality of data outputs spaced N bits apart; combinational logic circuitry connected to the data outputs for generating a candidate signal when a set of data outputs spaced K*N bits apart matches a preselected pattern; a second shift register having N bits, said second shift register initially having all N bits set to a first logic state, wherein said second shift register is shifted once as each bit in the bit stream is received; selector logic circuitry for shifting the first logic state into the second shift register if a current second shift register output is in the first logic state and said combinational logic circuitry is generating a candidate signal, and for shifting a second logic state into said second shift register otherwise; and a modulo N counter, wherein said counter is incremented each time said selector logic circuitry shifts the second logic state into said second shift register, and wherein said counter generates a frame alignment signal when it counts to (N-1), and wherein said counter is reset when the first logic state is shifted into said second shift register by said selector logic circuitry.
Claim 15
Dependent Claim 7 words
The system of claim 11, wherein N=193.
Claim 16
Dependent Claim 7 words
The system of claim 12, wherein K=4.
Claim 17
Dependent Claim 37 words
The system of claim 11, wherein K sets of selected bits are compared with the preselected pattern in parallel, and wherein the candidate signal is generated if any one of the K sets match the preselected pattern.

References Cited (Backward Citations)

US3482044A Cited
US4347606A Cited
US4730346A Cited
US4768192A Cited
US4744081A Cited
US4930125A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-04-22 1994-10-22 1995-04-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-04-22 1998-10-22 1999-04-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-04-22 2002-10-22 2003-04-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag