Method for configuring a finite impulse response filter in a programmable logic device

Information

  • Patent Grant
  • 8386550
  • Patent Number
    8,386,550
  • Date Filed
    Wednesday, September 20, 2006
    17 years ago
  • Date Issued
    Tuesday, February 26, 2013
    11 years ago
Abstract
A hybrid FIR filter includes a plurality of FIR filter units arranged as Direct Form FIR filters, connected together in an arrangement similar to a Transpose Form FIR filter. The hybrid filter arrangement may be used to configure a larger FIR filter in a programmable logic device having one or more specialized functional blocks, incorporating multipliers and adders, that are particularly well-suited for configuration as small Direct Form FIR filters.
Description
BACKGROUND OF THE INVENTION

This invention relates to a method for configuring a finite impulse response filter in a programmable logic device, and more particularly to efficiently configuring a finite impulse response filter of arbitrary size.


Programmable logic devices are well known. Early programmable logic devices were one-time configurable. For example, configuration may have been achieved by “blowing”—i.e., opening—fusible links. Alternatively, the configuration may have been stored in a programmable read-only memory. Those devices generally provided the user with the ability to configure the devices for “sum-of-products” (or “P-TERM”) logic operations. Later, such programmable logic devices incorporating erasable programmable read-only memory (EPROM) for configuration became available, allowing the devices to be reconfigured.


Still later, programmable logic devices incorporating static random access memory (SRAM) elements for configuration became available. These devices, which also can be reconfigured, store their configuration in a nonvolatile memory such as an EPROM, from which the configuration is loaded into the SRAM elements when the device is powered up. These devices generally provide the user with the ability to configure the devices for look-up-table-type logic operations.


As programmable logic devices have become larger, it has become more common to add specialized blocks to perform particular functions that have become more common in programmable logic devices. For example, at some point, such devices began to be provided with embedded blocks of random access memory that could be configured by the user to act as random access memory, read-only memory, or logic (such as P-TERM logic); such embedded blocks might even be provided in different sizes on the same device. Other types of memory, such as read-only memory (ROM) or shift registers, also have been provided. More recently, multiplier circuits have been provided on programmable logic devices. Whereas in prior programmable logic devices space was not available for dedicated multipliers, current larger devices can accommodate multipliers. This spares users from having to create multipliers by configuring the available logic. Moreover, as described in commonly-assigned U.S. Pat. No. 6,538,470, which is hereby incorporated by reference in its entirety, specialized multiplier blocks may be provided including multipliers and other arithmetic circuits such as adders and/or subtracters and/or accumulators. Such blocks are sometimes referred to as “multiplier-accumulator blocks” or “MAC blocks.” Such blocks, for example, may be useful in digital signal processing, such as is performed in audio applications, and therefore such specialized multiplier blocks also are sometimes referred to as “DSP blocks.”


Such specialized multiplier blocks typically are capable of operations up to a certain size. For example, a specialized multiplier block may be provided that can perform a single 36-bit-by-36-bit multiplication operation, or up to four individual 18-bit-by-18-bit multiplication operations which can be combined by the aforementioned adders.


One use for such a specialized multiplier block may be as a finite impulse response (FIR) filter, or portion of a FIR filter. In a FIR filter, which is commonly used for DSP operations, samples of a signal to be processes are multiplied by a fixed set of coefficients and those products are added together. A FIR filter may be characterized by its number of taps, which corresponds to the number of multipliers and also to the number of coefficients.


A specialized multiplier block of the type described above necessarily has a finite number of multipliers. While such a block is particularly well-adapted to be configured as a FIR filter, if the number of multipliers required (i.e., the number of taps) exceeds the number of multipliers in the block, then more than one block must be used to create the required filter. For example, specialized multiplier blocks in the STRATIX® family of PLDs available from Altera Corporation, of San Jose, Calif., specialized multiplier blocks typically have four multipliers. On the other hand, in many DSP applications, FIR filters with over 200 taps are not unheard of. Thus, implementation of a FIR filter is frequently spread over a large number of specialized multiplier blocks, giving rise to routing and speed issues.


It would be desirable to be able to configure a FIR filter in a programmable logic device as efficiently as possible for a given number of filter taps.


