Self-timed Manchester chain carry propagate adder
Javier Escribá, Juan Antonio Carrasco · Electronics Letters · 1996
The authors present a self-timed adder that uses two Manchester chains to propagate carries in a two-rail code. With the inclusion of buffers in the chains, the adder meets the timing conditions typical of an asynchronous design based in the ‘bundled-data, bounded-delay’ model and is significantly faster than self-timed adders with restoring logic and similar complexity.