Results 1  10
of
85,648
An Arithmetical Module for Rationals and Reals
, 1997
"... This paper is a sequel to our earlier paper [BS96]. We continue our project to develop a family of data type specifications starting from elementary principles and in a setting of fourvalued logic. We refer to [BBR95] for a discussion on this particular fourvalued logic, and to [BS96] for a discus ..."
Abstract
 Add to MetaCart
notation for a fraction is needed. The specifications have been produced, typechecked and simulated using the ASF+SDF system [Kli95]. This system combines algebraic specifications [BHK85] with the Syntax Definition Formalism SDF [HK89]. We specify abstract syntax only. No module for pretty printing
ARITHMETIC DMODULES AND REPRESENTATIONS
, 802
"... Abstract. We propose in this paper an approach to Breuil’s conjecture on a Langlands correspondence between padic Galois representations and representations of padic Lie groups in padic topological vector spaces. We suggest that Berthelot’s theory of arithmetic Dmodules should give a padic anal ..."
Abstract
 Add to MetaCart
Abstract. We propose in this paper an approach to Breuil’s conjecture on a Langlands correspondence between padic Galois representations and representations of padic Lie groups in padic topological vector spaces. We suggest that Berthelot’s theory of arithmetic Dmodules should give a p
Power Efficient Arithmetic Operand Encoding
 IN PROCEEDINGS OF THE XIV SYMP. ON INTEGRATED CIRCUITS AND SYSTEMS DESIGN
, 2001
"... This paper addresses the use of alternative codes for arithmetic operators. The objective is twofold. First, to investigate operand codes that yield simpler, i.e., power efficient, arithmetic modules. Second, to investigate signal encodings that lead to the reduction of the switching activity in the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper addresses the use of alternative codes for arithmetic operators. The objective is twofold. First, to investigate operand codes that yield simpler, i.e., power efficient, arithmetic modules. Second, to investigate signal encodings that lead to the reduction of the switching activity
Redundant arithmetic, algorithms and implementations
 INTEGRATION, THE VLSI JOURNAL 30 (2000) 1353
, 2000
"... Performance in many verylargescaleintegrated (VLSI) systems such as digital signal processing (DSP) chips, is predominantly determined by the speed of arithmetic modules like adders and multipliers. Even though redundant arithmetic algorithms produce significant improvements in performance throug ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Performance in many verylargescaleintegrated (VLSI) systems such as digital signal processing (DSP) chips, is predominantly determined by the speed of arithmetic modules like adders and multipliers. Even though redundant arithmetic algorithms produce significant improvements in performance
Arithmetic degree and associated graded modules
, 2004
"... 1 We prove that the arithmetic degree of a graded or local ring A is bounded above by the arithmetic degree of any of its associated graded rings with respect to ideals I in A. In particular, if Spec(A) is equidimensional and has an embedded component (i.e., A has an embedded associated prime ideal) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
1 We prove that the arithmetic degree of a graded or local ring A is bounded above by the arithmetic degree of any of its associated graded rings with respect to ideals I in A. In particular, if Spec(A) is equidimensional and has an embedded component (i.e., A has an embedded associated prime ideal
DRINFELD MODULES AND ARITHMETIC IN THE FUNCTION FIELDS
"... q: a power of a prime p; K " a function field of one variable over its field of constants F; ’a place of K; A " the ring of elements of K integral outside Koo " the completion of K at f: the completion of an algebraic closure of the degree of the place h " the class number of K; ..."
Abstract
 Add to MetaCart
, H2]), by considering the additive group G (instead of Gm and various elliptic curves) which admits various possible actions of any A. This led to the concept of Drinfeld module introduced below. From now on, we assume 6 1, though a few concepts and results below have straightforward generalizations
ACV: An Arithmetic Circuit Verifier
 In Int'l Conf. on CAD
, 1996
"... Based on a hierarchical verification methodology, we present an arithmetic circuit verifier ACV, in which circuits expressed in a hardware description language, also called ACV, are symbolically verified using Binary Decision Diagrams for Boolean functions and multiplicative Binary Moment Diagrams ( ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
as specifying their functionality in terms of arithmetic expressions. Verification then proceeds recursively, proving that each module in the hierarchy having a functional description, including the toplevel one, realizes its specification. The language and the verifier contain additional enhancements
ARITHMETIC LAPLACIANS
, 2008
"... We develop an arithmetic analogue of elliptic partial differential equations. The rôle of the space coordinates is played by a family of primes, and that of the space derivatives along the various primes are played by corresponding Fermat quotient operators subjected to certain commutation relation ..."
Abstract
 Add to MetaCart
We develop an arithmetic analogue of elliptic partial differential equations. The rôle of the space coordinates is played by a family of primes, and that of the space derivatives along the various primes are played by corresponding Fermat quotient operators subjected to certain commutation
BINARY ARITHMETIC
"... In reference (1) algorithms for performing arithmetic with unsigned two's complement operands were described. The scheme for division was implemented in a set of multipleprecision floatingpoint arithmetic routines (2). User experience with those routines showed that there is one case where th ..."
Abstract
 Add to MetaCart
In reference (1) algorithms for performing arithmetic with unsigned two's complement operands were described. The scheme for division was implemented in a set of multipleprecision floatingpoint arithmetic routines (2). User experience with those routines showed that there is one case where
Results 1  10
of
85,648