← Back to Patent Explorer
EP0269974A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Method and apparatus for detecting a predetermined bit pattern within a serial bit stream

Assignee: International Business Machines Corp
•
Filing: 1987-11-24
•
Granted: —
•
Expires: 2007-11-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention relates to the fast detection of a predetermined pattern of n bits embedded in a serial bit stream (14). The n bits are adjacent or regularly distributed over the stream (as in a Time Division Multiplexed Signal), and form a unique word (16) which may in particular be used as a synchronization pattern, the detection of which allows to conclude that a synchronization status has been reached within the signal detected at a reception node. The method consists in detecting first a synchronization root, which is a subset (18) of nʹ consecutive bits of the unique word. A non-detection of the unique word can be evidenced very early and accordingly, a substantial amount of time can be saved in the detection, since in the average, it is not necessary to go through n comparison steps to conclude a non-detection of the unique word.

Inventors

  • 👤 Jacques Andre Besseyre

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-02 20:17
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/02; H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605; G06F2207/00; G06F2207/02; G06F2207/025

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 275 words
A method for detecting a predetermined pattern of n bits included within a serial bit stream, said n bits being adjacent or distributed over the bit stream according to a predetermined sequence, and representing a unique word (16) chosen to contain m different valid subsets (18) of nʹ successive bits (with 1 < m < n and 1 < nʹ < n), where each of such a subset is said to be valid provided it is determined in a unique manner by its position within the unique word and thus permits to determine the (n-nʹ) remaining bits of said unique word, which follow the cited nʹ bits, said method including, among its steps: - detecting subsets of nʹ bits of the serial bit stream (14); - comparing each detected subset of nʹ bits to all of the m valid subsets to identify the event of having detected a particular subset among the m valid subsets, and on said event; - verifying if the entire unique word has been received, by determining among the received bits, each of the potential bits of said unique word, and comparing consecutively each of those potential bits, to each of the ((n-nʹ) bits which follow the nʹ bits of the particular subset of the unique word which has already been detected; - counting the number of successive matches that occur during the comparison step between the couples of bits being compared, and when a predetermined number of matches is reached, deciding that the unique word has effectively been detected, and accordingly, raising an appropriate signal, which can in turn start an action or set an adequate status within a circuit.
Claim 2
Independent Claim 275 words
A method for detecting a predetermined pattern of n bits included within a serial bit stream, said n bits being adjacent or distributed over the bit stream according to a predetermined sequence, and representing a unique word (16) chosen to contain m different valid subsets (18) of nʹ successive bits (with 1 < m < n and 1 < nʹ < n), where each of such a subset is said to be valid provided it is determined in a unique manner by its position within the unique word and thus permits to determine the (n-nʹ) remaining bits of said unique word, which follow the cited nʹ bits, said method including, among its steps: - detecting subsets of nʹ bits of the serial bit stream (14); - comparing each detected subset of nʹ bits to all of the m valid subsets to identify the event of having detected a particular subset among the m valid subsets, and on said event; - verifying if the entire unique word has been received, by determining among the received bits, each of the potential bits of said unique word, and comparing consecutively each of those potential bits, to each of the ((n-nʹ) bits which follow the nʹ bits of the particular subset of the unique word which has already been detected; - counting the number of successive matches that occur during the comparison step between the couples of bits being compared, and when a predetermined number of matches is reached, deciding that the unique word has effectively been detected, and accordingly, raising an appropriate signal, which can in turn start an action or set an adequate status within a circuit.
Claim 3
Dependent Claim 34 words
A method according to claim 1, wherein the serial bit stream including the said pattern of n bits to be detected, is being transmitted from a transmis­sion node and received at a reception node.
Claim 4
Dependent Claim 307 words
A method according to claim 1 or 2, wherein the predetermined unique word is a synchronization pattern containing 12 bits regularly distributed over the serial bit stream of a TDM signal, said signal comprising frames of 193 bits containing each one bit of said synchronization pattern to be detected, the latter including m = 12 valid subsets of nʹ = 4 bits, said method including: - detecting at said reception node, subsets of four bits of the serial bit stream, said four bits being spaced apart by 192 data bits; - comparing each detected subset of four bits to all the 12 possible valid subsets of four consecutive bits of the synchronization pattern; - identifying the event of having detected such a said valid subset of four bits, and upon said event; - verifying if the whole synchronization pattern has been received, by determining among the received bits, each of the potential bits of said synchronization pattern, and comparing consecutivelyeach of those potential bits, to each of the eight bits which follow the four bits of the particular subset of the synchronization pattern which has already been detected; - initiating the counting of the number of consecutive matches between the couples of bits being compared, and incrementing said count by one at each new match; - identifying the event of the said count reaching a predetermined number A, and upon said event, setting a synchronization status signal "synchronization established" high in order to declare the synchronization pattern detected; - upon synchronization pattern detection, monitoring the synchronization status, and incrementing the said count by one at each new match or decrementing it at each new mismatch, and -declaring the synchronization status to be lost if the said count should become equal to zero, and - when the synchronization status is lost, resetting the whole synchronization pattern detection process.
Claim 5
Independent Claim 355 words
An apparatus for the implementation of the method defined in one of the claims 1-3, said apparatus being located at a reception node where it receives, at a rate defined by the received clock signal, the serial bit stream comprising the data bits and the bits contained in the unique word (16), said apparatus including: - first detection means (22) for the detection of nʹ bits of the bit stream, said first detecting means being connected to first decoding means (28) who generate a "VALID SUBSET" signal when the detected subset of nʹ bits is decoded as being a valid subset; - storage means (24) containing m different subsets of (n-nʹ) consecutive bits of the unique word, each of said subsets being equal to the unique word minus a said particular valid subset of nʹ bits, said storage means being addressed by the nʹ bits output by the first detecting means (22) and delivering at their output the specific subset of (n-nʹ) bits corresponding to the address applied to the entry of said storage means, upon receipt of said "VALID SUBSET" signal transmitted by said decoding means; - a second detecting means (38) for the detection, in the received serial bit stream, of the next potential bits of the unique word; - comparison means (36) performing the comparison between, on the one hand, the said potential bits of the unique word who are being provided by said second detecting means, and on the other hand, the successive bits included in the specific subset of (n-nʹ) bits provided by said storage means, said comparison means generating at their output, an "EQUALITY PULSE" equal to "one" each time a match occurs between two compared bits, and to "zero" each time a mismatch occurs; - first counting means (54) connected to the output of the comparison means and performing the counting of said matches; - second decoding means (56) connected to said counting means and performing the decoding of a predetermined number reached by the first counting means, whereupon said second decoding means raise their output line in order to indicate that the unique word has been detected.
Claim 6
Dependent Claim 102 words
An apparatus according to claim 4, including an addition feature comprising, in case the bits of the unique word are regularly distributed within a framed serial bit stream of a TDM signal wherein two consecutive bits of the unique word are spaced by x data bits, - an up-counter (C1) connected to an x-decoder generating an "x decoded" signal used to delimit the successive frames of the TDM signal; - an up-down counter (C3) incrementing by one at each new match and decremented by one at each mismatch, said counter being connected to a zero-decoder providing a "new synchonization search on" signal.
Claim 7
Dependent Claim 69 words
An apparatus according to claim 4 to 5, wherein said first detection means (122) for the detection of four bits of the serial bit stream spaced apart by 192 data bits, include four eight-bit discrete technology shift registers (164, 168, 172, 176) alternatively connected in series with four 185-bit shift registers (166, 170, 174) the first cell b21, b31, b41, b51 being connected to the first decoding means (128).
Claim 8
Independent Claim 37 words
An apparatus according to one of the claims 4-6, wherein said second detection means (138) include one discrete eight-bit shift register (160) and one 185-bit shift register (162) connected in series ahead of said first detection means.
Claim 9
Independent Claim 65 words
An apparatus according to one of the claims 4-7, wherein said first decoding means (128) include combinatorial logic receiving the content of said b21, b31, b41, b51 cells as parallel inputs, and delivering through an eight-bit "valid address" shift register, a read command transmitted to storage means (124) when four bits applied as an address to said first decoding means correspond to a valid subset.
Claim 10
Independent Claim 70 words
An apparatus according to claims 4-8, wherein said storage means include a Read Only Storage (ROS) (196) addressed by a valid subset and delivering for each address, a byte containing the eight remaining bits of the synchronization pattern, corresponding to the applied address, said byte being transferred, upon receipt of a "new synchronization search" signal, to aSynchronization Pattern Shift Register (SYNREG) (200) under control of a logic SYNREG CONTROL CIRCUIT.
Claim 11
Independent Claim 65 words
An apparatus according to claims 4-9, wherein said comparison means include an AND gate (137) performing an AND function between the last detected potential bit (b11) of the synchronization pattern, the bit of said synchronization pattern which immediately follows the current valid subset, and a "193 decoded" signal provided by said up-counter (C1), said AND gate providing an "EQUALITY PULSE" to said first counting means.
Claim 12
Dependent Claim 44 words
An apparatus according to claim 10, wherein said first counting means include a four-bit up-counter (C2) performing the count of said "EQUALITY PUL­SES", said counter being connected to said second decoding means, which generate a "synchronization established" signal when a predetermined count is reached.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag