Abstract
We develop a time-position Algorithm that results in higher bits per group of the carry skip adder than reported earlier. In other words, this results in a bigger adder that computes in less time than with the other existing algorithms. An approach based on absolute gate delays is used. Performance of the carry skip adders using the developed algorithm has been compared with those of the competing carry ripple and the carry look-ahead adders. The results have been further validated by making models of the adder and simulating them in VHDL.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
