Patent US4020460A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4020460A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus of checking to determine if a signal is present on more than one of n lines

Assignee: International Business Machines Corp
•
Filing: 1975-11-13
•
Granted: 1977-04-26
•
Expires: 1995-11-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract This specification describes an apparatus for determining if more than one of n lines are up at a given time. The apparatus includes means for encoding the n lines into m lines where n = 2 m . Two encoding signals are generated; one, X 0 X 1 . . . X m , complement of the other, Z 0 Z 1 . . . Z m . These two signals are Ex OR'd in accordance with the formula (X 0 Z 0 ) .sup.. (X 1 Z 1 ) . . . (X m Z m ). If more than one line is up, the resultant of the Ex OR operation is one. Otherwise the resultant is zero.

Inventors

  • 👤 Julius Dwight Jones
  • 👤 Dale Milton Junod

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 15:55
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/47; H03M13/51; G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/085

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 112 words
A method for determining whether more than one of n lines are up comprising the steps of: encoding the n lines into m digits where n = 2 m in two complementary sets, X 0 , X 1 , . . . X m and Z 0 , Z 1 , . . . Z m , comparing the two sets together in accordance with the following formula: (X 0 Z 0 ) .sup.. (X 1 Z 1 ) . . . .sup.. (X m Z m ); and, determining if the resultant of comparison is a binary one or a binary zero to indicate whether more than one line is up.
Claim 2
Independent Claim 112 words
A method for determining whether more than one of n lines are up comprising the steps of: encoding the n lines into m digits where n = 2 m in two complementary sets, X 0 , X 1 , . . . X m and Z 0 , Z 1 , . . . Z m , comparing the two sets together in accordance with the following formula: (X 0 Z 0 ) .sup.. (X 1 Z 1 ) . . . .sup.. (X m Z m ); and, determining if the resultant of comparison is a binary one or a binary zero to indicate whether more than one line is up.
Claim 3
Dependent Claim 28 words
The method of claim 1 comparing the low order digits X 0 and Z 0 to see if they are different to determine if no lines are up.
Claim 4
Dependent Claim 121 words
Apparatus for determining whether a signal is present on more than one of n lines comprising: encoding means coupled to the n lines for generating two orthogonal decoding signals of m digits, X 0 , X 1 , . . . X m and Z 0 , Z 1 . . . Z m where n = 2 m ; comparison means coupled to the output of the encoding means for performing the following comparison: (X 0 Z 0 ) .sup.. (X 1 Z 1 ) . . . (X m Z m ); and, means coupled to the output of the comparison means for indicating whether the output of the comparison circuit is a binary one or a binary zero.
Claim 5
Dependent Claim 121 words
Apparatus for determining whether a signal is present on more than one of n lines comprising: encoding means coupled to the n lines for generating two orthogonal decoding signals of m digits, X 0 , X 1 , . . . X m and Z 0 , Z 1 . . . Z m where n = 2 m ; comparison means coupled to the output of the encoding means for performing the following comparison: (X 0 Z 0 ) .sup.. (X 1 Z 1 ) . . . (X m Z m ); and, means coupled to the output of the comparison means for indicating whether the output of the comparison circuit is a binary one or a binary zero.
Claim 6
Dependent Claim 41 words
The apparatus of claim 3 including: means coupled to the output of the comparison means for determining whether the low order digits X 0 and Z 0 are the same or different to find if none of the lines are up.

References Cited (Backward Citations)

US2973506A Cited
US3541507A Cited
US3585637A Cited
US3559167A Cited
US3638184A Cited
US3891143A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1980-04-25 1980-10-25 1981-04-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1984-04-25 1984-10-25 1985-04-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1988-04-25 1988-10-25 1989-04-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag