IB & CCEA Computer Science: Logic Gates Essentials | IB CCEA 计算机：逻辑门考点精讲

📚 IB & CCEA Computer Science: Logic Gates Essentials | IB CCEA 计算机：逻辑门考点精讲

Logic gates form the fundamental building blocks of digital circuits and computer processors. In the IB and CCEA Computer Science syllabi, you are expected not only to recognise each gate symbol and its truth table, but also to apply Boolean algebra, simplify expressions, and analyse combinational logic. This article walks you through every essential concept, from basic gates to adders, using clear explanations, worked examples, and bilingual clarity.

逻辑门是数字电路和计算机处理器最基本的构建单元。在 IB 和 CCEA 计算机科学的考纲中，你不仅要识别每种门的符号和真值表，还要能应用布尔代数化简表达式、分析组合逻辑。这篇文章将带你逐一攻克所有核心概念——从基本门到加法器，用清晰解释、实例演示和中英双语把难点讲透。

1. What Are Logic Gates? | 什么是逻辑门？

A logic gate is an electronic component that implements a Boolean function, taking one or more binary inputs and producing a single binary output (0 or 1). In both IB and CCEA courses, you will study seven fundamental gates: NOT, AND, OR, NAND, NOR, XOR, and XNOR. Understanding these gates is the first step toward designing and simplifying complex digital systems, such as the Arithmetic Logic Unit (ALU) inside a CPU.

逻辑门是一种实现布尔函数的电子元件，它接收一个或多个二进制输入，并产生单一的二进制输出（0 或 1）。在 IB 和 CCEA 课程中，你将学习七种基本门：非门、与门、或门、与非门、或非门、异或门和同或门。理解这些门是设计和简化复杂数字系统（如 CPU 中的算术逻辑单元）的第一步。

2. Basic Gates: AND, OR, NOT | 基本门：与门、或门、非门

The NOT gate (inverter) has only one input. Its output is the opposite of the input: output Q = NOT A, written as Q = Ā. The truth table is simply: if A = 0 then Q = 1; if A = 1 then Q = 0. The gate symbol is a triangle with a small circle at the tip.

非门（反相器）只有一个输入端，输出与输入相反：Q = NOT A，写作 Q = Ā。真值表很简单：若 A = 0 则 Q = 1；若 A = 1 则 Q = 0。逻辑符号是一个三角形，尖端带一个小圆圈。

The AND gate returns 1 only when all inputs are 1. For two inputs A and B, Q = A AND B, commonly written as Q = A·B. The truth table has a single 1 when A = 1 and B = 1. The symbol is a D-shaped block with two inputs on the left and a rounded output on the right.

与门仅在所有输入均为 1 时输出 1。对于两个输入 A 和 B，Q = A AND B，常写作 Q = A·B。真值表中只有当 A 和 B 同时为 1 时，输出才为 1。符号是一个左边平直、右边弧形的 D 形块。

The OR gate returns 1 when at least one input is 1. Its Boolean expression is Q = A + B. The truth table has a 0 only when all inputs are 0. The symbol looks like a curved shield with two inputs and a pointed output.

或门只要至少有一个输入为 1，输出就是 1。布尔表达式为 Q = A + B。真值表中仅当所有输入为 0 时才输出 0。符号像一个带有弧形输入的盾形，末端尖角为输出。

3. Universal Gates: NAND and NOR | 通用门：与非门和或非门

The NAND gate is an AND gate followed by a NOT; its output is the negation of AND. For two inputs, Q = NOT (A AND B) = A·B with an overbar. The truth table is the exact opposite of AND—output is 1 for every combination except when both inputs are 1. NAND is called a universal gate because any other logic function can be constructed using only NAND gates. IB and CCEA exam questions frequently ask you to convert a circuit to a NAND-only implementation.

与非门是在与门后接一个非门，其输出是与运算的取反。对于两输入，Q = NOT (A AND B) = A·B 带上划线。真值表与与门完全相反——除两输入都为 1 时输出 0 外，其他组合输出均为 1。与非门被称为通用门，因为任何其他逻辑函数都可以仅用与非门构建。IB 和 CCEA 考试常要求你将电路转换为纯与非门实现。

The NOR gate is an OR gate followed by an inverter: Q = NOT (A OR B). Its truth table has a 1 only when all inputs are 0. Like NAND, NOR is also universal. You can build AND, OR, and NOT gates exclusively from NOR gates. This property allows real-world chip manufacturers to standardise on a single gate type to reduce production complexity.

或非门是在或门后加上反相器：Q = NOT (A OR B)。其真值表仅在所有输入为 0 时输出 1。与非门一样，或非门也是通用门，你可以只用或非门构造与门、或门和非门。这一特性使得芯片制造商可以标准化单一门类型来降低生产复杂度。

