| 注册
首页|期刊导航|信息与电子工程|一种旋转因子访存优化的FFT算法

一种旋转因子访存优化的FFT算法

王非非 杜伟韬

信息与电子工程2011,Vol.9Issue(2):206-210,5.
信息与电子工程2011,Vol.9Issue(2):206-210,5.

一种旋转因子访存优化的FFT算法

Optimized design of memory access for twiddle factors in FFT algorithm

王非非 1杜伟韬1

作者信息

  • 1. 中国传媒大学,广播电视数字化教育部工程研究中心,北京,100024
  • 折叠

摘要

Abstract

In order to run Fast Fourier Transform(FFT) algorithm more efficiently in embedded devices. an optimized design of twiddle factors for the small Cache was presented. The design can effectively enhance read-percent cache hits and improve processing speed. The selection principle of configuration parameters in different needs was given and the experimental results based on typical configuration parameters and target processor were discussed. It is proved that this optimized method can effectively improve processing speed with slight Signal to Noise Ratio(SNR) decrease.

关键词

嵌入式/快速傅里叶变换/旋转因子/泰勒插值/高速缓冲存储器

Key words

embedded/ Fast Fourier Transform/ twiddle factor/ Taylor interpolation/ Cache

分类

信息技术与安全科学

引用本文复制引用

王非非,杜伟韬..一种旋转因子访存优化的FFT算法[J].信息与电子工程,2011,9(2):206-210,5.

基金项目

教育部科技重点基金资助项目(108022) (108022)

信息与电子工程

OACSTPCD

2095-4980

访问量0
|
下载量0
段落导航相关论文