• DocumentCode
    3627011
  • Title

    Input Variable Partitioning Method for Functional Decomposition of Functions Specified by Large Truth Tables

  • Author

    Pawel Morawiecki;Mariusz Rawski;Henry Selvaraj

  • Author_Institution
    Kielce Univ. of Commerce, Kielce
  • Volume
    2
  • fYear
    2007
  • Firstpage
    164
  • Lastpage
    168
  • Abstract
    In this paper, a new input variable partitioning method for functional decomposition is presented. Efficiency of currently used decomposition algorithms is dependent on the size of decomposed functions. One of the crucial aspects of functional decomposition is the input variable partitioning. This synthesis method has important application in many fields of modern engineering and science. However the practical usefulness of decomposition-based methods for very complex systems is restricted by computational complexity and memory requirements of the existing algorithms. The paper presents many examples confirming that the proposed method leads to reduction in the computation time.
  • Keywords
    "Input variables","Partitioning algorithms","Computational complexity","Circuit synthesis","Combinational circuits","Algebra","Boolean functions","Computational intelligence","Application software","Business"
  • Publisher
    ieee
  • Conference_Titel
    Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on
  • Print_ISBN
    0-7695-3050-8
  • Type

    conf

  • DOI
    10.1109/ICCIMA.2007.349
  • Filename
    4426688