搜索结果: 1-6 共查到“工学 multiplier”相关记录6条 . 查询时间(0.043 秒)
A CMOS 32-bit Wallace Tree Multiplier-Accumulator
CMOS Wallace Tree Multiplier-Accumulator
2015/8/14
IN SPITE OF THEIR SPEED ADVANTAGE, carry save adder trees (CSA or Wallace trees’ ) are seldom, if ever, used in the design of monolithic multipliers. The main reason is the general belief that they ar...
CO2 Emission Multiplier Effects of Taiwan’s Electricity Sector by Input-output Analysis
Input-output analysis Multiplier effect CO2 emission Electricity sector Inter-industry linkage
2016/3/28
From 1990–2009, electricity has played a critical role in supporting industrial development and economic growth in
Taiwan. In this study, a 42-sector input-output table provided the basis for examina...
OLARP:Open Lambda Assignment and Routing Problem – Bandwidth Multiplier for Metro and Access Networks
OLARP Open Lambda Assignment Routing Problem – Bandwidth Multiplie Access Networks
2015/5/21
We consider, for the first time, the problem of flexible/open wavelength assignment and propose an optimal as well as heuristic solution. Simulation results validate our solution to within 15% of the ...
Four quadrant FGMOS analog multiplier
FGMOS four quadrant analog multiplier rail-to-rail differential amplifier
2011/3/23
A novel four-quadrant analog multiplier using floating gate MOS (FGMOS) transistors operating in the saturation region is presented. The drain current is proportional to the square of the weighted sum...
Electronically Tunable Dual-Input Integrator Employing a Single CDBA and a Multiplier: Voltage Controlled Quadrature Oscillator Design
Dual-Input Integrator a Single CDBA a Multiplier Quadrature Oscillator Design
2010/12/3
A new dual-input differential input active integrator using a current differencing buffered amplifier (CDBA) is proposed. A multiplier element is appropriately used in the circuit whose control voltag...
Efficient Large Numbers Karatsuba-Ofman Multiplier Designs for Embedded Systems
finite field Karatsuba-Ofman long numbers multiplication mathematical model
2010/2/2
Long number multiplications (n ≥ 128-bit) are a
primitive in most cryptosystems. They can be performed better by
using Karatsuba-Ofman technique. This algorithm is easy to
parallelize on workstatio...