Computation of signal output probability for Boolean functions represented by OBDD

DOI10.1016/J.CAMWA.2003.08.004MaRDI QIDQ1767902zbMATH OpenOpenAlexFDO

Authors Yingtao Jiang, Yuke Wang, Xiaoyu Song, Yvon Savaria

Publication date 8 March 2005

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2003.08.004

zbMATH Keywords

OBDDBooleanordered binary decision diagramInteger arithmeticOutput probability

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Boolean functions (06E30)

Recommendations

• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 1948534
• A combinatorial method for the evaluation of probabilities of complex Boolean functions
• Exact OBDD bounds for some fundamental functions
• Probabilistic verification of Boolean functions

Cites work

• Binary Decision Diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• Probabilistic Treatment of General Combinational Networks
• Technology mapping for low power in logic synthesis

Cited in

(1)

• Output-signal processing algorithms in statistical checking of logic circuits

This page was built for publication: Computation of signal output probability for Boolean functions represented by OBDD

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