Concept

Booth's multiplication algorithm

Related publications (13)

EdgeAI-Aware Design of In-Memory Computing Architectures

Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...

EPFL2024

Multiplier Architectures: Challenges and Opportunities with Plasmonic-based Logic

Giovanni De Micheli, Mathias Soeken, Eleonora Testa, Odysseas Zografos

Emerging technologies such as plasmonics and photonics are promising alternatives to CMOS for high throughput applications, thanks to their waveguide's low power consumption and high speed of computation. Besides these qualities, these novel technologies a ...

2020

Multiplier Architectures: Challenges and Opportunities with Plasmonic-based Logic

Giovanni De Micheli, Mathias Soeken, Eleonora Testa, Odysseas Zografos

IEEE2020

An Associativity-Agnostic in-Cache Computing Architecture Optimized for Multiplication

David Atienza Alonso, Marina Zapater Sancho, Alexandre Sébastien Julien Levisse, Marco Antonio Rios, William Andrew Simon

With the spread of cloud services and Internet of Things concept, there is a popularization of machine learning and artificial intelligence based analytics in our everyday life. However, an efficient deployment of these data-intensive services requires per ...

2019

MRI artifact correction using sparse plus low-rank decomposition of annihilating filter-based hankel matrix

Kyong Hwan Jin

PurposeMagnetic resonance imaging (MRI) artifacts are originated from various sources including instability of an magnetic resonance (MR) system, patient motion, inhomogeneities of gradient fields, and so on. Such MRI artifacts are usually considered as ir ...

Wiley2017

Discreteness of interior transmission eigenvalues revisited

Hoài-Minh Nguyên, Quoc Hung Nguyen

This paper is devoted to the discreteness of the transmission eigenvalue problems. It is known that this problem is not self-adjoint and a priori estimates are non-standard and do not hold in general. Two approaches are used. The first one is based on the ...

Springer Verlag2017

Formal Verification of Integer Multipliers by Combining Gröbner Basis with Logic Reduction

Mathias Soeken

Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynom ...

IEEE2016

Limiting absorption principle and well-posedness for the Helmholtz equation with sign changing coefficients

Hoài-Minh Nguyên

In this paper, we investigate the limiting absorption principle associated to and the well-posedness of the Helmholtz equations with sign changing coefficients which are used to model negative index materials. Using the reflecting technique introduced in [ ...

Elsevier2016

Towards a novel "silky" way to detect chemical species using spider threads

Luc Thévenaz, Isabelle Dicaire, Kenny Hey Tow, Desmond Chow Ming Chia

Silk possesses extraordinary properties that scientists are currently working hard on harnessing. Amongst them, this primeval material has shown early potential of having excellent optical properties. Through a regeneration process, it is possible to obtai ...

2016

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015