16 search results - page 2 / 4 » Practical Divide-and-Conquer Algorithms for Polynomial Arith... |
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we describe the design of a C library named PTPol implementing arithmetic operations for univariate polynomials and report on practical experiments showing the rele...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
13 years 8 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...