4. The Exclusive Gates: XOR and XNOR | 异或门与同或门

The XOR (exclusive OR) gate outputs 1 when an odd number of inputs are 1. For two inputs, Q = A ⊕ B, which is true when A and B are different. The truth table: 0⊕0=0, 0⊕1=1, 1⊕0=1, 1⊕1=0. XOR is essential in arithmetic circuits, parity checkers, and error-detection codes. The IB curriculum expects you to derive XOR from simpler gates, e.g., Q = (A + B) · (A·B)′, and to understand its role in the half adder.

异或门在输入中 1 的个数为奇数时输出 1。对两输入，Q = A ⊕ B，当 A 和 B 不相同时为真。真值表：0⊕0=0，0⊕1=1，1⊕0=1，1⊕1=0。异或门在算术电路、奇偶校验器和检错码中至关重要。IB 考纲要求你能用简单门推导出 XOR，例如 Q = (A + B) · (A·B)′，并理解它在半加器中的作用。

The XNOR (exclusive NOR) gate is the complement of XOR: Q = A ⊙ B. It outputs 1 when the inputs are equal. Often called the “equivalence” gate, XNOR produces a 1 when both inputs are 0 or both are 1. In digital design, XNOR is used to compare two bits for equality, making it a fundamental component in comparators.

同或门是异或门的补：Q = A ⊙ B。当输入相等时输出 1。常被称为“等价”门，当两个输入均为 0 或均为 1 时同或门输出 1。在数字设计中，同或门用来比较两个比特是否相等，是比较器的基本组成单元。

5. Truth Tables Construction and Interpretation | 真值表的构建与解读

A truth table lists all possible input combinations and the corresponding output for a given logic circuit. For a circuit with n inputs, the table has 2ⁿ rows. In IB and CCEA exams, you must be able to produce the truth table for a given Boolean expression or logic diagram, and vice versa. Start by labelling all inputs, then systematically enumerate binary values from 0 to 2ⁿ−1. Add intermediate columns if the expression contains subfunctions, and finally compute the output.

真值表列出给定逻辑电路所有可能的输入组合及对应输出。对一个 n 输入的电路，表中有 2ⁿ 行。在 IB 和 CCEA 考试中，你必须能够根据布尔表达式或逻辑图写出真值表，反之亦然。首先标注所有输入，然后系统地从 0 到 2ⁿ−1 枚举二进制值。如果表达式包含子函数，可添加中间列，最后计算出输出。

Example: for Q = (A·B) + (A⊕B), a three-column approach (A, B, Q) works. List rows (0,0), (0,1), (1,0), (1,1). Compute A·B, then A⊕B, finally OR them. The resulting output pattern identifies the function—here it is an OR gate in disguise. Examiners often expect you to recognise patterns: a truth table that matches a standard gate.

例如：对 Q = (A·B) + (A⊕B)，可以使用三列法（A、B、Q）。列出 (0,0)、(0,1)、(1,0)、(1,1) 行。计算 A·B，再计算 A⊕B，最后求或。输出模式揭示了函数本身——这里它实际上就是一个或门。阅卷人通常希望你能识别模式：真值表若与标准门匹配即可直接得出结论。

6. Boolean Expressions and Simplification | 布尔表达式与化简

Boolean expressions use variables (A, B, C…) and operators (·, +, ⊕, overbar for NOT) to describe logic circuits. In the IB and CCEA syllabi, you need to apply Boolean algebra laws to simplify expressions. Key identities include:

Identity: A+0=A, A·1=A
Null: A+1=1, A·0=0
Idempotent: A+A=A, A·A=A
Complement: A+Ā=1, A·Ā=0
Involution: A̿ = A
Distributive: A+(B·C)=(A+B)·(A+C)
Absorption: A+(A·B)=A, A·(A+B)=A

布尔表达式使用变量（A、B、C 等）和运算符（·、+、⊕、上划线表示非）来描述逻辑电路。在 IB 和 CCEA 考纲中，你需要运用布尔代数定律化简表达式。关键恒等式包括：同一律、零律、幂等律、互补律、双重否定律、分配律和吸收律。

Simplification reduces the number of gates needed, which saves cost and power. For example, Q = AB + AB̄ can be factored to A(B + B̄) = A·1 = A. Examiners love setting questions where a complicated-looking expression collapses to a single wire or a simple gate. Practice identifying common factor groups and using De Morgan’s laws to transform NAND/NOR logic into and out of sum-of-products form.

化简能够减少所需门的数量，从而降低成本与功耗。例如，Q = AB + AB̄ 可提取公因子得 A(B + B̄) = A·1 = A。考官特别喜欢出那种式子看似复杂，化到最后只剩一根导线或一个简单门的题。要多练习识别公因子组，并用德摩根定律将与非/或非逻辑转换为积之和形式或反过来。

