Addition is a primitive operation for most arithmetic functions, so that FPGA vendors have dedicated a particular attention to the design of optimized adders. As a consequence, in many cases the synthesis tools are able to generate fast and cost-effective adders from simple VHDL expressions. Only in the case of relatively long operands can it be worthwhile to consider more complex structures such as carry-skip, carry-select and logarithmic adders.
KeywordsCritical Path Full Adder FPGA Implementation Half Adder Significant Binary Digit
- 1.Parhami B (2000) Computer arithmetic: algorithms and hardware design. Oxford University Press, New YorkGoogle Scholar
- 3.Brent R, Kung HT (1982) A regular layout for parallel adders. IEEE Trans Comput C-31:260–264Google Scholar
- 5.Ercegovac MD, Lang T (2004) Digital arithmetic. Morgan Kaufmann, San FranciscoGoogle Scholar
- 6.Deschamps JP, Bioul G, Sutter G (2006) Synthesis of arithmetic circuits. Wiley, New YorkGoogle Scholar