Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Rupesh S. Shelar"'
Autor:
Rupesh S. Shelar
Publikováno v:
FPGA
Logic replication is often necessary to improve speed of emulation for systems employing field programmable gate arrays (FPGAs), since design sizes are large enough requiring partitioning to fit a design into multiple (boards of) FPGAs. In this paper
Autor:
Marek Patyra, Rupesh S. Shelar
Publikováno v:
ISPD
In nanometer technologies, even local interconnects are believed to cause major impact on timing, power, repeaters, and routability in VLSI circuits. Although empirical studies exist, there is little comprehensive work that explores the impact of loc
Autor:
Rupesh S. Shelar
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 31:1781-1786
Clocks are known to be major source of power consumption in digital circuits. In this paper, we propose a clustering algorithm for the minimization of power in a local clock tree. Given a set of sequentials and their locations, clustering is performe
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 30:416-426
Technology mapping and placement have a significant impact on delays in standard cell-based very large scale integrated circuits. Traditionally, these steps are applied separately to optimize the delays, possibly since efficient algorithms that allow
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 25:625-636
Routing congestion has become a serious concern in today's very-large-scale-integration designs. To address this, the authors propose a technology mapping algorithm that minimizes routing congestion under delay constraints in this paper. The algorith
Autor:
Sachin S. Sapatnekar, Rupesh S. Shelar
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 13:957-970
We address the problem of synthesizing pass transistor logic (PTL), with the specific objective of delay reduction, through binary decision diagram (BDD) decomposition. The decomposition is performed by mapping the BDD to a network flow graph, and th
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 24:696-710
Due to increasing design complexities, routing congestion has become a critical problem in very large scale integration designs. This paper introduces a distributed metric to predict routing congestion and applies it to technology mapping that target
Autor:
Rupesh S. Shelar
Publikováno v:
ISPD
In modern microprocessors, clocks are usually distributed employing a hybrid network, grid followed by buffered trees, to restrict the skew. This is typically done employing (gated) buffered trees inside the blocks, while the global grid overlay the
Delay-optimal simultaneous technology mapping and placement with applications to timing optimization
Publikováno v:
2008 IEEE/ACM International Conference on Computer-Aided Design.
Autor:
Rupesh S. Shelar
Publikováno v:
ISPD
Clocks are known to be major source of power consumption in digital circuits, especially in high performance microprocessors. With the technology scaling, the increasingly capacitive interconnects contribute to more than 40% of the local clock power.