arrow
Volume 2, Issue 1
Multi-level Sequential Circuit Partitioning for Delay Minimization of VLSI Circuits

J. Info. Comput. Sci. , 2 (2007), pp. 66-70.

Export citation
  • Abstract
Sequential graph partitioning algorithms have been developed to fulfill the requirements of emerging multi-phase problems in circuit delay models. In this paper we propose a heuristic algorithm for k- partition, which minimizes the circuit delay and cut size. Experimental results with MCNC benchmark circuits have shown that the delay in the circuit can be reduced by marginally in comparison with the other algorithms [2,3,11].
  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-2-66, author = {}, title = {Multi-level Sequential Circuit Partitioning for Delay Minimization of VLSI Circuits}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {2}, number = {1}, pages = {66--70}, abstract = { Sequential graph partitioning algorithms have been developed to fulfill the requirements of emerging multi-phase problems in circuit delay models. In this paper we propose a heuristic algorithm for k- partition, which minimizes the circuit delay and cut size. Experimental results with MCNC benchmark circuits have shown that the delay in the circuit can be reduced by marginally in comparison with the other algorithms [2,3,11]. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22822.html} }
TY - JOUR T1 - Multi-level Sequential Circuit Partitioning for Delay Minimization of VLSI Circuits AU - JO - Journal of Information and Computing Science VL - 1 SP - 66 EP - 70 PY - 2024 DA - 2024/01 SN - 2 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22822.html KW - Graph Partition, Circuit Partition and Delay minimization. AB - Sequential graph partitioning algorithms have been developed to fulfill the requirements of emerging multi-phase problems in circuit delay models. In this paper we propose a heuristic algorithm for k- partition, which minimizes the circuit delay and cut size. Experimental results with MCNC benchmark circuits have shown that the delay in the circuit can be reduced by marginally in comparison with the other algorithms [2,3,11].
. (2024). Multi-level Sequential Circuit Partitioning for Delay Minimization of VLSI Circuits. Journal of Information and Computing Science. 2 (1). 66-70. doi:
Copy to clipboard
The citation has been copied to your clipboard