04-18-2009 08:19 AM
Solved! Go to Solution.
04-18-2009 10:10 AM
04-18-2009 12:59 PM - edited 04-18-2009 01:04 PM
The quoted web page does not mention the word "linear convolution", but if you simply want to do it without any fourier transforms, you could multiply and sum in a loop as in the attached demo. It gives the same result as the stock convolution VI (within ~10e-15). There are many other ways to do this, of course.
(There are a couple of things wrong with your VI, so I don't quite know what you want at the end. For example you are graphing complex arrays in a plain graph, so you are losing the imaginary part. You also need a small wait in the loop, else the VI consumes all CPU, recalculating the same over and over again. Ideally the loop only needs to spin when an input changes.)
04-20-2009 03:09 AM
04-20-2009 03:12 AM
gareth1983 wrote:I had found another way to do it and it works just as required.
Could you please tell that another way here so that other people will get benefitted a lot by your help in the future.
Thanks,
Mathan
04-20-2009 08:08 AM
04-20-2009 08:51 AM
gareth1983 wrote:Hi Mathan,well, for the benefit for everyone, just like what I'd benefited from this forum.
Thanks a lot. Surely it will help lot of people. Please continue this service. Thanks again.
Mathan