SUMMARY OF THE INVENTION

The present invention achieves greater efficiency in the configuration of specialized functional blocks of the type described above as FIR filters, by providing a configuration method that combines aspects of different forms of FIR filters in a way that is more efficient.


FIR filters can be arranged in any of several forms. Among those forms are the Direct Form (including Direct Form I and Direct Form II) and the Transpose Form. In the Direct Form, a set of coefficients is input to the multipliers, and the entire chain of samples is shifted to each multiplier. On each clock cycle, all of the products are different, and are summed to provide the output for that clock cycle. Although Direct Form FIR filters map easily onto specialized functional blocks of the type described above—indeed, a 4-tap Direct Form FIR filter can be implemented entirely in one such block in the aforementioned STRATIX® family of devices—larger filters may require a long input sample chain and a large adder tree that is difficult to route and limits the maximum clock speed attainable.


In a Transpose Form FIR filter, the coefficients are input as above. On each clock cycle, the same sample is input to all multipliers. The result of each multiplication is stored in a one-cycle delay and added on the next cycle to the result of the adjacent multiplication. The output for each cycle is the sum at the end of the chain. A Transpose Form FIR filter therefore requires no sample chain and no adder tree. However, the required adders become progressively wider down the chain (because the sum becomes wider as more stages are added in), with the result that a large number of adders have large widths, which limits the maximum clock speed attainable. In addition, because each stage requires one multiplier and one adder (to add each product to the delayed sum of the upstream stages), Transpose Form FIR filters do not map well onto specialized functional blocks of the type described above, which generally have fewer adders than multipliers.


In accordance with the invention, specialized functional blocks in PLDs are configured as a hybrid form of FIR filter, including characteristics of both Direct Form and Transpose Form FIR filters, but providing mathematically identical results and having fewer disadvantages than either form when mapped onto specialized functional blocks. The invention provides a hybrid FIR filter including a first number of Transpose Form FIR filter stages, where each stage is a Direct Form FIR filter.


A method is provided according to the invention for programmably configuring a programmable logic device as a hybrid FIR filter, where the programmable logic device is of a type having a plurality of specialized processing blocks each of which includes a plurality of multipliers and circuitry for adding outputs of the multipliers. The method includes programmably configuring each of a first number of the specialized processing blocks as a respective Direct Form FIR filter. An adder chain is programmably configured to add outputs of the Direct Form FIR filters. The adder chain includes a respective delay between each of the Direct Form FIR filters. As a result, the programmable logic device is configured as a Transpose Form FIR filter having a number of stages equal to said first number, with each stage being one of the Direct Form FIR filters.





BRIEF DESCRIPTION OF THE DRAWINGS

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



FIG. 1 is a schematic representation of a 4-tap Direct Form FIR filter;



FIG. 2 is a schematic representation of a 4-tap Transpose Form FIR filter;



FIG. 3 is a representation of the chaining of results between stages of a Transpose Form FIR filter;



FIG. 4 is a schematic representation of a multitap hybrid form FIR filter in accordance with the present invention, incorporating stages each of which is a 4-tap Direct Form FIR filter;



FIG. 5 is a schematic representation of a multitap hybrid form FIR filter in accordance with the present invention, incorporating stages each of which is a Direct Form FIR filter of generic width;



FIG. 6 is a cross-sectional view of a magnetic data storage medium encoded with a set of machine-executable instructions for performing the method according to the present invention; and



FIG. 7 is a cross-sectional view of an optically readable data storage medium encoded with a set of machine executable instructions for performing the method according to the present invention.





DETAILED DESCRIPTION OF THE INVENTION

As described above, FIR filters are common structures used in many DSP applications. Mathematically, a FIR filter may be described as:






Yk
=





i
=
0


Taps
-
1








Ci











Sk


-
i






where Yk is the kth output term, ci is the ith coefficient, sk-i is the (k−i)th sample, and Taps is the number of taps in the filter.


