Cart (Loading....) | Create Account
Close category search window
 

Two operand binary adders with threshold logic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ramos, J.F. ; Dept. of Electron., Malaga Univ., Spain ; Bohorquez, A.G.

The central topic of this paper is the implementation of binary adders with threshold logic using a new methodology that introduces two innovations: the use of the input and output carries of each bit for obtaining all the sum bits and a modification of the classic carry lookahead adder technique that allows us to obtain the expressions of the generation and propagation carries in a more appropriate way for threshold logic. In this way, it has been possible to systematize the process of design of a binary adder with threshold logic relating all its important parameters: number of bits of the operands, depth, size, maximum fan-in, and maximum weight. The results obtained are an improvement on those published to date and are summarized as follows: Depth 2 adder: s=2n, wmax=2n, fmax=2n+1. Depth 3 adder: s=4n-2[n/[√n]], wmax =2[n/[√n]], fmax=2[n/[√n]]+1. Depth d adder (asymptotic behavior): s=O(n), wmax=O(2d-1√n), fmax=O(d-1√n). If the weights are bounded by wmax:nmax=O(logd-1 wmax), d min=O(log n/log(log wmax))

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 12 )

Date of Publication:

Dec 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.