Count Bits, Choose High or Low?

[sayzer]

IF DT's routine is too complicated for you, which usually is for me, then take a look at this one.
This should be faster then yours I guess.

<font color="#000000">ErrorCheck:
    HighCount = <font color="#FF0000">0
    </font>LowCount  = <font color="#FF0000">8
    </font>i         = <font color="#FF0000">0

    </font><font color="#000080"><b>WHILE </b></font>i &lt; <font color="#FF0000">8
          </font>n = testByte.<font color="#FF0000">0</font>[i]          <font color="#000080"><i>'Read bit.
          </i></font>LowCount  = LowCount - n   <font color="#000080"><i>'sub. bits.
          </i></font>HighCount = HighCount + n  <font color="#000080"><i>'add bits.
          </i></font>i = i + <font color="#FF0000">1                  </font><font color="#000080"><i>'incr. bit.
    </i><b>WEND


    </b></font>testByte = <font color="#FF0000">$00                    </font><font color="#000080"><i>'Assign value.
    </i><b>IF </b></font>HighCount &gt;= LowCount <font color="#000080"><b>THEN </b></font>testByte = <font color="#FF0000">$FF  </font><font color="#000080"><i>'change value if true.
         
</i><b>RETURN
</b></font>

Edit: I did not understand the logic behind this statement:
"This will eliminate any bit errors as long as it's not more than 3 bit errors per byte."
You may cut the loop off if this is true and reduce the time into half of what it takes.

-------------------

[kevj]

Very much appreciated guys. That worked perfectly.

Darrel's code wins though. Indeed, about 16uS. Sayzer's loop took about 112uS. An improvement but still not quite fast enough.

If there was ever any question about the efficiency of assembly or the lack of efficiency of PBP, I guess we see it right here. lol.

Anyway, that totally solves my problem - thank you both very much!