📚 The z Transform | z变换
The z transform is a powerful mathematical tool that converts a discrete-time sequence into a complex frequency domain representation. In IB higher‑level mathematics, it serves as an extension of generating functions and provides an elegant way to handle difference equations, signal processing, and systems analysis. By mapping a sequence x[n] to a function X(z), we can analyse stability, causality, and frequency response using algebraic methods, much like the Laplace transform does for continuous signals. This article systematically explores the definition, properties, inversion methods, and applications of the z transform, offering a rigorous yet accessible revision path for students aiming to master discrete‑time systems.
z 变换是一种强大的数学工具，能够将离散时间序列变换到复频域中。在 IB 高等级数学中，它是生成函数的延伸，并为处理差分方程、信号处理和系统分析提供了优雅的方法。通过将序列 x[n] 映射为函数 X(z)，我们可以像处理连续信号的拉普拉斯变换一样，使用代数手段分析系统的稳定性、因果性和频率响应。本文系统梳理了 z 变换的定义、性质、逆变换方法以及实际应用，为希望掌握离散时间系统的学生提供了一组严谨而易于理解的复习内容。
1. Introduction to the z Transform | z变换简介
The z transform arises naturally when studying discrete sequences. It generalizes the Fourier transform for sequences that may not have a convergent frequency spectrum and is especially useful in solving linear constant‑coefficient difference equations. In engineering and applied mathematics, the z transform plays a role analogous to the Laplace transform for continuous‑time signals, making it a bridge between the discrete and continuous worlds.
z 变换在研究离散序列时自然出现。它把傅里叶变换推广到可能不具备收敛频谱的序列，并且在求解线性常系数差分方程时尤其有用。在工程和应用数学中，z 变换起到了与连续时间信号中的拉普拉斯变换类似的角色，成为连接离散与连续世界的桥梁。
2. Definition and Notation | 定义与符号
Given a discrete‑time sequence x[n], where n ∈ ℤ, the bilateral (or two‑ sform is defined by the sum X(z) = Σₙ x[n] z⁻ⁿ, with the sum taken over all integer n from – expression only makes sense for values of z where the series converges. For practical one‑sided problems, we often use the unilateral z transform: X(z) = Σₙ₌₀∞ ] z⁻ⁿ, which assumes x[n] = 0 for n < 0. The transform is denoted by the pair x[n] ↔ X(z).
给定一个离散时间序列 x[n]，其中 n 取所有整数，双边 z 变换定义为 X(z) = Σₙ x[n] z⁻ⁿ，求和遍及 n 从 –∞ 到 ∞。变量 z 是复数，该级数只在使序列收敛的 z 值上有意义。在实际的单边问题中，我们通常使用单边 z 变换：X(z) = Σₙ₌₀∞ x[n] z⁻ⁿ，它假设 n < 0 时 x[n] = 0。这组变换对记作 x[n] ↔ X(z)。
3. Region of Convergence (ROC) | 收敛域
The region of convergence is the set of complex numbers z for which the infinite sum converges absolutely. The ROC is essential because the same algebraic form X(z) can correspond to different sequences depending on the ROC. For a right‑sided sequence, the ROC is typically the exterior of a circle |z| > R. For a left‑sided sequence, it is the interior |z| < R, and for a two‑sided sequence, the ROC is an annulus R₁ < |z| < R₂. Knowing the ROC allows us to uniquely identify the original sequence.
收敛域是使得无穷级数绝对收敛的复数 z 的集合。收敛域至关重要，因为相同的代数表达式 X(z) 根据收敛域的不同可能对应不同的序列。对于右边序列，收敛域通常是某个圆的外部 |z| > R；对于左边序列，则是圆的内部 |z| < R；对于双边序列，收敛域为一个圆环 R₁ < |z| < R₂。掌握收敛域可以唯一确定原序列。
4. Common z Transform Pairs | 常见z变换对
Several fundamental pairs appear frequently. The unit impulse δ[n] has transform δ[n] ↔ 1 (ROC: all z). The unit step u[n] gives u[n] ↔ 1/(1 – z⁻¹), |z| > 1. The exponential sequence aⁿ u[n] yields aⁿ u[n] ↔ 1/(1 – az⁻¹), |z| > |a|. A ramp sequence n u[n] has transform n u[n] ↔ z⁻¹/(1 – z⁻¹)². These standard pairs serve as building blocks for more complex signals.
一些基本变换对频繁出现。单位冲激 δ[n] 的变换是 δ[n] ↔ 1（收敛域：所有 z）。单位阶跃 u[n] 给出 u[n] ↔ 1/(1 – z⁻¹)， |z| > 1。指数序列 aⁿ u[n] 对应 aⁿ u[n] ↔ 1/(1 – az⁻¹)， |z| > |a|。斜坡序列 n u[n] 的变换为 n u[n] ↔ z⁻¹/(1 – z⁻¹)²。这些标准变换对是处理更复杂信号的积木。
5. Linearity Property | 线性性质
The z transform is linear: if x₁[n] ↔ X₁(z) with ROC R₁ and x₂[n] ↔ X₂(z) with ROC R₂, then a·x₁[n] + b·x₂[n] ↔ a·X₁(z) + b·X₂(z), and the ROC is at least the intersection of R₁ and R₂. This property allows us to decompose a complex sequence into a sum of simpler ones whose transforms are already known. When applying linearity, be careful that the combined ROC may be larger if pole‑zero cancellations occur.
z 变换是线性的：若 x₁[n] ↔ X₁(z)，收敛域为 R₁，且 x₂[n] ↔ X₂(z)，收敛域为 R₂，则有 a·x₁[n] + b·x₂[n] ↔ a·X₁(z) + b·X₂(z)，收敛域至少是 R₁ 与 R₂ 的交集。这一性质使我们可以将复杂序列分解为几个已知变换的简单序列之和。应用线性性质时需注意，如果发生零极点对消，组合收敛域可能比交集更大。
6. Time Shifting Property | 时移性质
a power of z in the transform domain. For a sequence x[n] with transform X(z), we have x[n – operty is extremely handy when solving difference equations because it transforms delayed terms into algebraic expressions involving z⁻ᵏ.
序列在时域中的平移对应于变换域内乘以 z 的幂。若序列 x[n] 的变换为 X(z)，则有 x[n – k] ↔ z⁻ᵏ X(z)，前提是考虑收敛域（边界基本不变，但在 z = 0 或 z = ∞ 处可能例外）。这一性质在求解差分方程时极其有用，因为它将延迟项转化为含有 z⁻ᵏ 的代数表达式。
7. Convolution Property | 卷积性质
in the z domain. If x₁[n] ↔ X₁(z) and x₂[n] ↔ X₂(z), then the convolution sum y[n] = x₁[n] ∗ onse of a linear system to any input by simply multiplying the input’s z transform by the system’s transfer function H(z).
时域卷积对应于 z 域相乘。若 x₁[n] ↔ X₁(z) 且 x₂[n] ↔ X₂(z)，则卷积和 y[n] = x₁[n] ∗ x₂[n] 的变换为 Y(z) = X₁(z) · X₂(z)，其收敛域包含各自收敛域的交集。利用这一性质，我们可以通过简单地将输入信号的 z 变换乘以系统的传递函数 H(z) 来获取线性系统对任意输入的响应。
8. Inverse z Transform Methods | 逆z变换方法
he most common approach for rational functions. The contour integration method uses the inverse transform formula x[n] = (1/2πj) ∮ the ROC. Choosing the appropriate method depends on the form of X(z) and the desired ROC.
从 X(z) 恢复 x[n] 有多种方法。幂级数法将 X(z) 展开为 z⁻¹ 的洛朗级数，系数直接给出 x[n]。部分分式分解法把 X(z) 拆分为几个简单分式，利用标准变换对逐个求逆变换，这是处理有理函数最常用的方法。围线积分法使用逆变换公式 x[n] = (1/2πj) ∮ X(z) zⁿ⁻¹ dz，积分路径为收敛域内的闭合围线。选择哪种方法取决于 X(z) 的形式和指定的收敛域。
9. Solving Difference Equations | 求解差分方程
A linear constant‑coefficient difference equation of the form ∑ₖ₌₀ᴺ aₖ y[n–k] = ∑ₘ₌₀ᴹ bₘ x[n– lved systematically using the z transform. Apply the transform to both sides, use the time‑ ns a recurrence relation into an algebraic problem, making it much easier to handle higher‑order equations.
形如 ∑ₖ₌₀ᴺ aₖ y[n–k] = ∑ₘ₌₀ᴹ bₘ x[n–m] 的线性常系数差分方程可以通过 z 变换系统求解。对方程两边施加变换，利用时移性质，解出用 X(z) 和初始条件表示的 Y(z)，再通过逆 z 变换得到 y[n]。这种方法将递推关系转化为代数问题，使得处理高阶方程变得容易很多。
10. Relationship with the Laplace Transform | 与拉普拉斯变换的关系
The z transform can be viewed as the Laplace transform of a sampled continuous‑ e bilinear approximation, this leads to practical digital filter design methods such as the Tustin transformation. Understanding the s‑plane to z‑ predict how poles and zeros evolve when converting between analogue and discrete systems.
z 变换可以看作对连续时间信号采样后的拉普拉斯变换。如果以间隔 T 对连续信号 x(t) 采样得到 x[n] = x(nT)，那么两者间的关系由映射 s = (1/T) ln z 给出。在双线性近似下，这就引出了实用的数字滤波器设计方法，例如塔斯汀变换。理解 s 平面到 z 平面的映射有助于预测极点和零点在模拟与离散系统转换时的变化。
11. Applications in Signal Processing | 信号处理中的应用
ility (poles inside the unit circle), causality (ROC extends outward from the largest pole), and frequency response (evaluate H(z) on the unit circle |z|=1 → H(ejω)). It also forms the basis for real‑time discrete‑time simulation and control systems.
在数字信号处理中，z 变换是设计分析有限冲激响应（FIR）和无限冲激响应（IIR）滤波器的基础。系统函数 H(z) = Y(z)/X(z) 决定了稳定性（极点位于单位圆内）、因果性（收敛域从最外层极点向外延展）以及频率响应（在单位圆 |z|=1 上计算 H(z) 得到 H(ejω)）。此外，它也是实时离散时间仿真和控制系统的基础。
12. Summary | 总结
The z transform is an indispensable tool for anyone studying discrete‑time systems. By converting sequences into algebraic functions, it simplifies the analysis of convolutions, difference equations, and system responses. Mastering its definition, ROC interpretation, key properties, and inversion techniques opens the door to more advanced topics in signal processing, control theory, and applied mathematics. Regular practice with standard transform pairs and difference equation problems will build the fluency needed for examinations and real‑world applications.
对于任何研究离散时间系统的人来说，z 变换都是一件不可或缺的工具。它通过将序列转化为代数函数，简化了卷积、差分方程和系统响应的分析。掌握其定义、收敛域解读、关键性质和逆变换技术，就为信号处理、控制理论和应用数学中更深入的主题打开了大门。通过反复练习标准变换对与差分方程问题，可以建立起应试和实际应用所需的熟练度。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图