Sciweavers

96 search results - page 1 / 20
» Efficient Mapping of Addition Recurrence Algorithms in CMOS
Sort
View
ARITH
2005
IEEE
13 years 11 months ago
Efficient Mapping of Addition Recurrence Algorithms in CMOS
Efficient adder design requires proper selection of a recurrence algorithm and its realization. Each of the algorithms: Weinberger’s, Ling’s and Doran’s were analyzed for it...
Bart R. Zeydel, Theo T. J. H. Kluter, Vojin G. Okl...
DAC
2004
ACM
14 years 6 months ago
Multiple constant multiplication by time-multiplexed mapping of addition chains
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...
James C. Hoe, Markus Püschel, Peter Tummeltsh...
PAMI
2007
138views more  PAMI 2007»
13 years 4 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
ISCI
2008
95views more  ISCI 2008»
13 years 4 months ago
Modified constrained learning algorithms incorporating additional functional constraints into neural networks
In this paper, two modified constrained learning algorithms are proposed to obtain better generalization performance and faster convergence rate. The additional cost terms of the ...
Fei Han, Qing-Hua Ling, De-Shuang Huang
ISLPED
2010
ACM
206views Hardware» more  ISLPED 2010»
13 years 5 months ago
Energy efficient implementation of parallel CMOS multipliers with improved compressors
Booth encoding is believed to yield faster multiplier designs with higher energy consumption. 16x16-bit Booth and NonBooth multipliers are analyzed in energy and delay space under...
Dursun Baran, Mustafa Aktan, Vojin G. Oklobdzija