Specialized processing block for programmable logic device

Information

  • Patent Grant
  • 7836117
  • Patent Number
    7,836,117
  • Date Filed
    Tuesday, July 18, 2006
    18 years ago
  • Date Issued
    Tuesday, November 16, 2010
    14 years ago
Abstract
A specialized processing block for a programmable logic device incorporates a fundamental processing unit that performs a sum of two multiplications, adding the partial products of both multiplications without computing the individual multiplications. Such fundamental processing units consume less area than conventional separate multipliers and adders. The specialized processing block further has input and output stages, as well as a loopback function, to allow the block to be configured for various digital signal processing operations.
Description
BACKGROUND OF THE INVENTION

This invention relates to programmable logic devices (PLDs), and, more particularly, to specialized processing blocks which may be included in such devices.


As applications for which PLDs are used increase in complexity, it has become more common to design PLDs to include specialized processing blocks in addition to blocks of generic programmable logic resources. Such specialized processing blocks may include a concentration of circuitry on a PLD that has been partly or fully hardwired to perform one or more specific tasks, such as a logical or a mathematical operation. A specialized processing block may also contain one or more specialized structures, such as an array of configurable memory elements. Examples of structures that are commonly implemented in such specialized processing blocks include: multipliers, arithmetic logic units (ALUs), barrel-shifters, various memory elements (such as FIFO/LIFO/SIPO/RAM/ROM/CAM blocks and register files), AND/NAND/OR/NOR arrays, etc., or combinations thereof.


One particularly useful type of specialized processing block that has been provided on PLDs is a digital signal processing (DSP) block, which may be used to process, e.g., audio signals. Such blocks are frequently also referred to as multiply-accumulate (“MAC”) blocks, because they include structures to perform multiplication operations, and sums and/or accumulations of multiplication operations.


For example, a PLD sold by Altera Corporation, of San Jose, Calif., under the name STRATIX® II includes DSP blocks, each of which includes four 18-by-18 multipliers. Each of those DSP blocks also includes adders and registers, as well as programmable connectors (e.g., multiplexers) that allow the various components to be configured in different ways. In each such block, the multipliers can be configured not only as four individual 18-by-18 multipliers, but also as four smaller multipliers, or as one larger (36-by-36) multiplier. In addition, one 18-by-18 complex multiplication (which decomposes into two 18-by-18 multiplication operations for each of the real and imaginary parts) can be performed. In order to support four 18-by-18 multiplication operations, the block has 4×(18+18)=144 inputs. Similarly, the output of an 18-by-18 multiplication is 36 bits wide, so to support the output of four such multiplication operations, the block also has 36×4=144 outputs.


However, those inputs and outputs may not be used in every mode in which the DSP block can operate. For example, if the DSP block is configured as a finite impulse response (FIR) filter, with 18-bit data and coefficients, each block may be used to perform the summation of four 18-by-18 multiplications to form a 4-tap sub-block of a longer FIR filter. In this case, the number of inputs is 4×(18+18)=144 lines, but the output is only 38 bits wide even though the DSP block is able to support 144 output lines. Similarly, in a 36-by-36 bit multiplication, all four internal multipliers are used but only (36+36)=72 input lines and 72 output lines are used (even though there are 144 input lines and 144 output lines). Hence, in that configuration the input lines are not used fully even though the core of the DSP block is fully used.


Input/output (I/O) drivers and lines can consume significant device area. Indeed, in a DSP block of the aforementioned STRATIX® II PLD, I/O resources consume approximately 50% of the DSP block area. And yet, as discussed above, they are not always used. At the same time, they cannot be eliminated because all of the potential configurations of the block have to be supported.


It would be desirable to be able to reduce the area of a PLD consumed by a specialized processing block such as a DSP block without losing functionality of the block.


SUMMARY OF THE INVENTION

The present invention relates to specialized processing blocks for PLDs wherein the specialized processing blocks have reduced area without losing functionality. According to one aspect of the invention, the specialized processing block preferably includes a plurality of fundamental processing units instead of discrete multipliers. Each fundamental processing unit preferably includes the equivalent of at least two multipliers and logic to sum the partial products of all of the at least two multipliers. As a result, the sums of the all of the multiplications are computed in a single step, rather than summing the partial products of each multiplier to form individual products and then summing those products. Such a fundamental processing unit can be constructed with an area smaller than that of the individual multipliers and adders. If a single multiplication is required to be performed, one of the multipliers in the fundamental processing unit is used, while the inputs to the other(s) are zeroed out. Nevertheless, because the provision of the fundamental processing unit reduces the area of the specialized processing block, efficiency is improved.


In a preferred embodiment, the fundamental processing unit includes the equivalent of two 18-by-18 multipliers and one adder so that it can output the sum of the two multiplication operations. While each of the 18-by-18 multipliers can be configured for a smaller multiplication operation (e.g., 9-by-9 or 12-by-12), the integrated nature of the fundamental processing unit means that the individual multiplier outputs are not accessible. Only the sum is available for use by the remainder of the specialized processing block. Therefore, to obtain the result of a single non-complex multiplication that is 18 bits-by-18 bits or smaller, an entire fundamental processing unit must be used. The second multiplier, which cannot be disengaged, simply has its inputs zeroed.


Preferably, each block includes four such fundamental processing units, preferably arranged in half-blocks having two fundamental processing units each, capable of computing a sum of four multiplications. Additional facility preferably is provided to connect the two half-blocks to allow more complex computations when necessary.


The specialized processing block according to the invention preferably also has an input multiplexing stage that increases the effective number of inputs for certain more complex operations without increasing the number of I/O lines. Similarly, an output cascade stage allows the outputs of several blocks to be chained for certain more complex operations. Therefore the specialized processing block preferably can be configured for various forms of filtering and other digital signal processing operations. In addition, the specialized processing block preferably also has the capability to feed back at least one of its outputs as an input, which is useful for accumulation and also in adaptive filtering operations.


Therefore, in accordance with the present invention, there is provided a specialized processing block for a programmable logic device. The specialized processing block preferably includes a plurality of fundamental processing units, Each of the fundamental processing units includes a plurality of multipliers, circuitry for adding, in one operation, partial products produced by all of the plurality of multipliers, and circuitry interconnecting the fundamental processing units whereby the circuitry for adding adds, in that one operation, the partial products produced by all of the plurality of multipliers in all of the fundamental processing units.





BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objects and advantages of the invention will be apparent upon consideration of the following detailed description, taken in conjunction with the accompanying drawings, in which like reference characters refer to like parts throughout, and in which:



FIG. 1 is a functional diagram of one preferred embodiment of a specialized processing block in accordance with the present invention;



FIG. 2 is a functional diagram of one half of the specialized processing block of FIG. 1;



FIG. 3 is a block diagram of a preferred embodiment of the input multiplexing stage of the specialized processing block of FIGS. 1 and 2;



FIG. 4 is a block diagram of a preferred embodiment of an output stage of a specialized processing block in accordance with the present invention;



FIG. 5 is a diagram of the output stage of FIG. 4 configured in a first mode in accordance with the present invention;



FIG. 6 is a diagram of the output stage of FIG. 4 configured in a second mode in accordance with the present invention;



FIG. 7 is a functional diagram of a specialized processing block in accordance with the present invention configured for arithmetic shifting;



FIG. 8 is a preferred embodiment of an output stage of a specialized processing block in accordance with the present invention configured for logical shifting;



FIG. 9 is a functional diagram of a specialized processing block in accordance with the present invention configured for rotation;



FIG. 10 is a functional diagram of a specialized processing block in accordance with the preferred invention configured as a barrel shifter;



FIG. 11 is a representation of a conventional finite impulse response filter;



FIG. 12 is a functional diagram of a specialized processing block in accordance with the present invention configured as a finite impulse response filter; and



FIG. 13 is a simplified block diagram of an illustrative system employing a programmable logic device incorporating the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The invention will now be described with reference to FIGS. 1-12.



FIG. 1 shows a functional diagram of one preferred embodiment 10 of a specialized processing block according to the invention. As seen in FIG. 1, specialized processing block 10 includes input multiplexing stage 11, multiplication stage 12, and output cascade stage 13.


Input multiplexing stage 11 can format and rearrange the inputs to block 10 as required for particular operations. As described in more detail below, input multiplexing stage 10 can be used to allow the performance, in certain conditions, of operations that require more inputs than there are to block 10, if some of those inputs are duplicates of others.


As one example of the type of formatting performed by input multiplexing stage 11, consider an 18-by-18 complex multiplication in which:

Real Result=Re[(a+jb)×(c+jd)]=(ac−bd)
Imag Result=Im[(a+jb)×(c+jd)]=(ad+bc)

This complex operation requires four 18-by-18 multiplications and hence eight 18-bit inputs, for a total of 144 inputs. Although each half-block 20 can have 144 inputs, in a preferred embodiment, specialized processing block 10 as a whole accepts only 144 inputs. If all of those inputs were routed to only one of the half-blocks 20, there would be no inputs available for the other half-block 20. However, because the complex multiplication referred to above has only four unique 18-bit shared inputs, input multiplexing stage 11 can take the 72 inputs a, b, c and d and perform the necessary duplication so those four inputs are properly routed to the correct multiplier inputs for each of the real and imaginary calculations. This leaves another 72 inputs available for the other half-block 20.


Multiplication stage 12 preferably includes a plurality of fundamental processing units as described above. In a preferred embodiment, each specialized processing block 10 (see FIGS. 1 and 2) includes four fundamental processing units 100, meaning that it can perform up to eight multiplications in groups of two multiplications that are summed together. In that embodiment, the fundamental processing units 100 in specialized processing block 10 preferably are grouped into identical half-blocks 20, so that each half-block 20 in its own right can be considered a specialized processing block within the invention.


Each fundamental processing unit 100 preferably includes the functionality for a sum of two 18-by-18 multiplications. It is possible to negate one of the inputs in input multiplexing stage 11 in order to provide a difference of multiplications.


Each fundamental processing unit 100 preferably supports a sum of two 18-by-18 multiplications and preferably includes two partial product generators 21, two ten-vector-to-two-vector compressors 22, a 4:2 compressor 23, a carry-propagate adder 24 and an output register 25. Adder 24 preferably also includes rounding capability (e.g., round-to-nearest-integer) and saturation capability (e.g., asymmetric saturation—i.e., from −(2n) to +2n−1).


