Biconditional-BDD Ordering for Autosymmetric Functions

Bernasconi, Anna; Ciriani, Valentina; Trucco, Gabriella

doi:10.1109/dsd.2015.49

Cited by 2 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we briefly review some basic notions and results on switching lattices [1,6,37] and autosymmetric Boolean functions [9,10,24,25,26,27,38].…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

Composition of switching lattices for regular and for decomposed functions

Bernasconi

Ciriani

Frontini

et al. 2018

Microprocessors and Microsystems

Self Cite

View full text Add to dashboard Cite

Multi-terminal switching lattices are typically exploited for modeling switching nano-crossbar arrays that lead to the design and construction of emerging nanocomputers. Typically, the circuit is represented on a single lattice composed by fourterminal switches. In this paper, we propose a two-layer model in order to further minimize the area of regular functions, such as autosymmetric and D-reducible functions, and of decomposed functions. In particular, we propose a switching lattice optimization method for a special class of "regular" Boolean functions, called autosymmetric functions. Autosymmetry is a property that is frequent enough within Boolean functions to be interesting in the synthesis process. Each autosymmetric function can be synthesized through a new function (called restriction), depending on less variables and with a smaller on-set, which can be computed in polynomial time. In this paper we describe how to exploit the autosymmetry property of a Boolean function in order to obtain a smaller lattice representation in a reduced minimization time. The original Boolean function can be constructed through a composition of the restriction with some EXORs of subsets of the input variables. Similarly, the lattice implementation of the function can be constructed using some external lattices for the EXORs, whose outputs will be inputs to the lattice implementing the restriction. Finally, the output of the restriction lattice corresponds to the output of the original function. Experimental results show that the total area of the obtained lattices is often significantly reduced. Moreover, in many cases, the computational time necessary to minimize the restriction is smaller than the time necessary to perform the lattice synthesis of the entire function. Finally, we propose the application of this particular lattice composition technique, based on connected multiple lattices, to the synthesis on switching lattices of D-reducible Boolean functions, and to the more general framework of Preprint submitted to Embedded Hardware Design (Microprocessors and Microsystems)November 12, 2019 lattice synthesis based on logic function decomposition.

show abstract

“…In this section we briefly review some basic notions and results on switching lattices [1,6,37] and autosymmetric Boolean functions [9,10,24,25,26,27,38].…”

Section: Preliminariesmentioning

confidence: 99%

“…In this section we briefly review autosymmetric functions that are introduced in [38] and further studied in [9,10,24,25,26,27]. For the description of these particular regular functions we need to summarize several concepts of Boolean algebra [33].…”

Section: Autosymmetric Boolean Functionsmentioning

confidence: 99%

Composition of switching lattices for regular and for decomposed functions

Bernasconi

Ciriani

Frontini

et al. 2018

Microprocessors and Microsystems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this section we briefly review some basic notions and results on switching lattices [1], [4], [20] and autosymmetric Boolean functions [6], [7], [10], [11], [12], [13], [21].…”

Section: Preliminariesmentioning

confidence: 99%

“…In this section we briefly review autosymmetric functions that are introduced in [21] and further studied in [6], [7], [10], [11], [12], [13]. For the description of these particular regular functions we need to summarize several concepts of Boolean algebra [16].…”

Section: B Autosymmetric Boolean Functionsmentioning

confidence: 99%

Composition of Switching Lattices and Autosymmetric Boolean Function Synthesis

Bernasconi

Ciriani

Frontini

et al. 2017

2017 Euromicro Conference on Digital System Design (DSD)

Self Cite

View full text Add to dashboard Cite

Multi-terminal switching lattices are typically exploited for modeling switching nano-crossbar arrays that lead to the design and construction of emerging nanocomputers. In this paper we propose a switching lattice optimization method for a special class of "regular" Boolean functions, called autosymmetric functions. Autosymmetry is a property that is frequent enough within Boolean functions to be interesting in the synthesis process. Each autosymmetric function can be synthesized through a new function (called restriction), depending on less variables and with a smaller onset , which can be computed in polynomial time. In this paper we describe how to exploit the autosymmetry property of a Boolean function in oder to obtain a smaller lattice representation in a reduced minimization time. The original Boolean function can be constructed through a composition of the restriction with some EXORs of subsets of the input variables. Similarly, the lattice implementation of the function can be constructed using some external lattices for the EXORs, whose outputs will input the lattice implementing the restriction. Finally, the output of the restriction lattice corresponds to the output of the original function. Experimental results show that the total area of the obtained lattices is often significantly reduced. Moreover, in many cases, the computational time necessary to minimize the restriction is smaller than the time necessary to perform the lattice synthesis of the entire function.

show abstract

Biconditional-BDD Ordering for Autosymmetric Functions

Cited by 2 publications

References 23 publications

Composition of switching lattices for regular and for decomposed functions

Composition of switching lattices for regular and for decomposed functions

Composition of Switching Lattices and Autosymmetric Boolean Function Synthesis

Contact Info

Product

Resources

About