LUTIN: Efficient Neural Network Inference with Table Lookup
Abstract
References
Index Terms
- LUTIN: Efficient Neural Network Inference with Table Lookup
Recommendations
Routability-driven technology mapping for lookup table-based FPGA's
A new algorithm for technology mapping of lookup table-based Field-Programmable Gate Arrays (FPGA's) is presented. It has the capability of producing compact designs (minimizing the number of cells (CLB's)), as well as the flexibility of trading ...
Weightless Neural Networks for Efficient Edge Inference
PACT '22: Proceedings of the International Conference on Parallel Architectures and Compilation TechniquesWeightless neural networks (WNNs) are a class of machine learning model which use table lookups to perform inference, rather than the multiply-accumulate operations typical of deep neural networks (DNNs). Individual weightless neurons are capable of ...
A New Look-Up Table Approach for High-Speed Finite Field Multiplication
ISED '11: Proceedings of the 2011 International Symposium on Electronic System DesignThis paper presents a new high-speed multiplier over GF(2^m) based on look-up table (LUT) approach. A straight-forward LUT-based multiplication requires a table of size (m x 2^m) bits for the Galois field of order m which is quite large for the fields ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- Chair:
- Pascal Meinerzhagen,
- Program Chair:
- Kapil Dev,
- Program Co-chair:
- Jerald Yoo
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE CAS
- IEEE EDA
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 143Total Downloads
- Downloads (Last 12 months)143
- Downloads (Last 6 weeks)44
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in