Implementation of decimation filter in integrated circuit device using ram-based data storage

Information

  • Patent Grant
  • 7949699
  • Patent Number
    7,949,699
  • Date Filed
    Thursday, August 30, 2007
    17 years ago
  • Date Issued
    Tuesday, May 24, 2011
    13 years ago
Abstract
A programmable integrated circuit device such as a programmable logic device can be configured as a finite impulse response (FIR) filter capable of operating in decimation mode. The device includes at least one user-configurable random access memory block, and that user-configurable random access memory is configured as coefficient memories and data sample memories. The memories are large enough to hold up to all of the coefficients of the filter and a plurality of data samples at one time. Because the data samples and coefficients need not be shifted through the filter at the programmable logic device clock rate, overclocking of the filter is not necessary. The filter can run at a clock rate which is the same as the input data rate, while taking advantage of the available random access memory to mimic a shift register.
Description
BACKGROUND OF THE INVENTION

This invention relates to programmable integrated circuits, such as programmable logic devices (PLDs), and, more particularly, to the implementation of filters in specialized processing blocks which may be included in such devices.


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


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


For example, STRATIX® II and STRATIX® III PLDs sold by Altera Corporation, of San Jose, Calif., include DSP blocks, each of which includes a plurality of multipliers. Each of those DSP blocks also includes adders and registers, as well as programmable connectors (e.g., multiplexers) that allow the various components to be configured in different ways. In each such block, the multipliers can be configured not only as individual multipliers, but also as a number of smaller multipliers, or as one larger multiplier. In addition, one complex multiplication (which decomposes into two multiplication operations for each of the real and imaginary parts) can be performed.


Such a DSP block may be configured as a finite impulse response (FIR) filter. Each block may be used to perform the summation of a plurality of multiplications to form a sub-block of a longer FIR filter.


Many types of FIR filters may be encountered. Two of those types are an interpolation FIR filter—in which the number of samples is increased by a factor of n by inserting (“interpolating”) n−1 samples between adjacent samples—and a decimation FIR filter—in which the number of samples is decreased by a factor of n by removing n−1 out of every n samples. A DSP block that may be configured as different types of filters, including an interpolation FIR filter and a decimation FIR filter, is shown in copending, commonly-assigned U.S. patent application Ser. No. 11/447,370, filed Jun. 5, 2006, which is hereby incorporated by reference herein in its entirety.


As described in the above-incorporated application, when a programmable logic device including a DSP block is configured as a decimation filter, portions of the DSP block must run at several times (e.g., three or four times) the input data rate, because the filter must operate several times with different coefficients on the same data before the data is clocked out of the data registers. This is referred to as “overclocking.”


It would be desirable to be able to provide a DSP block in a programmable logic device that could perform decimation filtering without having to overclock the DSP block, especially when processing high input data rates.


SUMMARY OF THE INVENTION

The present invention relates to specialized processing blocks for PLDs wherein a specialized processing block can be configured as a FIR filter capable of performing decimation without requiring overclocking. This is achieved by using available random access memory (RAM), commonly available on programmable logic devices, in place of shift registers which are typically implemented in logic elements (LEs) of programmable logic devices. Write and read address generation is used to generate an incremental pointer which mimics shift register behavior. Depending on the symmetry structure—i.e., no symmetry, odd symmetry or even symmetry—the address generation sequence is modified accordingly.


Discrete memory blocks—e.g., one for each multiplier in the filter design—can be used for data storage. This can be done for data, coefficients, or both. Because RAM is being used instead of shift registers, the data or coefficients can be kept in memory for many clock cycles, without being clocked out of the system. Therefore, all portions of the filter, including multipliers and adders/accumulators, can be run at the same rate as the input data samples, which typically is the ordinary programmable logic device clock rate.


The ability to keep all of the data and coefficients in RAM depends on the amount of RAM provided in the programmable logic device. However, using programmable logic devices available from Altera Corporation, of San Jose, Calif., as an example, it is typical to provide RAM in programmable logic devices in blocks of 512 bits or 4 kilobits. This is expected to be sufficient for most decimation filter applications, except possibly applications that require multiple filters on a single device.


