快速傅立叶变换及应用_本科毕业论文.doc

毕业(设计)论文 题 目 快速傅里叶变换及其应用 学生姓名 辛鹏宇 专业班级 R计算081班 所在院系　　 　 　理 学 院　　　　　 指导教师 职 称　副教授 所在单位 理 学 院 　 教研室主任　　　　　　 　　　　 完成日期 2013 年6月18日 摘 要 快速傅氏变换（FFT），是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。,由于计算机只能处理有限长度的离散的序列,所以真正在计算机上运算的是一种离散傅里叶变换。　 快速傅氏变换ABSTRACT Fast Fourier Transform (FFT), is a discrete fast Fourier transform algorithm, which is based on the Discrete Fourier Transform of odd and even, false, false, and other characteristics of the Discrete Fourier Transform algorithms improvements obtained. Its Fourier transform theory has not found a new, but in the computer system or the application of digital systems Discrete Fourier Transform can be said to be a big step into. Fourier transform theory and methods in the mathematical equation and linear systems analysis and signal processing, simulation, and many other areas have a wide range of applications, as the computer can only handle a limited length of the sequence of discrete, so true On the computers operation is a discrete Fourier transform. Fourier Although all aspects of computing in the calculation has an important role, but its calculation was too complicated, a lot of computing system for calculating the burden is too large for some Less power consumption, the slow speed of operation of its system at arms length, however, have the fast Fourier transform, Fourier transform greatly simplifying the making, not in power at the expense of the conditions to increase the speed of computing systems, and enhance the system The comprehensive ability to improve the speed of operation, the Fast Fourier Transform in the production and life have a very important role in learning to master all have great significance. Key Words： Fast Fourier Transform; fast algorithm; simplified; widely used目 录 一、快速傅里叶变换原理及性质 1 （一）快速傅里叶变换原理 1 （二）快速傅里叶变换的优越性 1 （三）快速傅里叶变换的意义 2 二、快速傅里叶变换的算法 4 （一）快速傅里叶变换算法 4 三、快速傅里叶变换