US4745626A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decoder
Assignee: Fujitsu Services Ltd
•
Filing: 1987-03-04
•
Granted: 1988-05-17
•
Expires: 2007-03-04
Abstract
Abstract A decoder is described for a self-clocking code, e.g. a bi-frequency Manchester code. Transitions are detected in the encoded data and are clocked into a shift register by a clock having a frequency equal to a multiple of the data bit rate. A logic network is connected to the shift register so as to detect combinations of transitions representing encoded data bits "0" and "1". The logic network includes OR gate funnels which detect the transitions in a range of possible positions in the shift register, so as to allow for jitter in the input data signal. The circuit allows encoded data to be correctly decoded in the presence of jitter without the necessity for using a phase-locked loop.
Inventors
- 👤 Brian D. Wells
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 23:01
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/06; H03M5/12
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
127 words
A decoder for decoding an encoded data in a self-clocking code, comprising: (a) a shift register, (b) means for clocking the shift register at a frequency equal to a multiple of the bit rate of the encoded data, (c) means for injecting a bit into the shift register to represent each transition in the encoded data, and (d) a logic network for detecting in the shift register a plurality of bits representing the transitions in a bit cell of the encoded data, the logic network including at least one OR-logic circuit for detecting one of these bits in any one of a plurality of adjacent stages of the shift register, so as to allow for variations in the timing or the transitions as a result of jitter.
Claim 2
Dependent Claim
127 words
A decoder for decoding an encoded data in a self-clocking code, comprising: (a) a shift register, (b) means for clocking the shift register at a frequency equal to a multiple of the bit rate of the encoded data, (c) means for injecting a bit into the shift register to represent each transition in the encoded data, and (d) a logic network for detecting in the shift register a plurality of bits representing the transitions in a bit cell of the encoded data, the logic network including at least one OR-logic circuit for detecting one of these bits in any one of a plurality of adjacent stages of the shift register, so as to allow for variations in the timing or the transitions as a result of jitter.
Claim 3
Dependent Claim
46 words
A decoder according to claim 1, for decoding a Manchester bi-frequency encoded signal comprising a succession of bit cells with a transition at the boundary between each adjacent pair of cells and a further transition at the mid-point of each cell of one particular binary value.
Claim 4
Dependent Claim
90 words
A decoder according to claim 1 wherein the logic network comprises: (a) means for producing a strobe signal whenever a bit representing a transaction occurs in a predetermined stage of the shift register, (b) a first OR-logic funnel for detecting the presence of a bit representing a transition in any of a first plurality of adjacent stages of the shift register, and (c) a second OR-logic funnel for detecting the presence or a bit representing a transition in any of a second plurality of adjacent stages of the shift register.
Claim 5
Dependent Claim
79 words
A decoder according to claim 3 wherein said first plurality of stages is centred on a stage of the shift register n/2 stages from said predetermined stage in the direction of shifting, and said second range of stages is centred on a stage of the shift register n stages from said predetermined stage in the direction of shifting, where n is the ratio between the frequency of clocking the shift register and the bit rate of the encoded data.
Claim 6
Dependent Claim
19 words
A decoder according to claim 4 wherein each of said first and second pluralities of stages includes n/2+1 stages.
Claim 7
Dependent Claim
84 words
A decoder according to claim 3 wherein the logic network further includes means for combining the strobe signal with the outputs of the first and second logic funnels, to produce a signal indicating the presence of a bit cell of one particular binary value, and means for combining the strobe signal with the output of the second logic funnel and the inverse output of the first logic funnel to produce a signal indicating the presence of a bit cell of the other binary value.
Claim 8
Dependent Claim
60 words
A decoder according to claim 1 wherein detection by the logic network of bits representing the transitions in a bit cell of the encoded data causes selected stages of the shift register to be reset so as to clear the bits representing the transitions in that cell, other than that representing the transition at the trailing edge of that cell.
Claim 9
Dependent Claim
37 words
A decoder according to claim 1 wherein the logic network comprises a plurality of separate logic stages connected by registers clocked in synchronism with the shift register, whereby the separate logic stages operate in a pipelined manner.
Claim 10
Dependent Claim
24 words
A decoder according to claim 1 including a further shift register for synchronising the encoded data before applying it to the first-mentioned shift register.
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) | 1991-05-17 | 1991-11-16 | 1992-05-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-05-17 | 1995-11-16 | 1996-05-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-05-17 | 1999-11-16 | 2000-05-17 | $7700.00 | Window Closed / Lapsed |