Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Towards ultra-efficient QCA reversible circuits
Chabi A., Roohi A., Khademolhosseini H., Sheikhfaal S., Angizi S., Navi K., DeMara R. Microprocessors & Microsystems49 (C):127-138,2017.Type:Article
Date Reviewed: May 1 2017

In this paper, quantum-dot cellular automata (QCA) nanotechnology is introduced and employed to design some basic integrated circuit components. Compared to the traditional complementary metal-oxide semiconductor (CMOS) technology, a 24 percent reduction in size is achieved with the proposed reversible gate. Furthermore, an almost 25 percent reduction in delay and a more than 70 percent reduction in area are obtained when designing latches.

Since the basic sequential devices include not only latches but also flip-flops, the future work of this paper can be extended to the clock-triggered flip-flop and register design. From a synthesis perspective, timing constraints or violations using QCA technology, such as the setup time and hold time of the sequential logic using conventional CMOS transistors, should be further considered.

Reviewer:  Xiaokun Yang Review #: CR145233 (1707-0450)
Bookmark and Share
 
Sequential Circuits (B.6.1 ... )
 
 
Cellular Arrays And Automata (B.6.1 ... )
 
 
Combinational Logic (B.6.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Sequential Circuits": Date
Checking experiments in sequential machines
Bhattacharya A., John Wiley & Sons, Inc., New York, NY, 1989. Type: Book (9789780470213650)
May 1 1990
Combining GAs and symbolic methods for high quality tests of sequential circuits
Keim M., Drechsler N., Drechsler R. (ed), Becker B. Journal of Electronic Testing: Theory and Applications 17(1): 37-51, 2001. Type: Article
Feb 25 2003
Novel state minimization and state assignment in finite state machine design for low-power portable devices
Shiue W. Integration, the VLSI Journal 38(4): 549-570, 2005. Type: Article
Feb 17 2006
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy