Multiplexer

MUX; A data selector

A multiplexer has binary inputs to chose from an arrangement of signals

4 x 1 mux

Implementation of Boolean Function using Multiplexers, NESO

method

Farshad method
 - If D cannot express F fully, chose another input (like C) to describe the behavior of F.
Then implement the mux using logic gates

- If you have a 4-bit function (16 terms) but need to implement 8x1 MUX. describe D in
intervals of two terms (like shown in farshads method)
- If you instead need to implement a 4x1 MUX (still for a 4-bit function). Desrive D in
intervals of 4 terms.F

Implementing 8X1 MUX using 2X1 MUX

Implementing 8X1 MUX using 4X1 MUX (Special Case)

32X1 MUX using 8X1 MUX

Full subtractor TT
 5.Synchronous Sequential Logic

Moore machines: no input. Output is only determined by current state

Mealy: Output is determined by input and current state

SR latch build from nand / nor

D latch
Master slave D-type Type Flip Flop

Rising edge TRIGGERED JK flip flop

State table
A(t+1)=xy’ + xB
B(t+1)=xA + xB’
State reduction
If next state and output are the same for two terms, delete one of the terms.

FF Synthesis / design procedure

When viewing excitation tables

Consider the present state and next state, for each FF individually.
Then make a TT with FF values and input as variables. The output of said TT being the ff
you want to find the function for.
6.Registers and Counters