Authors
Andrew Beaumont-Smith, C-C Lim
Publication date
2001/6/11
Conference
Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001
Pages
218-225
Publisher
IEEE
Description
The paper introduces two innovations in the design of prefix adder carry trees: use of high-valency prefix cells to achieve low logical depth and end-around carry adders with reduced fan-out loading (compared with the carry select and flagged prefix adders). An algorithm for generating parallel prefix carry trees suitable for use in a VLSI synthesis tool is presented with variable parameters including carry tree width, prefix cell valency, and the spacing of repeated carry trees. The area-delay design space is mapped for a 0.25 /spl mu/m CMOS technology for a range of adder widths as a comparative study.
Total citations
200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024129753829674591264131075681
Scholar articles
A Beaumont-Smith, CC Lim - Proceedings 15th IEEE Symposium on Computer …, 2001