Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
150 words
A method of recovering the clock from Manchester-encoded signals on a pair of signal lines said Manchester-encoded signals being a serial Manchester-encoded stream having an inter-bit period T, comprising the steps of: a. generating a recovered-clock signal having a period of approximately T; b. detecting "zero-crossing" when the signed voltage differential on said pair of signal lines becomes zero; c. comparing the occurrence of the "zero-crossing" of the received signals with the occurrence of the "mid-point" T/2 of the period of the most-recently-generated recovered-clock signal; d. generating a recovered-clock signal having a period shorter than, equal to, or greater than the period of the most-recently-generated recovered-clock signal depending on whether the comparison step (c) indicated the occurrence of said "zero-crossing" to be before, coincident with, or after, respectively, said "mid-point" T/2 occurrence of said most-recently-generated recovered-clock signal; and e. repeating steps (b), (c) and (d) on the next-received serial signal.
Claim 2
Independent Claim
150 words
A method of recovering the clock from Manchester-encoded signals on a pair of signal lines said Manchester-encoded signals being a serial Manchester-encoded stream having an inter-bit period T, comprising the steps of: a. generating a recovered-clock signal having a period of approximately T; b. detecting "zero-crossing" when the signed voltage differential on said pair of signal lines becomes zero; c. comparing the occurrence of the "zero-crossing" of the received signals with the occurrence of the "mid-point" T/2 of the period of the most-recently-generated recovered-clock signal; d. generating a recovered-clock signal having a period shorter than, equal to, or greater than the period of the most-recently-generated recovered-clock signal depending on whether the comparison step (c) indicated the occurrence of said "zero-crossing" to be before, coincident with, or after, respectively, said "mid-point" T/2 occurrence of said most-recently-generated recovered-clock signal; and e. repeating steps (b), (c) and (d) on the next-received serial signal.
Claim 3
Dependent Claim
73 words
The clock-recovery method of claim 1 wherein said recovered-clock generation steps (a) and (d) further call for sequencing an n-state counter, each state transition occuring at a T/n interval, step (a) further calling for resetting said n-state counter, and step (d) further calling for a one-state-skipping transition, a next-state transition, or a same-state transition of said n-state clock-recovery counter depending on whether said "zero-crossing" occurred before, coincident with, or after, respectively, said "mid-point".
Claim 4
Dependent Claim
81 words
The clock-recovery method of claim 2 wherein n=16 and said comparison step (c) further calls for generating SHORTEN, CENTER, LENGTHEN signals according to the equations: SHORTEN=f(state) CENTER=g(state) LENGHTEN=h(state) wherein f, g and h are Boolean functions of said n-state counter, and said recovered-clock generation step (d) further calls for generating a recovered-clock signal having a period shorter-than, equal to, or greater-than said period of said most-recently-generated recovered-clock signal depending on whether LENGTHEN. CENTER, CENTER, or SHORTEN.CENTER is a HIGH signal, respectively.