Pin-Count and Wire Length Optimization for Electrowetting-on-Dielectric Chips: A Metaheuristics-Based Routing Algorithm

Author(s):  
Mohamed Ibrahim ◽  
Cherif Salama ◽  
M. Watheq El-Kharashi ◽  
Ayman Wahba
2013 ◽  
Vol 2013 ◽  
pp. 1-24
Author(s):  
Emna Amouri ◽  
Habib Mehrez ◽  
Zied Marrakchi

The wave dynamic differential logic (WDDL) has been identified as a promising countermeasure to increase the robustness of cryptographic devices against differential power attacks (DPA). However, to guarantee the effectiveness of WDDL technique, the routing in both the direct and complementary paths must be balanced. This paper tackles the problem of unbalance of dual-railsignals in WDDL design. We describe placement techniques suitable for tree-based and mesh-based FPGAs and quantify the gain they confer. Then, we introduce a timing-balance-driven routing algorithm which is architecture independent. Our placement and routing techniques proved to be very promising. In fact, they achieve a gain of 95%, 93%, and 85% in delay balance in tree-based, simple mesh, and cluster-based mesh architectures, respectively. To reduce further the switch and delay unbalance in Mesh architecture, we propose a differential pair routing algorithm that is specific to cluster-based mesh architecture. It achieves perfectly balanced routed signals in terms of wire length and switch number.


1993 ◽  
Vol 03 (03) ◽  
pp. 269-289 ◽  
Author(s):  
DOROTHEA WAGNER

We present a new channel routing algorithm in the knock-knee mode that produces for dense problems area-optimal layouts with minimum total wire length and [Formula: see text] bends (n number of nets), where the total number of bends is at most d−2 (d density) more than the minimum. The running time is [Formula: see text]. It thus improves the algorithm in Formann et al.,3 which determines area-optimal layouts with minimum total wire length in [Formula: see text] time, where the number of bends is Ω(n2). Moreover, the algorithm can be modified so as to guarantee three-layer wirable layouts, where the total wire length is at most n−2 more than the minimum. The approach we use is completely different from all previously known algorithms. It is based on the notion of cycle graphs introduced in this paper.


2008 ◽  
Vol 2 (2) ◽  
Author(s):  
Michael J. Cucinotta ◽  
Courtney E. LeBlon ◽  
Nima Rahimi ◽  
Manish Paliwal

Objective: To design an external fixator for femoral fracture reduction with improved angulation and adjustability, reduced bulk, and comparative stiffness. Background: The use of external fixator for femoral shaft fixators in children has been a device of choice. The use though satisfactory, the occurrences of wire∕pin tract infections has been widely reported. Moreover, The use of Ilizarov external fixator in adults has been limited due to its bulk. Hence there is a need for improvement on the current external fixators for femoral fractures. Methods: The finite element models of four-ring Ilizarov and hybrid two-ring fixators were developed. These designs were improved upon by incorporating a “modular sliding joint design,” and by reducing the bulk by reducing the number of rings and adding guide plates. Wire length optimization feature was also added in the design. Axial stiffness of the new design was compared with the hybrid design using finite element analysis (FEA). Results and Discussion: The new design has reduced bulk at the proximal region allowing its application in adults. The axial stiffness of the proposed design was found to be comparable with the two-ring hybrid design, as determined from FEA. Sliding joint design allows reduced inventory, quick assembly, and improved angulation over current designs. Wire length optimization may reduce the occurrences of wire tract infections.


1997 ◽  
Vol 473 ◽  
Author(s):  
J. A. Davis ◽  
J. D. Meindl

ABSTRACTOpportunities for Gigascale Integration (GSI) are governed by a hierarchy of physical limits. The levels of this hierarchy have been codified as: 1) fundamental, 2) material, 3) device, 4) circuit and 5) system. Many key limits at all levels of the hierarchy can be displayed in the power, P, versus delay, td, plane and the reciprocal length squared, L-2, versus response time, τ, plane. Power, P, is the average power transfer during a binary switching transition and delay, td, is the time required for the transition. Length, L, is the distance traversed by an interconnect that joins two nodes on a chip and response time, τ, characterizes the corresponding interconnect circuit. At the system level of the hierarchy, quantitative definition of both the P versus td and the L-2 versus τ displays requires an estimate of the complete stochastic wiring distribution of a chip.Based on Rent's Rule, a well known empirical relationship between the number of signal input/output terminals on a block of logic and the number of gate circuits with the block, a rigorous derivation of a new complete stochastic wire length distribution for an on-chip random logic network is described. This distribution is compared to actual data for modern microprocessors and to previously described distributions. A methodology for estimating the complete wire length distribution for future GSI products is proposed. The new distribution is then used to enhance the critical path model that determines the maximum clock frequency of a chip; to derive a preliminary power dissipation model for a random logic network; and, to define an optimal architecture of a multilevel interconnect network that minimizes overall chip size. In essence, a new complete stochastic wiring distribution provides a generic basis for maximizing the value obtained from a multilevel interconnect technology.


2011 ◽  
Vol E94-B (6) ◽  
pp. 1625-1629
Author(s):  
Atsufumi MORIYAMA ◽  
Hiroshi ISHINISHI ◽  
Katsuichi NAKAMURA ◽  
Yoshiaki HORI

2015 ◽  
Vol E98.B (8) ◽  
pp. 1715-1724 ◽  
Author(s):  
Zhu TANG ◽  
Chunqing WU ◽  
Zhenqian FENG ◽  
Wanrong YU ◽  
Baokang ZHAO ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document