• DocumentCode
    2205166
  • Title

    Minimization Algorithm of Unate Logic Functions

  • Author

    Jianlin, Qiu ; Xiang, Gu ; Fen, Li ; Dan, Ji ; Peng, He

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Nantong Univ., Nantong, China
  • fYear
    2010
  • fDate
    June 29 2010-July 1 2010
  • Firstpage
    2940
  • Lastpage
    2945
  • Abstract
    Unate logic functions is an especially case of logic functions. For logic functions optimization, it costs more spaces and times, spending of memory is increase on two power by input variables. According by characteristic of unate logic functions, this paper introduces an algorithm of unate logic functions optimization and presents a method of algorithm realization. It analyzes influence factor of unate functions logic optimization efficiency. The software system overpasses the testing of right validate. The results of experimentation is proved to be correct and efficient. It is good for reduce spending of memory spaces and times. Optimizing of effect is reduced by increasing numbers of input variable in case of the same numbers of output variable, products and don´t-care gene, and by increasing numbers of don´t-care on case of the same numbers of input variable, output variable and products. The optimizing of effect is increased by increasing numbers of products on case of the same numbers of input variable, output variable and don´t care gene.
  • Keywords
    Boolean algebra; formal logic; optimisation; algorithm realization; input variable numbers; logic functions optimization; minimization algorithm; software system; unate logic functions; Computers; Input variables; Logic functions; Optimization; Redundancy; Software systems; Testing; Algorithm; Complement Sets; Essential Prime Implicants; Minimization; Unate Logic Functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
  • Conference_Location
    Bradford
  • Print_ISBN
    978-1-4244-7547-6
  • Type

    conf

  • DOI
    10.1109/CIT.2010.491
  • Filename
    5578498