23rd IEEE Symposium on Computer Arithmetic ARITH 23. Santa Clara, California, July 2016
|
|
|
- Brian Alexander
- 6 years ago
- Views:
Transcription
1 23rd IEEE Symposium on Computer Arithmetic ARITH 23 Santa Clara, California, July 2016 Editors: Paolo Montuschi, Michael Schulte, Javier Hormigo, Stuart Oberman, and Nathalie Revol CONFERENCE INFORMATION PAPERS BY SESSION PAPERS BY AUTHOR GETTING STARTED TRADEMARKS SEARCH
2 Conference Information 2016 IEEE 23nd Symposium on Computer Arithmetic Foreword Committees Reviewers Keynote Talks and Special Sessions Title Page (Book version) Copyright Page (Book version) Table of Contents (Book version) Author Index (Book version) Publisher s Information (Book version)
3 Sessions Session 1: Arithmetic Units Session 2: Security and Cryptography (I) Session 3: Big Numbers Session 4: Accuracy and Reproducibility Session 5: Floating-Point Implementations Session 6: Less-conventional Number Systems (I) Session 7: Security and Cryptography (II) Session 8: Less-conventional Number Systems (II) Session 9: Logarithm Implementations
4 Papers by Session Session 1: Arithmetic Units Efficient Combinational Circuits for Division by Small Integer Constants H. Fatih Ugurdag, Anil Bayram, Vecdi Emre Levent, and Sezer Gören A Formulation of Fast Carry Chains Suitable for Efficient Implementation with Majority Elements Ghassem Jaberipur, Behrooz Parhami, and Dariush Abedi
5 Papers by Session Session 2: Security and Cryptography (I) Multi-fault Attack Detection for RNS Cryptographic Architecture Jean-Claude Bajard, Julien Eynard, and Nabil Merkiche A CRC-Based Concurrent Fault Detection Architecture for Galois/Counter Mode (GCM) Amir Ali Kouzeh Geran and Arash Reyhani-Masoleh
6 Papers by Session Session 3: Big Numbers Accelerating Big Integer Arithmetic Using Intel IFMA Extensions Shay Gueron and Vlad Krasnov A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions Jean-Michel Muller, Valentina Popescu, and Ping Tak Peter Tang Optimizing Modular Multiplication for NVIDIA s Maxwell GPUs Niall Emmart, Justin Luitjens, Charles Weems, and Cliff Woolley
7 Papers by Session Session 4: Accuracy and Reproducibility Verificarlo: Checking Floating Point Accuracy through Monte Carlo Arithmetic Christophe Denis, Pablo de Oliveira Castro, and Eric Petit Recovering Numerical Reproducibility in Hydrodynamic Simulations Philippe Langlois, Rafife Nheili, and Christophe Denis Correctly Rounded Arbitrary-Precision Floating-Point Summation Vincent Lefèvre
8 Papers by Session Session 5: Floating-Point Implementations Digit Recurrence Floating-Point Division under HUB Format Julio Villalba-Moreno Quad Precision Floating Point on the IBM z13 Cedric Lichtenau, Steven Carlough, and Silvia Melitta Mueller
9 Papers by Session Session 6: Less-conventional Number Systems (I) Accuracy and Performance Trade-Offs of Logarithmic Number Units in Multi-Core Clusters Michael Schaffner, Michael Gautschi, Frank K. Gürkaynak, and Luca Benini An Iterative Logarithmic Multiplier with Improved Precision Syed Ershad Ahmed, Sanket Kadam, and M. B. Srinivas
10 Papers by Session Session 7: Security and Cryptography (II) Hardware Implementation of AES Using Area-Optimal Polynomials for Composite-Field Representation GF(24)2 of GF(28) Shay Gueron and Sanu Mathew Random Digit Representation of Integers Nicolas Méloni and M. Anwar Hasan Hybrid Position-Residues Number System Karim Bigou and Arnaud Tisserand
11 Papers by Session Session 8: Less-conventional Number Systems (II) On-line Multiplication and Division in Real and Complex Bases Marta Brzicová, Christiane Frougny, Edita Pelantová, and Milena Svobodová Evaluating Straight-Line Programs over Balls Joris van der Hoeven and Grégoire Lecerf A Parallel Decimal Multiplier Using Hybrid Binary Coded Decimal (BCD) Codes Xiaoping Cui, Weiiang Liu, Dong Wenwen, and Fabrizio Lombardi
12 Papers by Session Session 9: Logarithm Implementations Computing floating-point logarithms with fixed-point operations Julien Le Maire, Nicolas Brunie, Florent de Dinechin, and Jean-Michel Muller Single Precision Natural Logarithm Architecture for Hard Floating-Point and DSP-Enabled FPGAs Martin Langhammer and Bogdan Pasca Automated Design of Floating-Point Logarithm Functions on Integer Processors Guillaume Revy
13 A Abedi, Dariush Ahmed, Syed Ershad B Bajard, Jean-Claude Bayram, Anil Benini, Luca Bigou, Karim Brunie, Nicolas Brzicová, Marta C Carlough, Steven Cui, Xiaoping d de Dinechin, Florent de Oliveira Castro, Pablo D Denis, Christophe E Emmart, Niall Eynard, Julien F Frougny, Christiane G Gautschi, Michael
14 Geran, Amir Ali Kouzeh Gören, Sezer Gueron, Shay Gürkaynak, Frank K. H Hasan, M. Anwar J Jaberipur, Ghassem K Kadam, Sanket Krasnov, Vlad L Langhammer, Martin Langlois, Philippe Le Maire, Julien Lecerf, Grégoire Lefèvre, Vincent Levent, Vecdi Emre Lichtenau, Cedric Liu, Weiiang Lombardi, Fabrizio Luitjens, Justin M Mathew, Sanu Méloni, Nicolas Merkiche, Nabil Mueller, Silvia Melitta Muller, Jean-Michel
15 N Nheili, Rafife P Parhami, Behrooz Pasca, Bogdan Pelantová, Edita Petit, Eric Popescu, Valentina R Revy, Guillaume Reyhani-Masoleh, Arash S Schaffner, Michael Srinivas, M. B. Svobodová, Milena T Tang, Ping Tak Peter Tisserand, Arnaud U Ugurdag, H. Fatih v van der Hoeven, Joris V Villalba-Moreno, Julio
16 W Weems, Charles Wenwen, Dong Woolley, Cliff
17 Abedi, Dariush A Formulation of Fast Carry Chains Suitable for Efficient Implementation with Majority Elements Ahmed, Syed Ershad An Iterative Logarithmic Multiplier with Improved Precision Bajard, Jean-Claude Multi-fault Attack Detection for RNS Cryptographic Architecture Bayram, Anil Efficient Combinational Circuits for Division by Small Integer Constants Benini, Luca Accuracy and Performance Trade-Offs of Logarithmic Number Units in Multi-Core Clusters
18 Bigou, Karim Hybrid Position-Residues Number System Brunie, Nicolas Computing floating-point logarithms with fixed-point operations Brzicová, Marta On-line Multiplication and Division in Real and Complex Bases Carlough, Steven Quad Precision Floating Point on the IBM z13 Cui, Xiaoping A Parallel Decimal Multiplier Using Hybrid Binary Coded Decimal (BCD) Codes
19 de Dinechin, Florent Computing floating-point logarithms with fixed-point operations de Oliveira Castro, Pablo Verificarlo: Checking Floating Point Accuracy through Monte Carlo Arithmetic Denis, Christophe Verificarlo: Checking Floating Point Accuracy through Monte Carlo Arithmetic Recovering Numerical Reproducibility in Hydrodynamic Simulations Emmart, Niall Optimizing Modular Multiplication for NVIDIA s Maxwell GPUs Eynard, Julien Multi-fault Attack Detection for RNS Cryptographic Architecture
20 Frougny, Christiane On-line Multiplication and Division in Real and Complex Bases Gautschi, Michael Accuracy and Performance Trade-Offs of Logarithmic Number Units in Multi-Core Clusters Geran, Amir Ali Kouzeh A CRC-Based Concurrent Fault Detection Architecture for Galois/Counter Mode (GCM) Gören, Sezer Efficient Combinational Circuits for Division by Small Integer Constants Gueron, Shay Accelerating Big Integer Arithmetic Using Intel IFMA Extensions
21 Hardware Implementation of AES Using Area-Optimal Polynomials for Composite-Field Representation GF(24)2 of GF(28) Gürkaynak, Frank K. Accuracy and Performance Trade-Offs of Logarithmic Number Units in Multi-Core Clusters Hasan, M. Anwar Random Digit Representation of Integers Jaberipur, Ghassem A Formulation of Fast Carry Chains Suitable for Efficient Implementation with Majority Elements Kadam, Sanket An Iterative Logarithmic Multiplier with Improved Precision
22 Krasnov, Vlad Accelerating Big Integer Arithmetic Using Intel IFMA Extensions Langhammer, Martin Single Precision Natural Logarithm Architecture for Hard Floating-Point and DSP-Enabled FPGAs Langlois, Philippe Recovering Numerical Reproducibility in Hydrodynamic Simulations Le Maire, Julien Computing floating-point logarithms with fixed-point operations Lecerf, Grégoire Evaluating Straight-Line Programs over Balls
23 Lefèvre, Vincent Correctly Rounded Arbitrary-Precision Floating-Point Summation Levent, Vecdi Emre Efficient Combinational Circuits for Division by Small Integer Constants Lichtenau, Cedric Quad Precision Floating Point on the IBM z13 Liu, Weiiang A Parallel Decimal Multiplier Using Hybrid Binary Coded Decimal (BCD) Codes Lombardi, Fabrizio A Parallel Decimal Multiplier Using Hybrid Binary Coded Decimal (BCD) Codes
24 Luitjens, Justin Optimizing Modular Multiplication for NVIDIA s Maxwell GPUs Mathew, Sanu Hardware Implementation of AES Using Area-Optimal Polynomials for Composite-Field Representation GF(24)2 of GF(28) Méloni, Nicolas Random Digit Representation of Integers Merkiche, Nabil Multi-fault Attack Detection for RNS Cryptographic Architecture Mueller, Silvia Melitta Quad Precision Floating Point on the IBM z13
25 Muller, Jean-Michel A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions Computing floating-point logarithms with fixed-point operations Nheili, Rafife Recovering Numerical Reproducibility in Hydrodynamic Simulations Parhami, Behrooz A Formulation of Fast Carry Chains Suitable for Efficient Implementation with Majority Elements Pasca, Bogdan Single Precision Natural Logarithm Architecture for Hard Floating-Point and DSP-Enabled FPGAs
26 Pelantová, Edita On-line Multiplication and Division in Real and Complex Bases Petit, Eric Verificarlo: Checking Floating Point Accuracy through Monte Carlo Arithmetic Popescu, Valentina A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions Revy, Guillaume Automated Design of Floating-Point Logarithm Functions on Integer Processors Reyhani-Masoleh, Arash A CRC-Based Concurrent Fault Detection Architecture for Galois/Counter Mode (GCM)
27 Schaffner, Michael Accuracy and Performance Trade-Offs of Logarithmic Number Units in Multi-Core Clusters Srinivas, M. B. An Iterative Logarithmic Multiplier with Improved Precision Svobodová, Milena On-line Multiplication and Division in Real and Complex Bases Tang, Ping Tak Peter A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions Tisserand, Arnaud Hybrid Position-Residues Number System
28 Ugurdag, H. Fatih Efficient Combinational Circuits for Division by Small Integer Constants van der Hoeven, Joris Evaluating Straight-Line Programs over Balls Villalba-Moreno, Julio Digit Recurrence Floating-Point Division under HUB Format Weems, Charles Optimizing Modular Multiplication for NVIDIA s Maxwell GPUs Wenwen, Dong A Parallel Decimal Multiplier Using Hybrid Binary Coded Decimal (BCD) Codes
29 Woolley, Cliff Optimizing Modular Multiplication for NVIDIA s Maxwell GPUs
30 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Avoiding double roundings in scaled Newton-Raphson division
Avoiding double roundings in scaled Newton-Raphson division Jean-Michel Muller To cite this version: Jean-Michel Muller. Avoiding double roundings in scaled Newton-Raphson division. Asilomar Conference
Implementing decimal floating-point arithmetic through binary: some suggestions
Implementing decimal floating-point arithmetic through binary: some suggestions Nicolas Brisebarre, Milos Ercegovac, Nicolas Louvet, Erik Martin-Dorel, Jean-Michel Muller, Adrien Panhaleux To cite this
Recovering Numerical Reproducibility in Hydrodynamics Simulations
23rd IEEE Symposium on Computer Arithmetic July 10-13 2016, Santa-Clara, USA Recovering Numerical Reproducibility in Hydrodynamics Simulations Philippe Langlois, Rafife Nheili, Christophe Denis DALI, Université
SONIA GONZALEZ-NAVARRO AND JAVIER HORMIGO Dept. Computer Architecture Universidad de Málaga (Spain)
SONIA GONZALEZ-NAVARRO AND JAVIER HORMIGO Dept. Computer Architecture Universidad de Málaga (Spain) fjhormigo@uma.es New embedded applications increasingly demanding FP computation IEEE-754 FP standard
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND ITERATIVE LOGARITHMIC MULTIPLIER
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND ITERATIVE LOGARITHMIC MULTIPLIER Riyansh K. Karani, Akash K. Rana, Dhruv H. Reshamwala, Kishore Saldanha Electronics Department,
Computing Integer Powers in Floating-Point Arithmetic
Computing Integer Powers in Floating-Point Arithmetic Peter Kornerup Vincent Lefèvre Jean-Michel Muller May 2007 This is LIP Research Report number RR2007-23 Ceci est le Rapport de Recherches numéro RR2007-23
Newton-Raphson Algorithms for Floating-Point Division Using an FMA
Newton-Raphson Algorithms for Floating-Point Division Using an FMA Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux To cite this version: Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux. Newton-Raphson
I. Introduction. India; 2 Assistant Professor, Department of Electronics & Communication Engineering, SRIT, Jabalpur (M.P.
A Decimal / Binary Multi-operand Adder using a Fast Binary to Decimal Converter-A Review Ruchi Bhatt, Divyanshu Rao, Ravi Mohan 1 M. Tech Scholar, Department of Electronics & Communication Engineering,
Multifunction Residue Architectures for Cryptography 1
Multifunction Residue Architectures for Cryptography 1 LAXMI TRIVENI.D, M.TECH., EMBEDDED SYSTEMS & VLSI 2 P.V.VARAPRASAD,RAO ASSOCIATE PROFESSOR., SLC S INSTITUTE OF ENGINEERING AND TECHNOLOGY Abstract
Accuracy and Performance Trade-offs of Logarithmic Number Units in Multi-Core Clusters
Accuracy and Performance Trade-offs of Logarithmic Number Units in Multi-Core Clusters ARITH 2016 Silicon Valley July 10-13, 2016 Michael Schaffner 1 Michael Gautschi 1 Frank K. Gürkaynak 1 Prof. Luca
Floating Point Square Root under HUB Format
Floating Point Square Root under HUB Format Julio Villalba-Moreno Dept. of Computer Architecture University of Malaga Malaga, SPAIN jvillalba@uma.es Javier Hormigo Dept. of Computer Architecture University
Improved Design of High Performance Radix-10 Multiplication Using BCD Codes
International OPEN ACCESS Journal ISSN: 2249-6645 Of Modern Engineering Research (IJMER) Improved Design of High Performance Radix-10 Multiplication Using BCD Codes 1 A. Anusha, 2 C.Ashok Kumar 1 M.Tech
Pipelined Implementation of Densely Packed Decimal Encoding
Pipelined Implementation of Densely Packed Decimal Encoding A Thesis Submitted in partial fulfilment of the requirements for the Degree of Bachelor of Technology in Computer Science and Engineering by
Efficient Radix-10 Multiplication Using BCD Codes
Efficient Radix-10 Multiplication Using BCD Codes P.Ranjith Kumar Reddy M.Tech VLSI, Department of ECE, CMR Institute of Technology. P.Navitha Assistant Professor, Department of ECE, CMR Institute of Technology.
Using Error Detection Codes to detect fault attacks on Symmetric Key Ciphers
Using Error Detection Codes to detect fault attacks on Symmetric Key Ciphers Israel Koren Department of Electrical and Computer Engineering Univ. of Massachusetts, Amherst, MA collaborating with Luca Breveglieri,
Karatsuba with Rectangular Multipliers for FPGAs
Karatsuba with Rectangular Multipliers for FPGAs Martin Kumm, Oscar Gustafsson, Florent de Dinechin, Johannes Kappauf, and Peter Zipf University of Kassel, Digital Technology Group, Germany Linköping University,
FPGA IMPLEMENTATION OF FLOATING POINT ADDER AND MULTIPLIER UNDER ROUND TO NEAREST
FPGA IMPLEMENTATION OF FLOATING POINT ADDER AND MULTIPLIER UNDER ROUND TO NEAREST SAKTHIVEL Assistant Professor, Department of ECE, Coimbatore Institute of Engineering and Technology Abstract- FPGA is
Reproducibility in Stochastic Simulation
Reproducibility in Stochastic Simulation Prof. Michael Mascagni Department of Computer Science Department of Mathematics Department of Scientific Computing Graduate Program in Molecular Biophysics Florida
High Throughput Radix-D Multiplication Using BCD
High Throughput Radix-D Multiplication Using BCD Y.Raj Kumar PG Scholar, VLSI&ES, Dept of ECE, Vidya Bharathi Institute of Technology, Janagaon, Warangal, Telangana. Dharavath Jagan, M.Tech Associate Professor,
An Efficient FPGA Implementation of the Advanced Encryption Standard (AES) Algorithm Using S-Box
Volume 5 Issue 2 June 2017 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Website: www.ijmemr.org An Efficient FPGA Implementation of the Advanced Encryption
A Residue Approach of the Finite Field Arithmetics
A Residue Approach of the Finite Field Arithmetics 1/20 A Residue Approach of the Finite Field Arithmetics JC Bajard LIRMM, CNRS UM2 161 rue Ada, 34392 Montpellier cedex 5, France A Residue Approach of
Verificarlo: Checking Floating-Point Accuracy Through Monte Carlo Arithmetic
Verificarlo: Checking Floating-Point Accuracy Through Monte Carlo Arithmetic Study on Europlexus Pablo de Oliveira Castro 1, Olivier Jamond 2, E. Petit 3, C. Denis 4, Y. Chatelain 1 1 UVSQ - 2 CEA - 3
ERROR DETECTION SCHEMES FOR FINITE FIELD MULTIPLIERS
American Journal of Applied Sciences 11 (1): 137-144, 2014 ISSN: 1546-9239 2014 Science Publication doi:10.3844/ajassp.2014.137.144 Published Online 11 (1) 2014 (http://www.thescipub.com/ajas.toc) ERROR
Design of a Floating-Point Fused Add-Subtract Unit Using Verilog
International Journal of Electronics and Computer Science Engineering 1007 Available Online at www.ijecse.org ISSN- 2277-1956 Design of a Floating-Point Fused Add-Subtract Unit Using Verilog Mayank Sharma,
High Speed Multiplication Using BCD Codes For DSP Applications
High Speed Multiplication Using BCD Codes For DSP Applications Balasundaram 1, Dr. R. Vijayabhasker 2 PG Scholar, Dept. Electronics & Communication Engineering, Anna University Regional Centre, Coimbatore,
SIPE: Small Integer Plus Exponent
SIPE: Small Integer Plus Exponent Vincent LEFÈVRE AriC, INRIA Grenoble Rhône-Alpes / LIP, ENS-Lyon Arith 21, Austin, Texas, USA, 2013-04-09 Introduction: Why SIPE? All started with floating-point algorithms
VeriTracer: Context-enriched tracer for floating-point arithmetic analysis
VeriTracer: Context-enriched tracer for floating-point arithmetic analysis ARITH 25, Amherst MA USA, June 2018 Yohan Chatelain 1,5 Pablo de Oliveira Castro 1,5 Eric Petit 2,5 David Defour 3 Jordan Bieder
Vendor Agnostic, High Performance, Double Precision Floating Point Division for FPGAs
Vendor Agnostic, High Performance, Double Precision Floating Point Division for FPGAs Xin Fang and Miriam Leeser Dept of Electrical and Computer Eng Northeastern University Boston, Massachusetts 02115
Chapter 03: Computer Arithmetic. Lesson 09: Arithmetic using floating point numbers
Chapter 03: Computer Arithmetic Lesson 09: Arithmetic using floating point numbers Objective To understand arithmetic operations in case of floating point numbers 2 Multiplication of Floating Point Numbers
A NOVEL RNS MONTGOMERY MATHEMATICAL PROCESS ALGORITHM FOR CRYPTOGRAPHY. Telangana, Medak, Telangana
A NOVEL RNS MONTGOMERY MATHEMATICAL PROCESS ALGORITHM FOR CRYPTOGRAPHY SANA MEHWAR 1 P.RENUKA 2 sanamehwar@gmail.com 1 renoostar@gmail.com 2 1 PG Scholar, Dept of ECE, Indur Institute of Engineering and
Numerical Verification of Large Scale CFD Simulations: One Way to Prepare the Exascale Challenge
Numerical Verification of Large Scale CFD Simulations: One Way to Prepare the Exascale Challenge Christophe DENIS Christophe.Denis@edf.fr EDF Resarch and Development - EDF Lab Clamart August 22, 2014 16
A NOVEL DIGITAL ADDER DESIGN BASED ON RESIDUE NUMBER SYSTEM WITH SPECIAL SET OF MODULI {2 N +1, 2 N, 2 N -1}
A NOVEL DIGITAL ADDER DESIGN BASED ON RESIDUE NUMBER SYSTEM WITH SPECIAL SET OF MODULI {2 N +1, 2 N, 2 N -1} Ahmad Q. Al Badawi, Ahmad M. Baset & Qasem S. Abu Al-Haija' Department of Computer Engineering,
Make Computer Arithmetic Great Again?
Make Computer Arithmetic Great Again? Jean-Michel Muller CNRS, ENS Lyon, Inria, Université de Lyon France ARITH-25 June 2018 -2- An apparent contradiction low number of paper submissions to Arith these
Integer and Floating-Point Constant Multipliers for FPGAs
Integer and Floating-Point Constant Multipliers for FPGAs Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller LIP (CNRS/INRIA/ENS-Lyon/UCBL) Université de Lyon {Nicolas.Brisebarre, Florent.de.Dinechin,
Cryptography and Network Security
Cryptography and Network Security CRYPTOGRAPHY AND NETWORK SECURITY PRAKASH C. GUPTA Former Head Department of Information Technology Maharashtra Institute of Technology Pune Delhi-110092 2015 CRYPTOGRAPHY
Some issues related to double roundings
Some issues related to double roundings Erik Martin-Dorel 1 Guillaume Melquiond 2 Jean-Michel Muller 3 1 ENS Lyon, 2 Inria, 3 CNRS Valencia, June 2012 Martin-Dorel, Melquiond, Muller Some issues related
Floating Point Adverse Effects on the Numerical Verification and Reproducibility of Digital Simulations
Floating Point Adverse Effects on the Numerical Verification and Reproducibility of Digital Simulations Seminar at The Maison de la Simulation Christophe DENIS Research Fellow (HDR), CMLA, ENS Paris-Saclay
STATE OF THE ART PARALLEL APPROACHES FOR RSA PUBLIC KEY BASED CRYPTOSYSTEM
STATE OF THE ART PARALLEL APPROACHES FOR RSA PUBLIC KEY BASED CRYPTOSYSTEM Sapna Saxena and Bhanu Kapoor Chitkara University, Himachal Pradesh, India ABSTRACT RSA is one of the most popular Public Key
Multiplier-Based Double Precision Floating Point Divider According to the IEEE-754 Standard
Multiplier-Based Double Precision Floating Point Divider According to the IEEE-754 Standard Vítor Silva 1,RuiDuarte 1,Mário Véstias 2,andHorácio Neto 1 1 INESC-ID/IST/UTL, Technical University of Lisbon,
MODULO 2 n + 1 MAC UNIT
Int. J. Elec&Electr.Eng&Telecoms. 2013 Sithara Sha and Shajimon K John, 2013 Research Paper MODULO 2 n + 1 MAC UNIT ISSN 2319 2518 www.ijeetc.com Vol. 2, No. 4, October 2013 2013 IJEETC. All Rights Reserved
CHAPTER 5: Representing Numerical Data
CHAPTER 5: Representing Numerical Data The Architecture of Computer Hardware and Systems Software & Networking: An Information Technology Approach 4th Edition, Irv Englander John Wiley and Sons 2010 PowerPoint
2016 Maxwell Scientific Publication Corp. Submitted: August 21, 2015 Accepted: September 11, 2015 Published: January 05, 2016
Research Journal of Applied Sciences, Engineering and Technology 12(1): 52-62, 2016 DOI:10.19026/rjaset.12.2303 ISSN: 2040-7459; e-issn: 2040-7467 2016 Maxwell Scientific Publication Corp. Submitted: August
RADIX CONVERSION FOR IEEE MIXED RADIX FLOATING-POINT ARITHMETIC
RADIX CONVERSION FOR IEEE754-8 MIXED RADIX FLOATING-POINT ARITHMETIC Olga Kupriianova UPMC Paris 6 LIP6 PEQUAN team 4, place Jussieu 75252 Paris Cedex 05, France Email: olga.kupriianova@lip6.fr Christoph
Pipelined Quadratic Equation based Novel Multiplication Method for Cryptographic Applications
, Vol 7(4S), 34 39, April 204 ISSN (Print): 0974-6846 ISSN (Online) : 0974-5645 Pipelined Quadratic Equation based Novel Multiplication Method for Cryptographic Applications B. Vignesh *, K. P. Sridhar
Breaking ECC2K-130 on Cell processors and GPUs
Breaking ECC2K-130 on Cell processors and GPUs Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier van Damme, Giacomo de Meulenaer,
Computing floating-point logarithms with fixed-point operations
Computing floating-point logarithms with fixed-point operations Julien Le Maire, Nicolas Brunie, Florent De Dinechin, Jean-Michel Muller To cite this version: Julien Le Maire, Nicolas Brunie, Florent De
Applications of The Montgomery Exponent
Applications of The Montgomery Exponent Shay Gueron 1,3 1 Dept. of Mathematics, University of Haifa, Israel (shay@math.haifa.ac.il) Or Zuk 2,3 2 Dept. of Physics of Complex Systems, Weizmann Institute
A j-lanes tree hashing mode and j-lanes SHA-256
A j-lanes tree hashing mode and j-lanes SHA-5 Shay Gueron 1, 1 Department of Mathematics, University of Haifa, Israel Intel Corporation, Israel Development Center, Haifa, Israel August 1, Abstract. j-lanes
Design a floating-point fused add-subtract unit using verilog
Available online at www.scholarsresearchlibrary.com Archives of Applied Science Research, 2013, 5 (3):278-282 (http://scholarsresearchlibrary.com/archive.html) ISSN 0975-508X CODEN (USA) AASRC9 Design
Numerical Reproducibility: Feasibility Issues
Numerical Reproducibility: Feasibility Issues Philippe Langlois, Rafife Nheili, Christophe Denis To cite this version: Philippe Langlois, Rafife Nheili, Christophe Denis. Numerical Reproducibility: Feasibility
CHAPTER V NUMBER SYSTEMS AND ARITHMETIC
CHAPTER V-1 CHAPTER V CHAPTER V NUMBER SYSTEMS AND ARITHMETIC CHAPTER V-2 NUMBER SYSTEMS RADIX-R REPRESENTATION Decimal number expansion 73625 10 = ( 7 10 4 ) + ( 3 10 3 ) + ( 6 10 2 ) + ( 2 10 1 ) +(
Introduction to Field Programmable Gate Arrays
Introduction to Field Programmable Gate Arrays Lecture 2/3 CERN Accelerator School on Digital Signal Processing Sigtuna, Sweden, 31 May 9 June 2007 Javier Serrano, CERN AB-CO-HT Outline Digital Signal
Reliable computing with GNU MPFR
Reliable computing with GNU MPFR Paul Zimmermann LORIA/INRIA Nancy-Grand Est, Équipe CARAMEL - bâtiment A, 615 rue du jardin botanique, F-54603 Villers-lès-Nancy Cedex Abstract. This article presents a
Fast modular squaring with AVX512IFMA
Fast modular squaring with AVX512IFMA Nir Drucker and Shay Gueron 1 University of Haifa, Israel 2 Amazon Web Services Inc., Seattle, WA, USA drucker.nir@gmail.com, shay@math.haifa.ac.il Abstract. Modular
DIGITAL ARITHMETIC. Miloš D. Ercegovac Computer Science Department University of California Los Angeles and
1 DIGITAL ARITHMETIC Miloš D. Ercegovac Computer Science Department University of California Los Angeles and Tomás Lang Department of Electrical and Computer Engineering University of California at Irvine
VHDL implementation of 32-bit floating point unit (FPU)
VHDL implementation of 32-bit floating point unit (FPU) Nikhil Arora Govindam Sharma Sachin Kumar M.Tech student M.Tech student M.Tech student YMCA, Faridabad YMCA, Faridabad YMCA, Faridabad Abstract The
A Residue Approach to the Finite Field Arithmetics
A Residue Approach to the Finite Field Arithmetics 1/23 A Residue Approach to the Finite Field Arithmetics JC Bajard LIRMM, CNRS UM2 161 rue Ada, 34392 Montpellier cedex 5, France CIRM 2009 A Residue Approach
GPU & Computer Arithmetics
GPU & Computer Arithmetics David Defour University of Perpignan Key multicore challenges Performance challenge How to scale from 1 to 1000 cores The number of cores is the new MegaHertz Power efficiency
Digital Design. Verilo. and. Fundamentals. fit HDL. Joseph Cavanagh. CRC Press Taylor & Francis Group Boca Raton London New York
Digital Design and Verilo fit HDL Fundamentals Joseph Cavanagh Santa Clara University California, USA CRC Press Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor &
NEW MODIFIED LEFT-TO-RIGHT RADIX-R REPRESENTATION FOR INTEGERS. Arash Eghdamian 1*, Azman Samsudin 1
International Journal of Technology (2017) 3: 519-527 ISSN 2086-9614 IJTech 2017 NEW MODIFIED LEFT-TO-RIGHT RADIX-R REPRESENTATION FOR INTEGERS Arash Eghdamian 1*, Azman Samsudin 1 1 School of Computer
- 0 - CryptoLib: Cryptography in Software John B. Lacy 1 Donald P. Mitchell 2 William M. Schell 3 AT&T Bell Laboratories ABSTRACT
- 0 - CryptoLib: Cryptography in Software John B. Lacy 1 Donald P. Mitchell 2 William M. Schell 3 AT&T Bell Laboratories ABSTRACT With the capacity of communications channels increasing at the current
VLSI ARCHITECTURE FOR NANO WIRE BASED ADVANCED ENCRYPTION STANDARD (AES) WITH THE EFFICIENT MULTIPLICATIVE INVERSE UNIT
VLSI ARCHITECTURE FOR NANO WIRE BASED ADVANCED ENCRYPTION STANDARD (AES) WITH THE EFFICIENT MULTIPLICATIVE INVERSE UNIT K.Sandyarani 1 and P. Nirmal Kumar 2 1 Research Scholar, Department of ECE, Sathyabama
ECC Elliptic Curve Cryptography. Foundations of Cryptography - ECC pp. 1 / 31
ECC Elliptic Curve Cryptography Foundations of Cryptography - ECC pp. 1 / 31 Elliptic Curve an elliptic curve E is a smooth, projective, algebraic curve defined by the following equation: y 2 3 2 a xy
Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS. Hanno Böck, Aaron Zauner, Sean Devlin, Juraj Somorovsky, Philipp Jovanovic
Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS Hanno Böck, Aaron Zauner, Sean Devlin, Juraj Somorovsky, Philipp Jovanovic 1 TLS Encryption 1. Asymmetric key exchange RSA, DHE,
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA Workshop on Cryptographic Hardware and Embedded Systems (CHES 2007) September 2007 Guerric Meurice de Dormale*, Philippe Bulens,
Understanding Cryptography by Christof Paar and Jan Pelzl. Chapter 9 Elliptic Curve Cryptography
Understanding Cryptography by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 9 Elliptic Curve Cryptography ver. February 2nd, 2015 These slides were prepared by Tim Güneysu, Christof Paar
A High-Speed FPGA Implementation of an RSD- Based ECC Processor
A High-Speed FPGA Implementation of an RSD- Based ECC Processor Abstract: In this paper, an exportable application-specific instruction-set elliptic curve cryptography processor based on redundant signed
Principles of Computer Architecture. Chapter 3: Arithmetic
3-1 Chapter 3 - Arithmetic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Chapter 3: Arithmetic 3-2 Chapter 3 - Arithmetic 3.1 Overview Chapter Contents 3.2 Fixed Point Addition
Optimized Scientific Computing:
Optimized Scientific Computing: Coding Efficiently for Real Computing Architectures Noah Kurinsky SASS Talk, November 11 2015 Introduction Components of a CPU Architecture Design Choices Why Is This Relevant
Advanced Encryption Standard and Modes of Operation. Foundations of Cryptography - AES pp. 1 / 50
Advanced Encryption Standard and Modes of Operation Foundations of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) is a symmetric cryptographic algorithm AES has been originally requested
Scalar Blinding on Elliptic Curves with Special Structure
Scalar Blinding on Elliptic Curves with Special Structure Scott Fluhrer Cisco Systems August 11, 2015 1 Abstract This paper shows how scalar blinding can provide protection against side channel attacks
FPGA Based Acceleration of Decimal Operations
FPGA Based Acceleration of Decimal Operations Alberto Nannarelli Dept. Informatics and Mathematical Modelling Technical University of Denmark Kongens Lyngby, Denmark Email: an@imm.dtu.dk Abstract Field
Elementary Functions
Elementary Functions Jean-Michel Muller Elementary Functions Algorithms and Implementation Jean-Michel Muller Laboratoire de l Informatique du Parallélisme (LIP) École Normale Supérieure de Lyon CNRS Lyon
M.TECH VLSI IEEE TITLES
2016 2017 M.TECH VLSI IEEE TITLES S.NO TITLES DOMAIN 1 A Fixed-Point Squaring Algorithm Using an Implicit Arbitrary Radix Number System 2 An Improved Design of a Reversible Fault Tolerant LUT-Based FPGA
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 7 January 30, 2012 CPSC 467b, Lecture 7 1/44 Public-key cryptography RSA Factoring Assumption Computing with Big Numbers Fast Exponentiation
Secure UHF Tags with Strong Cryptography Development of ISO/IEC Compatible Secure RFID Tags and Presentation of First Results
Development of ISO/IEC 18000-63 Compatible Secure RFID Tags and Presentation of First Results Walter Hinz, Klaus Finkenzeller, Martin Seysen Barcelona, February 19 th, 2013 Agenda Motivation for Secure
CORRECTLY ROUNDED FLOATING-POINT DIVISION FOR DSP-ENABLED FPGAS. Bogdan Pasca. Altera European Technology Centre, High Wycombe, UK
CORRECTLY ROUNDED FLOATING-POINT DIVISION FOR DSP-ENABLED FPGAS Bogdan Pasca Altera European Technology Centre, High Wycombe, UK ABSTRACT Floating-point division is a very costly operation in FPGA designs.
VLSI Implementation of Fast Addition Using Quaternary Signed Digit Number System
VLSI Implementation of Fast Addition Using Quaternary Signed Digit Number System JYOTI R HALLIKHED M.Tech student, VLSI Design & Embedded Systems APPA Institute of Engineering & Technology Gulbarga, Karnataka,
Bit-Vector Approximations of Floating-Point Arithmetic
18045 Examensarbete 15 hp September 2018 Bit-Vector Approximations of Floating-Point Arithmetic Joel Havermark Institutionen för informationsteknologi Department of Information Technology Abstract Bit-Vector
A New Family of High Performance Parallel Decimal Multipliers
A New Family of High Performance Parallel Decimal Multipliers Alvaro Vázquez, Elisardo Antelo University of Santiago de Compostela Dept. of Electronic and Computer Science 15782 Santiago de Compostela,
For Tricia: never dull, never boring, the smartest and bravest person I know
For Tricia: never dull, never boring, the smartest and bravest person I know Vice President and Editorial Director, ECS: Marcia J. Horton Executive Editor: Tracy Johnson (Dunkelberger) Editorial Assistant:
WORD LEVEL FINITE FIELD MULTIPLIERS USING NORMAL BASIS
WORD LEVEL FINITE FIELD MULTIPLIERS USING NORMAL BASIS 1 B.SARGUNAM, 2 Dr.R.DHANASEKARAN 1 Assistant Professor, Department of ECE, Avinashilingam University, Coimbatore 2 Professor & Director-Research,
A Radix-10 SRT Divider Based on Alternative BCD Codings
A Radix-10 SRT Divider Based on Alternative BCD Codings Alvaro Vázquez, Elisardo Antelo University of Santiago de Compostela Dept. of Electronic and Computer Science 782 Santiago de Compostela, Spain alvaro@dec.usc.es,
Arb: a C library for ball arithmetic
Arb: a C library for ball arithmetic Fredrik Johansson RISC-Linz ISSAC 2013 Supported by the Austrian Science Fund (FWF) grant Y464-N18 Fredrik Johansson (RISC-Linz) Arb: a C library for ball arithmetic
ISSN Vol.03,Issue.05, July-2015, Pages:
WWW.IJITECH.ORG ISSN 2321-8665 Vol.03,Issue.05, July-2015, Pages:0707-0713 Evaluation of Fast Radix-10 Multiplication using Redundant BCD Codes for Speedup and Simplify Applications B. NAGARJUN SINGH 1,
Data-Parallel Algorithms on GPUs. Mark Harris NVIDIA Developer Technology
Data-Parallel Algorithms on GPUs Mark Harris NVIDIA Developer Technology Outline Introduction Algorithmic complexity on GPUs Algorithmic Building Blocks Gather & Scatter Reductions Scan (parallel prefix)
Computer Arithmetic Algorithms And Hardware Designs
We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with computer arithmetic
Hardware division by small integer constants
Hardware division by small integer constants Fatih Ugurdag, Florent e inechin, Yılmaz Serhan Gener, Sezer Gören, Laurent-Stéphane idier To cite this version: Fatih Ugurdag, Florent e inechin, Yılmaz Serhan
Using GPUs to compute the multilevel summation of electrostatic forces
Using GPUs to compute the multilevel summation of electrostatic forces David J. Hardy Theoretical and Computational Biophysics Group Beckman Institute for Advanced Science and Technology University of
An Enhanced Residue Modular Multiplier for Cryptography
An Enhanced Residue Modular Multiplier for Cryptography Vundela Sarada MTech,Department of ECE, JNTUA College of engineering, Anantapur, AP Abstract: This paper presents an implementation of VLSI architecture
A Unified Addition Structure for Moduli Set {2 n -1, 2 n,2 n +1} Based on a Novel RNS Representation
A Unified Addition Structure for Moduli Set { n -, n, n +} Based on a Novel RNS Representation Somayeh Timarchi,, Mahmood Fazlali,, and Sorin D.Cotofana Department of Electrical and Computer Engineering,
Vendor Agnostic, High Performance, Double Precision Floating Point Division for FPGAs
Vendor Agnostic, High Performance, Double Precision Floating Point Division for FPGAs Presented by Xin Fang Advisor: Professor Miriam Leeser ECE Department Northeastern University 1 Outline Background
On-line Algorithms for Complex Number Arithmetic
Online Algorithms for Complex Number Arithmetic Robert McIlhenny rmcilhen@csuclaedu Computer Science epartment University of California Los Angeles, CA 94 Miloš Ercegovac milos@csuclaedu Abstract A class
Instruction Sets: Characteristics and Functions
Instruction Sets: Characteristics and Functions Chapter 10 Lesson 15 Slide 1/22 Machine instruction set Computer designer: The machine instruction set provides the functional requirements for the CPU.
Reconfigurable arithmetic for HPC
Reconfigurable arithmetic for HPC Florent de Dinechin and Bogdan Pasca 1 Introduction An often overlooked way to increase the efficiency of HPC on FPGA is to tailor, as tightly as possible, the arithmetic
Divide: Paper & Pencil
Divide: Paper & Pencil 1001 Quotient Divisor 1000 1001010 Dividend -1000 10 101 1010 1000 10 Remainder See how big a number can be subtracted, creating quotient bit on each step Binary => 1 * divisor or
A new multiplication algorithm for extended precision using floating-point expansions
1 A new multiplication algorithm for extended precision using floating-point expansions Jean-Michel Muller, Valentina Popescu and Ping Tak Peter Tang Abstract Some important computational problems must
First improvements toward a reproducible Telemac-2D
First improvements toward a reproducible Telemac-2D Rafife Nheili, Philippe Langlois, Christophe Denis To cite this version: Rafife Nheili, Philippe Langlois, Christophe Denis. First improvements toward
Division by Constant for the ST100 DSP Microprocessor
Division by Constant for the ST100 DSP Microprocessor Jean-Michel Muller and Arnaud Tisserand Arénaire project (CNRS ENS Lyon INRIA UCBL) LIP, ENS Lyon. 46 allée d Italie F 69364 Lyon Cedex 07, France
HIGH PERFORMANCE ELLIPTIC CURVE CRYPTO-PROCESSOR FOR FPGA PLATFORMS
HIGH PERFORMANCE ELLIPTIC CURVE CRYPTO-PROCESSOR FOR FPGA PLATFORMS Debdeep Mukhopadhyay Dept. of Computer Science and Engg. IIT Kharagpur 3/6/2010 NTT Labs, Japan 1 Outline Elliptic Curve Cryptography