Digital Logic and Microprocessors

Each bit position in a parallel adder requires exactly one full adder to handle that bit's addition including carry-in and carry-out. For m bits, we need m full adders. The least significant bit could use a half adder, but a full adder with carry-in=0 provides uniform design.

A sequential circuit's output depends on both the present inputs AND the past inputs (stored in memory elements like flip-flops). Unlike combinational circuits, sequential circuits have memory and maintain state information, so their output is determined by current inputs plus the stored history of previous inputs.

A Carry Save Adder (CSA) is specifically designed to add three or more numbers simultaneously without waiting for the carry to propagate. It uses multiple full adders in parallel and produces two outputs: sum and carry vectors. This makes it much faster for adding multiple numbers compared to ripple carry or regular parallel adders, which typically add only two numbers at a time.

Parallel adders are combinational logic circuits because their outputs depend only on the present inputs - the bits being added. They do not have memory elements or feedback, so they cannot store past inputs or states. The addition operation happens immediately based on current input values, which is the defining characteristic of combinational circuits.

A BCD decoder takes a 4-bit BCD input and activates one of 10 outputs corresponding to decimal digits 0-9. It converts the binary coded decimal into its decimal equivalent by decoding which digit is represented.

A flip-flop always has two outputs Q and Q' (Q bar) that are complements of each other - when Q is high, Q' is low, and vice versa. This complementary output is a fundamental characteristic.

In a JK flip-flop, when both J and K are low (0), the flip-flop holds its previous state - no change occurs at the output. This is the memory/hold state.

Flip-flops are the basic storage elements in digital circuits and are fundamental building blocks for counters, registers, and memory. Counting is achieved by connecting flip-flops in various configurations.

NAND is commutative (A NAND B = B NAND A) but NOT associative. For example: (0 NAND 0) NAND 0 = 1 NAND 0 = 1, but 0 NAND (0 NAND 0) = 0 NAND 1 = 1. However: (0 NAND 1) NAND 1 = 1 NAND 1 = 0, but 0 NAND (1 NAND 1) = 0 NAND 0 = 1, proving non-associativity.

A staircase switch uses two switches to control one light - either switch can toggle the light. XOR gives 1 when inputs differ (one switch on, one off) and 0 when inputs are same (both on or both off), matching the staircase switching logic.

In positive logic systems, logic 1 is represented by the higher voltage level (typically Vcc or +5V in TTL), while logic 0 is represented by the lower voltage level (typically 0V or ground).

Shift registers are versatile digital circuits that can convert parallel data to serial format, serial data back to parallel, and create digital delays by storing and shifting data bits.

A half adder consists of an XOR gate for the sum output and an AND gate for the carry output. The XOR circuit performs the core addition logic for single-bit addition.