Digital Design_ Principles and Practices, Chegg Solution Manual_parte_206

Prévia do material em texto

Step 1 of 1 6.02DP Billions of billons of rows in a truth table means at least 4 billion or approximately of rows are needed; it is possible only when the input bits are at least 32. Following are the three examples of combinational logic circuits that require "billions and billions" of rows to describe in a truth table. Combinational Logic Inputs Outputs Rows (Truth Table) Circuits 1. 128 to 1 Multiplexer 128 1 2. 32:5 Encoder 32 5 3. 64 bit Binary Adder 64 32 The truth table of 64 bit Binary Adder has rows for the input combination of addend 64 bits and augend 64 bits in total of 128 input combinations.