VLSI Complexity Reduction by Piece-Wise Approximation of the Sigmoid Function

Valeriu Beiu, Jan A. Peperstraete, Joos Vandewalle, Rudy Lauwereins

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

    Abstract

    The paper is devoted to show that there are simple and accurate ways to compute a sigmoid nonlinearity in digital h ardware by piece-wise linearization. This is done as the computations involved are complex, but even more interesting, for the data compression performed by the sigmoid, which can half the number of Boolean functions to be further implemented. We detail such an approximation algorithm, and analyze its ac curacy, showing im- provements over the previous known algorithms. The algorithm uses only ad - ditions/subtractions and shifts (multiplications by powers of 2), supporting our claim of "simplicity".
    Original languageEnglish
    Title of host publicationEuropean Symposium on Artificial Neural Networks
    Publication statusPublished - Apr 20 1994
    EventESANN'94 - Brussels, Belgium
    Duration: Apr 20 1994 → …

    Conference

    ConferenceESANN'94
    Period4/20/94 → …

    Fingerprint

    Dive into the research topics of 'VLSI Complexity Reduction by Piece-Wise Approximation of the Sigmoid Function'. Together they form a unique fingerprint.

    Cite this