Combinational Logic Circuit Design with the Buchberger Algorithm

Simple item page
dc.creatorDrolet, Germain
dc.date2006-05-26
dc.date.accessioned2026-07-07T07:09:35Z
dc.date.available2026-07-07T07:09:35Z
dc.descriptionWe 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.
dc.description15 pages, 1 table
dc.identifierhttps://arxiv.org/abs/cs/0605125
dc.identifierhttp://arxiv.org/abs/cs/0605125
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111119
dc.subjectHardware Architecture
dc.subjectB.1.2
dc.titleCombinational Logic Circuit Design with the Buchberger Algorithm
dc.typetext

Files

Collections

arXiv