Implementation And Analogy Of Fast Adder Using Fpga
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2014, Vol 3, Issue 1
Abstract
Fast adder is a type of an adder used in digital logic to implement speed by reducing the amount of time required to determine the carry bit. this paper deals with high data rate of implementation of adders on the field programmable gate array(FPGA) it is the best hardware design which is implemented on FPGA, different architecture has been implemented and compare on the basis of design in terms of carry propagation delay, area required, power ,slice occupied and numbers of LUT’S.
Authors and Affiliations
Preeti S. Manohare, Rohit C. Iyer
Keywords
Related Articles
- EP ID EP27824
- DOI -
- Views 294
- Downloads 0
(NCECD) A Novel Data Distribution Scheme for VoD Services in P2P Networks
Anonymizing networks such as Tor allow users to access internet services privately by using a series of routers to hide the client’s IP address from the server. The success of such networks However has been limited b...
Inter Transactional Association Rule Mining using Boolean Matrix
One of the extensions of the data mining is Temporal data mining, which mines or discovers knowledge and patterns from temporal information which includes time attribute analysis. From the various types of temporal...
Decentralized Probabilistic Text Clustering by using Distributed Hierarchical peer to peer Clustering
Document clustering (or text clustering) is the application of cluster analysis to textual documents. It has applications in automatic document organization, topic extraction and fast information retrieval or filteri...
Securitized Patient Monitoring Telemetry System Using Zigbee
Nowadays due to the increase of elderly people across the world the problem of home-care for elderly people is becoming a challenging task. To overcome this wireless sensor networks are used to structure home-care sy...
Efficient data structure method for spatial objects retrival Using string
This work deals with the surmised string look for in considerable spatial databases. Specifically, we look at reach inquiries expanded with a string similarity look for predicate in both Euclidean space and street fr...