Given n bits, for example, 00100110110001, there are six 1s in these bits.
I want to output 11111100000000, which moves the non-consecutive bit 1s to the left of the string.
I know some sequential logic can do this job, but sequential logic takes too much time.
I am wondering is there some low power and fast circuit to move non-consecutive bit 1s to consecutive bit 1s?
For example, is there some analog circuits or asyncronous circuits that can do this job?
In addition, the input signals are stored in a n-bit register, and the output signals are parallel signals. Moreover, the number of input bits is fixed. The number of input bits can be relatively large, e.g., n=128 or 256.
More importantly, is it possible to pack these bit 1s using some circuit which has the similar speed of a n-bit parallel counter but consumes less power than a n-bit parallel counter?
