To convert binary 1001 into Gray code, the first Gray code bit is the same as the first binary bit, so it remains 1. The next Gray code bit is found by performing an XOR operation between consecutive binary bits: 1 XOR 0 = 1, 0 XOR 0 = 0, and 0 XOR 1 = 1. Hence, the Gray code is 1101. Conversely, to convert the Gray code 1010 into binary, start with the first bit as is, giving us 1. The next binary bit is found by XORing the next Gray code bit with the last computed binary bit: 1 XOR 0 = 1, 1 XOR 1 = 0, 0 XOR 0 = 0. Therefore, the binary equivalent is 1100 .

Asynchronous counters, also known as ripple counters, use a series of flip-flops where each flip-flop is triggered by the previous one, creating a propagation delay that can accumulate and affect performance. In synchronous counters, all flip-flops are triggered simultaneously by a common clock pulse, eliminating the ripple effect and thus reducing delays. Practically, synchronous counters are more complex to design due to the clock distribution requirement, but are faster and more reliable for high-speed operations compared to asynchronous counters, making them preferable in systems where timing accuracy is critical .

The 'sum of products' (SOP) is a canonical form where a Boolean expression is represented as an OR of several AND terms, each consisting of literals (variables or their complements). This expression format is fundamental in digital circuit design because it directly corresponds to a two-level logic circuit, where the first level consists of AND gates and the second level consists of a single OR gate. This structure simplifies the design and analysis of digital circuits, making it easier to implement and reduce using techniques like K-maps, ultimately leading to more efficient circuit designs .

The Karnaugh map (K-map) simplifies Boolean expressions by visually representing the expression, which helps in identifying and eliminating redundant terms through pattern recognition of adjacent 1s or 0s. Unlike algebraic simplification, which requires numerous calculations and manipulation of variables, K-maps allow one to directly group and eliminate variables, resulting in a minimized expression more quickly and with less room for error. This method is especially beneficial for simplifying expressions with more than two variables due to its ease of use in visual grouping .

An encoder in combinational logic performs the inverse function of a decoder by converting multiple input lines into binary code output representing the active input line. Unlike decoders, which map binary input to one active output line among many, encoders simplify the input by compressing numerous active signals into a smaller number of binary outputs, reducing the complex communication of signals in digital systems. This is crucial in applications needing signal compression and simplification, such as in priority encoding where only the highest-priority input is recognized .

JK flip-flops are widely used in digital circuits due to their versatility and ability to operate in various modes, such as set, reset, toggle, and no change. Unlike SR flip-flops, JK flip-flops resolve the ambiguity of dealing with both inputs being high, which would otherwise create an indeterminate state, by toggling the output. This makes them more stable and flexible for use in designing counters, shift registers, and memory storage elements. Compared to other flip-flops like D or T flip-flops, JK flip-flops provide more comprehensive control over inputs and outputs, allowing greater functionality in complex circuits .

Universal gates, specifically the NAND and NOR gates, are unique because they can be used to implement any Boolean function without needing any other gate type. This property makes them particularly powerful in digital circuit design. For instance, a NAND gate can be used to create the basic gates (AND, OR, NOT) by combining them in different configurations: using a NAND gate as a NOT gate requires connecting both its inputs together, while creating an AND gate requires a NAND followed by a NOT. This flexibility allows circuit designers to simplify the design and reduce the number of components needed .

Boolean algebra simplifies digital circuit design by providing a set of mathematical rules for expressing and manipulating binary variables and logic operations. Key laws and theorems include De Morgan's Theorems, the Distributive Law, the Associative Law, and the Commutative Law. These laws allow for the transformation and simplification of complex logic expressions into simpler ones, minimizing the number of gates required in a digital circuit and improving efficiency. For instance, the Distributive Law allows one to combine AND gates more simply by re-arranging terms, which can lead to utilizing fewer resources in hardware implementations .

Excess-3 (XS-3) code is a non-weighted code used to express decimal numbers, offering an advantage in certain decimal arithmetic operations. Each decimal digit is represented by the corresponding 4-bit binary number increased by three; hence, it shifts the representation to ensure non-binary decimal points, simplifying some error detection processes. To convert decimal 29 to Excess-3 code, each decimal digit (2 and 9) is converted individually: 2 in binary is 0010, adding 3 gives 0101; 9 in binary is 1001, adding 3 gives 1100. Concatenating these results yields the Excess-3 code as 01011100 .

A multiplexer (MUX) acts as a data selector in digital circuits by channeling multiple input signals into a single line based on selector inputs. A 2-to-1 multiplexer uses one select line and allows the user to select one of the two data inputs (D0 or D1) to be output. Its logic diagram includes two AND gates, an OR gate, and a NOT gate: the NOT gate inverts the selection input before feeding it into one AND gate, while the other AND gate receives the selection input directly. The outputs of these AND gates are then passed to an OR gate which decides the output, effectively selecting data based on the binary value of the select line .