default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th ARITH 2022: Lyon, France
- 29th IEEE Symposium on Computer Arithmetic, ARITH 2022, Lyon, France, September 12-14, 2022. IEEE 2022, ISBN 978-1-6654-7827-4
- Luca Bertaccini, Gianna Paulin
, Tim Fischer, Stefan Mach, Luca Benini:
MiniFloat-NN and ExSdotp: An ISA Extension and a Modular Open Hardware Unit for Low-Precision Training on RISC-V Cores. 1-8 - Jongwook Sohn, David K. Dean, Eric Quintana, Wing Shek Wong:
Enhanced Floating-Point Adder with Full Denormal Support. 1-8 - John Osorio Ríos, Adrià Armejach, Eric Petit, Greg Henry, Marc Casas:
A BF16 FMA is All You Need for DNN Training. 9 - Javier D. Bruguera:
Low-Latency and High-Bandwidth Pipelined Radix-64 Division and Square Root Unit. 10-17 - Carlos F. Borges, Claude-Pierre Jeannerod, Jean-Michel Muller:
High-level algorithms for correctly-rounded reciprocal square roots. 18-25 - Alexei Sibidanov, Paul Zimmermann, Stéphane Glondu:
The CORE-MATH Project. 26-34 - Samuel Coward, George A. Constantinides, Theo Drane:
Automatic Datapath Optimization using E-Graphs. 43-50 - Yves Durand, Eric Guthmuller, César Fuguet Tortolero, Jérôme Fereyre, Andrea Bocco, Riccardo Alidori:
Accelerating Variants of the Conjugate Gradient with the Variable Precision Processor. 51-57 - El-Mehdi El Arar, Devan Sohier, Pablo de Oliveira Castro, Eric Petit:
The Positive Effects of Stochastic Rounding in Numerical Algorithms. 58-65 - David Mallasén, Raul Murillo, Alberto A. Del Barrio, Guillermo Botella, Luis Piñuel, Manuel Prieto-Matías:
PERCIVAL: Open-Source Posit RISC-V Core With Quire Capability. 66 - Efstratios Zacharelos, Italo Nunziata, Gerardo Saggese, Antonio G. M. Strollo, Ettore Napoli:
Approximate Recursive Multipliers Using Low Power Building Blocks. 67 - Teodor-Dumitru Ene, James E. Stine:
Point-Targeted Sparseness and Ling Transforms on Parallel Prefix Adder Trees. 68-75 - Mark G. Arnold:
Towards Quantum Logarithm Number Systems. 76-83 - Fangan-Yssouf Dosso, Jean-Marc Robert, Pascal Véron:
PMNS for efficient arithmetic and small memory cost. 84 - Nicolas Méloni:
An Alternative Approach to Polynomial Modular Number System Internal Reduction. 85 - Laurent-Stéphane Didier, Jean-Marc Robert, Fangan-Yssouf Dosso, Nadia El Mrabet:
A software comparison of RNS and PMNS. 86-93 - Daichi Aoki, Kazuhiko Minematsu, Toshihiko Okamura, Tsuyoshi Takagi:
Efficient Word Size Modular Multiplication over Signed Integers. 94-101 - Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth:
Generating Very Large RNS Bases. 102 - Aurélien Greuet, Simon Montoya, Clémence Vermeersch:
Quotient Approximation Modular Reduction. 103-110 - Malek Safieh, Fabrizio De Santis:
Efficient Reduction Algorithms for Special Gaussian Integer Moduli. 111-119 - David M. Russinoff, Javier D. Bruguera, Cuong Chau, Mayank Manjrekar, Nicholas Pfister, Harsha Valsaraju:
Formal Verification of a Chained Multiply-Add Design: Combining Theorem Proving and Equivalence Checking. 120-126 - Louise Ben Salem-Knapp, Sylvie Boldo, William Weens:
Bounding the Round-Off Error of the Upwind Scheme for Advection. 127 - David Monniaux, Alice Pain:
Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic. 128-132
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-28 22:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