Each partial product generator 21 preferably creates nine 20-bit Booth-encoded vectors (Booth-encoding is a known technique that can reduce the number of partial products), as well as a 17-bit unsigned carry vector (negative partial products are in ones-complement format, with the associated carry-in bit in the carry vector). An additional 19-bit signed partial product may be generated in the case of unsigned multipliers (which preferably will always be zero for signed multipliers). Although preferably up to 11 vectors may be generated, the carry bits preferably can be combined with the partial product vectors, requiring only 10 vectors to be compressed.


In each fundamental processing unit 100, preferably the output of one of the two 10:2 compressors 22 passes through 3:1 multiplexer 26. In a case where fundamental processing unit 100 is being used for only one multiplication of a size up to 18-by-18, zero input 27 of multiplexer 26 is selected, zeroing out one of the two 18-by-18 multiplications. In a case where fundamental processing unit 100 is being used for two 18-by-18 multiplications (including a case where half-block 20 is being used for a sum-of-four 18-by-18 multiplications such as one of the complex multiplications described above), input 28 of multiplexer 26 is selected to pass the compressor vectors unchanged. In a case where both fundamental processing units 100 are being used together to perform a 36-by-36 multiplication, input 29 of multiplexer 26 is selected, passing the output of that one of compressors 22 through an 18-bit left-shifter 200.


As shown in FIGS. 1 and 2, each fundamental processing unit 100 outputs a respective separate output vector P(n) or Q(n). However, an additional 4:2 compressor 201, along with multiplexer 202 and shifter 203, are provided to allow the two fundamental processing units 100 to be used together. In the embodiment shown, 4:2 compressor 201 is included in the right-hand one of fundamental processing units 100, accepting as inputs the output of 4:2 compressor 23 from that fundamental processing unit 100 as well as the output of 4:2 compressor 23 from the left-hand one of fundamental processing units 100, as modified by multiplexer 202.


Thus, zero input 204 of multiplexer 202 zeroes the left-hand input to compressor 201, and is selected when the two fundamental processing units 100 are to be used separately. In a case where the two fundamental processing units 100 are being used together, such as a case where half-block 20 is being used for a sum-of-four 18-by-18 multiplications such as one of the complex multiplications described above, input 205 of multiplexer 202 is selected to pass the compressor vectors unchanged. In a case where both fundamental processing units 100 are being used together to perform a 36-by-36 multiplication, input 206 of multiplexer 22 is selected, passing the output of that one of left-hand compressor 23 through an 18-bit left-shifter 207.


When both fundamental processing units 100 are being used together, the two carry-propagate adders 24 preferably are used as a single adder, as indicated by the dashed lines 240. Similarly, the two output registers 25 preferably are used as a single output register as indicated by dashed lines 250.


Preferably, the Q(n) output (which could include the P(n) output in cases where both fundamental processing units 100 are being used together) can be fed back either to 3:2 compressor 220, which preferably is interposed between 3:1 multiplexer 26 and 4:2 compressor 23 of right-hand fundamental processing unit 100, where it is combined with the output of multiplexer 26 to enable an accumulation function, or to input multiplexing stage 11 as a loopback to enable various adaptive filtering functions. This feedback or loopback preferably is accomplished using optional multiplexers 208-210 and optional connections 211-216.


For example, using optional multiplexer 208 and connections 211-213, one can implement the aforementioned accumulation feedback. In such an embodiment, multiplexer 208 can select either output Q(n) or zero as an input to be fed back.


If optional connection 214 is added between connection 212 and input multiplexing stage 11, and optional multiplexer 209 is added between connections 212 and 213, then the output of multiplexer 208 can be used either as accumulation feedback or as the aforementioned loopback. In loopback mode, multiplexer 209 would select a zero input to prevent the loopback data from reaching compressor 220. In feedback mode, multiplexer 209 would select the feedback data. It is not necessary in feedback mode to provide an additional multiplexer (or other selector device) to prevent the feedback data from reaching input multiplexing stage 11, because internal multiplexers (not shown) in stage 11 can be used for that purpose.


Alternatively, multiplexer 209 and connection 214 can be omitted, and a completely independent loopback path can be established using optional multiplexer 210 and optional connections 215, 216. The two separate paths would not normally be used simultaneously because output Q(n) would not normally be used for both feedback and loopback. However, the two embodiments are essentially interchangeable because each requires two multiplexers.


As indicated in FIG. 1, when outputs P(n), Q(n) are used separately, each can represent, for example, one 18-by-18 multiplication or one sum of two 18-by-18 multiplications. Because an 18-by-18 complex multiplication, as described above, is specialized sum of four 18-by-18 multiplications, the sum of two 18-by-18 multiplications represented by an output P(n) or Q(n) can represent half of an 18-by-18 complex multiplication.


Similarly, as shown, when outputs P(n), Q(n) are used together, the output is represented by Q(n), which can represent, for example, any of one 36-by-36 multiplication, one 52-bit to 72-bit multiply-accumulate function, or one sum of four 18-by-18 multiplications.


As discussed above, each half-block 20 preferably has 72 inputs. Four 18-by-18 multiplications requires 36×4=144 inputs. As also discussed above, in the case of an 18-by-18 complex multiplication, although there are four 18-by-18 multiplications involved, there are really only four 18-bit inputs (72 inputs), which are rearranged as necessary by input multiplexing stage 11. In the case of a sum of four independent 18-by-18 multiplications, input multiplexing stage 11 preferably is used as a shift register as shown in FIG. 3.


