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

Method of and means for in-line testing of a memory operating in time-division mode

Assignee: Telecom Italia SpA
•
Filing: 1976-10-08
•
Granted: 1977-09-20
•
Expires: 1996-10-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A read/write memory of n stages, periodically addressed in a recurrent scanning cycle of n time slots in which binary words are written in and read out from respective stages, is connected to a data-handling network by way of a writing multiple and a reading multiple each traversing a respective selective inverter, i.e., an upstream inverter in the writing multiple and a downstream inverter in the reading multiple. The two inverters are controlled by a generator of pseudo-random binary signals, unrelated to those processed in the data-handling network, having an operating cycle coextensive with a scanning cycle. Depending on the character of the control signals issuing from this pseudo-random generator during each cycle, the two selective inverters pass the bits of their incoming words either in their original or in a complemented form; with words written in a memory stage in one cycle read out in the immediately following cycle, the control signals delivered to the two inverters are identical but staggered by one cycle so that the words appearing in the output of the downstream inverter match those fed into the upstream inverter in the preceding cycle when the memory operates properly. Under certain circumstances, when a memory stage is addressed out of turn so that loading and reading of its contents occur successively in the same cycle, the staggering of the two control signals is canceled. Malfunctions of the memory are detected by parity checks carried out on the words traveling along the reading multiple to the downstream inverter; an alarm signal is emitted upon the occurrence of an error in the same bit position in two consecutive cycles.