The structure of a 4-tap Direct Form II FIR filter 10 is shown in FIG. 1, and includes four multipliers 11. The multiplier outputs are added by adder tree 12, shown schematically in collapsed form, to provide term Yk. Each multiplier 11 has a coefficient input 13 for one of the four coefficients c0-c3. In some applications, the coefficients are held constant, while in others, such as adaptive filters, decimation filters, interpolation filters, etc., they may change. Each multiplier 11 also has a sample input 14, and the samples sk are clocked in via sample chain 15. The kth term Yk is provided when coefficient c0 is being multiplied by the kth sample sk and the other coefficients c1-c3 are being multiplied by the (k−1)th through (k−3)th samples, added by adder 16 as shown. Thus, as each new sample is clocked in, the previous samples are reused, so that they are used a total number of times equal to the number of taps as follows:

y0=c0s0+c1s−1+c2s−2+c3s−3
y1=c0s1+c1s0+c2s−1+c3s−2
y2=c0s2+c1s1+c2s−0+c3s−1
y3=c0s3+c1s2+c2s1+c3s0
y4=c0s4+c1s3+c2s2+c3s1


As explained above, if the number of taps is large, the number of multipliers needed is large, as is the size of the required adder tree, and moreover the sample rate dictates the number of multiplications that must be performed during each clock cycle. For more than four taps, sample chain 15 would extend to the right, to the next group of multipliers. The number of taps that may be required in any application is arbitrary. Therefore, in a PLD implementation, where the number of multipliers and associated adders grouped in a single block is necessarily finite, a large number of taps translates into a large number of blocks, leading to a large routing problem as well as the implementation of a large adder tree, with all of the consequent effects on latency and attainable clock speeds. At the same time, however, the structure of the specialized functional blocks described above is well-suited to the Direct Form II FIR filter.



FIG. 2 shows the structure of a 4-tap Transpose Form FIR filter 20, which again includes four multipliers 11. Once again, each multiplier 11 has a coefficient input 13, and the four coefficients c0-c3 are held constant. However, instead of clocking in the samples sk via a sample chain as in FIG. 1, in Transpose FIR filter 20, the kth sample is input to each multiplier 11 substantially simultaneously. In other words, all multipliers 11 receive the same sample input, with the output of each multiplier added by respective adder 22 to the delayed output of the previous adder 22, as delayed by one of one-clock-cycle delay elements 23. Each combination of a multiplier 11, adder 22 and delay element 23 may be referred to as a “stage” 24 of filter 20. In the first stage, the second input to adder 22 may be zero, as shown. The kth term Yk is provided from the stage 24 whose coefficient is c0. Thus, only one sample is required at any one time, but the results for each sample are stored in delays 23 and added into the next stage, as shown in FIG. 3.


The Transpose Form FIR filter has the advantage, as compared to the Direct Form, that neither a sample chain nor a large adder tree is required. However, the average adder width is greater than in the Direct Form. Indeed, in some embodiments, as many as half of all adders used to implement the filter are of the maximum width. Large adder widths have a detrimental effect on the maximum attainable clock speed. In addition, as compared to the Direct Form FIR filter, a Transpose Form FIR filter is not as easily implemented in the specialized functional block described above.


The present invention combines the advantages of the Direct Form and Transpose Form FIR filters. In accordance with the invention, one embodiment of which is shown in FIG. 4, a FIR filter 40 of the Transpose Form type has as each of its stages 41 a FIR filter unit 42 of the Direct Form type. In this embodiment 40, FIR filter unit 42 includes four multipliers 420. The specialized multiplier blocks described above, having four multipliers, are particularly well-suited to implementing this embodiment 40.


Instead of inputting one sample sk at a time to all stages, four samples st are input at any one time. The most recent sample st is input substantially simultaneously to the leftmost (as depicted in FIG. 4) multiplier 420 in each of units 42 while each of three less recent samples st is input substantially simultaneously to a respectively further rightward (as depicted in FIG. 4) one of the multipliers 420. A chain 43 of registers or delays 430 of one clock period each is required to maintain the four samples st.


