In this chapter we will examine arithmetic circuits as detailed case studies of the principles of combinational logic design. Up to this point, we have concentrated on circuits that manipulate binary numbers as unsigned magnitudes only. We begin this chapter looking at ways to represent both positive and negative numbers in the binary system, and at the various schemes for adding and subtracting signed numbers. Then we will revisit the circuits for the half and full adder, as these form the basis for just about every arithmetic circuit we will meet.## Introduction

Arithmetic circuits provide excellent examples of the trade-offs between circuit speed and complexity. We will examine two approaches for high-speed addition,

We will also learn how to design one of the most important subsystems in a digital computer: the

5.2. Networks for Binary Addition

5.3. Arithmetic Logic Unit Design

5.4. BCD Addition

5.5. Combinational Multiplier

5.6. An 8 x 8 Bit Multiplier

Chapter Review

Exercises

[Table of Contents] [Next] [Prev]

randy@cs.Berkeley.edu;