I need to perform fast bitwise AND operations of 2 different 2-dimensional bit arrays.
Bit array A will be larger than bit array B.
The idea is to find the first available location within array A where array B will fit in such manner that a bitwise AND operation of the two bit arrays will result in nothing but zero's.
The code should be optimized for high speed. Written in assembler.
Typical array size of the large array: up to 3000x1500 bits
Typical array size small array: can be any size. Example 500x300 bits
- 2-dimensional array A
- 2-dimensional array B
- A Boolean that indicates that a position has been found
- The location of the position in Array A where array B will fit
- The (array A OR array B) resulting 2-dimensional array.
Needs to interact with a Windows vb.net application.
The application currently works absolutely great in VB but is just not fast enough. I used to do some assembler programming myself in my CPU 8088 days but have lost touch with it. But I do remember how tremendously fast it was. So I'm looking for someone that can do it for me.
There seems to be some confusion about the exact requirements so I extracted the piece of code that should be re-written in assembler. Please find that piece of code under "Files".
I have also attached a vb6 program that can be very handy to see how it works and also to do functional and performance testing.
8 фрилансеров(-а) в среднем готовы выполнить эту работу за €536
Hi. I can help you to write the code you need in assembly. I have experience programming in assembly code for several microprocessors and microcontrollers.