This invention relates to computing floating-point polynomials in integrated circuit devices such as programmable logic devices (PLDs), and particularly to computing floating-point polynomials using fixed-point resources.
Horner's rule (also referred to as Horner's scheme or Horner's algorithm) is an efficient way of calculating polynomials, useful for both hardware and software.
A polynomial can be described as:
For an example where n=5, this can be reformatted using Horner's rule as:
p(x)=a0+x(a1+x(a2+x(a3+x(a4+a5X)))) (2)
This has the advantage of removing the calculations of powers of x. There are still as many addition operations as there are coefficients, and as many multiplication operations as there are terms of x. For this case of n=5, there are five addition operations, and five multiplication operations. For small inputs—i.e., inputs substantially less than 1—the number of terms that need to be calculated is low, because later terms become vanishingly small.
However, even for a small number of terms, substantial resources may be required. For example, applications in which these operations are used frequently call for double-precision arithmetic. In a PLD such as those sold by Altera Corporation under the trademark STRATIX®, this could translate to approximately 8,500 adaptive look-up tables (ALUTs) and 45 18×18 multipliers.
The present invention relates to method and circuitry for implementing floating-point polynomial series calculations using fixed-point resources. This reduces the amount of resources required, and also reduces datapath length and therefore latency. Embodiments of the invention are particularly well-suited to applications for which the input range can be kept small. One such class of operations are trigonometric functions, where range reduction can be used to keep the inputs small, as described in copending, commonly-assigned U.S. patent application Ser. No. 12/717,212, filed Mar. 4, 2010, which is hereby incorporated by reference herein in its entirety. The circuitry can be provided in a fixed logic device, or can be configured into a programmable integrated circuit device such as a programmable logic device.
According to one aspect of the invention, denormalization operations are performed using the coefficients, instead of using arithmetic and logic resources to calculate and implement the denormalization, and the renormalization requires only a single-bit calculation. The remainder of the calculation can be carried out as a fixed-point calculation, consuming corresponding device area and with corresponding latency, while the results are equivalent to performing the same calculation using double-precision floating-point arithmetic.
In accordance with embodiments of the invention, there is provided polynomial circuitry for calculating a polynomial having terms including powers of an input variable, where the input variable is represented by a mantissa and an exponent, and the circuitry has a number of bits of precision. The polynomial circuitry includes (1) a respective coefficient memory loaded with a plurality of respective instances of a coefficient for each respective one of the terms, each respective instance being shifted by a different number of bits, and (2) address circuitry for selecting one of the respective instances of the coefficient based on the exponent.
A method of operating such circuitry, and a method of configuring a programmable device as such polynomial circuitry are also provided, and a non-transitory machine-readable data storage medium is provided that is encoded with software for performing the method of configuring such circuitry on a programmable device.
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:
Circuitry according to the invention implements Horner's rule for floating-point polynomial calculations by using the coefficients to perform denormalization and performing the remainder of the calculation as a fixed-point calculation. For any particular implementation of a polynomial calculation, each coefficient may be stored in a table as multiple versions of itself, each shifted a different amount. The exponent of the coefficient term could function as the index to the table, selecting the correct shifted version.
An embodiment of the invention may be understood by reference to an example of the inverse tangent (tan−1, ATAN or arctan) function. The inverse tangent function can be computed using the following series:
Using Horner's rule, this can be expressed as:
This uses two adders and five multipliers, although if equation (4) is limited to two terms it can be implemented using two adders and only three multipliers.
For an inverse tangent calculation, an accurate estimate is required for only a small range. This is also true of most other trigonometric functions. For example, a good tradeoff for a double-precision inverse tangent implementation would require an input range of 0-2−10 radians. For 52-bit precision as used in double-precision arithmetic, with a 10-bit input range, the second term would be 20 bits (x3-x) to the right of the first term, and the third term would be 40 bits (x5-x) to the right. The next term would be 60 bits to the right, and therefore can be ignored for this example of 52-bit precision. However, the invention would apply no matter how many terms were used.
As the second term is 20 bits to the right, it will have a maximum contribution of 32 bits (52 bits-20 bits) to the final result, and can therefore be well-represented with 36-bit precision. Similarly, as the third term is 40 bits to the right, it will have a maximum contribution of only 12 bits, and can therefore be well-represented by 18 bits.
If the input is less than 2−10, then the following terms will have even smaller contributions based on their powers. For example, if the input is 2−12, the second term will be 24 bits to the right and the third term will be 48 bits to the right. For inputs of 2−14 or less, even the third term contribution will be more than 56 bits to the right and make a negligible contribution to the result.
A full floating-point adder is not required to add together the terms. As long as the input is less than 1, each term will be less than its preceding term, so that swapping of operands is not required, and denormalization can be applied to the smaller term immediately. In fact, the denormalization shift can be applied directly to all of the following terms immediately, as each can be calculated in relation to the first term simultaneously.
As noted above, according to embodiments of the invention, the denormalization shifts are not applied as separate operations, but are applied to the coefficients. Therefore, they may be implemented as multiplications by constants. For example, in current PLD (e.g., FPGA) architectures, it is usually more efficient to implement such multiplications in specialized processing blocks (e.g., DSP blocks) that include fixed arithmetic structures with configurable interconnect, rather than in general-purpose programmable logic.
Regardless of how the multiplication operations are implemented, in accordance with embodiments of the invention, each coefficient may be represented by a table of shifted coefficients. The exponent of the term to which the coefficient is applied determines the required degree of shifting, and therefore functions as an index into the coefficient table.
Examples of the coefficient tables for the inverse tangent example are shown in Tables 1 and 2 (below) for the second and third terms, respectively, of the “inner series” of Equation (4). The value in the first column of each table is the address/index corresponding to the exponent of the value of the input x, expressed in binary form. The value in the second column of each table is the coefficient itself. From each entry to the next, the coefficient, if expressed in binary form, would be shifted by the product of the index and the power of the corresponding term of the series. However, to save space, the shifted coefficient values, which are signed binary numbers, are represented by the equivalent hexadecimal values. Thus, in Table 1, the coefficient values are eight-character hexadecimal values representing 32-bit signed binary values, while in Table 2, the coefficient values are five-character hexadecimal values representing 20-bit signed binary values:
In the examples shown, the second term will have 17 possible exponent values including the original unshifted value (32 bits of input range, with each successive shifted value decreasing by 2 bits per bit of reduction of the input power) as shown in Table 1, and the third term will have five possible exponent values including the original unshifted value (18 bits of input range, with each successive shifted value decreasing by 4 bits per bit of reduction of the input power) as shown in Table 2. In other embodiments, these tables may be somewhat larger, to allow at least some small contribution into the least significant bit position of the result.
The input 111 is in double-precision format, including a 52-bit mantissa 121 (not including an implied leading ‘1’) and an 11-bit exponent 131. As part of the conversion to fixed-point processing, the mantissa is expanded to 53 bits by converting the implied leading ‘1’ to an actual leading ‘1’. The x3 term is calculated to 36-bit precision, by multiplying x by itself using a 36×36 bit fixed-point multiplier 101, and multiplying that result by x using another 36×36 bit fixed-point multiplier 102. The upper 36 bits of x are used in each multiplication operation. x is inherently aligned with itself for the first fixed-point operation, while x2 is aligned with x for the second fixed-point operation.
To calculate the “inner series” of Equation (4), the upper 18 bits of the x2 term are multiplied, using fixed point multiplier 103, with the output of the third term coefficient table 107. Third term coefficient table 107 is addressed by the input exponent through address circuitry 117, to select the properly-shifted version of the coefficient, which is provided in an unnormalized fixed-point format. The result of that multiplication, right-shifted by 20 bits, is added to the 36-bit output of the second term coefficient table 108, which also is provided in an unnormalized fixed-point format, using a 36-bit fixed-point adder 104. Like third term coefficient table 107, second term coefficient table 108 is indexed by the input exponent through address circuitry 118 to select the properly-shifted version of the coefficient.
That completes the first two terms of the “inner series.” As noted above, in this example, the third and subsequent terms are beyond the 52-bit precision of the system and therefore need not be computed. For systems of different precision, or where different numbers of bits are provided in the inputs or coefficients, it is possible that a different number of terms of the “inner series” may be calculated.
The 36-bit inner series result is then multiplied by the x3 term using a 36×36-bit fixed-point multiplier 105. The upper 36 bits of that product, right-shifted by 20 bits, is added to the prefixed input mantissa 111 by 53-bit fixed point adder 106.
The mantissa is then normalized. Because the sum of all of the following terms would always be very small—i.e., less than 0.510—only a 1-bit normalization is needed (i.e., a 1-bit shift will be applied where needed). The 1-bit normalization can be carried out using a 52-bit 2:1 multiplexer 109.
As can be seen, this example uses two 36×36 fixed-point multipliers (101 and 105) and two 18×18 fixed-point multipliers (102 and 103), as well as one 36-bit fixed-point adder 104, one 53-bit fixed-point adder 106, and one 52-bit 2:1 multiplexer, as well as memories for the coefficient tables 107, 108. In all, if this example is implemented in a STRATIX® PLD of the type described above, 188 adaptive look-up tables and 14 18×18 fixed-point multipliers are used. This is much smaller than previously-known hardware implementations of Horner's method.
Specifically, a brute-force double-precision floating-point implantation of Equation (4) would use about 4000 adaptive look-up tables and 27 18×18 fixed-point multipliers. By finding an optimal translation to fixed-point arithmetic, the required resources are greatly reduced when implementing the present invention. The latency also is much smaller, at about 10 clocks, which is less than the latency of a single double-precision floating-point multiplier or adder by itself.
Although the example described above in connection with
Thus it is seen that circuitry and methods for performing polynomial calculations have been provided. This invention may have use in hard-wired implementations of polynomial calculations, as well as in software implementations.
Another potential use for the present invention may be in programmable devices such as PLDs, as discussed above, where programming software can be provided to allow users to configure a programmable device to perform polynomial calculations, either as an end result or as part of a larger operation. The result would be that fewer logic resources of the programmable device would be consumed. And where the programmable device is provided with a certain number of dedicated blocks for arithmetic functions (to spare the user from having to configure arithmetic functions from general-purpose logic), the number of dedicated blocks needed to be provided (which may be provided at the expense of additional general-purpose logic) can be reduced (or sufficient dedicated blocks for more operations, without further reducing the amount of general-purpose logic, can be provided).
Instructions for carrying out a method according to this invention for programming a programmable device to perform polynomial calculations, may be encoded on a machine-readable medium, to be executed by a suitable computer or similar device to implement the method of the invention for programming or configuring PLDs or other programmable devices to perform operations as described above. For example, a personal computer may be equipped with an interface to which a PLD can be connected, and the personal computer can be used by a user to program the PLD using a suitable software tool, such as the QUARTUS® II software available from Altera Corporation, of San Jose, Calif.
The magnetic domains of coating 802 of medium 800 are polarized or oriented so as to encode, in manner which may be conventional, a machine-executable program, for execution by a programming system such as a personal computer or other computer or similar system, having a socket or peripheral attachment into which the PLD to be programmed may be inserted, to configure appropriate portions of the PLD, including its specialized processing blocks, if any, in accordance with the invention.
In the case of a CD-based or DVD-based medium, as is well known, coating 812 is reflective and is impressed with a plurality of pits 813, arranged on one or more layers, to encode the machine-executable program. The arrangement of pits is read by reflecting laser light off the surface of coating 812. A protective coating 814, which preferably is substantially transparent, is provided on top of coating 812.
In the case of magneto-optical disk, as is well known, coating 812 has no pits 813, but has a plurality of magnetic domains whose polarity or orientation can be changed magnetically when heated above a certain temperature, as by a laser (not shown). The orientation of the domains can be read by measuring the polarization of laser light reflected from coating 812. The arrangement of the domains encodes the program as described above.
A PLD 90 programmed 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
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.
Number | Name | Date | Kind |
---|---|---|---|
3473160 | Wahlstrom | Oct 1969 | A |
3800130 | Martinson et al. | Mar 1974 | A |
3814924 | Tate | Jun 1974 | A |
3896299 | Rhodes | Jul 1975 | 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 | Barkan | Apr 1988 | A |
4754421 | Bosshart | Jun 1988 | A |
4777614 | Ward | Oct 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 |
4908788 | Fujiyama | Mar 1990 | 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 |
4999803 | Turrini et al. | Mar 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 |
5373461 | Bearden et al. | Dec 1994 | A |
5375079 | Uramoto et al. | Dec 1994 | A |
5381357 | Wedgwood et al. | Jan 1995 | A |
5404324 | Colon-Bonet | 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 |
6026420 | DesJardins 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 |
6052773 | DeHon 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 |
6346824 | New | Feb 2002 | B1 |
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 |
6385632 | Choe et al. | May 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 |
6578060 | Chen et al. | Jun 2003 | B2 |
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 |
7024446 | Langhammer et al. | Apr 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 |
7200631 | Mailaender et al. | Apr 2007 | B2 |
7230451 | Langhammer | Jun 2007 | B1 |
7313585 | Winterrowd | Dec 2007 | B2 |
7343388 | Burney et al. | Mar 2008 | B1 |
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 |
7720898 | Driker et al. | May 2010 | B2 |
7769797 | Cho et al. | Aug 2010 | B2 |
7814136 | Verma et al. | Oct 2010 | B1 |
7814137 | Mauer | Oct 2010 | B1 |
7822799 | Langhammer et al. | Oct 2010 | B1 |
7836117 | Langhammer et al. | Nov 2010 | B1 |
7865541 | Langhammer | Jan 2011 | B1 |
7917567 | Mason et al. | Mar 2011 | B1 |
7930335 | Gura | Apr 2011 | B2 |
7930336 | Langhammer | Apr 2011 | B2 |
7949699 | Neoh et al. | May 2011 | B1 |
7974997 | Arviv et al. | Jul 2011 | B2 |
8041759 | Langhammer et al. | Oct 2011 | B1 |
8090758 | Shimanek et al. | Jan 2012 | B1 |
8112466 | Minz et al. | Feb 2012 | B2 |
8301681 | Lee et al. | Oct 2012 | B1 |
8307023 | Leung et al. | Nov 2012 | B1 |
8386550 | Mauer et al. | Feb 2013 | B1 |
8386553 | Langhammer et al. | Feb 2013 | B1 |
8396914 | Langhammer | Mar 2013 | 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 |
20020032713 | Jou et al. | Mar 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 |
20020129073 | Page et al. | Sep 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 |
20050120122 | Farnham | Jun 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 |
20060059215 | Maharatna et al. | Mar 2006 | A1 |
20060112160 | Ishii et al. | May 2006 | A1 |
20060200732 | Dobbek et al. | Sep 2006 | A1 |
20070083585 | St. Denis et al. | Apr 2007 | A1 |
20070124352 | Wittig | May 2007 | A1 |
20070185951 | Lee et al. | Aug 2007 | A1 |
20070185952 | Langhammer et al. | Aug 2007 | A1 |
20070226287 | Lin et al. | Sep 2007 | A1 |
20070241773 | Hutchings et al. | Oct 2007 | A1 |
20080133627 | Langhammer et al. | Jun 2008 | A1 |
20080159441 | Liao et al. | Jul 2008 | A1 |
20080183783 | Tubbs | Jul 2008 | A1 |
20090028455 | Nakamura et al. | Jan 2009 | A1 |
20090083358 | Allen | Mar 2009 | A1 |
20090113186 | Kato et al. | Apr 2009 | A1 |
20090164544 | Dobbek et al. | Jun 2009 | A1 |
20090172052 | DeLaquil et al. | Jul 2009 | A1 |
20090187615 | Abe et al. | Jul 2009 | A1 |
20090228689 | Muff et al. | Sep 2009 | A1 |
20090300088 | Michaels et al. | Dec 2009 | A1 |
20100098189 | Oketani | Apr 2010 | A1 |
20100131577 | Gangalakurti et al. | May 2010 | A1 |
20100146022 | Swartzlander et al. | Jun 2010 | A1 |
20100191939 | Muff et al. | Jul 2010 | A1 |
20110161389 | Langhammer et al. | Jun 2011 | 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 |
20120113133 | Shpigelblat | May 2012 | A1 |
20120166512 | Wong et al. | Jun 2012 | A1 |
20120191967 | Lin et al. | Jul 2012 | A1 |
20120290819 | Langhammer | Nov 2012 | A1 |
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 419 105 | Mar 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 |
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 2005066832 | Jul 2005 | WO |
WO 2005101190 | Oct 2005 | WO |
WO 2010102007 | Sep 2010 | WO |
Entry |
---|
Altera, “DSP Blocks in Stratix III Devices”, Chapter 5, pp. 1-42, Mar. 2010. |
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). |
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. |
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. |
deDinechin, F. et al., “Large multipliers with less DSP blocks,” retrieved from http://hal-ens-lyon.archives-ouvertes.fr/ens1-00356421/en/, 9 pgs., 2009. |
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. |
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. |
Fujioka, Y., et al., “240 MOPS Reconfigurable Parallel VLSI Processor for Robot Control”, Proceedings of the 1992 International Conference on Industrial Electronics, Control, Instrumentation, and Automation, vol. 3, pp. 1385-1390, Nov. 9-13, 1992. |
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. Reconfiqurable 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. |
“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. |
Karlstrom, K., et al., “High Performance, Low Latency FPGA based Floating Point Adder and Multiplier Units in a Virtex 4,” Norchip Conf., pp. 31-34, 2006. |
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. |
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. |
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. |
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. |
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. |
Nedjah, N., et al., “Fast Less Recursive Hardware for Large Number Multiplication Using Karatsuba-Ofman's Algorithm,” Computer and Information Sciences—ISCIS, pp. 43-50, 2003. |
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. |
Thapliyal, H., et al., “Combined Integer and Floating Point Multiplication Architecture (CIFM) for FPGSs and Its Reversible Logic Implementation”, Proceedings MWSCAS 2006, Puerto Rico, 5 pages, Aug. 2006. |
Thapliyal, H., et al., “Combined Integer and Variable Precision (CIVP) Floating Point Multiplication Architecture for FPGAs”, Proceedings of the 2007 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'07), Las Vegas, US, vol. 1, pp. 449-450, Jun. 2007. |
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. |
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. |
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. |
Xilinx, Inc., “Virtex-5 ExtremeDSP Design Considerations,” User Guide UG193, v2.6, 114 pages, Oct. 2007. |
Xilinx, Inc., “Implementing Barrel Shifters Using Multipliers”, p. 1-4, Aug. 17, 2004. |
Zhou, G. et al., “Efficient and High-Throughput Implementations of AES-GCM on FPGAs,” International Conference on Field-Programmable Technology, 8 pgs., Dec. 2007. |
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). |