As shown in FIG. 3, input multiplexing stage 11 preferably includes, in addition to multiplexers and other circuitry (not shown), a first set of 18-bit registers 30, each of which is associated with one of partial product generators 21, and a second set of 18-bit registers 31, each one of which also is associated with one of partial product generators 21 and all of which are chained together (as at 32). In this way, for each 18-by-18 multiplication, one independent multiplicand may be input via the block inputs 33 and registers 30, while the second input for each 18-by-18 multiplication is shifted in via registers 31. Thus in the case of a sum of four 18-by-18 multiplications, one multiplicand is the same in each of the four multiplications. That one common multiplicand may be input via additional input 34, or the first one of inputs 33 in the first block 10 (assuming cascaded blocks 10 as discussed below), can be connected via multiplexer 35 to chained registers 31.


Outputs P(n), Q(n) can be used individually, or a plurality of blocks 10 (or half-blocks 20) can be chained together using the cascade stage 40 shown in FIG. 4. Using cascade stage 40, output P(n) can be output at 41 via multiplexer 42. Alternatively, output P(n) can be added at 43 to the output of three-input multiplexer 44, then registered at 45 and output at 41 via multiplexer 42 and/or chained to three-input multiplexer 440 or, via line 441, to the third input of three-input multiplexer 44 of the next half-block 20. Similarly, output Q(n) can be output at 410 via multiplexer 420. Alternatively, output Q(n) can be added at 430 to the output of three-input multiplexer 440, then registered at 450 and output at 410 via multiplexer 420 and/or chained to three-input multiplexer 44 of the next half-block 20 or, via line 442, to the third input of three-input multiplexer 440 of the next half-block 20.



FIG. 5 shows an embodiment 50 where the P(n) and Q(n) outputs are cascaded together. In this embodiment, each three-input multiplexer 44, 440 selects its second input and lines 441, 442 are unused. This mode can be used for vector multiplications whose outputs are real, including, but not limited to, systolic form FIR filter 1200, described below in connection with FIG. 12. FIG. 6 shows an interlaced cascade embodiment 60 where the P(n) and Q(n) outputs are cascaded separately. In this embodiment, each three-input multiplexer 44, 440 selects its third input, using lines 441, 442. This mode can be used for vector multiplications whose outputs are complex.


Specialized processing block 10 of the present invention may be programmably configured as a barrel shifter. Specifically, by using the 36-by-36 multiplier mode, a 32-bit vector can be arithmetically or logically shifted to the left or to the right. Such a shift by N bits may be accomplished by multiplying the vector to be shifted by a second vector of equal length, all of whose bits are 0 except for the Nth least significant bit, which is 1.


If the vector to be shifted is sign-extended to 36 bits and the second vector is padded with zeroes to 36 bits, the result is an arithmetic shift, and whether the shift is to the left or to the right depends on whether the result is taken, respectively, from the 32 most significant bits of the 64-bit result, or the 32 least significant bits. FIG. 7 shows such a shifting operation.


Similarly, if both vectors are padded with zeroes to 36 bits, the result is a logical shift, and whether the shift is to the left or to the right depends on whether the result is taken, respectively, from the 32 most significant bits of the 64-bit result, or the 32 least significant bits. FIG. 8 shows such a shifting operation.


In addition, if both vectors are padded with zeroes to 36 bits, and the 32 most significant bits of the 64-bit result are ORed with the 32 least significant bits, the result is a rotation of the N most significant bits of the first vector to the N least significant bits of the result, as shown in FIG. 9.



FIG. 10 shows how the arithmetic and logical shifting, and rotation, can be performed using the 36-by-36 multiplier mode 190 to perform the 32-by-32 multiplication as described above, an OR gate 191 whose inputs are the two 32-bit halves of the 64-bit result, and a three-input multiplexer 192, operating according to the following table:


















A
B
MUX
Result









Signed
Unsigned
00
Arithmetic shift left



Signed
Unsigned
01
Arithmetic shift right



Unsigned
Unsigned
00
Logical shift left



Unsigned
Unsigned
01
Logical shift right



Unsigned
Unsigned
10
Rotation











It should be noted that the arithmetic shift left and the logical shift left produce the same result and thus those cases are redundant. Put another way, a signed input is really needed only for the arithmetic shift right.


Specialized processing block 10 of the present invention may be programmably configured as a finite impulse response (FIR) filter. FIG. 11 shows a conventional FIR filter 1100 of the systolic form, while FIG. 12 shows a systolic form FIR filter 1200 configured from specialized processing block 10. As seen in comparing FIGS. 11 and 12, the use of compressors in fundamental processing units 100 as opposed to additional adders reduces the latency in FIR filter 1200 as compared to FIR filter 1100.


Thus it is seen that a specialized processing block for a programmable logic device, based on a plurality of fundamental processing units, has been provided.


A PLD 90 incorporating such circuitry according to the present invention may be used in many kinds of electronic devices. One possible use is in a data processing system 900 shown in FIG. 13. Data processing system 900 may include one or more of the following components: a processor 901; memory 902; I/O circuitry 903; and peripheral devices 904. These components are coupled together by a system bus 905 and are populated on a circuit board 906 which is contained in an end-user system 907.


