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 signifcantly faster than self-timed
adders with restoring logic and similar complexity.
CitacióEscribà, J.; Carrasco, J. Self-timed Manchester chain carry propagate adder. "Electronics Letters", Abril 1996, vol. 32, núm. 8, p. 708-710.