Memory device containing a static RAM memory that is adapted for executing a self-test, and integrated circuit containing such a device as an embedded static RAM memory

Abstract

 There is described a memory device that contains a static RAM-memory. This is provided with data input and date output registers, an address register, and a control register for storing various control signals. The RAM has three principal modes:

a. in a normal mode, all registers are accessible externally so that the memory may fulfill its standard function,

b. in a scan-state, all the cited register constitute a synchronous shift register that may be serially written with a test pattern and serially read with a result pattern; in this way the memory may be subjected to a test according to the scan test principle,

c. in a self test state the communication with the outer world is shut off, the address register counts through successive addresses, the memory is cycled through read-modify or read-modify-read operations, and the data read is conversed to a signature pattern for subsequent scan-­out.

In this way a quasi stand-alone test facility is realized. Various additonal features may be implemented.

Description

BACKGROUND OF THE INVENTION

[0001] The invention relates to a memory device containing a static RAM memory, and thereto connected an address register, a data input register, a control register, all these registers having externally accessible functional interconnections for information communication, said RAM memory furthermore having a functional data output. In particular, such memory should be easily testable. Conventionally, such testing is effected by writing a predetermined data pattern on a predetermined address location. At any later instant the data is read out again. The test proper consists of comparison operations between the data pattern read out and the data that should have been written into that location. If a sufficient number of correct comparisons have been found, the memory is considered as good. Testing of such a memory device as an embedded memory has been described in litterature. The following publication is being cited as relevant art: Z. Sun et al, Self-testing of embedded RAM's, IEEE 1984 International Test Conference Proceedings, Proceedings pages 148-156, Paper 4.3.

SUMMARY OF THE INVENTION

[0002] Among other things, it is an object of the present invention to provide a memory device according to the preamble which is adapted for embedded as well as for stand-alone use, which realizes a selftest, whereof the test provisions lend themselves to easy parametrization, wherein the number of test patterns and therefore the required test time is limited and which after initialization of the test can independently execute further testing operations. According to a first aspect this object is realized in that the invention is characterized in that in parallel to the functional data output a data output register is connected to the memory, all said registers constituting respective parts of a serially activatable test scan chain, and first control means being provided for activating said memory device alternatively in a scan-state, an operational state, and a self-test state; in said scan state all said registers being coupled to form a serial shift register in said scan chain, in said operational state all said registers being operatively coupled to the memory, and in said self-­test state said address register, said data input register and said control register being operative for under absence of any information communication via any information input of the memory device, forming successive data test patterns and address test patterns and said data output register being operative for receiving successive data result patterns and having conversion means for then converting successive data result patterns to a signature pattern, and furthermore in that said shift register has a serial input for receiving preset information and a serial output for outputting said signature pattern.

[0003] Various other objects are as follows:

1. The test algorithm implemented by the self-test machine must have excellent fault detection capabilities.

2. The structure of the self-test machine is independent of address and data scrambling.

3. The self-test machine generates data backgrounds on-chip and is therefore suitable for both bit oriented and word oriented SRAMs.

4. It has an option for a data retention test.

5. It is suitable for both embedded SRAMs and stand-alone SRAMs and fits perfectly in a boundary-scan environment. Such environment, in particular, has been disclosed in Netherlands Patent Application 8502476, United States Patent Application Serial Number 902,910, (PHN 11.484), herein incorporated by reference. Also, the scan-test of the self-test logic is feasible.

6. Due to the regular and symmetric structure of the test algorithm the silicon overhead is kept small (3% for a 16K synchronous SRAM).

MEMORY FAULT MODEL

[0004] The following faults may be distinguished:

[0005] A memory cell is said to be stuck-at if the logic value of the cell cannot be changed by any action on the cell or influence from other cells. A cell is called stuck-at-0(1) if its read value is always 0(1).

[0006] A memory cell is said to be stuck-open if it is not possible to access the cell. The cause of a stuck-open fault is that the cell's pass transistors are always opened.

[0007] A cell with a transition fault fails to undergo either of both transistions 0 -> 1 or 1 -> 0.

[0008] A memory cell i is said to be state coupled to another memory cell j, if cell i acts as being stuck-at a certain value x(xE{0,1}) only if cell j is in one defined state y(yE{0,1}). In other words: if cell j is in one defined state the state of cell i is defined and can be read, but not be changed in a write action. This does not mean cell j is also state coupled to cell i.

