Multipliers: comparison of Fourier transformation based method and Synopsys design technique for up to 32 bits inputs in regular and saturation arithmetics

11/16/2016
by   Danila Gorodecky, et al.
0

The technique for hardware multiplication based upon Fourier transformation has been introduced. The technique has the highest efficiency on multiplication units with up to 8 bit range. Each multiplication unit is realized on base of the minimized Boolean functions. Experimental data showed that this technique the multiplication process speed up to 20 operands and up to 3 analogues designed by Synopsys technique.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2023

Revisiting Fast Fourier multiplication algorithms on quotient rings

This work formalizes efficient Fast Fourier-based multiplication algorit...
research
03/02/2017

Faster truncated integer multiplication

We present new algorithms for computing the low n bits or the high n bit...
research
07/27/2022

Modular Multiplication without Carry Propagation (Algorithm Description)

This paper describes a sufficiently simple modular multiplication algori...
research
08/31/2017

Faster Multiplication for Long Binary Polynomials

We set new speed records for multiplying long polynomials over finite fi...
research
08/21/2022

Efficient Multiparty Protocols Using Generalized Parseval's Identity and the Theta Algebra

We propose a protocol able to show publicly addition and multiplication ...
research
02/28/2019

Lower Bounds for Multiplication via Network Coding

Multiplication is one of the most fundamental computational problems, ye...
research
01/23/2018

Why and How to Avoid the Flipped Quaternion Multiplication

Over the last decades quaternions have become a crucial and very success...

Please sign up or login with your details

Forgot password? Click here to reset