A logarithmic time method for two's complementation

Abstract

This paper proposes an innovative algorithm to find the two's complement of a binary number. The proposed method works in logarithmic time (O(logN)} instead of the worst case linear time (O(N)) where a carry has to ripple all the way from LSB to MSB. The proposed method also allows for more regularly structured logic units which can be easily modularized and can be naturally extended to any word size. Our synthesis results show that our method achieves up to 2.8x of performance improvement and up to 7.27x of power savings compared to the conventional method. © Springer-Verlag Berlin Heidelberg 2005.