Scientific Simulations with Special Purpose Computers: The Grade Systems
Scientific Simulations with Special Purpose Computers: The Grade Systems
Structure of Computers and Computations
Structure of Computers and Computations
Binary Arithmetic for DNA Computers
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
A Serial Logarithmic Number System ALU
DSD '07 Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools
The Sign/Logarithm Number System
IEEE Transactions on Computers
DNA Computing Models
DNA Implementation of Arithmetic Operations
ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 06
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Spectrum
Natural Computing: an international journal
| Hi-index | 0.01 |
The sticker model of computation, implemented using robotic processing of DNA, manipulates in parallel many bitstrings, called strands, that are contained in a limited number of tubes. Prior sticker-addition algorithms are patterned on digital-electronic full-adders that generate carry bits, each of which must be saved in the strand, which involves wasting the strand or using a clear operation (whose biochemical implementation may be problematic). This paper proposes a new sticker-addition algorithm which does not need to record the carry bits. Instead, which tube holds a particular strand implicitly describes whether or not a carry is required. The speed and number of tubes needed are about half that needed by the prior approach. An example is given for real-valued Euclidian norms using the Logarithmic Number System.