A focus on VLSI algorithms and circuits for basic arithmetic operations used in high-performance systems. This approach exploits the relationship between the algorithm and technology with objective of minimizing the "critical paths" in the implementation. It covers the development of computational structures used to achieve this goal. The intent is to learn the circuit aspects of the computer arithmetic and to maximize the achievable speed for basic and common operations. The lecture treats the algorithm and its implementation as one unit, and attempts to optimize across the boundaries, as opposed to the approaches that have neglected the issues related to the mutual dependencies of implementation and algorithm.