Sciweavers

10 search results - page 1 / 2
» QCA channel routing with wire crossing minimization
Sort
View
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
14 years 19 days ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim
ICCAD
2005
IEEE
93views Hardware» more  ICCAD 2005»
14 years 3 months ago
Eliminating wire crossings for molecular quantum-dot cellular automata implementation
— When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses...
Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, M...
DATE
2006
IEEE
103views Hardware» more  DATE 2006»
14 years 1 months ago
Novel designs for thermally robust coplanar crossing in QCA
In this paper, different circuit arrangements of Quantumdot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. These arrangements exploit the majority votin...
Sanjukta Bhanja, Marco Ottavi, Fabrizio Lombardi, ...
VLSID
2002
IEEE
120views VLSI» more  VLSID 2002»
14 years 7 months ago
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoi...
GLVLSI
2007
IEEE
186views VLSI» more  GLVLSI 2007»
13 years 7 months ago
Block placement to ensure channel routability
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...
Shigetoshi Nakatake, Zohreh Karimi, Taraneh Taghav...