[1992] Proceedings 29th ACM/IEEE Design Automation Conference · 2003 · 19 citations · 4 references
EngineeringComputer EngineeringComputer ScienceDesign AutomationLow-power DesignTest DevelopmentBoolean AlgebraCombinational Logic DescriptionDesign For TestabilityDigital Logic DesignLogic SynthesisLookup TablesAdder DesignAddersCarry-lookahead LogicCombinational Circuit VerificationCombinational Logic DesignCombinational Logic SynthesisMulti-level Logic DesignTransformations
Logic transformations that preserve minimal or complete test sets of a combinational circuit are examined. Some basic transformation types are rigorously defined and characterized with respect to test-set preservation. The authors apply the transformations to adder design and show that any complete test set for a two-level adder is preserved on transformation to ripple-carry and carry-lookahead designs, thus verifying some recent simulation results.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
4