4 Questions 2 Answers 0 Followers
Questions related from Abdelkrim Kamel Oudjida
We have drastically improved our earlier result. We have recently proved that for an N-bit constant, the upper-bound in cascaded additions/subtractions using the radix-2r arithmetic is equal to...
03 March 2016 2,782 0 View
I am working on the MCM problem, and I need to compare my algorithm to some results given in Table V of the following paper (see attachment): K. Johansson, O. Gustafsson, L.S. DeBrunner, and L....
05 May 2015 6,604 0 View
In the multiplication by a constant (C.X), it has been proved that the adder-depth (number of cascaded additions/subtractions) determines not only the speed (which is obvious) but also the power...
04 April 2015 2,637 0 View
Multiplication by a constant (C.X) is a fundamental operation in the linear time invariant (LTI) Systems. The design optimization of C.X leads to the design optimization of the whole system (from...
03 March 2015 2,273 2 View
