An Efficient Flip-Flops Matching Engine - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2004

An Efficient Flip-Flops Matching Engine

Abstract

Generic algorithms for sequential equivalence checking are computationally expensive because they are based on state space traversal. This is the main reason why commercial tools often use combinational equivalence checking techniques to verify sequential designs. This approach consists in identifying potential equivalent flip- flops or nets in the two designs under verification. This is called the matching step. Due to sequential optimizations performed during synthesis, which can remove, merge, replicate or retime flip-flops, this matching step can be very complex and incomplete. Moreover if the matching is incomplete, even if a fast and efficient SAT solver is used during the combinational equivalence-checking step, this kind of approach may fail. In this paper, we present a complete matching engine, which is able to handle optimized circuit and don’t care conditions. The efficiency of the proposed engine is confirmed by experimental results on retimed and optimized circuits.
Fichier principal
Vignette du fichier
D229.PDF (141.03 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00108773 , version 1 (23-10-2006)

Identifiers

  • HAL Id : lirmm-00108773 , version 1

Cite

Solaiman Rahim, Jerome Rampon, Bruno Rouzeyre, Lionel Torres. An Efficient Flip-Flops Matching Engine. DDECS'04: 7th IEEE International Workshop on Design and Diagnostics of Electronic Circuits and System, Apr 2004, Tatranska Lomnica, Slovakia. pp.105-113. ⟨lirmm-00108773⟩
92 View
157 Download

Share

Gmail Facebook X LinkedIn More