2002 · 28 citations · 12 references
EngineeringComputer EngineeringComputer ScienceField-programmable Gate ArraysHardware Description LanguagesReconfigurable ComputingDesign SynthesisDigital Logic DesignField-programmable Gate Array ArchitectureFpga ArchitectureLogic SynthesisLookup TablesBoolean Function DecompositionBoolean Function RepresentationBoolean FunctionsCombinational Logic SynthesisField-programmable Gate Arrays (Fpgas)Input VariablesLookup Table DesignStacked Charts
Presents two Boolean methods for identifying common subfunctions from multiple-output functions. The first method is based on encoding the distinct columns in the stacked decomposition chart of the multiple-output function; the second method is based on the examination and encoding of all possible subfunctions that can be generated from a function with respect to a given subset of input variables. We then apply these methods to the synthesis of lookup-table based field programmable gate arrays. Experimental results are very encouraging.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
12
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text