local variation in data statistics. A code that incoruorates a variety of bit allocation options and allows the bitallocawe introduce a two-stage bit allocation algorithm gous to the algorithm for weighted vector quanpossible bit allocations (typically in the form of a collection of quantization matrices) rather than a single bit allocation tion to change from image to image or even from data b...

Motion estimation (ME) using bit-plane matching (BPM) algorithm has been proposed. The bit-plane matching algorithm transforms original images into bit-planes and performs a fast block matching process using the bit-planes. Two-bit transform (2BT) transforms an image frame into two bit planes with local window mean and variance values as threshold values. Constrained two-bit transform (C2BT) wa...

The occupancy of caches has tended to be dominated by the logic bit value ‘0’ approximately 75% of the time. Periodic bit flipping can reduce this to 50%. Combining cache power saving strategies with bit flipping can lower the effective logic bit value ‘0’ occupancy ratios even further. We investigate how Negative Bias Temperature Instability (NBTI) affects different power saving cache strategi...

In this paper a new category of partitions called beaded partitions with k colors will be introduced. The generating functions for these partitions will be given and several properties and congruences will be presented. A beaded partition of a positive integer n is a necklace made up of strands of beads in k colors where the total number of beads in the necklace is n. Sliding the beads around t...

How much do we have to change a string to increase its Kolmogorov complexity. We show that we can increase the complexity of any non-random string of length n by flipping O( √ n) bits and some strings require Ω( √ n) bit flips. For a given m, we also give bounds for increasing the complexity of a string by flipping m bits. By using constructible expanding graphs we give an efficient algorithm t...