This paper presents a design for combining reconfigurable multiplier array known as Flexible Array Blocks (FABs) and digit-serial techniques to implement arbitrary size multipliers with limited resources. Any 4Mx4N bit multipliers can be implemented. In-depth evaluation of the tradeoff between resources and performance is presented. The resulting design is suitable for embedding in heterogeneou...

A multigrid algorithm for saddle point problems arising from mortar nite element discretizations is analyzed. Here, we do not require that the constraints at the interface are satissed in each smoothing step. Using mesh dependent norms for the Lagrange multiplier, suitable approximation and smoothing properties are established. A convergence rate independent of the meshsize is obtained for the ...

In this article, we study what we call the Branner-HubbardLavaurs deformation of real cubic polynomials with a parabolic fixed point of multiplier one. It turns out that the existence of non-trivial deformations corresponds to the oscillation of stretching rays and discontinuity of the wring operation.

the present paper is an attempt to: 1- demonstrate how money is created (by the nature of the system), and to estimate the inflation resulting from monetary factors in both usurious and non-usurious systems. operational aspects of islamic and non-islamic banking systems are compared. 2- introduce a corrective term to be added to the multiplier of the supply of money, in order to prevent the und...

in this paper, we introduce the notion of multiplier in -algebra and study relationships between multipliers and some special mappings, likeness closure operators, homomorphisms and ( -derivations in -algebras. we introduce the concept of idempotent multipliers in bl-algebra and weak congruence and obtain an interconnection between idempotent multipliers and weak congruences. also, we introduce...

Physical limitations of Complementary Metal-Oxide-Semiconductors (CMOS) technology at nanoscale and high cost of lithography have provided the platform for creating Quantum-dot Cellular Automata (QCA)-based hardware. The QCA is a new technology that promises smaller, cheaper and faster electronic circuits, and has been regarded as an effective solution for scalability problems in CMOS technolog...

A quadratic programming problem with positive definite Hessian and bound constraints is solved, using a Lagrange multiplier approach. The proposed method falls in the category of exterior point, active set techniques. An iteration of our algorithm modifies both the minimization parameters in the primal space and the Lagrange multipliers in the dual space. Comparative results of numerical experi...

We consider an implicit iterative method in convex programming which combines inexact variants of the proximal point algorithm, with parametric penalty functions. We investigate a multiplier sequence which is explicitly computed in terms of the primal sequence generated by the iterative method, providing some conditions on the parameters in order to ensure convergence towards a particular dual ...

We consider expanding maps of the circle with an almost neutral fixed point c. In this setting the ergodic averages of a smooth observable A satisfy the Central Limit Theorem. If A(c) = 0 we show that the expectation and the variance behave as the square root of the multiplier of c times rapidly oscillating functions of parameters.

The paper presents the concepts behind the "Urdhva Tiryagbhyam Sutra" and "Nikhilam Sutra" multiplication techniques. It then shows the architecture for a 16×16 Vedic multiplier module using Urdhva Tiryagbhyam Sutra. The paper then extends multiplication to 16×16 Vedic multiplier using "Nikhilam Sutra" technique. The 16×16 Vedic multiplier module using Urdhva Tiryagbhyam Sutra uses four 8×8 Ved...