Chee Yee Chung

Learn More
A new method for designing completion detection for asynchronous adders is introduced. The new completion detection is based on the property of a carry-merge tree for parallel-prefix adders where a generate bit at one level will have the same value as that in the previous level if there is no carry into the sequence of bits. This method has the advantages(More)
  • 1