DocumentCode
2889911
Title
Computer arithmetic structures for quantum cellular automata
Author
Walus, K. ; Jullien, G.A. ; Dimitrov, V.S.
Author_Institution
Electr. & Comput. Eng., Calgary Univ., Alta., Canada
Volume
2
fYear
2003
fDate
9-12 Nov. 2003
Firstpage
1435
Abstract
In this paper, we discuss arithmetic structures based on quantum cellular automata (QCA). By taking advantage of the unique capabilities of QCA we are able to design interesting computational architectures. We describe important design considerations and show how addition and multiplication circuits can be implemented using QCADesigner, a QCA design tool which has been developed in our laboratory. QCA technology allows, among other things, the implementation of majority boolean gates and interconnecting "wires" that support cross-overs on the same fabrication level. One of the important challenges with QCA design is working within a different cost function from standard transistor circuits. These differences arise from the device level latching inherent in QCA. This latching makes the total delay of a circuit directly proportional to the maximum number of clocking zones between input and output and the number of gates.
Keywords
adders; cellular automata; delays; flip-flops; multiplying circuits; transistor circuits; addition circuit; arithmetic structure; boolean gate; computational architecture; cost function; device level latching; multiplication circuit; quantum cellular automata; standard transistor circuit; Clocks; Computer architecture; Cost function; Delay; Digital arithmetic; Fabrication; Integrated circuit interconnections; Laboratories; Quantum cellular automata; Wires;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 2004. Conference Record of the Thirty-Seventh Asilomar Conference on
Print_ISBN
0-7803-8104-1
Type
conf
DOI
10.1109/ACSSC.2003.1292223
Filename
1292223
Link To Document