Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ARITH
1995
IEEE

favoriteEmaildiscussreport

80views Applied Computing» more ARITH 1995»

Reducing the number of counters needed for integer multiplication

13 years 8 months ago

Reducing the number of counters needed for integer multiplication

Download www.acsel-lab.com

Robert Michael Owens, Raminder Singh Bajwa, Mary J

Real-time Traffic

Applied Computing | ARITH 1995 |

claim paper

Related Content

» Design and performance analysis of a DRAMbased statistics counter array architecture

» Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming

» Integer linear programming approaches for nonunique probe selection

» An ant system with steps counter for the job shop scheduling problem

» DRAM is plenty fast for wirespeed statistics counting

» Reducing Disk IO Performance Sensitivity for Large Numbers of Sequential Streams

» Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages

» Generation of All CounterExamples for PushDown Systems

» Reduced state fair queuing for edge and core routers

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	ARITH
Authors	Robert Michael Owens, Raminder Singh Bajwa, Mary Jane Irwin

Comments (0)