substracting a whole array of values at once

Feb 11, 2007 22 Replies

im not trying to proove a concept regarding SIMULTANIOUS SUBSTRACTION using FPGA's.

its bit more complicated and, this substraction thing (and total verilog code) is just a tool to prove it. thats why i dont bother about the best, most cost efficient way of doint it, as long as i can get results fast. and the code i mentioned is just an example. the actual matrix is maximum = 100 x 10, which allows me to do this in a real chip.

and i dont mind waiting for 100 milliseconds for the calculation, as the current calculation takes 3 seconds to complete. (this is using direct convolution, without doing FFT).

thank you.

CMOS schrieb:

Hi CMOS, who named this thread "substracting a whole array of values at once"?

Why don't you tell us what your real problem is. Seems like my teasing was at least good for that purpose.

So you have a big algorithm that needs 3 seconds on some hardware unknown to us, and you need to speed it up? Ok, tell us more. But instead you post tiny fractions of the problem and misleading questions.

With my example I had no cost efficient solution in mind. Just an efficent one, and a practical one.

You say milliseconds is ok if you see that part as a single operation, well if you split that operation into small pieces (like adressing the matrix) you can do these operations within nanoseconds (like 100MHz Clockrate). Both approaches may solve the problem in the same total amount of calculating time, but you have much less problems implementing the 100MHz approach.

Give it a thougt and us better informations.

Best regards Eilert

So why don't you speed things up by using the fequency domain (or are you a troll)?

Join the Discussion

Have something to add? Share your thoughts — no account required.

Didn't find your answer?

Ask the community — no account required