Therefore, in accordance with the present invention, there is provided a FIR filter structure for operating in decimation filter mode. The FIR filter structure includes a first number of multipliers each corresponding to one or more taps of the FIR filter structure, each of the multipliers having first and second multiplicand inputs. A second number of coefficient memories is provided, each respective one of the coefficient memories being connected to the first multiplicand input of a respective one of the multipliers, and has capacity to store a third number of coefficients. A fourth number of data sample memories is provided, each respective one of the data sample memories being connected to the second multiplicand input of a respective one of the multipliers, and has capacity to store a fifth number of data samples. All of the multipliers, the coefficient memories, and the data sample memories operate at a single clock rate.


A programmable logic device so configured, and a method of so configuring a programmable logic device, are also provided.





BRIEF DESCRIPTION OF THE DRAWINGS

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



FIG. 1 is a conceptual representation of a decimation filter;



FIG. 2 is a schematic representation of a multi-channel semi-parallel FIR filter can function as a decimation filter, with overclocking;



FIG. 3 is a schematic representation of a non-symmetric decimation filter implemented in accordance with a preferred embodiment of the present invention;



FIG. 4 shows a preferred embodiment of a data loading schedule, and corresponding coefficients, for a generic decimation filter with twelve taps and a decimation factor of two, of which the filter in FIG. 3 is an example;



FIG. 5 shows a preferred embodiment of a read/write sequence for the data and coefficient memories in the filter of FIG. 3;



FIG. 6 is a schematic representation of an even-symmetric decimation filter implemented in accordance with a preferred embodiment of the present invention;



FIGS. 7A, 7B and 7C (hereinafter collectively referred to as FIG. 7) show a preferred embodiment of a read/write sequence for the data and coefficient memories in the filter of FIG. 6;



FIG. 8 is a schematic representation of an odd-symmetric decimation filter implemented in accordance with a preferred embodiment of the present invention;



FIGS. 9A, 9B and 9C (hereinafter collectively referred to as FIG. 9) show a preferred embodiment of a read/write sequence for the data and coefficient memories in the filter of FIG. 8;



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



FIG. 11 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. 12 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

A FIR filter calculates a weighted sum of a finite number of inputs, summing a number of multiplication results, where each multiplication is between a sample and a coefficient. Each such multiplication may be referred to as a “tap.” Mathematically, a FIR filter may be described as:







Y
k

=




i
=
0


Taps
-
1





c
i

·

s

k
-
i








where Yk is the kth output term, ci is the ith coefficient, Sk-i is the (k-i)th input sample, and Taps is the number of taps or length of the filter.


Decimation filters are used when a signal is resampled at a lower rate. When a high-frequency filter is sampled at a lower rate, data is lost. The higher frequency components may fold back into the signal, so low-pass filtering is needed to prevent distortion of the signal. A generic decimation filter structure 10 is shown in FIG. 1. In this case, the filter preferably is like a multi-channel semi-parallel filter 100 as shown in FIG. 2, with all of the phases being accumulated together. The input is at LF Hz and the output is at F Hz—i.e., the overclocking is on the input side.


In accordance with the present invention, data samples and coefficients preferably are stored in RAM, which is relatively plentiful on programmable logic devices, so that a decimation filter can be run at the same rate as the input data samples. Preferably, this is achieved by implementing respective discrete memory blocks for storage of data and coefficients for each respective multiplier in the filter design. The order in which each new input sample data is written into its respective memory block preferably is based on the symmetry structure (i.e., no symmetry, even symmetry or odd symmetry). The read address logic preferably is a simple incremental pointer which preferably mimics shift register behavior. Similarly, the order of the read address preferably is modified according to the symmetry structure. Preferably, the read/write address generator may implemented in programmable logic of the programmable logic device.


Using a 12-tap decimate-by-2 filter as an example, the filter coefficients are: C1, C2, C3, . . . , C11, C12. With a decimation ratio of 2, every other output sample is discarded. Hence, it decreases the output sample rate by a factor of 2. FIG. 3 is a block diagram of a non-symmetric decimation filter 30 implemented using memory buffers 31, 32 for both data and coefficient storage. For a decimate-by-2 filter, the output sample rate is reduced by a factor of 2, where each filter output can be calculated in 2 clock cycles. Hence, the number of multipliers 33 can be reduced using the time-domain multiplexing (TDM) technique. In this case, the number of multipliers 33 is 6=L/R, where L is the full length of the filter and R is the decimation ratio. Each data buffer 31 preferably has a depth equivalent to R. Each coefficient buffer 32 preferably stores all the coefficients—i.e., it has a depth equivalent to L.


