← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

30 第30章 多项式与快速傅里叶变换

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.755Z

. The most common use for Fourier transforms, and hence the FFT, is in signal processing.

A signal is given in the time domain: as a function mapping time to amplitude. Fourier analysis expresses the signal as a weighted sum of phase-shifted sinusoids of varying frequencies. The weights and phases associated with the frequencies characterize the signal in the frequency domain. Among the many everyday applications of FFT’s are compression

techniques used to encode digital video and audio information, including MP3 files. Many

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea