Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGA

Han, Song, Kang, Junlong, Mao, Huizi, Hu, Yiming, Li, Xin, Li, Yubin, Xie, Dongliang, Luo, Hong, Yao, Song, Wang, Yu, Yang, Huazhong, Dally, William (Bill) J. · 2017 · Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

Abstract

Long Short-Term Memory (LSTM) is widely used in speech recognition. In order to achieve higher prediction accuracy, machine learning scientists have built increasingly larger models. Such large model is both computation intensive and memory intensive. Deploying such bulky model results in high power consumption and leads to a high total cost of ownership (TCO) of a data center. To speedup the prediction and make it energy efficient, we first propose a load-balance-aware pruning method that can compress the LSTM model size by 20x (10x from pruning and 2x from quantization) with negligible loss of the prediction accuracy. The pruned model is friendly for parallel processing. Next, we propose a scheduler that encodes and partitions the compressed model to multiple PEs for parallelism and schedule the complicated LSTM data flow. Finally, we design the hardware architecture, named Efficient Speech Recognition Engine (ESE) that works directly on the sparse LSTM model.

Overview

Integrity signals

Registry

Crossref · 10.1145/3020078.3021745

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

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.

Citations

Cites

Show all 21 references

Research works printed but not linked: 2

  1. A. Hannun , C. Case , J. Casper , B. Catanzaro , G. Diamos , E. Elsen , R. Prenger , S. Satheesh , S. Sengupta , A. Coates , and A. Ng . Deep speech: Scaling up end-to-end speech recognition. arXiv, preprint arXiv:1412.5567 , 2014 . A. Hannun, C. Case, J. Casper, B. Catanzaro, G. Diamos, E. Elsen, R. Prenger, S. Satheesh, S. Sengupta, A. Coates, and A. Ng. Deep speech: Scaling up end-to-end speech recognition. arXiv, preprint arXiv:1412.5567, 2014. · arXiv
  2. M. Lee , K. Hwang , J. Park , S. Choi , S. Shin , and W. Sung . Fpga-based low-power speech recognition with recurrent neural networks. arXiv preprint arXiv:1610.00552 , 2016 . M. Lee, K. Hwang, J. Park, S. Choi, S. Shin, and W. Sung. Fpga-based low-power speech recognition with recurrent neural networks. arXiv preprint arXiv:1610.00552, 2016. · arXiv

Cited by

See all 637

Metadata

Authors
Han, S., Kang, J., Mao, H., Hu, Y., Li, X., Li, Y., Xie, D., Luo, H., Yao, S., Wang, Y., Yang, H., & Dally, W. (. J.
Affiliations
  • Stanford University (US)
  • DeePhi, Beijing, China
  • Tsinghua University (CN)
  • Stanford University & NVIDIA, Stanford, USA
Venue
Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays
Publisher
ACM
Published
2017-02-22
Pages
75-84
OpenAlex
W2585720638
Cited by
591
References
21
Citations by year
2026: 18 · 2025: 27 · 2024: 34 · 2023: 37 · 2022: 63 · 2021: 85 · 2020: 110 · 2019: 109 · 2018: 83 · 2017: 25
FWCI
26.14
Type
conference paper
Language
es
Open access
closed
Locations
ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) (publishedVersion)
Funders
National Natural Science Foundation of China (61261160501, 61373026, 61622403)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
Keywords
speech recognition, LSTM, model compression, pruning, quantization, load balancing, parallel computing, hardware architecture, energy efficiency

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGA. https://app.cochat.ai/papers/10.1145/3020078.3021745
The paper
Han, S., Kang, J., Mao, H., Hu, Y., Li, X., Li, Y., Xie, D., Luo, H., Yao, S., Wang, Y., Yang, H., & Dally, W. (. J. (2017). ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGA. Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays. https://doi.org/10.1145/3020078.3021745

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.