← Back to Patent Explorer
US3732407A Expired / Lapsed US ⏱️ 0.0 years remaining

Error checked incrementing circuit

Assignee: AT&T Inc
•
Filing: 1971-11-12
•
Granted: 1973-05-08
•
Expires: 1991-11-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An add-one circuit having an error checking arrangement in which common circuits are employed to predict the parity of the output word of the add-one circuit and to assure that a single ''''0'''' to ''''1'''' transition occurs during each incrementing operation. Single errors in the operation of the add-one circuit are fully detected by utilization of the transition detecting circuitry in combination with arrangements for comparing the predicted parity with the actual parity of the output word.

Inventors

  • 👤 J Brewster
  • 👤 T Hoffman

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 22:13
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/085; G06F9/00; G06F9/06; G06F9/30; G06F9/32; G06F9/321

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 135 words
A self-checking circuit for incrementing a data word obtained from a data word source comprising: a plurality of serially connected adder stages having input terminals connected to corresponding output terminals of said data word source, a plurality of output terminals connected to a data utilization circuit and transition detecting means individual to said stages for generating at output terminals thereof output signals defining ''''0'''' to ''''1'''' transitions in said adder stages when a data word is applied to said input terminals of said incrementing circuit; circuit means connected to said output terminals of said detecting means for generating a first signal if a single transition of the type above defined occurs during an incrementing function and for generating signals predicting the parity of the data word occurring at said output terminals of said adder stages.
Claim 2
Dependent Claim 135 words
A self-checking circuit for incrementing a data word obtained from a data word source comprising: a plurality of serially connected adder stages having input terminals connected to corresponding output terminals of said data word source, a plurality of output terminals connected to a data utilization circuit and transition detecting means individual to said stages for generating at output terminals thereof output signals defining ''''0'''' to ''''1'''' transitions in said adder stages when a data word is applied to said input terminals of said incrementing circuit; circuit means connected to said output terminals of said detecting means for generating a first signal if a single transition of the type above defined occurs during an incrementing function and for generating signals predicting the parity of the data word occurring at said output terminals of said adder stages.
Claim 3
Dependent Claim 145 words
A circuit for incrementing a data word in accordance with claim 1 wherein said circuit means comprises first and second one-out-of-n detecting means for generating an output signal of a first character if a single transition of the type above defined is to occur in the stages to which said one-out-of-n detecting means is connected, said first one-out-of-n detecting means being connected to the odd numbered ones of said adder stages and said second detecting means being connected to the even numbered ones of said adder stages, and means connected to the output terminals of said one-out-of-n detecting means for generating an output signal of a first character if a transition is to occur in an odd numbered one of said adder stages and a signal of a second character if a transition is to occur in an even numbered one of said adder stages.
Claim 4
Dependent Claim 196 words
A circuit for incrementing a data word obtained from a data word source by a count of one comprising: a plurality of serially connected adder stages arranged in two groups identified as even numbered stages and odd numbered stages, respectively, having input terminals connected to corresponding output terminals of said data word source, a plurality of output terminals connected to a data utilization circuit and transition detecting means individual to said adder stages for generating at output terminals thereof output signals indicating that a transition from a ''''0'''' binary state to a ''''1'''' binary state is to occur in a connected adder stage; and fault detecting means connected to said output terminals of said transition detecting means for generating a fault signal if said transition detecting means indicate that no transition is to occur or that a transition is to occur in both said odd numbered and said even numbered stages and parity generating means connected to said output terminals of said transition detecting means and to the parity bit output terminal of said data word source for generating a predicted parity signal for the data word appearing at the output terminals of said adder stages.
Claim 5
Dependent Claim 196 words
A circuit for incrementing a data word obtained from a data word source by a count of one comprising: a plurality of serially connected adder stages arranged in two groups identified as even numbered stages and odd numbered stages, respectively, having input terminals connected to corresponding output terminals of said data word source, a plurality of output terminals connected to a data utilization circuit and transition detecting means individual to said adder stages for generating at output terminals thereof output signals indicating that a transition from a ''''0'''' binary state to a ''''1'''' binary state is to occur in a connected adder stage; and fault detecting means connected to said output terminals of said transition detecting means for generating a fault signal if said transition detecting means indicate that no transition is to occur or that a transition is to occur in both said odd numbered and said even numbered stages and parity generating means connected to said output terminals of said transition detecting means and to the parity bit output terminal of said data word source for generating a predicted parity signal for the data word appearing at the output terminals of said adder stages.
Claim 6
Dependent Claim 74 words
A circuit for incrementing a data word in accordance with claim 3 comprising: second parity generating means connected to said data utilization circuit for generating a parity signal for a data word occurring at said output terminals of said incrementing circuit and a comparator circuit for comparing said predicted parity signal and said parity signal generated by said parity generating means and for generating a fault signal if said parity signals are not identical.
Claim 7
Dependent Claim 288 words
A self-checking circuit for incrementing a data word obtained from a data word source comprising: a plurality of serially connected adder stages having input terminals connected to corresponding output terminals of said data word source and a plurality of output terminals; a data utilization circuit connectable to said output terminals; the odd numbered oNes of said adder stages comprising first transition detecting means for generating signals indicating that a single ''''0'''' to ''''1'''' transition should occur in said connected adder stages during the incrementing of said data word obtained from said data word source; the even numbered ones of said adder stages comprising a second transition detecting circuit for generating signals indicating that a single ''''0'''' to ''''1'''' transition should occur in said connected adder stages during the incrementing of said data word obtained from said data word source; first parity generating means connected to the output terminals of said first and second second transition detecting circuits and responsive to said output signals therefrom and connected to the parity bit output terminal of said data word source for generating a predicted parity bit for the incremented data word; second parity generating means connected to said data utilization circuit for generating a parity signal for a data word presented to said data utilization circuit from said incrementing circuit; means for comparing said predicted parity signal and said parity signal from said second parity generating means and for generating a trouble signal when said parity signals are not identical; and circuit means connected to said output terminals of said first and said second transition detecting means for generating error signals if said first and said second transition detecting means generate identical output signals during said incrementing of said data word.
Claim 8
Dependent Claim 288 words
A self-checking circuit for incrementing a data word obtained from a data word source comprising: a plurality of serially connected adder stages having input terminals connected to corresponding output terminals of said data word source and a plurality of output terminals; a data utilization circuit connectable to said output terminals; the odd numbered oNes of said adder stages comprising first transition detecting means for generating signals indicating that a single ''''0'''' to ''''1'''' transition should occur in said connected adder stages during the incrementing of said data word obtained from said data word source; the even numbered ones of said adder stages comprising a second transition detecting circuit for generating signals indicating that a single ''''0'''' to ''''1'''' transition should occur in said connected adder stages during the incrementing of said data word obtained from said data word source; first parity generating means connected to the output terminals of said first and second second transition detecting circuits and responsive to said output signals therefrom and connected to the parity bit output terminal of said data word source for generating a predicted parity bit for the incremented data word; second parity generating means connected to said data utilization circuit for generating a parity signal for a data word presented to said data utilization circuit from said incrementing circuit; means for comparing said predicted parity signal and said parity signal from said second parity generating means and for generating a trouble signal when said parity signals are not identical; and circuit means connected to said output terminals of said first and said second transition detecting means for generating error signals if said first and said second transition detecting means generate identical output signals during said incrementing of said data word.

References Cited (Backward Citations)

US3196260A Cited
US3141962A Cited
US3567916A Cited
US3659089A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1976-05-07 1976-11-06 1977-05-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1980-05-07 1980-11-06 1981-05-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1984-05-07 1984-11-06 1985-05-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag