z-logo
open-access-imgOpen Access
Design of a DNA‐based reversible arithmetic and logic unit
Author(s) -
Sarker Ankur,
Hasan Babu Hafiz Md.,
Rashid Sarker Md Mahbubur
Publication year - 2015
Publication title -
iet nanobiotechnology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 38
eISSN - 1751-875X
pISSN - 1751-8741
DOI - 10.1049/iet-nbt.2014.0056
Subject(s) - dna computing , arithmetic , multiplication (music) , arithmetic logic unit , subtraction , computer science , parallel computing , adder , operand , multiplexer , computation , algorithm , mathematics , multiplexing , combinatorics , telecommunications , latency (audio)
Owing to the emergence of better characteristics such as parallelism, low power consumption and data compactness, DNA computing has drawn great attention in recent years. In this study, the authors realise an arithmetic and logic unit (ALU) using deoxyribonucleic acid (DNA). Inputs and outputs of the proposed ALU keep the logical reversibility in computation processes. The proposed ALU is capable of performing four logical (AND, OR, EX‐OR and NOT) with three arithmetic (addition, subtraction and multiplication) operations. They use DNA‐based multiplexer to carry out final output. Compared to silicon‐based computation, the proposed ALU is faster and requires less space and power due to parallelism, replication properties, compactness and formation of DNA strands. However, compared to one existing DNA‐based system, fewer signals are required in each step. Besides, another existing DNA‐based ALU requires five complex biological steps to compute, whereas the proposed ALU requires three biological steps. Also, the time complexities of that existing system are O ( m ln 2 n ) for addition and subtraction operations; O ( m ) for logical operations and O ( m (ln 2 n ) 2 ) for multiplication operation, while the proposed system has O (1) for logical operations and O ( n ) for others; here n is the number of bits and m is the number of test tubes for operands.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here