Layout-aware synthesis of arithmetic circuits

Proceedings - Design Automation Conference

Volumn , Issue , 2002, Pages 207-212

  Um, Junhyung ^a   Kim, Taewhan ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Carry save adder; High performance; Layout

Indexed keywords

ADDERS; ALGORITHMS; INTEGRATED CIRCUIT LAYOUT; TREES (MATHEMATICS);

ARITHMETIC CIRCUITS;

DIGITAL ARITHMETIC;

EID: 0036057392     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513969.513971     Document Type: Conference Paper

References (26)

1. Optimizing resource utilization using transformations
2. Maximally fast and arbitrarily fast implementation of liner computations
3. Redundant operation creation: A scheduling optimization technique
4. Incremental tree height reduction for high-level synthesis
5. Tree-height minimization in pipelined architectures
6. Optimized pipelinod networks of associative and commutative operators
7. High-level algorithm and architecture transformations for DSP synthesis
8. A specification invariant technique for operation cost minimization in flow-graphs
9. A specification invarinnt technique for regularity improvement between flow-graph clusters
10. Circuit optimization using carry-save-adder cells
11. A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach
12. Optimal circuits for parallel multipliers
13. Improved merging of datapath operators using information content and required precision analysis
14. An optimal allocation of carry-save-adders in arithmetic circuits
15. A practical approach to the synthesis of arithmetic circuits using carry-save adders
16. Signal representation guided synthesis using carry-save adders for synchronous data-path circuits
17. Accurate exploration of timing and area trade-offs in arithmetic optimization using carry-save-adders
18. The use of carry-save representation in joint module selection and ret iming
19. A suggestion for a fast multiplier
20. A linear-time heuristic for improving network partitions
21. An algorithm for path connections and its applications