📚 Exponential Fourier Transforms and Rules | 指数型傅里叶变换及其规则
The exponential Fourier transform provides a compact, unified framework for analysing signals and systems in the frequency domain. By expressing sinusoids via Euler's formula, the transform replaces real trigonometric functions with complex exponentials. This simplifies the derivation of operational rules and reveals deep symmetries that are less obvious in cosine/sine representations. In IB-level mathematics and beyond, mastering the exponential form is essential for solving differential equations, filtering, and signal processing.
指数型傅里叶变换为在频域中分析信号与系统提供了一个紧凑而统一的框架。通过欧拉公式将正弦波表示为复指数,变换用复指数替代了实的三角函数。这大大简化了运算规则的推导过程,并揭示出在余弦/正弦表示下不太明显的深层对称性。在 IB 级别及更高的数学中,掌握指数形式对于求解微分方程、滤波和信号处理至关重要。
1. From Trigonometric Series to Exponential Form | 从三角级数到指数形式
n be written as a Fourier series: f(t) = a₀ + Σ (aₙ cos(nω₀t) + bₙ sin(nω₀t)). Using Euler' e coefficients cₙ are complex numbers. This idea extends naturally to non-periodic signals, replacing the sum by an integral – giving the exponential Fourier transform.
实周期函数可以写成傅里叶级数:f(t) = a₀ + Σ (aₙ cos(nω₀t) + bₙ sin(nω₀t))。利用欧拉恒等式 cosθ = (eⁱθ + e⁻ⁱθ)/2 和 sinθ = (eⁱθ − e⁻ⁱθ)/(2i),每个谐波都可以表示为复指数之和。合并项后便得到紧凑的指数傅里叶级数:f(t) = Σ cₙ eⁱⁿω₀t,其中系数 cₙ 为复数。这一思想自然地推广到非周期信号,将求和替换为积分——从而导出指数型傅里叶变换。
2. The Fourier Transform Pair – Definitions | 傅里叶变换对——定义
For a function f(t) defined on the real line, the exponential Fourier transform and its inverse are defined as:
F(ω) = ∫∞−∞ f(t) e−iωt dt (Forward transform)
f(t) = (1/(2π)) ∫∞−∞ F(ω) eiωt dω (Inverse transform)
对于定义在实直线上的函数 f(t),指数型傅里叶变换及其逆变换定义如上。
Here ω is angular frequency, and i is the imaginary unit. The forward transform decomposes f(t) into a continuous spectrum F(ω) of complex exponentials; the inverse synthesises f(t) from those frequency components. The pair is often denoted by f(t) ↔ F(ω). These definitions are the backbone of all subsequent rules.
其中 ω 是角频率,i 是虚数单位。正变换将 f(t) 分解为复指数 e⁻ⁱωt 的连续谱 F(ω);逆变换则从这些频率成分中合成 f(t)。这一对变换常记作 f(t) ↔ F(ω)。这两个定义是所有后续规则的基础。
3. Linearity | 线性性质
The Fourier transform is a linear operator. If f(t) ↔ F(ω) and g(t) ↔ G(ω), then for any constants a and b:
a f(t) + b g(t) ↔ a F(ω) + b G(ω)
傅里叶变换是线性算子。若 f(t) ↔ F(ω) 且 g(t) ↔ G(ω),则对任意常数 a 和 b 有上式成立。
Linearity allows us to decompose a complicated signal into simpler parts, transform them individually, and sum the results. It is used constantly when applying superposition in circuits, wave optics, and control systems.
线性性质允许我们将复杂信号分解为若干简单部分,分别变换后再求和。在电路、波动光学和控制系统中应用叠加原理时,这一性质会经常使用。
4. Time Shifting | 时移性质
A shift in the time domain introduces a phase factor in the frequency domain:
f(t − t₀) ↔ F(ω) e−iω t₀
时域中的平移会在频域中引入一个相位因子:f(t − t₀) ↔ F(ω) e−iω t₀。
This rule follows directly from a change of variable in the integral. The magnitude spectrum |F(ω)| remains unchanged – only the phase is modified. Time shifting is crucial when aligning signals, modelling delays, and understanding the phase response of filters.
该规则可直接由积分变量代换得出。幅度谱 |F(ω)| 保持不变,仅相位发生改变。时移性质在对齐信号、建模延迟和理解滤波器相位响应时至关重要。
5. Frequency Shifting (Modulation) | 频移性质(调制)
Multiplying a time function by a complex exponential shifts its spectrum:
f(t) eiω₀ t ↔ F(ω − ω₀)
将时域函数乘以复指数会使频谱发生平移:f(t) eiω₀ t ↔ F(ω − ω₀)。
In practice, modulation by a real cosine produces two shifted copies: f(t) cos(ω₀t) ↔ ½ [F(ω − ω₀) + F(ω + ω₀)]. This is the mathematical basis of amplitude modulation (AM) and the reason why radio signals are shifted to a carrier frequency.
在实际中,用实余弦进行调制会产生两个平移副本:f(t) cos(ω₀t) ↔ ½ [F(ω − ω₀) + F(ω + ω₀)]。这是幅度调制(AM)的数学基础,也是无线电信号被搬移到载波频率上的原因。
6. Time Scaling | 时间缩放
Compressing a signal in time expands its spectrum in frequency, and vice versa:
f(at) ↔ (1/|a|) F(ω/a) for a ≠ 0
在时域中压缩信号会导致其频谱在频域中展宽,反之亦然:f(at) ↔ (1/|a|) F(ω/a),其中 a ≠ 0。
The factor 1/|a| preserves energy. If |a| > 1, the function is squeezed in time; its Fourier transform stretches in ω and its amplitude decreases. This inverse relation between time duration and bandwidth is a fundamental trade-off in signal processing.
因子 1/|a| 用于保持能量。若 |a| > 1,函数在时间上被压缩,其傅里叶变换在 ω 方向上拉伸且幅度降低。这种时间持续性与带宽之间的反比关系是信号处理中的基本权衡。
7. Differentiation in Time | 时域微分
Differentiation in the time domain corresponds to multiplication by iω in the frequency domain, assuming the transform exists:
f '(t) ↔ iω F(ω)
若变换存在,时域中的微分对应于频域中乘以 iω:f '(t) ↔ iω F(ω)。
Higher derivatives follow by repeated multiplication: f ⁽ⁿ⁾(t) ↔ (iω)ⁿ F(ω). This property converts differential equations into algebraic equations, greatly simplifying their solution. It is one of the most practical reasons for using the exponential Fourier transform in engineering mathematics.
高阶微分通过重复相乘得到:f ⁽ⁿ⁾(t) ↔ (iω)ⁿ F(ω)。这一性质可将微分方程转化为代数方程,大大简化求解过程。这是在工程数学中使用指数型傅里叶变换最实用的原因之一。
8. Integration in Time | 时域积分
Integrating a time function introduces a frequency-domain factor 1/(iω) plus an impulsive term accounting for the DC component:
∫t−∞ f(τ) dτ ↔ (1/(iω)) F(ω) + π F(0) δ(ω)
时域积分在频域中产生因子 1/(iω) 并附加一个反映直流分量的冲激项:∫t−∞ f(τ) dτ ↔ (1/(iω)) F(ω) + π F(0) δ(ω),其中 δ(ω) 是狄拉克 δ 函数。
signals that have a nonzero mean. The impulse at ω = 0 ensures that the integrated signal' ions include charge and flux calculations from current and voltage in electrical circuits.
当处理具有非零均值的信号时,该规则非常重要。ω = 0 处的冲激确保了积分后信号的平均值被正确地表示。应用实例包括根据电路中的电流和电压计算电荷与磁通量。
9. Convolution Theorem | 卷积定理
Convolution in the time domain becomes a simple product in the frequency domain, and vice versa:
(f * g)(t) ↔ F(ω) G(ω)
f(t) g(t) ↔ (1/(2π)) (F * G)(ω)
时域卷积变成频域的简单乘积,反之亦然:(f * g)(t) ↔ F(ω) G(ω);f(t) g(t) ↔ (1/(2π)) (F * G)(ω)。
The convolution theorem lies at the heart of linear system theory: the output of a filter is the convolution of the input with its impulse response; in the frequency domain this is the product of the input spectrum and the filter's transfer function. It also underpins fast convolution algorithms using FFTs.
卷积定理是线性系统理论的核心:滤波器的输出等于输入与其冲激响应的卷积;在频域,这表现为输入频谱与滤波器传递函数的乘积。它也是基于 FFT 的快速卷积算法的基础。
10. Symmetry and Duality | 对称性与对偶性
conjugate). Moreover, the transform is nearly self-dual: if f(t) ↔ F(ω), then F(t) ↔ 2π f(−ω). This duality allows us to deduce new transform pairs directly from known ones.
指数型傅里叶变换展现出显著的对称性。若 f(t) 为实函数,则 F(−ω) = F*(ω)(复共轭)。此外,该变换几乎是自对偶的:若 f(t) ↔ F(ω),则 F(t) ↔ 2π f(−ω)。这种对偶性使得我们可以直接从已知变换对推断出新的变换对。
For example, knowing that a rectangular pulse transforms to a sinc function, the duality principle immediately tells us that a sinc time signal transforms to a rectangular frequency window. This elegance is a direct consequence of the exponential kernel.
例如,已知矩形脉冲变换为 sinc 函数,对偶原理立刻告诉我们,sinc 时间信号会变换为矩形频率窗。这种简洁优雅正是指数核带来的直接结果。
11. Parseval's Theorem – Energy Conservation | 帕塞瓦尔定理——能量守恒
The exponential Fourier transform preserves energy up to a factor of 2π:
∫∞−∞ |f(t)|² dt = (1/(2π)) ∫∞−∞ |F(ω)|² dω
指数型傅里叶变换在相差因子 2π 的意义下保持能量不变:∫|f(t)|² dt = (1/(2π)) ∫|F(ω)|² dω。
Parseval's theorem is a powerful tool for computing integrals and checking transform correctness. It states that the total energy calculated in the time domain equals the total energy in the frequency domain (appropriately scaled). This principle is used in spectral analysis, optics, and quantum mechanics.
帕塞瓦尔定理是计算积分和检验变换正确性的有力工具。它表明在时域中计算的总能量等于频域中的总能量(经过适当缩放)。该原理被用于频谱分析、光学和量子力学中。
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022(同微信)

或截图后用「扫一扫 → 相册」选择本图