Nature

Routing Algorithms in VLSI Design

Routing algorithms in VLSI design form the backbone of interconnect synthesis, ensuring that circuit elements are connected efficiently while conforming to strict physical and timing constraints.
NextBigFuture

Algorithm that is 10 to 100 times faster than state of the art for determining the optimal circuit block shape in VLSI fixed-outline floor-planning

– Obtain optimal solutions for both MCNC & HB benchmarks simply by the basic SDS. – For MCNC benchmarks, 253x faster than Young’s, 33x faster than Lin’s, to produce results of similar quality. * Embed ...
Design-Reuse

VLSI Based On Two-Dimensional Reconfigurable Array Of Processor Elements And Theirs Implementation For Numerical Algorithms In Real-Time Systems

High-speed data processing based upon special-purpose processors is one of the basic directions in the development of computer systems for real-time systems. Reconfigurable processor arrays containing ...
TechRepublic

Reordering Algorithm for Minimizing Test Power in VLSI Circuits

Power consumption has become a crucial concern in Built-In Self-Test (BIST) due to the switching activity in the Circuit Under-Test (CUT). In this paper, the authors present a novel method which aims ...
Nature

Routing Algorithms and Optimization Techniques in VLSI Design

Routing algorithms and optimisation techniques are fundamental to the evolution of Very Large-Scale Integration (VLSI) design. As chip complexity increases, the need to efficiently connect millions of ...