A 4-bit Parallel Adder is a combinational circuit used to add two 4-bit binary numbers. It consists of four Full Adders connected in cascade. Each Full Adder adds:
Block RepresentationA3 B3 A2 B2 A1 B1 A0 B0
| | | | | | | |
+-----+ +-----+ +-----+ +-----+
| FA3 |<---| FA2 |<---| FA1 |<---| FA0 |
+-----+ +-----+ +-----+ +-----+
| | | |
S3 S2 S1 S0
Carry Out = C4Maximum 4-bit number:
1111₂ = 15₁₀Adding two maximum numbers:
1111
1111
-----
11110Result:
Therefore,Maximum number of bits in output = 5 bits
A = 1111
B = 1111
Output = 11110Hence:Sum Output = S3 S2 S1 S0 + Carry-Out = 5 bits
A Multiplexer (MUX) is a combinational circuit that selects one input from many inputs and transfers it to a single output.
Many-to-One Data Selector
For n Select Lines:
Number of Inputs = 2ⁿInputs:
I0, I1, I2, I3Select Lines:
S1, S0Output Equation:
Y = I0S̅1S̅0 + I1S̅1S0 + I2S1S̅0 + I3S1S0For a 2:1 MUX:
I0 = 0
I1 = 1
S = 1Output Equation:
Y = S̅I0 + SI1Substituting values:
Y = (0×0) + (1×1)
Y = 1Output = 1
A Shift Register is a group of flip-flops used for storage and transfer of binary data.
For n bits:
Each clock pulse shifts data by one stage.For an n-bit register:
For a 4-bit SIPO:
Input Data = 1011
Clock 1 → 1
Clock 2 → 10
Clock 3 → 101
Clock 4 → 1011After 4 pulses:
Q3 Q2 Q1 Q0 = 1011Parallel outputs can be read simultaneously.
| Operation | Clock Pulses |
|---|---|
| Input Loading | 1 |
| Output Reading | 0 |
For a 4-bit PIPO Register:
Input = 1101After one clock pulse:
Output = 1101No additional clock pulse is required to read the output.
A Full Subtractor subtracts:
A − B − Binwhere:
Outputs:
D = A ⊕ B ⊕ BinA = 1
B = 0
Bin = 1D = 1 ⊕ 0 ⊕ 1
D = 0| A | B | Bin | D | Bout |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 |
A Ring Counter is a recirculating shift register.
Serial Output is connected back to Serial Input.
Q0 → Q1 → Q2 → Q3 → Q4
↑ ↓
└─────────────────┘For n Flip-Flops:
Number of States = n5-bit Ring Counter:
States = 5A Serial Adder performs addition one bit at a time.
Each Full Adder waits for the carry generated by the previous Full Adder.
Memory Capacity:
4 KBConversion:
4 × 1024
= 4096 BytesSince:
4096 = 2¹²Required Address Lines:
n = 12Answer = 12 Address Lines
Subtraction is performed as:
A + (2's Complement of B)If the result is positive:
Carry-Out Bit is Ignored9 - 5
1001
+1011 (2's complement of 5)
------
10100Ignoring carry:
0100 = 4A T Flip-Flop toggles when:
T = 1Initial:
Q = 0After Clock Pulses:
| Pulse | Q |
|---|---|
| Initial | 0 |
| 1st | 1 |
| 2nd | 0 |
| 3rd | 1 |
Final Output:
Q = 1Only the first flip-flop receives the external clock.Each subsequent flip-flop receives clock from the previous flip-flop output.
CLK → FF0 → FF1 → FF2 → FF3Clock input of every flip-flop except the first is connected to:Output of Previous Flip-Flop
A Decoder converts binary input into one active output line.
For n inputs:
Outputs = 2ⁿBCD to Decimal Conversion
BCD Input
↓
Decoder
↓
Decimal OutputTherefore:A circuit used to convert a BCD number into equivalent decimal form is called a Decoder.
For n Flip-Flops:
2ⁿ2ⁿ − 1Condition:
2ⁿ ≥ MOD Number2⁴ = 16 ≥ 10Therefore:
Required Flip-Flops = 4Also called:
Divide-by-10 CounterA Johnson Counter is a modified Ring Counter.
Inverted output of last flip-flop is fed back to first flip-flop.
Q̅n → First Flip-Flop InputFor n Flip-Flops:
MOD = 2nUnused States = 2ⁿ − 2nFor n-bit Ripple Counter:
Maximum Delay = n × tpdwhere:
tpd = Propagation Delay per Flip-Flopn = 4
tpd = 25 nsDelay = 4 × 25
= 100 nsFor synchronous counter:
Delay = tpd of one Flip-Flop onlyThe parallel outputs of a counter represent:Clock Count
For output:
1010₂Count Value:
10₁₀Thus, parallel outputs provide binary representation of the count.
| IC Number | Function |
|---|---|
| 7400 | Quad 2-input NAND |
| 7402 | Quad 2-input NOR |
| 7404 | Hex NOT Gate |
| 7408 | Quad 2-input AND |
| 7411 | Triple 3-input AND |
For n Variables:
| Variables | Boolean Functions |
|---|---|
| 0 | 2 |
| 1 | 4 |
| 2 | 16 |
| 3 | 256 |
| 4 | 65536 |
For 4 Variables:
Number of Boolean Functions = 65536A Master-Slave Flip-Flop consists of two cascaded flip-flops:
Clock
↓
Master FF
↓
Slave FF
↓
OutputLatest master output transfers to slave.
A Flip-Flop is the basic storage element of digital electronics.
Output depends on:
Therefore:Basic building block of sequential logic circuit = Flip-Flop
| Feature | FDM | TDM |
|---|---|---|
| Signal Type | Analog | Digital |
| Resource Sharing | Frequency Slots | Time Slots |
| Synchronization | Not Required | Required |
| Crosstalk | More | Less |
| Complexity | High | Low |
| Cost | Higher | Lower |
| Efficiency | Lower | Higher |
| Propagation Delay | Absent | Present |
A Flip-Flop has two stable states:
0 and 1State Sequence:
0 → 1 → 0 → 1 → ...Number of States:
2Therefore:A Single Flip-Flop acts as a MOD-2 Counter.