P. Kolovos

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Parallel-prefix adders offer a highly-efficient solution to the binary addition problem. Several parallel-prefix adder topologies have been presented that exhibit various area and delay characteristics. However , no methodology has been reported so far that directly aims to the reduction of switching activity of the carry-computation unit. In this paper by(More)
  • 1