Self-assembly model of simple arithmetic in DNA computing—Multiplication

doi:10.3778/j.issn.1002-8331.2010.20.045

Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (20): 161-163.DOI: 10.3778/j.issn.1002-8331.2010.20.045

• 人工智能 • Previous Articles Next Articles

Self-assembly model of simple arithmetic in DNA computing—Multiplication

LIU Wei¹，GUO Ying²，MENG Da-zhi³

1.College of Mathematics and Information，Ludong University，Yantai，Shandong 264025，China
2.Department of Communication Engineering，Central South University，Changsha 410083，China
3.College of Applied Science，Beijing University of Technology，Beijing 100022，China

Received:2010-04-14 Revised:2010-05-18 Online:2010-07-11 Published:2010-07-11
Contact: LIU Wei

DNA计算机算术运算的自装配模型（II）—乘法

刘伟¹，郭迎²，孟大志3

1.鲁东大学数学与信息学院，山东烟台 264025
2.中南大学信息与通信工程系，长沙 410083
3.北京工业大学应用数理学院，北京 100022

通讯作者: 刘伟

Abstract

Abstract: DNA computer has the advantages of high degree of parallelism，large capacity，high speed and so on compared with conventional computer.It also takes addition，subtraction，multiplication and division and other simple arithmetic operations and logic operations as basic computing units.This paper proposes the general parallel DNA self-assembly parallel multiplication model on the basis of DNA self-assembly parallel addition model.The time complexity of proposed algorithm is [O(1)] and the space complexity is [O(n)].In addition the main merits of this model are simple coding，universal and its efficiency.

Key words: DNA computer, arithmetic, self-assembly, multiplication

摘要： DNA计算机与传统电子计算机相比具有高度并行性、容量大、速度快等特点。它也是以加、减、乘、除等简单算术运算和异或等逻辑运算为基本运算单元。在自装配加法的基础上，设计了DNA自装配乘法模型，算法的时间复杂度为[O(1)]，空间复杂度为[O(n)]，并给出实例验证了算法的有效性。该算法具有编码简单、效率高、通用性强等优点。

关键词: DNA计算机, 算术运算, 自装配, 乘法

CLC Number:

TP301

LIU Wei¹，GUO Ying²，MENG Da-zhi³. Self-assembly model of simple arithmetic in DNA computing—Multiplication[J]. Computer Engineering and Applications, 2010, 46(20): 161-163.

刘伟¹，郭迎²，孟大志3. DNA计算机算术运算的自装配模型（II）—乘法[J]. 计算机工程与应用, 2010, 46(20): 161-163.

[1]	HAO Xiang, HE Yichao, ZHU Xiaobin, ZHAI Qinglei. Discrete Hybrid Multi-verse Optimization Algorithm for Solving Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2021, 57(18): 103-113.
[2]	LIU Shuanggen, ZHAO Hui. Fast and Secure Scalar Multiplication Based on Pell Sequence [J]. Computer Engineering and Applications, 2019, 55(4): 125-129.
[3]	TANG Zhen, YIN Zhixiang, CUI Jianzhong, YANG Jing, SUN Xia. DNA Origami for an Application of Special Integer Programming Problem [J]. Computer Engineering and Applications, 2019, 55(16): 49-54.
[4]	CHEN Changhua1, LIU Yu2, CUI Qiang3. Remote sensing image defog algorithm based on saturation operation and dark channel theory [J]. Computer Engineering and Applications, 2018, 54(5): 174-179.
[5]	HUA Xiaofeng, DUAN Jianmin, TIAN Xiaosheng. Research on vehicle obstacle avoidance based on restricted areas penalty function and MPC prediction multiplication [J]. Computer Engineering and Applications, 2018, 54(15): 131-138.
[6]	GAO Zunhai, GAO Ying, CHENG Guo. Weighted path matrix of graph and all pairs shortest path problem [J]. Computer Engineering and Applications, 2017, 53(9): 47-50.
[7]	ZHANG Xiaonan1, GAO Xianwei1，2, DONG Xiuze2. Improvement and implementation of carry-save large numbers multiplication on FPGA [J]. Computer Engineering and Applications, 2017, 53(21): 58-61.
[8]	YU Yinghuai, XIE Shiyi, MEI Qixiang. Accurate motion estimation based on gradient cross-correlation algorithm with kernel regression refining [J]. Computer Engineering and Applications, 2017, 53(14): 214-221.
[9]	MA Xu. Programming examples based on super high precision calculation [J]. Computer Engineering and Applications, 2017, 53(14): 51-55.
[10]	LIU Shuanggen1, YAO Huatong1, LI Fagen2. SPA resistant scalar multiplication on Edwards curve [J]. Computer Engineering and Applications, 2017, 53(1): 103-106.
[11]	LIU Shuanggen1, LI Huan1, LI Fagen2. Error detection algorithm of resistance to fault attack on Montgomery algorithm [J]. Computer Engineering and Applications, 2016, 52(24): 19-22.
[12]	LI Cailin, FENG Zhaohui, DENG Xiaojing, HAN Lei. Power line extraction method in complex ground object background [J]. Computer Engineering and Applications, 2016, 52(22): 198-202.
[13]	LAI Zhongxi, ZHANG Anjie, ZHANG Zhanjun. Improved algorithms for computing 7P and 7kP on elliptic curves [J]. Computer Engineering and Applications, 2016, 52(1): 29-32.
[14]	XIE Tianyi1, HUANG Kai1, XIU Siwen2, TANG Congxue3, YAN Xiaolang1. VLSI implementation of elliptic curve cryptographic accelerator over [GF(p)] [J]. Computer Engineering and Applications, 2016, 52(1): 89-94.
[15]	SHEN Chunnan, MA Cunbao. Research on method of solving logic equations based on integer equations [J]. Computer Engineering and Applications, 2015, 51(4): 71-75.

Self-assembly model of simple arithmetic in DNA computing—Multiplication

DNA计算机算术运算的自装配模型（II）—乘法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics