Parallel DNA arithmetic operation based on n-moduli set

In most arithmetic systems the speed is limited by the nature of the building block which makes logic decisions and by the extent to which decisions of low order numeric significance can affect results of higher significance. In this contribution, an improved DNA representation [A. Fujiwara, K. Matsumoto, W. Chen, Procedures for logic and arithmetic operations with DNA molecules, Int. J. Found. Comput. Sci. 15 (2004) 461-474] of an integer is presented and applied in DNA arithmetic operation based on a special n-moduli set. Because of the carry-free property in residue number system, the residue representation of an integer is a way of simplifying the procedure of DNA arithmetic operation and exploiting the astounding parallelism of DNA computing. Based on the special n-moduli set the degree of parallelism in residue arithmetic operation is n.