Abstract

This paper presents a novel architecture for univariate radial basis kernel computation employing Stochastic Computing. The univariate radial basic function is optimized using simple stochastic logic circuits. We validated this approach by comparison with both Bernstein polynomial and two-dimensional finite-state-machine-based implementation. Optimally, the mean absolute error is reduced 40% and 80% compared to two other well-known approaches, Bernstein polynomial and two-dimensional finite-state-machine-based implementation, respectively. In terms of hardware cost, our proposed solution required as much as the Bernstein method did. Moreover, the proposed approach outperforms the two-dimensional finite-state-machine-based mplementation, roughly 54% less hardware cost. Regarding the critical path delay, the proposed approach is 12% less than others on average. Besides, our work also required 70% less power than two-dimensional finite-state-machine-based implementation.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.