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...

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...

Biodiversity offsetting, which means compensation for ecological and environmental damage caused by development activity, has recently been gaining strong political support around the world. One common criticism levelled at offsets is that they exchange certain and almost immediate losses for uncertain future gains. In the case of restoration offsets, gains may be realized after a time delay of...

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...

Abstract| Several types of Decision Diagrams (DDs) have have been proposed in the area of Computer Aided Design (CAD), among them being bit-level DDs like OBDDs, OFDDs and OKFDDs. While the aforementioned types of DDs are suitable for representing Boolean functions at the bit-level and have proved useful for a lot of applications in CAD, recently DDs to represent integer-valued functions, like ...

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...

We consider a number of examples of multiplier algebras on Hilbert spaces associated to discs embedded into a complex ball in order to examine the isomorphism problem for multiplier algebras on complete Nevanlinna-Pick reproducing kernel Hilbert spaces. In particular, we exhibit uncountably many discs in the ball of ` which are multiplier biholomorphic but have non-isomorphic multiplier algebra...