7. De Morgan’s Laws and Their Applications | 德摩根定律及其应用

De Morgan’s laws provide a bridge between AND and OR operations under negation:

(A·B)′ = A′ + B′

(A + B)′ = A′ · B′

These are vital for converting circuits to all-NAND or all-NOR form, a common IB CCEA requirement. The first law states that the negation of a conjunction is the disjunction of the negations; the second states that the negation of a disjunction is the conjunction of the negations.

德摩根定律架起了取反操作下与逻辑和或逻辑的桥梁。它们对于将电路转换为全与非门或全或非门形式至关重要，这也是 IB 和 CCEA 的常见要求。第一条定律说合取的非等于析取的非之并；第二条说析取的非等于合取的非之交。

To apply De Morgan’s, break the overbar covering a product or sum, change the operator (· ↔ +), and invert the variables underneath. Example: (A·B + C)′ = (A·B)′ · C′ = (A′ + B′) · C′. Always keep the operation precedence in mind; use brackets to avoid mistakes. The IB mark scheme expects both algebraic manipulation and graphical gate conversion using these laws.

应用德摩根定律时，拆分长上划线覆盖的积或和，将运算符取反（· ↔ +），并将下方变量取反。例如：(A·B + C)′ = (A·B)′ · C′ = (A′ + B′) · C′。务必注意运算优先级，使用括号避免错误。IB 评分标准既要求代数化用，也要求能够用该定律进行图形化的门电路转换。

8. Logic Circuit Diagrams and Symbols | 逻辑电路图与符号

IB and CCEA examinations use standard IEC or ANSI gate symbols. You need to draw and interpret circuit diagrams accurately. Inputs are drawn on the left, outputs on the right. Each gate is represented by its distinctive shape. For instance, a NAND gate is an AND symbol with a small circle (inversion bubble) at the output. When adding or removing inversion bubbles, you must propagate the change through the circuit using De Morgan’s equivalences.

IB 和 CCEA 考试使用标准的 IEC 或 ANSI 门符号。你需要准确绘制和解读电路图。输入端画在左侧，输出端在右侧。每种门由其特有形状表示。例如，与非门是一个与门符号，输出端带一个小圆圈（反相泡）。添加或移除反相泡时，必须利用德摩根等价关系在整个电路中传播该变化。

A typical exam question may present a diagram with several interconnected gates and ask for the output Boolean expression, truth table, or a simplified equivalent circuit. Tracing signals through the diagram is a crucial skill. Label every wire with intermediate variables and write down the expression step by step. For circuits involving feedback (not in these syllabi) you would treat them separately, but combinatorial circuits are strictly acyclic.

典型的考题可能会给出一个包含若干互联门电路的图，要求写出输出布尔表达式、真值表或等效简化电路。在图中追踪信号是一项关键技能。给每条连线标出中间变量，逐步写下表达式。对于包含反馈的电路（不在此考纲内）需单独处理，但组合电路严格无环。

9. Building Combinational Logic Circuits | 组合逻辑电路设计

Combinational circuits are networks of logic gates where the output depends only on the current input values, with no memory. Common examples include multiplexers, decoders, encoders, and arithmetic circuits. IB and CCEA syllabi focus on the design process: starting from a problem statement, constructing a truth table, deriving the Boolean expression (often in sum-of-products form), and then drawing the gate-level implementation.

组合电路是由逻辑门组成的网络，其输出仅取决于当前输入值，没有存储功能。常见例子包括多路选择器、译码器、编码器和算术电路。IB 和 CCEA 考纲关注设计过程：从问题描述出发，构建真值表，推导布尔表达式（通常是积之和形式），然后画出门级实现。

The sum-of-products (SOP) method identifies every row in the truth table where the output is 1, creates a product term (AND) for each row using the input values, and then ORs all product terms together. For example, if the output is 1 for inputs (0,1) and (1,0), the SOP expression is ĀB + AB̄ — which is just an XOR gate. Minimisation using Boolean algebra or Karnaugh maps (K-maps) reduces the gate count.

积之和方法找出真值表中输出为 1 的每一行，为每一行生成一个乘积项（与项），然后将所有乘积项相或。例如，若输出在 (0,1) 和 (1,0) 时为 1，则 SOP 表达式为 ĀB + AB̄ —— 这正是一个异或门。使用布尔代数或卡诺图进行最小化可减少门数。

10. Half Adder and Full Adder | 半加器与全加器

The half adder is a fundamental combinational circuit that adds two single binary digits and produces a sum bit and a carry bit. The sum bit S = A ⊕ B; the carry bit C = A·B. Therefore a half adder consists of one XOR gate and one AND gate. It is called “half” because it does not handle a carry-in from a previous addition stage.

