Abstract: A method for a plus one operation includes dividing a binary number into bit sets including a least significant bit set, incrementing the least significant bit set, and, for each bit set other than the least significant bit set, incrementing the bit set unless any less significant bit sets comprises a zero. The bit sets are increment in one of two ways. If all bits of the bit set equal one, e.g., the bit set is 1111, then all bits of the bit set are simply complemented, sometimes called inverted, and set to zero. In all other instances, the least significant zero of the bit set is identified, and the least significant zero and all less significant bits, i.e., everything to the right of the least significant zero, is (are) complemented.

Abstract: A circuit for a plus one operation includes a means for incrementing a first bit set of a binary number and a means for detecting a zero in any bit set less significant than the first bit set, the means for detecting being coupled to the means for incrementing. The means for incrementing operates in a first mode when the means for detecting detects a zero in any bit set less significant than the first bit set and operates in a second mode when the means for detecting does not detect a zero in any bit set less significant than the first bit set.