View article

Reni Banov

2020

20th Central European Conference on Cryptology

14-15

Computing Minimal DNF of Boolean Functions for Digital Implementations Page 1 Computing Minimal DNF of Boolean Functions for Digital Implementations Computing Minimal DNF of Boolean Functions for Digital Implementations Reni Banov Zagreb University of Applied Sciences 20th Central European Conference on Cryptology, June 2020 Page 2 Computing Minimal DNF of Boolean Functions for Digital Implementations Introduction Table of Contents 1 Introduction 2 Binary Decision Diagrams 3 New ordering heuristic 4 Conclusion Page 3 Computing Minimal DNF of Boolean Functions for Digital Implementations Introduction Introduction Modern communication systems impose strong constraints to digital circuit implementation of the Boolean function, such as reliability performance cost security Notice Constraints do not always appear in this order of importance. A possible solution is to minimize the Boolean …