Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...

Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provide the basis for designing DNA cellular computing devices, i.e. autonomous nano-mechanical DNA computing devices embedded in DNA lattices. Once assembled, DNA cellular computing devices can serve as reusable, compact computing devices that perform (universal) computation, and programmable robotics dev...

Engineering biochemical reactions for computational purposes is a common pursue in synthetic biology [1]. In such design tasks, molecular species have to be carefully engineered to ensure modularity and orthogonality [3, 7], and are scarce resources. Minimizing the number of involved molecular species is crucial to accomplish a complex computation within a confined biochemical environment. This...

We present a methodology for implementing discrete-time signal processing operations, such as filtering, with molecular reactions. The reactions produce time-varying output quantities of molecules as a function of time-varying input quantities according to a functional specification. This computation is robust and independent of the reaction rates, provided that the rate constants fall within c...

We derive addition formulas at the combinatorial level, that is equations of the form F (X1+ X2 + +Xk) = F (X1; X2; : : : ; Xk), where F = F (X) is a given combinatorial species and F is a species on k sorts of singletons X1; X2; : : : ; Xk; depending on F . General results are given in the case of a molecular species M = X=H. Speci c formulas are also presented in the cases of the species Ln o...