High-speed polynomial basis multipliers over GF(2(m)) for special pentanomial.

Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.

Comparing fiscal multipliers across models and countries in Europe. National Bank of Belgium Working Paper No. 278, March 2015

This paper employs fifteen dynamic macroeconomic models maintained within the European System of Central Banks to assess the size of fiscal multipliers in European countries. Using a set of common simulations, we consider transitory and permanent shocks to government expenditures and different taxes. We investigate how the baseline multipliers change when monetary policy is transitorily constrained by the zero nominal interest rate bound, certain crisis-related structural features of the economy such as the share of liquidity-constrained households change, and the endogenous fiscal rule that ensures fiscal sustainability in the long run is specified in terms of labour income taxes instead of lump-sum taxes.

History and general catalogue of LaGrange Collegiate Institute : situated at Ontario, LaGrange Co., Ind.

Mode of access: Internet.

On N-dimensional Taylor and Lagrange operators /

"AEC Contract AT(04-3)-400."

Oeuvres de Lagrange /

T. 1 - T. 2 - T. 3 -T. 4 - T. 5 - T. 6 - T. 7 -T. 8 -T. 9 - T. 10 - T. 11 - T. 12 - T. 13 - T. 14.

Journal de la Société des Pharmaciens de Paris ou recueil d'observations de chimie et de pharmacie, publié pendant les années VI, VII [et] VIII de la République par les citoyens Fourcroy, Vauquelin, Parmentier, Déyeux et Bouillon-Lagrange ... formant un volume in-quarto ...

Mode of access: Internet.

Intorno alla vita ed alle opere di Luigi Lagrange /

Discorso letto nel R. Liceo Galilei di Pisa per la Festa Letteraria Commemorativa.

Regional multipliers : a user handbook for the regional input-output modeling system (RIMS II) /

"May 1986."

Elogio di Luigi Lagrange.

Errata: p. [143].

Die Principien der höheren Analysis in ihrer Entwicklung von Liebniz bis auf Lagrange, als ein historisch-kritischer Beitrag zur Geschichte der Mathematik dargestellt,

Mode of access: Internet.

Œuvres de Lagrange,

Mode of access: Internet.

Uber Kartenprojection. Abhandlungen von Lagrange (1779) und Gauss (1822)

Mode of access: Internet.

A data-pooling approach to estimate employment multipliers for small regional economics /

Issued May 1978.

Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems

This paper describes two algorithms for adaptive power and bit allocations in a multiple input multiple output multiple-carrier code division multiple access (MIMO MC-CDMA) system. The first is the greedy algorithm, which has already been presented in the literature. The other one, which is proposed by the authors, is based on the use of the Lagrange multiplier method. The performances of the two algorithms are compared via Monte Carlo simulations. At present stage, the simulations are restricted to a single user MIMO MC-CDMA system, which is equivalent to a MIMO OFDM system. It is assumed that the system operates in a frequency selective fading environment. The transmitter has a partial knowledge of the channel whose properties are measured at the receiver. The use of the two algorithms results in similar system performances. The advantage of the Lagrange algorithm is that is much faster than the greedy algorithm. ©2005 IEEE