The number—in this embodiment, four—of delays 430 in chain 43 may be referred to as the depth, nd, of the hybrid Transpose/Direct Form FIR filter 40. A cascade adder chain 44 is used to add the results of the stages 41. Unlike Transpose Form FIR filter 20 in which the output of each stage is stored in a one-clock-cycle delay 23, because it takes four clock periods to clock all samples into sample chain 43, each delay 441 between adders 440 of adder chain 44 is four clock periods long. The number of stages 41 of hybrid filter 40 may be referred to as the width, nt, of filter 40. The product nt×nd is equal to the number of taps of filter 40.


Similarly to the case of Transpose Form FIR filter 20, in which only one sample is required at any one time, but the results for each sample are stored in delays 23 and added into the next stage, as shown in FIG. 3, in hybrid Transpose/Direct Form FIR filter 40, only four samples are required at any one time, but the results for each group of four samples are stored in delays 441 and added into the next stage.



FIG. 5 shows the hybrid Transpose/Direct Form FIR filter according to the invention, generalized to arbitrary nd and arbitrary nt. In embodiment 50, each stage 51 is a FIR filter unit 52 of the Direct Form type, including an arbitrary number nd of multipliers 520. Similarly, sample chain 53 includes nd one-clock-cycle delays 530, and adder chain 54, used to add the results of the stages 51, includes delays 541 between adders 540, with each delay 541 being nd clock periods long.


It will be apparent that for nd=1, the Transpose/Direct Form FIR filter according to the invention collapses to an ordinary Transpose Form FIR filter, while for nt=1, the Transpose/Direct Form FIR filter according to the invention collapses to an ordinary Direct Form FIR filter.


Although the sample chain required for the Transpose/Direct Form FIR filter according to the invention is longer than that needed for any ordinary Transpose Form FIR filter, it is nevertheless shorter than that needed for a Direct Form FIR filter of arbitrary length, and is limited to a finite length of nd. The hybrid structure maps well onto specialized processing blocks having a finite number of multipliers. In particular, for the case 40 of nd=4, shown in FIG. 4, the hybrid structure maps well onto the aforementioned specialized processing blocks. But in any case, regardless of the particular type of specialized processing block, there will be a value of nd for which the hybrid structure maps well. Moreover, because of the delays inherent in adder chain 44/54, the adder chain can be split over several clock cycles, with minimal impact on resources even for large adders.


It is common in specialized multiplier blocks to include pipelining registers, e.g., before and after the multipliers, and between different adder stages. Those pipelining registers, if provided, can be counted towards the total number of delays (z−nd). This would lead to a more efficient implementation of the invention.


The hybrid Transpose/Direct Form FIR filter according to the invention can be used in different kinds of integrated circuit devices including, without limitation, application-specific integrated circuits and PLDs, and the invention includes the method of programming the hybrid Transpose/Direct Form FIR filter into the specialized multiplier block of a PLD. PLDs programmed in accordance with the invention may be used in many kinds of electronic devices. One possible use is in a data processing system that also may include one or more of the following components: a processor; memory; I/O circuitry; and peripheral devices. These components may be coupled together by a system bus and are populated on a circuit board which is contained in an end-user system.


The end user system 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. The PLD can be used to perform a variety of different logic functions. For example, the PLD can be configured as a processor or controller that works in cooperation with the main system processor. The PLD may also be used as an arbiter for arbitrating access to shared resources in the system. In yet another example, the PLD can be configured as an interface between the processor and one of the other components in the system.


Various technologies can be used to implement integrated circuit devices of the type described above, including PLDs that can be programmed according to this invention.


Instructions for carrying out the method according to this invention 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 PLDs. 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 described above.



FIG. 6 presents a cross section of a magnetic data storage medium 600 which can be encoded with a machine executable program that can be carried out by systems such as the aforementioned personal computer, or other computer or similar device. Medium 600 can be a floppy diskette or hard disk, or magnetic tape, having a suitable substrate 601, which may be conventional, and a suitable coating 602, which may be conventional, on one or both sides, containing magnetic domains (not visible) whose polarity or orientation can be altered magnetically. Except in the case where it is magnetic tape, medium 600 may also have an opening (not shown) for receiving the spindle of a disk drive or other data storage device.


The magnetic domains of coating 602 of medium 600 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, as a hybrid Transpose Form/Direct Form FIR filter in accordance with the invention.



