Abstract:
A programmable function unit (PFU) well adapted for use in a field programmable gate array (FPGA) is disclosed. The PFU utilizes programmable fast ripple logic. A programmable generator and/or a programmable propagator are implemented in look up tables in each PFU block. A multiplexer under control of the propagator determines whether to transmit the carry in from the previous block or to transmit the generator signal.

Description:
TECHNICAL FIELD 
     This invention relates to programmable logic devices in general, and has particular applicability to field programmable gate arrays which utilize programmable function units (PFUs). 
     BACKGROUND OF THE INVENTION 
     FIG. 1 depicts a programmable function unit (PFU) (also termed in the art a configurable logic block). 
     Reference numeral 13 denotes an 8-bit look-up table which has three inputs denoted by reference numerals 19, 21, and 23, respectively A 0 , B 0 , and the output of multiplexer 15. Multiplexer 15 receives inputs C in  and C 0  denoted by reference numerals 17 and 35, respectively. The output of look-up table 13 is carried on line 25, denoted by Output 0 . 
     Look-up table 13 is pre-programmed to perform a predetermined function of the three inputs on lines 19, 21 and 23, and to provide an output designated Output 0  on line 25. In general look-up tables, such as table 13, perform general combinatorial or control logic, RAM or data path functions based upon the inputs A 0 , B 0  and C 0 . If desired, additional inputs to look-up table (LUT) 13 may be provided, and the size of the look-up table increased. For example, if one more input is provided, the LUT 13 may be a 16 bit LUT. 
     In order to increase the speed of data path functions, fast-carry logic is implemented. This hard-wired fast-carry operation is provided by a hard-wired logic 27 which has three inputs A 0  and B 0  and C in , reference numerals 19, 21 and 17, respectively. This hard-wired carry logic 27 may also receive additional signals used to implement higher-level functions. Also, in this mode (termed a &#34;ripple mode&#34;) multiplexer 15 selects C in  as the third input to LUT 13. Thus, in the ripple mode, block 28 receives three inputs, A 0  (19), B 0  (21), and C in  (17) and produces Output 0  together with a carry-out signal 18 produced by hard-wired logic 27 as a function of A 0  (19), B 0  (21), and C in , (17). This carry-out signal may be used as the carry-in signal to the next block 29. Thus, each block, 28, can perform a single bit of a fast data path operation. 
     Similar functionality is provided in block 29 producing an Output 1  denoted by reference numeral 31 and a carry output C out  denoted by reference numeral 33. Generally, blocks such as 28, 29 can be cascaded as needed, thereby creating an n-bit data path function. Typical FPGA PFUs may contain one to eight blocks configured similar to block 28 and linked by carry signals in a manner akin to signal 18 between blocks 28 and 29. 
     The logic employed in reference numeral 27 is termed &#34;fast-carry logic.&#34; One disadvantage to the configuration depicted in FIG. 1 is that the logic in block 27 is hard-wired. Consequently, there is no flexibility in determining the output (e.g., 18) of the fast-carry operation. In addition, logic function 27 may consume a significant amount of silicon real estate. 
     SUMMARY OF THE INVENTION 
     A programmable function unit (PFU) well adapted for use in a field programmable gate array (FPGA) is disclosed. The PFU utilizes programmable fast ripple logic. A programmable generator and a programmable propagator are each implemented in look-up tables in each block. A multiplexer under control of the propagator determines whether to transmit the carry-out from the previous block or to transmit the generator signal. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a schematic diagram of a prior art programmable function unit; and 
     FIGS. 2-4 are schematic diagrams of an illustrative embodiment of the present invention. 
    
    
     DETAILED DESCRIPTION 
     An advantage of the present invention is that it permits the fast-carry logic to be programmable. Thus, the logic can perform ripple-type functions other than a fast-carry. 
     Turning to FIG. 2, reference numeral 120 denotes a 16-bit look-up table which may be partitioned into two eight-bit look-up tables 122 and 124, respectively, depending upon the mode of operation desired. (By contrast, the system of FIG. 1 contains only one look-up table per block.) As will be explained below, each 16 bit look-up table can be utilized (together with a multiplexer) to perform any function of four inputs (when not in the ripple mode). 
     In operation, carry-in signal 117 is multiplexed in multiplexer 115 with input signal C 0  denoted by reference numeral 125. The output 116 of multiplexer 115, together with inputs A 0  and B 0 , denoted by reference numerals 119 and 121, is provided to both look-up tables 124 and 122, respectively. 
     The output of look-up table 124, denoted by reference numeral 125, is Out 0 . The output of look-up table 122, denoted by reference numeral 130 is a propagate signal, PROP 0 . In the ripple mode, PROP 0  is used as a programmable propagate signal. Programmable signal 130 is input to multiplexer 128. The propagate signal controls multiplexer 128 to determine whether carry-in signal 117 should be &#34;propagated,&#34;i.e., passed through as a carry-out signal 134. (As will be explained below, the carry-out signal of one block becomes the carry-in signal of another block.) 
     Under various circumstances, the user may not want carry-in signal, C in , 117 to propagate to the next block (i.e., to line 134). With the present invention, it is possible, if desired, to separately generate a signal based on other signals as well as C in  117 and send this generated signal to output 134 rather than the carry-in signal, C in , 117. Look-up table 132 provides a means for generating such a signal, 135. In this embodiment, look-up table 132 is an 8-bit look-up table. Also, in this embodiment, inputs to look-up table 132 are signal A 0  denoted by reference numeral 119, signal B 0  denoted by reference numeral 121, and carry-in signal denoted by reference numeral 117 (which are the same inputs to look-up tables 122 and 124). Look-up table 132 then produces a &#34;generate&#34; signal 135 which is input to multiplexer 128. Multiplexer 128, under the control of propagate signal 130, determines whether the carry-in signal 117 or the generate signal 1235 will be applied to output 134. Consequently, the output of multiplexer 128 can be any function desired by the programmer. Such flexibility is absent from the hard-wired logic governed system of FIG. 1. 
     In an alternative embodiment, reference numeral 132 may designate a four-bit look-up table which calculates a generate signal based only upon A 0  and B 0 . 
     If not in the ripple mode (Ripple Mode=&#34;0&#34;), the configuration as shown in FIG. 2 may be used to calculate any function of four inputs. For example, look-up tables 122 and 124 may be each used to calculate a function of three inputs, A 0 , B 0  , and C 0  (no use is made of C in  signal 117 because when the ripple control signal 143 is off (&#34;0&#34;), multiplexer 115 transmits signal C 0  125 and suppresses C in  117. The output of look-up table 122 is carried on signal 130 to multiplexer 126. The output of look-up table 124 is carried on signal 125, also to multiplexer 126. The control signal for multiplexer 126 is received from the output 140 of OR gate 141. Inputs to OR gate 141 are signal D 0  142 and ripple mode signal 143. If ripple control signal 143 is off (&#34;0&#34;), the output of OR gate 141 is D 0 . Multiplexer 126 then provides output 145 which is thereby any function of four inputs A 0 , B 0 , C 0 , and D 0 . 
     When in Ripple Mode (Ripple Mode=&#34;1&#34;), the multiplexer 126 always selects OUT 0  125 and places it onto PFU Output 0  145. Thus in ripple mode, PFU Output 0  is based upon the output of the LUT 124, having inputs A 0 , B 0 , and C in . When not in Ripple Mode (Ripple Mode=&#34;0&#34;), the multiplexer 126 selects between OUT 0  125 and PROP 0  130 and places it onto PFU Output 0  145, based upon the value of D 0 . Thus when not in Ripple Mode (Ripple Mode=&#34;0&#34;), PFU Output 0  is based upon look-up tables 122 and 124, both of which have inputs A 0 , B 0 , and C 0 , as well as the signal D 0  which controls the multiplexer 126. 
     The functionality just described indicated in FIG. 2 below dotted line 100 may be repeated as many times as desired. Above line 100 in FIG. 2 a similar cell is provided. Two 8-bit (or one 16-bit) look-up tables 222, 224 receive inputs A 1  and B 1  together with input 216 from multiplexer 215. Multiplexer 215 receives inputs C 1  235 and C in  which is denoted by reference numeral 134. Signal 134 is termed the &#34;carry-out&#34; from multiplexer 128 and also termed the &#34;carry-in&#34; to multiplexer 215. Thus, signal 134 provides a link between individual blocks of the PFU. A typical modern PFU contains four blocks similar to that just described in FIG. 2 below dotted line 100. If desired, other inputs may be provided to both look-up tables 120 and 132. For example, additional control signals which govern whether look-up tables 120 and/or 122 may perform addition or subtraction under user control may be added. 
     One advantage of the new PFU over previous PFUs is that the carry signal has programmable functionality. A second advantage is that the look-up table creating the propagate function 130 is used in both ripple mode and non-ripple mode. The look-up table 132 used to create the generate function is only used during ripple mode. 
     Thus, to save on PFU size, another embodiment of the present invention is depicted in FIG. 3. In general, the circuit illustrated in FIG. 3 is a physically smaller version of the fast programmable generate/propagate depicted in FIG. 2. Thus, a major advantage of the previously-described programmable generate/propagate circuit, namely speed, is maintained, while an area savings is realized as well. A disadvantage is that the generate portion of the circuit is not as programmable as before. FIG. 3 depicts a configuration similar to that shown in FIG. 2. However, programmable look-up table 132 has been replaced by hard-wired logic 200 having inputs A 0  119, B 0  121, and C in  117. 
     The general PFU output and propagate portions of the circuit of FIG. 3 are the same as FIG. 2. However, the generate portion of the circuit is hard-wired to perform only a small number of functions. 
     FIG. 4 illustrates an embodiment with four blocks with hard-wired combinatorial generate logic, 401, 402, 403 and 404. In FIG. 4, the general PFU output, generate, and propagate functions for each block are similar to those described in detail in connection with FIG. 2. In addition, the circuit of FIG. 4 features a very fast PFU carry-out on output 311. 
     If all four of the propagate functions PROP 0 , PROP 1 , PROP 2  and PROP 3  (430, 530, 630 and 730, respectively), are set to &#34;1&#34;, then all four blocks would propagate their carry-in to their carry-out. This would ultimately propagate the PFU C in  417 to the PFU C out  311. Therefore a faster PFU C in  417 to PFU C out  311 delay can be obtained by using AND gate 300, which controls multiplexer 302. The four inputs to AND gate 300 are the four propagate signals PROP 0 , PROP 1 , PROP 2  and PROP 3 . If all four of these signals are set to &#34;1&#34;, then the PFU C in  signal 417 is propagated immediately to the PFU C out  signal 311 through multiplexer 302 without passing through the fast carry logic in each block, thus decreasing the PFU C in  to PFU C out  delay. If any of the four propagate signals are &#34;0&#34;, then the multiplexer 302 selects the carry out from the last stage 817, thus producing the PFU C out  signal 311 in the same manner as in FIG. 3.