Specialized processing block for programmable integrated circuit device

Information

  • Patent Grant
  • 8543634
  • Patent Number
    8,543,634
  • Date Filed
    Friday, March 30, 2012
    12 years ago
  • Date Issued
    Tuesday, September 24, 2013
    11 years ago
Abstract
A specialized processing block such as a DSP block may be enhanced by including direct connections that allow the block output to be directly connected to either the multiplier inputs or the adder inputs of another such block. A programmable integrated circuit device may includes a plurality of such specialized processing blocks. The specialized processing block includes a multiplier having two multiplicand inputs and a product output, an adder having as one adder input the product output of the multiplier, and having a second adder input and an adder output, a direct-connect output of the adder output to a first other one of the specialized processing block, and a direct-connect input from a second other one of the specialized processing block. The direct-connect input connects a direct-connect output of that second other one of the specialized processing block to a first one of the multiplicand inputs.
Description
FIELD OF THE INVENTION

This invention relates to a programmable integrated circuit device, and particularly to a specialized processing block in a programmable integrated circuit device.


BACKGROUND OF THE INVENTION

Considering a programmable logic device (PLD) as one example of a programmable integrated circuit device, 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 as by Finite Impulse Response (FIR) filtering). Such blocks are also frequently referred to as multiply-accumulate (“MAC”) blocks, because they include structures to perform multiplication operations, and sums and/or accumulations of multiplication results.


For example, PLDs sold by Altera Corporation, of San Jose, Calif., as part of the STRATIX®, ARRIA®, CYCLONE® and HARDCOPY® families include DSP blocks, each of which includes one or more multipliers. Each of those DSP blocks also includes one or more adders and registers, as well as programmable connectors (e.g., multiplexers) that allow the various components of the block to be configured in different ways. In addition, those DSP blocks can be configured for operation at different precisions.


Such blocks typically have included direct connections that allow certain operations to be performed using only a chain or cascade including multiple ones of such blocks, while other operations cannot be completed without routing outputs from one of such blocks through the general purpose logic and interconnect of the programmable device before entering a subsequent one of such blocks.


SUMMARY OF THE INVENTION

In accordance with embodiments of the present invention, a specialized processing block such as the DSP blocks described above may be enhanced by including direct connections that allow the block output to be directly connected to either the multiplier inputs or the adder inputs of another such block.


Therefore, in accordance with embodiments of the present invention there is provided a specialized processing block on a programmable integrated circuit device. The specialized processing block includes a multiplier having two multiplicand inputs and a product output, an adder having as one adder input the product output of the multiplier, and having a second adder input and an adder output, a direct-connect output of the adder output to a first other one of the specialized processing block, and a direct-connect input from a second other one of the specialized processing block. The direct-connect input connects a direct-connect output of that second other one of the specialized processing block to a first one of the multiplicand inputs.


A programmable integrated circuit device may includes a plurality of such specialized processing blocks.





BRIEF DESCRIPTION OF THE DRAWINGS

Further features of the invention, its nature and various advantages 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 shows a conceptual representation of a polynomial calculation performed by adder and multiplier circuitry;



FIG. 2 shows a logical abstraction of a known specialized processing block used in programmable integrated circuit devices;



FIG. 3 shows the use of specialized processing blocks such as that shown in FIG. 2 to perform a polynomial calculation in a programmable integrated circuit device;



FIG. 4 shows logical abstractions of specialized processing blocks according to an embodiment of this invention for use in programmable integrated circuit devices;



FIG. 5 shows the use of specialized processing blocks such as that shown in FIG. 4 to perform a polynomial calculation in a programmable integrated circuit device;



FIG. 6 shows the addition of pipeline registers to specialized processing blocks according to embodiments of this invention;



FIG. 7 shows the addition of additional pipeline registers to specialized processing blocks according to embodiments of this invention;



FIG. 8 shows the addition of additional pipeline registers to specialized processing blocks according to embodiments of this invention;



FIG. 9 shows logical abstractions of specialized processing blocks according to another embodiment of this invention for use in programmable integrated circuit devices;



FIG. 10 shows the use of specialized processing blocks such as that shown in FIG. 9 to perform a polynomial calculation in a programmable integrated circuit device; and



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





DETAILED DESCRIPTION OF THE INVENTION

Specialized processing blocks of the type disclosed herein are particularly well-suited for polynomial operations, which may be used in advanced filtering applications, curve fitting, unary functions, Digital Pre-Distortion (DPD), Sampling Rate Conversion (SRC), and other applications.


Any polynomial in one variable may be generalized using the following formula:










y


(
n
)


=




k
=
0

K




c
k

·




x
n



k







Eq
.





(
1
)









The value of K (the highest power to which the variable x is raised in any term of the polynomial) is referred to as the “order” of the polynomial.


Taking as an example a third-order polynomial (K=3), and using a, b, c, d for c0 to c3, Eq. (1) can be rewritten as:

