20 search results - page 3 / 4 » Signed Binary Representations Revisited |
TSP
2008
13 years 5 months ago
2008
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD)...
TC
1998
13 years 4 months ago
1998
—This paper describes a new signed-digit full adder (SDFA) circuit consisting of resonant-tunneling diodes (RTDs) and metal-oxide semiconductor field effect transistors (MOSFETs)...
CIE
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
SMA
2003
ACM
13 years 10 months ago
2003
ACM
We present a method to estimate the in/out function of a closed surface represented by an unorganized set of data points. From the in/out function, we compute an approximation of ...
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...