WO2006068196A1 - 畳み込み演算回路 - Google Patents
畳み込み演算回路 Download PDFInfo
- Publication number
- WO2006068196A1 WO2006068196A1 PCT/JP2005/023523 JP2005023523W WO2006068196A1 WO 2006068196 A1 WO2006068196 A1 WO 2006068196A1 JP 2005023523 W JP2005023523 W JP 2005023523W WO 2006068196 A1 WO2006068196 A1 WO 2006068196A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- unit
- convolution operation
- divided
- amplitude
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
- H03H17/0223—Computation saving measures; Accelerating measures
- H03H17/0233—Measures concerning the signal representation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/15—Correlation function computation including computation of convolution operations
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
- H03H17/0223—Computation saving measures; Accelerating measures
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
- H03H17/06—Non-recursive filters
Definitions
- the present invention relates to a convolution operation circuit that performs a convolution operation on a given digital signal.
- a convolution operation circuit that performs a convolution operation on a given digital signal.
- a filter circuit that outputs a digital signal with a limited band.
- the filter circuit generates a signal limited to a desired band by performing a convolution operation on the digital signal, for example.
- an FIR filter circuit is provided in series, and is provided in correspondence with a plurality of delay means for sequentially delaying each data of a digital signal, and the data output from the corresponding delay means.
- a plurality of multipliers for multiplying predetermined filter coefficients; and an adder for calculating a sum of data output from the plurality of multipliers.
- the FIR filter in the latter stage is used.
- the number of effective bits of the digital signal input to the filter circuit varies.
- the arithmetic unit in the FIR filter needs to have a scale that can handle the maximum value of the variable effective bit number of the digital signal, resulting in an increase in circuit scale.
- an object of the present invention is to provide a convolution operation circuit that can solve the above-described problems. This object is achieved by a combination of features described in the independent claims.
- the dependent claims define further advantageous specific examples of the present invention.
- a convolution operation circuit that performs a convolution operation on a given digital signal, the amplitude data of each of the digital signals, A data division unit that generates a plurality of divided data divided into a plurality of bit areas, a calculation unit that performs a predetermined convolution operation for each divided data in a time division manner for each divided data, and outputs,
- a convolution operation circuit including a combining unit that combines divided data output from an operation unit for each amplitude data.
- the convolution operation circuit further includes a decimation filter that reduces the number of amplitude data of the digital signal and applies the data to the data dividing unit, and the data dividing unit converts the amplitude data based on the thinning rate of the decimation filter
- the number of divisions may be controlled.
- the data division unit may calculate the number of effective bits of the digital signal output from the decimation filter based on the thinning rate, and may increase the number of divisions when the number of effective bits increases.
- the convolution operation circuit further includes a decimation filter that reduces the number of amplitude data of the digital signal and applies the data to the data division unit, and the data division unit outputs each amplitude data for each predetermined number of bits. A plurality of divided data pieces may be generated.
- the calculation unit is connected in series, stores the amplitude data for a predetermined time, and sequentially transmits the amplitude data to the next stage, and each divided data of the stored amplitude data is divided by time within a predetermined time.
- a plurality of memory units to be output, and a plurality of multiplication units that are provided corresponding to the plurality of memory units and that output the respective divided data sequentially output by the corresponding memory units by multiplying a predetermined calculation coefficient.
- an adder that adds the divided data output in synchronization by a plurality of multipliers and outputs the result to the combiner.
- Each memory unit stores the amplitude data in a predetermined address for each divided data, and the convolution operation circuit outputs an address of data to be output to the multiplication unit corresponding to each memory unit. And a control unit for designating the address where each divided data is stored by sequential time division.
- the control unit may control the address designated to the memory unit based on a thinning rate in the decimation filter.
- the data dividing unit sequentially outputs the divided data of the amplitude data
- each memory unit sequentially stores and transmits the divided data sequentially output by the data dividing unit, and the divided amplitude data provided in series.
- the number of registers may be the same as the number of registers
- each multiplication unit may receive the data output from the last-stage register among the corresponding registers of the memory unit and multiply the operation coefficient.
- Each multiplication unit multiplies each of the divided data by a plurality of division calculation coefficients obtained by dividing the calculation coefficient into a plurality of bit areas in a time division manner.
- FIG. 1 is a diagram showing an example of a configuration of a convolution operation circuit 100 according to an embodiment of the present invention.
- FIG. 2 is a timing chart showing an example of the operation of the convolution operation circuit 100.
- FIG. 3 is a diagram showing another example of the configuration of the calculation unit 12.
- FIG. 4 is a diagram showing another example of the configuration of the convolution operation circuit 100.
- FIG. 4 is a diagram showing another example of the configuration of the convolution operation circuit 100.
- FIG. 5 is a diagram showing still another example of the configuration of the calculation unit 12.
- FIG. 6 is a diagram showing still another example of the configuration of the calculation unit 12.
- FIG. 1 is a diagram showing an example of the configuration of a convolution operation circuit 100 according to the embodiment of the present invention.
- the convolution operation circuit 100 is a circuit that performs a convolution operation on a given digital signal, and includes a data dividing unit 10, an operation unit 12, a combining unit 20, and a control unit 28.
- the control unit 28 controls operations of the data dividing unit 10, the calculation unit 12, and the combining unit 20.
- the convolution operation circuit 100 can be used as a filter circuit that limits the band of a digital signal, for example.
- the data dividing unit 10 receives a digital signal and generates a plurality of divided data obtained by dividing each amplitude data of the digital signal into a plurality of bit areas. For example, the data dividing unit 10 divides each amplitude data of the digital signal into upper bit data and lower bit data. At this time, the data dividing unit 10 divides the amplitude data so that the number of bits of each divided data is substantially the same. Each amplitude data includes a sign bit indicating the sign of the amplitude.
- the data division unit 10 has higher BZ2 bits of amplitude data Is the upper bit data, and the lower BZ2 bit is the lower bit data. If the number of bits B is odd, the upper BZ2 bit or (B + 1) Z2 bit of the amplitude data is the upper bit data, and the remaining bits are the lower bit data.
- the calculation unit 12 has, for example, a configuration of an FIR filter, and performs a predetermined convolution operation on each amplitude data for each divided data and outputs the result.
- the arithmetic unit 12 includes a plurality of memory units (14-0, 14-1, 14-2, hereinafter collectively referred to as 14), and a plurality of multiplication units (16-0, 16-1, 1, 16- 2 and below 16) and adder 18 [0023]
- the plurality of memory units 14 are connected in series, store the amplitude data of the digital signal for a predetermined time, and sequentially transmit them to the next stage. That is, the amplitude data of the digital signal is delayed by the predetermined time and sequentially transmitted to the next stage.
- each divided data of the stored amplitude data is output to the multiplication unit 16 by time division within the predetermined time.
- each memory unit 14 stores the transmitted amplitude data in a predetermined address area for each divided data, and the divided data stored in each address area is multiplied by the corresponding multiplication. Output sequentially to part 16.
- control unit 28 causes the data dividing unit 10 to divide the data, sequentially specifies the addresses where the divided data are stored by time division, and sequentially assigns each divided data to the multiplying unit 16. To output.
- control unit 28 outputs the corresponding divided data in the memory unit 14 in synchronization with each other. For example, when the amplitude data is divided into two, the control unit 28 outputs the upper bit data of each amplitude data stored in each memory unit 14 in synchronization and outputs the lower bit data in synchronization. .
- Each multiplication unit 16 is provided corresponding to a plurality of memory units 14, and multiplies each division data sequentially output by the corresponding memory unit 14 by a predetermined calculation coefficient and outputs the result. Then, the adder 18 adds the divided data output by the multiple multipliers 16 in synchronization with each other, and outputs the result to the combiner 20.
- the bit area of each amplitude data can be divided and output by multiplying each divided data by a predetermined calculation coefficient within a predetermined time.
- the arithmetic unit 12 When the data dividing unit 10 outputs each divided data of the amplitude data by time division, the arithmetic unit 12 has the memory unit 14-0 corresponding to the first stage multiplying unit 16-0. Not necessary.
- the memory unit 14-0 is provided to supply the division data to the multiplication unit 16-0 in a time division manner when the data division unit 10 outputs the divided data at the same time.
- the combining unit 20 combines the divided data output from the calculation unit 12 for each amplitude data. For example, when the calculation unit 12 performs calculation by dividing the amplitude data into two, the combining unit 20 combines the upper bit data and the lower bit data corresponding to the same amplitude data.
- the coupling unit 20 includes a shift unit 22 and a coupling circuit 24.
- the shift unit 22 is connected to the arithmetic unit 12 Receives the divided data sequentially output, and shifts and outputs the bits of each divided data based on which bit area of the amplitude data corresponds to each divided data.
- the upper bit data is shifted by the number of bits of the lower bit data and output to the combining circuit 24, and the bits are not shifted for the lower bit data.
- the control unit 28 may control the shift amount in the shift unit 22.
- the combining circuit 24 combines the received divided data by adding them. Thereby, data obtained by performing a predetermined convolution operation on each amplitude data can be generated.
- each amplitude data of a given digital signal is divided, and the convolution operation is performed on each divided data by time division. Even when is large, the operation can be performed by the multiplication unit 16 having a small circuit scale.
- the data dividing unit 10 preferably divides each amplitude data of the digital signal for each predetermined number of bits. That is, it is preferable to generate divided data having a predetermined number of bits. At this time, the number of bits of the divided data is determined by the number of bits that can be processed by the arithmetic unit 12. For example, when the multiplication unit 16 can process n-bit input data, the data division unit 10 generates divided data of n bits or less. As a result, regardless of the performance of the multiplication unit 16, a convolution operation can be performed on a digital signal having an arbitrary bit length.
- the calculation unit 12 may not include the memory unit 14-0.
- the data dividing unit 10 outputs each divided data in order.
- the memory unit 14-1 and the memory unit 14 2 store the respective divided data in a predetermined address area depending on which bit area of the amplitude data the divided data corresponds to.
- FIG. 2 is a timing chart showing an example of the operation of the convolution operation circuit 100.
- the memory unit 14-0 receives the respective amplitude data D (0), D (1),... Divided by the data dividing unit 10 into divided data at a predetermined period T, T,.
- the memory unit 14-0 stores the divided data of the stored amplitude data in each cycle. Are output to the multiplication unit 16-0 for each time divided by two. For example, the period T
- Data D (0) is output.
- the divided data D (k) is the upper bit of the amplitude data D (k).
- Divided data D (k) indicates lower bit data of amplitude data D (k)
- the multiplication unit 16-0 multiplies each of the divided data output by the memory unit 14-0 in a time division manner by a predetermined calculation coefficient h and outputs the result.
- the memory unit 14-1 stores the amplitude data delayed in the memory unit 14-0, and multiplies the divided data of the stored amplitude data by a time obtained by dividing each period into two. 16—Outputs to 1. Then, the multiplication unit 16-1 multiplies each of the divided data output from the memory unit 14-1 by a predetermined calculation coefficient h and outputs the result.
- the memory unit 14-2 stores the amplitude data delayed in the memory unit 14-1, and the divided data of the stored amplitude data is multiplied by the time obtained by dividing each period into two. 16—Outputs to 2. Then, the multiplication unit 16-2 multiplies each of the divided data output from the memory unit 14-2 by a predetermined calculation coefficient h and outputs the result.
- each memory unit 14 outputs the upper bit data D (k) of each amplitude data in synchronization in each cycle, and outputs the lower bit data D (k
- each multiplication unit 16 also outputs the operation result in synchronism with each higher order or lower order bit data.
- Adder 18 outputs the sum of the higher-order bit data output from each multiplier 16 in synchronization to combiner 20 and combines the sum of the lower-bit data output from each multiplier 16 synchronously Output to part 20. Then, the combining unit 20 combines the upper bit data and the lower bit data received from the adding unit 18 as described above.
- FIG. 3 is a diagram illustrating another example of the configuration of the calculation unit 12.
- the calculation unit 12 in this example does not have the memory unit 14-0 as compared with the configuration of the calculation unit 12 described in FIG.
- the memory unit 14-1 and the memory unit 14-2 each have a register 34 connected in series.
- the components denoted by the same reference numerals as those in FIG. 1 have substantially the same functions and configurations as the components described in FIG.
- the number of registers 34 is the same as the number of amplitude data divisions in the data division unit 10.
- the register 34 provided in series has a digital signal.
- the divided data is sequentially transmitted with a delay of about the same time as the time obtained by dividing the cycle of the signal by the number of divided amplitude data.
- the data dividing unit 10 outputs each divided data of the amplitude data to the calculating unit 12 by time division.
- the data dividing unit 10 sequentially supplies each divided data in each amplitude data to the calculating unit 12 sequentially for a predetermined time, and the calculating unit 12 sequentially performs a predetermined convolution operation on the given divided data. It's okay.
- the data division unit 10 may output each divided data for each time obtained by dividing the period of the given digital signal by the number of divisions of the amplitude data.
- the high-order bit data and the low-order bit data may be output every time when the period of the digital signal is divided into two.
- Each divided data output in time division is sequentially stored in the register 34 in each memory unit 14. With such a configuration, the divided data output from the last-stage register 34 in each memory unit 14 becomes data corresponding to the same bit area in each amplitude data.
- Each multiplication unit 16 receives the divided data output from the last-stage register 34 among the registers 34 of the corresponding memory unit 14, and multiplies a predetermined calculation coefficient. Even with such a configuration, similarly to the convolution operation circuit 100 described with reference to FIG. 1, each amplitude data of a given digital signal can be divided and a convolution operation can be performed on each divided data by time division. And the circuit scale of the arithmetic unit 12 can be reduced.
- the multiplication unit 16 in Figs. 1 and 3 multiplies the division data given by time division by a predetermined calculation coefficient.
- each multiplication unit 16 performs division data For each of the above, a plurality of divided calculation coefficients obtained by dividing the calculation coefficient into a plurality of bit areas may be multiplied in a time division manner.
- the calculation coefficient h When multiplying the amplitude data D (O) by the calculation coefficient h, such as 0, the calculation coefficient h is set to 2
- the multiplication unit 16-0 divides the period T into four and
- the multiplication unit 16-0 is divided into D (0) X h, D (0) X h, D (0) X h, D (0) X h, D (0) X h
- h indicates the upper bit data of the operation coefficient h, and h is below the operation coefficient h.
- H0 0 L0 Indicates the 0th bit data.
- FIG. 4 is a diagram showing another example of the configuration of the convolution operation circuit 100.
- the convolution operation circuit 100 in this example further includes a numerically controlled oscillator (NCO) 30 and a decimation filter 32 in addition to the configuration of the convolution operation circuit 100 described in FIG.
- NCO numerically controlled oscillator
- the convolution operation circuit 100 in this example can be used as a digital down converter. 4 that have the same reference numerals as those in FIG. 1 have substantially the same functions and configurations as the components described in FIG.
- the numerically controlled oscillator 30 generates and outputs a digital signal having a predetermined period.
- the numerically controlled oscillator 30 generates a digital signal obtained by demodulating sampling data provided by an external analog-digital converter.
- the decimation filter 32 reduces the number of amplitude data of the digital signal and supplies it to the data dividing unit 10. That is, the decimation filter 32 thins out the number of amplitude data of the digital signal to generate a low frequency digital signal.
- the number of effective bits of the signal output from the decimation filter 32 increases with respect to the number of effective bits of the signal input to the decimation filter 32.
- the increase in the number of effective bits varies according to the thinning rate of the amplitude data in the decimation filter 32. For example, in the decimation filter 32, when the thinning rate increases, the number of effective bits of the output signal increases, and when the thinning rate decreases, the number of effective bits of the output signal decreases.
- the control unit 28 controls the thinning rate in the decimation filter 32 to a preset thinning rate.
- the data dividing unit 10 controls the number of divisions of the amplitude data based on the thinning rate in the decimation filter 32.
- the number of divisions of amplitude data is controlled in accordance with fluctuations in the number of effective bits of the digital signal output by the decimation filter 32, and control is performed so that the number of bits of each division data becomes a preset value. It is preferable to do. As a result, the number of bits that can be processed by the arithmetic unit 12 Split data can be generated.
- the data dividing unit 10 determines the number of effective bits of the digital signal output from the decimation filter based on the number of bits of the signal output from the numerically controlled oscillator 30 and the rate of the crossbow I in the decimation filter 32. When the number of effective bits increases, the number of divisions of amplitude data is increased. These controls may be performed by the control unit 28.
- the data dividing unit 10 may divide each amplitude data for each predetermined number of bits. Such control can also generate divided data of a predetermined number of bits regardless of the decimation rate of the decimation filter 32.
- the calculation unit 12 in this example preferably has the same configuration as the calculation unit 12 described in FIG.
- the arithmetic unit 12 shown in FIG. 3 when the number of divisions is changed, the number of registers 34 needs to be changed, which makes control difficult.
- the operation unit 12 shown in FIG. 1 by controlling the address specified for each memory unit 14, even when the number of divisions varies, the convolution operation is easily performed in a time division manner. be able to
- control unit 28 designates address areas where the divided data is to be stored in the memory unit 14 according to the number of divisions, and these address areas By sequentially specifying the time divisions and outputting the divided data, it is possible to easily perform the convolution operation in the time division.
- the configuration of the FIR filter is described as an example of the configuration of the calculation unit 12, but the configuration of the calculation unit 12 is not limited to this. Further, the calculation unit 12 may be an FIR filter having a configuration different from that of the FIR filter shown in FIG.
- FIG. 5 is a diagram showing still another example of the configuration of the calculation unit 12. 5 that have the same reference numerals as those in FIG. 1 have substantially the same functions and configurations as the components described in FIG.
- the calculation unit 12 in this example has a transposition configuration in which the position of the memory unit 14 is changed with respect to the configuration of the calculation unit 12 shown in FIG. That is, each multiplication unit 16 receives the divided data of the respective amplitude data by time division, multiplies the calculation coefficient given in advance, and outputs the result.
- the memory unit 14 is provided corresponding to the multiplication unit 16, stores the divided data multiplied by the operation coefficient in the corresponding multiplication unit 16 in a predetermined address area, and stores the divided data at a predetermined time. The data is sequentially transmitted to the next stage with a delay.
- the adding unit 18 sequentially adds the divided data output from the memory unit 14 and the divided data output from the multiplying unit 16 corresponding to the divided data. Even with such a configuration, as described in FIG. 3, the circuit scale of the multiplication unit 16 can be reduced.
- FIG. 6 is a diagram showing still another example of the configuration of the calculation unit 12.
- the calculation unit 12 in this example further includes memory units 14-3 and 14-4 and a calorie calculation unit 26 in addition to the configuration of the calculation unit 12 described in FIG.
- the memory unit 14-1 to the memory unit 14-4 are connected in series in the same manner as the memory unit 14 described with reference to FIG.
- the adding unit 26 adds the divided data sequentially input to the memory unit 14-1 and the divided data sequentially output by the memory unit 14-4, and supplies the result to the multiplying unit 16-0.
- the adding unit 26 adds the divided data sequentially input to the memory unit 14-2 and the divided data sequentially output from the memory unit 14-3 and supplies the result to the multiplying unit 16-1.
- the calculation unit 12 may have a transposition configuration in which the arrangement of the memory unit 14 is changed in the configuration of FIG. 6 in the same manner as the calculation unit 12 shown in FIG.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Computational Mathematics (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Complex Calculations (AREA)
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/762,782 US7945610B2 (en) | 2004-12-24 | 2007-06-14 | Convolution operation circuit |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004-374928 | 2004-12-24 | ||
JP2004374928A JP4630056B2 (ja) | 2004-12-24 | 2004-12-24 | 畳み込み演算回路 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/762,782 Continuation US7945610B2 (en) | 2004-12-24 | 2007-06-14 | Convolution operation circuit |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006068196A1 true WO2006068196A1 (ja) | 2006-06-29 |
Family
ID=36601793
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/023523 WO2006068196A1 (ja) | 2004-12-24 | 2005-12-21 | 畳み込み演算回路 |
Country Status (3)
Country | Link |
---|---|
US (1) | US7945610B2 (ja) |
JP (1) | JP4630056B2 (ja) |
WO (1) | WO2006068196A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106788331A (zh) * | 2016-11-21 | 2017-05-31 | 深圳市紫光同创电子有限公司 | 一种有限长冲激响应滤波电路及可编程逻辑器件 |
JP2020057286A (ja) * | 2018-10-03 | 2020-04-09 | キヤノン株式会社 | 情報処理装置、情報処理方法 |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11139800B1 (en) * | 2018-05-24 | 2021-10-05 | Marvell Asia Pte, Ltd. | Optimized multi-pam finite impulse response (FIR) filter |
JP7152107B2 (ja) | 2019-01-30 | 2022-10-12 | Necプラットフォームズ株式会社 | 演算処理装置、演算処理方法及びプログラム |
JP7177000B2 (ja) * | 2019-05-16 | 2022-11-22 | 日立Astemo株式会社 | 演算装置および演算方法 |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH04360410A (ja) * | 1991-06-07 | 1992-12-14 | Yokogawa Electric Corp | Sincフィルタ |
JPH06224695A (ja) * | 1992-07-31 | 1994-08-12 | Matsushita Electric Ind Co Ltd | ディジタル信号処理装置 |
JPH06350396A (ja) * | 1993-06-04 | 1994-12-22 | Sharp Corp | デシメイション回路 |
JPH0738381A (ja) * | 1993-06-25 | 1995-02-07 | Sony Corp | ディジタルフィルタおよびそれを用いた直交変調装置 |
JPH11312953A (ja) * | 1998-04-30 | 1999-11-09 | Ando Electric Co Ltd | データ遅延装置 |
JP2002164813A (ja) * | 2000-11-24 | 2002-06-07 | Matsushita Electric Ind Co Ltd | マッチドフィルタ装置及び受信装置におけるマッチドフィルタリング方法 |
JP2003133911A (ja) * | 2001-10-24 | 2003-05-09 | Yokogawa Electric Corp | フィルタ演算装置 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5079734A (en) * | 1990-04-30 | 1992-01-07 | Harris Corporation | Digital decimation filter |
JPH05335888A (ja) * | 1991-04-17 | 1993-12-17 | Lsi Logic Kk | デジタルフィルタ装置とそれを用いたサンプリング周波数変換装置およびmuseデコーダ |
JPH0612229A (ja) * | 1992-06-10 | 1994-01-21 | Nec Corp | 乗累算回路 |
US5805479A (en) * | 1995-09-25 | 1998-09-08 | United Microelectronics Corp. | Apparatus and method for filtering digital signals |
JP2002217787A (ja) * | 2000-11-17 | 2002-08-02 | Hitachi Kokusai Electric Inc | ディジタルフィルタ |
-
2004
- 2004-12-24 JP JP2004374928A patent/JP4630056B2/ja not_active Expired - Fee Related
-
2005
- 2005-12-21 WO PCT/JP2005/023523 patent/WO2006068196A1/ja active Application Filing
-
2007
- 2007-06-14 US US11/762,782 patent/US7945610B2/en not_active Expired - Fee Related
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH04360410A (ja) * | 1991-06-07 | 1992-12-14 | Yokogawa Electric Corp | Sincフィルタ |
JPH06224695A (ja) * | 1992-07-31 | 1994-08-12 | Matsushita Electric Ind Co Ltd | ディジタル信号処理装置 |
JPH06350396A (ja) * | 1993-06-04 | 1994-12-22 | Sharp Corp | デシメイション回路 |
JPH0738381A (ja) * | 1993-06-25 | 1995-02-07 | Sony Corp | ディジタルフィルタおよびそれを用いた直交変調装置 |
JPH11312953A (ja) * | 1998-04-30 | 1999-11-09 | Ando Electric Co Ltd | データ遅延装置 |
JP2002164813A (ja) * | 2000-11-24 | 2002-06-07 | Matsushita Electric Ind Co Ltd | マッチドフィルタ装置及び受信装置におけるマッチドフィルタリング方法 |
JP2003133911A (ja) * | 2001-10-24 | 2003-05-09 | Yokogawa Electric Corp | フィルタ演算装置 |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106788331A (zh) * | 2016-11-21 | 2017-05-31 | 深圳市紫光同创电子有限公司 | 一种有限长冲激响应滤波电路及可编程逻辑器件 |
CN106788331B (zh) * | 2016-11-21 | 2020-04-17 | 深圳市紫光同创电子有限公司 | 一种有限长冲激响应滤波电路及可编程逻辑器件 |
JP2020057286A (ja) * | 2018-10-03 | 2020-04-09 | キヤノン株式会社 | 情報処理装置、情報処理方法 |
JP7165018B2 (ja) | 2018-10-03 | 2022-11-02 | キヤノン株式会社 | 情報処理装置、情報処理方法 |
JP2022188301A (ja) * | 2018-10-03 | 2022-12-20 | キヤノン株式会社 | 情報処理装置、情報処理方法 |
JP7414930B2 (ja) | 2018-10-03 | 2024-01-16 | キヤノン株式会社 | 情報処理装置、情報処理方法 |
Also Published As
Publication number | Publication date |
---|---|
US20080275930A1 (en) | 2008-11-06 |
JP4630056B2 (ja) | 2011-02-09 |
US7945610B2 (en) | 2011-05-17 |
JP2006186425A (ja) | 2006-07-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP2005287003A (ja) | アップコンバータ回路 | |
WO2006068196A1 (ja) | 畳み込み演算回路 | |
CN102035502A (zh) | 一种fir滤波器的实现结构 | |
JPH11239040A (ja) | ディジタルフィルタおよび通信装置 | |
JPH07112144B2 (ja) | デジタル・フィルタ | |
JP3584027B2 (ja) | デジタルフィルタ | |
EP3114541B1 (en) | Flexible chirp generator | |
JP2885121B2 (ja) | ディジタルフィルタ | |
JP3890289B2 (ja) | ラグランジェ補間サンプリングレート変換装置 | |
JP4273323B2 (ja) | 積和演算回路 | |
CN116781041B (zh) | 一种具有高资源利用率的多速率变换滤波器 | |
US6003055A (en) | Digital filter interpolation circuit | |
KR100270165B1 (ko) | 디지털 인터폴레이션 기능이 있는 병렬 fir 필터 시스템 | |
JPH1131945A (ja) | 非対称周波数応答特性を有する有限インパルス応答フィルタ | |
JPH0998069A (ja) | Fir型ディジタルフィルタ | |
JPH0832409A (ja) | デジタルfirフィルタ回路 | |
JPH0590897A (ja) | オーバーサンプリングフイルタ回路 | |
JP2004128858A (ja) | Firデジタルフィルタ | |
JPH10322164A (ja) | ディジタルフィルタ | |
JP2628506B2 (ja) | ディジタルフィルタ | |
JP2530697Y2 (ja) | 電子楽器のサンプルホールド制御装置 | |
RU2262190C1 (ru) | Цифровой синтезатор частот | |
JP4243473B2 (ja) | Firディジタルフィルタ | |
JP2021093667A (ja) | 信号出力装置 | |
JP3722821B2 (ja) | 演算方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KM KN KP KR KZ LC LK LR LS LT LU LV LY MA MD MG MK MN MW MX MZ NA NG NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU LV MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 05820349 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: JP |