Parallel Stochastic Computing Architecture for Computationally Intensive Applications

10Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Stochastic computing requires random number generators to generate stochastic sequences that represent probability values. In the case of an 8-bit operation, a 256-bit length of a stochastic sequence is required, which results in latency issues. In this paper, a stochastic computing architecture is proposed to address the latency issue by employing parallel linear feedback shift registers (LFSRs). The proposed architecture reduces the latency in the stochastic sequence generation process without losing accuracy. In addition, the proposed architecture achieves area efficiency by reducing 69% of flip-flops and 70.4% of LUTs compared to architecture employing shared LFSRs, and 74% of flip-flops and 58% of LUTs compared to the architecture applying multiple LFSRs with the same computational time.

Cite

CITATION STYLE

APA

Kim, J., Jeong, W. S., Jeong, Y., & Lee, S. E. (2023). Parallel Stochastic Computing Architecture for Computationally Intensive Applications. Electronics (Switzerland), 12(7). https://doi.org/10.3390/electronics12071749

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free