Inventors

  • 👤 Wouter Martinus Dirk Van Veen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 18:02
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/02; G11C29/04; G11C29/08; G11C29/12; G11C29/14; G11C29/18; G11C29/30; G11C29/32; G11C29/36

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 227 words
A method of testing the performance of a multistage memory whose stages are periodically addressed in respective time slots of a recurrent scanning cycle, each time slot being divided into a reading phase and a writing phase, for inscribing an incoming multibit data word in an addressed memory stage during a writing phase and retrieving an inscribed data word from an addressed memory stage during a reading phase of any time slot, comprising the steps of: generating, during certain scanning cycles selected in a generally stochastic manner, inversion commands for replacing the bits of said incoming words by their complements at a location upstream of said memory prior to inscribing said incoming words in the respective memory stages; supplementing said incoming data words, between said upstream location and said memory, with party criteria written along with said data words in the respective memory stages; replicating said inversion commands at a location downstream of said memory for reinverting inverted data words retrieved from said memory stages; replicating said inversion commands at a location downstream of said memory for reinverting inverted data words retrieved from said memory stages; performing a parity check on retrieved data words between said memory and said downstream location; and generating an alarm signal upon a recurrent negative outcome of said parity check in any bit position in homologous time slots of consecutive scanning cycles.
Claim 2
Independent Claim 227 words
A method of testing the performance of a multistage memory whose stages are periodically addressed in respective time slots of a recurrent scanning cycle, each time slot being divided into a reading phase and a writing phase, for inscribing an incoming multibit data word in an addressed memory stage during a writing phase and retrieving an inscribed data word from an addressed memory stage during a reading phase of any time slot, comprising the steps of: generating, during certain scanning cycles selected in a generally stochastic manner, inversion commands for replacing the bits of said incoming words by their complements at a location upstream of said memory prior to inscribing said incoming words in the respective memory stages; supplementing said incoming data words, between said upstream location and said memory, with party criteria written along with said data words in the respective memory stages; replicating said inversion commands at a location downstream of said memory for reinverting inverted data words retrieved from said memory stages; replicating said inversion commands at a location downstream of said memory for reinverting inverted data words retrieved from said memory stages; performing a parity check on retrieved data words between said memory and said downstream location; and generating an alarm signal upon a recurrent negative outcome of said parity check in any bit position in homologous time slots of consecutive scanning cycles.
Claim 3
Dependent Claim 55 words
A method as defined in claim 1 wherein the reading phase of each time slot precedes the writing phase thereof whereby a data word inscribed in a memory stage during a given scanning cycle is retrieved therefrom during an immediately following scanning cycle, the replication of said inversion commands being delayed by one scanning cycle.
Claim 4
Dependent Claim 94 words
A method as defined in claim 2 wherein the addressing of said memory stages proceeds in a predetermined order in one part of each reading and writing phase of any scanning cycle and wherein other parts of said phases are available for out-of-turn reading and writing, comprising the further steps of comparing the address of a memory stage addressed out of turn with the address called for by said predetermined order and modifying the relative timing of a corresponding inversion command and its replication in accordance with the relative ranks of the compared addresses.
Claim 5
Dependent Claim 45 words
A method as defined in claim 3 wherein out-of-turn writing affects less than all the bits of a data word already inscribed in a given stage, comprising the further step of blocking said parity check on retrieving a data word altered by the out-of-turn writing.
Claim 6
Dependent Claim 54 words
A method as defined in claim 1 wherein said parity criteria are supplemental bits of a value determined by the combined bits of the data words to be inscribed and respective address codes identifying the corresponding memory stages, said parity check being carried out on combinations of retrieved data words and respective address codes.
Claim 7
Dependent Claim 313 words
In a data-handling system, in combination: a multistage memory provided with addressing means for periodically identifying the stages thereof in respective time slots of a recurrent cycle, input means for inscribing an incoming multibit data word in an identified memory stage during a writing phase of any time slot, and output means for retrieving an inscribed data word from an indentified memory stage during a reading phase of any time slot; first conductor means connected to said input means for delivering said incoming data words to said memory; second conductor means connected to said output means for reading out the data words retrieved from said memory; first selective inversion means inserted in said first conductor means; second selective inversion means inserted in said second conductor means; a supply of control signals synchronized with said scanning means connected to said first inversion means for selectively actuating same, during certain scanning cycles selected in a generally stochastic manner, to replace the bits of said incoming data words by their complements prior to inscription thereof in the respective memory stages, said supply being further connected to said second inversion means for selectively actuating same, in timed relationship with the actuation of said first inversion means, to reinvert inverted data words retrieved from said memory stages; bit-checking means connected to said first conductor means at a point between said first inversion means and said input means for supplementing said incoming data words with parity criteria written along with said data words in the respective memory stages; parity-check means connected to said second conductor means at a point between said output means and said second inversion means for verifying the correct operation of said memory; and alarm means connected to said parity-check means for indicating a malfunction upon a recurrent negative outcome of a parity check in any bit position in homologous time slots of consecutive scanning cycles.
Claim 8
Dependent Claim 313 words
In a data-handling system, in combination: a multistage memory provided with addressing means for periodically identifying the stages thereof in respective time slots of a recurrent cycle, input means for inscribing an incoming multibit data word in an identified memory stage during a writing phase of any time slot, and output means for retrieving an inscribed data word from an indentified memory stage during a reading phase of any time slot; first conductor means connected to said input means for delivering said incoming data words to said memory; second conductor means connected to said output means for reading out the data words retrieved from said memory; first selective inversion means inserted in said first conductor means; second selective inversion means inserted in said second conductor means; a supply of control signals synchronized with said scanning means connected to said first inversion means for selectively actuating same, during certain scanning cycles selected in a generally stochastic manner, to replace the bits of said incoming data words by their complements prior to inscription thereof in the respective memory stages, said supply being further connected to said second inversion means for selectively actuating same, in timed relationship with the actuation of said first inversion means, to reinvert inverted data words retrieved from said memory stages; bit-checking means connected to said first conductor means at a point between said first inversion means and said input means for supplementing said incoming data words with parity criteria written along with said data words in the respective memory stages; parity-check means connected to said second conductor means at a point between said output means and said second inversion means for verifying the correct operation of said memory; and alarm means connected to said parity-check means for indicating a malfunction upon a recurrent negative outcome of a parity check in any bit position in homologous time slots of consecutive scanning cycles.
Claim 9
Dependent Claim 15 words
The combination in claim 6 wherein said supply comprises a pseudo-randum generator of binary signals.
Claim 10
Dependent Claim 120 words
The combination as defined in claim 6 wherein said addressing means includes a binary counter emitting a succession of regular address codes in a predetermined order, a source of out-of-turn address codes, and switchover means operable to connect said counter to said memory in one part of each reading and writing phase and to connect said source to said memory in another part of at least some reading and writing phases; further comprising comparison means connected to receive said regular and out-of-turn address codes for determining their relative numerical values, and delay means controlled by said comparison means for modifying the relative timing of the actuation of said first and second inversion means in accordance with said relative numerical values.
Claim 11
Dependent Claim 52 words
The combination defined in claim 8 wherein said switchover means has a first input connection, energizable by said counter, a second input connection energizable by said source, and an output connection leading to said memory, said comparison means having input terminals tied to said first input connection and to said output connection.
Claim 12
Dependent Claim 173 words
The combination defined in claim 9 wherein said supply is provided with a first output lead carrying a first sequence of control signals and with a second output lead carrying a second sequence of control signals related to said first sequence but lagging same by one scanning cycle, said delay means including first switch means connected to said first output lead and second switch means connected to said second output lead, said first switch means being responsive to said comparison means for extending said second output lead to said first inversion means upon the regular address code preceding the out-of-turn address code in said predetermined order and for extending said first output lead to said first inversion means under all other conditions, said second switch means being responsive to said comparison means for extending said first output lead to said second inversion means upon the out-of-turn address code preceding the regular address code in said predetermined order and for extending said second output lead to said second inversion means under all other conditions.
Claim 13
Dependent Claim 82 words
The combination defined in claim 6, further comprising a first parity-bit inserter connected to said addressing means for receiving address codes of memory stages identified thereby, said bit-checking means including a second parity-bit inserter connected to said addressing means for receiving said address codes in addition to the incoming data words from said first conductor means, said parity-check means being connected to said addressing means for receiving said address codes in addition to the retrieved data words from said second conductor means.
Claim 14
Dependent Claim 28 words
The combination defined in claim 11 wherein said second parity-bit inserter and said parity-check means are connected to said addressing means by way of said first parity-bit inserter.

References Cited (Backward Citations)

US3727039A Cited
US3719929A Cited
US3768071A Cited
US3789204A Cited
US3949205A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag