12 May 2006

First public sharing of the utility libray functions. [utilfuncs version 0.01]

It all started as a small effort for experimenting with various logic to find
first 1/0 bit from one end in an integer and some other problems on, but later
in retrospect I felt it could be useful to directionalise the effort into a
library of (heavy) arithmetic operations simulation routines, and routines for
other miscellaneous string processing tasks.

Operations of division, multiplication, mod, finding first 1/0 bit in a number
are all implemented using shift and add/subtract operations. These are likely
to find use with software development on low cost dsp systems, where often
some heavy operations are absent in initial development stages and sometimes
even later.

Current release has routines to 
- find first 1/0 bit from left/right (lsb/msb)
- 16 bit unsigned numbers multiplication, division and mod operation, and also
  special cases of division by 3.
- efficiently count/find English alphabets in a string.
- small test suite to verify the existing routines.

Sandeep Kumar [shimple0@yahoo.com, blackray@indiainfo.com]
