Design of a low latency asynchronous adder using early completion detection

A new method for designing completion detection for asynchronous adders is introduced. the new completion detection is based on the property of a carrymerge 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 of a bundled data approach,allowing the use of single-rail completion detection design methodology,yet it allows the detection of early completion with very minimal gate count overhead. an alternative to speculative completion, this method has approximately 10% improvement in performance at the costs of a 4% increase in area and a negligible increase in power consumption for hybrid skalansky carry-select and self-timed kogge-stone parallel prefix adders. © school of engineering,taylor’s university.