FIG. 7 shows a cross section of an optically-readable data storage medium 700 which also can be encoded with such a machine-executable program, which can be carried out by systems such as the aforementioned personal computer, or other computer or similar device. Medium 700 can be a conventional compact disk read only memory (CD-ROM) or digital video disk read only memory (DVD-ROM) or a rewriteable medium such as a CD-R, CD-RW, DVD-R, DVD-RW, DVD+R, DVD+RW, or DVD-RAM or a magneto-optical disk which is optically readable and magneto-optically rewriteable. Medium 700 preferably has a suitable substrate 701, which may be conventional, and a suitable coating 702, which may be conventional, usually on one or both sides of substrate 701.


In the case of a CD-based or DVD-based medium, as is well known, coating 702 is reflective and is impressed with a plurality of pits 703, 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 702. A protective coating 704, which preferably is substantially transparent, is provided on top of coating 702.


In the case of magneto-optical disk, as is well known, coating 702 has no pits 703, 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 702. The arrangement of the domains encodes the program as described above.


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, and the present invention is limited only by the claims that follow.

Claims
  • 1. A programmable logic device configured as hybrid finite impulse response (FIR) filter circuitry; wherein: said programmable logic device has a plurality of specialized processing blocks each of which includes a plurality of multipliers and a single adder for simultaneously adding outputs of said multipliers; andsaid hybrid FIR filter circuitry comprises:a first number of said specialized processing blocks each of which is configured as a respective Direct Form FIR filter circuit in which each respective multiplier in said plurality of multipliers multiplies a respective sample by a respective coefficient and outputs of said respective multipliers are added simultaneously by said single adder to generate a Direct Form FIR output, said hybrid FIR filter circuitry having a second number of taps, each said Direct Form FIR filter circuit comprising a third number of taps, and said second number being a product of said first number and said third number;an adder chain comprising a plurality of additional adders, separate from any adder in said first number of said specialized processing blocks that adds said outputs of said respective multipliers, each of said additional adders having, as one input, one output of one of said respective Direct Form FIR filter circuits, and each of said additional adders other than a first of said additional adders having as one input an output of another one of said additional adders, said adder chain further comprising a respective output delay between (a) each said output of another one of said additional adders, that is an input to one of said additional adders other than a first one of said additional adders, and (b) said one of said additional adders other than a first one of said additional adders, andan input sample chain comprising a number of registers equal to said third number; wherein:each said register provides a sample substantially simultaneously to a corresponding input of each said Direct Form FIR filter circuit,said input sample chain shifts once at every clock cycle,each Direct Form FIR filter circuit generates an output at every said clock cycle, andeach said respective output delay has a delay period of a number of said clock cycles equal to said third number.
  • 2. The programmable logic device of claim 1 wherein: each said Direct Form FIR filter circuit comprises a number of multiplier circuits equal to said third number; andeach said corresponding input comprises an input to a respective one of said multiplier circuits in each said Direct Form FIR filter circuit.
  • 3. The programmable logic device of claim 2; wherein: said hybrid FIR filter circuitry further comprises a number of coefficients equal to said second number;said coefficients are divided into a number of groups equal to said first number;each said group comprises a number of coefficients equal to said third number; andeach coefficient in each said group is input to a respective one of said multiplier circuits.
  • 4. The programmable logic device of claim 1 wherein: each said Direct Form FIR filter circuit comprises a number of multiplier circuits equal to said third number;said hybrid FIR filter circuitry further comprises a number of coefficients equal to said second number;said coefficients are divided into a number of groups equal to said first number;each said group comprises a number of coefficients equal to said third number; andeach coefficient in each said group is input to a respective one of said multiplier circuits.
  • 5. A method of programmably configuring a programmable logic device as a hybrid finite impulse response (FIR) filter, said programmable logic device having a plurality of specialized processing blocks each of which includes a plurality of multipliers and a single adder for simultaneously adding outputs of said multipliers, said method comprising: programmably configuring each of a first number of said specialized processing blocks as a respective Direct Form FIR filter in which each respective multiplier in said plurality of multipliers multiplies a respective sample by a respective coefficient and outputs of said respective multipliers are added simultaneously by said single adder to generate a Direct Form FIR output, said hybrid FIR filter having a second number of taps, each said respective Direct Form FIR filter comprising a third number of taps, and said second number being a product of said first number and said third number;programmably configuring an adder chain from a plurality of additional adders, separate from any adder in said first number of said specialized processing blocks that adds said outputs of said respective multipliers, to add outputs of said Direct Form FIR filters, said adder chain comprising a respective delay preceding each of said additional adders in said adder chain, other than a first one of said additional adders in said adder chain, that has, as an input, one of said outputs of said Direct Form FIR filters;programmably configuring each said respective delay to have a delay period of a number of clock cycles equal to said third number; andprogrammably configuring an input sample chain comprising a number of registers equal to said third number; wherein:each said register provides a sample substantially simultaneously to a corresponding input of each said Direct Form FIR filter,said input sample chain shifts once at every clock cycle,each Direct Form FIR filter circuit generates an output at every said clock cycle, andsaid programmable logic device is configured as a hybrid FIR filter having a number of hybrid stages equal to said first number, each of said hybrid stages comprising a respective one of said Direct Form FIR filters.
  • 6. The method of claim 5 wherein: each said Direct Form FIR filter comprises a number of multipliers equal to said third number; andeach said corresponding input comprises an input to a respective one of said multipliers in each said Direct Form FIR filter.
  • 7. The method of claim 6 wherein said hybrid FIR filter comprises a number of coefficients equal to said second number; said method further comprising: programmably configuring a number of coefficient memories equal to said first number, each said coefficient memory storing a number of coefficients equal to said third number; andprogrammably configuring each coefficient stored in each said memory as an input to a respective one of said multipliers.
  • 8. The method of claim 5 wherein: said programmably configuring each of a first number of said specialized processing blocks as a respective Direct Form FIR filter comprises programmably configuring each said Direct Form FIR filter to have a number of multipliers equal to said third number; andsaid hybrid FIR filter further comprises a number of coefficients equal to said second number; said method further comprising:programmably configuring a number of coefficient memories equal to said first number, each said coefficient memory storing a number of coefficients equal to said third number; andprogrammably configuring each coefficient stored in each said memory as an input to a respective one of said multipliers.
  • 9. A non-transitory data storage medium encoded with non-transitory machine-executable instructions for performing a method of programmably configuring a programmable logic device as a hybrid finite impulse response (FIR) filter, said programmable logic device having a plurality of specialized processing blocks each of which includes a plurality of multipliers and a single adder for simultaneously adding outputs of said multipliers, said instructions comprising: instructions to programmably configure each of a first number of said specialized processing blocks as a respective Direct Form FIR filter in which each respective multiplier in said plurality of multipliers multiplies a respective sample by a respective coefficient and outputs of said respective multipliers are added simultaneously by said single adder to generate a Direct Form FIR output, said hybrid FIR filter having a second number of taps, said instructions to programmably configure each of said first number of said specialized processing blocks as said respective Direct Form FIR filter comprises instructions to programmably configure each said Direct Form FIR filter with a third number of taps, said second number being a product of said first number and said third number;instructions to programmably configure an adder chain from a plurality of additional adders, separate from any adder in said first number of said specialized processing blocks that adds said outputs of said respective multipliers, to add outputs of said Direct Form FIR filters, said adder chain comprising a respective delay preceding each of said additional adders in said adder chain, other than a first one of said additional adders in said adder chain, that has as an input one of said Direct Form FIR filters;instructions to programmably configure each said respective delay to have a delay period of a number of clock cycles equal to said third number; andinstructions to programmably configure an input sample chain comprising a number of registers equal to said third number; wherein:each said register provides a sample substantially simultaneously to a corresponding input of each said Direct Form FIR filter,said input sample chain shifts once at every clock cycle,each Direct Form FIR filter circuit generates an output at every said clock cycle, andsaid programmable logic device is configured as a hybrid FIR filter having a number of hybrid stages equal to said first number, each of said hybrid stages comprising a respective one of said Direct Form FIR filters.
  • 10. The non-transitory data storage medium of claim 9 wherein said instructions further comprise: instructions to configure each said Direct Form FIR filter with a number of multipliers equal to said third number; wherein:each said corresponding input comprises an input to a respective one of said multipliers in each said Direct Form FIR filter.
  • 11. The non-transitory data storage medium of claim 10 wherein said hybrid FIR filter comprises a number of coefficients equal to said second number; said instructions further comprising: instructions to programmably configure a number of coefficient memories equal to said first number, each said coefficient memory storing a number of coefficients equal to said third number; andinstructions to programmably configure each coefficient stored in each said memory as an input to a respective one of said multipliers.
  • 12. The non-transitory data storage medium of claim 9 wherein: said instructions to programmably configure each of a first number of said specialized processing blocks as a respective Direct Form FIR filter comprise instructions to programmably configure each said Direct Form FIR filter to have a number of multipliers equal to said third number; andsaid hybrid FIR filter further comprises a number of coefficients equal to said second number; said instructions further comprising:instructions to programmably configure a number of coefficient memories equal to said first number, each said coefficient memory storing a number of coefficients equal to said third number; andinstructions to programmably configure each coefficient stored in each said memory as an input to a respective one of said multipliers.