The table of FIG. 4 shows the data loading schedule into the tap delay line for a 12-tap decimate-by-2 filter, of which filter 30 is one example, and the corresponding coefficient that each data sample is being multiplied with at each clock cycle. The numbers in each cell of the table refer to the nth input data sample feeding into the filter as the data is shifted in from the right.


In this example, it is possible to decompose the filter into two phases, with 6 taps each, and calculate each output in 2 clock cycles. Coupled with the time-domain multiplexing (TDM) approach, only six multipliers are required. In accordance with the present invention, the filter can run at the input sample rate, storing the data in, e.g., memory blocks 31 in the example of FIG. 3.


The table in FIG. 5 shows a preferred write and read sequence from memory buffers, such as the six data memory buffers 31, storing data and the output from each coefficient buffer, such as coefficient buffers 32, for a non-symmetric filter structure. The data write address generation preferably uses a round robin schedule targeting all six data memory buffers. The data read address generation (shown by the various shading patterns, which correspond to the various multipliers) preferably is identical across all the data memory buffers 31. The coefficients preferably are rotated to accommodate the shifts in each clock cycle. In the drawing, different shading signifies a different one of multipliers 33.


In a case of even symmetry, continuing to use the example of a 12-tap decimate-by-2 filter, the coefficients are centered around C6 and C7:


C1=C12, C2=C11, C3=C10, C4=C9, C5=C8, C6=C7



FIG. 6 is a block diagram of an even-symmetric decimation filter 60 implemented using memory buffers 61, 62 for both data and coefficient storage. With even filter symmetry, the input data may be pre-added at 63 prior to the multiplier stage 64. This reduces the number of multipliers 640 by half. For a decimate-by-2 filter, the output sample rate also is reduced by a factor of 2, where each filter output can be calculated in two clock cycles. Hence, the number of multipliers 640 can be reduced further using time-domain multiplexing. The total number of multipliers 640 is L/(2R), where L is the filter length, and R is the decimation ratio. Preferably, all data buffers 61 have the same content and each data buffer 61 has a depth equivalent to L, the full length of the filter, while each coefficient buffer 62 stores R coefficients.


The table in FIG. 7 shows the write and read sequence from the six memory buffers 61 storing data and the output from each coefficient buffer 62 for an even-symmetric filter structure 60. The data write address generation preferably is shared across all the data memory buffers 61 and the content of all data buffers 61 preferably is identical as discussed above. The data read address generation (shown by the shaded blocks) preferably has two distinct sequences—ascending order (with offset) for the first half of data buffers 61, and pseudo-descending order (with offset) for the second half of the data buffers 61. The coefficients preferably are read in a round-robin fashion. In the drawing, different shading signifies a different one of multipliers 640.


In a case of odd symmetry, continuing to use the example of a 12-tap decimate-by-2 filter, the coefficients are centered on C6:


C1=C11, C2=C10, C3=C9, C4=C8, C5=C7



FIG. 8 is a block diagram of an odd-symmetric decimation filter 80 implemented using memory buffers 81, 82 for both data and coefficient storage. With odd filter symmetry, the input data is pre-added at 83 prior to the multiplier stage 84. The exception is with the data sample associated with the center tap. The multiplexer 85 associated with data buffer 810 allows bypassing of pre-adder stage 83 for the center tap. The select line for multiplexer 85 is made active every other cycle to coincide with the middle tap corresponding to C6. With even filter symmetry, this reduces the number of multipliers 840 by half. For the decimate-by-2 filter, the output sample rate also is reduced by a factor of 2, where each filter output can be calculated in two clock cycles. Hence, the number of multipliers can be reduced further using TDM. The total number of multipliers 840 is L/(2R), where L is the filter length, and R is the decimation ratio. Preferably, all data buffers 81 have the same content and each data buffer 81 preferably has a depth equivalent to L, the full length of the filter. Each coefficient buffer 82 preferably stores R coefficients.


