Optimization of Circuits Using a Constructive Learning Algorithm

Valeriu Beiu

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    The paper presents an application of a constructive learning algorithm to optimization of circuits. For a given Boolean function f. a fresh constructive learning algorithm builds circuits belonging to the smallest F{sub n,m} class of functions (n inputs and having m groups of ones in their truth table). The constructive proofs, which show how arbitrary Boolean functions can be implemented by this algorithm, are shortly enumerated An interesting aspect is that the algorithm can be used for generating both classical Boolean circuits and threshold gate circuits (i.e. analogue inputs and digital outputs), or a mixture of them, thus taking advantage of mixed analogue/digital technologies. One illustrative example is detailed The size and the area of the different circuits are compared (special cost functions can be used to closer estimate the area and the delay of VLSI implementations). Conclusions and further directions of research are ending the paper.
    Original languageEnglish
    Title of host publicationInternational Conference on Engineering Applications of Neural Networks
    Publication statusPublished - Dec 31 1997
    EventEANN'97 - Stockholm, Sweden
    Duration: Jun 16 1997 → …


    Period6/16/97 → …


    Dive into the research topics of 'Optimization of Circuits Using a Constructive Learning Algorithm'. Together they form a unique fingerprint.

    Cite this