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 meets the timing conditions typical of an asynchronous design based in the ‘bundled-data, bounded-delay’ model and is signifcantly fa...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/20778 |
| Acceso en línea: | https://hdl.handle.net/2117/20778 |
| Access Level: | acceso abierto |
| Palabra clave: | Asynchronous circuits Circuits asíncrons Àrees temàtiques de la UPC::Enginyeria electrònica::Circuits electrònics |
| Sumario: | 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. |
|---|