[0009] A memory cell i is said to be transition coupled to cell j is a transition x -> x(xE{0,1}) forces a transition y -> y(yE{0,1}) of cell i. This need not imply cell j is also transition coupled to cell i.

[0010] The translation of electrical/electronic faults to the above functional functional faults depends on circuit implementation and is not considered further

SELECTING FURTHER ASPECTS AND ADVANTAGES

[0011] Advantageously, the test starts with an initialization pattern which is synchronously converted to a succession of sequel patterns, each of them leading to a result pattern, and each result pattern contributing to the signature. This self-sequence obviates the need for continual control at a higher organizational level. The preliminary signature is each time held in a latch type organization, which representes an advantageous synchronous organization. A set of test patterns may have first a maximum number of (1,0) transitions between, thus either an 0-1-0-1 ... or a 1-0-1-0 ... pattern, whereafter this pattern is replaying by projecting half of the bits thereof each to two bits of a projected pattern; the latter may have fewer (1-0) transitions between successive bit patterns. Further replays lead to last to a bit pattern with a uniform bit value. For n bits, a total of ²logn+1 patterns are necessary, which is an advantageously low number. Advantageously, also the test control provisions and the memory itself are directly scan-testable. Although the probability of faulty control is by itself low (because of relatively small area), these provisions allow for fast testing of specific control means, and fast testing of predetermined memory device parts. Advantageously the memory contains a wait counter in addition to its address counter for self-­reliantly counting down a retention test waiting time. Static RAMs should have a reasonable data retention time. Testing thereof raises the expected reliability of the memory device. Advantageously, the control is effected by a finite state machine. Realization thereof by ROM, programmable logic array, wild logic or other means will be shown to be realizable in an unexpected low number of logic control terms. Advantageously, for N different addresses, the memory may be tested according a 9N or according to a 13N address test sequence method. This represents a quite low number of accesses for each location, that, moreover, is linear in the number of locations only.

[0012] The invention also relates to an integrated circuit containing a testable memory device according to the above, that in said operational state is operatively connected to at least one further data processing subsystem on said integrated circuit. The testability of the now embedded RAM-memory greatly raises the reliability of the overall circuit.

BRIEF DESCRIPTION OF THE FIGURES

[0013] The invention hereinafter is being explained with respect to the accompanying figures, wherein

Figure 1 shows a 13N test algorithm with data retention test;

Figure 2 shows data backgrounds for a 16-bit wide SRAM test;

Figure 3 shows a global architecture of a memory device according to the invention;

Figure 4 shows a modified register cell for use in Figure 3;

Figure 5 shows a further modification for a stand-alone RAM-memory;

Figure 6 shows a self-test-controller state diagram;

Figure 7 shows a table of the various modes of the controller;

Figure 8 shows an exemplary circuit realization of the self-test controller;

Figure 9 shows an exemplary circuit realization of the parametrizeable data generator;

Figure 10a, 10b, 10c, 10d show an exemplary circuit realization of an eight bit address generator counter and three bit additional wait counter; plus particularly amended register cells for use therein;

Figure 11 shows an exemplary circuit realization of an eight bit signature generator;

Figure 11a shows a modified register cell therefor.

ORGANIZATION OF A PREFERRED EMBODIMENT

[0014] Figure 1 shows a 13N test algorithm with data retention test. N is the number of addresses 0...N-1 featured in the first column. The second column gives the initialization, wherein each address in succession is written with data 0. The address sequence is effected by incrementing the addresses each time by +1. Likewise, the third and fourth columns have increasing addresses. On the other hand, the fifth and sixth columns have decreasing addresses; incrementing by -1.

[0015] This test is based on a realistic fault model, including stuck-at faults, stuck-open faults, transition faults, coupling faults and data retention faults. In the figures, a RAM WRITE instruction is indicated by Wr and an READ instruction by Rd. The orientation of the data is given in parentheses. The RAM address at which the instruction is executed is shown in the first column of the figure. The required wait time for the data retention test largely depends on the design. In our design we use 50 msec as an example. A bit oriented SRAM will be thoroughly tested with this test algorithm. In a test of a word oriented SRAM however, each address location must be written and read for a complete word. In order to detect coupling faults between cells at the same address, several data words, called data backgrounds, are required during the memory test.