y=d·x3+c·x2+b·x+a=((d·x+cx+bx+a  Eq. (2)

where the second line is a transformation according to Horner's Rule, whereby each subsequent term can be derived by a simple multiplication of the previous result by the scalar input variable (plus addition of a constant). This is illustrated in FIG. 1 where x and d are multiplied at multiplier 101 to create dx to which c is added at adder 102. The resultant sum dx+c is multiplied again by x at multiplier 103 and b is added to that result at adder 104. That sum is multiplied again by x at multiplier 105 and a is added at adder 106, to yield y as set forth above. This can be extended to a polynomial of any order.



FIG. 2 shows a logical abstraction 200 of known DSP blocks, such as those described above. Each block 200 includes at least one real or complex multiplier 201 (represented in this drawing by a single multiplier) whose output is directed to at least one adder 207 (represented in this drawing by a single adder). Input registers and output registers, represented in this abstraction by input register bank 203 and output register bank 204, also may be provided, respectively receiving signals from, and directing signals to, programmable interconnect resources 213, which route signals among programmable logic resources 214. Many known DSP blocks also include input signal direct connection (or input chain connection) 205, which may, e.g., allow a plurality of blocks to be used to construct various filter structures such as, e.g., Finite Impulse Response (FIR) filters. Similarly, many known DSP blocks also include output signal direct connection (or output chain connection) 206 to the adder(s) of a subsequent block.


Existing direct connections 205/206 are insufficient to allow polynomial calculations using chains of DSP blocks without resorting to logic and routing resources outside the blocks. As noted above in the Horner's Rule representation of a polynomial calculation, each stage requires the multiplication of the previous result by the scalar variable. However, as noted above in connection with FIG. 2, existing DSP output chain connections are input to the adder of the subsequent DSP block, but not to the multiplier. Therefore, polynomial calculations cannot be performed without using logic and routing resources outside block 200, as shown in FIG. 3.


As seen in FIG. 3, a first DSP block 301 of the type shown in FIG. 2 may be used to multiply a previous result 302 (such as dx+c) by the variable x input at 303, using multiplier 304 to yield (dx+c)x. Because there is no direct connection to the adder 207 of block 301 other than from multiplier 304 or the previous chaining connection 206, in order to add the constant b to (dx+c)x and then multiply that result by x, the result (dx+c)x must be output from block 301 and added to b using an external adder 305 in the general-purpose logic 214 of the programmable device in which blocks 301/302 are contained. That sum can then be routed using general-purpose routing resources 213 of the programmable device, to input (dx+c)x+b at 312 to block 311. The scalar variable x is input at 313, and multiplier 314 is used to yield ((dx+c)x+b)x, which may be output from block 311 and added to the constant a using an external adder 315 in the general-purpose logic 213. Additional blocks may be used in this way depending on the number of terms in the polynomial.



FIG. 4 shows logical diagrams of two occurrences 401/411 an exemplary DSP block according to an embodiment of the invention. In this logical representation, implementational details, such as additional registers and some programmable routing features—such as additional multiplexers that may allow the output of a particular structure to be routed directly out of block 401/411—are omitted to simplify discussion. In addition, some elements that are shown may, in an actual embodiment, be implemented more than once. For example, each of multipliers 404/414 may actually represent two or more multipliers, as in the DSP blocks of the aforementioned STRATIX® and ARRIA® families of PLDs.


In the logical representation of FIG. 4, output chain connection 206 of each block connects, rather than directly to an input of adder 407/417, both to multiplexer 405/415 which allows either connection 206 or input 402/412 (via connection 408/418) to be input to adder 407/417, and to multiplexer 406/416, which allows either connection 206 or input 402/412 (via connection 409/419) to be input to multiplier 404/414. The ability to connect output chain connection 206 to multiplier 404/414 does not exist in known DSP blocks.



FIG. 5 shows how blocks 401/411 may be used for a polynomial calculation. In this example, dx+c has been calculated in a previous block (not shown). That result is chained from the previous block via its output chain connection 206, using multiplexer 406 to connect connection 206 to multiplier 404, to which x also is input via input 403. At the same time, b is input to input 402 and multiplexer 405 routes input 402 to adder 407. The other input to adder 407 is the output of multiplier 404, which is (dx+c)x, so that adder 407 outputs (dx+c)x+b.


That result is input via output chain connection 206 of block 401 to block 411, where multiplexer 416 connects connection 206 to multiplier 414, to which x is the other input, propagated via input chain 205. At the same time, a is input to input 412 and multiplexer 415 connects input 412 to adder 417. The other input to adder 417 is the output of multiplier 414, which is ((dx+c)x+b)x, so that adder 407 outputs ((dx+c)x+b)x+a=dx3+cx2+bx+a=y. Output y may be further chained on chain output connection 206 of block 411, or directly on output 420 of block 411.


Depending on the size of the polynomial, the number of blocks required may result in unacceptable bit-width growth, which could substantially slow the system. Therefore, additional registers 601 may be provided on the block outputs, including the direct connect outputs to allow for pipelining and implementation of systolic form filters, as seen in FIG. 6. Multiple pipeline registers between stages also can be used, as shown in FIG. 7 where two registers 601 are used between each stage. Moreover, as shown in FIG. 8, some of the pipeline registers 601 can be moved to interior portions of the blocks if that is beneficial in a particular logic implementation.


It may be possible to run specialized processing blocks of the type disclosed at speeds higher than the remainder of the device of which the blocks are a part (e.g., twice the device speed). However, in the examples above the variable x has been input through the regular programmable interconnect of the device, and input of x has therefore would be limited by the clock speed of the device. Accordingly, in the embodiment shown in FIG. 9, a multiplexer 901 is added to allow input chain 905 to propagate not only an input from input register bank 903 of the current block or a previous block, but also a value propagated from elsewhere in a previous block. In such an embodiment, the clock speed of the remainder of the device is not a limiting factor when using multiple blocks together at a higher internal clock speed, allowing an increase in throughput, as compared to the throughput of the scalar input variable x, proportional to the higher speed. In such a case, an initial block, upstream of the first block to perform a calculation, may be “wasted” to allow data aggregation—i.e., to enter the value to be propagated so that it can be propagated to the first block, to perform the calculation at the higher clock speed within the blocks.


Configuring circuitry to perform certain mathematical operations may involve groupings of specialized processing blocks. For example, if the multipliers in the specialized processing blocks are capable of multiplying two 18-bit inputs, two blocks can be used together to multiply an 18-bit input by a 36-bit input, with the upper bits of the 36-bit input x being multiplied by the 18-bit multiplicand in one block, and the lower bits of the 36-bit input x being multiplied by the 18-bit multiplicand in a second block. This arrangement, which is shown conceptually in FIG. 10, can be facilitated by adding a further connection 911 (shown in phantom in FIG. 9) that allows the output of a previous block to be propagated via the input chain to a subsequent block. In addition, pipeline registers 906 may be provided in any or all of the locations within the block shown in FIG. 9.


The foregoing embodiments can be implemented with 18-bit-by-18-bit multipliers, 27-bit-by-27-bit multipliers (this is comparable to the 18-bit-by-36-bit case discussed above) and 36-bit-by-36-bit multipliers. This allows the performance of multiplication at different precisions. In addition, mixed precision also is possible, as long as the most-significant bits are aligned (e.g., by scaling the values to a 1.x format, where x=17 for 8-bit multipliers and x=26 for 27-bit multipliers. For example, in implementing a polynomial calculation, it may be desirable to provide greater precision in the higher-order terms, especially in the last few stages.


The precision at the output of a multiplier is the sum of the precisions at the input. If multipliers of the same precision are to be used in a chain, rounding may be carried out between the multiplier output of a stage and the multiplier input of the next stage. Known rounding methods may be used, such as those shown in commonly-assigned U.S. Pat. No. 7,948,267, which is hereby incorporated by reference herein in its entirety.


Even with rounding, and even if both multiplicands are defined to be between −1 and +1, unacceptable bit growth could occur. One way to minimize unacceptable bit growth is to normalize all constants by dividing by the sum of the maximum absolute value of all of the constants.


Thus it is seen that specialized processing blocks that allow implementation of polynomial calculations, as well as other operations, have been provided.


A PLD 140 incorporating specialized processing blocks according to the present invention may be used in many kinds of electronic devices. One possible use is in an exemplary data processing system 1400 shown in FIG. 11. Data processing system 1400 may include one or more of the following components: a processor 1401; memory 1102; I/O circuitry 1403; and peripheral devices 1404. These components are coupled together by a system bus 1405 and are populated on a circuit board 1406 which is contained in an end-user system 1107.


System 1400 can be used in a wide variety of applications, such as computer networking, data networking, instrumentation, video processing, digital signal processing, Remote Radio Head (RRH), or any other application where the advantage of using programmable or reprogrammable logic is desirable. PLD 140 can be used to perform a variety of different logic functions. For example, PLD 140 can be configured as a processor or controller that works in cooperation with processor 1401. PLD 140 may also be used as an arbiter for arbitrating access to a shared resources in system 1400. In yet another example, PLD 140 can be configured as an interface between processor 1401 and one of the other components in system 1400. It should be noted that system 1400 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 140 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 on a programmable integrated circuit device, said specialized processing block comprising: a multiplier having two multiplicand inputs and a product output;an adder having as one adder input said product output of said multiplier, and having a second adder input and an adder output;a direct-connect output of said adder output to a first other said specialized processing block; anda direct-connect input from a second other said specialized processing block, said direct-connect input connecting a direct-connect output of said adder output of said second other said specialized processing block to a first one of said multiplicand inputs.
  • 2. The specialized processing block of claim 1 further comprising first multiplexer circuitry for selectably connecting said direct-connect input to said first one of said multiplicand inputs and said second adder input.
  • 3. The specialized processing block of claim 2 further comprising: at least one input register receiving a value input from outside said specialized processing block and providing said value to a second one of said multiplicand inputs;an input register chain output directly connecting an output of said at least one input register to said first other said specialized processing block; andan input register chain input directly connecting an input register chain output of said second other said specialized processing block to said second one of said multiplicand inputs.
  • 4. The specialized processing block of claim 3 further comprising an input chain output multiplexer selectably connecting said second one of said multiplicand inputs and said output of said at least one input register to said input register chain output.
  • 5. The specialized processing block of claim 4 wherein said input chain output multiplexer selectably connects said input register chain output to said output of said at least one input register and both said first and second ones of said multiplicand inputs.
  • 6. The specialized processing block of claim 3 further comprising an input chain input multiplexer selectably connecting said output of said at least one input register and said input register chain input to said second one of said multiplicand inputs.
  • 7. The specialized processing block of claim 1 further comprising at least one pipeline register on each of said multiplicand inputs, said one adder input and said second adder input.
  • 8. A programmable integrated circuit device comprising: programmable logic resources;programmable interconnect resources for routing signals among said programmable logic resources; anda plurality of specialized processing blocks, each of said specialized processing blocks comprising:a multiplier having two multiplicand inputs and a product output;an adder having as one adder input said product output of said multiplier, and having a second adder input and an adder output;a direct-connect output of said adder output to a first other one of said specialized processing blocks; anda direct-connect input from a second other one of said specialized processing blocks, said direct-connect input connecting a direct-connect output of said adder output of said second other one of said specialized processing blocks to a first one of said multiplicand inputs.
  • 9. The programmable integrated circuit device of claim 8 wherein each of said specialized processing blocks further comprises first multiplexer circuitry for selectably connecting said direct-connect input to said first one of said multiplicand inputs and said second adder input.
  • 10. The programmable integrated circuit device of claim 8 wherein each of said specialized processing blocks further comprises: at least one input register receiving a value input from outside said specialized processing block and providing said value to a second one of said multiplicand inputs;an input register chain output directly connecting an output of said at least one input register to said first other one of said specialized processing blocks; andan input register chain input directly connecting an input register chain output of said second other one of said specialized processing blocks to said second one of said multiplicand inputs.
  • 11. The programmable integrated circuit device of claim 10 wherein each of said specialized processing blocks further comprises an input chain output multiplexer selectably connecting said second one of said multiplicand inputs and said output of said at least one input register to said input register chain output.
  • 12. The programmable integrated circuit device of claim 11 wherein said input chain output multiplexer selectably connects said input register chain output to said output of said at least one input register and both said first and second ones of said multiplicand inputs.
  • 13. The programmable integrated circuit device of claim 10 further comprising an input chain input multiplexer selectably connecting said output of said at least one input register and said input register chain input to said second one of said multiplicand inputs.
  • 14. The programmable integrated circuit device of claim 8 wherein each said specialized processing block further comprises at least one pipeline register on each of said multiplicand inputs, said one adder input and said second adder input.
  • 15. A method of configuring a programmable integrated circuit device to calculate a polynomial having a number of terms, wherein said programmable integrated circuit device comprises: programmable logic resources,programmable interconnect resources for routing signals among said programmable logic resources, anda plurality of specialized processing blocks, each of said specialized processing blocks comprising:a multiplier having two multiplicand inputs and a product output,an adder having as one adder input said product output of said multiplier, and having a second adder input and an adder output,a direct-connect output of said adder output to a first other one of said specialized processing blocks, anda direct-connect input from a second other one of said specialized processing blocks, said direct-connect input connecting a direct-connect output of said adder output of said second other one of said specialized processing blocks to first multiplexer circuitry for selectably connecting said direct-connect input to said first one of said multiplicand inputs and said second adder input; said method comprising, for each respective specialized processing block among a plurality of said specialized processing blocks corresponding to said number of said terms:configuring said first multiplexer circuitry to connect said direct-connect input to said first one of said multiplicand inputs.
  • 16. The method of claim 15 wherein each of said specialized processing blocks further comprises: at least one input register receiving a value input from outside said specialized processing block and providing said value to a second one of said multiplicand inputs,an input register chain output including an input chain output multiplexer selectably directly connecting said second one of said multiplicand inputs and said output of said at least one input register to said first other one of said specialized processing blocks, andan input register chain input including an input chain input multiplexer selectably directly connecting said output of said at least one input register and said input register chain output of said second other one of said specialized processing blocks to said second one of said multiplicand inputs; said method further comprising, for at least one of said specialized processing blocks:configuring said input chain output multiplexer to connect said second one of said multiplicand inputs to said input register chain output.
  • 17. The method of claim 16 wherein said input chain output multiplexer selectably connects said input register chain output to said output of said at least one input register and both said first and second ones of said multiplicand inputs; said method further comprising, for at least one of said specialized processing blocks: configuring said input chain output multiplexer to connect said first one of said multiplicand inputs to said input register chain output for sharing said first one of said multiplicand inputs with another one of said specialized processing blocks.
  • 18. The method of claim 17 further comprising configuring, in said another one of said specialized processing blocks, said input chain input multiplexer to connect said output of said at least one input register to said second one of said multiplicand inputs.
  • 19. The method of claim 15 further comprising configuring pipeline registers on said multiplicand inputs, said one adder input and said second adder input.
US Referenced Citations (349)
Number Name Date Kind
3473160 Wahlstrom Oct 1969 A
3800130 Martinson et al. Mar 1974 A
3814924 Tate Jun 1974 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
4616330 Betz Oct 1986 A
4623961 Mackiewicz Nov 1986 A
4682302 Williams Jul 1987 A
4718057 Venkitakrishnan et al. Jan 1988 A
4727508 Williams Feb 1988 A
4736335 Barban Apr 1988 A
4754421 Bosshart Jun 1988 A
4791590 Ku et al. Dec 1988 A
4799004 Mori Jan 1989 A
4811263 Hedley et al. Mar 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
5068813 Thoen Nov 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
5375079 Uramoto 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
5623377 Behrens et al. Apr 1997 A
5631848 Laczko et al. May 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
5644519 Yatim et al. Jul 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
5771186 Kodali et al. 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
5847978 Ogura et al. 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
6041339 Yu et al. Mar 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
6260053 Maulik et al. Jul 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
6427157 Webb Jul 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
6523057 Savo 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 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
6806733 Pan et al. Oct 2004 B1
6836839 Master et al. Dec 2004 B2
6874079 Hogenauer Mar 2005 B2
6889238 Johnson May 2005 B2
6904471 Boggs et al. Jun 2005 B2
6917955 Botchev Jul 2005 B1
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
6983300 Ferroussat Jan 2006 B2
7020673 Ozawa Mar 2006 B2
7047272 Giacalone et al. May 2006 B2
7062526 Hoyle Jun 2006 B1
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
7401109 Koc et al. Jul 2008 B2
7409417 Lou Aug 2008 B2
7415542 Hennedy et al. Aug 2008 B2
7421465 Rarick et al. Sep 2008 B1
7428565 Fujimori Sep 2008 B2
7428566 Siu et al. Sep 2008 B2
7430578 Debes et al. Sep 2008 B2
7430656 Sperber et al. Sep 2008 B2
7447310 Koc et al. Nov 2008 B2
7472155 Simkins et al. Dec 2008 B2
7508936 Eberle et al. Mar 2009 B2
7536430 Guevokian et al. May 2009 B2
7567997 Simkins et al. Jul 2009 B2
7590676 Langhammer Sep 2009 B1
7646430 Brown Elliott et al. Jan 2010 B2
7668896 Lutz et al. Feb 2010 B2
7719446 Rosenthal et al. May 2010 B2
7769797 Cho et al. Aug 2010 B2
7814137 Mauer Oct 2010 B1
7822799 Langhammer et al. Oct 2010 B1
7836117 Langhammer et al. Nov 2010 B1
7865541 Langhammer Jan 2011 B1
7930335 Gura Apr 2011 B2
7930336 Langhammer et al. Apr 2011 B2
7949699 Neoh et al. May 2011 B1
8041759 Langhammer et al. Oct 2011 B1
20010023425 Oberman et al. Sep 2001 A1
20010029515 Mirsky Oct 2001 A1
20010037351 Hellberg Nov 2001 A1
20010037352 Hong Nov 2001 A1
20020002573 Landers et al. Jan 2002 A1
20020038324 Page et al. Mar 2002 A1
20020049798 Wang et al. Apr 2002 A1
20020078114 Wang et al. Jun 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
20040122882 Zakharov et al. Jun 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
20040267857 Abel et al. Dec 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
20050262175 Iino et al. Nov 2005 A1
20060020655 Lin Jan 2006 A1
20070083585 St. Denis et al. Apr 2007 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
20080183783 Tubbs Jul 2008 A1
20090172052 DeLaquil et al. Jul 2009 A1
20090187615 Abe et al. Jul 2009 A1
20090300088 Michaels et al. Dec 2009 A1
20100098189 Oketani Apr 2010 A1
20100131577 Gangalakurti et al. May 2010 A1
20110219052 Langhammer Sep 2011 A1
20110238720 Langhammer Sep 2011 A1
20110320513 Langhammer Dec 2011 A1
20120054254 Langhammer Mar 2012 A1
20120054256 Langhammer Mar 2012 A1
Foreign Referenced Citations (48)
Number Date Country
0 158 430 Oct 1985 EP
0 326 415 Aug 1989 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 721 159 Jul 1996 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 049 025 Nov 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
63-216131 Aug 1988 JP
4-332036 Nov 1992 JP
5-134851 Jun 1993 JP
06-187129 Jul 1994 JP
7-135447 May 1995 JP
11-296345 Oct 1999 JP
2000-259394 Sep 2000 JP
2002-108606 Apr 2002 JP
2002-251281 Sep 2002 JP
WO95-27243 Oct 1995 WO
WO96-28774 Sep 1996 WO
WO97-08606 Mar 1997 WO
WO98-12629 Mar 1998 WO
WO98-32071 Jul 1998 WO
WO98-38741 Sep 1998 WO
WO99-22292 May 1999 WO
WO99-31574 Jun 1999 WO
WO99-56394 Nov 1999 WO
WO00-51239 Aug 2000 WO
WO00-52824 Sep 2000 WO
WO01-13562 Feb 2001 WO
WO 2005066832 Jul 2005 WO
WO2005-101190 Oct 2005 WO
WO 2010102007 Sep 2010 WO
Non-Patent Literature Citations (81)
Entry
Martinson, L. et al., “Digital Matched Filtering with Pipelined Floating Point Fast Fourier Transforms (FFT's),” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-23, No. 2, pp. 222-234, Apr. 1975.
Farooqui, A., et al., “General Data-Path Organization of a MAC unit for VLSI Implementation of DSP Processors,” ISCAS '98, Part 2, May 31, 1998-Jun. 3, 1998, pp. 260-263.
Altera Corporation, “Statix II Device Handbook, Chapter 6—DSP Blocks in Stratix II Devices,” v1.1, Jul. 2004.
Altera Corporation, “Digital Signal Processing (DSP),” Stratix Device Handbook, vol. 2, Chapter 6 and Chapter 7, v1.1 (Sep. 2004).
Altera Corporation, “DSP Blocks in Stratix II and Stratix II GX Devices,” Stratix II Device Handbook, vol. 2, Chapter 6, v4.0 (Oct. 2005).
Altera Corporation, “FIR Compiler: MegaCore® Function User Guide,” version 3.3.0, rev. 1, pp. 3 11 through 3 15 (Oct. 2005).
Amos, D., “PLD architectures match DSP algorithms,” Electronic Product Design, vol. 17, No. 7, Jul. 1996, pp. 30, 32.
Analog Devices, Inc., The Applications Engineering Staff of Analog Devices, DSP Division, Digital Signal Processing Applications Using the ADSP-2100 Family (edited by Amy Mar), 1990, pp. 141-192).
Andrejas, J., et al., “Reusable DSP functions in FPGAs,” Field-Programmable Logic and Applications. Roadmap to Reconfiourable Computing. 10th International Conference, FPL 2000. Proceedings (Lecture Notes in Computer Science vol. 1896) Aug. 27-30, 2000, pp. 456-461.
Aoki, T., “Signed-weight arithmetic and its application to a field-programmable digital filter architecture,” IEICE Transactions on Electronics, 1999 , vol. E82C, No. 9, Sep. 1999, pp. 1687-1698.
Ashour, M.A., et al., “An FPGA implementation guide for some different types of serial-parallel multiplier-structures,” Microelectronics Journal , vol. 31, No. 3, 2000, pp. 161-168.
Berg, B.L., et al.“Designing Power and Area Efficient Multistage FIR Decimators with Economical Low Order Filters,” ChipCenter Technical Note, Dec. 2001.
Bursky, D., “Programmable Logic Challenges Traditional ASIC SoC Designs”, Electronic Design, Apr. 15, 2002.
Chhabra, A. et al., Texas Instruments Inc., “A Block Floating Point Implementation on the TMS320C54x DSP”, Application Report SPRA610, Dec. 1999, pp. 1-10.
Colet, P., “When DSPs and FPGAs meet: Optimizing image processing architectures,” Advanced Imaging, vol. 12, No. 9, Sep. 1997, pp. 14, 16, 18.
Crookes, D., et al., “Design and implementation of a high level programming environment for FPGA-based image processing,” IEE Proceedings—Vision, Image and Signal Processing, vol. 147, No. 4, Aug. 2000, pp. 377-384.
Debowski, L., et al., “A new flexible architecture of digital control systems based on DSP and complex CPLD technology for power conversion applications,” PCIM 2000: Europe Official Proceedings of the Thirty-Seventh International Intelligent Motion Conference, Jun. 6-8, 2000, pp. 281-286.
Dick, C., et al., “Configurable logic for digital communications: some signal processing perspectives,” IEEE Communications Magazine, vol. 37, No. 8, Aug. 1999, pp. 107-111.
Do, T.-T., et al., “A flexible implementation of high-performance FIR filters on Xilinx FPGAs,” Field-Programmable Logic and Applications: From FPGAs to Computing Paradigm. 8th International Workshop, FPL'98. Proceedings, Hartenstein, R.W., et al., eds., Aug. 31-Sep. 3, 1998, pp. 441-445.
Gaffer, A.A., et al., “Floating-Point Bitwidth Analysis via Automatic Differentiation,” IEEE Conference on Field Programmable Technology, Hong Kong, Dec. 2002.
Govindu, G. et al., “A Library of Parameterizable Floating-Point Cores for FPGAs and Their Application to Scientific Computing,” Proc Int'l Conf. Eng. Reconfigurable Systems and Algorithms (ERSA'05), Jun. 2005.
Govindu, G. et al., “Analysis of High-performance Floating-point Arithmetic on FPGAs,” Proceedings of the 18th International Parallel and Distributed Processing Symposium (PDPS'04), pp. 149-156, Apr. 2004.
Guccione, S.A.,“Run-time Reconfiguration at Xilinx,” Parallel and distributed processing: 15 IPDPS 2000 workshops, Rolim, J., ed., May 1-5, 2000, p. 873.
Hauck, S., “The Future of Reconfigurable Systems” Keynote Address, 5th Canadian Conference on Field Programmable Devices, Jun. 1998, http:--www.ee.washington.edu-people-faculty-hauck-publications-ReconfigFuture.PDF.
Haynes, S.D., et al., “Configurable multiplier blocks for embedding in FPGAs,” Electronicas Letters, vol. 34, No. 7, pp. 638-639 (Apr. 2, 1998).
Heysters, P.M., et al., “Mapping of DSP algorithms on field programmable function arrays,” Field-Programmable Logic and Applications, Roadmap to Reconfigurable Computing. 10th International Conference, FPL 2000. Proceedings (Lecture Notes in Computer Science vol. 1896), Aug. 27-30, 2000, pp. 400-411.
Huang, J., et al., “Simulated Performance of 1000BASE-T Receiver with Different Analog Front End Designs,” Proceedings of the 35th Asilomar Conference on Signals, Systems, and Computers, Nov. 4-7, 2001.
Lattice Semiconductor Corp, ORCA® FPGA Express™ Interface Manual: ispLEVER® Version 3.0, 2002.
Lucent Technologies, Microelectronics Group,“Implementing and Optimizing Multipliers in ORCA™ FPGAs,”, Application Note.AP97-008FGPA, Feb. 1997.
“Implementing Multipliers in FLEX 10K EABs”, Altera, Mar. 1996.
“Implementing Logic with the Embedded Array in FLEX 10K Devices”, Altera, May 2001, ver. 2.1.
Jinghua Li, “Design a pocket multi-bit multiplier in FPGA,” 1996 2nd International Conference on ASIC Proceedings (IEEE Cat. No. 96TH8140), Oct. 21-24, 1996, pp. 275-279.
Jones, G., “Field-programmable digital signal conditioning,” Electronic Product Design, vol. 21, No. 6, Jun. 2000, pp. C36-C38.
Kiefer, R., et al., “Performance comparison of software-FPGA hardware partitions for a DSP application,” 14th Australian Microelectronics Conference. Microelectronics: Technology Today for the Future. MICRO '97 Proceedings, Sep. 28-Oct. 1, 1997, pp. 88-93.
Kim, Y., et al., “Fast GPU Implementation for the Solution of Tridiagonal Matrix Systems,” Journal of Korean Institute of Information Scientists and Engineers, vol. 32, No. 12, pp. 692-704, Dec. 2005.
Kramberger, I., “DSP acceleration using a reconfigurable FPGA,” ISIE '99. Proceedings of the IEEE International Symposium on Industrial Electronics (Cat. No. 99TH8465), vol. 3 , Jul. 12-16, 1999, pp. 1522-1525.
Langhammer, M., “How to implement DSP in programmable logic,” Elettronica Oggi, No. 266 , Dec. 1998, pp. 113-115.
Langhammer, M., “Implementing a DSP in Programmable Logic,” Online EE Times, May 1998, http:--www.eetimes.com-editorial-1998-coverstory9805.html.
Lazaravich, B.V., “Function block oriented field programmable logic arrays,” Motorola, Inc. Technical Developments, vol. 18, Mar. 1993, pp. 10-11.
Lund, D., et al., “A new development system for reconfigurable digital signal processing,” First International Conference on 3G Mobile Communication Technologies (Conf. Publ. No. 471), Mar. 27-29, 2000, pp. 306-310.
Miller, N.L., et al., “Reconfigurable integrated circuit for high performance computer arithmetic,” Proceedings of the 1998 IEE Colloquium on Evolvable Hardware Systems (Digest), No. 233, 1998, pp. 2-1-2-4.
Mintzer, L., “Xilinx FPGA as an FFT processor,” Electronic Engineering, vol. 69, No. 845, May 1997, pp. 81, 82, 84.
Faura et al., “A Novel Mixed Signal Programmable Device With On-Chip Microprocessor,” Custom Integrated Circuits Conference, 1997. Proceedings of the IEEE 1997 Santa Clara, CA, USA, May 5, 1997, pp. 103-106.
Nakasato, N., et al., “Acceleration of Hydrosynamical Simulations using a FPGA board”, The Institute of Electronics Information and Communication Technical Report CPSY2005-47, vol. 105, No. 515, Jan. 17, 2006.
Nozal, L., et al., “A new vision system: programmable logic devices and digital signal processor architecture (PLD+DSP),” Proceedings IECON '91. 1991 International Conference on Industrial Electronics, Control and Instrumentation (Cat. No. 91CH2976-9), vol. 3, Oct. 28-Nov. 1, 1991, pp. 2014-2018.
Osana, Y., et al., “Hardware-resource Utilization Analysis on an FPGA-Based Biochemical Simulator ReCSiP”, The Institute of Electronics Information and Communication Technical Report CPSY2005-63, vol. 105, No. 516, Jan. 18, 2006.
Papenfuss, J.R, et al., “Implementation of a real-time, frequency selective, RF channel simulator using a hybrid DSP-FPGA architecture,” RAWCON 2000: 2000 IEEE Radio and Wireless Conference (Cat. No. 00EX404), Sep. 10-13, 2000, pp. 135-138.
Parhami, B., “Configurable arithmetic arrays with data-driven control,” 34th Asilomar Conference on Signals, Systems and Computers, vol. 1, 2000, pp. 89-93.
“The QuickDSP Design Guide”, Quicklogic, Aug. 2001, revision B.
“QuickDSP™ Family Data Sheet”, Quicklogic, Aug. 7, 2001, revision B.
Rangasayee, K., “Complex PLDs let you produce efficient arithmetic designs,” EDN (European Edition), vol. 41, No. 13, Jun. 20, 1996, pp. 109, 110, 112, 114, 116.
Rosado, A., et al., “A high-speed multiplier coprocessor unit based on FPGA,” Journal of Electrical Engineering, vol. 48, No. 11-12, 1997, pp. 298-302.
Santillan-Q., G.F., et al., “Real-time integer convolution implemented using systolic arrays and a digit-serial architecture in complex programmable logic devices,” Proceedings of the Third International Workshop on Design of Mixed-Mode Integrated Circuits and Applications (Cat. No. 99EX303), Jul. 26-28, 1999, pp. 147-150.
Texas Instruments Inc., “TMS320C54x DSP Reference Set, vol. 1: CPU and Peripherals”, Literature No. SPRU131F, Apr. 1999, pp. 2-1 through 2-16 and 4-1 through 4-29.
Tisserand, A., et al., “An on-line arithmetic based FPGA for low power custom computing,” Field Programmable Logic and Applications, 9th International Workshop, FPL'99, Proceedings (Lecture Notes in Computer Science vol. 1673), Lysaght, P., et al., eds., Aug. 30-Sep. 1, 1999, pp. 264-273.
Tralka, C., “Symbiosis of DSP and PLD,” Elektronik, vol. 49, No. 14 , Jul. 11, 2000, pp. 84-96.
Underwood, K. “FPGAs vs. CPUs: Trends in Peak Floating-Point Performance,” Proceedings of the 2004 ACM-SIGDA 12th International Symposium on Field Programmable Gate Arrays, pp. 171-180, Feb. 22-24, 2004.
Valls, J., et al., “A Study About FPGA-Based Digital Filters,” Signal Processing Systems, 1998, SIPS 98, 1998 IEEE Workshop, Oct. 10, 1998, pp. 192-201.
“Virtex-II 1.5V Field-Programmable Gate Arrays”, Xilinx, Jan. 25, 2001, module 2 of 4.
“Virtex-II 1.5V Field-Programmable Gate Arrays”, Xilinx, Apr. 2, 2001, module 1 of 4.
“Virtex-II 1.5V Field-Programmable Gate Arrays”, Xilinx, Apr. 2, 2001, module 2 of 4.
Vladimirova, T. et al., “Floating-Point Mathematical Co-Processor for a Single-Chip On-Board Computer,” MAPLD'03 Conference, D5, Sep. 2003.
Walters, A.L., “A Scaleable FIR Filter Implementation Using 32-bit Floating-Point Complex Arithmetic on ,a FPGA Based Custom Computing Platform,” Allison L. Walters, Thesis Submitted to the Faculty of Virginia Polytechnic Institute and State University, Jan. 30, 1998.
Weisstein, E.W., “Karatsuba Multiplication,” MathWorld—A Wolfram Web Resource (Dec. 9, 2007), accessed Dec. 11, 2007 at http:--mathworld.wolfram.com-KaratsubaMultiplication.html.
Wenzel, L., “Field programmable gate arrays (FPGAs) to replace digital signal processor integrated circuits,” Elektronik , vol. 49, No. 5, Mar. 7, 2000, pp. 78-86.
“Xilinx Unveils New FPGA Architecture to Enable High-Performance, 10 Million System Gate Designs”, Xilinx, Jun. 22, 2000.
“Xilinx Announces DSP Algorithms, Tools and Features for Virtex-II Architecture”, Xilinx, Nov. 21, 2000.
Xilinx Inc., “Virtex-II 1.5V Field-Programmable Gate Arrays”, Advance Product Specification, DS031-2 (v1.9), Nov. 29, 2001, Module 2 of 4, pp. 1-39.
Xilinx Inc., “Using Embedded Multipliers”, Virtex-II Platform FPGA Handbook, UG002 (v1.3), Dec. 3, 2001, pp. 251-257.
Xilinx, Inc., “A 1D Systolic FIR,” copyright 1994-2002, downloaded from http:--www.iro.umontreal.ca-˜aboulham-F6221-Xilinx%20A%201D%20systolic%20FIR.htm.
Xilinx, Inc., “The Future of FPGA's,” White Paper, available Nov. 14, 2005 for download from http:--www.xilinx.com-prs—rls,5yrwhite.htm.
Xilinx Inc., “XtremeDSP Design Considerations User Guide,” v 1.2, Feb. 4, 2005.
Xilinx Inc., “Complex Multiplier v2.0”, DS291 Product Specification/Datasheet, Nov. 2004.
de Dinechin F.,et al., “FPGA-Specific Custom Arithmetic Datapath Design: LIP Research Report RR2010-34,” Dec. 2010, 8 pages.
IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Standard, Std 754, 1985, pp. 1-14.
IEEE Standard for Floating-Point Arithmetic, IEEE Std 754, 2008, pp. 1-58.
Langhammer, “Floating Point Datapath Synthesis for FPGAs,” IEEE International Conference on Field Programmable Logic and Applications, 2008 (FPL 2008), pp. 355-360 (Sep. 8-10, 2008).
Altera Corporation, “Advanced Synthesis Cookbook: A Design Guide for Stratix II, Stratix III and Stratix IV Devices,” Document Version 3.0, 112 pgs., May 2008.
deDinechin, F. et al., “Large multipliers with less DSP blocks,” retrieved from http://hal-ens-lyon.archives-ouvertes.fr/ensl-00356421/en/, 9 pgs., available online Jan. 2009.
Wajih, E.-H.Y. et al., “Efficient Hardware Architecture of Recursive Karatsuba-Ofman Multiplier,” 3rd International Conference on Design and Technology of Integrated Systems in Nanoscale Era, 6 pgs, Mar. 2008.
Zhou, G. et al., “Efficient and High-Throughput Implementations of AES-GCM on FPGAs,” International Conference on Field-Programmable Technology, 8 pgs., Dec. 2007.