An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n / ( 1 + ( n - 1 ) 2 - m ) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n/(1+(n-1)2^{-m})$$\end{document} times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR function with n input variables.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Minimisation of Exclusive-OR Logic Functions


    Contributors:

    Published in:

    Publication date :

    2021-09-20


    Size :

    8 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Implementing Exclusive-OR Logic

    Hough, M. E. | NTRS | 1983



    Minimisation de l'immunosuppression

    Thervet, E. | British Library Conference Proceedings | 2001


    Boat speed minimisation system

    PIETSCH HOWARD CHARLES | European Patent Office | 2017

    Free access

    BOAT SPEED MINIMISATION SYSTEM

    PIETSCH HOWARD CHARLES | European Patent Office | 2015

    Free access