A novel graphical technique for combinational logic representation and optimization

DOI10.1155/2017/9696342MaRDI QIDQ680814zbMATH OpenOpenAlexFDO

Authors Vedhas Pandit, Björn W. Schuller

Publication date 29 January 2018

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/9696342

zbMATH Keywords

combinatorial optimizationbinary decision diagrams (BDDs)discrete systemscombinational logic representationdigital functionsgraphical techniqueKarnaugh-maps (K-maps)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete-time control/observation systems (93C55)

Recommendations

• Suggestion for a new representation for binary function
• Representations of Boolean functions
• scientific article; zbMATH DE number 910723
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 512939

Cites work

• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• A Way to Simplify Truth Functions
• Abstract interpretation using typed decision graphs
• Automatic Sequences
• Binary Decision Diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• Reconfigurable asynchronous logic automata (RALA)
• The Problem of Simplifying Truth Functions

Cited in

(3)

• FCA in a logical programming setting for visualization-oriented graph compression
• Fractals in logic
• Karnaugh maps of logical systems and applications in digital circuit design

This page was built for publication: A novel graphical technique for combinational logic representation and optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680814)