Reduced ordered binary decision diagram optimization analysis representations and applications

Abstract

For decades representation of Boolean functions using Reduced newlineOrdered Binary Decision Diagrams ROBDD has been popular The newlineorder of variables in ROBDD is important since it affects the number newlineof nodes in the ROBDD A novel method of variable reordering for newlineROBDD has been proposed in this research work The proposed newlinemethod results in ROBDD with lesser number of nodes and lesser newlineAverage Path Length APL In this work the proposed variable newlineordering methods use the graph topology to find the optimal variable newlineordering therefore the input Boolean functions benchmark circuits newlineare converted to a unidirectional graph The variable order is found by newlinesubstituting the values of logic 1 and logic 0 for all the variables The newlinevariable that produces minimal sub graph is assigned as next variable newlinein variable order newline newline