[0016] Figure 2 shows data backgrounds for a 16-bit wide RAM. In the first data background there is a 0-1 transition between every pair of successive bit positions. Conversion to the next four data backgrounds goes as follows: for bit positions 0...i...n-1, bit i is copied onto bit positions 2i and (2i-1), for the next data background. For 16 bits after four successive conversions an all zero data background is reached. The lower half of the figure has data backgrounds that are bitwise inverted with respect to a corresponding data background in the upper half. More generally, the above copying or projecting may be done in various ways, in that half of the bits are each projected on two bit positions. In certain set-ups, the copying may be done with an inversion. The scheme shown above appears to be most easily implemented.

[0017] A complete self-test for a word oriented SRAM wil be as follows: First the 13N test algorithm is run with the first data background, then with the second data background, etcetera. Finally both the 13N test algorithm and the data retention test are run with the last data background.

[0018] The data retention test implies two waiting intervals in both seventh and ninth columns. During these intervals the memory is disabled and data content should therefor, remain unchanged. The method can be made faster in that the direct-read-after-write feature would not be used. This reduces the method to a 9N-method. The patterns of the second half of Figure 2 are realized by inversion as shown hereinafter. Inversion is effected before conversion. The retention test is done only for two backgrounds: all-zero, and all-one- data paterns, respectively.

SET-UP OF A PREFERRED EMBODIMENT

[0019] Figure 3 shows a global architecture of a memory device according to the invention. Memory matrix contains a row- and column-­wise array of memory cells that may contain conventional circuitry. There is an address input 22 fed by address register 24, which via external address-path 26 may receive addresses from a source not shown. There is a data input 28 fed by data register 30, which via external data path 32 may receive data from a data source not shown. There is an external data ouput 34 in parallel with data output register 36. There is a control register 38 that receives external control signals (read, write, chip-select, and the like) on external path 40 and emits control signals for the matrix on lines 41. There is a self-test-controller 42 that contains register cell means 68, and which communicates along control signal lines 44, 46, 50, 54 with various other subsystems. The S-RAM as shown may represent an internal part of a complicated integrated circuit, for example a microprocessor, modem or special purpose device for which it acts as or embedded memory. Such a device may comprise an arithmetic and logic unit (ALU), multiplier, barrel shifter, wild logic, programmable logic array, registers, input-output circuitry, A/D-D/A converters, bus organizations and others. These may feed the memory with addresses, data and control signals, and receive data from the memory. Alternatively, only a selection of these features may be present in that the remaining data/address and control connections are directly connected to associated bond pads of the chip. Inasmuch as these subsystems on themselves may be conventional, no further disclosure is deemed necessary. On the other hand, the memory shown may be a stand-alone memory in that external connections would directly lead to associated bonding pads.

[0020] For testing objects the following elements have been provided: there is formed a serial scan chain according to a known principle that contains the hatched elements. The interconnecting scan line has input 62, interconnecting stretches 52, 48, 31, 39 and serial output 64. All registers so interconnected may be controlled as a serial shift register under control of control signals C1, C2 on line 58, to be discussed hereinafter. Input 62 and output 64 may be connected to a host machine not shown. The host may furthermore drive lines 58 with appropriate control signals. Data input register 30 has been provided with a data generation mechanism for modifying data patterns; it exchanges control signals with control subsystem 42. Address register 24 has additional provisions 72 for constituting a counter. Register 66 in corresponding manner has provisions 77 for constituting a waiting counter for executing a data retention test. Provisions 72, 72 exchange control signals with control sub-system 42 via line 50. Data output register 36 has provisions for producing from a sequence of successive data result patterns a signature pattern. The signature pattern may be transferred via line 64. The latter provisions receive control signals via line 54. Finally, control subsystem 42 may transmit control signals on line 44 for controlling the test-associated modes.

[0021] Figure 4 shows a modified register cell for use in Figure 3. The register cell contains a storage part 92 and an input multiplexer 90, the latter receiving two control signals C1, C2. The function of these control signals is shown in an associated table: for C1=C2=0 the normal input N is activated. If C1=0, C1=1, the self-test input T is activated. If C1=1 and C2 is don't care the scan input S is activated. The storage pat 92 is activated by a clock CLK. The output signal from the storage part may be used for normal out, for scan-out, and if required for self-test out. -Normal- implies the standard memory operation. -Scan- implies that the register cell constitutes part of a shift register of register cells. -Test- will be discussed hereinafter. If the -Test- provision is not necessary, the associated connections need not be present.

