Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

DAC
1994
ACM

favoriteEmaildiscussreport

166views Computer Architecture» more DAC 1994»

Boolean Matching Using Generalized Reed-Muller Forms

13 years 8 months ago

Boolean Matching Using Generalized Reed-Muller Forms

Download www.cs.york.ac.uk

-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis tool. Input permutation, as well as input and output negation for matching are handled simultaneously. To reduce the search space for input correspondence, we have developed a method that can detect symmetries of any number of inputs simultaneously. Experiments on MCNC benchmark circuits are very encouraging.

Chien-Chung Tsai, Malgorzata Marek-Sadowska

Real-time Traffic

Boolean Matching | Canonical Generalized Reed-muller | Computer Architecture | DAC 1994 | Input |

claim paper

Related Content

» Complementary Sets Generalized ReedMuller Codes and Power Control for OFDM

» A FourierAnalytic Approach to ReedMuller Decoding

» Overcoming glitches and dissipation timing skews in design of DPAresistant cryptographic h...

» A new canonical form for fast boolean matching in logic synthesis and verification

» Building a better Boolean matcher and symmetry detector

» Improved SATbased Boolean matching using implicants for LUTbased FPGAs

» The Optimality of a Fast CNF Conversion and its Use with SAT

» A Solver for QBFs in Nonprenex Form

» Efficient SAT solving for nonclausal formulas using DPLL graphs and watched cuts

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	DAC
Authors	Chien-Chung Tsai, Malgorzata Marek-Sadowska

Comments (0)