Name
Abstract | ||
|---|---|---|
In this paper, we consider addressable procedures with DNA strands for logic and arithmetic operations. Using a theoretical model for DNA computing, we first show a DNA representation of n binary numbers of m bits, and propose a procedure to assign values for the representation. The procedure is applicable to n binary numbers of m bits in O(1) lab steps in parallel. Next, we propose a procedure for logic operations. The procedure enables any Boolean operation whose input and output are defined by a truth table, and executes different kinds of Boolean operations simultaneously for any pair of n binary numbers of m bits in O(1) lab steps using O(mn) DNA strands. Finally, we propose a procedure for additions of pairs of two binary numbers. The procedure works in O(1) lab steps using O(mn) DNA strands for O(n) additions of two m-bit binary numbers. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/IPDPS.2003.1213301 | IPDPS |
Keywords | Field | DocType |
addressable procedure,arithmetic operations,dna representation,addressable procedures,boolean operation,procedure work,dna strand,dna strands,lab step,n binary number,dna computing,m bit,binary number,logic and arithmetic operations,m-bit binary number,logic operations,computational modeling,silicon,truth table,parallel programming,concurrent computing,testing,arithmetic,distributed processing,binary numbers,logic,mathematical model,boolean algebra,massive parallelism | Boolean circuit,Computer science,Parallel computing,Arithmetic,Truth table,Input/output,Boolean algebra,A-DNA,Boolean domain,Distributed computing,DNA computing,Binary number | Conference |
ISSN | ISBN | Citations |
1530-2075 | 0-7695-1926-1 | 5 |
PageRank | References | Authors |
0.52 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Fujiwara | 1 | 122 | 27.25 |
| Ken'ichi Matsumoto | 2 | 9 | 1.62 |
| Wei Chen | 3 | 5 | 0.52 |