A depth-decreasing heuristic for combinational logic; or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 361-364
- https://doi.org/10.1109/dac.1990.114883
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Timing optimization of combinational logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Size-time complexity of Boolean networks for prefix computationsJournal of the ACM, 1989
- Synthesis and Optimization of Multilevel Logic under Timing ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- Depth-size trade-offs for parallel prefix computationJournal of Algorithms, 1986
- Bounding Fan-out in Logical NetworksJournal of the ACM, 1984
- Parallel Prefix ComputationJournal of the ACM, 1980
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964
- Conditional-Sum Addition LogicIEEE Transactions on Electronic Computers, 1960
- A symbolic analysis of relay and switching circuitsTransactions of the American Institute of Electrical Engineers, 1938