Scribd
Upload
25 views4 pages

Definitions DECO

The document defines various digital circuits and codes, including combinational and sequential circuits, adders, subtractors, comparators, multiplexers, demultiplexers, encoders, decoders, and several binary coding systems like Gray code, BCD, XS-3, and 2421 code. Each definition includes a brief explanation of the circuit's function and its applications in digital systems. The document serves as a comprehensive reference for understanding fundamental concepts in digital logic design.

Uploaded by

Bot Arc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views4 pages

Definitions DECO

The document defines various digital circuits and codes, including combinational and sequential circuits, adders, subtractors, comparators, multiplexers, demultiplexers, encoders, decoders, and several binary coding systems like Gray code, BCD, XS-3, and 2421 code. Each definition includes a brief explanation of the circuit's function and its applications in digital systems. The document serves as a comprehensive reference for understanding fundamental concepts in digital logic design.

Uploaded by

Bot Arc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

DEFINITIONS

1. Combinational Circuit
- Definition : A circuit where the output is determined only by the current input
values, without any memory or feedback.
- Working : It takes multiple inputs and produces outputs based on logical
operations (like AND, OR, NOT). For example, a simple circuit that adds two numbers
would immediately give the sum based on the inputs.

2. Sequential Circuit
- Definition : A circuit where the output depends on both the current inputs and
the past inputs (because it uses memory elements like flip-flops).
- Working : These circuits store information from previous inputs, which helps them
determine future outputs. They are used in devices that need to "remember" things,
like counters, clocks, and registers.

3. Adder
- Definition : A circuit that performs addition of two or more binary numbers.
- Working : The simplest adder is a half-adder (adds two single bits), and a full-
adder can add three bits (two input bits and one carry bit). These adders form the
base of more complex arithmetic units in processors.

4. Subtractor
- Definition : A circuit that performs subtraction of binary numbers.
- Working : Like an adder, a half-subtractor subtracts two single bits, while a full-
subtractor subtracts three bits (two input bits and a borrow bit). Subtractors are used
in arithmetic logic units (ALUs).

5. Comparator
- Definition : A circuit that compares two binary numbers and determines their
relationship (equal, greater, or less).
- Working : It outputs signals like "A > B", "A = B", or "A < B" based on the
comparison. Comparators are used in devices like processors and sorting systems.
1|Page
DEFINITIONS

6. Multiplexer (MUX)
- Definition : A circuit that selects one of many input signals and forwards the
selected input to the output.
- Working : It has multiple inputs but only one output. By using selection lines, you
can choose which input should be passed to the output. For example, if you have 4
inputs, a 2-bit selection signal can choose any one of them.

7. Demultiplexer (DEMUX)
- Definition : A circuit that takes a single input and directs it to one of many
outputs.
- Working : It's the reverse of a multiplexer. With a selection line, it routes the input
to the correct output. For example, if there’s one input and 4 possible outputs, the
selection line will decide where the input goes.

8. Encoder
- Definition : A circuit that converts information from 2^n inputs to n outputs
(binary code).
- Working : It takes multiple input signals, like button presses, and encodes them
into a smaller number of output lines. It’s used when you need to compress data, like
in keyboards or sensors.

9. Decoder
- Definition : A circuit that converts n inputs to 2^n outputs (opposite of an
encoder).
- Working : It takes a binary input and activates one specific output based on that
input. For example, it can convert a binary number to a decimal output, like turning
"101" into the 5th output in a series.

10. Gray Code


- Definition : A binary code where two consecutive numbers differ by only one bit.
2|Page
DEFINITIONS
- Working : In normal binary, switching from one number to the next can cause
multiple bits to change, which can lead to errors in certain applications. Gray code
fixes this by ensuring only one bit changes between consecutive numbers. It’s used in
things like rotary encoders to prevent errors in mechanical position tracking.

Example of Gray code:


- Binary: 000, 001, 010, 011, 100
- Gray Code: 000, 001, 011, 010, 110

11. BCD Code (Binary Coded Decimal)


- Definition : A code where each decimal digit (0-9) is represented by its 4-bit
binary equivalent.
- Working : Each decimal digit is converted into its corresponding 4-bit binary. So,
for the decimal number "45", the BCD representation would be:
- 4 in binary = 0100
- 5 in binary = 0101
So, BCD = 0100 0101. It’s used in systems where arithmetic is done in decimal,
like calculators or digital clocks.

12. XS-3 Code (Excess-3 Code)


- Definition : A binary-coded decimal system where each decimal digit is
represented by its binary equivalent, but 3 is added to each digit.
- Working : To convert a number into XS-3 code, you first add 3 to each decimal
digit and then convert it to binary. For example:
- Decimal 2: 2 + 3 = 5 → Binary 0101
- Decimal 7: 7 + 3 = 10 → Binary 1010
XS-3 code is used in arithmetic operations to simplify hardware logic for certain
applications like error detection.

13. Digital Logic Circuit


- Definition : A circuit that operates on binary values (0 and 1) using logical
operations like AND, OR, NOT, etc.
- Working : Digital logic circuits are the foundation of digital devices like computers,
calculators, and smartphones. They use gates to perform logical operations:
- AND gate : Outputs 1 only if both inputs are 1.
- OR gate : Outputs 1 if at least one input is 1.

3|Page
DEFINITIONS
- NOT gate : Outputs the opposite of the input (1 becomes 0, 0 becomes 1).
These gates can be combined to create complex circuits for performing tasks like
adding, comparing, storing, and transmitting data.

14. Self-Complementing Code


Definition: A binary code in which the 1's complement of the code for a number
represents the code of its 9's complement (for decimal systems).
Working: This means that to get the complement (opposite) of a number, you can
simply flip the bits (convert 1s to 0s and 0s to 1s). This type of code is used in
applications where you need to quickly generate a complement of a number for
subtraction or error checking.
Example: Excess-3 Code is a self-complementing code. For instance:
Decimal 2 in XS-3 = 0101
Complement of 2 (9's complement, which is 7) in XS-3 = 1010
In self-complementing codes, the complement is directly obtained by flipping all bits
of the original code.

15. 2421 Code


Definition: A weighted binary code where each digit is assigned weights of 2, 4, 2,
and 1 from left to right.
Working: In the 2421 code, a decimal digit is represented by a 4-bit binary number,
and the binary positions are weighted 2, 4, 2, and 1, respectively. It’s a weighted
code, meaning each bit has a value that contributes to the overall decimal number.
Example: Let’s represent decimal numbers in 2421 code:
Decimal 0 = 0000 (because 20 + 40 + 20 + 10 = 0)
Decimal 3 = 0011 (because 20 + 40 + 21 + 11 = 3)
Decimal 9 = 1001 (because 21 + 40 + 20 + 11 = 9)
The 2421 code is used in systems where efficient error detection and simplicity in
arithmetic operations are needed. Each number’s 1's complement corresponds to its
9's complement, making it a useful weighted code.

4|Page

You might also like