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

Error correcting circuits and methods for shift register type memories

Assignee: Unisys Corp
•
Filing: 1976-12-17
•
Granted: 1978-05-09
•
Expires: 1996-12-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract This disclosure relates to error correcting circuits and methods employed thereby for shift register type memories which are formed of a plurality of loops that may be accessed in parallel. Such circuitry is designed to detect when the output of a given loop or shift register becomes a series of ones or a series of zeros which conditions indicate burst mode error. The data bit corresponding to the loop or shift register producing the error is then corrected by complementation.

Inventors

  • 👤 Satish L. Rege

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 21:04
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1076; G06F11/14

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 87 words
A recirculating memory system comprising: a plurality of recirculating data paths in which sets of related data bits, one bit in each of the respective paths, are recirculated in synchronism; means coupled to the respective recirculating data paths to access a set of related bits in parallel; and a plurality of error detecting circuits, one for each recirculating data path and coupled to said accessing means to detect when the bits accessed from a given data path are a series of ones or a series of zeros.
Claim 2
Dependent Claim 87 words
A recirculating memory system comprising: a plurality of recirculating data paths in which sets of related data bits, one bit in each of the respective paths, are recirculated in synchronism; means coupled to the respective recirculating data paths to access a set of related bits in parallel; and a plurality of error detecting circuits, one for each recirculating data path and coupled to said accessing means to detect when the bits accessed from a given data path are a series of ones or a series of zeros.
Claim 3
Dependent Claim 73 words
A recirculating memory system according to claim 1 which further includes: a recirculating parity data path in parallel with said plurality of recirculating data paths and containing a series of parity bits one for each set of related data bits in said recirculating data paths; and parity checking means coupled to said accessing means and to said recirculating parity data path to check the parity of an accessed set of related data bits.
Claim 4
Dependent Claim 30 words
A recirculating memory system according to claim 1 wherein: said recirculating data paths are formed of MOS shift registers which are coupled together to form a plurality of recirculating loops.
Claim 5
Dependent Claim 19 words
A recirculating memory system according to claim 1 wherein: said recirculating data paths are formed of charge coupled devices.
Claim 6
Dependent Claim 32 words
A recirculating memory system according to claim 1 wherein: said recirculating data paths are formed in a magnetic medium having a magnetic bias to sustain single domain walls as individual data bits.
Claim 7
Dependent Claim 51 words
A recirculating memory system according to claim 1 further including: complementing means coupled to said accessing means to complement a given bit accessed from a recirculating data path when a corresponding error detecting circuit detects a series of ones or a series of zeros having been accessed from that data path.
Claim 8
Dependent Claim 163 words
In a recirculating memory system having a plurality of recirculating data paths wherein sets of related data bits, one from each data path, are recirculated in synchronism, accessing means coupled to each of said recirculating data paths to access a set of related data bits in parallel and a plurality of error detecting circuits coupled to respective ones of said recirculating data paths to detect whenever a given data path produces either a series on ones or a series of zeros upon successive accessing, the method comprising: reading a set of related data bits from said recirculating data paths into said accessing means; accessing additional sets of related data bits in sequence until the end of a block of said sets of related data bits; detecting if any of said error detecting circuits denotes a series of ones or a series of zeros having been read from corresponding recirculating data path; and transmitting said sets of related data bits from said accessing means.
Claim 9
Dependent Claim 163 words
In a recirculating memory system having a plurality of recirculating data paths wherein sets of related data bits, one from each data path, are recirculated in synchronism, accessing means coupled to each of said recirculating data paths to access a set of related data bits in parallel and a plurality of error detecting circuits coupled to respective ones of said recirculating data paths to detect whenever a given data path produces either a series on ones or a series of zeros upon successive accessing, the method comprising: reading a set of related data bits from said recirculating data paths into said accessing means; accessing additional sets of related data bits in sequence until the end of a block of said sets of related data bits; detecting if any of said error detecting circuits denotes a series of ones or a series of zeros having been read from corresponding recirculating data path; and transmitting said sets of related data bits from said accessing means.
Claim 10
Dependent Claim 32 words
A method according to claim 7 further including: complementing the respective bit corresponding to the data path where an error has been noted before the transmission of data from said accessing means.
Claim 11
Dependent Claim 29 words
A method according to claim 8 further including: setting the respective error detecting circuits to a no error condition prior to the beginning of accessing of said memory system.

References Cited (Backward Citations)

US3792450A Cited
US3794819A Cited
US4028539A Cited
US4024509A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1981-05-08 1981-11-07 1982-05-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1985-05-08 1985-11-07 1986-05-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1989-05-08 1989-11-07 1990-05-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag