Absfruct-An improved variation on the carry look-ahead adder has been proposed by Ling. Ling's approach is based on the propagation of a composite term in place of the conventional look-ahead carry. This approach gives an adder that is faster and less expensive. In this paper, Ling's adder is introduced and described in a general manner in order to expose… (More)
Here we summarise the properties and algorithms of the Gray code. Descriptions are given of the Gray code definition, algorithms and circuits for generating the code and for conversion between binary and Gray code, for incrementing, counting, and adding Gray code words. Some interesting applications of the code are also treated. Java implementations of the… (More)
Questions answered in this lecture: How to run process when not enough physical memory? When should a page be moved from disk to memory? What page in memory should be replaced? How can the LRU page be approximated efficiently?
This surveys algorithms and circuits for integer division in special cases. These include division by constants, small divisors, exact divisors, and cases where the divisor and the number base have a special relationship. The related operation of remainder is also covered. Various prior techniques are treated in a common framework. Worked examples are… (More)