Circuit minimization method validated by the xilinx technology and system generator experiments

With the rising challenges in the construction of integrated circuits (ICs), the development of circuit computing systems and their management has become indispensable for the minimization of IC design. These minimized designs strongly influence the modeling of circuit design and circuit analysis. Not only complex mechanisms (NP-completeness) that regulate circuit minimization have been intensively studied for years now, but also a level of abstraction that allows to answer that the minimum circuit size problem (MCSP) is not in P has been also been intensively studied. In this paper, we propose an innovative modeling approach of Boolean function that can handle circuit minimization. This is achieved by considering a Boolean function as an n×m matrix and applying the matrix on specific bit vectors. Using this approach and exploiting the computational power of matrix computations leads to circuit minimization. Our results shows advantages over the existing state-of-the-art methods and will help design future ICs.