A Way to Build Efficient Carry-Skip Adders

DOI10.1109/TC.1987.1676855MaRDI QIDQ3786426zbMATH OpenOpenAlexFDO

Authors Alain Guyot, Bertrand Hochet, Jean-Michel Muller

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1987.1676855

zbMATH Keywords

efficient carry-skip addersVLSI

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 4057452
• scientific article; zbMATH DE number 3976938
• scientific article; zbMATH DE number 176877
• Faster carry bit computation for adder circuits with prescribed arrival times
• Statistical carry lookahead adders

Cited in

(7)

• Multilevel reverse-carry addition: Single and dual adders
• Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems
• scientific article; zbMATH DE number 3976938 (Why is no real title available?)
• Conditional-Sum Early Completion Adder Logic
• Statistical carry lookahead adders
• Pipelined adders
• Mathematical analysis of ripple carry adders based on complements

This page was built for publication: A Way to Build Efficient Carry-Skip Adders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786426)