Digital Circuits and Logic Design

adder applied assignment asynchronous circuit B₁ basic binary numbers bipolar Boolean difference Boolean function canonical sum-of-products form carry look-ahead adder chip circuit of Fig column combinational circuit complement complete test set constructed counter decimal number decoder denote described detect distinguishing sequence equivalent essential prime implicants example excess-3 fault table fault-detection Gray code index register instruction J-K flip-flop Karnaugh map literal logic circuit logic design Mealy machine minimal sum minterm Moore machine N₁ N₂ NAND gate number system obtained operation output functions path presented prime-implicant table problem product-of-sums realization s-a-1 faults s-a-1 tests semiconductor sequential circuit sequential machine shift register shown in Fig SM chart Step storage subcubes sum-of-products switching function synchronous T₁ terminal theorem transistors transition table truth table two-level AND-OR variables voltage x₁ x₁x2 Y₁