快速傅立叶变换算法 meaning in Chinese
algorithm fast fourier transform
algorithm, fast fourier transform
Examples
- The binary fat tree is a network topology which is prone to accomplish butterfly computing . according to this feature , a logical model for binary fat tree was constructed at first , and then a parallel fast fourier transform algorithm based on it was devel . .
二叉胖树网络结构是一种易于实现蝶式计算的网络拓扑结构，基于这一特点，首先构造了一种二叉胖树的逻辑模型，并提出了一种基于该模型的并行快速傅立叶变换算法。 - In chapter 4 we discuss the design of the high speed and high performance vlsi and its imp1ementation , firstly we ana1yze and compare the features and ru1es of al1 kinds of fft algorithm , adopt complex radix 4 butterfly calcu1ation as basic alu , then discuss all kinds of process architectures , the design thoughts , rule , method , technique way , the characteristics of the design are r4 dit algorithm , pingpong ram design method and pipeline structure between stages . we also analyze the limited word length effect and the method to avoid overflow of the fixed points fft process , bring out the expandable platform mode
第四章主要讨论了高速高性能的快速傅立叶变换处理器的设计和实现，首先分析和比较了各种快速傅立叶变换算法的特性和规律，提出基4蝶算的算法具有最好的性价比，讨论了顺序、级联、并行和阵列的处理结构，阐述了设计高速高性能快速傅立叶变换处理器时的设计原则、设计思路、所采用的技术路线，验证并测试fft处理器，分析了定点fft处理过程由于有限字长效应所产生的量化误差的范围及防溢出控制办法，提出了可扩展平台模式。