Zobrazeno 1 - 7
of 7
pro vyhledávání: '"H.J. Touati"'
Autor:
Robert K. Brayton, H.J. Touati
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 12:157-162
Retiming is an optimization technique for sequential circuits which consists in modifying the position of latches relative to blocks of combinational logic in order to minimize the maximum propagation delay between latches or to meet a given delay re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c04d01d31b34c1f55812d2f751dd9a52
https://doi.org/10.1109/43.184852
https://doi.org/10.1109/43.184852
Publikováno v:
ICCAD
The authors propose a novel technology-independent algorithm to minimize circuit delay. The algorithm works in two steps. The first step performs a partial collapse of the circuit based on a delay-driven clustering. The second step factorizes and sim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb3106cc4f7ac5bea46b906583c5840b
https://doi.org/10.1109/iccad.1991.185227
https://doi.org/10.1109/iccad.1991.185227
Publikováno v:
ICCAD
An algorithm for computing local don't cares (in terms of immediate fanin variables) at each intermediate node of a Boolean network is presented. These don't cares can be directly used for the simplification of each node by a two-level minimizer. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be4f174033acbc33df56eab92465ff07
https://doi.org/10.1109/iccad.1991.185319
https://doi.org/10.1109/iccad.1991.185319
Publikováno v:
ICCAD
Scopus-Elsevier
Scopus-Elsevier
The authors propose a novel method based on transition relations that only requires the ability to compute the BDD (binary decision diagram) for f/sub i/ and outperforms O. Coudert's (1990) algorithm for most examples. The method offers a simple nota
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::547708cbc70a14aa1d1faf9262ec5cd6
https://doi.org/10.1109/iccad.1990.129860
https://doi.org/10.1109/iccad.1990.129860
Publikováno v:
ICCAD
The authors address the problem of computing sequential don't cares that arise in the context of multi-level sequential networks and their use in sequential logic synthesis. The key to their approach is the use of binary decision diagram (BDD)-based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ca09adbd860162fa2b0eadfc1aba6f7
https://doi.org/10.1109/iccad.1990.129940
https://doi.org/10.1109/iccad.1990.129940
Publikováno v:
Computer Aided Verification ISBN: 9783540564966
One method for proving properties about a design is by using L-automata [Kur90]. The main computation involves building the product machine of the system and specification, and then checking for cycles not contained in any of the cycle sets (these ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::646e429e48a35581beea2b1cff3a3463
https://doi.org/10.1007/3-540-56496-9_31
https://doi.org/10.1007/3-540-56496-9_31
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.