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

Apparatus for detecting single event

Assignee: Toshiba Corp
•
Filing: 1980-02-28
•
Granted: 1984-01-17
•
Expires: 2000-02-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A plurality of input signals are applied to input terminals of first and second priority encoders according to the order of priority in ascending and descending orders, respectively. The encoded output signals of the first and second priority encoders are exclusive-ORed for each corresponding pair of significant bits. A single event detection is executed only if exclusive OR is effected for all the corresponding pairs of significant bits.

Inventors

  • 👤 Eiichi Tanaka
  • 👤 Norimasa Nohara
  • 👤 Takehiro Tomitani
  • 👤 Mineki Nishikawa

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 22:56
CPC Classifications
H; H03; H03K; H03K19/00; H03K19/20; H03K19/21

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 189 words
A logic circuit comprising a first priority encoder satisfying a condition 2 m-1 <n≦2 m for n binary logic input signals and having a plurality of input terminals to which said n binary logic input signals are applied according to input priority orders i (i=0 to 2 m -1) respectively, whereby an input signal corresponding to the highest priority is converted into a binary code signal constituted by a plurality of significant bits; a second priority encoder satisfying the same condition of said first priority encoder and having a plurality of input terminals to which said binary logic input signals are applied according to priority orders 2 m 1-i respectively, whereby an input signal corresponding to the highest priority is converted into a binary code signal constituted by a plurality of significant bits; and a gate circuit section for bitwise comparison of the binary code signals from said first and second priority encoders and for producing an output signal only when the contents of every corresponding pair of significant bits differ from each other thereby detecting a single event of the n binary logic signals on the input lines.
Claim 2
Dependent Claim 189 words
A logic circuit comprising a first priority encoder satisfying a condition 2 m-1 <n≦2 m for n binary logic input signals and having a plurality of input terminals to which said n binary logic input signals are applied according to input priority orders i (i=0 to 2 m -1) respectively, whereby an input signal corresponding to the highest priority is converted into a binary code signal constituted by a plurality of significant bits; a second priority encoder satisfying the same condition of said first priority encoder and having a plurality of input terminals to which said binary logic input signals are applied according to priority orders 2 m 1-i respectively, whereby an input signal corresponding to the highest priority is converted into a binary code signal constituted by a plurality of significant bits; and a gate circuit section for bitwise comparison of the binary code signals from said first and second priority encoders and for producing an output signal only when the contents of every corresponding pair of significant bits differ from each other thereby detecting a single event of the n binary logic signals on the input lines.
Claim 3
Dependent Claim 59 words
A logic circuit according to claim 1, characterized in that said gate circuit section is composed of gate circuit (13, 14, 15) to carry out exclusive OR operation of the corresponding significant bits of said binary code signals, and a gate circuit (16) to carry out AND operation of the exclusive OR outputs of all the corresponding significant bits.
Claim 4
Dependent Claim 53 words
A logic circuit according to claim 1 or 2, characterized in that if said binary logic input signals (S 0 to S n-1 ) are fewer than the input terminals of each of said first and second priority encoders (21 and 22), the same logic signals (0) are applied to remaining input terminals.
Claim 5
Independent Claim 144 words
An apparatus for detecting input lines, comprising: n number of input lines supplied with binary logic signals; a pair of priority encoders, one of which has a plurality of input terminals connected to the n number of input lines in a first order of priority and the other of which has a plurality of input terminals connected to said n number of input lines in a reverse order to the first order of priority, for encoding the binary logic signal on an input line having a logic signal nearest to one of least significant bit and most significant bit into n bit signals where 2 m-1 <n≦2 m , thereby respectively producing two sets of m bit signals; and an exclusive logic circuit for outputting an exclusive ORed signal of said two sets m bit signals, thereby detecting input lines having logic signals thereon.
Claim 6
Independent Claim 144 words
An apparatus for detecting input lines, comprising: n number of input lines supplied with binary logic signals; a pair of priority encoders, one of which has a plurality of input terminals connected to the n number of input lines in a first order of priority and the other of which has a plurality of input terminals connected to said n number of input lines in a reverse order to the first order of priority, for encoding the binary logic signal on an input line having a logic signal nearest to one of least significant bit and most significant bit into n bit signals where 2 m-1 <n≦2 m , thereby respectively producing two sets of m bit signals; and an exclusive logic circuit for outputting an exclusive ORed signal of said two sets m bit signals, thereby detecting input lines having logic signals thereon.

References Cited (Backward Citations)

US2848532A Cited
US3321743A Cited
US3387263A Cited
US3541507A Cited
US3886520A Cited
US3979720A Cited
US4020460A Cited
US4087786A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-01-16 1987-07-18 1988-01-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-01-16 1991-07-18 1992-01-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-01-16 1995-07-18 1996-01-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag