U8 to I8 binary chain optimer

[lavalava]

I need to some constructive critics.  When converting from U8 to I8 binary chain:

or vice versa:

[lavalava]

The inside case, for true is a straight through.  For the outside case, for false is also a straight through

 

Is either method the best way to get maximum computation power (less time)?  Something tells me there has to be a quicker way to do this.  I wish LV has it built in but there isn't much for working with binary.

[RobCole]

Your VI for building the binary array seems reasonable. Reversing the process can be a lot faster though.

I would do it this way:

There is more code here to find the number of bytes needed than to do the conversion. To optomize further, once the number of bytes is found, initialize an array of that size and then replace array element.

     Rob

[DFGray]

This post may help with performance improvements.