The table in FIG. 9 shows the write and read sequence from the six memory buffers 81 storing data and the output from each coefficient buffer 82 for an odd-symmetric filter structure 80. The data write address generation preferably is shared across all the data memory buffers 81 and the content of the data buffers preferably is identical as discussed above. The data read address generation (shown in the shaded blocks) preferably has two distinct sequences—ascending order (with offset) for the first half of data buffers 81, and a pseudo-descending order (with offset) for the second half of data buffers 81. The coefficients preferably are read in a round-robin fashion. In the drawing, different shading signifies a different one of multipliers 840.


The foregoing examples of decimation filters having particular lengths, symmetry and decimation ratios are illustrative only. The present invention allows the use of memory blocks as data storage and coefficient storage for decimation filters, while maintaining the filter sample rate to be equal to the input sample rate. Filters implemented in accordance with the present invention do not require overclocking. With high input sample rates—e.g., over 200 MHz for a decimation filter used in digital down-converters in digital receivers, current technology does not allow devices to run at three times the input rate. Therefore, such filters might not be able to be implemented without the present invention. Even for filters with input sample rates below about 100 MHz, where the required overclocking may be possible, the requirement for overclocking may impose additional constraints on the overall design. The present invention overcomes these difficulties by making better utilization of abundant memory blocks provided on many programmable logic devices.


A PLD 280 incorporating such circuitry according to the present invention may be used in many kinds of electronic devices. One possible use is in a data processing system 900 shown in FIG. 10. Data processing system 900 may include one or more of the following components: a processor 281; memory 282; I/O circuitry 283; and peripheral devices 284. These components are coupled together by a system bus 285 and are populated on a circuit board 286 which is contained in an end-user system 287.


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 280 can be used to perform a variety of different logic functions. For example, PLD 280 can be configured as a processor or controller that works in cooperation with processor 281. PLD 280 may also be used as an arbiter for arbitrating access to a shared resources in system 900. In yet another example, PLD 280 can be configured as an interface between processor 281 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 280 as described above and incorporating 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 available from Altera Corporation, of San Jose, Calif.



FIG. 11 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, in accordance with the invention.



FIG. 12 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. For example, the various elements of this invention can be provided on a PLD in any desired number and/or arrangement, or on any other type of integrated circuit device with embedded memory. One skilled in the art will appreciate that the present invention can be practiced by other than the described embodiments, which are presented for purposes of illustration and not of limitation, and the present invention is limited only by the claims that follow.

