In this paper fast pipelined digit-serial/parallel multipliers are proposed. The conventional digit-serial/parallel multipliers and their pipelined versions are presented. Every structure has been implemented on FPGA and the results are given. These results have been analysed and it is detected that the pipelined ones do not have the throughput improvement expected because of a logic depth incr...

In this paper we perform sensitivity analysis for optimization problems with variational inequality constraints (OPVICs). We provide upper estimates for the limiting subdifferential (singular limiting subdifferential) of the value function in terms of the set of normal (abnormal) coderivative (CD) multipliers for OPVICs. For the case of optimization problems with complementarity constraints (OP...

This paper proposes a new method to numerically obtain Floquet multipliers which characterize stability of periodic orbits of ordinary differential equations. For sufficiently smooth periodic orbits, we can compute Floquet multipliers using some standard numerical methods with enough accuracy. However, it has been reported that these methods may produce incorrect results under some conditions. ...

Calculation of the characteristic multipliers is not routine since in general one does not know even one nontrivial solution of (1). However it is possible to obtain convergent series representations for the solutions and thus calculate approximate values for the multipliers [2], [8]. An alternative procedure for obtaining the characteristic multipliers and the corresponding normal solutions fo...

For a Hilbert space H ⊂ L loc (R) of functions on R we obtain a representation theorem for the multipliers M commuting with the shift operator S. This generalizes the classical result for multipliers in L(R) as well as our previous result for multipliers in weighted space L ω (R). Moreover, we obtain a description of the spectrum of S.

A semidiscrete multiplier is an operator between a space of functions or distributions on a locally compact Abelian group G on the one hand, and a space of sequences on a discrete subgroup H of G on the other hand, with the property that it commutes with shifts by H. We describe the basic form of such operators and show a number of representation theorems for classical spaces like Lp, C0, etc. ...

We investigate whether the completeness of a complete orthonormal sequence for L2(IT, 77) is preserved if the sequence is perturbed by multiplying a portion of it by a fixed function. For the particular sequence i(277)-1/2emxi we show that given any xb £ L°°(-77, 77), except lb = 0 a.e., there is a nontrivial portion of Í (2rr)-^ einx\ which will maintain completeness under this perturbation. W...

Based on fast FIR algorithms (FFAs), we propose distributed arithmetic algorithm based new parallel FIR filter architectures, which are beneficial to symmetric convolutions in terms of the hardware cost. Multipliers are the major portions in hardware consumption for the parallel FIR filter implementation. The proposed new structures exploit the nature of symmetric coefficients of odd length and...

This contribution introduces a scalable multiplier architecture for Galois field GF(2 k) amenable for field programmable gate arrays (FPGAs) implementations. This architecture is well suited for the implementation of public-key cryptosystems which require pro-grammable multipliers in large Galois fields. The architecture trades a reduction in resources with an increase in the number of clock cy...

In this paper an algorithm for GF(2") multiplication/division is presented and a new, more generalized definition of duality is proposed. From these the bit-serial Berlekamp multiplier is derived and shown to be a specific case of a more general class of multipliers. Furthermore, it is shown that hardware efficient, bit-parallel dual basis multipliers can also be designed. These multipliers hav...