In order to build complex digital logic circuits it is often essential to sub-divide multi million transistors design into manageable pieces. Circuit partitioning in VLSI, is one of the major area of research. There are many existing diverse algorithm to partition the circuit into sub circuits. This paper aims at circuit partitioning using two classification algorithms Decision Tree Algorithm and K-Nearest Neighbors Algorithm. These two algorithms were tested on a 3-bit Priority Encoder and a 4x2 SRAM sample circuits and implemented using VHDL. The tested result shows that the K-Nearest Neighbor algorithm yields better subcircuits than the Decision Tree Algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.