首页> 外国专利> FAST FOURIER TRANSFORM/INVERSE FAST FOURIER TRANSFORM APPARATUS AND A METHOD THEREOF, USING ONE MEMORY WITH AN ADDRESS CORRESPONDING THE NUMBER OF DATA TO BE FOURIER TRANSFORMED

FAST FOURIER TRANSFORM/INVERSE FAST FOURIER TRANSFORM APPARATUS AND A METHOD THEREOF, USING ONE MEMORY WITH AN ADDRESS CORRESPONDING THE NUMBER OF DATA TO BE FOURIER TRANSFORMED

机译:快速傅里叶变换/逆快速傅里叶变换设备及其方法,使用一种具有对应于要进行傅里叶变换的数据数量的地址的存储器

摘要

PURPOSE: A fast fourier transform/inverse fast fourier transform apparatus and a method thereof are provided to improve a computing speed by performing a distributed calculation operation through a Cooley-Tukey algorithm.;CONSTITUTION: A storage unit(200) includes a number of addresses which correspond to a number of data bits. A first Fourier transformer(110) successively stores half of the data in the storage unit. A second Fourier transformer(120) performs a second point of fast Fourier transformation/inverse fast Fourier transformation of the data, which has undergone a first point of fast Fourier transformation and has been stored. A third Fourier transformer(130) performs a third point of fast Fourier transformation/inverse fast Fourier transformation of the data, which has been transformed by the second Fourier transformer. An output unit(140) outputs the data stored in the storage based on an order using a Cooley-Tukey algorithm.;COPYRIGHT KIPO 2010
机译:目的:提供一种快速傅里叶变换/逆快速傅里叶变换设备及其方法,以通过通过Cooley-Tukey算法执行分布式计算操作来提高计算速度。;组成:存储单元(200)包括多个地址对应于许多数据位。第一傅立叶变换器(110)将一半的数据相继存储在存储单元中。第二傅里叶变换器(120)对数据执行快速傅里叶变换/逆快速傅里叶逆变换的第二点,该第二点已经经历了快速傅里叶变换的第一点并且已经被存储。第三傅立叶变换器(130)对数据进行快速傅立叶变换/逆快速傅立叶变换的第三点,该数据已经由第二傅立叶变换器变换。输出单元(140)使用Cooley-Tukey算法基于顺序输出存储在存储器中的数据。COPYRIGHTKIPO 2010

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号