A low complexity scaling method for the Lanczos Kernel in fixed-point arithmetic
- Submitting institution
-
Imperial College of Science, Technology and Medicine
- Unit of assessment
- 12 - Engineering
- Output identifier
- 263
- Type
- D - Journal article
- DOI
-
10.1109/TC.2013.162
- Title of journal
- IEEE Transactions on Computers
- Article number
- 2
- First page
- 303
- Volume
- 64
- Issue
- 2
- ISSN
- 0018-9340
- Open access status
- Out of scope for open access requirements
- Month of publication
- February
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
10.1109/TC.2013.162
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Fixed-point arithmetic has seen a resurgence of interest in recent years, primarily due to the growth in computational requirements demanding highly-efficient digital hardware. Some core linear algebra algorithms were thought to be out of reach to fixed-point arithmetic before this paper. This work contributed to a successful startup https://www.embotech.com/ by the lead author https://www.linkedin.com/in/juan-jerez and follow-on funding from the European Commission (TEMPO) https://cordis.europa.eu/project/rcn/109545/factsheet/en.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -