Abstract:
An improved row decoding technique for use in a static RAM. Three stages of row decoders are utilized to further decode partially decoded row address signals and combine the decoded signals with a column address signal to enable selected rows of the memory array. To optimize decoding speed, each stage comprises gates which receive only two inputs from the prior stage and the stages are arranged to allow for sharing of signals between adjacent decoders.

Description:
BACKGROUND OF THE INVENTION 
     This is a continuation-in-part of application Ser. No. 534,510 filed in the U.S. Patent and Trademark Office on Sept. 21, 1983, whose disclosure is incorporated hereby by reference. 
    
    
     The present invention is concerned with decoding in random access memories and in particular is concerned with a 64K memory. 
     An object of the invention is to provide an improved arrangement for decoding addresses. 
    
    
     BRIEF DESCRIPTION OF THE FIGURES 
     FIG. 1 is a block diagram of a RAM where the invention can be used. 
     FIG. 2 shows the final stages of multistage decoding according to the present invention. 
     FIG. 3 shows a first stage of multistage decoding. 
     FIG. 4 shows a ciruit implementation of logic gates of FIG. 2. 
    
    
     DETAILED DESCRIPTION 
     The unique multi-stage decoding is illustrated in FIGS. 2, 3, and 4. It will be noted that each stage in FIG. 2 has only two inputs. This greatly improves the speed and the layout. As shown in FIG. 2, on the left there are nine lines, eight of which represent logical combinations for row addresses A 0  through A 3 . On the right side, there are 8 lines for the rows A 4  through A 7 . The ninth lines on the left and right are marked A15 and A 15 . The sixteen partially decoded row addresses are inputs from earlier stages. In FIG. 2, the first stage of decoding is a NAND gate 100 which receives signals from two of the predecoded row address lines. This is applied to the second stages which consist of two NOR gates 102. These each receive a second input from adjacent first stage decoders, and provide an output to the final stage 104 of decoding. Stage 104 selects whether the left half or the right half will be used. Its output is applied to a buffer inverter 106. 
     More particularly, the row address bits are received by logic circuitry similar to that shown in FIG. 3. A n  and A n+1  inputs on lines 110 and 112 represent paired row address bits, such as A 0  and A 1 . These two bits are then processed through the various inverters and NAND gates as illustrated to develop four outputs A n .A n+1 , A n .A n+1 , A n .A n+1  and A n .A n+1  on lines 114, 116, 118 and 120, respectively. These outputs represent the result of a first stage of decoding of the paired row address bits A n  and A n+1 . 
     In a system utilizing an eight bit (A 0  -A 7 ) row address signal, four circuits such as shown in FIG. 3 would be used to provide a total of sixteen partially decoded row address signals for further processing. That is, A 0  and A 1  would be logically processed in one such circuit to provide four outputs representative of A 0 . A 1 , A 0 .A 1 , A 0 .A 1 , and A 0 .A 1  on lines 114, 116, 118 and 120 respectively. Similarly, row address bits A 2  and A 3 , A 4  and A 5  and A 6  and A 7  would be combined in other such circuits to each provide four further outputs on the appropriate lines for a total of sixteen partially decoded row address signals. 
     It is these sixteen partially decoded row address signals which provide inputs to the representational decoding circuitry of FIG. 2. The four A 0  A 1  combination signals and the four A 2  A 3  combination signals are received at the left of FIG. 2 on the lines labelled &#34;Predecoded Row Address A 0  →A 3 .&#34; Similarly, the four A 4  A 5  combination signals and the four A 6  A 7  combination signals are received at the right of FIG. 2 on the lines labelled &#34;Predecoded Row Address A 4  →A 7 .&#34; 
     The circuitry of FIG. 2 provides the final stages of the multistage decoding of the present invention. Left and right NAND gates 100 each receive two partially decoded inputs for further decoding. Left NAND gate 100 receives one A 0  A 1  combination signal as one input and one A 2  A 3  combination signal as its other input. Right NAND gate 100 receives one A 4  A 5  combination signal as one input and one A 6  A 7  combination signal as its other input. The outputs of left and right NAND gates 100 are further decoded through upper NOR gate 102 to drive row line 122 high or low, depending on whether it is the &#34;addressed&#34; row or not. 
     In this fashion, an eight bit row address signal is decoded through three stages (stage one in the logic circuitry of FIG. 3, stage two at NAND gate 100, and stage three at NOR gate 102) to excite the desired row address line, e.g., line 122. The use of this multistage decoding technique allows each stage to be optimized for the greatest possible operational speed. Because of the selective optimization of the individual stages, the multistage decoding technique of the present invention provides a faster chip access time than conventional methods which typically utilize a single-stage, eight-input decoding gate for each row line. 
     A further selection process is performed by left and right NAND gates 104 to decide whether X n  left or right is to be excited. Row line 122 serves as one input to each NAND gate 104 with A 15  being the other input to left NAND gate 104 and A 15  being the other input to right NAND gate 104. Because A 15  and A 15  are logical opposites, only one of NAND gates 104 will be activated. The output of the activated NAND gate 104 is then buffered by a buffer gate 106 to excite the appropriate X n . 
     In this final selection stage, the signal A 15  is used to select on which side of the cell matrix the row line is to be excited. In the preferred embodiment, A 15  is the most significant bit of the eight bit column address signal. Accordingly, A 15  will be &#34;high&#34; only when the second (right) half of the cell matrix is being addressed. When this occurs, X n  (right) will be excited. Otherwise, A 15  will be &#34;low&#34; (A 15  &#34;high&#34;), and X n  (left) will be excited. In this fashion, power consumption is reduced because only that half of the matrix which is being addressed is &#34;powered up.&#34; In the preferred embodiment, A 15  indicates which side of the matrix is being addressed (and thus, &#34;powered up&#34;), and correspondingly excites the desired row line solely on that side of the cell matrix by means of NAND gates 104. Of course, any signal indicative of the half of the cell matrix being addressed could be used in the place of illustrative signal A 15 . 
     In a system having an eight bit row address signal, there will be 256 row address lines such as lines 122, 124, 126 and 130 illustrated in FIG. 2. NAND gates 100 and NOR gates 102 are accordingly laid out on the chip architecture to allow adjacent decoders to be shared as illustrated. For example, the particular A 4  A 5  and A 6  A 7  combination decoded by right NAND gate 100 is sent via line 130 to the next adjacent decoder for final stage decoding with a decoded signal from a different A 0  A 1  and A 2  A 3  combination than it was originally processed within upper NOR gate 102. Similarly, lower NOR gate 102 receives as one of its inputs the decoded output of a different A 4  A 5  and A 6  A 7  combination from the next lower decoder. It will be understood that X N+1  is adjacent to X N  in the sense that X N+1  is physically next to X N  on the chip. These two lines are not necessarily next to each other in a mathematical sense. 
     FIG. 4 illustrates a schematic representation of one embodiment of a CMOS implementation of the logic circuitry of FIG. 2 with the corresponding gates bearing like reference numerals.