Zobrazeno 1 - 10
of 103
pro vyhledávání: '"William N. N. Hung"'
A Canonical-Based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature
Publikováno v:
IEEE Access, Vol 5, Pp 27777-27785 (2017)
This paper presents a new compact canonical-based algorithm to solve the problem of single-output completely specified input negation and/or input permutation and/or output negation Boolean matching. We propose a new signature vector Boolean differen
Externí odkaz:
https://doaj.org/article/654f2739d02c4f9c9f6683bd94eab096
Publikováno v:
Symmetry, Vol 11, Iss 1, p 27 (2018)
In this paper, we address an NPN Boolean matching algorithm. The proposed structural difference signature (SDS) of a Boolean function significantly reduces the search space in the Boolean matching process. The paper analyses the size of the search sp
Externí odkaz:
https://doaj.org/article/6c6f62c530e74d278aa226e3405b1fd8
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
This paper considers a hybrid I/O automata model for an automated guided vehicle (AGV) system. A set of key properties of an AGV system are characterized for the correctness of the system. An abstract model is constructed from the hybrid automata mod
Externí odkaz:
https://doaj.org/article/1921cddefd2f40e49462efa8ad6be529
Autor:
Tao Wang, William N. N. Hung
Publikováno v:
Journal of Applied Mathematics, Vol 2013 (2013)
Mobile ad hoc networks (MANETs) are gaining popularity in recent years due to their flexibility, the proliferation of smart computing devices, and developments in wireless communications. Due to the mobile nature of the network, creating reliable clu
Externí odkaz:
https://doaj.org/article/bd72bf208aed43208d3889bfdac3aa49
Publikováno v:
Journal of Applied Mathematics, Vol 2013 (2013)
Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to the model c
Externí odkaz:
https://doaj.org/article/a90a69f7eecb4ebf8a0ed84a71926483
Publikováno v:
Theory of Computing Systems. 63:1278-1297
The classification of Boolean functions plays an underpinning role in logic design and synthesis of VLSI circuits. This paper considers a underpinning question in Boolean function classification: how many distinct classes are there for k-input Boolea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf122d7c57c84da1befe0513d67fe698
https://doi.org/10.1007/s00224-018-9903-0
https://doi.org/10.1007/s00224-018-9903-0
Publikováno v:
Cluster Computing. 22:7491-7506
An efficient pairwise Boolean matching algorithm for solving the problem of matching single-output specified Boolean functions under input negation and/or input permutation and/or output negation (NPN) is proposed in this paper. We present the struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c03ddc544f4ca48735ab15090bfd6cc8
https://doi.org/10.1007/s10586-018-1787-x
https://doi.org/10.1007/s10586-018-1787-x
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 65:66-70
Dynamic verification is widely used to ensure the logical correctness of system design. Verification progress is usually gauged by coverage metrics. Most coverage metrics measure the sub-structures of design under verification that are exercised. Mor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5ec3109ad2e5646f99fe1e94b8785c2
https://doi.org/10.1109/tcsii.2017.2746744
https://doi.org/10.1109/tcsii.2017.2746744
Publikováno v:
IEEE Transactions on Computers. 65:3606-3616
Affine equivalence classification of Boolean functions has significant applications in logic synthesis and cryptography. Previous studies for classification have been limited by the large set of Boolean functions and the complex operations on the aff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d120bbf2618904aec82eb66ed2050238
https://doi.org/10.1109/tc.2016.2557329
https://doi.org/10.1109/tc.2016.2557329
Publikováno v:
IEEE Transactions on Computers. 65:3217-3223
Automatic hardware/software partitioning relies on characterization, estimation and design space exploration of the system performance and cost metrics. In real world situations, such estimates are complicated and cannot be 100 percent accurate. Furt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73e2d8e6333c75f6598bd5c4630f4afa
https://doi.org/10.1109/tc.2016.2519895
https://doi.org/10.1109/tc.2016.2519895