Arithmetic Operations Simulation Library's aim is to develop an open source library to simulate heavy arithmetic operations efficiently.
Finding different ways to solve a problem has been an interesting way to relax for many people. Not only they derive some kicks out of it, but as a side effect they develop much deeper insight into the problems enabling them to work out solutions under different constraints easily.
Here you will find discussion/hints to solve some common programming problems in efficient ways, supported with code that you can try.
DSP Programming Tricks
Often support for many heavy arithmetic operations goes missing to reduce the chip cost for marketability reasons, or during chip development stages. And we programmers have to make for the lack of these.
Accessing recent N items in history
This problem attracted my attention during DSP guest lectures by Mr. Ganesh Bhokare at PUCSD in later half of 2005. Various programming solutions to this problem would be.
Maintain a circular buffer in an array of N (or N+1) items. This will require support for MOD operation.
In case N is a power of 2, bitwise-anding with (N-1) can be used in place of MOD.
If neither N is a power of 2, nor MOD support is available?
What's New in This Release:
· This version supports finding the first 1/0 bit from left/right (lsb/msb), 16-bit unsigned numbers multiplication, division and mod operations, and also special cases of division by 3.
Product's homepage
Find us on Google+
