Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

DecompositionofBooleanexpressionisoneofthepowerfultoolstooptimizeareaandcostof

circuitsimplementedusingtheseexpressions.BiDecompositionisasubsetofdecomposition
techniqueassociatedwithbooleandecomposition,whereinthebooleanexpressionis
decomposedintotwoparts.Thesesubexpressionsareconnectedthroughabooleanoperator,
suchasAND,OR,XORetc.Thefollowingfigureillustratesthedecompositionstechniques
usingbothalgebraicandbooleanmodels:

ANDInvertGraphs(AIGs):AIGs,likeBDDs,aredatastructuresusedtorepresentboolean
expressions.ConversionofanylogicalfunctionintoAIGisfastandscalable.AIGmakesuseof
onlyANDandNOTgatestorepresentanybooleanfunctions.AIGsofferauniqueadvantagein
thedomainofbooleandecompositionbymakingitpossibleforthe

abctooltoexploit
propertieslike

fraiging,strashingetc.

BooleanSatisfiability:BooleanSatisfiabilityorSATisaproblemofdeterminingifthereexists
asolutionthatsatisfiesagivenbooleanformula.Aclassofsolvers,calledSATsolvers,take
booleanexpressionsinConjunctiveNormalForm(CNF)andreturnanassignmentofvariables
withwhichtheexpressionevaluatestoTRUE.Ifthereexistsnosuchassignmenttotheboolean
expression,thesolverreturnsUNSATorunsatisfiable.MostofNPcomplexproblemsare
convertibletoSAT.

ItispossibletoconvertaBooleanBiDecompositionproblemintoaSATproblem

Whatarewegoingtodo


CraigInterpolantsfromminisat

You might also like