Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter Oldenbourg May 10, 2022

Approximating stochastic numbers to reduce latency

  • Syoki Kawaminami

    Syoki Kawaminami received the B.E. degree in Information Science and Engineering from Ritsumei University in 2021. He is currently a graduate student of Graduate School of Information Science and Engeneering. Ritsumeikan University, Shiga, Japan. His research interests include how to use stochastic numbers for approximate computing.

    , Yukino Watanabe

    Yukino Watanabe received the B.E. and the M.E. degrees in Information Science and Engineering from Ritsumeikan University in 2017 and 2019, respectively. She is currently with Procurement Planning Division, Department of Procurement Management, ATLA, Japan.

    and Shigeru Yamashita

    Shigeru Yamashita is a professor at the Department of Computer Science, College of Information Science and Engineering, Ritsumeikan University. He received his B.E., M.E. and Ph.D. degrees in Information Science from Kyoto University, Kyoto, Japan, in 1993, 1995 and 2001, respectively. His research interests include new types of computation and logic synthesis for them. He received the 2000 IEEE Circuits and Systems Society Transactions on Computer Aided Design of Integrated Circuits and Systems Best Paper Award, SASIMI 2010 Best Paper Award, 2010 IPSJ Yamashita SIG Research Award, and 2010 Marubun Academic Achievement Award of the Marubun Research Promotion Foundation. He is a senior member of IEEE, and a member of ACM and IPSJ.

    EMAIL logo

Abstract

Approximate Computing (AC) and Stochastic Computing (SC) have been studied as new computing paradigms to achieve energy-efficient designs for error-tolerant applications. The hardware cost of SC generally can be small compared to that of AC, but SC has not been applied to a wide range of applications as AC because SC needs very long cycles to use long random bit strings called Stochastic Numbers (SNs) when we need to maintain the desired precision. To mitigate this disadvantage of SC, we propose a new idea to approximate numbers represented by SNs; our idea is to use multiple SNs to represent one number. Indeed our method can shorten the length of SNs drastically while keeping the precision level compared to conventional SNs. We study two specific cases where we use two and three shorter bit-strings to represent a single conventional SN, which we call a dual-rail and a triple-rail SNs, respectively. We also discuss a general case when we use many SNs corresponding to a single conventional SNs. We also compare triple-rail, dual-rail and conventional SNs in terms of hardware overhead and calculation errors in this paper. From the comparison, we can conclude that our idea can be used to shorten the necessary cycles for SC.

ACM CCS:

About the authors

Syoki Kawaminami

Syoki Kawaminami received the B.E. degree in Information Science and Engineering from Ritsumei University in 2021. He is currently a graduate student of Graduate School of Information Science and Engeneering. Ritsumeikan University, Shiga, Japan. His research interests include how to use stochastic numbers for approximate computing.

Yukino Watanabe

Yukino Watanabe received the B.E. and the M.E. degrees in Information Science and Engineering from Ritsumeikan University in 2017 and 2019, respectively. She is currently with Procurement Planning Division, Department of Procurement Management, ATLA, Japan.

Shigeru Yamashita

Shigeru Yamashita is a professor at the Department of Computer Science, College of Information Science and Engineering, Ritsumeikan University. He received his B.E., M.E. and Ph.D. degrees in Information Science from Kyoto University, Kyoto, Japan, in 1993, 1995 and 2001, respectively. His research interests include new types of computation and logic synthesis for them. He received the 2000 IEEE Circuits and Systems Society Transactions on Computer Aided Design of Integrated Circuits and Systems Best Paper Award, SASIMI 2010 Best Paper Award, 2010 IPSJ Yamashita SIG Research Award, and 2010 Marubun Academic Achievement Award of the Marubun Research Promotion Foundation. He is a senior member of IEEE, and a member of ACM and IPSJ.

References

1. BR Gaines. Stochastic computing systems. Advances in information systems science, pp. 37–172, 1969.10.1007/978-1-4899-5841-9_2Search in Google Scholar

2. Armin Alaghi and John P. Hayes. Survey of stochastic computing. ACM Trans. Embed. Comput. Syst., Vol. 12, No. 2s, pp. 92:1–92:19, May 2013.10.1145/2465787.2465794Search in Google Scholar

3. Armin Alaghi, Cheng Li, and John P. Hayes. Stochastic circuits for real-time image-processing applications. In Proceedings of the 50th Annual Design Automation Conference, pp. 136:1–136:6, 2013.10.1145/2463209.2488901Search in Google Scholar

4. Kyounghoon Kim, Jungki Kim, Joonsang Yu, Jungwoo Seo, Jongeun Lee, and Kiyoung Choi. Dynamic energy-accuracy trade-off using stochastic computing in deep neural networks. In Proceedings of the 53rd Annual Design Automation Conference, pp. 124:1–124:6, 2016.Search in Google Scholar

5. Peng Li and David J. Lilja. Using stochastic computing to implement digital image processing algorithms. In Proceedings of the 2011 IEEE 29th International Conference on Computer Design, ICCD’11, Washington, DC, USA, pp. 154–161, IEEE Computer Society, 2011.Search in Google Scholar

6. Zhiheng Wang, Naman Saraf, Kia Bazargan, and Arnd Scheel. Randomness meets feedback: Stochastic implementation of logistic map dynamical system. In Proceedings of the 52Nd Annual Design Automation Conference, DAC’15, New York, NY, USA, pp. 132:1–132:7, ACM, 2015.10.1145/2744769.2744898Search in Google Scholar

7. Shoichi Iizuka, Masafumi Mizuno, Dan Kuroda, Masanori Hashimoto, and Takao Onoye. Stochastic error rate estimation for adaptive speed control with field delay testing. In Proceedings of the International Conference on Computer-Aided Design, ICCAD’13, Piscataway, NJ, USA, pp. 107–114, IEEE Press, 2013.10.1109/ICCAD.2013.6691105Search in Google Scholar

8. Yin Liu and Keshab K Parhi. Computing hyperbolic tangent and sigmoid functions using stochastic logic. In 2016 50th Asilomar Conference on Signals, Systems and Computers, pp. 1580–1585. IEEE, 2016.10.1109/ACSSC.2016.7869645Search in Google Scholar

9. Bradley D. Brown and Howard C. Card. Stochastic neural computation i: Computational elements. IEEE Trans. Comput., Vol. 50, No. 9, pp. 891–905, September 2001.10.1109/12.954505Search in Google Scholar

10. Vincent C Gaudet and Anthony C Rapley. Iterative decoding using stochastic computation. Electronics Letters, Vol. 39, No. 3, pp. 299–301, 2003.10.1049/el:20030217Search in Google Scholar

11. J. Han and M. Orshansky. Approximate computing: An emerging paradigm for energy-efficient design. 2013 18th IEEE European Test Symposium (ETS), pp. 1–6, 2013.10.1109/ETS.2013.6569370Search in Google Scholar

12. R. Seva, P. Metku, K. K. Kim, Y. Kim and M. Choi. Approximate stochastic computing (ASC) for image processing applications. 2016 International SoC Design Conference (ISOCC), pp. 31–32, 2016.10.1109/ISOCC.2016.7799758Search in Google Scholar

Received: 2021-09-01
Revised: 2022-03-24
Accepted: 2022-04-24
Published Online: 2022-05-10
Published in Print: 2022-06-27

© 2022 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 28.4.2024 from https://www.degruyter.com/document/doi/10.1515/itit-2021-0041/html
Scroll to top button