Technology mapping of speed-independent circuits based on combinational decomposition and resynthesis
Jordi Cortadella, Michael Kishinevsky, A. Kondratyev, Luciano Lavagno, Alex Yakovlev
Abstract
Jordi Cortadella, Michael Kishinevsky, A. Kondratyev, Luciano Lavagno, Alex Yakovlev
Abstract
This paper presents a solution to the problem of sequential multi#level logic synthesis of asynchronous speed#independent circuits. The starting point is a technology#independent speed#independent circuit ob# tained using# e.g.# the monotonous cover conditions. We describe an algorithm for the factorization of this circuit aimed at implementing it in a given standard cell library# while preserving speed#independence. The algorithm exploits known e#cient factorization tech# niques from combinational multi#level logic synthesis# but achieves also boolean simpli#cation. Experimen# tal results show a signi#cant improvement in terms of number and complexity of solvable circuits with respect to existing methods. 1 Introduction Recentyears have seen a revival of interest in the sub#class of asynchronous circuits called speed# independent circuits. Such circuits have been char# acterized by Muller in his seminal paper #9#asbe# ing hazard#free using the unbounded gate delay model . Even thou...
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents a solution to the problem of sequential multi#level logic synthesis of asynchronous speed#independent circuits. The starting point is a technology#independent speed#independent circuit ob# tained using# e.g.# the monotonous cover conditions. We describe an algorithm for the factorization of this circuit aimed at implementing it in a given standard cell library# while preserving speed#independence. The algorithm exploits known e#cient factorization tech# niques from combinational multi#level logic synthesis# but achieves also boolean simpli#cation. Experimen# tal results show a signi#cant improvement in terms of number and complexity of solvable circuits with respect to existing methods. 1 Introduction Recentyears have seen a revival of interest in the sub#class of asynchronous circuits called speed# independent circuits. Such circuits have been char# acterized by Muller in his seminal paper #9#asbe# ing hazard#free using the unbounded gate delay model . Even thou...
Key concepts: Combinational logic, Boolean circuit, Asynchronous circuit, Computer science, Asynchronous communication, Sequential logic, Logic synthesis, Logic optimization