Claims
  • 1. A FIR filter structure for operating in decimation filter mode; said FIR filter structure comprising: a first number of multipliers each corresponding to one or more taps of said FIR filter structure, each of said multipliers having first and second multiplicand inputs;a second number of coefficient memories, each respective one of said coefficient memories being connected to said first multiplicand input of a respective one of said multipliers, and having capacity to store a third number of coefficients; anda fourth number of data sample memories, each respective one of said data sample memories being connected to said second multiplicand input of a respective one of said multipliers, and having capacity to store a fifth number of data samples; wherein:all of said multipliers, said coefficient memories, and said data sample memories operate at a single clock rate.
  • 2. The FIR filter structure of claim 1 wherein: said FIR filter structure is implemented in an integrated circuit comprising at least one block of user-configurable random access memory; andsaid coefficient memories and said data sample memories are implemented in said at least one block of user-configurable random access memory.
  • 3. The FIR filter structure of claim 2 wherein said integrated circuit comprises a programmable logic device.
  • 4. The FIR filter structure of claim 1 wherein: said FIR filter structure operates in a non-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to one tap of said FIR filter structure;said first number is equal to a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said length;said fourth number is equal to said first number; andsaid fifth number is equal to said decimation factor.
  • 5. The FIR filter structure of claim 1 wherein: said FIR filter structure operates in an even-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to two taps of said FIR filter structure;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 6. The FIR filter structure of claim 1 wherein: said FIR filter structure operates in an odd-symmetric decimation filter mode having a length and a decimation factor;said FIR filter structure further comprises a multiplexer between one of said data sample memories and one of said multipliers, whereby a zero input can be selected for said one of said multipliers;each of said multipliers, except for said one of said multipliers, corresponds to two taps of said FIR filter structure, and said one of said multipliers corresponds to one tap of said FIR filter structure;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 7. An integrated circuit device configured as a FIR filter for operating in one of decimation filter mode, said integrated circuit device having a plurality of multipliers and at least one user-configurable block of random access memory and comprising: a first number of multipliers each corresponding to one or more taps of said FIR filter, each of said multipliers having first and second multiplicand inputs;a second number of coefficient memories configured from said at least one user-configurable block of random access memory, each respective one of said coefficient memories being connected to said first multiplicand input of a respective one of said multipliers, and having capacity to store a third number of coefficients; anda fourth number of data sample memories configured from said at least one user-configurable block of random access memory, each respective one of said data sample memories being connected to said second multiplicand input of a respective one of said multipliers, and having capacity to store a fifth number of data samples; wherein:all of said multipliers, said coefficient memories, and said data sample memories operate at a single clock rate.
  • 8. The integrated circuit device of claim 7 wherein: said FIR filter operates in a non-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to one tap of said FIR filter;said first number is equal to a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said length;said fourth number is equal to said first number; andsaid fifth number is equal to said decimation factor.
  • 9. The integrated circuit device of claim 7 wherein: said FIR filter operates in an even-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to two taps of said FIR filter;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 10. The integrated circuit device of claim 7 wherein: said FIR filter operates in an odd-symmetric decimation filter mode having a length and a decimation factor;said FIR filter further comprises a multiplexer between one of said data sample memories and one of said multipliers, whereby a zero input can be selected for said one of said multipliers;each of said multipliers, except for said one of said multipliers, corresponds to two taps of said FIR filter, and said one of said multipliers corresponds to one tap of said FIR filter;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 11. The integrated circuit device of claim 7, wherein said integrated circuit device comprises a programmable logic device.
  • 12. A method of programmably configuring an integrated circuit device as a FIR filter for operating in decimation filter mode, said integrated circuit device having a plurality of multipliers and at least one user-configurable block of random access memory, said method comprising: programmably configuring a first number of multipliers to each correspond to one or more taps of said FIR filter, each of said multipliers having first and second multiplicand inputs;programmably configuring a second number of coefficient memories from said at least one user-configurable block of random access memory, each respective one of said coefficient memories being connected to said first multiplicand input of a respective one of said multipliers, and having capacity to store a third number of coefficients;programmably configuring a fourth number of data sample memories from said at least one user-configurable block of random access memory, each respective one of said data sample memories being connected to said second multiplicand input of a respective one of said multipliers, and having capacity to store a fifth number of data samples; andprogrammably configuring data read patterns for reading said data samples and said coefficients from said at least one user-configurable random access memory in an order corresponding to shifting of said data samples and said coefficients through said FIR filter.
  • 13. The method of claim 12 wherein: said integrated circuit device is configured as a FIR filter that operates in a non-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to one tap of said FIR filter;said first number is equal to a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said length;said fourth number is equal to said first number; andsaid fifth number is equal to said decimation factor.
  • 14. The method of claim 12 wherein: said integrated circuit device is configured as a FIR filter structure that operates in an even-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to two taps of said FIR filter;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 15. The method of claim 12 wherein: said integrated circuit device is configured as a FIR filter that operates in an odd-symmetric decimation filter mode having a length and a decimation factor;said method further comprises configuring a multiplexer between one of said data sample memories and one of said multipliers, whereby a zero input can be selected for said one of said multipliers;each of said multipliers, except for said one of said multipliers, corresponds to two taps of said FIR filter, and said one of said multipliers corresponds to one tap of said FIR filter;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 16. A data storage medium encoded with machine-executable instructions for performing a method of programmably configuring an integrated circuit device as a FIR filter for operating in decimation filter mode, said integrated circuit device having a plurality of multipliers and at least one user-configurable block of random access memory, said method comprising: programmably configuring a first number of multipliers to each correspond to one or more taps of said FIR filter, each of said multipliers having first and second multiplicand inputs;programmably configuring a second number of coefficient memories from said at least one user-configurable block of random access memory, each respective one of said coefficient memories being connected to said first multiplicand input of a respective one of said multipliers, and having capacity to store a third number of coefficients;programmably configuring a fourth number of data sample memories from said at least one user-configurable block of random access memory, each respective one of said data sample memories being connected to said second multiplicand input of a respective one of said multipliers, and having capacity to store a fifth number of data samples; andprogrammably configuring data read patterns for reading said data samples and said coefficients from said at least one user-configurable random access memory in an order corresponding to shifting of said data samples and said coefficients through said FIR filter.
  • 17. The data storage medium of claim 16 wherein said instructions for said programmably configuring said FIR filter comprise instructions for programmably configuring said FIR filter such that: said integrated circuit device is configured as a FIR filter that operates in a non-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to one tap of said FIR filter;said first number is equal to a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said length;said fourth number is equal to said first number; andsaid fifth number is equal to said decimation factor.
  • 18. The data storage medium of claim 16 wherein said instructions for said programmably configuring said integrated circuit device as a FIR filter comprise instructions for programmably configuring said FIR filter such that: said integrated circuit device is configured as a FIR filter that operates in an even-symmetric decimation filter mode having a length and a decimation factor;each of said multipliers corresponds to two taps of said FIR filter;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
  • 19. The data storage medium of claim 16 wherein said instructions for said programmably configuring said integrated circuit device as a FIR filter comprise instructions for programmably configuring said FIR filter such that: said integrated circuit device is configured as a FIR filter that operates in an odd-symmetric decimation filter mode having a length and a decimation factor;said FIR filter further comprises a multiplexer between one of said data sample memories and one of said multipliers, whereby a zero input can be selected for said one of said multipliers;each of said multipliers, except for said one of said multipliers, corresponds to two taps of said FIR filter, and said one of said multipliers corresponds to one tap of said FIR filter;said first number is equal to one-half a quotient of said length and said decimation factor;said second number is equal to said first number;said third number is equal to said decimation factor;said fourth number is equal to twice said first number; andsaid fifth number is equal to said length.
