The limitations to delay-insensitivity in asynchronous circuits
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Delay-insensitive interface specification and synthesis
DATE '00 Proceedings of the conference on Design, automation and test in Europe
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Efficient Delay-Insensitive RSFQ Circuits
ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Building-Blocks for Designing DI Circuits
Building-Blocks for Designing DI Circuits
Embedding universal delay-insensitive circuits in asynchronous cellular spaces
Fundamenta Informaticae - Special issue on cellular automata
Delay-insensitive computation in asynchronous cellular automata
Journal of Computer and System Sciences
Towards a Theory of Universal Speed-Independent Modules
IEEE Transactions on Computers
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Classification and universality of reversible logic elements with one-bit memory
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Universal delay-insensitive circuits with bidirectional and buffering lines
IEEE Transactions on Computers
Reversible Computing Systems, Logic Circuits, and Cellular Automata
ICNC '12 Proceedings of the 2012 Third International Conference on Networking and Computing
| Hi-index | 0.00 |
We introduce two eight-line one-bit memory modules which are useful in the modelling of distributed memory in asynchronous delay-insensitive circuits. Our modules are reversible and together with the Merge element are serial-universal. We show how they can be used to realise Morita's Rotary Element and other reversible modules thus showing their computation universality. We also propose three sets of modules that are universal for all modules.