Repository logo
  • Log In
    Log in via Symplectic to deposit your publication(s).
Repository logo
  • Communities & Collections
  • Research Outputs
  • Statistics
  • Log In
    Log in via Symplectic to deposit your publication(s).
  1. Home
  2. Faculty of Engineering
  3. Faculty of Engineering - Research Data
  4. JianyiCheng/HLS-benchmarks: HLS_Benchmarks_First_Release
 
  • Details
JianyiCheng/HLS-benchmarks: HLS_Benchmarks_First_Release
Author(s)
Cheng, Jianyi
Type
Software / Code
Abstract
First release of my HLS benchmarks. The benchmarks include:
gSum sums a number of polynomial results from the array elements that meet the given conditions where the difference between two elements from the arrays is non-negative.
gSumIf is similar to gSum but the SS function returns one of two polynomial expressions based on the value of the difference.
sparseMatrixPower performs dot product of two matrices, which skips the operation when the weight is zero.
histogram sums various weight onto the corresponding features but also in a sparse form.
getTanh performs the approximated function tanh(x) onto an array of integers using the CORDIC algorithm and a polynomial function.
getTanh(double) is similar to getTanh but uses an array of doubles.
BNNKernel is a small BNN kernel with LUT function as XOR.
Version
1
Date Issued
2019-12-03
Citation
2019
URI
http://hdl.handle.net/10044/1/76679
URL
https://github.com/JianyiCheng/HLS-benchmarks/tree/v1.0
DOI
http://doi.org/10.5281/zenodo.3561115
Copyright Statement
http://www.opensource.org/licenses/GPL-2.0
Subjects
HLS-benchmarks
About
Spiral Depositing with Spiral Publishing with Spiral Symplectic
Contact us
Open access team Report an issue
Other Services
Scholarly Communications Library Services
logo

Imperial College London

South Kensington Campus

London SW7 2AZ, UK

tel: +44 (0)20 7589 5111

Accessibility Modern slavery statement Cookie Policy

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback