Combinational Logic

$\newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} $

Chapter 4 Combinational Logic

A truth table enumerates all the possible combinations of a system’s input bits (e.g., "0000", "0001", ... "1111"), and the corresponding outputs. For this reason, the logic described by a truth table is also called combinational. Truth tables, logic equations, and logic gates are fundamental ways to capture the behavior of a digital system, but they are inefficient ways to capture the behavior of a complex digital system. In hardware, as in software, modularity and hierarchy are essential to good design. This chapter discusses several combinational logic functions that are commonly used building blocks for constructing digital systems.

Prev Top Next