English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In technology mapping, enumeration of subcircuits or cuts to be replaced by astandard cell is an important step that decides both the quality of thesolution and execution speed. In this work, we view cuts as set of edgesinstead of as set of nodes and based on it, provide a classification of cuts.It is shown that if enumeration is restricted to a subclass of cuts calledunidirectional cuts, the quality of solution does not degrade. We also showthat such cuts are equivalent to a known class of cuts called strong line cutsfirst proposed in [14]. We propose an efficient enumeration method based on anovel graph pruning algorithm that utilizes network flow to approximate minimumstrong line cut. The runtimes for the proposed enumeration method are shown tobe quite practical for enumeration of a large number of cuts.

Efficient Enumeration of Unidirectional Cuts for Technology Mapping of Boolean Networks