[0022] Figure 5 shows a further modification of a register cell for use in a stand-alone memory. In this case two multipliers 94, 96 have been provided. The first is a reduced version of multiplexer 90 in Figure 4, the second is used only to discriminate between -normal- and -not-normal-situation. In the normal situation no storage is effected. The -test-out- and -scan-out-signals are present at the storage cell output.

DESCRIPTION OF THE EXECUTION PROCESS

[0023] In this respect Figure 7 shows the sequence of modes of the controller. First, with C1=C2=0, the RAM is operated in normal mode. Next, for C1=C2=1, all registers are initialized. Then, after C2 goes to 0, the self-test runs, until it stops independently at completion. Thereafter C2 goes to 1 again and the test results inclusive of the signature pattern, may be output serially. Finally, both control signals go to zero and the circuit is free again for normal mode operation.

[0024] Figure 6 shows a self-test controller state-diagram for executing the 13N test of Figure 1. The regular structure of the test method resulted in a state diagram of low complexity and thus in a low complexity of the self-test-controller.

[0025] Each state is indicated by a circle. The first state S0 executes the second column in Figure 1 and therefore loops continuously, each time generating the next address (column 6). The data background is unchanged (column 9), the address order is not inverted (column 8), the data is not inverted (column 7), and the last address has not be reached (column 6). If the last address is reached, the system exits (cf. column 7) to the next state S1. The data is inverted (column 7), the address is incremented, so that the first address is reached again. Next, the present address is read out (state S1) written with the nes data (state S2) and read again (state S3). Thereupon the systems reverts to state S1 while going to the next address (line 3, column 6) without further change and the cycle repeats (S1, S2, S3). If the last address is found (line 4, column 5), the data is inverted (column 4), the address is incremented (column 6) and the whole range of addresses is cycled again. This operation corresponds to executing the fourth column of Figure 1. After operating on all addresses, the fifth row is reached. Herein, the data is inverted (column 7), the address order is inverted (column 8), the address order is -normal- (column 3), that is: no further change is effected, and no further inversion of the data is effected (column 4). When the last address is reached, the system goes to line 6. Herein, the address order is inverted (column 8), the next data background is written (column 9), the address order is downward (column 3). As long as the last data background has not been reached the output from state S3 is now towards state S0, wherein the new data background is successively written into all memory addresses. Next, the repeated cycling through states S1, S2, S3 is effected again. Upon attainment of the last data background, however, the system exists via column 7 to state S4. Herein, the address counter is activated (column 6), but the memory itself remains disabled. When the waiting time ends (column 1, line 9), the system goes to state S5, wherein the first address is read. Next in state S6, new data is written and these two states are traversed once for each different address. When the last address has been reached again (row 11), the system goes to state S7. Here again a waiting time is effected for testing the data retention. There after in state S8 all memory positions are read and after attainment of the last address, the system goes to state S9 wherein the memory is disabled and the test is over. The only thing remaining is the output of test evaluation information, including the signature pattern, which is not shown here.

PREFERRED EMBODIMENTS OF VARIOUS TEST SUB-SYSTEMS

[0026] Figure 8 gives an exemplary circuit realisation of the self-test controller (stock 42 in Figure 3). The programming is done in programmable logic array PLA 100 of sufficient storage capability. There are nine inputs and nine outputs. The inputs are the following: state inputs 102 that may define the ten states shown in Figure 6 (S0..S9). Input 104 signals the address incrementation direction. Input 108 signals the inverted or normal sitution with respect to the data (column 4 in Figure 6). Input 110 signals the attainment of the last data background: the signal in question is produced by the data generator to be discussed hereinafter; the block indicates a steady-state signalization. Input 112 signals the attainment of the last address of a cycle through all memory addresses. Input 114 signals the completion of the retention test waiting time. Signals 112, 114 are produced by the address/waiting time counter to be discussed hereinafter; the block indicates a steady state realisation.

