2006/05/26 by Germain Drolet, Drolet, Germain
Computer Science · #B.1.2 #FOS: Computer and information sciences #Hardware Architecture (cs.AR) #cs.AR
paper · pdf · doi:10.48550/arxiv.cs/0605125
15 pages, 1 table
arxiv created 2006/05/26 · arxiv updated 2009/12/01
We detail a procedure for the computation of the polynomial form of an electronic combinational circuit from the design equations in a truth table. The method uses the Buchberger algorithm rather than current traditional methods based on search algorithms. We restrict the analysis to a single output, but the procedure can be generalized to multiple outputs. The procedure is illustrated with the design of a simple arithmetic and logic unit with two 3-bit operands and two control bits.