Abstract: Several schemes for computing the sum of squares for fixed point numbers are designed, synthesized, and evaluated in this study. The schemes use radix-2 folding, radix-4 folding, and radix-4 dual recoding approaches for squaring. The schemes have been modeled in hardware description language, simulated, and synthesized using Cadence SOC81 in 45 nm and 90 nm libraries and with Mentor Graphics Leonardo Spectrum for 180 nm. We show delay and area for 16-, 24-, and 32-bit operands. After hard-wire and software optimizations, it is seen that schemes with radix-4 give better results, especially in area
Abstract-The Booth multiplication algorithm produces incorrect re-sults for some word sizes, when it...
Square root calculation is a widely used task in real-time control systems especially in those, whic...
Arithmetic Square Root is one of the most complex but nevertheless widely used operations in modern ...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
We introduce a novel left-to-right leading digit first dual recoding of an operand for the purpose o...
International audienceDot products (also called sums of products) are ubiquitous in matrix computati...
This paper presents the sequential and pipelined designs of a double precision floating point divide...
Approximate computing is considered an innovative paradigm with wide applications to high performanc...
National audienceOn modern multi-core, many-core, and heterogeneous architectures, floating-point co...
This algorithm draws ellipses with integer centres and decimal radii on discrete devices using fixe...
Implementations of the reciprocal, square root and reciprocal square root often share a common struc...
Error resilient applications benefit from the use of approximate computing techniques that enhance e...
The authors present a simple method, based on the principle of successive approxmation, of computing...
This paper presents a study of some basic blocks needed in the design of floating-point summation al...
This paper describes the hardware implementation methodologies of fixed point binary division algori...
Abstract-The Booth multiplication algorithm produces incorrect re-sults for some word sizes, when it...
Square root calculation is a widely used task in real-time control systems especially in those, whic...
Arithmetic Square Root is one of the most complex but nevertheless widely used operations in modern ...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
We introduce a novel left-to-right leading digit first dual recoding of an operand for the purpose o...
International audienceDot products (also called sums of products) are ubiquitous in matrix computati...
This paper presents the sequential and pipelined designs of a double precision floating point divide...
Approximate computing is considered an innovative paradigm with wide applications to high performanc...
National audienceOn modern multi-core, many-core, and heterogeneous architectures, floating-point co...
This algorithm draws ellipses with integer centres and decimal radii on discrete devices using fixe...
Implementations of the reciprocal, square root and reciprocal square root often share a common struc...
Error resilient applications benefit from the use of approximate computing techniques that enhance e...
The authors present a simple method, based on the principle of successive approxmation, of computing...
This paper presents a study of some basic blocks needed in the design of floating-point summation al...
This paper describes the hardware implementation methodologies of fixed point binary division algori...
Abstract-The Booth multiplication algorithm produces incorrect re-sults for some word sizes, when it...
Square root calculation is a widely used task in real-time control systems especially in those, whic...
Arithmetic Square Root is one of the most complex but nevertheless widely used operations in modern ...