[0027] The outputs of the PLA are the following: Outputs 116 signal the next state of the system to be attained, these are coupled back to inputs 102 via holding register cells. Output 118 activates the LFSR (linear feedback shift register) to be discussed hereinafter for generating a signature pattern. Output 120 signals the next address to be activated. Output 122 signals that the data is to be inverted. Output 124 signals that the address incrementation direction is to be inverted. Output 126 signals that the next data background is to be activated. The output signals are processed as follows: outputs 122, 126 are connected to the data generator symbolized by block 128. Output 120 is connected to the address counter symbolized by block 130. State outputs out 4, out 3 are connected to the RAM memory, symbolized by block 134 for therein controlling enable/disable and write/read modes, respectively. The local inputs (102, 104, 108) are produced by flipflops 132, that have a set-up shown in detail in block 136: the register cell proper 138 is a data flipflop controlled by the clock clk; it is preceded by a 2:1 multiplexer 140 that is controlled by control signal C1 discussed hereabove. It has two inputs for the selftest input and the serial scan input, respectively. Element 142 is a further such cell, fed by PLA output out 1. Cells 142, 132 are connectable in a serial shift register for executing a scan test, as being fed in input 144 and outputting via output 146. Together they realize the hatched part 68 of controller 42 in Figure 3. The output of element 142 is connected to the signature forming device to be discussed hereinafter. Outputs 122, 124 are fed to their associated register flipflops via an EXCLUSIVE-OR-­gate. Inputs 104, 102 to the PLA 100 are connected to the address counter 130 to therein invert the address incrementation direction and to activate the retention test waiting time, respectively.

[0028] The PLA can be replaced by a piece of combination logic with the same functionality (e.g. a standard cell realization or a gate matrix). The PLA contains all information about the test algorithm. Hence, if an other test algorithm is used, only the PLA needs to be redesigned.

[0029] Figure 9 shows an exemplary circuit realization of a parametrizeable data generator. For a data pattern of eight bits this data generator consists of eight stages that each contain a three-input multiplexer (200..214) and a register cell that has been modified according to Figure 4 (216..230). By way of their S-inputs the latter can constitute part of a serial scan chain. Each input multiplexer feeds a register cell that is connected to the former's output. The register cells in their turn feed their respective input multiplexers as follows: a signal INVDATA = 1 and under synchronizing control not shown will invert the data by means of inverting input 01 (indicated by a circle). This implies that all stored data bits are inverted simultaneously. The associated control bit is produced by the arrangement of Figure 8. The inverted data bit is stored.

[0030] Under control of control signal NEXTDBGR = 1 the next sequel pattern is stored in the register cells, in that each time the output of register cell j feeds the 10 input of the input multiplexers pertaining to register cell 2j, 2j+1. Therefore: from 216 to 200, 202; from 218 to 204, 206; from 220 to 208, 210; from 222 to 212, 214. The parametrization is easily effected as follows: in going to the double length (16 bits), the outputs of register cells 224-230 are fed to the multiplexer inputs of the next following eight stages. This implies one additional interconnection for each bit length increase of the pattern.

[0031] Under control of two control signals INVDATA = 0 and NEXTDBGR = 0 the bit present in the respective register cell is retro­coupled to the associated multiplexer input and restored in the register cell. In this way the set-up is made completely synchronously operating. An extended detail of the register cells is shown at the top of the figure. All register cells may feed a data bit input of the memory. Moreover, all register cells, by means of their S-input, may be connected into a serial scan chain.

[0032] The combination of control signals NEXTDBGR = 1 and INVDATA = 1 does not occur. Register cell 230 feeds an additional register cell 232 (provided with a two-input multiplexer 234 and further two-input multiplexer 236). The output of this register cell signals that the last data background has occured. Multiplexer 234 selects between scanning operation and selftest-operation. Multiplexer 239 selects between the present data background, that is synchronously retro­coupled and restored, and the next data background that is fed to its -1-­input under control of control signal NEXTDBGR. The latter is found if bits in cells 216 and 222 have the same sign: then the new pattern is the last data background. This, for an 8-bit background occurs after 3 changes. For an 16 bit pattern, EXCLUSIVE-OR-gate 238 should be fed by the first and eighth register cells. The output of cell 232 is used for input 110 in Figure 8. If the sequel patterns for the data background are produced in another way, the detection of the last data background must be amended in a straightforward way.

[0033] On the other hand, the data generator for a bit-oriented memory is particularly simple in that is consists of only a single flipflop plus a few gates. The two required data backgrounds are produced by inverting the flipflop.

