7-5 Microoperation An elementary operations performed on data stored in registers or in memory. Transfer Arithmetic Logic: perform bit manipulation on data in register Bitwise AND, Bitwise OR …. Shift

Arithmetic Microoperations

The control variable X selects the operation, and the control variable K1 loads the result in to R1. Fig. 7.6 Implementation

Logic Microoperations manipulate the bits stored in a register consider each bit in register separately

Logic Microoperations Mask: allow us to deal with some specific bits R1: (data) R2: (mask) <= R1 ←R1^R2

Logic Microoperations R1: (data) R2: (mask) <= R1 ←R1ˇR2 R1: (data) R2: (mask) <= R1 ←R1 R2

Shift Microoperations shift left/shift right incoming bit/outgoing bit

7-6 Microoperation on A single Register Multiplexer-based transfer if (K1=1) then (R0 ← R1 ) else if (K2=1) then (R0 ← R2 ) K1: R0 ← R1, R0 ← R2

Multiplexer-based transfer

Generalization of Multiplexer selection for n sources

Shift Registers Serial input (SI) Serial output (SO)

Shift Register with parallel load

Shift Register with Parallel Load

Bidirectional Shift Register One stage diagram

Bidirectional Shift Register

Ripple counter Structure similar to ripple adder

Synchronous Binary Counter -Serial gating

Synchronous Binary Counter -Parallel gating Only one AND gate delay Four AND gates delay

Up-Down Binary Counter Homework #1 Prove it and draw the logic diagram S=0 up counter S=1 down counter

Binary counter with parallel load Fig It is a case of the up-down counter in the previous slide. (why? what case?)

BCD counter A divide-by-N counter (modulo-N counter) is a counter goes through a repeated sequence of N states Fig. 7-15

Another BCD counter

Modulo 6 counter

Homework #2 Problem 7-15 with modified sequence 0,3,2,1,5,4,7 Run the simulation for the designed circuit by using Quartus II Deal with the unused state as don’t care Test the circuit when the unused state occurs (on paper)