半加器是一种基本组合电路，它将两个单独二进制数字相加，产生和位与进位位。和位 S = A ⊕ B；进位位 C = A·B。因此，一个半加器由一个异或门和一个与门组成。之所以叫“半”加器，是因为它不处理来自前一级加法阶段的进位输入。

The full adder extends the half adder by also accepting a carry-in (Cᵢₙ). It has three inputs A, B, and Cᵢₙ, and two outputs: Sum S = A ⊕ B ⊕ Cᵢₙ; Carry-out Cₒᵤₜ = (A·B) + (Cᵢₙ·(A ⊕ B)). A full adder can be built using two half adders and an OR gate. Both IB and CCEA require you to draw the logic diagram and truth table for a full adder and to cascade them into multi-bit ripple-carry adders.

全加器在半加器的基础上增加了一个进位输入（Cᵢₙ）。它有三个输入 A、B 和 Cᵢₙ，两个输出：和 S = A ⊕ B ⊕ Cᵢₙ；进位输出 Cₒᵤₜ = (A·B) + (Cᵢₙ·(A ⊕ B))。一个全加器可以用两个半加器和一个或门构建。IB 和 CCEA 都要求你能画出全加器的逻辑图与真值表，并能将它们级联构成多位行波进位加法器。

11. Exam-Style Pitfalls and Tips | 应试易错点与技巧

Many students lose marks by confusing the symbols of NAND and NOR with AND and OR under negation. Remember: the inversion bubble changes the logic function entirely. When drawing, clearly place the bubble at the correct gate output or input. In IB papers, sloppy diagramming can lead to ambiguity and lost marks. Use a ruler and follow the symbol conventions given in the syllabus guide.

许多学生因混淆与非门、或非门与带有取反的与门、或门而失分。记住：反相泡完全改变了逻辑功能。作图时，要清晰地把反相泡放在正确的门输出或输入端。在 IB 试卷中，潦草的图可能造成歧义并扣分。要用尺子作图，并遵循考纲指南中的符号约定。

Another common mistake is misapplying De Morgan’s laws when a long bar covers an expression. Always add parentheses around the expression under the bar before flipping operators. For example, the complement of A·B + C is NOT applied to the sum, so it becomes (A·B + C)′. Without brackets, you risk changing the order of operations, producing an incorrect result. Practise with expressions of increasing complexity until the process becomes automatic.

另一个常见错误是当长上划线覆盖整个表达式时，错用德摩根定律。务必在交换运算符之前，将上划线下方的表达式用括号括起来。例如，A·B + C 的补是对整个和取反，所以变成 (A·B + C)′。不加括号就可能改变运算顺序，导致错误结果。要不断练习复杂度递进的表达式，直到这一过程成为本能。

Time management: In CCEA structured questions, you are expected to draw a truth table, simplify, and draw the final circuit. Start by identifying the number of inputs so you know the table size. Show intermediate steps to gain method marks. When checking your answer, verify the two circuits (before and after simplification) produce identical truth tables.

时间管理：在 CCEA 的结构化问答题中，你需要画真值表、化简并画出最终电路。开始时先确定输入数量以明确表格规模。展示中间步骤以获取方法分。检查答案时，验证化简前后两个电路产生完全相同的真值表。

12. Summary and Further Study | 总结与延伸学习

Logic gates are not just theoretical constructs; they are the actual hardware components that execute every instruction in your computer. Mastering the seven basic gates, truth table construction, Boolean simplification, De Morgan’s laws, and adder circuits gives you the foundation to tackle any IB or CCEA logic question with confidence. As you progress to more advanced topics such as sequential circuits, flip-flops, and finite state machines, these fundamental skills will remain essential.

逻辑门不仅仅是理论构造，它们是计算机中执行每一条指令的真实硬件组件。掌握七种基本门、真值表构建、布尔化简、德摩根定律以及加法器电路，能让你自信地应对任何 IB 或 CCEA 逻辑题。随着你进阶到更深入的主题，如时序电路、触发器和有限状态机，这些基本技能仍将是不可或缺的基石。

For revision, create a one-page “gate cheat sheet” with symbols, Boolean expressions, and truth tables. Use past-paper questions to practise simplifying circuits to NAND-only or NOR-only forms. Remember that the underlying principles remain the same regardless of the gate notation chosen by your exam board. Keep your work neat, systematic, and always verify your truth table against the original specification.

复习时，制作一页“逻辑门速查表”，涵盖符号、布尔表达式和真值表。用往年真题练习将电路化简为纯与非门或纯或非门形式。请记住，无论你的考试局使用何种门符号，基本原理是不变的。保持卷面整洁、规范，时刻对照最初的设计要求检查真值表。

Published by TutorHao | Computer Science Revision Series | aleveler.com

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

IB & CCEA Computer Science: Logic Gates Essentials | IB CCEA 计算机：逻辑门 考点精讲