Theoretical Computer Science
New algorithms for min-cut replication in partitioned circuits
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Replication for logic bipartitioning
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Performance-driven multi-FPGA partitioning using functional clustering and replication
DAC '98 Proceedings of the 35th annual Design Automation Conference
On the crossing distribution problem
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A novel VLSI layout fabric for deep sub-micron applications
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Cell replication and redundancy elimination during placement for cycle time optimization
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Timing optimization of FPGA placements by logic replication
Proceedings of the 40th annual Design Automation Conference
Non-Crossing OBDDs for Mapping to Regular Circuit Structures
ICCD '03 Proceedings of the 21st International Conference on Computer Design
Automatic cell placement for quantum-dot cellular automata
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
Proceedings of the 41st annual Design Automation Conference
An approach to placement-coupled logic replication
Proceedings of the 41st annual Design Automation Conference
The effects of a new technology on the design, organization, and architectures of computing systems
The effects of a new technology on the design, organization, and architectures of computing systems
QCADesigner: a rapid design and Simulation tool for quantum-dot cellular automata
IEEE Transactions on Nanotechnology
The crossing distribution problem [IC layout]
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Using CAD to shape experiments in molecular QCA
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Clocking structures and power analysis for nanomagnet-based logic devices
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Molecular QCA design with chemically reasonable constraints
ACM Journal on Emerging Technologies in Computing Systems (JETC)
A layout-aware physical design method for constructing feasible QCA circuits
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Modeling and Evaluating Errors Due to Random Clock Shifts in Quantum-Dot Cellular Automata Circuits
Journal of Electronic Testing: Theory and Applications
DNA origami as self-assembling circuit boards
UC'10 Proceedings of the 9th international conference on Unconventional computation
System-level energy and performance projections for nanomagnet-based logic
NANOARCH '09 Proceedings of the 2009 IEEE/ACM International Symposium on Nanoscale Architectures
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On approximating the maximum simple sharing problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximating the maximum sharing problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses on molecular quantum-dot cellular automata circuits. For these circuits, it is very difficult for chemists to fabricate wire crossings (at least in the near future). A novel technique is introduced to remove wire crossings in a given circuit to facilitate the self assembly of real circuits - thus providing meaningful and functional design targets for both physical and computer scientists. The technique eliminates all wire crossings with minimal logic gate/node duplications. Experimental results based on existing QCA circuits and other benchmarks are quite encouraging, and suggest that further investigation is needed.