Switching Circuits | 开关电路

📚 Switching Circuits | 开关电路

Switching circuits are logical models used to represent and design digital systems, forming a core topic in IB discrete mathematics. By applying Boolean algebra to networks of on-off switches, students learn to analyze, simplify, and construct logic circuits that underpin modern computing. This article systematically explains the key concepts, from basic gates to Karnaugh map minimization, helping you master the skills required for exam success.

开关电路是用于表示和设计数字系统的逻辑模型，也是IB离散数学中的核心主题。通过将布尔代数应用于通断开关网络，学生能够分析、简化并构建支撑现代计算的逻辑电路。本文系统地讲解从基本门电路到卡诺图化简的关键概念，帮助你掌握考试成功所需的技能。

1. Introduction to Switching Circuits | 开关电路简介

A switching circuit consists of interconnected components whose states (ON or OFF) can be modelled using two constant values, typically 1 and 0. In Boolean algebra, these values correspond to TRUE and FALSE, and the circuit’s behaviour is described by logical expressions that combine input variables via basic operations.

开关电路由相互连接的组件构成，其状态（开或关）可以用两个常量（通常是1和0）来建模。在布尔代数中，这些值对应于真和假，电路行为则通过逻辑表达式来描述，这些表达式通过基本运算将输入变量组合起来。

Understanding switching circuits begins with the concept of a logic gate – a device that performs a Boolean function on one or more inputs to produce a single output. The three fundamental gates are AND, OR, and NOT, from which any digital system can be built.

理解开关电路首先要了解逻辑门的概念——一种对单个或多个输入执行布尔函数并产生单一输出的器件。三种基本门是与门、或门和非门，利用它们可以构建任何数字系统。

---

2. Basic Logic Gates | 基本逻辑门

Logic gates are the building blocks of switching circuits. Each gate implements a specific Boolean operation. The AND gate outputs 1 only if all inputs are 1; the OR gate outputs 1 if at least one input is 1; the NOT gate (inverter) outputs the opposite logical value of its single input.

逻辑门是开关电路的基本构件。每个门实现一种特定的布尔运算。与门仅在所有输入均为1时才输出1；或门只要至少一个输入为1便输出1；非门（反相器）输出其单一输入的逻辑相反值。

These gates can be represented by standard symbols, truth tables, and Boolean expressions. For instance, an AND gate with inputs A and B is written algebraically as A ∧ B or A·B.

这些门可以用标准符号、真值表和布尔表达式表示。例如，具有输入A和B的与门用代数形式表示为A ∧ B 或 A·B。

---

3. Truth Tables and Boolean Expressions | 真值表与布尔表达式

A truth table lists all possible input combinations and the corresponding output of a logic gate or circuit. For a two-input AND gate, the truth table is:

真值表列出了所有可能的输入组合以及逻辑门或电路对应的输出。对于二输入与门，真值表如下：

A	B	A ∧ B
0	0	0
0	1	0
1	0	0
1	1	1

Boolean expressions describe the logic mathematically. The output F of a circuit combining AND and OR gates might be F = (A ∧ B) ∨ (C ∧ ¬D). Such expressions can be simplified using algebraic laws.

布尔表达式用数学语言描述逻辑。一个组合了与门和或门的电路，其输出F可能是F = (A ∧ B) ∨ (C ∧ ¬D)。这类表达式可以利用代数定律进行化简。

---

4. The AND Gate in Detail | 深入与门

The AND gate performs logical conjunction. Its operation is analogous to series-connected switches: current flows only when both switches are closed. The Boolean identity A ∧ 0 = 0 and A ∧ 1 = A highlight how the gate behaves with constant inputs.

与门执行逻辑合取运算。其操作类似于串联的开关：只有当两个开关都闭合时才有电流。布尔恒等式A ∧ 0 = 0 和 A ∧ 1 = A 突显了该门在恒定输入下的行为。

Multiple AND gates can be cascaded. A three-input AND gate yields output 1 only when all three inputs are 1. Its expression is A ∧ B ∧ C, and it obeys the associative law: (A ∧ B) ∧ C = A ∧ (B ∧ C).

多个与门可以级联。一个三输入与门仅在三个输入均为1时才输出1。其表达式为A ∧ B ∧ C，且遵循结合律：(A ∧ B) ∧ C = A ∧ (B ∧ C)。

---

5. The OR Gate in Detail | 深入或门

The OR gate performs logical disjunction. It resembles parallel switches, where closing any one switch establishes a conducting path. The OR gate satisfies A ∨ 0 = A and A ∨ 1 = 1.

或门执行逻辑析取运算。它类似于并联开关，其中任意一个开关闭合就形成通路。或门满足A ∨ 0 = A 和 A ∨ 1 = 1。

The inclusive OR operation obeys commutativity and associativity. When combined with AND and NOT, it forms the basis for sum-of-products (SOP) expressions, the standard form used in circuit simplification.

或运算满足交换律和结合律。当与与门和非门结合时，它构成“积之和”(SOP)表达式的基础，这是电路化简中的标准形式。

---

6. The NOT Gate and Inversion | 非门与反相

The NOT gate, or inverter, has a single input and produces the complement. Algebraically, it is denoted by a bar or the symbol ¬, so ¬A (or A’) means NOT A. Its truth table is simple: when A = 0, ¬A = 1; when A = 1, ¬A = 0.

非门，也就是反相器，只有一个输入并产生其补值。代数上用上划线或符号¬表示，因此¬A（或A’）意为非A。它的真值表很简单：当A=0时，¬A=1；当A=1时，¬A=0。

Inversion plays a crucial role in implementing functions and in De Morgan’s laws, which relate conjunctions and disjunctions under negation.

反相在实现函数以及体现否定下合取与析取关系的德摩根定律中起着关键作用。

---

7. Combining Gates: Compound Circuits | 组合门：复合电路

Real-world circuits use combinations of AND, OR, and NOT gates. A typical compound circuit might compute F = (A ∧ ¬B) ∨ (¬A ∧ B), which is the XOR (exclusive OR) operation. The truth table of this expression confirms that output is 1 only when A and B differ.

现实电路使用与门、或门和非门的组合。一个典型的复合电路可能计算F = (A ∧ ¬B) ∨ (¬A ∧ B)，这正是异或(XOR)运算。该表达式的真值表证实只有当A和B不同时输出才为1。

Building a truth table for a compound circuit requires systematically evaluating intermediate outputs for all input combinations. This skill is essential for verifying design correctness before physical implementation.

为复合电路构建真值表需要系统地为所有输入组合求取中间输出值。在设计物理实现之前，这一技能对于验证设计正确性至关重要。

---

8. Simplifying Switching Circuits using Boolean Algebra | 使用布尔代数简化开关电路

Boolean algebra provides a set of laws to reduce complex expressions to simpler, equivalent forms. The fundamental laws include commutativity (A ∨ B = B ∨ A), associativity, distributivity (A ∧ (B ∨ C) = (A ∧ B) ∨ (A ∧ C)), absorption (A ∨ (A ∧ B) = A), and De Morgan’s laws.

布尔代数提供了一套将复杂表达式化简为更简单等价形式的定律。基本定律包括交换律(A ∨ B = B ∨ A)、结合律、分配律(A ∧ (B ∨ C) = (A ∧ B) ∨ (A ∧ C))、吸收律(A ∨ (A ∧ B) = A)以及德摩根定律。

De Morgan’s laws state: ¬(A ∧ B) = ¬A ∨ ¬B and ¬(A ∨ B) = ¬A ∧ ¬B. These are particularly useful when converting between AND-OR and NAND-NAND implementations.

德摩根定律表述为：¬(A ∧ B) = ¬A ∨ ¬B 和 ¬(A ∨ B) = ¬A ∧ ¬B。在AND-OR实现与NAND-NAND实现之间相互转换时，这些定律尤为有用。

Example: Simplify F = A ∧ (A ∨ B). Using absorption: A ∧ (A ∨ B) = A. The gate count reduces from two to zero (just a wire).

示例：化简 F = A ∧ (A ∨ B)。利用吸收律：A ∧ (A ∨ B) = A。门数量从两个减少到零（只需一根导线）。

---

9. Simplification using Karnaugh Maps | 使用卡诺图简化

A Karnaugh map (K-map) is a graphical tool for minimizing Boolean expressions of up to four variables. It arranges minterms in a grid such that adjacent cells differ by only one variable, allowing visual grouping of adjacent 1s to identify simplified product terms.

卡诺图是一种用于最小化最多四个变量的布尔表达式的图形工具。它将最小项排列在一个网格中，使得相邻单元之间只有一个变量不同，从而能通过视觉上将相邻的1分组来识别简化的乘积项。

For a three-variable function F(A,B,C), a typical K-map uses AB as row labels (Gray code order: 00, 01, 11, 10) and C as column label. Groups of size 1, 2, 4, or 8 are circled, ensuring each group is a power of two and as large as possible.

对于三变量函数F(A,B,C)，典型的卡诺图使用AB作为行标签（格雷码顺序：00, 01, 11, 10），C作为列标签。可以圈出大小为1、2、4或8的组，确保每个组的大小为2的幂次且尽可能大。

Example: F = Σ(1,3,6,7) maps to F = A·C + B·C’ or similar depending on mapping. K-map simplification directly leads to minimal sum-of-products circuits.

示例：F = Σ(1,3,6,7) 经过卡诺图化简可得F = A·C + B·C’ 或类似表达式，具体取决于映射。卡诺图化简直接导向最小积之和电路。

---

10. NAND and NOR Gates as Universal Gates | 与非门和或非门作为通用门

NAND and NOR gates are called universal gates because any Boolean function can be implemented using only NAND gates or only NOR gates. A NAND gate is equivalent to an AND followed by a NOT; a NOR gate is an OR followed by a NOT.

与非门和或非门被称为通用门，因为任何布尔函数都可以仅用与非门或仅用或非门来实现。一个与非门等效于一个与门后接非门；一个或非门等效于一个或门后接非门。

To realize an inverter using NAND: tie both inputs together, then NAND(A,A) = ¬(A ∧ A) = ¬A. Similarly, an AND function can be built with two NANDs: first NAND then inverter NAND. This universality makes manufacturing simpler and more cost-effective.

要使用与非门实现反相器：将两个输入连接在一起，则NAND(A,A) = ¬(A ∧ A) = ¬A。类似地，与函数可以用两个与非门构建：先与非再经与非反相。这种通用性使制造更简单、更具成本效益。

---

11. Design of Switching Circuits from Problem Statements | 从问题描述设计开关电路

Designing a switching circuit often starts with a word problem. The process involves defining input and output variables, constructing a truth table, deriving an initially un-simplified sum-of-products expression, and then minimizing the expression using Boolean algebra or a K-map.

设计开关电路通常从一个文字问题开始。过程包括定义输入输出变量、构建真值表、推导初始的未简化积之和表达式，然后利用布尔代数或卡诺图将其最小化。

Example design a circuit that gives output 1 when two out of three sensors indicate a fault. Set inputs A,B,C as sensors (1 = fault). The truth table shows output 1 for combinations 011, 101, 110, 111. The resulting SOP expression after simplification yields a single two-level gate implementation.

例如，设计一个当三个传感器中有两个显示故障时输出1的电路。设输入A,B,C为传感器（1=故障）。真值表显示组合011、101、110、111时输出1。由此得到的SOP表达式经化简后产生一个单一级的两级门实现。

---

12. Real-life Applications and Summary | 实际应用与总结

Switching circuits are not abstract mathematical curiosities; they form the foundation of processors, memory units, and control systems in every digital device. Mastery of Boolean simplification directly impacts the efficiency, speed, and power consumption of microchips.

开关电路并非抽象的数学奇谈，它们构成了每个数字设备中处理器、存储单元和控制系统的基础。掌握布尔化简直接影响微芯片的效率、速度和功耗。

In summary, the IB switching circuits topic integrates truth tables, logic gates, Boolean algebra, and Karnaugh maps into a powerful set of tools for digital circuit analysis and design. Practice converting between expressions, tables, and minimal circuits to ensure complete understanding.

总之，IB开关电路专题将真值表、逻辑门、布尔代数和卡诺图整合为一套用于数字电路分析与设计的强大工具。在表达式、表格和最简电路之间不断练习转换，以确保透彻理解。

Published by TutorHao | Maths Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）