Cited by 115Numerical Methods and AlgorithmsAdvanced Neural Network ApplicationsLow-power high-performance VLSI design

Efficient Precision-Adjustable Architecture for Softmax Function in Deep Learning

Zhu, Danyang, Lu, Siyuan, Wang, Meiqi, Lin, Jun, Wang, Zhongfeng·2020·IEEE Transactions on Circuits and Systems II: Express Briefs

Abstract

The softmax function has been widely used in deep neural networks (DNNs), and studies on efficient hardware accelerators for DNN have also attracted tremendous attention. However, it is very challenging to design efficient hardware architectures for softmax because of the expensive exponentiation and division calculations in it. In this brief, the softmax function is firstly simplified by exploring algorithmic strength reductions. Afterwards, a hardware-friendly and precision-adjustable calculation method for softmax is proposed, which can meet different precision requirements in various deep learning (DL) tasks. Based on the above innovations, an efficient architecture for softmax is presented. By tuning the parameter P , the system accuracy and complexity can be adjusted dynamically to achieve a good tradeoff between them. The proposed design is coded using hardware description language (HDL) and evaluated on two platforms, Xilinx Zynq-7000 ZC706 development board and TSMC 28-nm CMOS technology, respectively. Hardware implementation results show that our architecture significantly outperforms other works in speed and area, and that by adjusting P , the accuracy can be further increased with little hardware overhead.

Integrity signals

Registry

Crossref · 10.1109/tcsii.2020.3002564

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Various approximation methods that hold floating-point arithmetic lower certain computational costs but cannot meet the demands of integer arithmetic.

    “In addition, various approximation methods that hold floating-point arithmetic are presented [36, 50]; while they lower certain computational costs, they cannot meet the demands of integer arithmetic.”

Cited by

Sorted by citations

Authors
Zhu, D., Lu, S., Wang, M., Lin, J., & Wang, Z.
Affiliations
Nanjing University (CN)
Venue
IEEE Transactions on Circuits and Systems II: Express Briefs
Published
2020-12
Volume
67
Issue
12
Pages
3382-3386
ISSN
  • 1549-7747 (ISSN-L)
  • 1558-3791
OpenAlex
W3036061420
Cited by
115
References
0
Citations by year
2026: 12 · 2025: 33 · 2024: 26 · 2023: 25 · 2022: 12 · 2021: 5 · 2020: 2
FWCI
5.45
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Circuits & Systems II Express Briefs (publishedVersion)
Funders
  • National Natural Science Foundation of China (61774082, 61604068)
  • Fundamental Research Funds for the Central Universities (021014380065)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Numerical Methods and Algorithms
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Low-power high-performance VLSI design
Keywords
softmax, hardware accelerators, accuracy-complexity trade-off, deep neural network hardware, FPGA implementation, CMOS implementation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review