Sciweavers

21 search results - page 2 / 5
» Extending Moment Computation to 2-Port Circuit Representatio...
Sort
View
TCS
2010
13 years 3 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
DAC
1999
ACM
13 years 9 months ago
ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
Bernard N. Sheehan
APCSAC
2003
IEEE
13 years 10 months ago
Arithmetic Circuits Combining Residue and Signed-Digit Representations
This paper discusses the use of signed-digit representations in the implementation of fast and efficient residue-arithmetic units. Improvements to existing signed-digit modulo adde...
Anders Lindström, Michael Nordseth, Lars Beng...
DAC
1999
ACM
13 years 9 months ago
Parametric Representations of Boolean Constraints
Abstract We describe the use of parametric representations of Boolean predicates to encode data-space constraints and signi cantly extend the capacity of formal veri cation. The co...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
TAMC
2007
Springer
13 years 11 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...