A. Gupta and Allen L. Fisher. Tradeoffs in canonical sequential function representations. In Proceedings of the IEEE International Conference on Computer Design, October 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....[8, 16] have presented methods that exploit this kind of regularity. In [16] parameterized circuits are not described as such. Instead, the automaton model is inferred by observing the behavior of circuits for n = 1; 2 : until some technical conditions indicate a fixed point. Alternatively [8, 9] identify classes of parameterized circuits that can be described by recursive BDD tree structures which, for certain classes, correspond to finite automata. While these techniques are novel and can be very effective, they have their drawbacks. In particular, circuits must be encoded directly as ....

A. Gupta and Allen L. Fisher. Tradeoffs in canonical sequential function representations. In Proceedings of the IEEE International Conference on Computer Design, October 1994.

....[8, 16] have presented methods that exploit this kind of regularity. In [16] parameterized circuits are not described as such. Instead, the automaton model is inferred by observing the behavior of circuits for n = 1; 2 : until some technical conditions indicate a fixed point. Alternatively [8, 9] identify classes of parameterized circuits that can be described by recursive BDD tree structures which, for certain classes, correspond to finite automata. While these techniques are novel and can be very effective, they have their drawbacks. In particular, circuits must be encoded directly as ....

A. Gupta and Allen L. Fisher. Tradeoffs in canonical sequential function representations. In Proceedings of the IEEE International Conference on Computer Design, October 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC