ALGORITHMIC TEST PATTERN GENERATOR FOR TESTING IC CHIPS

Abstract: An initial stage of a multi-stage algorithmic pattern generator which generates bit streams for testing IC chips, is comprised of multiple sets of input registers which store respective addresses; and an address modifying circuit that is coupled to the input registers, which receives commands, and in response, selects one register in one set and generates a modified address by performing arithmetic operations on the address in the selected register. Also, the initial stage includes a boundary check circuit that is coupled to the address modifying circuit, which stores a respective minimum limit and a respective maximum limit for each register set. This initial stage is particularly useful in generating sequences of addresses for memory cells in a chip that is to be tested, where the cells are arranged in rows and columns. When a particular Min/Max limit for a row/column is reached, then that event is remembered by the boundary check circuit. Thereafter, when the next row/column address is generated, the boundary check circuit automatically replaces the generated address (which will exceed the limit) with the proper address. This operation of detecting a limit address in one cycle, and replacing the next generated address in a subsequent cycle, enables the cycle time of the initial stage to be shorter than it otherwise could be if detection outside the limit and replacement with the proper address, occur in a single cycle.

Description: ALGORITHMIC TEST PATTERN GENERATOR FOR TESTING IC CHIPS RELATED CASES; The present invention, as identified by the above docket number and title, is related to four other inventions. Patent applications on all of these inventions were filed concurrently on November , 1999; and they have one common Detailed Description. These four related inventions are identified as follows: 1. Docket 550,612 entitled "SYSTEM FOR TESTING IC CHIPS SELECTIVELY WITH STORED OR INTERNALLY GENERATED BIT STREAMS" having U.S. Serial No. 2. Docket 550,613 entitled "MULTI-STAGE ALGORITHMIC PATTERN GENERATOR FOR TESTING IC CHIPS" having U.S. Serial No. ; 3. Docket 550,615 entitled "INTERMEDIATE STAGE OF A MULTI-STAGE ALGORITHMIC PATTERN GENERATOR FOR TESTING IC CHIPS" having U.S. Serial No. ; and, 4. Docket 550,616 entitled "OUTPUT STAGE OF A MULTI-STAGE ALGORITHMIC PATTERN GENERATOR FOR TESTING IC CHIPS" having U.S. Serial No. . BACKGROUND OF THE INVENTION; In the prior art, an electronic system for testing chips is disclosed in U.S. Patent 5,390,129. This prior art system is assigned to Unisys Corporation, who also is the assignee of the present invention. A simplified block diagram of the prior art chip testing system is shown in Fig. 2 of patent 129. That system includes a computer 50 which is coupled via a time-shared bus 52 to a plurality of driver boards 100; and each driver board 100 is coupled to a respective burn-in board 500 which holds several integrated circuit chips that are to be tested. In operation, the computer 50 sequentially sends each driver board 100 a separate set of test data patterns that are used to test the chips. These test data patterns are stored on each driver board in a large SRAM which is shown in Fig. 3 by reference numeral 107 and is shown in greater detail in Fig. 9 by reference numeral 145. Which particular driver board receives and stores the test data patterns at any one time is determined by an address circuit 100A that is on the driver board, and is shown in the Fig. 2 block diagram. After the test data patterns are stored in the SRAM 145 on all of the driver boards 100, then the chips on all of the burn-in boards 500 can be tested in parallel. To do that, the test patterns are concurrently read from all of the SRAMs and sent through respective output driver modules 164, as shown in Fig. 14, to the chips on all of the burn-in boards 500. One particular feature of the chip testing system in patent '129 is that each burn-in board includes an ID code which identifies the types of chips that are to be tested on the board. That ID code is sensed by the driver board 100 and sent to the computer 50; and in response, the test data patterns which the computer 50 sends to the driver board are tailored to the ID code that is sensed. However, the chip testing system in patent "129 also has some major limitations which are imposed by the Fig. 2 architecture. For example, the computer 50 is the sole source of the test data patterns for all of the driver boards 100. Consequently, the speed of operation of the chip testing system is limited because the computer 50 can only send the test data patterns to a single driver board at a time over the bus 52. Another limitation of the chip testing system in patent 129 is that each driver board 100 always tests all of the chips on a burn-in board 500 concurrently. However, each burn-in board inherently has a limit on the total amount of power which the chips on the board can dissipate. Thus, in order to keep the total power dissipation on each burn-in board 500 below a certain limit, the total number of chips on each burn-in board must be decreased as the maximum power dissipation per chip increases. Still another limitation of the chip testing system in patent % 129 is that the stored test data patterns in a large SRAM 145 on each driver board can make very inefficient use of the SRAM memory cells. Fig. 9 of patent '129 shows that each SRAM 145 receives nineteen address bits and has eight data output bits; and thus the SRAM 145 on each driver circuit has eight million memory cells. But, certain types of chips are tested by sending them sequences of serial bit streams that vary in number with time. Thus, if an SRAM 145 sends four bit streams during one time interval and sends only two bit streams during other time intervals, then half of the SRAM is wasted when the two bit streams are being sent. To address the above problems with the chip testing system of patent "129, the present inventors filed three U.S. patent applications on August 31, 1999 which are identified as follows: 1. USSN 09/386,946 entitled "An Electronic System for Testing Chips Having A Selectable Number Of Pattern Generators That Concurrently Broadcast Different Bit Streams To Selectable Sets Of Chip Driver Circuits"; 2. USSN 09/387,197 entitled "A Program Storage Device Containing instructions That Are Spaced Apart By Unused Bits That End On Word Boundaries And Which Generate Chip Testing Bit Streams Of Any Length"; and, 3. USSN 09/386,945 entitled "An Electronic System For Testing A Set Of Multiple Chips Concurrently Or Sequentially In Selectable Subsets Under Program Control To Limit Chip Power Dissipation" . Each of the above patent applications include the same set of Figures 1-12, and they each have the same Detailed Description. Also, each of the above patent applications has a separate set of claims which cover different aspects of the chip testing system that is disclosed. The invention as claimed in USSN 09/386,946 addresses the limitation in patent '129 regarding speed of operation. In particular, those claims cover a system for testing integrated circuit chips which is comprised of a selectable number of pattern generators, each of which is coupled via a separate bus to a selectable number of chip driver circuits. Each pattern generator also is coupled to a respective memory, which stores different bit streams, word by word, from its respective memory; and it sends the words that are read to all of the chip driver circuits which are coupled to its separate bus, simultaneously. While that is occurring, each chip driver converts the words which it is sent into bit serial test signals which test multiple integrated circuit chips in parallel. Since all the chip driver circuits which are coupled to one separate bus receive the words of the bit streams simultaneously from one pattern generator, the speed of operation is increased over the prior art. Also, since all of the pattern generators send different bit streams at the same time on separate busses, the speed of operation is further increased over the prior art. In USSN 09/387,197, the invention as claimed addresses the limitations of patent '129 regarding inefficient use of memory to store the test data patterns. In particular, these claims cover a system for testing integrated circuit chips which is comprised of a pattern generator that is coupled to a memory which stores variable length instructions that specify sets of bit streams for testing the chips. Each variable length instruction includes a code which indicates the number of bit streams in the set. Each bit stream in the set consists of a selectable number of bits which start on a word boundary and vary in increments of one bit. A respective series of unused bits starts immediately after each bit stream and ends on a word boundary. If the code indicates that the number of bit streams in a set is only one, then the one bit stream is stored in consecutive words of the memory. If the code indicates the number bit streams in a set is more that one, then those multiple bit streams are stored in an interleaved fashion in consecutive words in the memory. Consequently, the only memory cells that are wasted are those which store the unused bits after each bit stream. But, those unused bits are insignificant in number when each of the bit streams is long. In USSN 09/386,945, the invention as claimed addresses the limitations of patent '129 regarding total power dissipation by the chips which being tested on the burn-in board. In particular, those claims cover a system for testing integrated circuit chips which is comprised of a signal generator that generates a clock signal; and a control circuit having a first input which receives the clock signal, a second input for receiving commands, and multiple outputs. A command source sends programmable sequences of the commands to the second input of the control circuit; and a means in the control circuit selects particular outputs in response to the commands and passing the clock signal from the first input to only the selected outputs All of the outputs of the control circuit are coupled through respective clock transmitters to different chips which are to be tested. Thus, in response to the programmable commands, the clock signal can be sent sequentially to the chips that are to be tested, in selectable subsets. By such sequencing, the total power dissipation of the chips that are tested can be regulated when the chips are of a type that dissipate a large amount of power when they receive the clock signal, but dissipate substantially less power when they do not receive the clock signal. Such chips include, for example, CMOS microprocessor chips and CMOS memory chips. Despite all of the features of the chip testing system that is disclosed in the above three patent applications (hereinafter the "base system"), the present inventors have further discovered a major improvement to that system. By this improved system, the amount of memory which is required to define the test signals for the chips is reduced by several orders of magnitude. A preferred embodiment of the improved system is described herein and in each of the four related cases that are identified on page 1. In each case, the improved system is described with the same set of Figures and the same Detailed Description. Also, each case has a separate set of claims that cover a different aspect of the improved system. In order to fully understand the structure and operation of the improved system, it first is necessary to have an understanding of the base system that is described in the three referenced patent applications 09/386,946 and 09/387,197 and 09/386,945. Accordingly, Figs. 1-12 of those applications, as well as their Detailed Description, are herein repeated. Then, the improved system is described herein in conjunction with Figs. 13-22, as a modification to the base system of Fig. 1-12. BRIEF SUMMARY OF THE INVENTION: The present invention, as claimed, covers one particular portion of a system for testing IC chips selectively with a first bit stream that is stored in a memory or a second bit stream that is internally generated. A major benefit which is achieved by generating the second bit stream internally within the system is that the amount of storage which is required in the memory is greatly reduced. For example, the second bit stream might contain a total of one billion bits; but it can be generated with instructions which require less than one thousand bits of storage in the memory. The particular portion of the system which is claimed as the present invention is an initial stage of a multi-stage algorithmic pattern generator which generates bit streams for testing IC chips. This initial stage is comprised of multiple sets of input registers which store respective addresses; and an address modifying circuit that is coupled to the input registers, which receives commands, and in response, selects one register in one set and generates a modified address by performing arithmetic operations on the address in the selected register. Also, the initial stage includes a boundary check circuit that is coupled to the address modifying circuit, which stores a respective minimum limit and a respective maximum limit for each register set. The above initial stage is particularly useful in generating sequences of addresses for the memory cells of a memory chip in which the cells are arranged in rows and columns. For such a chip, the row addresses can be generated using one set of input registers; the column addresses can be generating using another set of input registers; and respective limits for the row and column addresses can be stored in the boundary check circuit. Each time a particular row address or column address in the sequence is generated, the boundary check circuit detects if any address limit has been reached. When a particular Min/Max limit for a row/column is reached, then that event is remembered by the boundary check circuit. Thereafter, when the next row/column address is generated, the boundary check circuit automatically replaces the generated address (which will exceed the limit) with the proper address. This operation of detecting a limit address in one cycle, and replacing the next generated address in a subsequent cycle, enables the cycle time of the initial stage to be shorter than it otherwise could be if detection and replacement occur in a single cycle. BRIEF DESCRIPTION OF THE DRAWINGS: Fig. 1 shows a block diagram of a base system for testing integrated circuit chips; and that base system is modified as shown herein in Figs. 13-22, in accordance with the present invention. Fig. 2 shows how the chip testing system of Fig. 1 is physically packaged. Fig. 3 shows three different types of variable length instructions which are executed by the Fig. 1 system to test integrated circuit chips. Fig. 4 shows an example of how the instructions of Fig. 3 are arranged in a sequence to form a test program. Fig. 5 shows the internal details of a pattern generator which occurs in selectable quantities in the Fig. 1 system. Fig. 6 shows the internal details of a chip driver circuit which occurs in selectable quantities in the Fig. 1 system. Fig. 7 shows how the pattern generators of Fig. 5 and chip driver circuits of Fig. 6 interact in the Fig. 1 system. Fig. 8 shows additional circuitry on each chip driver circuit in Fig. 1 by which errors in the tested chips are detected. Fig. 9 shows additional circuitry on each driver circuit in Fig. 1 by which multiple chips are tested concurrently or sequentially in selectable subsets under program control. Fig. 10 shows the structure of a control memory which is a portion of the Fig. 9 circuitry. Fig. 11 shows three additional types of instructions which are executed by the chip testing system of Fig. 1. Fig. 12 shows a modification which can be made to the three instructions that are shown in Fig. 3. Fig. 13 shows a modified system which tests integrated circuit chips in accordance with the present invention; and this modified system is obtained by incorporating an algorithmic pattern generator (APG) into the base system of Fig. 1. Fig. 14A shows a preferred internal structure for the APG of Fig. 13. Fig. 14B shows the details of a module 12' in the Fig. 13 system which couples the algorithmic pattern generator of Fig. 14A to the remainder of the Fig. 13 system. Fig. 15A is a detailed logic diagram of one portion of a first stage in the APG of Fig. 14A. Fig. 15B is a detailed logic diagram of another portion of the first stage in the APG of Fig. 14A. Fig. 15C shows one instruction that is executed by the first stage logic circuits of Figs. 15A and 15B. Fig. 15D shows another instruction that is executed by the first stage logic circuits of Figs. 15A and 15B. Fig. 15E shows a third instruction that is executed by the first stage logic circuits of Figs. 15A and 15B. Fig. 15F shows additional details of a boundary check circuit that is included within the first stage logic circuits of Fig. 15A. Fig. 15G shows an instruction that is executed in part by the first stage in the APG of FIG. 14A and also in part by a second stage and a third stage in the APG of Fig. 14A. Fig. 16A is a detailed logic diagram of a portion of the second stage in the APG of Fig. 1 A. Fig. 16B is a detailed logic diagram of another portion of the second stage in the APG of Fig. 14A. Fig. 16C is a detailed logic diagram of still another portion of the second stage in the APG of Fig. 14A. Fig. 16D shows an instruction that is executed by the second stage logic circuits of Figs. 16A-16C. Fig. 16E shows another instruction that is executed by the second stage logic circuits of Figs. 16C- 16E. Fig. 16F shows still another instruction that is executed by the second stage logic circuits of Figs. 16A-16C. Fig. 16G shows yet another instruction that is executed by the second stage logic circuits of Fig. 16A- 16C. Fig. 17A is a detailed logic diagram of a portion of the third stage in the APG. Fig. 17B is a detailed logic diagram of another portion of the third stage in the APG of Fig. 14a. Fig. 18 is a timing diagram which illustrates the sequence of operation for the first stage, second stage, and third stage in the APG of Fig 14A. Fig. 19 shows respective state diagrams for the first stage, second stage, and third stage in the APG of Fig. 14. Fig. 20 shows two state-control flip-flops that are referenced in the state diagrams of Fig. 19. Fig. 21 shows a program for the APG which is stored in the memory of the Fig. 13 system. Fig. 22 shows another instruction, that is used in conjunction with the instructions of Figs. 15C, 15D, 15E, 15G, 16D, 16E, 16F, and 16G in the program of Fig. 21. DETAILED DESCRIPTION; With reference first to Figures 1-12, one embodiment of the base system for testing integrated circuit chips will be described; and thereafter the modifications to the base system, which constitute the present invention, will be described with reference to Figs. 13-22. As Fig. 1 shows, the base system is comprised of five different types of modules 10-14; and a description of each module is given below in TABLE 1. TABLE 1 Module Description 10 Each module 10 is a chip assembly which holds several integrated circuit chips 10a while they are tested. In the Fig. 1 system, the total number of chip assemblies 10 is selectable. Each chip assembly 10 includes one printed circuit board 10b on which several sockets 10c are soldered, and each socket holds one of the chips 10a. Connectors lOd are mounted on an edge of the printed circuit board 10b, and electrical conductors lOe in the printed circuit board carry test signals between the connectors lOd and the chips 10a. 11 Each module 11 is a chip driver circuit. In the Fig. 1 system, a separate chip driver circuit 11 is provided for each chip assembly 10. Each chip driver circuit 11 includes all of the circuitry which is shown in Figs. 6, 8, 9, and 10. By that circuitry, test signals are sent to and received from the chips 10a as various bit-serial sequences which are programmable. TABLE 1 (Continued) M odule Description 12 Each item 12 is a pattern generator. In the Fig. 1 system, each pattern generator 12 is coupled via a bus 12a to a selectable number of chip driver circuits. Fig. 1 shows an example where all of the chip driver circuits 11 are partitioned into subgroups, and a separate pattern generator 12 is coupled via a separate bus 12a to each subgroup. Alternatively, all of the chip driver circuits 11 can be coupled by a single bus 12a to a single pattern generator; or, each chip driver circuit 11 can be coupled by a separate bus 12a to a separate pattern generator. Each pattern generator 12 includes all of the circuitry which is shown in Figs. 5 and 6. By that circuitry, each pattern generator 12 executes a separate sequence of programmable instructions that specify particular bit-serial sequences for testing the chips 10c. In executing the instructions, each pattern generator 12 partitions the bit-serial sequences into words and broadcasts the words to all of the chip driver circuits 11 which are coupled to its bus 12a. 13 Each item 13 is a random access read-write memory. A separate memory 13 is provided for each pattern generator 12. Each memory 13 stores separate sequences of programmable instructions which are TABLE 1 (Continued) Module Description executed by the corresponding pattern generator. These instructions are read from the memory 13 by the pattern generator 12 via an access port 13a, and they are written into the memory via another access port 13b. Both access ports operate concurrently; so some instructions can be read from port 13a while at the same time other instructions can be written into port 13b. 14 Module 14 is a single host computer which directs the operation of the entire Fig. 1 system. The host computer 14 is coupled via a bus 13c to port 13b on all of the memories 13. Included within the host computer 14 is a disk 14a, a keyboard 14b, and a monitor 14c. Stored on the disk 14a are several programs for the pattern generators 12; and each such program includes a different set of the programmable instructions that specify particular bit-serial sequences of signals for testing the chips 10c. To select one of the programs and send it to the memory 13 of a particular pattern generator, an operator (not shown) enters various commands to the host computer 14 via the keyboard 14b. Thereafter, the results that are obtained from testing the chips with the selected program are stored by the pattern generator in the memory 13; and they are displayed by the host computer 14 on the monitor 14c. Referring next to Figure 2, it shows how all of the modules 10-14 are physically packaged together as one system. Item 20 in Figure 2 is a mechanical rack which has multiple horizontal slots 21-1, 21-2, etc. that are arranged on top of each other in a stack. Each slot selectively holds either one driver circuit 11 plus one chip assembly 10, or it holds one pattern generator 12 plus one memory 13. Figure 2 shows an example where the total number of slots in the rack 20 is fourteen. The top slot is 21-1; the next slot is 21-2, etc. In Figure 2, the slots 21-1 thru 21-14 are occupied as follows. Each of the slots 21-1 thru 21-7 holds a driver circuit 11 plus a chip assembly 10; and, the next slot 21-8 holds one pattern generator 12 plus its memory 13. The pattern generator 12 in slot 21-8 is coupled to the seven driver circuits in slots 21-1 thru 21-7 by a bus 12a. On that bus, the pattern generator in slot 21-8 broadcasts bit-serial test signals to all seven of the chip driver circuits that are in slots 21-1 thru 21-7. Slot 21-9 holds a driver circuit 11 plus a chip assembly 10; and slot 21-10 holds one pattern generator 12 plus its memory 13. The pattern generator in slot 21-10 is coupled to the driver circuit in slot 21-9 by a bus 12a; and on that bus, the pattern generator in slot 21-10 sends bit-serial test signals to just the one chip driver circuit in slot 21-9. Each of the slots 21-11 thru 21-13 holds a driver circuit 11 plus a chip assembly 10; and, the next slot 21-14 holds one pattern generator 12 plus its memory 13. The pattern generator in slot 21-14 is coupled to three driver circuits in slots 21-11 thru 21-14 by a bus 12a; and on that bus, the pattern generator in slot 21-14 broadcasts bit-serial test signals to all three of the chip driver circuits that are in slots 21-11 thru 21-13. Each of the memories 13 in the slots 21-8, 21- 10, and 21-14 store different sequences of several types of instructions which define the bit-serial test signals that are broadcast by the pattern generators 12. Three different types of the instructions are shown in Fig. 3. Instruction 31 is of a first type; instruction 32 is of a second type; and instruction 33 is of a third type. Each first type instruction 31 includes a word WO which contains an operation code OP, a word count WCNT, and a bit count BCNT. When the operation code has a particular value of OPl, instruction 31 causes a bit stream TDI to be written into a DATA REGISTER that is in the chip 10a that is tested. When the operation code has another particular value of OP2, instruction 31 cause the TDI bit-stream to be written into an INSTRUCTION REGISTER that is in the chip 10a. For both of the operation codes OPl and OP2, the TDI bit stream which is to be written is specified within instruction 31 as shown in Fig. 3. This TDI bit stream starts immediately after word W0 and it has a length that varies in increments of one bit. The total number of bits in the TDI bit stream is (WCNT-1) (X)+BCNT, where X is the number of bits per word. All bits in the last word which do not specify the TDI bit stream are unused. Each second type instruction 32 includes a word W0 which contains an operation code, a word count WCNT, and a bit count BCNT. When the operation code has a particular value of OP3, instruction 32 causes the content of the DATA REGISTER in the chip 10a to be read and selectively compared with a data stream in the instruction. When the operation code has another particular value of 0P4, instruction 32 causes the content of the INSTRUCTION REGISTER in the chip 10a to be read and selectively compared with a data steam in the instruction. F or both of the operation codes OP3 and OP4, two bit streams ETDO and MASK are specified within the instruction 32 for use in the compare operation. Those two bit streams begin immediately after word WO, and they are interleaved word-by-word as shown in Fig. 3. If the i-th bit in the MASK bit stream is a "1", then the i-th bit which is read from the chip takes part in the compare operation; and that particular bit from the chip is compared to the i-th bit in the ETDO bit stream. Each of the bit streams ETDO and MASK are variable in length, and the total number of bits in each of those bit streams is (WCNT-1) (X)+BCNT. All of the bits in the last two words which do not specify the ETDO and MASK bit streams are -unused. Each third type instruction 33 includes a word WO which contains an operation code OP, a word count WCNT, and a bit count BCNT. When the operation code has a particular value of OP5, instruction 33 causes a bit stream TDI to be written into a DATA REGISTER in the chip 10a, and concurrently, instruction 33 causes the content of the DATA REGISTER in the chip 10a to be read and selectively compared with a data stream in the instruction. When the operation code has another particular value of OP6, instruction 33 causes the TDI bit stream to be written into the INSTRUCTION REGISTER in the chip 10a, and concurrently, instruction 33 causes the content of the INSTRUCTION REGISTER in the chip 10a to be read and selectively compared with a data stream in the instruction. For both of the operation codes OP5 and OP6, the TDI bit stream is specified within the instruction 33; and, two other bit streams ETDO and MASK are also specified within the instruction for use in the compare operation. These three bit streams begin immediately after word W0, and they are interleaved word-by-word as shown in Fig. 3. If the i-th bit in the MASK bit stream is a "1", then the i-th bit which is read from the chip takes part in the compare operation; and that particular bit from the chip is compared to the i-th bit in the ETDO bit stream. Each of the three bit streams TDI, ETDO, and MASK are variable in the length; and the total number of bits in each of those bit streams is (WCNT-1) (X) + (BCNT) . All of the bits in the last three words which do not specify the TDI, ETDO and MASK bit streams are unused. when the pattern generator 12 executes each of the instructions 31, 32, and 33, it also generates an additional bit stream which is not stated within the Fig. 3 instruction. That additional bit stream is used as a control signal, called TMS, which places the chip 10a in particular states that selectively read the DATA REGISTER, write the DATA REGISTER, read the INSTRUCTION REGISTER, or write the INSTRUCTION REGISTER. Each TMS bit stream is generated in response to the operation codes OP1-OP6 which specify that either the instruction register or the data register should be used, and the WCNT and BCNT counts which determine the number of bits in the TMS signal . Fig. 4 shows an example of how the three types of instructions 31, 32 and 33 are stored in different sequences within each memory 13 for a pattern generator 12. In the Fig. 4 example, the sequence of instructions is I(k), l(k+l), . . . etc. Instructions I(k+1) and l(k+3) are of the first type 31; instructions I(k) and I(k+4) are of the second type 32; and instructions I(k+2) and I(k+5) are of the third type 33. Each first type instruction 31 is identified by an operation code of OPl or OP2, and it specifies a single variable length bit stream TDI. Each second type instruction 32 is identified by an operation code of OP3 or OP4, and it specifies two variable length bit streams ETDO and MASK. Each third type instruction 33 is identified by an operation code of OP5 or OP6, and it specifies three variable length bits streams TDI, ETDO and MASK. A respective series of bits which are not used (NU) start immediately after each serial bit stream and end on a word boundary; and that enables the next instruction in the sequence to always start on a word boundary. Turning now to Fig. 5, the details of the circuitry that is within each pattern generator 12 will be described. That circuitry includes a sequential state machine 40, a counter 41, a set of seven registers 42-48, a multiplexer 49, and an oscillator 50. All of those components 40-50 are interconnected to each other as shown. Counter 41, as well as each of the registers 42-48, has a set of data inputs D and a clock input C. To store the data on the inputs D into the counter or a particular register, the state machine 40 sends a clock pulse to the clock input C. Counter 42 also has a countdown input CD; and, the counter decrements its stored count by one when a pulse is received on the CD input . In operation, each of the components 41-48 is used by the state machine 40 to store the following information. Register 42 stores the operation code OP which occurs in the first word W0 of the Fig. 3 instructions 31, 32 and 33. Counter 41 stores the word count WCNT, and register 43 stores the bit count BCNT, which occurs in the first word W0 of each of the Fig. 3 instructions . Register 44 stores one word of the bit stream TDI that occurs in the instructions 31 and 33 of Fig. 3. Register 45 stores one word of the bit stream ETDO which occurs in the instructions 32 and 33 of Fig. 3. And, register 46 stores one word of the bit stream MASK which occurs in the instructions 32 and 33 of Fig. 3. Register 47 stores one word of the additional bit stream TMS that is internally generated by the pattern generator 12 during the execution of the Fig. 3 instructions. Register 48 is a general purpose register which stores various control bits that are used internally by both the pattern generator 12 and the chip driver circuits 11 in a manner which will be described shortly. At the start of the execution of one of the Fig. 3 instructions, the pattern generator 12 reads the first word WO of the instruction from the memory 13. To perform that read operation, the state machine 40 sends a memory address MADDR on a set of address lines 40a that go to port 13a of the memory 13 that is shown in Fig. 1. In response, port 13a of the memory 13 sends the addressed word as memory data MDATA on a set of data lines 40b back to the state machine 40. Then, the state machine 40 sends a clock pulse on three clock lines 40c- 40e to store the OP code in register 42, store the word count WCNT in counter 41, and store the bit count BCNT in register 43. Thereafter, the state machine 40 examines the OP code which is in register 42. If the OP code in register 42 indicates that the instruction is of a type which includes a TDI data stream, then the first word of that data stream is read from the memory 13 and stored in register 44. If the OP code in register 42 indicates that the instruction is of a type which includes an ETDO data stream, then the first word of that data stream is read from the memory 13 and stored in register 45. If the OP code in register 42 indicates that the instruction is of a type which includes a MASK data stream, then the first word of the MASK data stream is read from the memory 13 and stored in register 46. The above data stream words are obtained one at a time via the pattern generator state machine 40 by sequentially sending a memory address on the address lines 40a, and receiving the addressed word back from the memory 13 on the data lines 40b. Each received word from t h e memory 13 is stored in the appropriate register 44, 45, or 46 by sending a clock pulse on one of the clock lines 40f, 40g or 40h. Following the above operation, the state machine 40 internally generates one word of the additional bit stream TMS that was previously described. That internally generated word of the TMS bit stream is sent on a set of signal lines 40i, and it is loaded into the TMS register 47 by a clock pulse on a clock line 40j . Thereafter the state machine 40 uses the multiplexer 49 to sequentially pass the output of the registers 44-47, that were previously loaded, onto a set of data lines 55, which carry data signals called JDATA. To pass the output of a particular register through the multiplexer 49, the state machine 40 generates controls signals, called SEL(i), on a set of control lines 40k that go to the multiplexer 49. While the output of a register is sent on the JDATA lines 55, the state machine 40 also generates address signals, called JADDR, on a set of address lines 56; and those address signals determine the destination for the JDATA signals. To indicate when the JDATA signals and JADDR signals are being sent, the state machine 40 sends a pulse called JSTROBE on a clock line 57. Also, the state machine 40 sends a free running clock called BUSCK on a clock line 58. All of the lines 55-58 together constitute the bus 12a which is shown in Figs. 1 and 2 that connect the pattern generator 12 to a selectable number of chip driver circuits 11. Next, with reference to Fig. 6, the details of the circuitry that is within each of the chip driver circuits 11 will be described. That circuitry include an address decoder 60, a set of five registers 61-65, a set of four parallel-to-serial shift registers 66-69, a shift control circuit 70, and a variable delay line 71. All of the components 60-71 are interconnected to each other as shown in Fig. 6. Each of the registers 61-65 has a set of data inputs D, and enable input E, and a clock input C. The data inputs D receive the data signals JDATA from the Fig. 5 pattern generator, and the clock input C receives the JSTROBE clock pulse from the pattern generator. To store the JDATA signals into a particular register 61-65, a separate enable signal E1-E6 is sent to the enable input E of that register. All of the enable signals E1-E5 for the registers 61-65 are generated by the address decode circuit 60 on a set of signal lines 60a-60e. Enable signal El is sent to register 61; enable signal E2 is sent to register 62; etc. These enable signals E1-E5 are generated in the address decoder 60 by decoding particular addresses on the JADDR address lines 56. In operation, the pattern generator state machine 40 of Fig. 5 sends the JADDR, JDATA, and JSTROBE signals such that the registers 62-65 store the following information. One word of the MASK bit stream is stored in register 62; and that word is sent from the Fig. 5 register 47 through the multiplexer 50. One word of the TDI bit stream is stored in register 63; and that word is sent from the Fig. 5 register 44 through the multiplexer 50. One word of the ETDO bit stream is stored in register 64; and that word is sent from the Fig. 5 register 45 through multiplexer 50. One word of the TMS bit stream is stored in register 65; and that word is sent from the Fig. 5 register 47 through the multiplexer 50. Each of the registers 62-65 is respectively coupled to a data input D on one of the parallel-to- serial shift registers 66-69. Those parallel-to-serial shift registers also have a LOAD input L and a CLOCK input C. If the LOAD signal on the input L is in a "1" state when the clock input C receives the rising edge of the SERIALCK clock signal, then all of the data input signals are stored in the parallel-to-serial shift registers 66-69. Otherwise, if the LOAD signal is in a "0" state when the rising edge of the SERIALCK clock signal occurs, then all of the registers 66-69 shift out one bit of the data which they store. Both the LOAD signal and the SERIALCK clock signal are generated by the shift control circuit 70; and it operates in response to the enable signal E5 which enables a word of the TMS bit stream to be loaded into register 65. After the enable signal E5 causes the TMS register to be loaded, the shift control circuit 70 starts to generate the SERIALCK clock signal on line 70a. This is done by gating the bus clock signal BUSCK from clock line 58 to clock line 70a. For the first cycle of the SERIALCK clock signal, the shift control circuit 70 sends the LOAD signal as a "1" to all of the serial-parallel registers 66-69; and that causes the registers 66-69 to store one word of the bit streams that are held in the registers 62-65. Then, the shift control circuit 70 generates the LOAD signal as a "0" which causes each of the parallel- to-serial registers 66-69 to shift out the word of the bit streams that they have stored. Each bit from the registers 66-69 is shifted in synchronization with the SERIALCK clock. The MASK bit stream is shifted onto signal line 66a; the TDI bit stream is shifted onto signal line 67a; the ETDO bit stream is shifted onto signal line 68a; and the TMS bit stream is shifted onto signal line 69a. This shifting continues, in response to the "0" state of the LOAD signal, until each of the shift registers 66-69 is emptied. I f any one of the bit streams MASK, TDI, ETDO and TMS extend into a second word, those words will be read from the memory 13 and loaded into the registers 62- 65 by the pattern generator state machine 40, while the above shifting occurs. In that case, the shift control circuit 70 will remember that the enable signal E5 was again sent for a second time to the TMS register 65. Later, when the shift register 66-69 become empty, the shift control circuit 70 will check to see if the second enable signal E5 was sent. If it was, the shift control circuit 70 will again send the LOAD signal as a "1" to all of the serial-parallel registers 66-69; and that will cause registers 66-69 to store the second word of the bit streams that are held in the registers 62-65. Then, the shift control circuit 70 will generate the LOAD signal as a "0" until each of the parallel-to- serial registers 66-69 shift out the second word of the bit stream that they have stored. The above loading and shifting continues until the end of the serial bit streams is reached for an instruction in the memory 13. Then, when the last bit of the bit streams is shifted from the registers 66-69, the shift control circuit 70 stops generating the clock signal SERIALCK on the clock line 70a. In addition to all of the above-described operations, the chip driver circuit of Fig. 6 also generates a clock signal TCK on a clock line 71a. This TCK clock signal is a delayed replica of the BUSCK signal on line 53; and it is generated by the variable delay circuit 71. The amount of delay through the variable delay circuit is selected by control signals on signal lines 61a that are stored in register 61. Referring next to Fig. 7, it illustrates the overall sequence in which each instruction in Fig. 3 is executed by the pattern generator of Fig. 5 and the chip driver circuit of Fig. 6. Initially, the pattern generator state machine 40 is in state SI where it reads the first word WO of an instruction from its memory 13. Thereafter, in state S2, the state machine 40 examines the operation code in register 42 to determine the type of the instruction that it is executing. If the instruction is of a first type 31 or a third type 33, then the state machine 40 reads one word of the TDI bit stream; and this occurs in state S3. That word is stored is register 44 by the state machine 40. If the instruction is of a second type 32 or a third type 33, then the state machine 40 reads one word of the ETDO bit stream; and this occurs in state S4. That word of the ETDO bit stream is stored in register 45 by the state machine 40. Also if the instruction is of a second type 32 or a third type 33, then the state machine 40 reads one word of the MASK bit stream; and this occurs in state S5. That word of the MASK bit stream is stored in register 46 by the state machine 40. Thereafter, the state machine 40 internally generates one word of the TMS bit stream; and this occurs in state S6. That word of the TMS bit stream is stored in register 47 by the state machine 40. Next in state S7, the state machine 40 broadcasts one word of the TDI bit stream if it is executing a first or third type instruction 31 or 33. This word of the TDI bit stream is sent from register 44 through the multiplexer 49 and into register 63 of each chip driver circuit that is connected to the pattern generator. Next in state S8, the state machine 40 broadcasts one word of the ETDO bit stream if it is executing a second or third type instruction 32 or 33. This word of the ETDO bit stream is sent from register 45 through the multiplexer 49 and into register 64 of each chip driver circuit that is connected to the pattern generator. Next in state S9, the state machine 40 broadcasts one word of the MASK bit stream if it is executing a second or third type instruction 32 or 33. This word of the MASK bit stream is sent from register 46 through the multiplexer 49 and into register 62 of each chip driver circuit that is connected to the pattern generator. Next in state S10, the state machine 40 broadcasts one word of the TMS bit stream. This word of the TMS bit stream is sent from register 47 through the multiplexer 49 and into register 65 of each chip driver circuit that is connected to the pattern generator. Then in state Sll, the state machine 40 decrements the word count WCNT in counter 41 by one and checks to see if the result is zero. If the result is not zero, all of the operations in states S3-S10 are repeated. Otherwise, if the result is zero, the state machine 40 starts to execute the next instruction by entering state SI. Each time the state machine 40 broadcasts a word of the TMS bit stream in state S10, that event is remembered by the shift control circuit 70 in each chip driver circuit that is connected to the pattern generator. Then, if the parallel-to-serial shift registers 66-69 are empty, they are loaded with the content of the holding register 62-65. That occurs when the chip driver circuits are in a state S21. Thereafter, the content of the parallel-to- serial shift registers 66-69 are shifted onto the signal line 66a-69a. That occurs when the chip driver circuits is in a state S22. Then, when the last bit in the shift registers 66-69 is being shifted out, the shift control circuit 70 checks to see if register 65 has been loaded with another word of the TMS bit stream. If it has, the load and shift operations of states S21 and S22 are repeated. When the bit streams of TDI, ETDO, MASK, and TMS are several words long, then the states S21 and S22 in chip driver circuits 11 occur concurrently with the states S3-Sll in the pattern generator 12. Due to that concurrent operation, the chip driver circuits 11 and the pattern generator 12 act as a multi-stage pipeline in which the chip driver circuits shift the bits from one word of the bit streams while the pattern generator reads and broadcasts the next word of the bit streams. Also, when the pattern generator state machine 40 starts to execute the next instruction, the chip driver circuits 11 continue in state S22 to shift any bits that remain in the parallel-to-serial shift registers 66-69. Due to that concurrent operation, the chip driver circuits 11 and the pattern generator 12 again act as a multi-stage pipeline in which the chip driver circuits shift the bits in the bit streams of one instruction while the pattern generator is reading and decoding word WO of the next instruction. Turning now to Fig. 8, it shows additional details on how each chip driver circuit is intercoupled with the integrated circuit chips that are tested. In Fig. 8, reference numeral 10 identifies the same chip assembly that is shown in Figs. 1 and 2; and reference numeral 10a identifies the chips in the assembly 10 that are to be tested. For each chip 10a that is to be tested in the assembly 10, a separate set of four transmitters 81-84 plus one receiver 85 is provided in the chip driver circuit 11. Each transmitter 81 sends the clock signal TCK from line 71a to a separate chip 10a. Each transmitter 82 sends the bit stream TDI from line 67a to a separate chip 10a. Each transmitter 83 sends the bit stream TMS from line 69a to a separate chip 10a. And, each transmitter 84 sends a respective high frequency clock HF CK (i), which will be described later in conjunction with Figs. 9 and 10, to a separate chip 10a. In response to the signals that are received from the transmitters 81-84, each chip 10a in the assembly 10 generates a separate output bit stream which is called TDO. That TDO bit stream, from each chip 10a, is sent to a separate receiver 85 on the chip driver circuit. From the receivers 85, all of the TDO bit streams are processed in parallel by the remaining components 90-98 of the chip driver circuit which are shown in Fig. 8. Component 90 in Fig. 8 is an EXCLUSIVE-OR gate; component 91 is an AND gate; and component 92 is a flip- flop. A separate set of the components 90-92 is provided for each of the receivers 85. Component 93 in Fig. 8 is a multiplexer; component 94 is a decoder circuit; component 95 is a variable delay circuit; component 96 is a register; component 97 is a decoder circuit; component 98 is a register; and component 99 is a decoder circuit. in operation, the bit streams ETDO, MASK, and TCK are sent through the variable delay circuit 95 to thereby generate three corresponding delayed bit streams which are called DETDO, DMASK, and DTCK respectively. The amount of delay through the variable delay circuit 95 is selected by the output of register 96; and that delay compensates for a delay which occurs within each chip 10a that generates the TDO bit stream. To select a particular delay, register 96 is loaded with the JDATA signals when the decoder circuit 97 detects a predetermined JADR address. From the delay circuit 95, the delayed bit stream DETDO is sent to all of the EXCLUSIVE-OR gates 90 where it is compared to the TDO bit streams that come from all of the receivers 85. If a miscompare occurs between any bit in the DETDO bit stream and the corresponding bit in the TDO(i) bit stream, then the EXCLUSIVE-OR gate 90 where the miscompare occurs will generate an output signal ERA(i) in a "1" state. Each of the error signals ERA(i) from the EXCLUSIVE-OR gates 90 are sent to a separate one of the AND gates 91; and those AND gates also receive two other input signals. One such input signal is the delayed bit stream DMASK, and the other input signal is a separate enable signal EN(i) from register 98. If the error signal ERA(i) is a "1" for a particular bit in the TDO(i) bit stream and the corresponding bit in the DMASK signal is also a "1" and the enable signal EN(i) is also a "1", then the output signal ERB(i) from the i-th AND gate is a "1" . To ignore a miscompare in any one particular bit in the bit stream TDO(i), the corresponding bit in the DMASK bit stream to set to a "0". Also, an entire bit stream TDO(i) can be ignored by setting the corresponding enable signal EN(i) to a "0." When the error signal ERB(i) from any one of the AND gates 91 becomes a "1", that will cause the corresponding flip-flop 92 to become set. Each flip-flop 92 which becomes set will thereafter remain set until it is read and reset by the pattern generator 12. To read the error flip-flops 92, the pattern generator 12 sends a particular JADR address to the decoder circuit 94; and in response the decoder circuit 94 generates a signal on output 94a which passes the error signals from all of the flip-flops 92 through the multiplexer 93 onto the JDATA lines 50. Then the pattern generator 12 sends another JADR address which causes the decoder circuit 94 to generate a signal on output 94b that resets all of the flip-flops 92. Next, with reference to Fig. 9, several additional circuit components 100-109 which are included within each of the chip driver circuits 11 will be described. All of these components 100-109 interact to generate a separate high frequency clock signal HFCK(i) for each chip 10a that is being tested. In Fig. 9, component 100 is a free-running high frequency oscillator; component 101 is a decoder circuit; component 102 is a register; and component 103 is a divider circuit that divides by selectable integer N. Component 104 is a sequential state machine; component 105 is a counter circuit which holds a count for the state machine 104; and component 106 is a memory which holds control signals for the state machine 104. Component 107 is a flip-flop; component 108 is an OR gate; and component 109 is a transmitter. A separate set 110 (i) of the components 107-109 is provided for each high frequency clock signal HFCK(i) that is generated. In operation, the oscillator 100 generates a free running clock FRCKl at a single high frequency. That clock signal FRCKl is sent to the divider circuit 103 where it is reduced in frequency by a selectable integer N. Then, the output clock FRCK2 from the divider 103 is sent to each set 110 (i) of the circuits 107-109. Each set of circuits 110 (i) generates the high frequency clock signal HFCK(i) by passing selectable cycles of the free running clock FRCK2. Those cycles that are passed are selected by two control signals START(i) and STOP(i); and they are generated by the sequential state machine 104. When the signal STOP(i) is generated as a "1", the flip-flop 107 sets in synchronization with the free- running clock signal FRCK2. That set state of flip-flop 107 causes the output of OR gate 108 to constantly generate a "1"; and thus, the high frequency clock signal HFCK(i) will be stopped in a "1" state. To reset flip-flop 107, the state machine 104 generates the STOP(i) signal as a "0" and it generates the START(i) signal as a "1". That reset state of flip- flop 107 causes the OR gate 108 to pass the clock signal FR CK2; and from the output of OR gate 108, the high frequency clock FRCK2 passes through the transmitter 109 where it becomes the clock signal HFCK(i). In order to generate the control signals STOP(i) and START(i) for each set of the circuits 110 (i), the state machine 104 reads various control bits that are stored in the control memory 106. An example of those control bits is shown by the "l"s and "0"s in Fig. 10. To read one set of the control bits, the state machine 104 sends an address on address lines 104a to the memory 106; and in response, the memory sends the addressed set of control bits back to the state machine 104 on signal lines 104b. Fig. 10 shows an example where each set of control bits consists of sixteen bits which are identified as bits B1-B16. Each of the first fourteen bits B1-B14 control the operation of a particular one of circuits 110 (i) . Bit Bl controls the circuit 110(1); bit B2 controls circuit 110(2); etc. The remaining bits B15 and B16 are mode control bits which cause the state machine 104 to operate in either a sequence mode or a free-running mode. When the state machine 104 is sent a START command from the decoder 101 along with a particular memory address on the JDATA lines, it will read the set of control bits from the memory 106 at that address. If the state machine 104 reads a set of control bits in which bit B15 is a "1", then the state machine operates in the sequence mode. In that mode, the state machine 104 sequentially increments the address that it sends to the memory 106; and in response, the state machine receives the addressed set of control signals. This sequence mode of operation continues until a set of control bits is read in which bit B16 is a "1"; and then the sequence mode of operation stops . For each set of control signals that is read in the sequence mode, the state machine 104 examines the control bits B1-B14. Each of the bits B1-B14 that is a "1" causes the state machine 104 to generate the STOP(i) and START(i) signals such that circuit 110 (i) passes the clock FRCK2 for the number of cycles that is specified by the counter 105. In Fig. 10, the set of control bits that is read by the address "A" has bits B1-B4 set to a "1". Thus, in response to that set of control bits, the state machine 104 will cause each of the circuits 110(1) through 110(4) to pass the clock signal FRCK2 for the number of cycles that is specified by the counter 105. Next, the set of control bits that is read by the address "A+l" has bits B5-B7 set to a "1". Thus, in response to that set of control bits, the state machine 104 will cause each of the circuits 110(5) through 110(7) to pass the clock signal FRCK2 for the number of cycles that is specified by the counter 105. Next, the set of control bits that is read by the address "A+2" has bits B8-B11 set to a "1". Thus, in response to that set of control bits, the state machine 104 will cause each of the circuits 110(8) through 110(11) to pass the clock signal FRCK2 for the number of cycles that is specified by the counter 105. Lastly, the set of control bits that is read by the address "A+3" has bits B12-B14 set to a "1". Thus, in response to that set of control bits, the state machine 104 will cause each of the circuits 110(12) through 110(14) to pass the clock signal FRCK2 for the number of cycles that is specified by the counter 105. By comparison, if the state machine 104 reads a set of control bits in which bit B15 is a "0", then the state machine operates in the free-running mode. In that mode, the state machine 104 does not increment the address that it sends to the memory 106; but instead, the state machine operates continuously with just the one set of the control signals that it read. using that single set of control signals, the state machine 104 again examines the control bits B1-B14. Each of the bits B1-B14 that is a "1" causes the state machine 104 to generate the STOP(i) and START(i) signals such that circuit 110 (i) passes clock FRCK2 continuously. To end this free-running mode of operation, the state machine 104 needs to be sent a STOP command from the decoder 101; and that command is sent when the decoder 101 receives a particular JADR address. In Fig. 10, the set of control bits that is read by the address "A+4" has bit B15 set to a "0"; and that will place the state machine 104 in the free-running mode. Also in the set of control bits at address "A+4", all of the bits B1-B14 are set to a "1"; and so in response, the state machine 104 will cause each of the circuits 110(1) thru 110(14) to continuously pass the clock signal FRCK2 until a STOP command is received. Similarly in Fig. 10, the set of control bits that is read by address "A+5" also has B15 set to a "0"; and that will place the state machine 104 in the free- running mode. However, in the set of control bits at address "A+5", only bit B2 is set to a "1"; and so in response, the state machine 104 will cause only circuit 110(2) to continuously pass the clock signal FRCK2. One particular feature which is achieved with the circuitry of Figs. 9 and 10 is that it enables the chips 10a in the chip assembly 10 to be tested concurrently as one set or sequentially in selectable subsets. This feature is desirable when the chips 10a which are being tested are of a type that dissipate a large amount of power when they receive the high frequency clock signal HFCK(i), but dissipate substantially less power when they do not receive the high frequency clock signal. Such chips include for example CMOS microprocessor chips and CMOS memory chips. By limiting the number of chips 10a that simultaneously receive the high frequency clock signal HFCK(i), the total amount of power that is dissipated in all of the chips 10a can be kept below any predetermined power limit which would otherwise be exceeded if all of the chips received the high frequency clock signal. Another particular feature which is achieved with the circuitry of Figs. 9 and 10 is that it enables a unique stream of bits to be written into each of the chips 10a separately. That is achieved by storing control bits in the memory 106 which cause the high- frequency clock signal HFCK(i) to be sent to each of the chips 10a one at a time. Then when one particular chip is receiving the high frequency clock signal HFCK(i), the data that is to be written into that chip is sent as a TDI bit stream to all of the chips 10a. This feature is desirable when certain unique information, such as a serial number, needs to be written into each chip 10a that is being tested. Turning now to Fig. 11, it shows three additional instructions 34, 35 and 36 which can be included in a chip testing program in the memory 13, along with the previously described instruction 31, 32, 33 of Fig. 3. Instruction 34 is an internal control instruction which consists of only a single word W0 that includes an operation code OP7, a JADR field 34a, and a JDATA field 34b. When instruction 34 is executed by the pattern generator 12, the state machine 40 sends the JADR field 34a on to the JADR signal lines 56 and it sends the JDATA field 34b on to the JDATA signal lines 55. Instruction 34 can be used to load register 61 in Fig. 6, to load registers 96 and 98 in Fig. 10, and to load register 102 in Fig. 9. Also instruction 34 can be used to send an address to the decoder 94 in Fig. 8, to send a count to the counter 105 in Fig. 9, to write each set of control bits in the control memory on 106. Also instruction 34 can be used to send START and STOP commands from the decoder 101 to the state machine 104. Instruction 35 is a branch instruction which also consists of only a single word W0. Instruction 35 includes an operation code OP8, a test condition field 35a, and a jump address field 35b. When instruction 35 is executed by the pattern generator 12, the state machine 40 tests a condition which is specified by the test condition field 35a. If that tested condition is true, then the next instruction that is executed from the memory 13 occurs at the address of the branch instruction 35 minus the jump address in field 35b. Instruction 36 is a write memory instruction that also consists of single word W0. Instruction 36 includes an operation code OP9 which identifies it as the write memory instruction, and it includes a memory address field 36a. When instruction 36 is executed by the pattern generator 12, the error signals are read from multiplexer 93 in Figure 8 and written into memory 13 at the memory address field 36a. One preferred embodiment of the base system which tests integrated circuit chips has now been described in detail. In addition, however, various changes and modifications can be made to the details of this embodiment. For example, Figure 2 illustrates just one example where the chip testing system is housed in a rack 20 which has a total of fourteen slots. But as a modification, the rack 20 can have any number of slots; and there can be multiple racks. Also, the slots in each rack can be filled with any combination of the chip assembly 10, the driver circuit 11, and the pattern generator 12 together with its respective memory 13. S imilarly, Figure 1 shows just one example where each chip assembly 10 holds only four of the integrated circuit chips 10a that are to be tested. But as a modification, each chip assembly 10 can hold any desired number of the integrated circuit chips 10a. Also, as another modification, each of the modules 11, 12, 13 and 14 that are shown in Figure 1 can be constructed of any type of circuitry. For example, all of the circuitry in the chip driver circuit 11 and all of the circuitry in the pattern generator 12 (as is shown in detail in Figures 5, 6, 8, 9, and 10) can be constructed of TTL circuits, ECL circuits, MOS circuits, and CMOS circuits. Likewise, each memory module 13 of Figure 1 can be constructed of memory cells of any type, such as those which store data bits in flip-flops or in a capacitor or on a magnetic storage media or on an optical storage media. Likewise, each of the sequential control circuits that are in the illustrated chip testing system can have any type of internal construction. Those sequential control circuits include the pattern generator state machine 40 in Figure 5, the shift control circuit 70 of Figure 6, and the clock sequence state machine 104 of Figure 9. Any internal structure for the pattern generator state machine 40 is suitable so long as it operates in accordance with states Sl-Sll of Figure 7. Any internal structure for the chip control circuitry 70 is suitable so long as it operates in accordance with states S21-S23 of Figure 7. And, any internal structure for the clock sequence state machine 104 of Figure 9 is suitable so long as it operates in a sequence mode and a free running mode as described in conjunction with Figure 10. Also, as another modification, the number of bits which are read as a word from each memory module 13 can be any predetermined number. Figure 3 shows that each word in the memory module 13 consists of "X" bits. Suitably, X is an integer number of bytes, such as 16 bits, 32 bits, 48 bits, 64 bits, etc. Further, as another modification, each TMS bit stream which is generated to put the chips 10a that are tested in a particular state, can be any predefined series of bits. What each bit stream needs to be is determined by the internal structure of the chips 10a. As one specific example, the TMS bit streams can be predefined and generated as is shown below in TABLE 1A. TABLE 1A TMS Header State of chip 10a in response to Header 010000 Read INSTRUCTION REGISTER 011000 Write INSTRUCTION REGISTER 011100 Read DATA REGISTER 011110 Write DATA REGISTER Each TMS header in TABLE 1A is followed by a series of "1" bits which equals the number of TDO bits that are read from the INSTRUCTION/DATA REGISTER, or the number of TDI bits that are written into those registers. That series of "1" bits is followed by a series of "0" bits which continues until the next TMS header starts. As another example, each TMS bit stream can be predefined and generated in accordance with any desired standard. One such standard is the IEEE 1149.1 Boundry Scan Standard, which is herein incorporated by reference. In addition. Fig. 12 shows still another modification whereby all four of the bit streams TDI, ETDO, MASK and TMS that are sent by the pattern generator are expressly specified within an instruction 37. This instruction 37 is identified by an operation code of OP10 in the first word W0. Instruction 37 includes one new TMS field which specifies the TMS bit stream that is to be sent. All of the other fields BCNT, WCNT, TDI, ETDO and MASK are the same as the corresponding fields that were previously described for instruction 33 of Fig. 3. By being able to expressly define the TMS bit streams within instruction 37, a single pattern generator 12 can sequentially test different types of chips which require different TMS bit streams to enter the same state. However, if the chips that are being tested all use the same TMS signal sequences, then instruction 33 is preferred over instruction 37 because instruction 33 occupies 25% less memory space. As another modification, any one of the bit streams TDI, ETDO, and MASK in instruction 37 can be removed from that instruction. If the TDI bit stream is removed, then the result is similar to the previously described instruction 32 of Fig. 3, except that the TMS bit stream can be specified as desired. If the EDTO and MASK bit streams are removed from instruction 37, then the result is similar to the previously described instruction 31 of Fig. 3, except that the TMS bit stream can again be specified as desired. Now in accordance with the present invention, a modified system will be described in which one or more additional modules, which are herein called an algorithmic pattern generator (APG) , are incorporated into the above-described chip testing system of Fig. 1. This modified system is illustrated in Fig. 13. There, modules 10, 11 and 14 of Fig. 1 are repeated; module 12 and 13 are modified to modules 12' and 13'; and the newly added APG modules are identified by reference numeral 200. Fig. 13 shows one particular embodiment where a separate APG module 200 is coupled via a separate interface 201 to every one of the previously described modules 12 ' . Alternatively, however, a separate APG module 200 may be coupled via its separate interface 201 to any subset of the modules 12'. For example, only one of the modules 12' may be coupled to an APG module 200. In operation, each APG module 200 internally generates the TDI, ETDO, and MASK test signals which test the chips 10a that are in the chip assemblies 10. To internally generate those test signals, the APG module 200 performs a complex sequence of operations, and those operations are specified by APG instructions in the memory 13'. These APG instructions, and the circuitry which executes them within the APG module 200, will be described herein in detail in conjunction with all of the Figs. 13 thru 22. One particular benefit which is achieved by generating the TDI, ETDO and MASK test signals internally within the APG module 200 is that the amount of storage which is required in the memory 13' is greatly reduced. This benefit tends to increase as the total number of bits which are in the test signals increases. For example, if the TDI, ETDO and MASK test signals contain a total of one billion bits, then the APG module 200 might require less than one thousand bits of storage in the memory 13 ' to store the APG instructions for generating all of the test bits. By comparison, if all of the test bits are stored in the memory 13', then one billion bits of storage would be required. On the other hand, as the total number of bits in the TDI, ETDO, and MASK test signals decreases, then the previously described circuitry of Figs. 1 thru 12 tends to provide a more economical means for presenting those test signals to the chips 10a. Accordingly, the modified system of Fig. 13 has two modes of operation. In the first mode, the module 12' reads the test signals TDI, EDTO, and MASK from the memory 13' and sends them to the chips 10a in serial bit streams, as was previously described in conjunction with Figs. 1-12. In the second mode of operation, module 12' reads the APG instructions from the memory 13' and passes them to the APG module 200 for execution. During the execution of those APG instructions, the APG module 200 sequentially generates words of the TDI, ETDO and MASK bit streams and it sends them to the module 12 ' . Then within the module 12 ' , the words of the test signals are converted to the serial bit streams that are sent to the chips 10a. Turning now to Fig. 14a, one preferred internal structure for the APG module 200 will be described. With this particular structure, the APG module 200 is comprised of a three stage pipeline; and those stages are identified by reference numerals 210, 220 and 230. The first stage 210 is an arithmetic-logic stage (ALS); the second 220 is a scrambler stage; and the third stage 230 is a formatter stage. These three stage 210, 220, and 230 operate under the control of a control unit 240. In operation, the ALS stage 210 and the scrambler stage 220 and the formatter stage 230 run concurrently; and during that concurrent operation, each stage of the pipeline performs different operations on different sets of data. To enable these concurrent operations to occur, each stage of the pipeline is provided with its own set of input registers and its own set of output registers. All of the input registers for the ALU stage are identified by reference numeral 210a. These input registers 210a are partitioned into three sets, with four registers in each set. The "X" set consists of registers XA, XB, XC, and XD; the "Y" set consists of registers YA, YB, YC, and YD; and the "Z" set consists of registers ZA, ZB, zc, and ZD. Starting with the content of its input registers 210a, the ALU stage performs various arithmetic and logical operations; and it stores the results of those operations in its output registers 210b. Those output registers are partitioned into two sets of five registers each. The first set consists of registers Xl A ', Y1A', Z1A', XlD', and Y1D'; and the second set consists of registers X2A', Y2A', Z2A', X2D' and Y2D' . Similarly, reference numeral 220a identifies all of the input registers of the scrambler stage 220. A separate input register is provided in the scrambler stage for each of the output registers 210b in the ALU stage. For example, input register XlA corresponds to output register XlA'; input register YlA corresponds to output register YlA'; etc. At certain times during the operation of the APG pipeline, the contents of all of the output registers 210b from the ALU stage 210 are transferred to the corresponding input registers 220a of the scrambler stage 220. Then, the scrambler stage 220 performs various scrambling operations on the content of its input registers, and it stores the result in its output registers 220b. Those output registers are partitioned into two sets of three registers each. The first set consists of registers XI', Yl', and Dl'; and the second set consists of registers X2', Y2', and D2'. Likewise, all of the input registers of the formatter stage 230 are identified by reference numeral 230a; and, a corresponding input register is provided for each output register of the scrambler stage. For example, input register XI corresponds to output register XI'; input register Yl corresponds to output registers Yl'; etc. At certain times, the content of the output registers 220b from the scrambler stage are transferred to the input registers 230a of the formatter stage. After that occurs, the formatter stage performs various operations on the content of its input registers; and that generates several words of each of the tests signals TDI, ETDO, and MASK. Those test signals are stored, one word at a time, in the formatter output registers 230b. These output registers 230b are labeled ATDI, AETDO, and AMASK in order to indicate that they hold the TDI, ETDO, and MASK signals which are internally generated in the APG. All of the operations which are performed in each of the pipeline stages 210, 220, and 230 are controlled by respective sets of control signals that are sent from the control unit 240 to each of the stages. The control signals that are sent to the arithmetic logic stage 210 occur on a set of conductors 211; the control signals that are sent to the scrambler stage 220 occur on a set of conductors 221; and the control signals that are sent to the formatter stage 230 occur on a set of conductors 231. Each of the pipeline stages 210, 220, and 230 also sends response signals back to the control unit 240. The response signals that are sent by the arithmetic logic stage 210 occur on a set of conductors 212; the response signals that are sent by the scrambler stage 220 occur on a set of conductors 222; and the response signals that are sent by the formatter stage 230 occur on a set of conductors 232. Also, the control unit 240 utilizes the APG interface 201 to interact with the module 12' of Fig. 13; and the details of the interface connections are shown at the top portion of Fig. 14A and the bottom left portion of Fig. 14B. Fig. 14B is similar to Fig. 5 which was previously described. But, Fig. 14B also includes four additional components 250-253 which operate with the APG interface 201, and it includes a modified state machine 40' which interacts with the added components. Component 250 is a register which receives the APG instructions from the memory 13 in Fig. 13; and those instructions are sent on a set of conductors 201a from register 250 to the APG control circuit 240. Component 251 is a 4x1 multiplexer which receives four different inputs from four sets of conductors 201b, 201c, 201d, and 40b. The conductors 201b carry a word of the TDI test signals that come from the formatter output register ATDI; the conductors 201c carry a word of the ETDO test signals that come from the formatter output register AETDO; and the conductors 2Old carry a word of the MASK signals that come from the formatter output register AMASK. Components 252 and 253 are respective counters which are described later in conjunction with Figs. 21 and 22. When the APG is generating the TDI, ETDO and MASK test signals, those signals are passed through the multiplexer 251 and loaded into the registers 44, 45, and 46. Conversely, when the TDI, ETDO, and MASK test signals are being read from the memory 13', those test signals are passed from the conductors 40b through the multiplexer 251 into the registers 44, 45, and 46 (as was previously described in conjunction with Fig. 5) . Two other sets of conductors 201e and 201f are also included in the APG interface 201. On the conductors 201e, various timing and control signals are sent from the state machine 40' in Fig. 14B to the APG control circuit 240 in Fig. 14A. For example, those control signals tell the control circuit 240 when the APG instructions are present on the conductors 201a. On the conductors 201f, various timing and control signals are sent from the APG control circuit 240 of Fig. 14A to the state machine 40' of Fig. 14B. For example, those control signals tell the state machine 40' when the formatter stage 230 has generated a word of the TDI, ETDO, and MASK test signals on the conductors 201b, 201c, and 201d. With reference now to Figs. 15A-15B, the details of a preferred embodiment of the ALU stage 210 will be described. This particular embodiment is comprised of all of the components which are identified in Figs. 15A-15B by reference numerals 210a thru 210p; and each of those components is described below in Table 2. TABLE 2 Component Description 210a Component 210a, in Fig. 15A, consists of all of the input registers for the ALU stage 200. They are partitioned into the "X" set XA, XB, XC and XD; the "Y" set YA, YB, YC and YD; and the "Z" set ZA, ZB, ZC and ZD. These input registers are the same input registers that are shown in Fig. 14A. Each register has a data input D and an output Q. 210b Component 210b, in Fig 15B, consists of all of the output registers for the ALU stage 200. They are partitioned into a first set XlA', YlA', Z1A', XlD', Y1D'; and a second set X2A', Y2A', Z2A', X2D', Y2D' . These output registers are the same output registers that are shown in Fig. 14A. Each register has a data input D and an output Q. 210c Component 210c, in Fig. 15A, is a read/write control circuit for the input registers 210a. By this control circuit, the contents of the input registers 210a are selectively read onto four busses called the A-bus, B-bus, C-bus, and D-bus. Also by this control circuit, data on a bus called the IN-bus is selectively written into the input registers 210a. The particular registers which get read and written are determined by the control signals OP21, XYZ, and DEST that occur on conductors 211a in the set 211, and by control signals OP22, XYZ, and ABCD that occur on conductors 211b in the set 211. 210d Component 210d, in Fig. 15B, is a write control circuit for a subset of the output registers 210b that consists of registers XlA', X2A', YlA', Y2A', ZlA', and Z2A' . One register is selected and written in response to control signals ADR which occur on a group of conductors 211c that are in the set 211. 210e Component 210e, in Fig. 15B, is a write control circuit a the subset of the output registers 210b that consists of registers XlD', X2D', Y1D', and Y2D' . One register is selected and written in response to control signals DDR which occur on a group of conductors 2lid that are in the set 211. 210f Component 210f, in Fig. 15A, is a six-by- one multiplexer. The inputs to this multiplexer 210f are the contents of the particular set of input registers 210a which are read onto the A-bus, B-bus, C-bus and D-bus as well as a set of all 0's and a set of all l's. This multiplexer 210f selectively passes one of its inputs to a bus, called J-bus, in response to control signals JSEL; and those signals occur on a group of conductors 211e that are in the set 211. 210g Component 210g, in Fig. 15A, is a six-by- one multiplexer. The inputs to this multiplexer 210g are the same as the inputs to multiplexer 210f. This multiplexer 21f selectively passes one of its inputs to a bus, called K-bus, in response to control signals KSEL; and those signals occur on a group of conductors 211f that are in the set 211. 210h Component 210h, in Fig. 15A, is an operational circuit which selectively performs the following operations: add with carry, add without carry, subtract with borrow, subtract without borrow, increment, decrement, exclusive or, exclusive nor, and, or, not, and no-op. Those operations are performed on the signals that are carried by the J-bus and K-bus. Each particular operation that is performed by component 210h is selected by control signals ALOP, which occur on a group of conductors 211g that are in the set 211. 210i Component 210i, in Fig. 15A, is a two-by- one multiplexer. One of the inputs to the multiplexer 210i comes from the operational circuit 210h, and the second input to the multiplexer 210i comes from a boundary check circuit 210k. Which particular input gets transferred to the multiplexer output is determined by a control signal, called CROSSED_B, that is internally generated in the boundary check circuit 210k. 210j Component 210j, in Fig. 15A, is a rotator circuit which selectively rotates the output from the multiplexer 210i. The result of that selective rotation is sent to a bus called the R-bus. The type of rotation that is performed by the rotator circuit 210j is selected by control signals ROTL which occur on a group of conductors 211h that are in the set 211. 210k Component 210k, in Fig. 15A, is a boundary check circuit. This circuit has an internal structure which is shown in detail in Fig. 15F; and the structure and operation of the boundary check circuit 210k is described herein in conjunction with that figure. 210L Component 210L, in Fig. 15A, is a two-by- one multiplexer. One input to the multiplexer 210L is the R-bus; and the second input to the multiplexer 210L is a group of conductors 211i that carry control signals DIRECT_D. Which particular input is passed through the multiplexer 210L to the IN-bus is determined by other control signals OP22 which occur on a group of conductors 211j . Both groups of conductors 211i and 211j are in the set 211. 10m Component 210m, in Fig. 15B, is a seven- by-one multiplexer. The inputs to this multiplexer 210m are the R-bus, A-bus, B- bus, C-bus, D-bus, a set of 0's, and a set of l's. These inputs are selectively passed through the multiplexer 210m in response to control signals OUTSEL which occur on a group of conductors 211k that are in the set 211. 210n Component 210n, in Fig. 15B, is an inverter circuit. This component inverts all of the output signals that come from the multiplexer 210m. 210o Component 210o, in Fig. 15B, is a two-by- one multiplexer. One of the inputs to the multiplexer 210o is the output of multiplexer 210m, and the other input is the output of the inverter circuit 210n. These two inputs to the multiplexer 210o are selectively passed through the multiplexer in response to control signals INV which occur on a group of conductors 211L that are in the set 211. 210p Component 210p, in Fig. 15B, is a seven- by-one multiplexer. The inputs to this multiplexer are the same as the inputs to the multiplexer 210m. Which particular input gets passed through the multiplexer 210m is determined by control signals DGENSEL that occur on a group of conductors 211m that are in the set 211. In Figs. 15A and 15B, many different control signals are shown as occurring on respective groups of conductors 211a-211m. All of those conductors are in the set 211 which come from the control unit 240. How those control signals are generated will now be described in conjunction with Figs. 15C and 15D. Considering first Fig. 15C, it shows one particular APG instruction 251 that is executed by all of the circuitry in Figs. 15A and 15B. This instruction 251 is received in the APG control unit 240 of Fig. 14A via the conductors 201a; and in response, the APG control unit 240 sends various control signals on the conductors 211 to stage 210 of Figs. 15A and 15B. The APG instruction 251 consists of two words W0 and Wl; and this particular instruction is identified by an operation code of OP21 which occurs in word W0. Word W0 of instruction 251 also includes an XYZ field which selects either the X set of registers, or the Y set of registers, or the Z set of registers from the input registers 210a in Fig. 15A. The contents of the particular set of registers that is selected are read concurrently onto the A-bus, B-bus, C-bus, and D-bus. Word Wl of instruction 251 contains several fields which specify all of the following control signals: DGENSEL, OUTSEL, JSEL, KSEL, DΞST, ALOP, INV, ROTL, CC, DDR, and ADR. Each of these control signals can have any one of several different values which are digitally encoded, and each value specifies a particular function as is shown in Fig. 15C. For example, when the JSEL signal has a value of "2", the content of the register that is on the C-bus is passed through multiplexer 210f. Likewise, when the ALOP field has a value of "5", the operational circuit 210h increments the data that is on the J-bus by one and passes the result to the O-bus. After, the content of the selected input registers are processed by all of the components 210f- 210p, the results are selectively stored into the input registers 210a and the output registers 210b. Which particular input register stores the result from the multiplexer 210L is selected by the DEST field; which particular output register stores the result from multiplexer 210o is selected by the ADR field; and, which particular output register stores the result from the multiplexer 210p is selected by the DDR field. Turning now to Fig. 15D, it shows another APG instruction 252 which is executed by the circuitry of Fig. 15A. This particular instruction 252 consists of two words WO and Wl; and it is identified by an operation code OP22 in word WO. By using the instruction 252, any one of the input registers 210a can be loaded with an initial value. One field XYZ in word WO selects either the X set, or the Y set, or the Z set of input registers; and another field ABCD in word WO selects one register in the selected set. Word Wl includes a data field DIRECTED that is directly written into the selected register. That data passes through the multiplexer 210L and into the selected register when instruction 252 is executed. At all other times, the multiplexer 210L passes the signals which are on the R-bus. Multiplexer 210b operates in response to the control signals OP22 on the conductors 211f which indicate when instruction 51 is being executed. Referring next to Fig. 15E and 15F, the details regarding the internal structure and operation of the boundary check circuit 210k will be described. Considering first Fig. 15E, it shows an APG instruction 253 that is executed in conjunction with the boundary check circuit 210k. Instruction 253 consists of two words, W0 and Wl; and it is identified by an operation code OP23 in word WO. With the instruction 253, a respective maximum limit and a respective minimum limit is established for each set of the input registers 210a. One field XYZ in word W0 selects either the X set of input registers, or the Y set of input registers, or the Z set of input registers. For that selected set, a field MAXLIM in word Wl specifies the maximum limit and a field MINLIM establishes the minimum limit. These limits are stored within the boundary check circuit 210k. After three sets of limits have been stored in the boundary check circuit 210k, that circuit compares the limits to the signals that are generated on the R-bus during the execution of each instruction 251. If one particular instruction 251 selects the X set of registers via the DEST field and increases their content via an operation that is specified by the ALOP field, then the result on the R-bus is compared by the boundary check circuit 210k to the maximum limit that was established for the X set of registers. If that maximum limit equals the signals on the R bus, then the boundary check circuit will pass the minimum limit for the X set of registers through multiplexer 210i when the next instruction 251 again selects the X set of registers. Conversely, when one particular instruction 251 selects the X set of registers via the DEST field and decreases their content via an operation that is specified in the ALOP field, then the result on the R-bus is compared to the minimum limit that was established for the X set of registers. If that minimum limit and the signals on the R-bus are equal, then the boundary check circuit 210k will pass the maximum limit for the X set of registers through the multiplexer 210i when the next instruction 251 again selects the X set of registers. Similarly, when one particular instruction 251 selects the Y set (or the Z set) of registers via the DEST field and increases their content via the ALOP field, then the result on the R-bus is compared to the maximum limit that was established for the Y set (or the Z set) of registers. If that maximum limit equals the signals on the R-bus, then the boundary check circuit will pass the minimum limit for the Y set (or the Z set) of registers through multiplexer 210i when the next instruction 251 again selects the Y set (or the Z set) of registers. Conversely, when one particular instruction 251 selects the Y set (or the Z set) of registers via the DEST field and decreases their content via the ALOP field, then the result on the R-bus is compared to the minimum limit that was established for the Y set (or the Z set) of registers. If that minimum limit and the signals on the R-bus are equal, then the boundary check circuit 210k will pass the maximum limit for the Y set (or the Z set) of registers through the multiplexer 210i when the next instruction 251 again selects the Y set (or the Z set) of registers. In order to perform the above-described operations within the boundary check circuit 210k, that circuit includes all of the components that are shown in Fig. 15F. Those components are identified by reference numerals 210q thru 210w; and each of those components is described below in Table 3. TABLE 3 Component Description 210q Component 210q, in Fig. 15F, consists of three pairs of registers which are the XMAX register and the XMIN register, the YMAX register and the YMIN register, and the ZMAX register and the ZMIN register. Each register has a data input D and an output Q. The MAXLIM field from instruction 253 is selectively stored in either the XMAX register or the YMAX register or the ZMAX register, and the MINLIM field from instruction 253 is selectively stored in either the XMIN register or the YMIN register or the ZMIN register. The MAXLIM field and the MINLIM field are sent to the registers 210q on a group of conductors 211n that are in the set 211. r Component 210r, in Fig. 15F, is a read/write control circuit for the registers 210q. To select one particular pair of registers to write, circuit 210r receives the XYZ field and OP23 field from instruction 253 on a group of conductors 211o that are in the set 211. To select one particular pair if registers to read, circuit 211r receives the XYZ field from instruction 251 on a group of conductors 2lip that are in the set 211. s Component 210s, in Fig. 15F, is a circuit which has a pair of inputs 11 and 12, an a pair of outputs Ol and 02. The inputs II and 12 respectively receive the maximum and minimum limits that are read from the registers 210q. If the ALOP field of instruction 251 specifies an add or increment operation, then the limits on the inputs II and 12 are respectively passed to the Ol and 02 outputs. If the ALOP field specifies a subtract or decrement operation, then the limit on input II is passed to output 02, and the limit on input 12 is passed to output 01. The ALOP field is sent to circuit 210s on a group of conductors 211q that are in the set 211. Component 210t, in Fig. 15F, is a compare circuit which compares the signals that are on the R-bus to the signals that are passed to the 02 output of component 210s. If those compared signals are the same, then circuit 210t generates the EQUAL signal as an output. u Component 210u, in Fig. 15F, is a set of three flip-flops that are called XEQ, YEQ, and ZEQ. Each flip-flop is read and written by another component 210v. v Component 210v, in Fig. 15F, is a read/write control circuit for the flip- flops 210u. The XEQ flip-flop is read when the field DEST in instruction 251 selects the X set of registers; the YEQ flip-flop is read when the DEST field selects the Y set of registers; and the ZEQ flip-flop is read when the DEST field selects the Z set of registers. The output of the flip-flop that is read becomes the control signal CROSSED_B. Also, each time one of the flip-flops 210u is read by instruction 251, that particular flip-flop is either set or reset at the end of the execution of the instruction. If the EQUAL signal is true, then the flip-flop is set; otherwise it is reset. The DEST field is received on the group of conductors 211R in the set 211. w . . . . Component 210w, in Fig. 15F, is a flip- flop which generates the carry-in signal (CIN) for the operational circuit 210h in Fig. 15A. This flip-flop is set or reset each time the instruction 251 is executed. Flip-flop 210w is set if the EQUAL signal from the comparator 210t is true at the end of the execution of the instruction 251; otherwise, flip-flop 210w is reset. Now, consider an example which illustrates how the circuitry and instructions in Figs. 15A-15F can be used as the first of three stages which together generate the TDI, ETDO and MASK signals that test an integrated circuit chip. In this example, suppose that the chip to be tested is a memory chip which contains four rectangular arrays of memory cells; and, suppose further that the cells are arranged, within each array, in 1024 rows and 64 columns. Each memory cell, in the above example, has a "virtual" address which is given by a "virtual" row number and a "virtual" column number. Why these rows and column numbers are "virtual" numbers will be explained shortly. For the first array, the virtual row numbers are VRO thru VR1023, and the virtual column numbers are VCO thru VC63. For the second array, the virtual row numbers are VRO thru VR1023, and the virtual column numbers are VC64 thru VC127. For the third array, the virtual row numbers are VR1024 thru VR2047, and the virtual column numbers are VCO thru V63. For the fourth array, the virtual row numbers are VR1024 thru VR2047, and the virtual column numbers are VC64 thru VC127. In each of the four arrays, the virtual row numbers increase consecutively from the top of the array to the bottom of the array, and the virtual column numbers increase consecutively from the left side of the array to the right side of the array. Thus for example, the memory cell which is in the top left corner of the first array is in the virtual row VRO and the virtual column VCO; and the memory cell that is at the bottom left corner of first array is in the virtual row VR1023 and the virtual column VC63. Similarly, the memory cell that is at the top left corner of the fourth array is in the virtual row VR1024 and the virtual column VC64, and the memory cell that is in the bottom right corner of the fourth array is in the virtual row VR2047 and the virtual column VC127. Suppose now that the TDI, ETDO, and MASK test signals are to be generated for each of the memory cells in the following order. First, test signals are to be sequentially generated for each one of the memory cells that are in row VRO, beginning with the memory cell in row VRO at column VCO and ending with the memory cell in row VRO at column VC63. Then, this sequence is to be sequentially repeated for each of the remaining rows VRl thru VR1023 in the first array. Thereafter, the above sequence is to be repeated for each cell in the second array; then the above sequence is to be repeated for each cell in the third array; and then the sequence is to be repeated for each cell in the fourth array. By utilizing the circuitry and instructions of Figs. 15A-15F, the virtual addresses of the memory cells can be sequentially generated in the order in which the cells are to be tested. For example, the X set of registers can be used to generate the number of the virtual row for the cell that is being tested, the Y set of registers can be used to generate the number of the virtual column for the cell that is being tested; and the Z set of registers can be used to generate the number of the array that is being tested. To sequentially generate the above addresses in the proper order, a sequence of the instructions 251 can be performed in a program loop. Also, to initially set the starting values for the above addresses, the instruction 252 can be performed. Further, to change the address of a cell that is generated in the program loop, automatically, from the end of one row to the beginning of the next consecutive row, and from the end of one column to the beginning of the next consecutive column, the instruction 253 can be used. Each time a virtual column address and a virtual row address is generated, those addresses are stored in the output registers 210b. For example, the virtual row address can be stored in register XlA' and the virtual column address can be stored in register YlA' . Further, if certain data needs to be used with each virtual row address and each virtual column address, then that data can also be generated in the program loop by the instructions 251 and 252; and that data can be stored in the output registers XlD' and YlD' . Also, for certain types of memory testing, two separate sequences of the virtual addresses and their corresponding data may need to be generated concurrently. For example, the first sequence of the virtual addresses could move from cell to cell in the order that was described above; while the second sequence of virtual addresses could move from cell to cell in the opposite order. Thus, the second sequence would start with the cell that is in the virtual row and virtual column with the highest number and end with the cell that is in the virtual row and the virtual column with the smallest number. These two separate sequences of the virtual addresses can be generated concurrently by first and second program loops that use the instructions 251, 252, and 253. Each time the first program loop generates a virtual address and its corresponding data, they are stored in the first set of output registers XlA', YlA', ZlA', XlD', and YlD'; and each time the second program loop generates a virtual address with its corresponding data, they are stored in the second set of output registers X2A', Y2A', Z2A', X2D', and Y2D' . Throughout the above description, the terms "virtual" row and "virtual" column were used because in an actual physical memory chip that is tested, the rows and columns of the memory cells may not be consecutively numbered. For example, in an actual memory chip, the row which has address 10 may lie adjacent to the row which has address 20. Likewise, in an actual memory chip, the column which has address 100 may lie adjacent to the column which has address 110. Accordingly, to accommodate such differences, the ALU stage 210 preferably generates virtual addresses and data for a virtual memory (i.e., a hypothetical memory) in which adjacent rows and columns have consecutive addresses; and, the scrambler stage 220 is provided to convert the virtual addresses and data to physical addresses and data for an actual physical memory chip that is to be tested. To initiate the various operations that are performed by the scrambler stage 220, another APG instruction 254 which is shown in Fig. 15G is executed. This instruction 254 consists of two words W0 and Wl; and it is identified by an operation code OP24 in word W0. Each execution of instruction 254 indicates that the virtual addresses and corresponding data in the output registers of the first stage 210 are ready to be operated on by the second stage 220. Thus, when those virtual addresses and corresponding data are generated in a program loop as described above, the APG instruction 254 is executed each time one cycle of the program loop is completed. Word Wl of instruction 254 also contains two additional fields which are called COUNT and PAGE as shown in Fig. 15G, but those fields are only used by the third stage of the APG. So the COUNT and PAGE fields are described later in conjunction with the third stage. One preferred embodiment of the second stage 220 is shown in detail in Figs. 16A-16C. This particular embodiment is comprised of all the components that are identified in the Fig. 16A-16C by reference numerals 220a thru 220zj; and each of those components is described below in Table 4. TABLE 4 Component Description 220a Component 220a is shown partly in Fig. 16A and partly in Fig. 16B, and it consists of all of the input registers for the scrambler stage 220. These input registers are partitioned into the first set which consists of registers XlA, YlA, ZlA, XlD, and YlD; and the second set which consists of registers X2A, Y2A, Z2A, X2D, and Y2D. These input registers are the same input registers that are shown in Fig. 14A. Each registers has a data input D and an output Q. 220b Component 220b, in Fig. 16C, consists of all of the output registers of the scrambler stage 220. Those output registers are partitioned into the first set XI', Yl', and Dl'; and the second set X2', Y2', and D2'. These output registers are the same output registers that are show in Fig. 14A. Each register has a data input D and an output Q. 220c Component 220c, in Figs. 16A and 16B, is a write control circuit for all of the input registers 220a. This write control circuit loads all of the input registers 220a concurrently, with the content of corresponding output registers 210b from the first stage 210. This operation occurs in response to a control signal UPDATE_STAGE_2, which is on a conductor 221a that is in the set 221. 220d Component 220d, in Fig. 16C, is a write control circuit for all of the output registers 220b. By this write control circuit, each output register is selectively loaded with the signals that are on its data input D. Register XI' gets loaded in response to control signals UPDATEX1'; register X2' gets loaded in response to control signals UPDATEX2 ' ; etc. These signals occur on a group of conductors 221b that are in the set 221. 220e . . . . Component 220e in Fig. 16A, is a two-by- one multiplexer. One of the inputs to the multiplexer 22Oe is the address in register XlA, and the other input is the address in register X2A. The XlA input is passed to the XA-bus when a control signal SELl is true; otherwise, the X2A input is passed to the X2A-bus. Control signal SELl occurs on conductor 221c which is in the set 221. 220f Component 220f, in Fig. 16A, is a two-by- one multiplexer. One of the inputs to the multiplexer 220f is the address in register YlA, and the other input is the address in register Y2A. The YlA input is passed to the YA-bus when the control signal SELl is true; otherwise, the Y2A input is passed to the YA-bus. 220g Component 220g, in Fig. 16A, is a two-by- one multiplexer. One of the inputs to the multiplexer 22Og is the address in register ZlA, and the other input is the address in register Z2A. The ZlA input is passed to the ZA-bus when the control signal SELl is true; otherwise, the Z2A input is passed to the ZA-bus. 220h Component 220h, in Fig. 16A, is a forty- eight-by-one multiplexer that is repeated sixteen times. Each instance of this multiplexer generates a respective one of the memory address bits A0 thru A15. For simplicity. Fig. 16A shows only the first and last instance of these multiplexers; and the remaining multiplexers are represented by a set of three dots Each multiplexer 220h receives, in parallel, all of the input address bits that are on the XA-bus, YA-bus, and ZA-bus; and each multiplexer selectively passes a respective one of the input address bits to thereby generate a single memory address bit. 220i Component 220i, in Fig. 16A, is three sets of control registers that are called the X SCRAMBLER CONTROL REGS, the Y SCRAMBLER CONTROL REGS, and the Z SCRAMBLER CONTROL REGS. Each set includes sixteen registers, one for each of the sixteen multiplexers 22Oh. The content of one set of registers is selected and sent to the multiplexers 22Oh on conductors 22Id; and those signals direct each multiplexer to pass a respective input to its output. 220j Component 220j, in Fig. 16A, is a write control circuit for the XYZ SCRAMBLER CONTROL REGISTERS 220i. By this circuit, a single control register in one of the three sets is selected. This occurs in response to the control signals OP33, XYZ, SA0-SA15. Then the selected register is written with a data field that is called the SETTING. All of these signals occur on a group of conductors 22le that are in the set 221. 220k Component 220k, in Fig. 16A, is a read control circuit for the XYZ SCRAMBLER CONTROL REGISTERS 220i. The particular set of registers that is read onto the conductors 221d is selected by three control signals SELX, SELY, AND SELZ that occur on a group of conductors 22lf that are in the set 221. 220L Component 220L, in Fig. 16A, is a Random Access Memory that stores 64K words, and each word has a separate address. One 16- bit word is read in response to the address A15-A0, and that word occurs on an output that is called XMEM. This output XMEM goes to the output registers XI' and X2' in Fig. 16C. 220m Component 220m, in Fig. 16A, is a Random Access Memory that stores 64K words, and each word has a separate address. One 16- bit word is read in response to the address A15-A0, and that word occurs on an output that is called YMEM. This output YMEM goes to the output registers Yl' and Y2' in Fig. 16C. 220n Component 220n, in Fig. 16A, is a Random Access Memory that stores 64κ bits, and each bit has a separate address. One bit word is read in response to the address A15-A0, and that bit occurs on an output that is called ZMEM. This output ZMEM goes to a multiplexer 220zi in Fig. 16C. 220o Component 220o, in Fig. 16B, is a two-by- one multiplexer. One input to this multiplexer is the content of register XlD, and the other input is the content of register X2D. The multiplexer 220 passes the XlD input to the XD-bus when the control signal SELl is true; and otherwise, it passes the X2D input to the XD-bus . 220p Component 220p, in Fig. 16B, is a two-by- one multiplexer. One input to this multiplexer is the content of register YlD, and the other input is the content of register Y2D. The multiplexer 220 passes the YlD input to the YD-bus when the control signal SELl is true; and otherwise, it passes the Y2D input to the YD-bus . 20q Component 220q, in Fig. 16B, is a sixteen- by-one multiplexer. This multiplexer receives the XD-bus as an input, and it passes one bit of that bus to its output. The particular bit that is passed is selected by the control signals XSEL which occur on conductors 221g that are in the set 221. 220r Component 220r, in Fig. 16B, is a sixteen- by-one multiplexer. This multiplexer receives the YD-bus as an input, and it passes one bit of that bus to its output. The particular bit that is passed is selected by the control signals YSEL which occur on conductors 221h that are in the set 221. 220s Component 220s, in Fig. 16B, is an inverter. It receives the output of the multiplexer 220q, and it inverts that signal as an output. 22Ot Component 22Ot, in Fig. 16B, is an inverter. It receives the output of the multiplexer 22Or, and it inverts that signal as an output. 220u Component 220u, in Fig. 16B, is four-by- one multiplexer. This multiplexer selectively passes one of its four inputs, to its output, in response to control signals LFUNC. Those control signals occur on conductors 22li which are in the set 221. 220v Component 220v, in Fig. 16B, is four-by- one multiplexer. This multiplexer selectively passes one of its four inputs, to its output, in response to control signals MFUNC. Those control signals occur on conductors 221j which are in the set 221. w Component 220w, in Fig. 16B, is an arithmetic circuit which performs selectable operations on a pair of inputs which come from the multiplexers 22Ou and 220v. The particular operation which is performed by component 220w is selected by control signals DALUOP which occur on the conductors 221k that are in the set 221. The result of that operation occurs on a DALU-bus. x Component 220x, in Fig. 16B, is a MASK register which has a data input D and an output Q. The data that is selectively written into this register is called MASK- DATA, and it occurs on the conductors 220L which are in the set 221. y . . . . Component 220y, in Fig. 16B, is a write control circuit for the MASK register 220x. This circuit 220y writes the MASK_DATA into the register 22Ox in response to control signals OP32 on conductors 221m that are in the set 221. z . . . . Component 220z, in Fig. 16B, is a selective compare circuit. As an input, circuit 220z receives the signals that are on the XD-bus, the YD-bus, and the signals that are stored in the MASK register 22Ox. Then, for each bit in the MASK register which is a "0", circuit 220z compares the corresponding bits which are on the XD-bus and the YD-bus. If all such comparisons are equal, circuit 220z generates an output signal XD=YD. 220za . . . . Component 220za, in Fig. 16C, is an inverter. It receives the signals on the DALU bus, and it inverts those signals as an output. 220zb . . . . Component 220zb, in Fig. 16C, is an inverter. It receives the signal XD=YD, and it inverts that signal as an output. 220zc . . . . Component 220zc, in Fig. 16C, is a six-by- one multiplexer. This multiplexer selectively passes one of its six inputs, to its output, in response to control signals OUTSEL. Those control signals occur on conductors 221n which are in the set 221. 220zd . . . . Component 220zd, in Fig. 16C, is a register which has a data input D and output Q. Signals called VALUE-DATA are selectively written into this register, and they occur on conductors 22lo which are in the set 221. 220ze . . . . Component 220ze, in Fig. 16C, is write control circuit for the register 220zd. This circuit writes the VALUE-DATA signals into register 220zd in response to a control signal OP34 that occurs on conductor 22lp in the set 221. 220zf . . . . Component 220zf, in Fig. 16C, is a two-by- one multiplexer. One input to this multiplexer is the output from the six-by- one multiplexer 220zc, and the other input is the content of register 220zd. Which particular input get passed to the output of the multiplexer 220zf is determined by a control signal VALSEL that occurs on conductor 221q in the set 221. 220zg . . . . Component 220zg, in Fig. 16C, is a rotator circuit which selectively rotates the output from the multiplexer 220zf. The type of rotation that is performed by the rotator circuit 220zg is selected by control signals ROT which occur on a group of conductors 221r in the set 221. 220zh . . . . Component 220zh, in Fig. 16C, is an inverter. It receives the output signals from the rotator circuit 220zg, and it generates the inverse of those signals. 220zi . . . . Component 220zi, in Fig. 16C, is a two-by- one multiplexer. One input to this multiplexer is the output of the rotator circuit 220zg, and the other input is the inverted output of the rotator circuit which comes from the inverter 220zh. This multiplexer passes the inverted input when a control signal ZMEM is true; and otherwise, it passes the non-inverted input . In Figs. 16A, 16B and 16C, many different control signals are shown as occurring on respective groups of conductors 221a-221m. All of those conductors are in the set 221 which come from the control unit 240. How those control signals are generated will now be described in conjunction with Figures 16D-16G. Considering first Fig. 16D, it shows one particular APG instruction 261 that is executed by the circuitry of Figs. 16A-16C. This instruction 261 is received in the APG control unit 240 of Fig. 14A via the conductors 201a; and in response, the APG control unit 240 sends various control signals on the conductors 221 to stage 220 of Figs. 16A-16C. Instruction 261 consists of two words WO and Wl. Word WO includes an operation code of OP31 which identifies the instruction. Word Wl contains several fields, and they specify all of the following control Signals: XSEL, YSEL, LFUNC, MFUNC, DALUOP, OUTSEL, VALSEL, and ROT. Each of these control signals can have any one of several different values which are digitally encoded, and each value specifies a particular function as is shown in Fig. 16D. For example, when the field XSEL has a value of "0", the multiplexer 220q passes the signal on bit-0 of the XD-bus to its output; when the field XSEL has a value of "1", the multiplexer 22Oq passes the signal on bit-1 of the XD-bus to its output; etc. As another example, when the field LFUNC has a value of "1", the multiplexer 220u passes the signal from, the inverter 220s to its output. As another example, when the field DALUOP has a value of "5", the circuit 220w performs an EXCLUSIVE-NOR operation on its inputs and generates the result on the DALU-bus. As still another example, when the field OUTSEL has a value of "3", then the multiplexer 220zc passes the inverse of the signal XD=YD to its output. Referring now to Fig. 16E, it shows another APG instruction 262 which is executed by the circuitry of Fig. 16A. This particular instruction consists of two words W0 and Wl, and it is identified by an operation code of OP32 which occurs in Word WO. That word also includes an XYZ field which selects either the X set of SCRAMBLER CONTROL REGISTERS or the Y set Of SCRAMBLER CONTROL REGISTERS of the Z set of SCRAMBLER CONTROL REGISTERS that are in component 221 of Fig. 16A. Word Wl of instruction 262 contains two fields which are called SETTING and SA15-SA0. The field SA15- SA0 selects one of the sixteen registers in the set which is selected by the XYZ field. That one selected register is written by the write control circuit 220j of Fig. 16A with the SETTING field. Thus, by utilizing instruction 262, each one of the XYZ SCRAMBLER CONTROL REGISTERS can be written with any desired setting. Turning now to Fig. 16F, it shows still another APG instruction 263 which is executed by a circuitry of Fig. 16B. This particular instruction consists of two words WO and Wl; and it is identified by an operation code OP33 which occurs in word WO. Word Wl of instruction 263 contains a field which is called MASK_DATA. When instruction 263 is executed, the MASK_DATA field is written into register 220x of Fig. 16B. That writing is performed by the write control circuit 22Oy which operates in response to the control signals OP33 on the conductors 221j. Referring next to Fig. 16G, it shows another APG instruction 264 which is executed by the circuitry of Fig. 16C. This APG instruction consists of two words WO and Wl; and it is identified by an operation code OP34 which occurs in word WO . Word l contains a field called VALUE_DATA. When instruction 264 is executed, the field VALUE_DATA is stored in register 220zd of Fig. 16C. That writing is performed by the write control circuit 220ze in response to the control signals OP34 which occur on the conductors 221m. Now, consider an example which illustrates how the circuitry and instructions of Figs. 16A-16G can be used, as the second stage of the three-stage pipeline, to generate the TDI, ETDO and MASK signals that test an integrated circuit chip. In this example, suppose that the chip to be tested is the same memory chip that was previously described in conjunction with the first stage 210. That chip included four rectangular arrays of memory cells, and the cells of each array were arranged in 1,024 rows and 64 columns. In the above example, the first stage 210 generated one or two separate sequences of virtual addresses and corresponding data; and those addresses and data were sequentially stored in the output registers 210b. Now at certain times, the contents of the output registers 210b of the first stage are transferred to the input registers 220a of the second stage. Then, the virtual addresses and data that are in the second stage input registers 220a get processed by the circuitry of Figs. 16A-16C. The above processing in the second stage occurs in six consecutive time intervals Δtl-Δt6. First, during time interval Δtl, the contents of three input registers XlA, YlA, and ZlA are operated on by the circuitry of Figs. 16A; and that generates an output which is stored in register XI'. Next, during time interval Δt2, the contents of three input registers X2A, Y2A, and Z2A are operated on by the circuitry in Fig. 16A; and that generates an output which is stored in register X2 ' . Then during time interval Δt3, the contents of three registers XlA, YlA, and ZlA are operated on by the circuitry in Fig. 16A; and that generates an output which is stored in register Yl'. Then, during time interval Δt4, the content of three input registers X2A, Y2A, and Z2A are operated on by the circuitry of Fig. 16A; and that generates an output which is stored in register Y2'. Next, during time interval Δt5, the content of five input registers XlA, YlA, ZlA, XlD, and YlD are operated on by all of the circuitry in Figs. 16A-16C; and that generates an output which is stored in register Dl'. Lastly, during time interval Δt6, the content of five input registers X2A, Y2A, Z2A, X2D, and Y2D are operated on by all of circuitry in Figs. 16A-16C; and that generates an output which is stored in register D2'. Throughout three of the time intervals Δtl, Δt3, and Δt5, the two-by-one multiplexers 220e, 220f, 220g, 220o, and 220p respectively pass their inputs XlA, YlA, ZlA, XlD, and YlD. Conversely, throughout the other three time intervals Δt2, Δt4, and Δt6, those multiplexers respectively pass their inputs X2A, Y2A, Z2A, X2D, and Y2D. Also, throughout two of the time intervals Δtl and Δt2, the read control circuit 220k sends the content of the X SCRAMBLER CONTROL REGISTERS on the conductors 221d to the multiplexers 220h. During the time intervals Δt3 and Δt4, the read control circuit 220k sends the content of the Y SCRAMBLER CONTROL REGISTER on the conductors 22Od to the multiplexers 22Oh. And, during the time intervals Δt5 and Δt6, the read control circuit 220k sends the content of the Z SCRAMBLER CONTROL REGISTERS on the conductors 22Id to the multiplexers 220h. Due to the above processing within the second stage 220, all of the virtual addresses that are in the input registers XlA, X2A, YlA, and Y2A get converted to corresponding physical addresses. For example, to convert the virtual address in register XlA, the sixteen multiplexers 22Oh each select a particular bit on the XA- bus or YA-bus or and ZA-bus; those selected bits form an address which reads a word in the X memory 220L; and that word gets stored in register XI' as the physical address. Similarly, to convert the virtual address in register YlA, the sixteen multiplexers 22Oh each select a bit from the XA-bus or YA-bus or ZA-bus; those selected bits form an address which reads a word in the Y memory 220M; and that word gets stored in register Yl' as the physical address. Also due to the above processing within the second staσe 220, the data from the input registers XlD and YlD gets converted to different data which is then stored in the output register Dl. Likewise, the data from the input registers X2D and Y2D gets converted to different data which is then stored in the output register D2'. During this data conversion process, the circuits in Figs. 16B and 16C perform various operations that are specified by the control signals XSEL, YSEL, LFUNC, MFUNC, DALUOP, OUTSEL, VALSEL, and ROT. Those control signals are set by the instruction 261 of Fig. 16D that was last executed, and they are held in registers (not shown) which are inside the control unit 240 of Fig. 14A. After all of the processing in the six consecutive time intervals Δtl-Δt6 is completed by the second stage 220, then the second stage output registers 220b are ready to be transferred to the input registers 230a of the third stage 230 (i.e., the formatter stage). When that transfer occurs, the formatter stage will perform additional processing on the content of its input registers which thereby generates the signals ATDI, AETDO, and AMASK that test the integrated circuit chip. One preferred embodiment of the formatter stage 230 is shown in detail in Figs. 17A and 17B. This particular embodiment is comprised of all of the components that are identified in Figs. 17A and 17B by reference numerals 230a thru 230q; and each of those components is described below in Table 5. TABLE 5 Component Description 230a Component 230a, in Fig. 17A, consists of all of the input registers to the formatter stage 230. These input registers are partitioned into the first set which consists of registers XI, Yl, and Dl; and the second set which consists of registers X2, Y2, and D2. These input registers are the same input registers that are shown in Fig. 14A. Each register has a data input D and an output Q. 230b Component 230b, in Fig. 17A, consists of all of the output registers in the formatter stage 230. These output registers are the ATDI register, the AETDO register, and the AMASK register; and they are the same output registers that are shown in Fig. 14A. Each output register has a data input D, a clock input CK, and an output Q. These output registers respectively send the output signals ATDI, AETDO, and AMASK on the conductors 201b, 201c and 2Old; and those conductors are the same conductors that are shown in Figs. 14A and 14B. 230c Component 230c, in Fig. 17A, is a write control circuit for all of the input registers 230a. This write control circuit loads all of the input registers 230a, concurrently, with the content of the corresponding output registers 220b from the second stage 220. This operation occurs in response to a control signal UPDATE-STAGE-3, which is on a conductor 231a that is in the set 231. 230d Component 230d, in Fig. 17A, is a multiplexer that has one-hundred-thirty- eight inputs and a single output. Each input register XI, X2, Yl, and Y2 sends a sixteen bit address to the multiplexer 230d; each input register Dl and D2 sends thirty-six bit data word to the multiplexer 23Od; and the remaining inputs are a "0" and a "1". Which particular input gets passed through multiplexer 230d is selected by control signals CFMD1 which are internally generated by the formatter stage, as shown in Fig. 17B. 230e Component 230e, in Fig. 17A, is a multiplexer which has seventy-four inputs and a single output. Each input register Dl and D2 sends a thirty-six bit data word to the multiplexer 230e; and the remaining inputs are a "0" and a "1". Which particular input gets passed through multiplexer 230e is selected by control signals CFMD2 that are internally generated by the formatter stage, as shown in Fig. 17B. 230f Component 230f, in Fig. 17A, is a serial- to-parallel shift register which has a serial input D and a parallel output Q. The serial data on the input D comes from the output of multiplexer 23Od. One bit of that serial data is clocked into register 23Of by each positive edge of a clock signal called BITCLK. The BITCLK signal occurs on a conductor 231b that is in the set 231. 230g Component 230g, in Fig. 17A, is a serial- to-parallel shift register which has a serial input D and a parallel output Q. The serial data on the input D comes from the output of multiplexer 230e. One bit of that serial data is clocked into register 230g by each positive edge of the clock signal BITCLK. h Component 230h, in Fig. 17A, is a serial- to-parallel register which has a serial input D and a parallel output Q. The serial data input D receives a signal CFMD3 from a register 220q in Fig. 17B. One bit of that serial data is clocked into register 230h by each positive edge of the clock signal BITCLK. i Component 23Oi, in Fig. 17A, is a latency buffer which has a pair of inputs Dl and D2, and a corresponding pair of outputs Ql and Q2. Input Dl receives the parallel output signals from register 23Og, and input D2 receives the parallel output signals from register 230h. The signals on the Dl and D2 inputs are stored in the latency buffer 23Oi in response to each positive edge of a clock signal, called WDCLK that occurs on a conductor 231b which is in the set 231. Those stored signals are subsequently regenerated on the outputs Ql and Q2 after a predetermined number of cycles of the clock signal WDCLK. j Component 230j, in Fig. 17B, is a register which has a data input D and an output Q. The data input D receives the PAGE field that is in word Wl of instruction 254, as shown in Fig. 15G. The PAGE field is sent on conductors 23Id, which are in the set 231. k Component 230k, in Fig. 17B, is a register which has a data input D and an output Q. The data input D receives the COUNT field that is in word Wl of instruction 254, as shown in Fig. 15G. The COUNT field is sent on conductors 231e, which are in the set 231. L Component 230L, in Fig. 17B, is a write control circuit for the registers 230j and 230k. This circuit writes the PAGE field into register 230j and writes the COUNT field into register 230k in response to control signals OP24 which indicate that instruction 254, of Fig. 15G, is being executed. The signals OP24 occur on the conductors 231f in the set 231. m Component 230m, in Fig. 17B, is a register which has a data input D, an output Q, and a load control input L. This register holds the number of a page that is actively being used within the formatter stage; and that page number is given by the ACTIVE-PG signals from the Q output. The active page number is received from register 23Oj in response to the UPDATE-STATE-3 signal on conductor 231a. n Component 230n, in Fig. 17B, is a counter which has a data input D, an output Q, a clock input CK, and a load input L. This counter holds a count that is actively being used within the formatter stage; and that count is given by the ACTIVE-CNT signals on the Q output. An initial count is received from register 230k in response to the UPDATE-STAGE-3 control signal on conductor 231a. Counter 230n decrements the count which it holds, by one, each time it receives a positive edge of the clock signal BITCLK. o Component 230o, in Fig. 17B, is a circuit which detects when the active count in the counter 23On has been decremented to zero. When that occurs, component 230o generates a control signal, called ZERO-CNT, on a conductor 232a, which is in the set 231 that goes to the control module 240. p Component 230p is a memory which stores a plurality of control words that are called CFMD. These control words are partitioned into "M" pages within the memory, and each page holds "N" control words. In one embodiment, M is 1024 and N is 256. One particular page within the memory 23Op is addressed by the ACTIVE-PG signals from register 230m; and one particular control word within the addressed page is selected by the ACTIVE-CNT signals from the counter 230n. q Component 230q is a register which has a data input D, an output Q, and a clock input CK. The data input D sequentially receives each particular control word CFMD from the control memory by the ACTIVE-PG and ACTIVE-CNT signals. One control word is stored in register 22Oq each time it receives a positive edge of the clock signal BITCLK. Now, the manner in which all of the components in Figs. 17A and 17B interact to generate the ATDI, AETDO, and AMASK test signals will be described. Initially, instruction 254 of Fig. 15G will be executed to indicate that the output registers of the first stage hold virtual addresses and data words that are ready to be processed by the second stage. When that instruction 254 is executed, the PAGE field and COUNT field will be written into the registers 230j and 230k of Fig. 17B. Thereafter, the content of the output registers of the first stage will be transferred to the input registers of the second stage. Then, the content of the input registers in the second stage will be processed during six consecutive time periods ΔT1-ΔT6 as was previously described. After that occurs, the content of the output registers from the second stage are ready to be transferred to the input registers of the third stage. The actual transfer to the third stage input registers occurs in response to a control signal UPDATE- STAGE-3 from the APG control unit 240 on a conductor 231a in the set 231. Also, in response to the UPDATE-STAGE-3 control signal, the PAGE in register 230j is transferred to the active page register 230m, and the COUNT in register 230k is transferred to the counter 23On. After the counter 230n is loaded, the count which it contains is decremented by one in response to each positive edge of the clock signal BITCLK. Also, for each count that is generated by the counter 23On, one control word is read from the memory 23Op and stored in the register 230q. Each control word that is stored in register 230q is partitioned into the control signals CFMDl, CFMD2, and CFMD3 that are respectively sent to the multiplexer 230d, the multiplexer 230e, and the serial- to-parallel shift register 230h. The CFMDl signals cause the multiplexer to 22Od select one bit for the shift register 230f; the CFMD2 signals cause the multiplexer 230e to select one bit for the shift register 230g; and the CFMD3 signal is sent directly to the shift register 230h. When each positive edge of the bit clock signal occurs, the shift registers 230f, 230g, and 230h store the bit that is sent to their D input. Then, after a total of sixteen bits have been stored in each of the shift registers 230f, 230g, and 230h, their parallel outputs are used. Specifically, the parallel output of shift register 23Of is loaded into the ATDI output register; and the parallel output of the shift registers 230g and 23Oh are respectively loaded into the DI and D2 inputs of the latency buffer 230i. Those signals which are loaded into the latency buffer 23Oi are subsequently sent to the output registers AETDO and AMASK, after a predetermined number of cycles of the clock signal WDCK occurs . From the output registers 230b, the conductors 201b, 201c, and 201d respectively carry the signals ATDI, AETDO, and AMASK to the previously described circuits of Fig. 14B; and those circuits send the signals to the integrated circuit chips that are to be tested. During the testing process, signal ATDI is serially written into the chip, and that produces a serial response which is serially compared with the signals AETDO and AMASK. This response from the chip occurs after a certain delay relative to the time that the signals ATDI are written into the chip; and that delay is compensated for by the latency buffer 230i of Fig. 17A. The above-described process of serially loading the shift registers 230f, 230g, and 230h and sending their output in sixteen-bit words to the output registers 230b proceeds in a repetitive fashion until the counter 23On decrements its count to zero. When that occurs, the zero detect circuit 230o sends the ZERO-CNT signal on conductor 232a to the APG control circuit 240 of Fig. 14A. Within the APG control unit 240, the state of the second stage 220 is tested to determine if the output registers 220b contain new data that is ready to be transferred to the input registers of the third stage 230. If such a state is present, then the APG control unit 240 generates the control signal UPDATE-STAGE-3 on conductor 231a. In response, the content of the output registers of the second stage 220 are transferred to the input registers of the third stage 230; another PAGE in register in 230j is transferred to the active page register 230m; and another COUNT in register 230k is transferred to the counter 230n. Then, the entire process, as described above, continues. Turning now to Fig. 18, it shows a timing diagram that illustrates the sequence in which the three stages operate. In Fig. 18, the first stage 210 generates a first set of virtual addresses and corresponding data during a time interval T1S2. Thereafter, during a time interval T1S2, the second stage 220 transforms the first set of virtual addresses and corresponding data to a first set of physical addresses and corresponding data. Subsequently, during a time interval T1S3, the third 230 stage uses the first set of physical addresses and corresponding data to generate the serial bit streams ATDI, AETDO, and AMASK that test the integrated circuit chips. For each set of virtual addresses that is generated by the first stage in a time interval TiSl, the second stage and third stage perform their corresponding tasks in time intervals TiS2 and TiS3 respectively. Here "i" is any positive integer. Thus, for example, the third set of virtual addresses and the third set of physical addresses and a third set of output signals are respectively generated during the time intervals T3S1, T3S2, and T3S3. This process continues, •as indicated in Fig. 18 by the sets of three dots, until the first-stage stops generating a new set of virtual addresses and corresponding data. Inspection of Fig. 18 shows that at certain times, all three of the stages 210, 220 and 230 operate concurrently on different sets of address and data. For example, portions of t e three time intervals T3S1, T2S2 and T1S3 overlap. During time interval T3S1, the first stage 210 is generating the third set of virtual addresses and corresponding data; during time interval T2S2, the second stage 220 is transforming the second set of virtual addresses and corresponding data to a second set of physical addresses and corresponding data; and during time interval T1S3, the third stage 230 is generating the first set of output signals ATDI, AETDO and AMASK. Inspection of Fig. 18 further shows that no gaps occur between the third stage time intervals T1S3, T2S3, T3S3, etc. Consequently, the third stage output signals ATDI, AETDO, and AMASK occur in serial bit streams that are continuous from one time interval to the next. To achieve this continuous output, each of the first stage time intervals TiSl, T2S2, etc., and each of the second stage time intervals S2T1, S2T2, etc., must be shorter than each of the first stage time intervals. Due to the above constraint, gaps do occur between the first stage time intervals, and gaps do occur between the second stage time intervals. During the gaps between the first stage time intervals, the first stage 210 is in a wait state where it stays until certain events occur before continuing to generate another set of virtual addresses and corresponding data. Similarly, during the gaps between each of the second stage time intervals, the second stage 220 is in a wait state where it stays until certain events occur before proceeding with the process of transforming virtual addresses to physical addresses. How the above wait states are entered and exited by the first stage 210 and the second stage 220 will now be described in conjunction with Fig. 19. In that figure, separate state diagrams are shown for each of the three stages. All of the states, and transitions from one state to another, that are illustrated in Fig. 19 are implemented by the control module 240 of Fig. 14A. At various points in the state diagrams of Fig. 19, reference is made to two state control flip-flops that are shown in Fig. 20; and those two flip-flops 241 and 242 are included within the control unit 240 of Fig. 14A. Each flip-flop has a set input S and a reset input R, and an output Q. Flip-flop 241 is set when the content of the first stage output registers 210b are ready to be processed by the second stage 220; and flip- flop 242 is set when the content of the second stage output registers 220b are ready to be processed by the third stage 230. This is indicated by the output signals from the two flip-flops 241 and 242 which respectively are "STAGE-1 OR'S READY," and "STAGE-2 OR'S READY." Considering now the state diagram in Fig. 19 for the first stage, it shows a state 301 in which the first stage 210 waits for an instruction to execute. Those instructions are the instructions that were previously described in conjunction with Figs. 15C, 15D, 15E, and 15G. When one of those instructions is received by the control unit 240, that control unit makes a test, as indicated by reference numeral 302, to determine if instruction 254 of Fig. 15G was received. If instruction 254 was not received, then the control unit 240 sends control signals to the first stage 210 on the conductors 211a, 211b, etc., as was previously described in conjunction with Figs. 15A-15F; and in response, the first stage 210 executes the received instruction. This is indicated by reference numeral 303. Then, the first stage 210 re-enters state 301. By comparison, if control unit 240 determines by the test 302 that instruction 254 of Fig. 15G was received, then control unit 240 sets flip-flop 241 which indicates that the content of the first stage output registers 210b are ready to be processed by the second stage 220. Then the first stage goes to a state 305 where it waits for flip-flop 241 to become reset. When that reset occurs, the first stage re-enters state 301 and waits for another instruction to execute. Next, considering the state diagram in Fig. 19 for the second stage 220, it shows a state 310 in which the second stage stays until the content of the output registers of the first stage are ready to be processed by the second stage. The occurrence of that event is indicated by flip-flop 241 being set. Thus, when flip- flop 241 becomes set, the second stage 220 enters another state 311. The second stage 220 stays in state 311 if. it has any physical address and corresponding data in its own output registers 220b that need to be transferred to the third stage 230. The presence of physical address and data is in the second stage output register 220b is indicated by flip-flop 242 being set. Thus, state 311 is exited when the flip-flop 242 becomes reset. When state 311 is exited, the control unit 240 sends the control signal UPDATE_STAGE2 to the second stage on the conductors 221a, and it resets flip-flop 241. This is indicated by reference numeral 312. Then, in response to the UPDATE_STAGE2 control signal, the second stage 220 sequentially generates a set of physical addresses and corresponding data, and it stores them in its output registers 220b. This is indicated by reference numeral 313. Then, the control unit 240 sets flip-flop 242, as indicated by reference numeral 314, and that signifies that the second stage output registers 220b are ready to be processed by the third stage 230. Then, the second stage 220 re-enters state 310. Next, considering the state diagram of Fig. 19 for the third stage 230, it shows a state 320 in which the third stage stays until the content of the second stage output registers 220b are ready to be processed by the third stage. The occurrence of that event is indicated by flip-flop 242 being set. Thus, state 320 is exited when flip-flop 242 is set. Then, as is indicated by reference numeral 321, the control unit 240 sends the control signal UPDATE_STAGE3 to the third stage on conductor 231a, and it resets flip-flop 242. In response to the UPDATE_STAGE3 control signal, the content of the second stage output registers 220b are transferred to the input registers 230a of the third state. Also, a new page is transferred from register 230j in the third stage to the active page register 23m, and a new count is transferred from register 230k in the third stage to the active counter 230n. Thereafter, the third state 230 uses the active page and active count to sequentially generate the output bit streams ATDI, AETDO, and AMASK as was previously described, and this is indicated by reference numerals 322 and 323. That process continues until the active count reaches a count of zero, at which time the third stage re-enters state 320. If flip-flop 242 is set when state 320 is re- entered, then state 320 will be exited immediately. Then, all of the events that are indicated by reference numerals 321, 322, and 323 will be repeated; and consequently, no gaps will occur in the bit streams ATDI, AETDO, and AMASK that are generated by third stage. To ensure that flip-flop 242 is in fact set when state 320 is re-entered, the first stage time intervals and second stage time intervals of Fig. 18 need to be shorter than the third stage time intervals. Turning now to Fig. 21, it shows a program which is used to generate the output bit streams ATDI, AETDO, and AMASK that test the integrated circuit chips. This program is stored in the memory 13' of Fig. 13; and it is executed by all of the circuitry that was described in conjunction with Fig. 13 and the following figures. In Fig. 21, the illustrated program is performed as a sequence of steps which are identified as steps S101 through S115. By the first five steps S101 through S105, various initial values are established. Thereafter, in the following steps S106 through S115, two program loops are performed during which the output signals ATDI, AETDO, and AMASK are generated. All of the output signals that are generated by the Fig. 21 program are for a physical array of memory cells; and each memory cell has a physical row address and a physical column address. But in the program of Fig. 21, the physical row and column addresses are generated from virtual row and column addresses. By step S101, a starting virtual row address is sent to input register XA of the first stage 210, and a starting virtual column address is sent to input register YA of the first stage. Then, in step S102, the virtual address limits are sent to the boundary check circuit 210k of the first stage. By this step, the registers XMIN and XMAX of Fig. 15F are respectively loaded with the minimum and maximum virtual row addresses; and similarly, the registers YMIN and YMAX are respectively loaded with the minimum and maximum virtual column addresses. Next, in step S103, all of the second stage scrambler control registers are initialized. Those registers are identified by reference numeral 220i in Fig. 16A. The settings which are established by this step determine the control signals that are sent on the conductors 221b to the multiplexers 22Oh. Next, in step S104, several control signals are established in the data processing portion of the second stage that is shown in Figs. 16B and 16C. Specifically, this step S104 establishes all of the control signals XSEL, YSEL, LFUNC, MFUNC, DALUOP, OUTSEL, VALSEL, and ROT that were previously described in conjunction with Fig. 16D. Next, in step S105, respective initial values are sent to the row counter 252 and a column counter 253 of Fig. 14B. Here, the initial value that is sent to the row counter is the number of rows in the virtual memory array, and the initial value that is sent to the column counter is the number of columns that is in the virtual memory array. Next, in step S106, the virtual row address that is in the input register XA of the first stage is sent to the output registers XlA' and XlD' of the first stage. Then, in step S107, the virtual column address that is in the input register YA of the first stage is sent to the output registers YlA' and YlD' . Also by step 107, the virtual column address that is in register YA is incremented by one. These operations are achieved by performing instruction 251 of Fig. 15C. Next, in step S108, instruction 254 of Fig. 15G is executed; and as a result, flip-flop 241 is set. This indicates that the content of the output registers of the first stage 210 are ready to be processed by the second stage 220. Consequently, the second stage 220 will proceed to store and process the content of the first stage output registers as was previously described in conjunction with the stage two state diagram of Fig. 19. Thereafter, the content of the output registers of the second stage 220 will become ready for processing by the third stage 230. When that occurs, the third stage 230 will store and process the content of the second stage output registers as was previously described in conjunction with the third stage state diagram of Fig. 19. Next, step S109 is performed whereby the count in the column counter 253 is decremented, by one, by the state machine 40 of Fig. 14B. This step S109, as well as the remaining steps SllO through S115, are performed in parallel with the various tasks for the second stage 220 and the third stage 230, which were initiated by step S108. Next, in step SllO, the state machine 40' of Fig. 14B tests the column counter 242 to see if it has reached a count of zero. If the count is not zero, then step Sill is performed. There, the state machine 40' of Fig. 14B makes a test to determine if the content of the first stage output registers, as established by steps S106 and S107, has been transferred to the input registers of the first stage. This test is made by examining the output signal of flip-flop 241 in Fig. 20. If flip-flop 241 is set, then step Sill is repeated until flip-flop 241 becomes reset. When that occurs, a branch is taken back to step S106. By comparison, if the count in the column counter 253 is zero in step SllO, then a branch is taken to step S112. There, the row address that is in input register XA of the first stage is incremented by one. Then, in step S113, the count in the row counter 252 is decremented by one. Next, in step S114, the state machine 40' of Fig. 14B tests the count in the row counter 252. If that count does not equal zero, then step S115 is performed in which the column counter 253 is re-initialized with the number of columns that is in the virtual memory array. Then a branch is taken to step Sill. Otherwise, if the count in the row counter does equal zero in step S114, then test signals have been generated for every cell in the array; and thus, the generation of the test signals is complete. Each step in the program of Fig. 21 is specified by one or more instructions in the memory 13 of Fig 13. For example, the initial values that are loaded in step S101 are specified by two of the instructions 252 of Fig. 15D. Similarly, the minimum and maximum address limits of step S102 are specified by two of the instructions 253 of Fig. 15E. Likewise, the multiplexer control signals of step S103 are specified for the X registers by sixteen of the instructions 262 of Fig. 16E; and the multiplexer control signals for the Y registers are specified sixteen more of those instructions. Further, the control signals that are established in step S104 are defined by a single instruction 261 of Fig. 16B. To perform the testing and branching that occurs in steps SllO, Sill, and S114, the conditional jump instruction 32 of Fig. 11 is executed. And, to perform the loading and decrementing of the row counter 252 and column counter 253, another instruction 265 of Fig. 22 is executed. This instruction 265 is identified by an operation code of OP=35. Instruction 265 has three fields which are called COUNT, DECLD, and ROWCOL. The ROWCOL field has a value of "0" which selects the row counter 252 and a value of "1" which selects the column counter 253. The DECLD field has a value of "0" which specifies a decrement operation and a value of "1" which specifies a load operation. If a load operation is specified, then the COUNT field is loaded into the counter that is identified by the ROWCOL field. If a decrement operation is specified, then the counter that is identified by the ROWCOL field is decremented by one. One particular feature of the above-described program in Fig. 21 is that the same program can be used for any number of memory arrays that each have a different physical layout for the rows and columns. This feature is achieved because the particular physical layout of any one array is accommodated in step S103 where the multiplexer control registers of stage 2 are initialized. By properly initializing those registers, each virtual address is converted, via the multiplexers 220h of Fig. 16A and the memories 220L and 220m, to any desired physical address. Another feature of the Fig. 21 program is that it can generate the test signals ATDI, AETDO, and AMASK for many different data patterns, simply by changing the instructions that implement step S104. For example, if step S104 is implemented with one instruction 261 of Fig. 16D which sends bit-zero in register XlD to the DALU bus, then each even numbered row in the memory array will be written with a "0" and each odd numbered row in the array will be written with a "1". By comparison, if step S104 is implemented by one instruction 261 of Fig. 16D which sends the inverse of bit-zero in register YlD to the DALU bus, then each odd numbered column of the array will be written with a "0" and each even numbered column of the array will be written with a "1". Also, it should be emphasized that the generation of the test signals ATDI, AETDO, and AMASK via the algorithmic pattern generator occur during only one mode of operation in the system of Fig. 13. In another mode of operation, the test signals TDI, ETDO, and MASK are read from the memory 13' and sent to the chips that are to be tested. In these two modes of operation, all of the circuitry that is shown in Figs. 5, 6, 8, 9 an 10 are time-shared. Thus, in either mode of operation, the TMS signal is generated by the state machine 40' and sent to register 47; the words of the bit streams in registers 44-48 are broadcast on the conductors 12a to all of the chip driver circuits 11; and the chip driver circuits compare the expected response from the chips that are tested to the actual response from those chips. One preferred embodiment of the present invention has now been described in detail. In addition, however, various changes and modifications can be made to the details of the illustrated preferred embodiment without departing from the nature and spirit of the invention. For example, with the algorithmic pattern generator that is described in Figs. 13-22, all three of the bit streams ATDI, AETDO, and AMASK are generated; however, as a modification, only one or two of those bit streams can be generated. With this modification, the circuitry which produces the unused bit streams can be eliminated. Thus, for example, only the ATDI bit stream could be generated and the circuitry which is used to generate the ATDO and AMASK bit streams could be eliminated. Likewise, in Fig. 14A, the preferred embodiment of the algorithmic pattern generator is shown to include three stages; however, as a modification, the number of those stages could be either decreased or increased. For example, an additional stage to perform some new operation could be inserted between the second stage and the third stage. Alternatively, the functions that are performed by the second stage and third stage could be combined into a single stage. Also, as a modification, any one of the three stages of the algorithmic pattern generator of Fig. 14A could be replaced with a similar stage that is differently constructed. Thus, each stage of the APG that is disclosed herein is a separate module which can be used within another algorithmic pattern generator. Also, as another modification, the various instructions that are performed by each stage of the algorithmic pattern generator can be changed. For example, in Fig. 15C, several fields are shown which define various functions that are performed by the first stage; and those fields can be modified to change the particular operations which the first stage performs. Likewise, in Fig. 16D, several fields are shown which define the functions that are performed by the second stage; and those fields can be modified to change the functions which the second stage performs. Accordingly, it is to be understood that the invention is not limited to all of the details of the illustrated preferred embodiment but is defined by the appended claims.

