Scalable Bit Partitioning for Hybrid Random Number Generation in Parallel Stochastic Computing

Stochastic computing (SC) allows error tolerance design and the ability to perform complex binary operations using simple digital logic circuits, advantageous for low-power design. However, it requires a longer computation time for higher accuracy. To address this, we propose a novel random number generator (RNG) that produces multiple random numbers simultaneously, reducing computation time through parallel processing while achieving lower hardware resource consumption compared to conventional parallel RNG. Our design uses fixed upper bits and a single RNG to generate multiple random numbers in parallel. This approach demonstrates computation speeds up to 64 times faster than conventional methods while reducing area and power by up to 68.2% and 81.9%, respectively, when implemented in 65-nm CMOS technology. Furthermore, we prove the efficacy of our proposed design in digital image processing applications.

Authors

Publication Details

Journal
JSTS Journal of Semiconductor Technology and Science
Published
2025-08-26
DOI
https://doi.org/10.5573/jsts.2025.25.4.363
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Bit Partitioning for Hybrid Random Number Generation in Parallel Stochastic Computing

Dong-Hui Lee, Yongtae Kim
1 links
JSTS Journal of Semiconductor Technology and Science
Error Correcting Code Techniques
article

Scalable Bit Partitioning for Hybrid Random Number Generation in Parallel Stochastic Computing

Dong-Hui Lee, Yongtae Kim
article en

Abstract

Stochastic computing (SC) allows error tolerance design and the ability to perform complex binary operations using simple digital logic circuits, advantageous for low-power design. However, it requires a longer computation time for higher accuracy. To address this, we propose a novel random number generator (RNG) that produces multiple random numbers simultaneously, reducing computation time through parallel processing while achieving lower hardware resource consumption compared to conventional parallel RNG. Our design uses fixed upper bits and a single RNG to generate multiple random numbers in parallel. This approach demonstrates computation speeds up to 64 times faster than conventional methods while reducing area and power by up to 68.2% and 81.9%, respectively, when implemented in 65-nm CMOS technology. Furthermore, we prove the efficacy of our proposed design in digital image processing applications.

JSTS Journal of Semiconductor Technology and ScienceVol. 25(4)
Openalex Percentile: Top 75%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.