[0034] Figures 10a, b, c, d show an exemplary circuit realization of an eight bit address generator counter and a three bit digital wait counter, plus particularly amended cells for use therein.

[0035] The address generator and wait counter are combined in order to reduce silicon overhead. The number of address bits plus the number of wait counter bits, in combination with the clock frequency define the total wait time for the data retention test.

[0036] Two possible circuit realizations of the address counter are taken into account: a Linear Feedback Shift Register (LFSR) and a binary up/down counter. The LFSR however has several disadvantages for this purpose:

1. The address scan order cannot be reversed without a significant amount of extra logic.

2. Generation of the all-zero address requires additional hardware.

3. Generation of a carry out signal requires extra logic.

[0037] We have chosen a realization with a binary up/down counter since this resulted in a smaller circuit. A problem with the binary counter is the delay of the ripple carry signal. Including the wait counter the number of stages in the counter can be up to 20 bits. We have solved this by designing an up/down counter with a pipelined carry signal. The maximum delay is thus reduced to the delay of a series of four 2-input AND gates.

[0038] Thus, all addresses can be generated. There is one address where the sequence may go back. At any address the counting may be halted; the address generation is synchronous. For both counting directions a signal is provided that indicates an attainment of the last counting position. The design is parametrizeable. The address counter cells are adapted according to Figure 10b. The cell proper has an input multiplexer and two additional EXCLUSIVE-OR gates. The multiplexer is controlled by the signal -nextaddr- and -addr.dir- shown at 130 in Figure 8. The first EXOR-gate under control of the carry-in changes the content of the register cell. The second EXOR-gate of the address incrementation direction signal and the cell's content generates the carry-out signal for the next stage. A string of AND-gates under control of the carry-in and carry-out signals produce the ripple carry signal. The wait counter in this case has three stages shown more extensively in Figure 10d. These are bit simpler in that they need to count in one direction only. The wait counter represents the more significant bit stages with respect to the address counter.

[0039] For speed-up of the counter two pipeline flipflops have been inserted between the strings of ripple AND-gates, which are shown more extensively in Figure 10c. Inasmuch their only function is to isolate the input signal from the output signal, their setup is elementary. Attainment of the last address of an address sequence is signalled by an AND-gate positioned at the output of the eighth stage. This signal is input into input 112 in Figure 8. The lowest bit position of the wait counter post receives an enable signal from Figure 3 (block 130). The highest bit position of the wait counter feeds a signal -end of wait- to input 114 in Figure 8.

[0040] In itself, the fast ripple network shown in Figure 10a has been the subject of Netherlands Patent Application 8800860 of April 5, 1988, United States corresponding application ............, herein incorporated by reference. For brevity the operation thereof is not discussed further.

[0041] Figure 11 shows an exemplary circuit realization for an eight bit signature generator or data receptor and Figure 11 a modified register cell therefor.

[0042] The data, that is produced by the RAM during the read actions of the test algorithm, goes to the data receptor. There are two ways to compare this data with the expected data:

1. Compare during every read action the data read with the expected data and set a PASS/FAIL bit if a difference is detected.

2. Compress the data on chip by polynominal division in a Parallel Signature Analyser (PSA). The final contents of the PSA is called a signature.

[0043] We choose the LFSR implementation since this approach results in the least silicon overhead and the delay of an LFSR is small and independent of the number of bits.

[0044] After the selftest has finished, the final signature needs to be compared with a signature that is previously calculated by a dedicated software tool. Comparison is done off chip. Therefore the signature needs to be shifted out of the PSA after the test has finished. A hold mode on the PSA is necessary in order to prevent that the final signature in the PSA is lost after the test has finished. The hold control signal is generated in the selftest controller.

[0045] The error coverage of the PSA reduces exponentially with the decrease of the number of PSA stages. Hence a minimum of eight PSA stages appears necessary. Normally, the number of PSA stages equals the number of data outputs of the SRAM. If the number of data outputs of the SRAM is smaller than eight, the remaining PSA inputs are connected to Vss.

[0046] The Figures shows a possible circuit realization for an eight bit PSA. A minimal polynominal is used in the PSA in order to ensure a maximum error coverage and minimal timing problems due to polynominal feedbacks in the PSA. The choice of the seed of the PSA (initialization) is arbitrary. We choose the all zero word for convenience.

