z-logo
open-access-imgOpen Access
Design of non‐restoring binary array divider in quantum‐dot cellular automata
Author(s) -
Cui Huanqing,
Cai Li,
Yang Xiaokuo,
Feng Chaowen,
Qin Tao
Publication year - 2014
Publication title -
micro and nano letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.25
H-Index - 31
ISSN - 1750-0443
DOI - 10.1049/mnl.2014.0148
Subject(s) - quantum dot cellular automaton , quantum cellular automaton , cellular automaton , binary number , quantum , quantum dot , computer science , physics , optoelectronics , quantum mechanics , algorithm , arithmetic , mathematics
Quantum‐dot cellular automata (QCA), a promising candidate nanotechnology for the next generation computers, has attracted the interest of researchers all over the world since 1993. The divider is a major component of arithmetic logic unit, which has a remarkable impact on the performance of the central processing unit. The widely used algorithm in the divider is the non‐restoring division, but there is no work which has reported the implementation of non‐restoring dividers based on QCA. Presented is the design of a non‐restoring binary array divider in QCA and its validity is verified using QCADesigner software. The proposed non‐restoring divider has the advantage of time‐saving and is easy to control when compared with the existing restoring dividers.

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