Nano Science and Technology Institute
Nanotech 2005 Vol. 3
Nanotech 2005 Vol. 3
Technical Proceedings of the 2005 NSTI Nanotechnology Conference and Trade Show, Volume 3
 
Chapter 3: Nano Devices and Architectures
 

Three-Dimensional Logic Architecture by Four-terminal Electrical Switches (FES) beyond Two-dimensional CMOS Architecture

Authors:S. Fujita, K. Abe and T.H. Lee
Affilation:Stanford University, US
Pages:213 - 216
Keywords:three-dimensional, post-CMOS, memory, switching device, logic
Abstract:The technology expected after the lithography limit to keep increasing the number of transistors is thought to be either use of new transistors such as CNT by bottom-up process or three-dimensional (3D) architecture. We have proposed a new concept of 3D architecture using four-terminal electrical switches (FES), which can replace CMOS logic without bottom-up process. FES can be realized by modifying two-terminal nonvolatile memory devices, such as solid electrolyte memory using chalcogenide, phase change memory or electrical mechanical CNT memory. Since pass transistor logic and NOT-logic is also possible, all kinds of CMOS logic can be built by 3D-stacked FES logic gates. Although switching speed of FES is slower than CMOS by over one order, extremely wider parallel data path due to 3D can be used than that for 2D-CMOS logic by more than two orders. Logic data can flow not only horizontally but also vertically in the case of 3D circuit of FES Also, FES logic acts as nonvolatile logic, which is much promising in terms of decreasing power consumption for LSI, since power supply can be shut down for non-operating logic blocks. Thus 3D FES logic architecture has strong possibility to become superior to CMOS logic in future.
Three-Dimensional Logic Architecture by Four-terminal Electrical Switches (FES) beyond Two-dimensional CMOS ArchitectureView PDF of paper
ISBN:0-9767985-2-2
Pages:786
Hardcopy:$109.95
 
Order:Mail/Fax Form
Up
© 2014 Nano Science and Technology Institute. All Rights Reserved.
Terms of Use | Privacy Policy | Contact Us | Site Map