US20090168932A1 - Multiple stream multiple rate resampling component - Google Patents
Multiple stream multiple rate resampling component Download PDFInfo
- Publication number
- US20090168932A1 US20090168932A1 US11/966,590 US96659007A US2009168932A1 US 20090168932 A1 US20090168932 A1 US 20090168932A1 US 96659007 A US96659007 A US 96659007A US 2009168932 A1 US2009168932 A1 US 2009168932A1
- Authority
- US
- United States
- Prior art keywords
- subset
- value
- intermediate results
- generate
- samples
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/05—Electric or magnetic storage of signals before transmitting or retransmitting for changing the transmission rate
Definitions
- the present invention relates to digital resampling. More particularly, embodiments of the invention involve a method and apparatus for concurrently resampling multiple digital signal streams representing multiple signal rates through a single filter path.
- Digital resampling involves converting a first series of values representing a digital signal sampled at a first rate to a second series of values representing the same digital signal sampled at a second rate. Resampling to a lower sample rate is referred to as down sampling or decimation. Decimation may be performed by filtering the original signal using a digital filter implemented in either software or hardware. Implementing such filters requires a relatively large amount of circuit resources. Implementing a digital filter in software, for example, requires a computer processor, and implementing a digital filter in hardware requires a series of arithmetic components, such as adders and multipliers.
- Multiple channel resampling involves concurrently resampling more than one digital signal, and may require use of two or more different filters.
- Multiple rate resampling has been addressed using, for example, multiple filter paths and a switch for directing each of various signals to a particular filter path.
- This approach requires an additional set of resources (filter path) for each resampling filter.
- each filter path may involve pipe-lining signal samples through a series of multipliers and adders, requiring a separate set of multipliers and adders for each signal stream to be processed.
- filters such as finite impulse response filters of eight weights or more
- such an approach can require the use of a large number of resources, particularly if multiple resampling filters are used.
- the present invention provide an improved system and method for resampling digital signals that does not suffer from the limitations of the prior art.
- embodiments of the invention provide a method of resampling a digital signal involving serially receiving a plurality of samples of the digital signal, applying a plurality of filter coefficients to a first subset of the plurality of samples to generate a first plurality of intermediate results, and applying the plurality of filter coefficients to a second subset of the plurality of samples to generate a second plurality of intermediate results.
- the second subset includes at least one sample from the first subset and at least one sample not present in the first subset.
- the first plurality of intermediate results are accumulated to generate a first resampled value, wherein the first plurality of intermediate results is accumulated by sequentially combining each intermediate result with a first accumulation value.
- the second plurality of intermediate results is accumulated to generate a second resampled value, wherein the second plurality of intermediate results is accumulated by sequentially combining each intermediate result with a second accumulation value.
- FIG. 1 is a block diagram of an exemplary system for resampling a digital signal according to principles of the present invention
- FIG. 2 is a block diagram of certain functions of an exemplary circuit of the system of FIG. 1 according to a first implementation operable to resample a single channel;
- FIG. 3 is a flow diagram illustrating certain steps performed in a process of resampling a digital signal using the circuit of FIG. 2 ;
- FIG. 4 is a block diagram of certain functions of an exemplary circuit of the system of FIG. 1 according to a second implementation operable to concurrently resample multiple channels.
- FIG. 1 A system embodying principles of the present technology is illustrated in FIG. 1 and designated generally by the reference numeral 10 .
- the system 10 includes a data input 12 , a data output 14 , and a circuit 16 generally including a controller 18 and a memory 20 .
- the data input 12 and the data output 14 are illustrated as generalized inputs and outputs and may include various types and sizes of inputs and outputs, respectively.
- the circuit 16 may be fixed, such as an application specific integrated circuit, a digital signal processing (DSP) chip or a dedicated finite impulse response (FIR) filter chip; or may be programmable, such as a field programmable gate array (FPGA) or a complex programmable logic device (CPLD).
- DSP digital signal processing
- FIR finite impulse response
- FPGA field programmable gate array
- CPLD complex programmable logic device
- the system 10 is operable to decimate (down sample) an input signal by a predetermined decimation factor by filtering the input signal applying, for example, a finite impulse response (FIR) filter represented by equation (1), as follows:
- FIR finite impulse response
- M is the number of filter coefficients (taps)
- D is the decimation factor
- C m is a filter coefficient
- the value M/D may be an integer.
- Each row of Table 1 corresponds to a successive time when a new output Y is generated.
- Each input value X is multiplied by a corresponding coefficient C at the top of the column to form an intermediate value, and all intermediate values in each row are added to form the corresponding output Y depicted at the far right side of the row.
- the decimation factor D is two in the exemplary application illustrated in Table 1, a new output value Y is generated for each pair of new input values X received.
- equation (1) represents a FIR filter, each output Y is generated based solely on current and past input values X Furthermore, equation (1) may be solved in an iterative fashion, wherein only a most recent X value and one or more running, cumulative Y values need to be retained at any given time.
- a first exemplary circuit 22 of the system 10 operable to resample a signal is depicted in FIG. 2 .
- the input 12 and a first memory element 24 are connected to a multiplier 26 .
- An output of the multiplier 26 and the output of a second memory element 28 are connected to an adder 30 .
- the output of the second memory element 28 is also connected to the data output 14 .
- the circuit 22 may further include control logic (not shown) for enabling the various elements of the circuit 22 to filter an input signal according to, for example, equation (1).
- FIG. 2 illustrates various exemplary functional blocks and that the functions depicted in the circuit 22 may be implemented using any of various different electrical and/or electronic circuits.
- the first memory element 24 may be a read-only memory (ROM) module containing a plurality of filter coefficients stored according to a predetermined coefficient order
- the second memory element 28 may be a random access memory (RAM) module with a depth of M/D.
- the first memory element 24 and the second memory element 28 may be part of a single block of RAM elements.
- FIG. 3 A flow diagram illustrating exemplary steps performed by the circuit 22 is shown in FIG. 3 .
- the system 10 is initialized, wherein a decimation offset variable dec_offset is initialized to a value D ⁇ 1 and an output number variable output_num is initialized to zero. Furthermore, a number M of pre-determined filter coefficients are placed in the first memory element 24 .
- a new X value (X(p)) is first received at the input 12 , as depicted in block 32 .
- the variable coef_offset is set equal to the variable dec_offset and a variable store_indx is set equal to the variable output_num, as depicted in block 34 .
- a next Y value is updated by adding the current Y value to the product of the current input sample X(p) and a coefficient corresponding to the variable coef_offset, as depicted in block 36 .
- the variable coef_offset is incremented by an amount equal to D, as depicted in block 38 , because not every coefficient value stored in the first memory element 24 is used, as can be seen in Table 1.
- the variable coef_offset is set to zero in block 38 .
- variable stor_indx is tested to determine whether it is equal to the variable output_num ⁇ 1, as depicted in block 40 . If the variable stor_indx is not equal to output_num ⁇ 1, not all Y values have been updated in the second memory module 28 . The variable stor_indx is then incremented by one, as depicted in block 42 , to indicate the next Y value to be updated in the second memory element 28 . The variable stor_indx is then tested to determine whether it is equal to M/D, as depicted in block 44 . If the variable store_indx is not equal to M/D, the process flow returns to block 36 . If the variable store_indx is equal to output_num ⁇ 1, it is set equal to zero, as depicted in block 46 , and the process flow returns to block 36 .
- variable stor_indx is equal to output_num ⁇ 1, all eligible Y values have been updated to reflect the new X value. If the second memory module 28 includes exactly M/D storage locations, the second memory module 28 will also be full of updated Y values when stor_indx is equal to output_num ⁇ 1.
- dec_offset is tested to determine whether it is equal to zero, as depicted in block 48 . If not, dec_offset is decremented by one, as depicted in block 50 , the variable output_valid is set equal to False, as depicted in block 52 , and the system waits for the next X value.
- dec_offset is found to be equal to zero in block 48 , one of the Y values in the second memory element 28 is communicated to an output decimation_output, such as output 14 , as depicted in block 54 .
- the memory location storing the Y value communicated to the decimation_output is set to zero, as depicted in block 56 , in preparation for the next accumulation steps.
- the variable output_valid is set to true, as depicted in block 58 .
- variable output_num The particular Y value that is communicated to the output 14 and reset to zero is determined by the variable output_num, which is incremented (or reset to zero to wrap around to a first storage location of the second memory module 28 if an end of the memory module 28 is reached) each time a Y value is communicated to the output 14 . Therefore, after a Y value is communicated to decimation_output, output_num is tested to determine whether it is equal to M/D ⁇ 1, as depicted in block 60 . If output_num is equal to M/D ⁇ 1, it is reset to zero, as depicted in block 62 . If output_num is not equal to M/D ⁇ 1, it is incremented, as depicted in block 64 .
- variable dec_offset is set equal to D ⁇ 1, as depicted in block 66 , and the system waits for the next X value.
- the process represented in FIG. 3 uses only a most recent X value to update a plurality of running Y values and does not store previous X values.
- the most recent X value may be discarded after it is multiplied by each of the relevant coefficients.
- “discarding” a value means not using or actively retaining the value, and does not mean actively expunging the value from the system 10 . It will be appreciated that the data bits representing a discarded value may persist in one or more elements of the circuit 22 a next value is processed.
- the second memory module 28 can hold exactly M/D Y values, thus minimizing the amount of resources necessary to implement the FIR filter characterized by equation (1), above.
- the circuit 22 is generally capable of filtering a single signal through a single data path.
- a second exemplary circuit 62 of the system 10 operable to resample a signal is depicted in FIG. 4 .
- the circuit 62 of FIG. 4 is similar to the circuit 22 depicted in FIG. 2 , except that the circuit 62 can concurrently process multiple streams of input signal data with a single filter path, as explained below.
- the circuit 68 includes a data input 72 for receiving X values, and a channel select input 70 for identifying a present channel or signal. Both inputs 70 , 72 may correspond to input 12 , described above. If two signals are represented by the input signals X, two sets of filter coefficients may be stored in each of two memory modules 74 , 76 , wherein a first set of filter coefficients is stored in a first memory module 74 and a second set of filter coefficients is stored in a second memory module 76 .
- the channel select input 70 actuates a multiplexer 78 to connect one of the two memory modules 74 , 76 to a multiplier 80 .
- the output of the multiplier 80 is connected to an adder 82 , which receives an output of a second multiplexer 84 which selects an output of third and fourth memory modules 86 , 88 according to the channel select input 70 .
- Each of the third and fourth memory modules 86 , 88 is connected to one of two outputs 90 , 92 . Because two sets of filter coefficients may be available in the circuit 68 , a first filter may be applied to a first signal and a second filter may be applied to a second signal.
- the process illustrated in FIG. 3 may be implemented on each of two signals or input streams in FIG. 4 , wherein a first signal is processed using the first memory element 74 and the third memory element 86 , and a second signal is processed using the second memory element 76 and the fourth memory element 88 .
- the two signals may be time division multiplexed on the input 72 , wherein a signal on the channel select input 70 enables the circuit 68 to concurrently process the two signals by alternatingly processing samples from one signal and then the other signal.
- processing may be performed in multiple stages to further reduce the amount of hardware resources required to perform the resampling.
- a first stage of resampling may be performed by the circuit 22 , for example, wherein the results of the first stage of resampling are stored in memory and communicated back to the circuit 22 for a second stage of resampling.
- two instances of either circuit 22 , 68 may be connected in series.
- Table 2 illustrates an exemplary dual-stage implementation of the present technology.
- the decimation factor D is eight, for example, a first stage is executed with a decimation factor D of four and a second stage is executed with a decimation factor D of two.
- the number of iterations and the minimum size of the memory element holding the Y values remain constant: twenty-one in the first stage and forty-eight in the second stage. It will be appreciated that a relatively small number of resources are required even where the decimation factor is relatively high, such as twenty-five or thirty-two.
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Complex Calculations (AREA)
Abstract
Description
- 1. Field
- The present invention relates to digital resampling. More particularly, embodiments of the invention involve a method and apparatus for concurrently resampling multiple digital signal streams representing multiple signal rates through a single filter path.
- 2. Description of Related Art
- Digital resampling involves converting a first series of values representing a digital signal sampled at a first rate to a second series of values representing the same digital signal sampled at a second rate. Resampling to a lower sample rate is referred to as down sampling or decimation. Decimation may be performed by filtering the original signal using a digital filter implemented in either software or hardware. Implementing such filters requires a relatively large amount of circuit resources. Implementing a digital filter in software, for example, requires a computer processor, and implementing a digital filter in hardware requires a series of arithmetic components, such as adders and multipliers.
- Multiple channel resampling involves concurrently resampling more than one digital signal, and may require use of two or more different filters. Multiple rate resampling has been addressed using, for example, multiple filter paths and a switch for directing each of various signals to a particular filter path. This approach requires an additional set of resources (filter path) for each resampling filter. For example, each filter path may involve pipe-lining signal samples through a series of multipliers and adders, requiring a separate set of multipliers and adders for each signal stream to be processed. For relatively large filters (such as finite impulse response filters of eight weights or more), such an approach can require the use of a large number of resources, particularly if multiple resampling filters are used.
- Accordingly, there is a need for an improved method and apparatus for signal resampling that does not suffer from the limitations of the prior art.
- The present invention provide an improved system and method for resampling digital signals that does not suffer from the limitations of the prior art.
- Particularly, embodiments of the invention provide a method of resampling a digital signal involving serially receiving a plurality of samples of the digital signal, applying a plurality of filter coefficients to a first subset of the plurality of samples to generate a first plurality of intermediate results, and applying the plurality of filter coefficients to a second subset of the plurality of samples to generate a second plurality of intermediate results. The second subset includes at least one sample from the first subset and at least one sample not present in the first subset.
- The first plurality of intermediate results are accumulated to generate a first resampled value, wherein the first plurality of intermediate results is accumulated by sequentially combining each intermediate result with a first accumulation value. The second plurality of intermediate results is accumulated to generate a second resampled value, wherein the second plurality of intermediate results is accumulated by sequentially combining each intermediate result with a second accumulation value.
- This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
- Preferred implementations of the present invention are described in detail below with reference to the attached drawing figures, wherein:
-
FIG. 1 is a block diagram of an exemplary system for resampling a digital signal according to principles of the present invention; -
FIG. 2 is a block diagram of certain functions of an exemplary circuit of the system ofFIG. 1 according to a first implementation operable to resample a single channel; -
FIG. 3 is a flow diagram illustrating certain steps performed in a process of resampling a digital signal using the circuit ofFIG. 2 ; and -
FIG. 4 is a block diagram of certain functions of an exemplary circuit of the system ofFIG. 1 according to a second implementation operable to concurrently resample multiple channels. - The following detailed description of various embodiments of the present invention references the accompanying drawings that illustrate specific embodiments in which the invention can be practiced. The embodiments are intended to describe certain aspects of the invention in sufficient detail to enable those skilled in the art to practice the technology. Other embodiments can be utilized and changes can be made without departing from the scope of the invention. The following detailed description is, therefore, not to be taken in a limiting sense. The scope of the present invention is defined only by the appended claims, along with the full scope of equivalents to which such claims are entitled.
- A system embodying principles of the present technology is illustrated in
FIG. 1 and designated generally by thereference numeral 10. Thesystem 10 includes adata input 12, adata output 14, and acircuit 16 generally including acontroller 18 and amemory 20. Thedata input 12 and thedata output 14 are illustrated as generalized inputs and outputs and may include various types and sizes of inputs and outputs, respectively. Thecircuit 16 may be fixed, such as an application specific integrated circuit, a digital signal processing (DSP) chip or a dedicated finite impulse response (FIR) filter chip; or may be programmable, such as a field programmable gate array (FPGA) or a complex programmable logic device (CPLD). - The
system 10 is operable to decimate (down sample) an input signal by a predetermined decimation factor by filtering the input signal applying, for example, a finite impulse response (FIR) filter represented by equation (1), as follows: -
- where M is the number of filter coefficients (taps), D is the decimation factor, Cm is a filter coefficient, and the value M/D may be an integer. Using equation (1), a new output value Y is generated for every D input values of X The output Y(n) is invalid if D×n is less than M.
- An exemplary application of equation (1), wherein the decimation factor is two (i.e., D=2), is illustrated in Table 1. Each row of Table 1 corresponds to a successive time when a new output Y is generated. Each input value X is multiplied by a corresponding coefficient C at the top of the column to form an intermediate value, and all intermediate values in each row are added to form the corresponding output Y depicted at the far right side of the row. Because the decimation factor D is two in the exemplary application illustrated in Table 1, a new output value Y is generated for each pair of new input values X received. If the decimation factor D is three, a new output value Y is generated upon receipt of three new input values X, if the decimation factor D is four, a new output value Y is generated upon receipt of four new input values, and so forth. Because equation (1) represents a FIR filter, each output Y is generated based solely on current and past input values X Furthermore, equation (1) may be solved in an iterative fashion, wherein only a most recent X value and one or more running, cumulative Y values need to be retained at any given time.
-
TABLE 1 C0 C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 X1 X0 Y0 X3 X2 X1 X0 Y1 X5 X4 X3 X2 X1 X0 Y2 X7 X6 X5 X4 X3 X2 X1 X0 Y3 X9 X8 X7 X6 X5 X4 X3 X2 X1 X0 Y4 X11 X10 X9 X8 X7 X6 X5 X4 X3 X2 X1 X0 Y5 X13 X12 X11 X10 X9 X8 X7 X6 X5 X4 X3 X2 Y6 X15 X14 X13 X12 X11 X10 X9 X8 X7 X6 X5 X4 Y7 X17 X16 X15 X14 X13 X12 X11 X10 X9 X8 X7 X6 Y8 X19 X18 X17 X16 X15 X14 X13 X12 X11 X10 X9 X8 Y9 X21 X20 X19 X18 X17 X16 X15 X14 X13 X12 X11 X10 Y10 X23 X22 X21 X20 X19 X18 X17 X16 X15 X14 X13 X12 Y11 X25 X24 X23 X22 X21 X20 X19 X18 X17 X16 X15 X14 Y12 - A first
exemplary circuit 22 of thesystem 10 operable to resample a signal is depicted inFIG. 2 . Theinput 12 and afirst memory element 24 are connected to amultiplier 26. An output of themultiplier 26 and the output of asecond memory element 28 are connected to anadder 30. The output of thesecond memory element 28 is also connected to thedata output 14. Thecircuit 22 may further include control logic (not shown) for enabling the various elements of thecircuit 22 to filter an input signal according to, for example, equation (1). - It will be appreciated that
FIG. 2 illustrates various exemplary functional blocks and that the functions depicted in thecircuit 22 may be implemented using any of various different electrical and/or electronic circuits. By way of example, thefirst memory element 24 may be a read-only memory (ROM) module containing a plurality of filter coefficients stored according to a predetermined coefficient order, and thesecond memory element 28 may be a random access memory (RAM) module with a depth of M/D. Alternatively, thefirst memory element 24 and thesecond memory element 28 may be part of a single block of RAM elements. - A flow diagram illustrating exemplary steps performed by the
circuit 22 is shown inFIG. 3 . Before the steps illustrated inFIG. 3 are executed, thesystem 10 is initialized, wherein a decimation offset variable dec_offset is initialized to a value D−1 and an output number variable output_num is initialized to zero. Furthermore, a number M of pre-determined filter coefficients are placed in thefirst memory element 24. - In operation, a new X value (X(p)) is first received at the
input 12, as depicted inblock 32. The variable coef_offset is set equal to the variable dec_offset and a variable store_indx is set equal to the variable output_num, as depicted inblock 34. A next Y value is updated by adding the current Y value to the product of the current input sample X(p) and a coefficient corresponding to the variable coef_offset, as depicted inblock 36. The variable coef_offset is incremented by an amount equal to D, as depicted inblock 38, because not every coefficient value stored in thefirst memory element 24 is used, as can be seen in Table 1. Although not illustrated inFIG. 3 , if the variable coef_offset is equal to a maximum, such as twelve, fourteen, sixteen, and so forth, the variable coef_offset is set to zero inblock 38. - The variable stor_indx is tested to determine whether it is equal to the variable output_num−1, as depicted in
block 40. If the variable stor_indx is not equal to output_num−1, not all Y values have been updated in thesecond memory module 28. The variable stor_indx is then incremented by one, as depicted inblock 42, to indicate the next Y value to be updated in thesecond memory element 28. The variable stor_indx is then tested to determine whether it is equal to M/D, as depicted inblock 44. If the variable store_indx is not equal to M/D, the process flow returns to block 36. If the variable store_indx is equal to output_num−1, it is set equal to zero, as depicted inblock 46, and the process flow returns to block 36. - If the variable stor_indx is equal to output_num−1, all eligible Y values have been updated to reflect the new X value. If the
second memory module 28 includes exactly M/D storage locations, thesecond memory module 28 will also be full of updated Y values when stor_indx is equal to output_num−1. The variable dec_offset is tested to determine whether it is equal to zero, as depicted inblock 48. If not, dec_offset is decremented by one, as depicted inblock 50, the variable output_valid is set equal to False, as depicted inblock 52, and the system waits for the next X value. If dec_offset is found to be equal to zero inblock 48, one of the Y values in thesecond memory element 28 is communicated to an output decimation_output, such asoutput 14, as depicted inblock 54. The memory location storing the Y value communicated to the decimation_output is set to zero, as depicted inblock 56, in preparation for the next accumulation steps. The variable output_valid is set to true, as depicted inblock 58. - The particular Y value that is communicated to the
output 14 and reset to zero is determined by the variable output_num, which is incremented (or reset to zero to wrap around to a first storage location of thesecond memory module 28 if an end of thememory module 28 is reached) each time a Y value is communicated to theoutput 14. Therefore, after a Y value is communicated to decimation_output, output_num is tested to determine whether it is equal to M/D− 1, as depicted inblock 60. If output_num is equal to M/D− 1, it is reset to zero, as depicted inblock 62. If output_num is not equal to M/D− 1, it is incremented, as depicted inblock 64. The variable dec_offset is set equal toD− 1, as depicted inblock 66, and the system waits for the next X value. The process represented inFIG. 3 uses only a most recent X value to update a plurality of running Y values and does not store previous X values. - The most recent X value may be discarded after it is multiplied by each of the relevant coefficients. As used herein, “discarding” a value means not using or actively retaining the value, and does not mean actively expunging the value from the
system 10. It will be appreciated that the data bits representing a discarded value may persist in one or more elements of the circuit 22 a next value is processed. - In a particular embodiment, the
second memory module 28 can hold exactly M/D Y values, thus minimizing the amount of resources necessary to implement the FIR filter characterized by equation (1), above. Where D=2 and there are twelve coefficients (C values), for example, MD=6, minimizing the size of thesecond memory module 28. - The
circuit 22 is generally capable of filtering a single signal through a single data path. A secondexemplary circuit 62 of thesystem 10 operable to resample a signal is depicted inFIG. 4 . Thecircuit 62 ofFIG. 4 is similar to thecircuit 22 depicted inFIG. 2 , except that thecircuit 62 can concurrently process multiple streams of input signal data with a single filter path, as explained below. - The
circuit 68 includes adata input 72 for receiving X values, and a channelselect input 70 for identifying a present channel or signal. Bothinputs memory modules first memory module 74 and a second set of filter coefficients is stored in asecond memory module 76. The channelselect input 70 actuates amultiplexer 78 to connect one of the twomemory modules multiplier 80. The output of themultiplier 80 is connected to anadder 82, which receives an output of asecond multiplexer 84 which selects an output of third andfourth memory modules select input 70. Each of the third andfourth memory modules outputs circuit 68, a first filter may be applied to a first signal and a second filter may be applied to a second signal. - The process illustrated in
FIG. 3 may be implemented on each of two signals or input streams inFIG. 4 , wherein a first signal is processed using thefirst memory element 74 and thethird memory element 86, and a second signal is processed using thesecond memory element 76 and thefourth memory element 88. By way of example, the two signals may be time division multiplexed on theinput 72, wherein a signal on the channelselect input 70 enables thecircuit 68 to concurrently process the two signals by alternatingly processing samples from one signal and then the other signal. - Using either of the
circuits circuit 22, for example, wherein the results of the first stage of resampling are stored in memory and communicated back to thecircuit 22 for a second stage of resampling. Alternatively, two instances of eithercircuit - Table 2 illustrates an exemplary dual-stage implementation of the present technology. Where the decimation factor D is eight, for example, a first stage is executed with a decimation factor D of four and a second stage is executed with a decimation factor D of two. It should be noted that given the parameters set forth in Table 2, the number of iterations and the minimum size of the memory element holding the Y values remain constant: twenty-one in the first stage and forty-eight in the second stage. It will be appreciated that a relatively small number of resources are required even where the decimation factor is relatively high, such as twenty-five or thirty-two.
-
TABLE 2 1st 1st 2nd 2nd Decimation 1st Stage Stage Stage 2nd Stage Stage Stage Factor (D) Decimation Taps M/D Decimation Taps M/ D 1 Off Off — Off Off — 2 Off Off — 2 96 48 3 Off Off — 3 144 48 4 Off Off — 4 192 48 5 Off Off — 5 240 48 8 4 84 21 2 96 48 12 4 84 21 3 144 48 16 4 84 21 4 192 48 25 5 105 21 5 240 48 32 8 168 21 4 192 48 - Although the present technology has been described with reference to the preferred embodiments illustrated in the attached drawings, it is noted that equivalents may be employed and substitutions made herein without departing from the scope of the subject matter recited in the claims. It will be appreciated, for example, that the
multiplier 26 and theadder 30 may be supplemented with or replaced by other mathematical modules for performing filter operations.
Claims (22)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/966,590 US7561077B1 (en) | 2007-12-28 | 2007-12-28 | Multiple stream multiple rate resampling component |
US12/426,536 US7804429B2 (en) | 2007-12-28 | 2009-04-20 | Multiple stream multiple rate resampling |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/966,590 US7561077B1 (en) | 2007-12-28 | 2007-12-28 | Multiple stream multiple rate resampling component |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/426,536 Continuation US7804429B2 (en) | 2007-12-28 | 2009-04-20 | Multiple stream multiple rate resampling |
Publications (2)
Publication Number | Publication Date |
---|---|
US20090168932A1 true US20090168932A1 (en) | 2009-07-02 |
US7561077B1 US7561077B1 (en) | 2009-07-14 |
Family
ID=40798433
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/966,590 Expired - Fee Related US7561077B1 (en) | 2007-12-28 | 2007-12-28 | Multiple stream multiple rate resampling component |
US12/426,536 Expired - Fee Related US7804429B2 (en) | 2007-12-28 | 2009-04-20 | Multiple stream multiple rate resampling |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/426,536 Expired - Fee Related US7804429B2 (en) | 2007-12-28 | 2009-04-20 | Multiple stream multiple rate resampling |
Country Status (1)
Country | Link |
---|---|
US (2) | US7561077B1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180285727A1 (en) * | 2017-04-04 | 2018-10-04 | Hailo Technologies Ltd. | Neural Network Processing Element Incorporating Compute And Local Memory Elements |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7561077B1 (en) * | 2007-12-28 | 2009-07-14 | L3 Communications Integrated Systems, L.P. | Multiple stream multiple rate resampling component |
US9058242B2 (en) | 2010-03-04 | 2015-06-16 | Gshift Labs Inc. | Method and system of optimizing a web page for search engines |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5173948A (en) * | 1991-03-29 | 1992-12-22 | The Grass Valley Group, Inc. | Video image mapping system |
US5945885A (en) * | 1998-03-05 | 1999-08-31 | Hewlett-Packard Company | Digital baseband modulator adaptable to different modulation types |
US6584145B1 (en) * | 1999-06-02 | 2003-06-24 | Level One Communications, Inc. | Sample rate converter |
US7064770B2 (en) * | 2004-09-09 | 2006-06-20 | Silicon Optix Inc. | Single-pass image resampling system and method with anisotropic filtering |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7369637B1 (en) * | 2004-06-04 | 2008-05-06 | Altera Corporation | Adaptive sampling rate converter |
US7599451B2 (en) * | 2005-05-11 | 2009-10-06 | Sigmatel, Inc. | Sample rate conversion module and applications thereof |
US7561077B1 (en) * | 2007-12-28 | 2009-07-14 | L3 Communications Integrated Systems, L.P. | Multiple stream multiple rate resampling component |
-
2007
- 2007-12-28 US US11/966,590 patent/US7561077B1/en not_active Expired - Fee Related
-
2009
- 2009-04-20 US US12/426,536 patent/US7804429B2/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5173948A (en) * | 1991-03-29 | 1992-12-22 | The Grass Valley Group, Inc. | Video image mapping system |
US5945885A (en) * | 1998-03-05 | 1999-08-31 | Hewlett-Packard Company | Digital baseband modulator adaptable to different modulation types |
US6584145B1 (en) * | 1999-06-02 | 2003-06-24 | Level One Communications, Inc. | Sample rate converter |
US7064770B2 (en) * | 2004-09-09 | 2006-06-20 | Silicon Optix Inc. | Single-pass image resampling system and method with anisotropic filtering |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180285727A1 (en) * | 2017-04-04 | 2018-10-04 | Hailo Technologies Ltd. | Neural Network Processing Element Incorporating Compute And Local Memory Elements |
US11514291B2 (en) * | 2017-04-04 | 2022-11-29 | Hailo Technologies Ltd. | Neural network processing element incorporating compute and local memory elements |
Also Published As
Publication number | Publication date |
---|---|
US7804429B2 (en) | 2010-09-28 |
US20090207056A1 (en) | 2009-08-20 |
US7561077B1 (en) | 2009-07-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6405229B1 (en) | Digital filters | |
JP2777207B2 (en) | Reconfigurable multiprocessor | |
US5511015A (en) | Double-accumulator implementation of the convolution function | |
US9015219B2 (en) | Apparatus for signal processing | |
US9787288B2 (en) | Optimal factoring of FIR filters | |
EP1866741B1 (en) | Canonical signed digit multiplier | |
US7561077B1 (en) | Multiple stream multiple rate resampling component | |
JP3066241B2 (en) | Digital filter and oversampling type analog / digital converter using the digital filter | |
US6532273B1 (en) | Efficient polyphase decimation filter | |
US6788738B1 (en) | Filter accelerator for a digital signal processor | |
US8817913B2 (en) | Digital filter-decimator-tuner | |
CN113556101B (en) | IIR filter and data processing method thereof | |
EP0988699B1 (en) | Sharing resources in a digital filter | |
EP0037130B1 (en) | Arrangement for calculating the discrete fourier transform by means of two circular convolutions | |
US5956262A (en) | Digital filtering device | |
EP0791242B1 (en) | Improved digital filter | |
US10972318B2 (en) | Data stream processing device with reconfigurable data stream processing resources and data stream processing method | |
US8380772B2 (en) | Multi-rate filter bank | |
EP0928518B1 (en) | Parallel decimator apparatus | |
JP3177358B2 (en) | Digital filter | |
US20090300089A1 (en) | Finite impulse response filter and method | |
US11881830B2 (en) | Filter circuits and associated signal processing methods | |
Slump et al. | Design and implementation of a linear-phase equalizer in digital audio signal processing | |
US20100091829A1 (en) | Optimised architecture for a downsampling fir filter | |
EP0125156B1 (en) | Cascaded multiplier using a set of elementary operators |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: L3 COMMUNICATIONS INTEGRATED SYSTEMS, L.P., TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FORNERO, SCOTT;REEL/FRAME:020450/0036 Effective date: 20080117 |
|
AS | Assignment |
Owner name: L-3 COMMUNICATIONS CORPORATION, NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:L3 COMMUNICATIONS INTEGRATED SYSTEMS, L.P.;REEL/FRAME:026600/0837 Effective date: 20110119 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20170714 |