Home > Net >  The list traversal sum problem
The list traversal sum problem

Time:01-31

Consult everybody I constructed a list every time I need to traverse the list and he (index + 1) multiplication, resulting from the sum a number
But every time I add an element and shaved off the first element is always need to traverse the sum again low calculation efficiency that a little a bit ah do you have any efficient method

CodePudding user response:

In a meeting I will not post code
Mainly to provide a key words: signal processing IIR

Your current description is a description of the FIR, limited length processing
IIR is the difference between the infinite length, since the feedback,
Even if, of course, is to compute the iir also to calculate, this you don't need to entanglements,
Project should how how, not with the more walk more narrow garden garden big theology tangle and killings

Hey hey, video to 20 frames a second calculation, a serial port and a second 9600 signal acquisition, attack?? The great spirit of the garden
  •  Tags:  
  • C#
  • Related