On the design methodology of Boolean functions with quantum-dot cellular automata for reducing delay and number of wire crossings
| Autor: | Masoumeh Tahmasebi, Reza Faghih Mirzaee, Seyyed Hossein Pishgar Komleh |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
Transistor Quantum dot cellular automaton 02 engineering and technology 021001 nanoscience & nanotechnology Multiplexer Atomic and Molecular Physics and Optics Cellular automaton 020202 computer hardware & architecture Electronic Optical and Magnetic Materials law.invention Compact space law Modeling and Simulation Hardware_INTEGRATEDCIRCUITS 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Arithmetic 0210 nano-technology Design methods Boolean function Hardware_LOGICDESIGN Electronic circuit |
| Zdroj: | Journal of Computational Electronics. 17:1756-1770 |
| ISSN: | 1572-8137 1569-8025 |
| DOI: | 10.1007/s10825-018-1219-4 |
| Popis: | Quantum-dot cellular automata (QCA) circuits are not based on transistors. Therefore, novel concepts and methodologies are required to be able to design Boolean functions in a systematic manner. Wire crossing is a problematic challenge in this technology, imposing considerable cost, complexity, and noise sensitivity. On the other hand, QCA circuits with multiple successive majority gates experience long delays. This paper deals with both problems. At first, some new diagrams are presented for the 13 standard functions, which are sufficient to represent all of the three-input Boolean functions. Some of the standard functions are designed with much fewer wire crossings in this paper compared with the previous designs. Then, with the aim of reducing delay, hierarchical multiplexers are merged together in order to generate wide Boolean functions with fewer layers of majority gates. Circuit compactness is based on some new merging rules. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink