Self-timed Manchester chain carry propagate adder

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 met the timing conditions typical of an asynchronous design based on the `bundled-data, bounded-delay´ model and is significantly faster than self-timed adders with restoring logic and similar complexity