US Referenced Citations (334)
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 Barkan Apr 1988 A
4754421 Bosshart Jun 1988 A
4791590 Ku et al. Dec 1988 A
4799004 Mori Jan 1989 A
4823295 Mader Apr 1989 A
4839847 Laprade Jun 1989 A
4871930 Wong et al. Oct 1989 A
4912345 Steele et al. Mar 1990 A
4918637 Morton Apr 1990 A
4967160 Quievy et al. Oct 1990 A
4982354 Takeuchi et al. Jan 1991 A
4991010 Hailey et al. Feb 1991 A
4994997 Martin et al. Feb 1991 A
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-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
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 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 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 De Lange 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 et al. May 2004 B1
6744278 Liu et al. Jun 2004 B1
6745254 Boggs et al. Jun 2004 B2
6763367 Kwon et al. Jul 2004 B2
6771094 Langhammer et al. Aug 2004 B1
6774669 Liu et al. Aug 2004 B1
6781408 Langhammer Aug 2004 B1
6781410 Pani et al. Aug 2004 B2
6788104 Singh et al. Sep 2004 B2
6801924 Green et al. Oct 2004 B1
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
7668896 Lutz et al. Feb 2010 B2
7719446 Rosenthal et al. May 2010 B2
7769797 Cho et al. Aug 2010 B2
7930335 Gura Apr 2011 B2
7930336 Langhammer Apr 2011 B2
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
Foreign Referenced Citations (47)
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
Non-Patent Literature Citations (77)
Entry
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).
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 Reconfigurable 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.
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.
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.
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 15, 997, pp. 103-106.
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.
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.
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.
Altera Corporation, “Stratix II Device Handbook, Chapter 6—DSP Blocks in Stratix II Devices,” v1.1, Jul. 2004.
Xilinx Inc., “Complex Multiplier v2.0”, DS291 Product Specification/Datasheet, Nov. 2004.
Haynes, S.D., et al., “Configurable multiplier blocks for embedding in FPGAs,” Electronics Letters, vol. 34, No. 7, pp. 638-639 (Apr. 2, 1998).
Altera Corporation, “FIR Compiler: MegaCore® Function User Guide,” version 3.3.0, rev. 1, pp. 3 11 through 3 15 (Oct. 2005).
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.
Osana, Y., et al., “Hardware-resource Utilization Analysis on an FPGA-Based Biochemical Simulator ReSCiP”, The Instititue of Electronics Information and Communication Technical Report CPSY2005-63, vol. 105, No. 516, Jan. 18, 2006.
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.
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.
Vladimirova, T. et al., “Floating-Point Mathematical Co-Processor for a Single-Chip On-Board Computer,” MAPLD'03 Conference, D5, Sep. 2003.
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., 2009.
Martinson, L. et al., “Digital Matched Filtering with Pipelined Floating Point Fast Fourier Transforms (FFT's),” IEEE Transactions on Acoustics, Speech, and Signal Processingvol. ASSP-23, No. 2, pp. 222-234, Apr. 1975.
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.
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.