Digital Logic Basics: Signals, Number Systems & Boolean Algebra

TAKEAWAYS:

• Digital logic uses discrete signals (binary) to represent data, unlike analog signals (continuous), enabling reliable computation in devices like smartphones and computers.
• The binary system (base-2) is the backbone of digital systems, with conversions to decimal, hexadecimal (base-16), and octal (base-8) critical for programming and hardware design.
• Gray code minimizes errors in data transmission by changing only one bit between consecutive numbers, used in encoders like those in eSewa’s QR code generation.
• Boolean algebra (AND, OR, NOT) forms the mathematical foundation for designing logic gates and circuits, while the binary system is purely numerical.
• Complements (1’s and 2’s) simplify subtraction and arithmetic operations in hardware, like how Khalti processes transactions using binary arithmetic for speed.
• Positional number systems (binary, decimal, hex) enable efficient data representation, while floating-point formats (IEEE 754) handle real-world precision in scientific calculations.

---

1. Analog vs. Digital Signals

Digital logic operates on discrete signals (binary: 0 or 1), unlike analog signals (continuous, like sound waves). This distinction is critical for modern electronics.

Key Definitions

• Analog Signal: A continuous signal representing physical quantities (e.g., temperature, voltage).

  flowchart LR
    A["Analog Signal"] -->|"Example"| B["Sound Wave"]
    A -->|"Characteristics"| C["Continuous\nInfinite values"]

• Digital Signal: Discrete values (0 or 1) representing data in binary form.

  flowchart LR
    A["Digital Signal"] -->|"Example"| B["Computer Data"]
    A -->|"Characteristics"| C["Discrete\nTwo states (0/1)"]

Why Digital?

---

2. Number Systems in Digital Logic

Digital systems use positional number systems to represent data. The most common are:

1. Binary (Base-2): Used directly by computers.
2. Decimal (Base-10): Human-readable.
3. Hexadecimal (Base-16): Compact representation of binary.
4. Octal (Base-8): Used in older systems.

Binary Number System

• Digits: 0 and 1.
• Weight: Each bit represents $2^n$ where $n$ is its position (right to left, starting at 0).
• Example: $1011_2=1\times 2^3+0\times 2^2+1\times 2^1+1\times 2^0=11_{10}$.

Worked Example: Convert $110101_2$ to Decimal $$1\times 2^5+1\times 2^4+0\times 2^3+1\times 2^2+0\times 2^1+1\times 2^0=32+16+0+4+0+1=53_{10}$$

Hexadecimal (Hex) and Octal Systems

Worked Example: Convert $2A{3}_{16}$ to Binary

• Break into digits: $2,A,3$.
• Convert each to 4-bit binary:
  • $2=0010$
  • $A=1010$
  • $3=0011$
• Combine: $001010100011_2=1010100011_2$.

---

3. Gray Code

Gray code is a non-weighted binary code where only one bit changes between consecutive numbers. Used in:

• Error-prone systems (e.g., encoders in eSewa’s QR code scanners).
• Avoiding glitches in digital circuits.

Gray Code Conversion

Method:

1. Start with binary number.
2. For each bit (left to right), XOR with the next higher bit.

Example: Convert $1011010_2$ to Gray Code

Final Gray Code: $1110111$.

---

4. Binary-Coded Decimal (BCD)

BCD represents decimal digits (0-9) using 4-bit binary. Each decimal digit is stored as a separate binary number.

Example: $45_{10}=01000101_{BCD}$.

Use Case: ATM machines (Nepal’s Nabil Bank ATMs) use BCD to display decimal numbers accurately.

---

5. Complements in Digital Logic

Complements simplify subtraction and arithmetic operations in hardware.

Types of Complements

1. 1’s Complement: Invert all bits (0 → 1, 1 → 0).
   • Example: $1010_2$ → $0101_2$.
2. 2’s Complement: Add 1 to the least significant bit (LSB) of the 1’s complement.
   • Example: $1010_2$ → $0101_2$ (1’s) → $0110_2$ (2’s).

Worked Example: Subtract $13_{10}-5_{10}$ Using 2’s Complement

1. Convert to 8-bit binary:
   • $13_{10}=00001101_2$
   • $5_{10}=00000101_2$
2. Find 2’s complement of $5$:
   • $00000101_2$ → $11111010_2$ (invert) → $11111011_2$ (add 1).
3. Add to $13$:

     00001101
   + 11111011
   ---------
    10001000
   

4. Discard overflow: $00010000_2=8_{10}$ (incorrect due to end-around carry; correct result is $8_{10}$).

Real-World Tie-In:

• Khalti’s transaction processing uses 2’s complement arithmetic for fast subtraction in payment validations.

---

6. Boolean Algebra vs. Binary System

Example of Boolean Expression: $$F=A\cdot \overline{B}+\overline{A}\cdot B\text{(XOR gate)}$$

---

7. IEEE 754 Floating-Point Representation

Used in scientific calculations (e.g., NEPSE stock price fluctuations).

Single Precision (32-bit)

Worked Example: Convert $64.35_{10}$ to IEEE 754 Double Precision

1. Binary Representation:
   • Integer part: $64_{10}=1000000_2$.
   • Fractional part: $0.35_{10}\approx 0.01011001100110011_2$ (first 53 bits).
   • Combined: $1000000.01011001100110011_2$.
2. Normalize: Shift left to get $1.0000000101100110011\times 2^6$.
3. Exponent: $6+1023=1029_{10}=10000000101_2$ (11 bits).
4. Mantissa: Drop leading 1 and take next 52 bits: $000000010110011001100110011001100110011001100110011$.
5. Final Representation:
   • Sign: 0 (positive).
   • Exponent: 10000000101.
   • Mantissa: 000000010110011001100110011001100110011001100110011.
   • Hex: 402E35F15F15F15F.

---

In the Real World

1. eSewa’s QR Code Generation

   • Uses Gray code to minimize errors in QR code scanning, ensuring accurate transaction processing even with slight distortions.

2. Khalti’s Transaction Arithmetic

   • Relies on 2’s complement arithmetic for fast subtraction in validating payment amounts, reducing processing time.

3. Ncell’s SIM Card Authentication

   • Employs Boolean algebra in logic gates to verify user credentials securely during network access.

4. NEPSE Stock Price Displays

   • Uses IEEE 754 floating-point to represent fractional stock prices with high precision, critical for financial calculations.

5. Daraz’s Order Queue Management

   • Binary counters track order status (e.g., 001 = processing, 100 = shipped), enabling efficient inventory management.

---

Exam Tip

1. Memorize Conversions:

   • Practice converting between binary, decimal, hex, and octal under time pressure. Use shortcuts like grouping binary into nibbles (4 bits) for hex conversion.
   • Example: $11011010_2=D_{16}$.

2. Gray Code Tricks:

   • For exams, use the XOR method for conversion. If stuck, write out the binary and Gray code side-by-side to spot patterns.

3. Complement Operations:

   • Always add 1 to the LSB after inverting bits for 2’s complement. Double-check subtraction by verifying the result’s sign bit.

4. IEEE 754 Pitfalls:

   • Remember the bias (127 for single, 1023 for double precision). Forgetting to add it will lead to incorrect exponents.
   • Shortcut: For positive numbers, exponent bits = actual exponent + bias.

5. Boolean vs. Binary:

   • Boolean algebra is about logic operations (AND, OR), while binary is about numbers. Mixing them up in definitions will lose marks.

6. Real-World Applications:

   • Examiners love tying concepts to local examples (e.g., "How does Khalti use 2’s complement?"). Prepare 2-3 such examples per topic.

---

Final Note: This unit is the foundation of digital logic. Master conversions, Gray code, and complements first—they appear in every subsequent unit. Use flashcards for binary-hex-octal conversions and practice IEEE 754 with online calculators. Good luck!