Claims: WHAT IS CLAIMED IS: 1. An initial stage of a multi-stage algorithmic pattern generator, which is comprised of: multiple sets of input registers which store respective addresses; an address modifying means, coupled to said multiple sets of input registers, which receives a command of a particular type, and in response, selects one register in one set and generates a modified address by performing a selectable operation on the address that is in said one register; and, a boundary check means, coupled to said address modifying means, which stores a respective minimum limit and a respective maximum limit for each register set; said boundary check means also including a gating means which -a) gates said minimum limit for said one register set to an output bus if said modified address is more than the maximum limit for said one register set; b) gates said maximum limit for said one register set to said output bus if said modified address is less than said minimum limit for said one register set; and c) otherwise gates said modified address to said output bus. 2. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 which further includes multiple output registers; and, an output register write control means which writes the information on said output bus into a selectable output register in response to said command of said particular type. 3. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 which further includes multiple output registers; and, an output register write control means which selectively write the information on said output bus or the content of any input register in said one set, into a selectable output register in response to said command of said particular type. 4. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 which further includes multiple output registers; and, an output register write control means which selectively write the information on said output bus or the content of any input register in said one set, into multiple selectable output registers and input registers simultaneously, in response to said command of said particular type. 5. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 which further includes multiple output registers which are selectively loaded with the content of said input registers in response to said command of said particular type; and a state control means which indicates when the content of said output registers are ready to be sent from said initial stage to another stage for further processing. 6. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 which further includes multiple output registers which are selectively loaded with the content of said input registers in response to said command of said particular type; and a control flip-flop which is set in response to a command of another type, that is different than said particular type, to indicate when the content of said output registers are ready to be sent from said initial stage to another stage for further processing. 7. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 wherein said respective minimum limit and said respective maximum limit for each register set are programmable and are written into said boundary check means in response to a command of another type that is different from said command of said particular type. 8. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 wherein said gating means further includes (a) respective control flip-flops for each register set; (b) a means which sets one control flip-flop if said modified address is generated by increasing an address in said one register set to said maximum limit for said one register set; and (c) a means which gates said minimum limit for said selected register set to said output bus when said address modifying means receives another command of said particular type, after said one flip-flop is set, which modifies an address in said one set. 9. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 wherein said gating means further includes (a) respective control flip-flops for each register set; (b) a means which sets one control flip-flop if said modified address is generated by decreasing an address in said one register set to said minimum limit for said one register set; and (c) a means which gates said maximum limit for said selected register set to said output bus when said address modifying means receives another command of said particular type, after said one flip-flop is set, which modifies an address in said one set. 10. An initial stage of a multi-stage algorithmic pattern generator according to claim 1 wherein said address modifying means includes a first circuit which performs a selectable arithmetic operation followed by a second circuit which performs a selectable rotating operation followed by a third circuit which performs a selectable inverting operation, and where each selectable operation is specified in said command of said particular type. 11. An initial stage of a multi-stage algorithmic pattern generator, which is comprised of: multiple sets of input registers which store respective addresses; an address modifying means, coupled to said multiple sets of input registers, which receives a command of a particular type, and in response, selects one register in one set and generates a modified address by performing a selectable operation on the address that is in said one register; and, a boundary check means, coupled to said address modifying means, which stores a respective minimum limit and a respective maximum limit for each register set; said boundary check means also including a gating means which -a) gates said minimum limit for said one register set to an output bus if said modified address is more than the maximum limit for said one register set; and b) otherwise gates said modified address to said output bus.

Inventors: CONKLIN ROBERT DAVIS, RHODES JAMES VERNON, CONKLIN, ROBERT, DAVIS, RHODES, JAMES, VERNON
Applicants: UNISYS CORP, UNISYS CORPORATION
Application year: 2000
Main classification: G01R31
IPC codes: G01R31, G06F11