Abstract:
Presented is an integrated circuit chip including a random access memory (RAM) array, serial access memory (SAM), an arithmetic logic unit, a bidirectional shift register, and masking circuitry. The arithmetic logic unit, SAM, shift register, and masking circuitry are all as wide as one side of the RAM array, and are all communicable with each other via data transfer means. This allows wide word processing, user configurable for parallel processing. Bits masked by the masking circuitry are selectable by data in the bidirectional shift register, providing shiftable masking means. Random access and serial access are done through separate ports. The bidirectional shift register is optionally serially accessible. Methods of use are also presented.

Description:
This is a continuation of application Ser. No. 07/842,791, filed Feb. 27, 1992, now U.S. Pat. No. 5,475,631, which is a continuation of application Ser. No. 07/321,184, filed Mar. 9, 1989, now abandoned. 
    
    
     FIELD OF THE INVENTION 
     This invention generally applies to parallel and video digital processing, specifically to multiport random access memory based multiprocessing. 
     PRIOR ART 
     Two trends in computer technology are evident today: increasing desire for high volume data processing ability (massive number crunching ability), and increasing desire for fast data access ability. These two trends go hand in hand. Massive number crunching ability is not efficient if the device spends most of its time waiting for input data. On the other hand, fast data access ability does not have much significance when used with a relatively slow processor. 
     Some have turned to parallel processing techniques for answers to the number crunching problem, the theory being that if a uniprocessor (one processor) performs an operation fast, a multiprocessor (more than one processor working in parallel) performs the operation much faster. 
     Others, for video processing, have developed fast data access techniques. Video applications require large amounts of data from memory in very short times to refresh video screens, which means fast data access is required. Standard dynamic random access memory (dynamic RAM) is not fast enough to do this because data in RAM is accessed on a per address basis. When data is read from or written to RAM (either operation being called &#34;access&#34;), an address corresponding to the data must be indicated to the RAM, which lengthens access time. This time is extended further because dynamic RAM addressing is multiplexed, and internally utilizes a destructive read, which means each read cycle must be long enough to allow the memory to restore any cells that have been read. 
     Some techniques have been developed to reduce this data access bottleneck. One is the combination of RAM and SAM (serial access memory, such as a shift register or equivalent), wherein a block of data (such as a row of memory) is wholly transferable between SAM and RAM. A data block can be wholly transferred from RAM to SAM, and then serially read from SAM, the serial read being fast. Conversely, a data block can be serially written into SAM (a fast data write), then wholly transferred into RAM. This approach requires addressing of only a data block, then serially accessing the information within the block. SAM access is also faster because a SAM read is not destructive, so no time must be taken to restore read bits. 
     An interesting parallel processing prior art technique, the &#34;intelligent memory&#34; chip set, which performs matrix multiplication, has been developed by Steven G. Morton of Oxford Computers in Oxford, Conn. This invention is described in articles &#34;Intelligent Memory Chips Provide Ultra High Performance Digital Signal Processing and Pattern Recognition&#34;, S. Morton, May 20, 1988, submitted to Electronic Imaging 1988 Conference; &#34;&#34;Smart&#34; RAM Pulls Vector Duty&#34;, R. Colin Johnson, Electronic Engineering Times, Apr. 25, 1988, p. 1; &#34;Intelligent Memory Chips Break the Von Neumann Bottleneck&#34;, S. Morton, Synapse Connection, April 1988, p. 1; &#34;Matrix Crunching with Massive Parallelism&#34;, Bob Cushman, VLSI Systems Design, December 1988. Morton&#39;s design includes special purpose memory chips which are controlled to produce partial products, the partial products then being sent to an accumulator chip for final adding. 
     Video processing prior art includes a multiport DRAM, made by Digital Equipment Corporation (DEC), of Maynard, Mass. The multiport DRAM has RAM and at least one shift register on a common substrate, each having a port for accessibility. Also made is a video RAM (VRAM), by Texas Instruments Incorporated of Dallas Tex., which is a dual port DRAM. 
     A single chip multiprocessor would be advantageous. Of further advantage would be a multiprocessor with multiport RAM fast data accessibility. Hence the conception of a wide processor included within a multiport RAM, also called a multiport RAM based multiprocessor. Such a processor would include both fast access and multiprocessing in a single, easy to use chip. 
     SUMMARY OF THE INVENTION 
     Several embodiments of the invention are disclosed herein. A first embodiment of the invention is disclosed which includes a multiport RAM which includes an ALU and a latch. The ALU uses an entire RAM row and an entire SAM register as inputs, outputting to the latch. Rows of data are transferable between RAM, SAM, and the latch. RAM and SAM access is consistent with prior art multiport RAM operation. Five more embodiments of increasing complexity are also disclosed, the final and sixth embodiment being preferred, which includes a bidirectional shift register (BSR) which inputs to the ALU, masking means controllable by the BSR, and two SAM registers, one of which obtains the ALU output. 
     One advantage is that blocks (such as rows) of data can be processed simultaneously. If the blocks are segmented into data words, the effect is that those words are processed in parallel. The disclosed embodiments each contain 1 megabit of RAM and each process 2048 bits in parallel, which can be segmented into any desired smaller word width. 
     Another advantage is that the invention is containable within a single chip, reducing cost and enhancing ease of implementation. 
     Another advantage is that chips embodying the invention can be cascaded for higher parallelism. For example, if one chip processes 2048 bits in parallel, two cascaded chips process 4096 bits in parallel. 
     Another advantage is that each element within the preferred embodiment can be made separately accessible. For example, the multiport RAM based multiprocessor can be used as a RAM device, shift register, processor, or a combination of the three. 
     Another advantage is that an embodiment of the invention can perform parallel binary operations on blocks of data, as well as perform matrix multiplication. 
     The preferred embodiment of the invention includes circuitry for a shiftable mask, which is useful for moving windows superimposed on a video field. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram of a first embodiment, showing RAM, SAM, an ALU, and a latch. 
     FIG. 2 shows one slice of the first embodiment, detailing cells in the RAM, SAM, ALU, and latch, and connections between them. 
     FIG. 3 contains a table showing a selective clear operation in the first embodiment. &#34;X&#34; in the table indicates a &#34;don&#39;t care&#34; bit. 
     FIG. 4 shows two slices of a second embodiment, detailing cells in the RAM, SAM, ALU, and latch, and connections between them. 
     FIG. 5 shows two slices of a third embodiment, detailing cells in the RAM, SAM, ripple carry adding ALU, and latch, and connections between them. 
     FIG. 6 contains a table showing an addition operation by the second embodiment. &#34;X&#34; in the table indicates a &#34;don&#39;t care&#34; bit. 
     FIG. 7 contains a table showing an addition operation by the third embodiment. 
     FIG. 8 is a block diagram of a fourth and fifth embodiment, showing RAM, SAM, an ALU, and a bidirectional shift register (BSR). 
     FIG. 9 shows two slices of the fourth embodiment, detailing cells in the RAM, SAM, ALU, and BSR, and connections between them. 
     FIGS. 10a and 10b show a novel multiplication algorithm by way of example. 
     FIG. 11 contains a table showing a matrix multiplication operation by the fourth embodiment. 
     FIG. 12 shows two slices of a fifth embodiment, detailing mask circuitry. 
     FIG. 13 contains a table showing a mask operation. 
     FIG. 14 is a block diagram of a sixth embodiment, showing RAM, two SAMs, an ALU, and a BSR. 
     FIG. 15 shows two slices of a sixth embodiment. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Six embodiments are now disclosed, in order of increasing complexity. The first embodiment performs simple parallel logic operations. The second embodiment can be cycled to perform simple parallel addition, as well as other operations. The third embodiment includes a ripple carry adder and therefore performs single cycle parallel addition. The fourth embodiment includes a ripple carry adder and a bidirectional shift register (BSR), and is configured so that matrix multiplication is easily performed. The fifth embodiment includes all of the fourth, and also includes mask circuitry on the BSR outputs, making shiftable mask operations possible. The sixth embodiment includes all of the fifth, and also includes another SAM register and an optional port on the BSR. 
     As shown in FIG. 1, a first embodiment of the invention includes a 512 row by 2048 column array of RAM 10, a 2048 bit wide SAM register 20, a 2048 bit ALU 30, and a 2048 bit latch 40. These units are connected in such a way that corresponding bits of a selected row in RAM 10, the SAM register 20, the ALU 30, and the latch 40 define a bit slice 50 of a total 2048 bit wide multiprocessor. 
     One slice 50 of the embodiment is detailed in FIG. 2. In one of 2048 ALU cells 31, a first input 32 is taken from a corresponding one of 2048 SAM cells 21. A second ALU cell input 33 is taken from a corresponding one of 2048 data buses 12. The ALU cell 31 outputs to a corresponding one of 2048 latch cells 41. The SAM cell 21, the latch cell 41, and a RAM cell 11 in a corresponding one of 2048 columns 13 all communicate bidirectionally on the data bus 12. For each slice 50, only one cell 11, 21, 31, or 41 drives the data bus 12 at a time. Although only one line is shown for data bus 12, a plurality of data wires can be used for one bus 12, such as one wire for data, and one wire for its inverse. Control signals 14 control the action of each cell 11, 21, 31, and 41. Included in the control signals 14 is SAM 20 decoding. 
     The SAM register 20 behaves like a latch, having bidirectional parallel access to the data buses 12, and having bidirectional serial access to the outside world. Although the SAM register 20 could be, and acts like, a shift register, a pointer latch technique is used, where each cell 21 in the SAM register 20 is decodably accessed. A counter (not shown) generates this address, so that as the counter increments or decrements, each SAM register cell 21 is serially accessed, giving the illusion that bits are being shifted in or out. This is in contrast to shift register practice, where bits are indeed shifted from cell to cell. In this application, both techniques render data serially accessible and are equally usable. 
     A selective clear (also called a masked clear) operation, such as might be used to clear carry bits C, is shown in FIG. 3. Data to be masked is loaded into a RAM 10 row RAM1. This can be done by standard RAM access techniques, or the data can be serially loaded into the SAM register 20 and then wholly transferred into the RAM 10 row RAM1. The mask is then loaded into the SAM register 20. This can be done by serially loading the mask into SAM 20, or by wholly transferring the contents of a RAM 10 row into SAM 20. The ALU 30 then performs an AND operation, using the selected RAM 10 row RAM1 and the SAM register 20 as inputs, and placing the output into the latch 40. The result, with selected bits now cleared and the rest unaltered, is then wholly transferrable into RAM 10 or SAM 20, for access, storage, or further processing. Similar simple logic such as OR, XOR, NAND, NOR, XNOR, Set, and Clear can be performed just as easily. 
     A second embodiment, detailed in FIG. 4, includes all of the first, with the exception that the latch 40 is a shift register. Using this shift register 40 with a simple logic ALU 30 as described above, the second embodiment performs parallel addition as well as simple logic. Such an addition is detailed in FIG. 5, which follows the description below. 
     In the example, two nibble adds are performed simultaneously. In the actual device, the number of columns divided by n+1 for a word width n gives the number of words that can be added in parallel (n+1 allows space for a carry bit for each word). For example, this embodiment (2048 columns, 13) can add 409 nibbles or 227 bytes in parallel. 
     The ALU 30 in the second embodiment does simple logic, so addition is done in steps. For an n-bit word addition, n addition cycles are required to process the resulting carry bits. 
     As shown in FIGS. 1, 4 and 5, each nibble has four bits, arranged from least significant to most significant. Associated with each nibble is one carry bit C. 
     An addition operation for 1010+0110 and 1110+1101 using the second embodiment is now described. RAM1 and RAM2 are first and second rows 15 in RAM 10, and SAM is the SAM register. The addition operation shown adds RAM1 and RAM2 and places the result in RAM2. A row RAM3 is used as a &#34;scratchpad&#34; row. 
     First, the apparatus is initialized by the user. This consists of loading words to be added, clearing the carry bits C (using a masked clear), and transferring a word set to SAM 20. In this example the words are arranged as first and second nibble sets, each nibble set including first and second nibbles. The first nibble set is loaded into RAM1 and the second nibble set is loaded into RAM2. This loading can be done by random accessing RAM 10 itself, or by serially loading a nibble set into SAM 20, then wholly transferring the set from SAM 20 to a row 15 in RAM 10. 
     The masked clear is done as previously described, by serially loading mask bits into SAM 20, then using the ALU 30 to AND SAM 20 with RAM1 and RAM2. In this way the carry bits C are masked to zero, while the original data bits are retained. RAM1 is then transferred to SAM 20 in preparation for addition cycles. Clearing the carry bits C can also be done by other means previous to loading the data into the apparatus. If this second approach is used, the above described masking steps done by the apparatus can be skipped. 
     The first add cycle is now described. RAM2 is XORed with SAM 20 (which contains the nibble set from RAM1), the result (Sum) going to the latch 40. The latch 40 contents are then transferred to &#34;scratchpad&#34; row RAM3. Then RAM2 is ANDed with SAM 20 (which still contains the RAM1 nibble set), the result (Carry) going to the latch 40. The latch 40 contents are then shifted up one column (to move the carry bits up for the next add cycle) and transferred to SAM 20. 
     This cycle is repeated, alternating the use of RAM2 and RAM3 with each cycle, as shown in FIG. 5. 
     The last (in this case, fourth) cycle need not find and shift carry bits C, as the carry bits C are fully worked out by this cycle. The addition operation answer is in RAM2. 
     The second embodiment also multiplies and divides by powers of two by shifting data in the latch 40. Shifting data left one bit has the same effect as multiplying by two. Conversely, shifting data right one bit has the same effect as dividing by two. 
     A third embodiment of the invention, detailed in FIG. 5, includes all of the second as described above, and also includes a full function ALU 30&#39; that performs ripple carry addition, indicated by carry signals 34&#39;. In this embodiment, no addition cycles are necessary because of the ripple carry addition ability of the ALU 30&#39;. FIG. 7 shows the parallel addition of 1010+0110 and 1110+1101 using the third embodiment. In view of the foregoing discussion of the operation of the second embodiment, FIG. 7 is self explanatory. 
     A fourth embodiment, shown in FIGS. 8 and 9, includes a 512 row by 2048 column array of RAM 10, a 2048 bit wide SAM register 20, a 2048 bit ALU 30&#39;, and a 2048 bit bidirectional shift register (BSR) 40&#39;. These units are connected in such a way that corresponding bits of a selected row 15, the SAM register 20, the ALU 30&#39;, and the BSR 40&#39; define a bit slice 50&#39; of a total 2048 bit wide multiprocessor. 
     Two slices 50&#39; of the embodiment are detailed in FIG. 9. In one of 2048 ALU cells 31&#39;, a first input 32&#39; is taken from a corresponding one of 2048 BSR cells 41&#39;. A second ALU cell input 33&#39; is taken from a corresponding one of 2048 data buses 12. The ALU cell 31&#39; outputs to a corresponding one of 2048 SAM cells 21. In a given slice 50&#39;, the SAM cell 21, the BSR cell 41&#39;, and a RAM cell 11 in a corresponding one of 2048 columns 13 all communicate bidirectionally on the data bus 12. For each slice 50&#39;, only one cell 11, 41&#39;, or 21 drives the data bus 12 at a time. Control signals 14 control the action of each cell 11, 41&#39;, and 21, as well as decode SAM 20. 
     Now disclosed is a multiplication method, using nibbles for an example, said method being highly suited for use with the fourth embodiment. 
     Binary multiplication follows the same form as decimal multiplication. Intermediate products are obtained by multiplying Y by each bit in Z, as shown in FIG. 10a, the least significant bit (lsb) of each intermediate product being placed in the same column as the Z bit used to form the intermediate product. The intermediate products are then summed, the sum being the final product. 
     Binary multiplication offers a unique advantage, in that the intermediate products will either be zero (if the Z bit used is a zero), or Y times a power of two (if the Z bit used is a one). For the example, suppose registers S and R are provided, S being shiftable. Y is loaded into S, and R is cleared. Also suppose that means for addition is provided that can operate on inputs S and R, outputting to R, and that all steps are ordered by controlling means able to make decisions according to bit values in Z. Accept that Z00 denotes the lsb of Z, Z03 denotes the most significant bit (msb) of Z, and Z01 and Z02 denotes the bits between, all the bits of Z being ordered consecutively. The algorithm in FIG. 10b can now be performed, the result residing in R. If Z0n is 1, R obtains the sum of S and R, and S is shifted left one column for use in a subsequent subZ cycle. If Z0n is 0, no sum is performed, and S is still shifted left one column for a subsequent subZ cycle. Note that for a final subZ cycle there are no more subsequent subZ cycles, so the S shift is unnecessary, but still shown in FIG. 10b for consistency. Also note that the number of subZ cycles required is the same as the number of bits in Z. 
     A matrix multiplication example using a parallel application of this method within the fourth embodiment is shown in FIG. 11, referencing FIG. 8, where a 2×2 nibble matrix Y is multiplied by a 2×1 nibble matrix Z, the result being a 2×1 matrix X. After initializing, the multiplication includes one Z cycle per matrix row, each Z cycle including at least one subZ cycle. The number of subZ cycles is determined by the word width in matrix Z (in this case four, because Z is a nibble matrix). 
     Matrix Y in this example includes two columns of data (matrix columns A and B), and two rows (matrix rows 1 and 2). The elements of matrix Y are therefore named A1, A2, B1, B2, as shown in FIG. 11. Similarly shown, matrix Z contains elements Z1 and Z2, and matrix X contains X1 and X2, where 
     
         X1=A1Z1+B1Z2 
    
     and 
     
         X2=A2Z1+B2Z2. 
    
     It should be noted that each element of matrix column A is multiplied by element Z1, and each element of matrix column B is multiplied by element Z2. This is advantageously accomplished in the fourth embodiment by multiplication in parallel of column A with Z1, and column B with Z2, the subproduct columns being accumulatively summed in parallel. It should also be noted that where A1, A2, B1, B2, Z1, and Z2 are all nibbles, X1 and X2 each will contain up to nine bits, necessitating the need for `padding` five zeros (shown as dummy bits D) to the msb end of each nibble, to make room for the final product. 
     Comparing the matrix example of FIG. 11 to the scalar example of FIGS. 10a and 10b, a RAM 10 row RAM3 is used instead of register R, and the BSR 40&#39; is used instead of shift register S. Addition means is accomplished by the ALU 30&#39;. Matrix columns A and B are stored in memory rows RAM1 and RAM2, respectively. The elements of matrix Z are used by controlling means (not shown) to operate the embodiment, similar to the example of FIGS. 10a and 10b. For efficiency, the final subZ cycle of each Z cycle does not contain a shift step. 
     Memory row RAM3 contains a running sum during the whole multiplication, holding the final product when the multiplication is done. 
     Although a 2×2 nibble matrix is shown in the example, this particular embodiment can multiply much larger user-configured matrices. 
     A fifth embodiment, two slices 50&#39; of which are shown in FIG. 12, includes all of the fourth, and also includes mask circuitry 61 on the output of each BSR cell 41&#39;. A control signal 16 disables and enables mask circuitry 61. In this case (using n-channel field effect transistors), a zero on control 16 enables mask circuitry 61, and a one disables. When the mask circuitry 61 is enabled, a zero in BSR cell 41&#39; enables the mask for that bit, not allowing data on the data bus 12 to cross the masking circuitry 61. A one in BSR cell 41&#39; disables the mask for that bit, allowing data on the data bus 12 to cross the masking circuitry 61. An example is shown in the table of FIG. 13. Data bits A reside in RAM 10 row RAM1, and data bits B reside in SAM 20. RAM1 is transferred to SAM 20 with some bits masked (ALU 30&#39; is disabled), bits to be masked determined by zeros in the BSR 40&#39;. Because the mask bits are located in the BSR 40&#39;, the mask can be easily shifted. This feature is highly useful for windowing in video applications, giving the ability for hardware based movement of superimposed windows in a video field without tampering with the window contents. 
     A sixth embodiment shown in FIGS. 14 and 15 includes a first SAM register SAMA 80, a second SAM register SAMB 90&#39;, RAM 10, an ALU 30&#39;, and a BSR 120&#39;. RAM 10, SAMA 80, and SAMB 90&#39; each have their own port. A BSR 120&#39; port (shown in dotted lines) is optional. The sixth embodiment operates like the fifth, with the two SAMs 80 and 90&#39; offering a more flexible architecture. 
     Clearly, many variations can be made to these embodiments while remaining within the scope of the invention. An ALU including functions not described here may be included. Any number of SAM registers, ALUs, and latches might be used, with any communication arrangement between them. Additionally, one or more of the elements described may or may not be ported to the outside world. A 1M×1 bit RAM configuration is disclosed, but other configurations can be used, such as 128 k×8, where each RAM row, SAM, ALU, and latch (or BSR) are 8 bits wide instead of 1. RAM may include static or dynamic RAM or both. Data blocks may be defined as columns instead of rows, or row and column operations may be performed as opposed to simply row operations.