FIR filter design based on DA
2012-08-20 17:45
267 查看
DFS system and parallel computing have both gained ground in today's cloud computing area, to maximize the data processing volume within a timestamp.
You might have to switch to no-lock nosql to realize high concurrency when it comes to digital signal processing, a good structure such as the butterfly modal using original stand point computing and bit reverse to analog time-frequency transformation in code design really matters.
Utilizing concurrent computing will fullfil the ALU and MAC units to accelerate filtering to turn input into output.
Here's the analysis for the basic rule applied in FIR filter design:
x
is computed in b bit depending on how many bit it has, coefficient is 2^b.
Multiply c
to x
we will get
and then we transform y to another type by creating a triple accumulation loop to a new order:
y=(c[0]xB-1[0]+c[1]+……+c[N-1]xB-1[N-1])2B-1+(c[0]xB-2[0]+c[1]+……+c[N-1]xB-2[N-1])2B-2 (2-4)
.
.
+(c[0]x0[0]+c[1]x0[1]+c[N-1]x0[N-1])
finally we come to the result:
look at the 2-4 formular, the machine concurrently calculate the (c[0]xB-1[0]+c[1]+……+c[N-1]xB-1[N-1])2B-1 part, this is called bit caculation, and then generate the accumulation result by adding these distributed bits
You might have to switch to no-lock nosql to realize high concurrency when it comes to digital signal processing, a good structure such as the butterfly modal using original stand point computing and bit reverse to analog time-frequency transformation in code design really matters.
Utilizing concurrent computing will fullfil the ALU and MAC units to accelerate filtering to turn input into output.
Here's the analysis for the basic rule applied in FIR filter design:
x
is computed in b bit depending on how many bit it has, coefficient is 2^b.
Multiply c
to x
we will get
and then we transform y to another type by creating a triple accumulation loop to a new order:
y=(c[0]xB-1[0]+c[1]+……+c[N-1]xB-1[N-1])2B-1+(c[0]xB-2[0]+c[1]+……+c[N-1]xB-2[N-1])2B-2 (2-4)
.
.
+(c[0]x0[0]+c[1]x0[1]+c[N-1]x0[N-1])
finally we come to the result:
look at the 2-4 formular, the machine concurrently calculate the (c[0]xB-1[0]+c[1]+……+c[N-1]xB-1[N-1])2B-1 part, this is called bit caculation, and then generate the accumulation result by adding these distributed bits
相关文章推荐
- OpenCV_(Based on Sobel Filter to Detect edges) 基于Sobel算子的方向滤波器检查边缘
- 基于fpga的双倍速率动态存储器设计 design of dual rate dynamic memory based on fpga
- Single Image Haze Removal Based On Guided Filter
- Workflow design based on visio
- The Design and Implementation of Two-dimensional Vector Graphics Interactive Tools Based on “Smart Handle”
- 2010: Hardware Design Flow based on USA company
- HTML5 UI design based on Google Material
- [Angular] Design API for show / hide components based on Auth
- Plant Design Review Based on AnyCAD
- Enterprise Application Achitecture Design Based on LiteMDA 0.5
- 【论文 Postfiler】Microphone Array Post-Filter Based on Noise Field Coherence
- Enterprise Application Achitecture Design Based on LiteMDA 0.5
- [ORGINAL]OOP Panel control design(based on web )
- Design and Implementation of Automatic Generation of Test Cases Based on Model Driven Architecture
- [Ramda] Filter an Array Based on Multiple Predicates with Ramda's allPass Function
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)&&Codeforces 861C Did you mean...【字符串枚举,暴力】
- Codeforces Round #416 (Div. 2) (based on MSPU Olympiad 2017)
- My thesis--a chatting room based on ASP.NET
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) C - Ordering Pizza
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) 总结