Economical and optimal carry-lookahead (CLA) units for high-speed binary adders View on Open Library

Economical and optimal carry-lookahead (CLA) units for high-speed binary adders

by Stanisław Majerski

No reviews yet
First published: 1988 1 language
Subjects
Computer arithmetic Logic circuits

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

You Might Also Like

More in Computer arithmetic
IP Routing Protocols

IP Routing Protocols

James Aweya
Computer Engineering and Technology

Computer Engineering and Technology

Weixia Xu
Computer Algebra in Scientific Computing

Computer Algebra in Scientific Computing

Vladimir P. Gerdt
Swarm Intelligence Algorithms

Swarm Intelligence Algorithms

Adam Slowik
Logical Foundations of Computer Science

Logical Foundations of Computer Science

Sergei Artemov
Gabi's Fabulous Functions

Gabi's Fabulous Functions

Caroline Karanja