System 900 can be used in a wide variety of applications, such as computer networking, data networking, instrumentation, video processing, digital signal processing, or any other application where the advantage of using programmable or reprogrammable logic is desirable. PLD 90 can be used to perform a variety of different logic functions. For example, PLD 90 can be configured as a processor or controller that works in cooperation with processor 901. PLD 90 may also be used as an arbiter for arbitrating access to a shared resources in system 900. In yet another example, PLD 90 can be configured as an interface between processor 901 and one of the other components in system 900. It should be noted that system 900 is only exemplary, and that the true scope and spirit of the invention should be indicated by the following claims.


Various technologies can be used to implement PLDs 90 as described above and incorporating this invention.


It will be understood that the foregoing is only illustrative of the principles of the invention, and that various modifications can be made by those skilled in the art without departing from the scope and spirit of the invention. For example, the various elements of this invention can be provided on a PLD in any desired number and/or arrangement. One skilled in the art will appreciate that the present invention can be practiced by other than the described embodiments, which are presented for purposes of illustration and not of limitation, and the present invention is limited only by the claims that follow.

Claims
  • 1. A specialized processing block for a programmable logic device, said specialized processing block comprising: a plurality of fundamental processing units, each of said fundamental processing units including:a plurality of multipliers, andcircuitry for adding, in one operation, partial products produced by all of said plurality of multipliers; andcircuitry interconnecting said fundamental processing units, said circuitry interconnecting said fundamental processing units comprising circuitry for selectably combining outputs of said plurality of multipliers of each of a plurality of said fundamental processing units for combined input to said circuitry for adding, whereby said circuitry for adding selectably adds, in said one operation, said partial products produced by all of said plurality of multipliers in each of said plurality of said fundamental processing units.
  • 2. The specialized processing block of claim 1 wherein each of said fundamental processing units further comprises circuitry for shifting said partial products prior to adding them.
  • 3. The specialized processing block of claim 1 further comprising loopback circuitry for feeding back an output of said specialized processing block to an input of said specialized processing block.
  • 4. The specialized processing block of claim 3 wherein said loopback circuitry provides an accumulation function.
  • 5. The specialized processing block of claim 3 wherein said loopback circuitry is used to configure said specialized processing block as an adaptive filter.
  • 6. The specialized processing block of claim 3 further comprising input multiplexing circuitry for distributing inputs from a plurality of sources.
  • 7. The specialized processing block of claim 6 wherein said plurality of sources comprises an input to said specialized processing block and an output of said specialized processing block.
  • 8. The specialized processing block of claim 7 wherein said plurality of sources further comprises an input of another said specialized processing block.
  • 9. The specialized processing block of claim 6 wherein said input multiplexing circuitry comprises registers for registering said inputs.
  • 10. The specialized processing block of claim 9 wherein said registers are chained for inputting data seriatim to each said plurality of multipliers.
  • 11. The specialized processing block of claim 1 further comprising an output stage, said output stage including: for each of at least one fundamental processing unit of said specialized processing block:a cascade multiplexer for selecting a previous cascade output,an output cascade adder for adding an output of said at least one fundamental processing unit to said previous cascade output,an output multiplexer for selecting between said output of said at least one fundamental processing unit and an output of said output cascade adder, andfirst and second conductors for conducting said output of said output cascade adder to respective cascade multiplexers associated with subsequent fundamental processing units.
  • 12. The specialized processing block of claim 11 wherein: said first conductor conducts said output of said output cascade adder to an immediately subsequent fundamental processing unit;said second conductor conducts said output of said output cascade adder to a cascade multiplexer associated with a fundamental processing unit immediately subsequent to said immediately subsequent fundamental processing unit; andeach said cascade multiplexer selects among (1) zero, (2) output of an immediately previous output cascade adder, and (3) output of an output cascade adder immediately previous to said immediately previous output cascade adder.
  • 13. A programmable logic device comprising the specialized processing block of claim 1.
  • 14. A digital processing system comprising: processing circuitry;a memory coupled to said processing circuitry; anda programmable logic device as defined in claim 13 coupled to the processing circuitry and the memory.
  • 15. A printed circuit board on which is mounted a programmable logic device as defined in claim 13.
  • 16. The printed circuit board defined in claim 15 further comprising: memory circuitry mounted on the printed circuit board and coupled to the programmable logic device.
  • 17. The printed circuit board defined in claim 16 further comprising: processing circuitry mounted on the printed circuit board and coupled to the memory circuitry.
  • 18. An integrated circuit device comprising the specialized processing block of claim 1.
  • 19. A digital processing system comprising: processing circuitry;a memory coupled to said processing circuitry; andan integrated circuit device as defined in claim 18 coupled to the processing circuitry and the memory.
  • 20. A printed circuit board on which is mounted an integrated circuit device as defined in claim 18.
  • 21. The printed circuit board defined in claim 20 further comprising: memory circuitry mounted on the printed circuit board and coupled to the programmable logic device.
  • 22. The printed circuit board defined in claim 21 further comprising: processing circuitry mounted on the printed circuit board and coupled to the memory circuitry.
  • 23. The specialized processing block of claim 1 wherein said circuitry for selectably combining comprises: a compressor in one of said fundamental processing units; anda multiplexer in a respective other one of said fundamental processing units for selectably inputting said partial products produced by said plurality of multipliers in said respective other one of said fundamental processing units into said compressor in said one of said fundamental processing units.
CROSS REFERENCE TO RELATED APPLICATION

This claims the benefit of commonly-assigned U.S. Provisional Patent Application No. 60/790,404, filed Apr. 7, 2006, which is hereby incorporated by reference herein in its entirety.

US Referenced Citations (292)
Number Name Date Kind
3473160 Wahlstrom Oct 1969 A
4156927 McElroy et al. May 1979 A
4179746 Tubbs Dec 1979 A
4212076 Conners Jul 1980 A
4215406 Gomola et al. Jul 1980 A
4215407 Gomola et al. Jul 1980 A
4422155 Amir et al. Dec 1983 A
4484259 Palmer et al. Nov 1984 A
4521907 Amir et al. Jun 1985 A
4575812 Kloker et al. Mar 1986 A
4597053 Chamberlin Jun 1986 A
4623961 Mackiewicz Nov 1986 A
4682302 Williams Jul 1987 A
4718057 Venkitakrishnan et al. Jan 1988 A
4727508 Williams Feb 1988 A
4791590 Ku et al. Dec 1988 A
4799004 Mori Jan 1989 A
4823295 Mader Apr 1989 A
4839847 Laprade Jun 1989 A
4871930 Wong et al. Oct 1989 A
4912345 Steele et al. Mar 1990 A
4918637 Morton Apr 1990 A
4967160 Quievy et al. Oct 1990 A
4982354 Takeuchi et al. Jan 1991 A
4991010 Hailey et al. Feb 1991 A
4994997 Martin et al. Feb 1991 A
5073863 Zhang Dec 1991 A
5081604 Tanaka Jan 1992 A
5122685 Chan et al. Jun 1992 A
5128559 Steele Jul 1992 A
5175702 Beraud et al. Dec 1992 A
5208491 Ebeling et al. May 1993 A
RE34363 Freeman Aug 1993 E
5267187 Hsieh et al. Nov 1993 A
5296759 Sutherland et al. Mar 1994 A
5338983 Agarwala Aug 1994 A
5339263 White Aug 1994 A
5349250 New Sep 1994 A
5357152 Jennings, III et al. Oct 1994 A
5371422 Patel et al. Dec 1994 A
5381357 Wedgwood et al. Jan 1995 A
5404324 Colon-Benet Apr 1995 A
5424589 Dobbelaere et al. Jun 1995 A
5446651 Moyse et al. Aug 1995 A
5451948 Jekel Sep 1995 A
5452231 Butts et al. Sep 1995 A
5452375 Rousseau et al. Sep 1995 A
5457644 McCollum Oct 1995 A
5465226 Goto Nov 1995 A
5465375 Thepaut et al. Nov 1995 A
5483178 Costello et al. Jan 1996 A
5497498 Taylor Mar 1996 A
5500812 Saishi et al. Mar 1996 A
5500828 Doddington et al. Mar 1996 A
5523963 Hsieh et al. Jun 1996 A
5528550 Pawate et al. Jun 1996 A
5537601 Kimura et al. Jul 1996 A
5541864 Van Bavel et al. Jul 1996 A
5546018 New et al. Aug 1996 A
5550993 Ehlig et al. Aug 1996 A
5559450 Ngai et al. Sep 1996 A
5563526 Hastings et al. Oct 1996 A
5563819 Nelson Oct 1996 A
5570039 Oswald et al. Oct 1996 A
5570040 Lytle et al. Oct 1996 A
5572148 Lytle et al. Nov 1996 A
5581501 Sansbury et al. Dec 1996 A
5590350 Guttag et al. Dec 1996 A
5594366 Khong et al. Jan 1997 A
5594912 Brueckmann et al. Jan 1997 A
5596763 Guttag et al. Jan 1997 A
5606266 Pedersen Feb 1997 A
5617058 Adrian et al. Apr 1997 A
5633601 Nagaraj May 1997 A
5636150 Okamoto Jun 1997 A
5636368 Harrison et al. Jun 1997 A
5640578 Balmer et al. Jun 1997 A
5644522 Moyse et al. Jul 1997 A
5646545 Trimberger et al. Jul 1997 A
5646875 Taborn et al. Jul 1997 A
5648732 Duncan Jul 1997 A
5652903 Weng et al. Jul 1997 A
5655069 Ogawara et al. Aug 1997 A
5664192 Lloyd et al. Sep 1997 A
5689195 Cliff et al. Nov 1997 A
5696708 Leung Dec 1997 A
5729495 Madurawe Mar 1998 A
5740404 Baji Apr 1998 A
5744980 McGowan et al. Apr 1998 A
5744991 Jefferson et al. Apr 1998 A
5754459 Telikepalli May 1998 A
5761483 Trimberger Jun 1998 A
5764555 McPherson et al. Jun 1998 A
5768613 Asghar Jun 1998 A
5777912 Leung et al. Jul 1998 A
5784636 Rupp Jul 1998 A
5790446 Yu et al. Aug 1998 A
5794067 Kadowaki Aug 1998 A
5801546 Pierce et al. Sep 1998 A
5805477 Perner Sep 1998 A
5805913 Guttag et al. Sep 1998 A
5808926 Gorshtein et al. Sep 1998 A
5812479 Cliff et al. Sep 1998 A
5812562 Baeg Sep 1998 A
5815422 Dockser Sep 1998 A
5821776 McGowan Oct 1998 A
5825202 Tavana et al. Oct 1998 A
5838165 Chatter Nov 1998 A
5841684 Dockser Nov 1998 A
5847579 Trimberger Dec 1998 A
5847981 Kelley et al. Dec 1998 A
5859878 Phillips et al. Jan 1999 A
5869979 Bocchino Feb 1999 A
5872380 Rostoker et al. Feb 1999 A
5874834 New Feb 1999 A
5878250 LeBlanc Mar 1999 A
5880981 Kojima et al. Mar 1999 A
5892962 Cloutier Apr 1999 A
5894228 Reddy et al. Apr 1999 A
5898602 Rothman et al. Apr 1999 A
5931898 Khoury Aug 1999 A
5942914 Reddy et al. Aug 1999 A
5944774 Dent Aug 1999 A
5949710 Pass et al. Sep 1999 A
5951673 Miyata Sep 1999 A
5956265 Lewis Sep 1999 A
5959871 Pierzchala et al. Sep 1999 A
5960193 Guttag et al. Sep 1999 A
5961635 Guttag et al. Oct 1999 A
5963048 Harrison et al. Oct 1999 A
5963050 Young et al. Oct 1999 A
5968196 Ramamurthy et al. Oct 1999 A
5970254 Cooke et al. Oct 1999 A
5978260 Trimberger et al. Nov 1999 A
5982195 Cliff et al. Nov 1999 A
5986465 Mendel Nov 1999 A
5991788 Mintzer Nov 1999 A
5991898 Rajski et al. Nov 1999 A
5995748 Guttag et al. Nov 1999 A
5999015 Cliff et al. Dec 1999 A
5999990 Sharrit et al. Dec 1999 A
6005806 Madurawe et al. Dec 1999 A
6006321 Abbott Dec 1999 A
6009451 Burns Dec 1999 A
6018755 Gonikberg et al. Jan 2000 A
6020759 Heile Feb 2000 A
6021423 Nag et al. Feb 2000 A
6029187 Verbauwhede Feb 2000 A
6031763 Sansbury Feb 2000 A
6041340 Mintzer Mar 2000 A
6052327 Reddy et al. Apr 2000 A
6052755 Terrill et al. Apr 2000 A
6055555 Boswell et al. Apr 2000 A
6064614 Khoury May 2000 A
6065131 Andrews et al. May 2000 A
6066960 Pedersen May 2000 A
6069487 Lane et al. May 2000 A
6072994 Phillips et al. Jun 2000 A
6073154 Dick Jun 2000 A
6075381 LaBerge Jun 2000 A
6084429 Trimberger Jul 2000 A
6085317 Smith Jul 2000 A
6091261 DeLange Jul 2000 A
6091765 Pietzold, III et al. Jul 2000 A
6094726 Gonion et al. Jul 2000 A
6097988 Tobias Aug 2000 A
6098163 Guttag et al. Aug 2000 A
6107820 Jefferson et al. Aug 2000 A
6107821 Kelem et al. Aug 2000 A
6107824 Reddy et al. Aug 2000 A
6130554 Kolze et al. Oct 2000 A
6140839 Kaviani et al. Oct 2000 A
6144980 Oberman Nov 2000 A
6154049 New Nov 2000 A
6157210 Zaveri et al. Dec 2000 A
6163788 Chen et al. Dec 2000 A
6167415 Fischer et al. Dec 2000 A
6175849 Smith Jan 2001 B1
6215326 Jefferson et al. Apr 2001 B1
6226735 Mirsky May 2001 B1
6242947 Trimberger Jun 2001 B1
6243729 Staszewski Jun 2001 B1
6246258 Lesea Jun 2001 B1
6279021 Takano et al. Aug 2001 B1
6286024 Yano et al. Sep 2001 B1
6314442 Suzuki Nov 2001 B1
6314551 Borland Nov 2001 B1
6321246 Page et al. Nov 2001 B1
6323680 Pedersen et al. Nov 2001 B1
6327605 Arakawa et al. Dec 2001 B2
6351142 Abbott Feb 2002 B1
6353843 Chehrazi et al. Mar 2002 B1
6359468 Park et al. Mar 2002 B1
6360240 Takano et al. Mar 2002 B1
6362650 New et al. Mar 2002 B1
6366944 Hossain et al. Apr 2002 B1
6367003 Davis Apr 2002 B1
6369610 Cheung et al. Apr 2002 B1
6377970 Abdallah et al. Apr 2002 B1
6407576 Ngai et al. Jun 2002 B1
6407694 Cox et al. Jun 2002 B1
6434587 Liao et al. Aug 2002 B1
6438569 Abbott Aug 2002 B1
6438570 Miller Aug 2002 B1
6446107 Knowles Sep 2002 B1
6453382 Heile Sep 2002 B1
6467017 Ngai et al. Oct 2002 B1
6480980 Koe Nov 2002 B2
6483343 Faith et al. Nov 2002 B1
6487575 Oberman Nov 2002 B1
6523055 Yu et al. Feb 2003 B1
6531888 Abbott Mar 2003 B2
6538470 Langhammer et al. Mar 2003 B1
6542000 Black et al. Apr 2003 B1
6556044 Langhammer et al. Apr 2003 B2
6557092 Callen Apr 2003 B1
6571268 Giacalone et al. May 2003 B1
6573749 New et al. Jun 2003 B2
6574762 Karimi et al. Jun 2003 B1
6591283 Conway et al. Jul 2003 B1
6591357 Mirsky Jul 2003 B2
6600495 Boland et al. Jul 2003 B1
6600788 Dick et al. Jul 2003 B1
6628140 Langhammer et al. Sep 2003 B2
6687722 Larsson et al. Feb 2004 B1
6692534 Wang et al. Feb 2004 B1
6700581 Baldwin et al. Mar 2004 B2
6725441 Keller et al. Apr 2004 B1
6728901 Rajski et al. Apr 2004 B1
6731133 Feng et al. May 2004 B1
6732134 Rosenberg et al. May 2004 B1
6744278 Liu et al. Jun 2004 B1
6745254 Boggs et al. Jun 2004 B2
6763367 Kwon et al. Jul 2004 B2
6771094 Langhammer et al. Aug 2004 B1
6774669 Liu et al. Aug 2004 B1
6781408 Langhammer Aug 2004 B1
6781410 Pani et al. Aug 2004 B2
6788104 Singh et al. Sep 2004 B2
6801924 Green et al. Oct 2004 B1
6836839 Master et al. Dec 2004 B2
6874079 Hogenauer Mar 2005 B2
6904471 Boggs et al. Jun 2005 B2
6924663 Masui et al. Aug 2005 B2
6963890 Dutta et al. Nov 2005 B2
6971083 Farrugia et al. Nov 2005 B1
6978287 Langhammer Dec 2005 B1
7020673 Ozawa Mar 2006 B2
7093204 Oktem et al. Aug 2006 B2
7107305 Deng et al. Sep 2006 B2
7113969 Green et al. Sep 2006 B1
7181484 Stribaek et al. Feb 2007 B2
7313585 Winterrowd Dec 2007 B2
7395298 Debes et al. Jul 2008 B2
7409417 Lou Aug 2008 B2
7415542 Hennedy et al. Aug 2008 B2
7421465 Rarick et al. Sep 2008 B1
7428566 Siu et al. Sep 2008 B2
7430578 Debes et al. Sep 2008 B2
7430656 Sperber et al. Sep 2008 B2
7472155 Simkins et al. Dec 2008 B2
7536430 Guevokian et al. May 2009 B2
7590676 Langhammer Sep 2009 B1
7646430 Brown Elliott et al. Jan 2010 B2
7668896 Lutz et al. Feb 2010 B2
20010023425 Oberman et al. Sep 2001 A1
20010029515 Mirsky Oct 2001 A1
20020002573 Landers et al. Jan 2002 A1
20020089348 Langhammer Jul 2002 A1
20020116434 Nancekievill Aug 2002 A1
20030088757 Lindner et al. May 2003 A1
20040064770 Xin Apr 2004 A1
20040083412 Corbin et al. Apr 2004 A1
20040103133 Gurney May 2004 A1
20040148321 Guevorkian et al. Jul 2004 A1
20040172439 Lin Sep 2004 A1
20040178818 Crotty et al. Sep 2004 A1
20040193981 Clark et al. Sep 2004 A1
20040267863 Bhushan et al. Dec 2004 A1
20050038842 Stoye Feb 2005 A1
20050144212 Simkins et al. Jun 2005 A1
20050144215 Simkins et al. Jun 2005 A1
20050144216 Simkins et al. Jun 2005 A1
20050166038 Wang et al. Jul 2005 A1
20050187997 Zheng et al. Aug 2005 A1
20050187999 Zheng et al. Aug 2005 A1
20060020655 Lin Jan 2006 A1
20070185951 Lee et al. Aug 2007 A1
20070185952 Langhammer et al. Aug 2007 A1
20070241773 Hutchings et al. Oct 2007 A1
20080133627 Langhammer et al. Jun 2008 A1
20090187615 Abe et al. Jul 2009 A1
Foreign Referenced Citations (35)
Number Date Country
0 158 430 Oct 1985 EP
0 380 456 Aug 1990 EP
0 411 491 Feb 1991 EP
0 461 798 Dec 1991 EP
0 498 066 Aug 1992 EP
0 555 092 Aug 1993 EP
0 606 653 Jul 1994 EP
0 657 803 Jun 1995 EP
0 660 227 Jun 1995 EP
0 668 659 Aug 1995 EP
0 905 906 Mar 1999 EP
0 909 028 Apr 1999 EP
0 927 393 Jul 1999 EP
0 992 885 Apr 2000 EP
1 031 934 Aug 2000 EP
1 058 185 Dec 2000 EP
1 220 108 Jul 2002 EP
2 283 602 May 1995 GB
2 286 737 Aug 1995 GB
2 318 198 Apr 1998 GB
61-237133 Oct 1986 JP
7-135447 May 1995 JP
WO9527243 Oct 1995 WO
WO9628774 Sep 1996 WO
WO9708606 Mar 1997 WO
WO9812629 Mar 1998 WO
WO9832071 Jul 1998 WO
WO9838741 Sep 1998 WO
WO9922292 May 1999 WO
WO9931574 Jun 1999 WO
WO9956394 Nov 1999 WO
WO0051239 Aug 2000 WO
WO0052824 Sep 2000 WO
WO0113562 Feb 2001 WO
WO-2005101190 Oct 2005 WO
Provisional Applications (1)
Number Date Country
60790404 Apr 2006 US