US Referenced Citations (304)
Number Name Date Kind
3473160 Wahlstrom Oct 1969 A
4156927 McElroy et al. May 1979 A
4179746 Tubbs Dec 1979 A
4212076 Conners Jul 1980 A
4215406 Gomola et al. Jul 1980 A
4215407 Gomola et al. Jul 1980 A
4422155 Amir et al. Dec 1983 A
4484259 Palmer et al. Nov 1984 A
4521907 Amir et al. Jun 1985 A
4575812 Kloker et al. Mar 1986 A
4597053 Chamberlin Jun 1986 A
4623961 Mackiewicz Nov 1986 A
4682302 Williams Jul 1987 A
4718057 Venkitakrishnan et al. Jan 1988 A
4727508 Williams Feb 1988 A
4791590 Ku et al. Dec 1988 A
4799004 Mori Jan 1989 A
4823295 Mader Apr 1989 A
4839847 Laprade Jun 1989 A
4871930 Wong et al. Oct 1989 A
4912345 Steele et al. Mar 1990 A
4918637 Morton Apr 1990 A
4967160 Quievy et al. Oct 1990 A
4982354 Takeuchi et al. Jan 1991 A
4991010 Hailey et al. Feb 1991 A
4994997 Martin et al. Feb 1991 A
5073863 Zhang Dec 1991 A
5081604 Tanaka Jan 1992 A
5122685 Chan et al. Jun 1992 A
5128559 Steele Jul 1992 A
5175702 Beraud et al. Dec 1992 A
5208491 Ebeling et al. May 1993 A
RE34363 Freeman Aug 1993 E
5267187 Hsieh et al. Nov 1993 A
5296759 Sutherland et al. Mar 1994 A
5338983 Agarwala Aug 1994 A
5339263 White Aug 1994 A
5349250 New Sep 1994 A
5357152 Jennings, III et al. Oct 1994 A
5371422 Patel et al. Dec 1994 A
5381357 Wedgwood et al. Jan 1995 A
5404324 Colon-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
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
5777912 Leung et al. Jul 1998 A
5784636 Rupp Jul 1998 A
5790446 Yu et al. Aug 1998 A
5794067 Kadowaki Aug 1998 A
5801546 Pierce et al. Sep 1998 A
5805477 Perner Sep 1998 A
5805913 Guttag et al. Sep 1998 A
5808926 Gorshtein et al. Sep 1998 A
5812479 Cliff et al. Sep 1998 A
5812562 Baeg Sep 1998 A
5815422 Dockser Sep 1998 A
5821776 McGowan Oct 1998 A
5825202 Tavana et al. Oct 1998 A
5838165 Chatter Nov 1998 A
5841684 Dockser Nov 1998 A
5847579 Trimberger Dec 1998 A
5847981 Kelley et al. Dec 1998 A
5859878 Phillips et al. Jan 1999 A
5869979 Bocchino Feb 1999 A
5872380 Rostoker et al. Feb 1999 A
5874834 New Feb 1999 A
5878250 LeBlanc Mar 1999 A
5880981 Kojima et al. Mar 1999 A
5892962 Cloutier Apr 1999 A
5894228 Reddy et al. Apr 1999 A
5898602 Rothman et al. Apr 1999 A
5931898 Khoury Aug 1999 A
5942914 Reddy et al. Aug 1999 A
5944774 Dent Aug 1999 A
5949710 Pass et al. Sep 1999 A
5951673 Miyata Sep 1999 A
5956265 Lewis Sep 1999 A
5959871 Pierzchala et al. Sep 1999 A
5960193 Guttag et al. Sep 1999 A
5961635 Guttag et al. Oct 1999 A
5963048 Harrison et al. Oct 1999 A
5963050 Young et al. Oct 1999 A
5968196 Ramamurthy et al. Oct 1999 A
5970254 Cooke et al. Oct 1999 A
5978260 Trimberger et al. Nov 1999 A
5982195 Cliff et al. Nov 1999 A
5986465 Mendel Nov 1999 A
5991788 Mintzer Nov 1999 A
5991898 Rajski et al. Nov 1999 A
5995748 Guttag et al. Nov 1999 A
5999015 Cliff et al. Dec 1999 A
5999990 Sharrit et al. Dec 1999 A
6005806 Madurawe et al. Dec 1999 A
6006321 Abbott Dec 1999 A
6009451 Burns Dec 1999 A
6018755 Gonikberg et al. Jan 2000 A
6020759 Heile Feb 2000 A
6021423 Nag et al. Feb 2000 A
6029187 Verbauwhede Feb 2000 A
6031763 Sansbury Feb 2000 A
6041339 Yu et al. Mar 2000 A
6041340 Mintzer Mar 2000 A
6052327 Reddy et al. Apr 2000 A
6052755 Terrill et al. Apr 2000 A
6055555 Boswell et al. Apr 2000 A
6064614 Khoury May 2000 A
6065131 Andrews et al. May 2000 A
6066960 Pedersen May 2000 A
6069487 Lane et al. May 2000 A
6072994 Phillips et al. Jun 2000 A
6073154 Dick Jun 2000 A
6075381 LaBerge Jun 2000 A
6084429 Trimberger Jul 2000 A
6085317 Smith Jul 2000 A
6091261 DeLange Jul 2000 A
6091765 Pietzold, III et al. Jul 2000 A
6094726 Gonion et al. Jul 2000 A
6097988 Tobias Aug 2000 A
6098163 Guttag et al. Aug 2000 A
6107820 Jefferson et al. Aug 2000 A
6107821 Kelem et al. Aug 2000 A
6107824 Reddy et al. Aug 2000 A
6130554 Kolze et al. Oct 2000 A
6140839 Kaviani et al. Oct 2000 A
6144980 Oberman Nov 2000 A
6154049 New Nov 2000 A
6157210 Zaveri et al. Dec 2000 A
6163788 Chen et al. Dec 2000 A
6167415 Fischer et al. Dec 2000 A
6175849 Smith Jan 2001 B1
6215326 Jefferson et al. Apr 2001 B1
6226735 Mirsky May 2001 B1
6242947 Trimberger Jun 2001 B1
6243729 Staszewski Jun 2001 B1
6246258 Lesea Jun 2001 B1
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
6531888 Abbott Mar 2003 B2
6538470 Langhammer et al. Mar 2003 B1
6542000 Black et al. Apr 2003 B1
6556044 Langhammer et al. Apr 2003 B2
6557092 Callen Apr 2003 B1
6571268 Giacalone et al. May 2003 B1
6573749 New et al. Jun 2003 B2
6574762 Karimi et al. Jun 2003 B1
6591283 Conway et al. Jul 2003 B1
6591357 Mirsky Jul 2003 B2
6600495 Boland et al. Jul 2003 B1
6600788 Dick et al. Jul 2003 B1
6628140 Langhammer et al. Sep 2003 B2
6687722 Larsson et al. Feb 2004 B1
6692534 Wang et al. Feb 2004 B1
6700581 Baldwin et al. Mar 2004 B2
6725441 Keller et al. Apr 2004 B1
6728901 Rajski et al. Apr 2004 B1
6731133 Feng et al. May 2004 B1
6732134 Rosenberg May 2004 B1
6744278 Liu et al. Jun 2004 B1
6745254 Boggs et al. Jun 2004 B2
6763367 Kwon et al. Jul 2004 B2
6771094 Langhammer et al. Aug 2004 B1
6774669 Liu et al. Aug 2004 B1
6781408 Langhammer Aug 2004 B1
6781410 Pani et al. Aug 2004 B2
6788104 Singh et al. Sep 2004 B2
6801924 Green et al. Oct 2004 B1
6836839 Master et al. Dec 2004 B2
6874079 Hogenauer Mar 2005 B2
6889238 Johnson May 2005 B2
6904471 Boggs et al. Jun 2005 B2
6924663 Masui et al. Aug 2005 B2
6963890 Dutta et al. Nov 2005 B2
6971083 Farrugia et al. Nov 2005 B1
6978287 Langhammer Dec 2005 B1
7020673 Ozawa Mar 2006 B2
7093204 Oktem et al. Aug 2006 B2
7107305 Deng et al. Sep 2006 B2
7113969 Green et al. Sep 2006 B1
7181484 Stribaek et al. Feb 2007 B2
7313585 Winterrowd Dec 2007 B2
7395298 Debes et al. Jul 2008 B2
7409417 Lou Aug 2008 B2
7415542 Hennedy et al. Aug 2008 B2
7421465 Rarick et al. Sep 2008 B1
7428566 Siu et al. Sep 2008 B2
7430578 Debes et al. Sep 2008 B2
7430656 Sperber et al. Sep 2008 B2
7472155 Simkins et al. Dec 2008 B2
7536430 Guevokian et al. May 2009 B2
7590676 Langhammer Sep 2009 B1
7646430 Brown Elliott et al. Jan 2010 B2
7668896 Lutz et al. Feb 2010 B2
7719446 Rosenthal et al. May 2010 B2
7814137 Mauer Oct 2010 B1
7822799 Langhammer et al. Oct 2010 B1
7836117 Langhammer et al. Nov 2010 B1
7865541 Langhammer Jan 2011 B1
20010023425 Oberman et al. Sep 2001 A1
20010029515 Mirsky Oct 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
20040148321 Guevorkian et al. Jul 2004 A1
20040172439 Lin Sep 2004 A1
20040178818 Crotty et al. Sep 2004 A1
20040193981 Clark et al. Sep 2004 A1
20040267863 Bhushan et al. Dec 2004 A1
20050038842 Stoye Feb 2005 A1
20050144212 Simkins et al. Jun 2005 A1
20050144215 Simkins et al. Jun 2005 A1
20050144216 Simkins et al. Jun 2005 A1
20050166038 Wang et al. Jul 2005 A1
20050187997 Zheng et al. Aug 2005 A1
20050187999 Zheng et al. Aug 2005 A1
20060020655 Lin Jan 2006 A1
20070185951 Lee et al. Aug 2007 A1
20070185952 Langhammer et al. Aug 2007 A1
20070241773 Hutchings et al. Oct 2007 A1
20080133627 Langhammer et al. Jun 2008 A1
20090187615 Abe et al. Jul 2009 A1
Foreign Referenced Citations (35)
Number Date Country
0 158 430 Oct 1985 EP
0 380 456 Aug 1990 EP
0 411 491 Feb 1991 EP
0 461 798 Dec 1991 EP
0 498 066 Aug 1992 EP
0 555 092 Aug 1993 EP
0 606 653 Jul 1994 EP
0 657 803 Jun 1995 EP
0 660 227 Jun 1995 EP
0 668 659 Aug 1995 EP
0 905 906 Mar 1999 EP
0 909 028 Apr 1999 EP
0 927 393 Jul 1999 EP
0 992 885 Apr 2000 EP
1 031 934 Aug 2000 EP
1 058 185 Dec 2000 EP
1 220 108 Jul 2002 EP
2 283 602 May 1995 GB
2 286 737 Aug 1995 GB
2 318 198 Apr 1998 GB
61-237133 Oct 1986 JP
7-135447 May 1995 JP
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
WO2005-101190 Oct 2005 WO