[0047] Figure 11a extensively shows the set-up of a single cell. It is provided with the standard storage port, preceded by a multiplexer that selects between test-operation and serial scan operation, and by a second multiplexer that selects between the existing cell contents (via retrocoupling) and a test signal that is controlled by an EXOR-gate. The selection is controlled by the LFSR-enable signal produced by element 142 in Figure 8. The input EXORs may receive a data bit directly from the RAM. Further EXCLUSIVE OR-gates realize the maximum length feed back register in ways known in the art. The output is serial. In case the RAM has a smaller data width, fewer stages need to be fed by the data output.

Claims

1. Memory device containing a static RAM-memory, and thereto connected an address register, a dat input register, and a control register, all these registers having externally accessible functional interconnections for information communication, said RAM-memory furthermore having a functional data output, characterized in that in parallel to the functional data output a data output register is connected to the memory, all said registers constituting respective parts of a serially activatable test scan chain, and first control means being provided for activating said memory device alternatively in a scan-­state, an operational state, and a self-test state; in said scan state all said registers being coupled to form a serial shift register in said scan chain, in said operational state all said registers being operatively coupled to the memory, and in said self-test state said address register, said data input register and said control register being operative for under absence of any information communication via any information input of the memory device, forming successive data test patterns and address test patterns and said data output register being operative for receiving successive data result patterns and having conversion means for then converting successive data result patterns to a signature pattern, and furthermore in that said shift register has a serial input for receiving preset information and a serial output for outputting said signature pattern.

2. A memory device as claimed in Claim 1, characterized in that said address register and data input register are provided with sequencing means for converting an initialization pattern sequentially in a succession of sequel patterns, and in that said conversion means are operative in synchronism with the generation of said sequel patterns.

3. A memory as claimed in Claim 2, characterized in that said conversion means have a hold state for holding any preliminary signature pattern generated therein.

4. A memory device as claimed in Claim 2 or 3, characterized in that for said data input register there is provided a preset mechanism for in the latter register producing a partial test pattern that has a maximum number of 1-0 changeovers between successive bit positions, and said sequencing means has second control means for from said partial test pattern generating successive further partial test patterns in a partial sequence, wherein in said sequence each 1-0 changeover between an arbitrary pair of bit positions thereof occurs at least once.

5. A memory device as claimed in any of Claims 1 through 4, characterized in that said serial test scan chain is adapted for executing a test operation on said control means and said sequencing means.

6. A memory device as claimed in any of Claims 1 through 5, characterized in that said address register has counting means for synchronously counting through all of its address positions, and wait counter means fed by said counting means and controlled by said first control means for under control of a particular address position disabling said RAM-memory and measuring a waiting time for after termination of said waiting time executing a data retention test.

7. A memory device as claimed in any of Claims 1 to 6, characterized in that said first control means contain a finite state machine for under traversal of respective states of said finite state mechine executing a complete test of said static RAM memory.

8. A memory device as claimed in Claim 7, characterized in that said finite state machine comprises a sequence of states, starting with a write state for all memory locations, followed by a first read-­modify sequence for all memory locations in a first address incrementation direction with a first data background, repeating the same with an inverted date background with respect to said first data background, repeating the same in an opposite address in incrementation direction with said first and inverted data backgrounds, respectively, next disable the memory during said waiting time and thereafter execute a second read-modify sequence for all memory locations in an arbitrary address incrementation sequence, finally disable the memory again during a time equal to said waiting time and execute a read sequence for all memory locations in a further arbitrary address sequence.

9. A memory device as claimed in Claim 8, characterized in that each said first read-modify sequence is completed to a read modify-­read-sequence.

10. A memory device as claimed in Claim 8 or 9, characterized in that said first and second data backgrounds consist of a plural bit-­repetition of (0-1) data patterns to a total of n-bits, and in that any state pertaining to such data background is replayed in a state with a projected data background, wherein half of the data bits of any projecting data background are each projected on two bits of the projected data background, until after ²log n replay operations any pair of data bits has at least once had an (0-1) pattern difference between them.

11. A memory device as claimed in any of Claims 2 to 10, wherein third control means are provided for executing a scan test on the memory itself.

12. An integrated circuit containing a memory device according to at least one of the Claims 1 to 11, and also a further data processing subsystem that in said operational state is operatively connected to at least either said data input register, or said address register, or said functional data output.

Drawing