Università di Pisa
Sistema bibliotecario di ateneo

Efficient Minimization of Fully Testable 2-SPP Networks

Bernasconi, Anna and Ciriani, Valentina and Drechsler, Rolf and Villa, Tiziano (2005) Efficient Minimization of Fully Testable 2-SPP Networks. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] PDF (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (211Kb)


    The paper presents a heuristic algorithm for the minimization of 2-SPP networks, i.e., three-level XOR-AND-OR forms with XOR gates restricted to fan-in 2. Previous works had presented exact algorithms for the minimization of unrestricted SPP networks and of 2-SPP networks. The exact minimization procedures were formulated as covering problems as in the minimization of SOP forms and had worst-case exponential complexity. Extending the expand-irredundant-reduce paradigm of ESPRESSO heuristic, we propose a minimization algorithm for 2-SPP networks that iterates local minimization and reshape of a solution until further improvement. We introduce also the notion of EXOR-irredundant to prove that OR-AND-EXOR irredundant networks are fully testable and guarantee that our algorithm yields OR-AND-EXOR irredundant solutions. We report a large set of experiments showing impressive high-quality results with affordable run times, handling also examples whose exact solutions could not be computed.

    Item Type: Book
    Uncontrolled Keywords: Logic synthesis
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 09 Dec 2014 12:48
    Last Modified: 09 Dec 2014 12:48
    URI: http://eprints.adm.unipi.it/id/eprint/2152

    Repository staff only actions

    View Item